ppxscal/embedding_network huggingface dataset:
Blind Image Restoration Using Improved APEX Method with Pre-denoising
Authors: Jianlin Zhang, Qiheng Zhang
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Loss of image quality due to degradation has seriously bad effect on the post-analyzing and post-processing of image. Blind restoration of degraded image is usually required to improve the image quality, for the reason that the degradation is partially or completely unknown in many practical situations. Commonly, using the APEX method can effectively accomplish the blind restoration when a significant class of degradation (Lévy stable processes) is considered, but noise is unexpectedly amplified in the process. In this paper, a novel method is proposed to both suppress the noise effect and improve the image quality. The performance of the method is investigated with experiments on real degraded images. The noniterative property of this method makes its application and implementation in real-time image processing systems be easy.
Uniprocessor scheduling under precedence constraints for embedded systems design
Authors: Leonardo Mangeruca, Massimo Baleani, Alberto Ferrari, Alberto Sangiovanni-Vincentelli
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2007)

In this paper, we present a novel approach to the constrained scheduling problem, while addressing a more general class of constraints that arise from the timing requirements on real-time embedded controllers. We provide general necessary and sufficient conditions for scheduling under precedence constraints and derive sufficient conditions for two well-known scheduling policies. We define mathematical problems that provide optimum priority and deadline assignments, while ensuring both precedence constraints and system's schedulability. We show how these problems can be relaxed to corresponding integer linear programming (ILP) formulations leveraging on available solvers. The results are demonstrated on a real design case.
Low-power clock branch sharing double-edge triggered flip-flop
Authors: Peiyi Zhao, Jason McNeely, Pradeep Golconda, Magdy A. Bayoumi, Robert A. Barcenas, Weidong Kuang
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

In this paper, a new technique for implementing low-energy double-edge triggered flip-flops is introduced. The new technique employs a clock branch-sharing scheme to reduce the number of clocked transistors in the design. The newly proposed design also employs conditional discharge and split-path techniques to further reduce switching activity and short-circuit currents, respectively. As compared to the other state of the art double-edge triggered flip-flop designs, the newly proposed CBS_ip design has an improvement of up to 20% and 12.4% in view of power consumption and PDP, respectively.
Synthesis of Reversible Sequential Elements
Authors: Min-Lun Chuang, Chun-Yao Wang
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

To construct a reversible sequential circuit, reversible sequential elements are required. This work presents novel designs of reversible sequential elements such as D latch, JK latch, and T latch. Based on these reversible latches, we also construct the designs of the corresponding flip-flops. Comparing with previous work, the implementation cost of our new designs, including the number of gates and the number of garbage outputs is considerably reduced.
A Memory-Balanced Linear Pipeline Architecture for Trie-based IP Lookup
Authors: Weirong Jiang, Viktor K. Prasanna
Venue: Proceedings of the 15th Annual IEEE Symposium on High-Performance Interconnects (2007)

Rapid growth in network link rates poses a strong demand on high speed IP lookup engines. Trie-based architectures are natural candidates for pipelined implementation to provide high throughput. However, simply mapping a trie level onto a pipeline stage results in unbalanced memory distribution over different stages. To address this problem, several novel pipelined architectures have been proposed. But their non-linear pipeline structure results in some new performance issues such as throughput degradation and delay variation. In this paper, we propose a simple and effective linear pipeline architecture for trie-based IP lookup. Our architecture achieves evenly distributed memory while realizing high throughput of one lookup per clock cycle. It offersmore freedom in mapping trie nodes to pipeline stages by supporting nops. We implement our design as well as the state-of-the-art solutions on a commodity FPGA and evaluate their performance. Post place and route results show that our design can achieve a throughput of 80 Gbps, up to twice the throughput of reference solutions. It has constant delay, maintains input order, and supports incremental route updates without disrupting the ongoing IP lookup operations.
Enhancing P2P file-sharing with an internet-scale query processor
Authors: Boon Thau Loo, Joseph M. Hellerstein, Ryan Huebsch, Scott Shenker, Ion Stoica
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

In this paper, we address the problem of designing a scalable, accurate query processor for peer-to-peer filesharing and similar distributed keyword search systems. Using a globally-distributed monitoring infrastructure, we perform an extensive study of the Gnutella filesharing network, characterizing its topology, data and query workloads. We observe that Gnutella's query processing approach performs well for popular content, but quite poorly for rare items with few replicas. We then consider an alternate approach based on Distributed Hash Tables (DHTs). We describe our implementation of PIERSearch, a DHT-based system, and propose a hybrid system where Gnutella is used to locate popular items, and PIERSearch for handling rare items. We develop an analytical model of the two approaches, and use it in concert with our Gnutella traces to study the trade-off between query recall and system overhead of the hybrid system. We evaluate a variety of localized schemes for identifying items that are rare and worth handling via the DHT. Lastly, we show in a live deployment on fifty nodes on two continents that it nicely complements Gnutella in its ability to handle rare items.
SAMSTAR: a semi-automated lexical method for generating star schemas from an entity-relationship diagram
Authors: Il Yeol Song, Ritu Khare, Bing Dai
Venue: Proceedings of the ACM tenth international workshop on Data warehousing and OLAP (2007)

The star schema is widely accepted as the de facto data model for data warehouse design. A popular approach for developing a star schema is to develop it from an entity-relationship diagram with some heuristics. Most of the existing approaches analyze the semantics of an ERD to generate a star schema. In this paper, we present the SAMSTAR method, which semi-automatically generates star schemas from an ERD by analyzing its semantics as well as structure. The novel features of SAMSTAR are (1) the use of the notion of Connection Topology Value (CTV) in identifying the candidates of facts and dimensions and (2) the use of Annotated Dimensional Design Patterns (A_DDP) as well as WordNet to extend the list of dimensions. We illustrate our method by applying it to the examples from existing literature. We prove that the outputs of our method are a superset of those of the existing methods. The SAMSTAR method simplifies the work of experienced designers and gives a smooth head-start to novices.
CPU MISER: A Performance-Directed, Run-Time System for Power-Aware Clusters
Authors: Rong Ge, Xizhou Feng, Wu-chun Feng, Kirk W. Cameron
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

Performance and power are critical design constraints in today's high-end computing systems. Reducing power consumption without impacting system performance is a challenge for the HPC community. We present a runtime system (CPU MISER) and an integrated performance model for performance-directed, power-aware cluster computing. CPU MISER supports system-wide, application-independent, fine-grain, dynamic voltage and frequency scaling (DVFS) based power management for a generic power-aware cluster. Experimental results show that CPU MISER can achieve as much as 20% energy savings for the NAS parallel benchmarks. In addition to energy savings, CPU MISER is able to constrain performance loss for most applications within user-specified limits. These constraints are achieved through accurate performance modeling and prediction, coupled with advanced control techniques.
PIE: A Programming and Instrumentation Environment for Parallel Processing
Authors: Z. Segall
Venue: IEEE Software (1985)

The issues of performance-efficient programs and system support for parallel programming are the focus of this project to integrate functionality with performance concerns.
Semantic mining and analysis of gene expression data
Authors: Xin Xu, Gao Cong, Beng Chin Ooi, Kian-Lee Tan, Anthony K. H. Tung
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Association rules can reveal biological relevant relationship between genes and environments / categories. However, most existing association rule mining algorithms are rendered impractical on gene expression data, which typically contains thousands or tens of thousands of columns (gene expression levels), but only tens of rows (samples). The main problem is that these algorithms have an exponential dependence on the number of columns. Another shortcoming is evident that too many associations are generated from such kind of data. To this end, we have developed a novel depth-first row-wise algorithm FARMER [2] that is specially designed to efficiently discover and cluster association rules into interesting rule groups (IRGs) that satisfy user-specified minimum support, confidence and chi-square value thresholds on biological datasets as opposed to finding association rules individually. Based on FARMER, we have developed a prototype system that integrates semantic mining and visual analysis of IRGs mined from gene expression data.
Systematic Procedures for Realizing Synchronous Sequential Machines Using Flip-Flop Memory: Part I
Authors: H. A. Curtis
Venue: IEEE Transactions on Computers (1969)

This paper is Part I of a two-part study of systematic procedures for realizing synchronous sequential machines using flip-flop memory. In this study the methods of Dolotta and McCluskey, and Weiner and Smith are generalized so that they can be used to obtain directly good realization of machines using flip-flop memory. In Part I the generalizations are simple, straightforward, and require a minimal amount of changes to the basic methods. For machines using trigger flip-flop memory or a combination of trigger and set-reset, or trigger and J-K flip-flops, these generalizations usually yield significantly better realizations than those obtained from the use of the ungeneralized versions of these methods along with methods for transforming the resulting next-state functions into flip-flop input functions. Minimization of changes of these methods was achieved at the expense of imposing the restriction that the inputs to each of the set-reset and J-K flip-flop types be complementary. In Part II of this study1 further generalizations for obtaining even better realizations using trigger, set-reset, and J-K flip-flops are developed by dropping the aforementioned restriction.
Development of a drowsiness warning system based on the fuzzy logic images analysis
Authors: Jian-Da Wu, Tuo-Rung Chen
Venue: Expert Systems with Applications: An International Journal (2008)

In the present study, a vehicle driver drowsiness warning system using image processing technique with fuzzy logic inference is developed and investigated. The principle of the proposed system is based on facial images analysis for warning the driver of drowsiness or inattention to prevent traffic accidents. The facial images of driver are taken by a CCD camera which is installed on the dashboard in front of the driver. A fuzzy logic algorithm and an inference are proposed to determine the level of fatigue by measuring the blinding duration and its frequency, and warn the driver accordingly. The experimental works are carried to evaluate the effect of the proposed system for drowsiness warning under various operation conditions. The experimental results indicated that the proposed expert system is effective for increasing safe in drive. The detail of image processing technique and the characteristic also is present in this paper.
Delayed multiattribute product differentiation
Authors: Thomas A. Weber
Venue: Decision Support Systems (2008)

We develop a two-stage model for versioning products with respect to both vertical and horizontal attributes. At first, a firm positions its top-quality ''flagship'' product in a market with an imperfectly known distribution of tastes and reservation prices. In the second stage, the firm learns these consumer characteristics and has the option of extending its product line by versioning the flagship product using pure horizontal differentiation, quality degrading, or both. The firm's nonconvex versioning problem is solved analytically for the two-product case. We find that ex ante extending the product line through vertical differentiation is optimal for low marginal cost of quality (development cost); otherwise pure horizontal differentiation is superior. Given quasilinear consumer preferences and a uniform distribution of consumer characteristics, versioning with respect to both horizontal and vertical attributes is never optimal. Under delayed differentiation the optimal policy is contingent on the observed demand realization and may lead to horizontal cannibalization and price dispersion for equal-quality products. The firm tends to increase its investment in product quality unless it adopts a state-contingent policy of horizontal versioning for high and vertical versioning for low demand realizations. Following a state-contingent policy, the optimal upfront development effort may be significantly lower than under full ex-ante commitment. The option value of delayed differentiation is generally nonmonotonic in the firm's development cost.
Modeling and simulation of Li-ion conduction in poly(ethylene oxide)
Authors: L. Gitelman, M. Israeli, A. Averbuch, M. Nathan, Z. Schuss, D. Golodnitsky
Venue: Journal of Computational Physics (2007)

Polyethylene oxide (PEO) containing a lithium salt (e.g., LiI) serves as a solid polymer electrolyte (SPE) in thin-film batteries and its ionic conductivity is a key parameter of their performance. We model and simulate Li^+ ion conduction in a single PEO molecule. Our simplified stochastic model of ionic motion is based on an analogy between protein channels of biological membranes that conduct Na^+, K^+, and other ions, and the PEO helical chain that conducts Li^+ ions. In contrast with protein channels and salt solutions, the PEO is both the channel and the solvent for the lithium salt (e.g., LiI). The mobile ions are treated as charged spherical Brownian particles. We simulate Smoluchowski dynamics in channels with a radius of ca. 0.1nm and study the effect of stretching and temperature on ion conductivity. We assume that each helix (molecule) forms a random angle with the axis between these electrodes and the polymeric film is composed of many uniformly distributed oriented boxes that include molecules with the same direction. We further assume that mechanical stretching aligns the molecular structures in each box along the axis of stretching (intra-box alignment). Our model thus predicts the PEO conductivity as a function of the stretching, the salt concentration and the temperature. The computed enhancement of the ionic conductivity in the stretch direction is in good agreement with experimental results. The simulation results are also in qualitative agreement with recent theoretical and experimental results.
Semantic description in MPEG-7: the rich recursion of ripeness
Authors: Hawley K. Rising,  III, Corinne Jörgensen
Venue: Journal of the American Society for Information Science and Technology (2007)

Metadata describing multimedia can address a wide variety of purposes, from the purely physical characteristics of an item, to the circumstances surrounding its production, to attributes that cannot necessarily be determined by examining the item itself directly. These latter attributes, often dealing with "meaning" or interpretation of an item's content, are frequently deemed too difficult to determine and subject to individual and cultural variability. At the same time, however, research has shown that these abstract, interpretive attributes, which carry meaning, are frequently the ones for which people search. To describe an item fully, therefore, means to describe it at both the "syntactic" and the "semantic" levels. This article discusses the development of the semantic description schemes within the MPEG-7 standard from both a historical and an intellectual perspective, as well as the difficulties inherent in creating a descriptive schema that can fully capture the complexity of "narrative worlds."
Burnishing the lamp of memory: documentation and preservation in the digital age
Authors: William Payne, Kenneth B. McAlpine
Venue: The New Review of Information Networking (2006)

Every human action gains in honour, in grace, in all true magnificence, by its regard to things that are to come.... when we build let us think that we build forever.... For, indeed, the greatest glory of a building is not its stones, nor in its gold. Its glory is in its age, and in that deep sense of voicefulness, of stern watching, of mysterious sympathy... which we feel in walls that have long been washed by the passing waves of humanity. John Ruskin, The Lamp of Memory, from The Seven Lamps of Architecture (London, 1848).
A trust-based consumer decision-making model in electronic commerce: The role of trust, perceived risk, and their antecedents
Authors: Dan J. Kim, Donald L. Ferrin, H. Raghav Rao
Venue: Decision Support Systems (2008)

Are trust and risk important in consumers' electronic commerce purchasing decisions? What are the antecedents of trust and risk in this context? How do trust and risk affect an Internet consumer's purchasing decision? To answer these questions, we i) develop a theoretical framework describing the trust-based decision-making process a consumer uses when making a purchase from a given site, ii) test the proposed model using a Structural Equation Modeling technique on Internet consumer purchasing behavior data collected via a Web survey, and iii) consider the implications of the model. The results of the study show that Internet consumers' trust and perceived risk have strong impacts on their purchasing decisions. Consumer disposition to trust, reputation, privacy concerns, security concerns, the information quality of the Website, and the company's reputation, have strong effects on Internet consumers' trust in the Website. Interestingly, the presence of a third-party seal did not strongly influence consumers' trust.
Hybrid approach to solve a crew scheduling problem: an exact column generation algorithm improved by metaheuristics
Authors: Andre Gustavo dos Santos, Geraldo Robson Mateus
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

This paper shows a successful hybrid approach to improve a column generation algorithm. The objective is to construct daily duties to bus drivers, in order to cover a set of trips. Due to a large number of variables, the problem is decomposed in a master and a subproblem. The subproblem iteratively generates duties to the master problem, so the main task is to solve the subproblem. An exact ILP model may do this, but it is generally time consuming. We propose a heuristic based in the linear relaxation of this model to quickly generate many duties, and the ILP is called only when the heuristic fails, to obtain and prove optimality. We also use two metaheuristics to solve the subproblem: GRASP and genetic algorithm. All three heuristics improved the column generation algorithm and a hybrid approach using two of them turns out to be even faster for some instances.
An Ore-type theorem on equitable coloring
Authors: H. A. Kierstead, A. V. Kostochka
Venue: Journal of Combinatorial Theory Series B (2008)

A proper vertex coloring of a graph is equitable if the sizes of its color classes differ by at most one. In this paper, we prove that if G is a graph such that for each edge xy@?E(G), the sum d(x)+d(y) of the degrees of its ends is at most 2r+1, then G has an equitable coloring with r+1 colors. This extends the Hajnal-Szemeredi Theorem on graphs with maximum degree r and a recent conjecture by Kostochka and Yu. We also pose an Ore-type version of the Chen-Lih-Wu Conjecture and prove a very partial case of it.
Information "bridging" in a global organization
Authors: Allen E. Milewski, Marilyn Tremaine, Richard Egan, Suling Zhang, Felix Köbler, Patrick O'Sullivan
Venue: Proceedings of the 2007 conference of the center for advanced studies on Collaborative research (2007)

This paper describes an interview study investigating the collaborative information-seeking and sharing practices of a global software testing team. A site located in Europe was used as a temporal bridge to help in managing time zome differences between the US, China and India, All sites utilized this bridge for critical, synchronous information seeking. Interviews suggest that bridging can be a taxing job and that the success of the bridging arragement depended upon an intricate balance of temporal, infrastructure and cultural factors.
A Model Based Book Dewarping Method to Handle 2D Images Captured by a Digital Camera
Authors: M. Wu, R. Li, B. Fu, W. Li, Z. Xu
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

In this paper, we propose a book dewarping model which flattens a curved book page to its original flat rectangle shape. This model generalizes the model proposed by Cao to handle warped book images taken from different point of views instead of only from top of the book surface. In order to do so, we realize the impact of the angle between the camera lens and the book surface and take it into account in the transform model. Based on the new model, the rectification process includes two steps: 1) on the warped book image, find a region which is original a rectangle on a flat page; 2) map each pixel in warped region to a pixel in its original rectangle region. The experimental results demonstrate the effectiveness of our proposed book dewarping approach.
A Fast Probability-Based Algorithm for Leakage Current Reduction Considering Controller Cost
Authors: Tsung-Yi Wu, Jr-Luen Tzeng, Kuang-Yao Chen
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Because the leakage current of a digital circuit depends on the states of its logic gates, assigning a minimum leakage vector (MLV) to the primary inputs and the flip-flops' output pins of the circuit that operates in the sleep mode is a feasible technique for leakage current reduction. In this paper, we propose a novel probability-based algorithm and technique that can rapidly find an MLV. Unlike most traditional techniques that ignore the leakage current overhead of the newborn MLV controller, our technique can take this overhead into account. Ignoring this overhead during solution exploration may bring a side effect that is misrecognizing a non-optimum solution as an optimum one. Experimental results show that our algorithm can reduce the leakage current up to 48% and can find the optimum solutions on 22 out of 26 small MCNC benchmark circuits.