ppxscal/embedding_network huggingface dataset:
Low Static-Power Frequent-Value Data Caches
Authors: Chuanjun Zhang, Jun Yang, Frank Vahid
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

Static energy dissipation in cache memories will constitute an increasingly larger portion of total microprocessor energy dissipation due to nanoscale technology characteristics and the large size of on-chip caches. We propose to reduce the static energy dissipation of an on-chip data cache by taking advantage of the frequent values (FV) that widely exist in a data cache memory. The original FV-based low-power cache design aimed at only reducing dynamic power, at the cost of a 5% slowdown. We propose a better design that reduces both static and dynamic cache power, and that uses a circuit design that eliminates performance overhead. A designer can utilize our architecture by simulating an application and then synthesizing the FVs into an application-specific FV cache design when values will not change, or by simulating and then writing to an FV-cache with configuration registers when values could change. Furthermore, we describe hardware that can dynamically determine FVs and write to the configuration registers completely transparently. Experiments on 11 Spec 2000 benchmarks show that, in addition to the dynamic power savings, 33% static energy savings for data caches can be achieved.
Recognizing faces with PCA and ICA
Authors: Bruce A. Draper, Kyungim Baek, Marian Stewart Bartlett, J. Ross Beveridge
Venue: Computer Vision and Image Understanding (2003)

This paper compares principal component analysis (PCA) and independent component analysis (ICA) in the context of a baseline face recognition system, a comparison motivated by contradictory claims in the literature. This paper shows how the relative performance of PCA and ICA depends on the task statement, the ICA architecture, the ICA algorithm, and (for PCA) the subspace distance metric. It then explores the space of PCA/ICA comparisons by systematically testing two ICA algorithms and two ICA architectures against PCA with four different distance measures on two tasks (facial identity and facial expression). In the process, this paper verifies the results of many of the previous comparisons in the literature, and relates them to each other and to this work. We are able to show that the FastICA algorithm configured according to ICA architecture II yields the highest performance for identifying faces, while the InfoMax algorithm configured according to ICA architecture II is better for recognizing facial actions. In both cases, PCA performs well but not as well as ICA.
Inter-Area Traffic Engineering in a Differentiated Services Network
Authors: Natalie Degrande, Gert Van Hoey, Paloma De La Vallée Poussin, Sven Van Den Bosch
Venue: Journal of Network and Systems Management (2003)

In this paper, an off-line traffic engineering algorithm is presented that optimizes the single-path routing of Label Switched Paths in a Differentiated Services IP domain by means of explicit, Multi-Protocol Label Switching controlled nonshortest paths. This algorithm allows traffic engineering up to 2500 traffic trunks in flat networks with sizes up to 150 nodes while supporting protection, pre-emption, quality-of-service, oversubscription, and resource class affinity. The algorithm with proper extensions can be applied to hierarchical networks, thus increasing the scalability properties for network size with a factor of about 50. First the single-area algorithm is detailed, then the concept and implementation of hierarchy is introduced for inter-area traffic engineering. These topics are illustrated with simulation results.
Automatic derivation and implementation of fast convolution algorithms
Authors: Jeremy R. Johnson
Venue:  (2003)

This thesis surveys algorithms for computing linear and cyclic convolution. Algorithms are presented in a uniform mathematical notation that allows automatic derivation, optimization, and implementation. Using the tensor product and Chinese Remainder Theorem (CRT), a space of algorithms is defined and the task of finding the best algorithm is turned into an optimization problem over this space of algorithms. This formulation led to the discovery of new algorithms with reduced operation count. Symbolic tools are presented for deriving and implementing algorithms, and performance analyses (using both operation count and run-time as metrics) are carried out. These analyses show the existence of a window where CRT-based algorithms outperform other methods of computing convolutions. Finally a new method that combines the Fast Fourier Transform with the CRT methods is derived. This latter method is shown to be faster for some very large size convolutions than either method used alone.
Atomistic Monte Carlo simulation studies of polymer melts grafted on solid substrates
Authors: K. Daoulas, V. G. Mavrantzas
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

We discuss the results of a recent atomistic Monte Carlo simulation study of polyethylene (PE) melts grafted by one of their ends on a solid substrate. The simulations have been executed with a rather detailed forcefield which describes interactions at the level of individual atoms. The shortest length scale in the simulation is the Carbon-Carbon bond length l(=1.54Å). Results are presented for the main thermodynamic and conformational properties of these grafted layers in the vicinity of two types of surfaces: a noninteracting hard wall and a graphite basal plane.
Computer aided estimation of molecular weight and long chain branching distribution in free radical polymerization
Authors: G. D. Verros
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

A robust method for calculating molecular weight and long chain branching distribution in free radical polymerization is proposed in this work. This method is based on direct integration of large nonlinear integro-differential equations system describing the conservation of "dead" polymer and "live" radicals in the reactor. A fairly general kinetic mechanism was employed to describe the complex kinetics of homo- and co- polymerization in presence of branching reactions such as transfer to polymer and terminal double bond polymerization. To simplify calculations and reduce the order of prohibitively large nonlinear system the long chain hypothesis in addition to quasi steady state and continuous variable approximation were applied to "live" radical mass balances. This method was employed to calculate molecular weight and long chain branching distribution of poly(p-methyl styrene) and poly(vinyl acetate) produced by bulk homopolymerization in a batch reactor. Assumptions are justified by comparing calculated distributions, with experimental data and solutions obtained without invoking any assumption. Number and weight average molecular weight of the calculated molecular weight distributions are in excellent agreement with experimental data. This methodology is extended to branched copolymers to obtain the total weight molecular weight distribution by assuming that the respective copolymer composition distribution is uniform. In all cases, the obtained number and weight average molecular weight of calculated molecular distributions are in excellent agreement with obtained independently by moments' method. Results are presented, showing the effect of branching reactions on molecular weight distribution of copolymers. It is believed that present method can be applied to other free radical polymerization systems, to calculate the molecular weight and long chain branching distribution, leading thus to a more rational design of polymerization reactors.
Object Detection Using the Statistics of Parts
Authors: Henry Schneiderman, Takeo Kanade
Venue: International Journal of Computer Vision (2004)

In this paper we describe a trainable object detector and its instantiations for detecting faces and cars at any size, location, and pose. To cope with variation in object orientation, the detector uses multiple classifiers, each spanning a different range of orientation. Each of these classifiers determines whether the object is present at a specified size within a fixed-size image window. To find the object at any location and size, these classifiers scan the image exhaustively.Each classifier is based on the statistics of localized parts. Each part is a transform from a subset of wavelet coefficients to a discrete set of values. Such parts are designed to capture various combinations of locality in space, frequency, and orientation. In building each classifier, we gathered the class-conditional statistics of these part values from representative samples of object and non-object images. We trained each classifier to minimize classification error on the training set by using Adaboost with Confidence-Weighted Predictions (Shapire and Singer, 1999). In detection, each classifier computes the part values within the image window and looks up their associated class-conditional probabilities. The classifier then makes a decision by applying a likelihood ratio test. For efficiency, the classifier evaluates this likelihood ratio in stages. At each stage, the classifier compares the partial likelihood ratio to a threshold and makes a decision about whether to cease evaluation&mdash;labeling the input as non-object&mdash;or to continue further evaluation. The detector orders these stages of evaluation from a low-resolution to a high-resolution search of the image. Our trainable object detector achieves reliable and efficient detection of human faces and passenger cars with out-of-plane rotation.
Implementation of a UMTS Turbo-Decoder on a Dynamically Reconfigurable Platform
Authors: Alberto La Rosa, Claudio Passerone, Francesco Gregoretti, Luciano Lavagno
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

Modern embedded systems must execute a variety of high performance real-time tasks, such as audio and image compression and decompression, channel coding and encoding, etc. Reconfigurable platforms can effectively be used in these cases, because they allow to re-use the architecture for as many applications as possible.This paper describes the implementation of a UMTS turbo-decoder on one such platform, the XiRisc reconfigurable processor. Our goal is to test the development framework and design flow that we already developed on a real industrial example. Our results shows that, with some manual effort from the designer, very good performance improvements can be achieved, using a flow close to embedded software development.
Using Hypermedia to Improve Safety in Underground Metropolitan Transportation
Authors: José H. Canós, Francisco De Zulueta
Venue: Multimedia Tools and Applications (2004)

One of the main concerns in the organization and management of public transportation is passenger safety before an emergency. This is even more critical in the case of subway transportation, where risks are higher in the case of fire. Handling a critical emergency is a stressing task, in which large amounts of information must be used in order to make the right decision in a very short time.In this paper, we describe a pioneering application of hypermedia technology consisting of the integration of all the information needed to handle emergencies in a large hypermedia document. It reduces the response time remarkably by integrating text, graphics, sound, video and 3D models in a user-friendly interface. The authors and the Safety Office of Metro Valencia, the public transportation company of Valencia, developed it jointly between 1998 and 2000. We outline some of the technical decisions made during the project, as well as some of the lessons learned concerning the development of large hypermedia projects.
Return on Assets Loss from Situational and Contingency Misfits
Authors: Richard M. Burton, Jørgen Lauridsen, Børge Obel
Venue: Management Science (2002)

We develop a rule-based contingency misfit model and related hypotheses to test empirically the Burton and Obel (1998) multi contingency model for strategic organizational design. The model is a set of "if-then" misfit rules, in which misfits lead to a loss in performance; they are complements to the strategy and organizational contingency theory fit rules. Using data from 224 small- and medium-sized Danish firms, misfits are categorized and identified. Then, performance hypotheses are developed and tested using regression models. We confirm the hypotheses that firms with situational misfits or contingency misfits, or both, incur performance losses in return on assets compared with firms with no misfits. Contrary to our hypotheses, we did not find that additional misfits lead to increased performance loss. Our results suggest that just one misfit of any kind may significantly compromise performance. These results yield a deeper understanding of organizational contingency theory, as well as implications for the rule-based fit-misfit organizational design model.
Numerical verification of solutions for generalized obstacle problems
Authors: C. S. Ryoo, R. P. Agarwal
Venue: Neural, Parallel Scientific Computations (2003)

In this paper, we propose a numerical method to prove the existence of solutions to generalized obstacle problems using computers. In order to verify solutions, it is necessary to determine some constants which appear in a priori error estimations. We describe a method for determination of these constants.
A proximal decomposition algorithm for variational inequality problems
Authors: Deren Han
Venue: Journal of Computational and Applied Mathematics (2003)

In this paper, we propose a new decomposition algorithm for solving monotone variational inequality problems with linear constraints. The algorithm utilizes the problem's structure conductive to decomposition. At each iteration, the algorithm solves a system of nonlinear equations, which is structurally much easier to solve than variational inequality problems, the subproblems of classical decomposition methods, and then performs a projection step to update the multipliers. We allow to solve the subproblems approximately and we prove that under mild assumptions on the problem's data, the algorithm is globally convergent. We also report some preliminary computational results, which show that the algorithm is encouraging.
Pattern search algorithms for mixed variable general constrained optimization problems
Authors: Mark Aaron Abramson
Venue:  (2003)

A new class of algorithms for solving nonlinearly constrained mixed variable optimization problems is presented. The Audet-Dennis Generalized Pattern Search (GPS) algorithm for bound constrained mixed variable optimization problems is extended to problems with general nonlinear constraints by incorporating a filter, in which new iterates are accepted whenever they decrease the incumbent objective function value or constraint violation function value. Additionally, the algorithm can exploit any available derivative information (or rough approximation thereof) to speed convergence without sacrificing the flexibility often employed by GPS methods to find better local optima. In generalizing existing GPS algorithms, the new theoretical convergence results presented here reduce seamlessly to existing results for more specific classes of problems. While no local continuity or smoothness assumptions are made, a hierarchy of theoretical convergence results is given, in which the assumptions dictate what can be proved about certain limit points of the algorithm. A new Matlab&copy; software package was developed to implement these algorithms. Numerical results are provided for several nonlinear optimization problems from the CUTE test set, as well as a difficult nonlinearly constrained mixed variable optimization problem in the design of a load-bearing thermal insulation system used in cryogenic applications.
A Synchronous Co-Allocation Mechanism for Grid Computing Systems
Authors: Farag Azzedin, Muthucumaru Maheswaran, Neil Arnason
Venue: Cluster Computing (2004)

Grid computing systems are emerging as a computing infrastructure that will enable the use of wide-area network computing systems for a variety of challenging applications. One of these is the ever increasing demand for multimedia from users engaging in a wide range of activities such as scientific research, education, commerce, and entertainment. To provide an adequate level of service to multimedia applications, it is often necessary to simultaneously allocate resources including predetermined capacities from interconnecting networks to the applications. The simultaneous allocation of resources is often referred to as co-allocation in the Grid literature. In this paper, we formally define the co-allocation problem and propose a novel scheme called synchronous queuing (SQ) for implementing co-allocation with quality of service (QoS) assurances in Grids. Unlike existing approaches, SQ does not require advance reservation capabilities at the resources. This enables an SQ-based approach to over subscribe the resources and hence improve resource utilization. The simulation studies performed to evaluate SQ indicate that it outperforms an QoS-based scheme with strict admission control by a significant margin.
Improving bandwidth efficiency in fault-tolerant opaque IP over optical mesh networks
Authors: Anandkrishna Parameswaran Miguel A. Labrador
Venue: International Journal of Network Management (2004)

Adequately providing fault tolerance while using network capacity efficiently is a major topic of research in optical networks. In order to improve the network utilization, grooming of low-rate connections in optical networks has been usually performed at the edge of the network. However, in all-optical networks once a channel is assigned, its entire capacity is dedicated to the users independently of its grooming capabilities. As current users don't usually require such big capacities, bandwidth inefficiencies still occur. In this paper we address this issue introducing unlimited grooming per link (UGPL), a new restoration mechanism for opaque mesh optical networks that grooms connections on a per-link basis. Simulation results show that UGPL provides the best bandwidth efficiency and the best blocking probability compared to traditional 1 + 1 protection and 1 : N end-to-end sharing schemes. Furthermore, we show that the 1 : N end-to-end restoration scheme provides no benefits over the simpler and faster 1 + 1 protection scheme.
Electrical Characterization of a Polymeric Sensor for Hydrocarbon Spillage Detection
Authors: José M. Rocha-Pérez, Jorge Pedraza, Francisco Rodriguez, Federico Sandoval Ibarra
Venue: Proceedings of the 14th International Conference on Electronics, Communications and Computers (2004)

We present an exhaustive electrical characterization of a novel polymeric sensor. The sensorpresented in this research work has been successfullytested for gasoline leakage detection. The sensor hasbeen designed to be used in practical problems suchas hydrocarbon spillage (HS). Our sensor can be onlyutilized for medium size containers, such as the onestypically utilized in gas stations, container trucks,short length pipelines, etc. The characterizationresults found from our experiments show that thesensor presented here can be efficiently utilized forhydrocarbon spillage detection with response times ofabout 60 minutes. Such detection times arecomparable with the times achieved by similarcommercial products. Our experimental resultssuggest that some careful modifications of the designmay help to reduce the detection time to about 15minutes.
Electric hyperpolarizability calculations
Authors: G. Maroulis
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

We present an analysis of the ab initio quantumchemical calculation of electric hyperpolarizability calculations in some systems of primary importance. Various computational aspects of these calculations are closely examined. Particular consideration is reserved to basis set effects and the systematic evaluation of the performance of theoretical methods.
Delay-Optimized Implementation of IEEE Floating-Point Addition
Authors: Peter-Michael Seidel, Guy Even
Venue: IEEE Transactions on Computers (2004)

Abstract--We present an IEEE floating-point adder (FP-adder) design. The adder accepts normalized numbers, supports all four IEEE rounding modes, and outputs the correctly normalized rounded sum/difference in the format required by the IEEE Standard. The FP-adder design achieves a low latency by combining various optimization techniques such as: A nonstandard separation into two paths, a simple rounding algorithm, unification of rounding cases for addition and subtraction, sign-magnitude computation of a difference based on one's complement subtraction, compound adders, and fast circuits for approximate counting of leading zeros from borrow-save representation. We present technology-independent analysis and optimization of our implementation based on the Logical Effort hardware model and we determine optimal gate sizes and optimal buffer insertion. We estimate the delay of our optimized design at 30.6 FO4 delays for double precision operands (15.3 FO4 delays per stage between latches). We overview other IEEE FP addition algorithms from the literature and compare these algorithms with our algorithm. We conclude that our algorithm has shorter latency (-13 percent) and cycle time (-22 percent) compared to the next fastest algorithm.
Dealing with relationship cardinality constraints in relational database design
Authors: Dolores Cuadra Fernández, Paloma Martínez Fernández, Elena Castro Galán
Venue: Effective databases for text & document management (2003)

Conceptual models are well-known tools to achieve a good design of information systems. Nevertheless, the understanding and use of all the constructs and constraints which are presented in such models are not an easy task and sometimes it is cause of loss of interest.In this chapter we have tried to study in depth and clarify the meaning of the features of conceptual models. The disagreements between main conceptual models, the confusion in the use of some of their constructs and some open problems in these models are shown. Another important topic treated in this chapter is the conceptual-to-logic schemata transformation process.Some solutions are presented in order to clarify the relationship construct and to extend the cardinality constraint concept in ternary relationships. How to preserve the cardinality constraint semantics in binary and ternary relationships for their implementation in a DBMS with active capabilities has also been developed.
An interaction model for universal interaction and control in multi display environments
Authors: Hannah Slay, Bruce Thomas, Rudi Vernik
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

In this paper we propose a framework for interaction within multi display environments. Each component of the framework is detailed, with comparisons to existing research in ubiquitous computing software infrastructures. We identify a key framework component: the interaction manager, which is designed to allow users to interact within multi display environments with multiple devices exhibiting multiple modalities. A scenario is presented that places this framework within the context of a 3D informational visualisation application.
Disaggregation of Diophantine Equation with Boolean Variables
Authors: Sahib S. Mardanov, Knyaz Sh. Mamedov
Venue: Computational Optimization and Applications (2004)

A method of disaggregation of Diophantine equation with integer coefficients and Boolean variables is presented. The method allows transforming a single equation into an equivalent system of equations with small coefficients.