ppxscal/embedding_network huggingface dataset:
Algorithmic transforms for efficient energy scalable computation
Authors: Amit Sinha, Alice Wang, Anantha P. Chandrakasan
Venue: Proceedings of the 2000 international symposium on Low power electronics and design (2000)

We introduce the notion of energy scalable computation on general purpose processors. The principle idea is to maximize computational qualityfor a given energy constraint. Teh desirable energy-quality behavior of algorithms is discussed. subsequently the energy-quality scalability of three distinct categories of commonly used signal processing algorithms (viz. filtering, frequency domain transforms and classification) are analyzed on the StrongARM SA-1100 processor and transformations are described which obtain significant improvements in the energy-quality scalability of the algorithm.
Pose space deformation: a unified approach to shape interpolation and skeleton-driven deformation
Authors: J. P. Lewis, Matt Cordner, Nickson Fong
Venue: Proceedings of the 27th annual conference on Computer graphics and interactive techniques (2000)

Pose space deformation generalizes and improves upon both shape interpolation and common skeleton-driven deformation techniques. This deformation approach proceeds from the observation that several types of deformation can be uniformly represented as mappings from a pose space, defined by either an underlying skeleton or a more abstract system of parameters, to displacements in the object local coordinate frames. Once this uniform representation is identified, previously disparate deformation types can be accomplished within a single unified approach. The advantages of this algorithm include improved expressive power and direct manipulation of the desired shapes yet the performance associated with traditional shape interpolation is achievable. Appropriate applications include animation of facial and body deformation for entertainment, telepresence, computer gaming, and other applications where direct sculpting of deformations is desired or where real-time synthesis of a deforming model is required.
Acrophile: an automated acronym extractor and server
Authors: Leah S. Larkey, Paul Ogilvie, M. Andrew Price, Brenden Tamilio
Venue: Proceedings of the fifth ACM conference on Digital libraries (2000)

We implemented a web server for acronym and abbreviation lookup, containing a collection of acronyms and their expansions gathered from a large number of web pages by a heuristic extraction process. Several different extraction algorithms were evaluated and compared. The corpus resulting from the best algorithm is comparable to a high-quality hand-crafted site, but has the potential to be much more inclusive as data from more web pages are processed.
Function inlining under code size constraints for embedded processors
Authors: Rainer Leupers, Peter Marwedel
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

Function inlining is a compiler optimization that generally increases performance at the expense of larger code size. However, current inlining techniques do not meet the special demands in the design of embedded systems, since they are based on simple heuristics, and they generate code of unpredictable size. This paper presents a novel approach to function inlining in C compilers for embedded processors, which aims a maximum program speedup under a global limit on code size. The core of this approach is a branch-and-bound algorithm which allows to quickly explore the large search space. In an application study we show how this algorithm can be applied to maximize the execution speed of an application under a given code size constraint.
Preconditioning for Regular Elliptic Systems
Authors: Hsing-Hsia Chen, John C. Strikwerda
Venue: SIAM Journal on Numerical Analysis (1999)

In this paper we examine preconditioning operators for regular elliptic systems of partial differential operators. We obtain general conditions under which the preconditioned systems are bounded. We also provide some useful guidelines for choosing left and right preconditioning operators for regular elliptic systems. The condition numbers of the discrete operators arising from these preconditioned operators are shown to be bounded independent of grid spacing. Several examples of two-dimensional regular elliptic systems are discussed, including scalar elliptic operators and the Stokes operator with several different boundary conditions. Several preconditioners for these regular elliptic systems are presented and used in numerical experiments illustrating the theoretical results.
Stochastic Orderings of Convex/Concave-Type on An Arbitrary Grid
Authors: Michel Denuit, Claude Lefevre, Sergey Utev
Venue: Mathematics of Operations Research (1999)

Several new classes of discrete stochastic orderings are introduced for comparing discrete random variables that are valued in an arbitrary ordered finite grid of nonnegative points. These order relations correspond to particular cases of integral stochastic orderings which are generated by different classes of functions of convex/concave-type defined on the grid. They are natural extensions from equidistant to arbitrary grids of various orderings familiar in the literature. The main question addressed in the paper is how an extension of the grid of points can affect such stochastic orderings. It will be shown that a crucial factor is the location of the additional point that is inserted in the grid.
Early eukaryote evolution based on mitochondrial gene order breakpoints
Authors: David Sankoff, David Bryant, Mélanie Deneault, B. Franz Lang, Gertraud Burger
Venue: Proceedings of the fourth annual international conference on Computational molecular biology (2000)

We present a general heuristic for the median problem for induced breakpoints on genomes with unequal gene content and incorporate this into a routine for estimating optimal gene orders for the ancestral genomes in a fixed phylogeny. The routine is applied to a phylogenetic study of an up-to-date set of completely sequenced protist mitochondrial genomes, confirming some of the recent sequence-based groupings which have been proposed and, conversely, confirming the usefulness of the breakpoint method as a phylogenetic tool even for small genomes.
Performance prediction tools for parallel discrete-event simulation
Authors: Chu-Cheow Lim, Yoke-Hean Low, Boon-Ping Gan, Sanjay Jain, Wentong Cai, Wen Jing Hsu, Shell Ying Huang
Venue: Proceedings of the thirteenth workshop on Parallel and distributed simulation (1999)

We have developed a set of performance prediction tools which help to estimate the achievable speedups from parallelizing a sequential simulation. The tools focus on two important factors in the actual speedup of a parallel simulation program : (a) the simulation protocol used, and (b) the inherent parallelism in the simulation model. The first two tools are a performance/parallelism analyzer for a conservative, asynchronous simulation protocol, and a similar analyzer for a conservative, synchronous ("super-step") protocol. Each analyzer allows us to study how the speedup of a model changes with increasing number of processors, when a specific protocol is used. The third tool -- a critical path analyzer -- gives an ideal upper bound to the model's speedup. This paper gives an overview of the prediction tools, and reports the predictions from applying the tools to a discrete-event wafer fabrication simulation model. The predictions are close to speedups from actual parallel implementations. These tools help us to set realistic expectations of the speedup from a parallel simulation program, and to focus our work on issues which are more likely to yield performance improvement.
A Space-Time Representation Method of Iterative Algorithms for the Design of Processor Arrays
Authors: E. D. Kyriakis-Bitzaros, C. E. Goutis
Venue: Journal of VLSI Signal Processing Systems (1999)

A novel Space-Time Representation (STR) of iterative algorithms for their systematic mapping onto regular processor arrays is proposed. Timing information is introduced in the Dependence Graph (DG) by the definition and the construction of the Space-Time DG (STDG). Any variable instance of the loop body, independently of the number of the loop indices, is characterized by an integer vector composed by its indices, as space part, and an additional time index, representing its execution time according to a preliminary timing. The main advantage of the STR is that the need for the uniformization of the algorithm is avoided. Moreover, it is proven that in the STDG dependence vectors having opposite directions do not exist and therefore a linear mapping of the STDG onto the desired processor array can always be derived. Efficient 2D and 1D regular architectures are produced by applying the STR to the original description of the Warshall-Floyd algorithm for the Algebraic Path Problem.
Pattern Matching Image Compression: Algorithmic and Empirical Results
Authors: Mikhail Atallah, Yann Génin, Wojciech Szpankowski
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1999)

We propose a nontransform image compression scheme based on approximate one-dimensional pattern matching that we name Pattern Matching Image Compression (PMIC). The main idea behind it is a lossy extension of the Lempel-Ziv data compression scheme in which one searches for the longest prefix of an uncompressed image that approximately occurs in the already processed image (e.g., in the sense of the Hamming distance or, alternatively, of the square error distortion). This main algorithm is enhanced with several new features such as searching for reverse approximate matching, recognizing substrings in images that are additively shifted versions of each other, introducing a variable and adaptive maximum distortion level $D$, and so forth. These enhancements are crucial to the overall quality of our scheme and their efficient implementation leads to algorithmic issues of interest in their own right. Both algorithmic and experimental results are presented. Our scheme turns out to be competitive with JPEG and wavelet compression for good quality graphical images. We also review related theoretical results.
A comparison of selectivity estimators for range queries on metric attributes
Authors: Björn Blohsfeld, Dieter Korus, Bernhard Seeger
Venue: ACM SIGMOD Record (1999)

In this paper, we present a comparison of nonparametric estimation methods for computing approximations of the selectivities of queries, in particular range queries. In contrast to previous studies, the focus of our comparison is on metric attributes with large domains which occur for example in spatial and temporal databases. We also assume that only small sample sets of the required relations are available for estimating the selectivity. In addition to the popular histogram estimators, our comparison includes so-called kernel estimation methods. Although these methods have been proven to be among the most accurate estimators known in statistics, they have not been considered for selectivity estimation of database queries, so far. We first show how to generate kernel estimators that deliver accurate approximate selectivities of queries. Thereafter, we reveal that two parameters, the number of samples and the so-called smoothing parameter, are important for the accuracy of both kernel estimators and histogram estimators. For histogram estimators, the smoothing parameter determines the number of bins (histogram classes). We first present the optimal smoothing parameter as a function of the number of samples and show how to compute approximations of the optimal parameter. Moreover, we propose a new selectivity estimator that can be viewed as an hybrid of histogram and kernel estimators. Experimental results show the performance of different estimators in practice. We found in our experiments that kernel estimators are most efficient for continuously distributed data sets, whereas for our real data sets the hybrid technique is most promising.
A Dynamical Proof of the Method of Lagrange
Authors: Alan P. Knoerr
Venue: SIAM Review (1998)

Standard careful proofs of the method of Lagrange multipliers for constrained optimization rely on the implicit function theorem. An alternative proof is presented which is based instead on an existence theorem from the theory of ordinary differential equations. This approach has several conceptual and pedagogical advantages.
Consensual trends for optimizing the constitution of middleware
Authors: Stéphane Spahni, Jean-Raoul Scherrer, Dominique Sauquet, Pier-Angelo Sottile
Venue: ACM SIGCOMM Computer Communication Review (1998)

Middleware is now a commonly used expression and anyone building distributed applications is referring to "middleware services". Nevertheless this notion lacks of sound theoretical foundation. This paper tries to clarify the relationship between the components of the distributed environment, and establishes some classification aiming at gaining a common understanding of the functionality and interdependency of the existing modules of distributed environments.
Maintenance of cube automatic summary tables
Authors: Wolfgang Lehner, Richard Sidle, Hamid Pirahesh, Roberta Wolfgang Cochrane
Venue: ACM SIGMOD Record (2000)

Materialized views (or Automatic Summary Tables&mdash;ASTs) are commonly used to improve the performance of aggregation queries by orders of magnitude. In contrast to regular tables, ASTs are synchronized by the database system. In this paper, we present techniques for maintaining cube ASTs. Our implementation is based on IBM DB2 UDB.
${\cal H_}\infty$ Control of Diffusion Systems by Using a Finite-Dimensional Controller
Authors: Hideki Sano, Yoshiyuki Sakawa
Venue: SIAM Journal on Control and Optimization (1999)

In this paper, we consider ${\cal H}_{\infty}$ control of linear and semilinear diffusion systems by using a finite-dimensional controller. The main aim is to construct a finite-dimensional stabilizing controller for the linear diffusion system that makes the ${\cal H}_{\infty}$ norm of the closed-loop transfer function less than a given positive number $\delta$. For that purpose, we first derive a finite-dimensional reduced-order system for the linear diffusion system. Then, a stabilizing controller that makes the ${\cal H}_{\infty}$ norm of the closed-loop transfer function less than another positive number is constructed for the reduced-order model. It is proved that the finite-dimensional controller, together with a residual mode filter, plays a role of a finite-dimensional stabilizing controller that makes the ${\cal H}_{\infty}$ norm of the closed-loop transfer function less than $\delta$ for the original linear diffusion system if the order of residual mode filter is chosen sufficiently large. Moreover, it is shown that the finite-dimensional ${\cal H}_{\infty}$ controller constructed for the linear diffusion system also works as a finite-dimensional ${\cal H}_{\infty}$ controller for a semilinear diffusion system with sufficiently small nonlinear term.
Interval routing schemes allow broadcasting with linear message-complexity (extended abstract)
Authors: Pierre Fraigniaud, Cyril Gavoille, Bernard Mans
Venue: Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing (2000)

The purpose of compact routing is to provide a labeling of the nodes of a network, and a way to encode the routing tables so that routing can be performed efficiently (e.g., on shortest paths) while keeping the memory-space required to store the routing tables as small as possible. In this paper, we answer a long-standing conjecture by showing that compact routing can also help to perform distributed computations. In particular, we show that a network supporting a shortest path interval routing scheme allows to broadcast with an O(n) message-complexity, where n is the number of nodes of the network. As a consequence, we prove that O(n) messages suffice to solve leader-election for any graph labeled by a shortest path interval routing scheme, improving therefore the O(m + n) previous known bound.
Optimal Pricing Strategy for New Products
Authors: Trichy V. Krishnan, Frank M. Bass, Dipak C. Jain
Venue: Management Science (1999)

Robinson and Lakhani (1975) initiated a long research stream in marketing when they used the Bass model (1969) to develop optimal pricing path for a new product. A careful analysis of the extant literature reveals that the research predominantly suggests that the optimal price path should be largely based on the sales growth pattern. However, in the real world we rarely find new products that have such pricing pattern. We observe either a monotonically declining pricing pattern or an increase-decrease pricing pattern that does not seem close to the sales path. In this paper, we use a variation of the generalized Bass model (called GBM) developed by Bass et al. (1994) that yields optimal pricing policies that are consistent with empirical data.
Verification Simulation Acceleration UsingCode-Perturbation
Authors: Byeong Min, Gwan Choi
Venue: Journal of Electronic Testing: Theory and Applications (2000)

We propose a simulation approach that can take a large design and swiftly cover its valid code-level operating states. The approach perturbs the program-control flow during the simulation to dynamically exhaust all branching possibilities in a verification code/program. The heuristic uses the program branching information from preprocessing the test/verification code. Using the branching information the simulation allows automatic run-time forced branching to make possible a full coverage of the instruction space spanned by the verification code/program. The aim is (1) to improve the verification simulation speed and (2) to get higher coverage rate for large core-base designs such as microprocessors or digital-signal-processing (DSP) products. A case study of a 32-bit RISC processor, used in a network system, is conducted. The application code for the processor (MCP, Myrinet control program) is used as a verification program. Despite the deviation from the valid &ldquo;software-reachable state&rdquo; of the system due to forced branching, a significant number of hard-to-reach hardware states (that can be reached only through the right mix of codes, often the code segments of an application software) are covered. Using the MCP program over 30% additional coverage is achieved with the proposed approach over ordinary code-based simulation for a fixed verification time. Further, compared to the conventional simulation approach, the proposed heuristic takes about 43% less compute-cycles to achieve same state coverage level.
Automatic hypermedia generation for ad hoc queries on semi-structured data
Authors: Geert-Jan Houben, Paul De Bra
Venue: Proceedings of the fifth ACM conference on Digital libraries (2000)

This paper describes research on the automatic generation of hypermedia or Web-based presentations for semi-structured data resulting from ad-hoc queries. We identify how different aspects of adaptation, such as personalization and customization, influence the generation process. We address important aspects of the software that facilitates the generation process.
Artificial synesthesia via sonification: a wearable augmented sensory system
Authors: Leonard N. Foner
Venue: Mobile Networks and Applications (1999)

A design for an implemented, prototype wearable artificial sensory system is presented, which uses data sonification to compensate for normal limitations in the human visual system. The system gives insight into the complete visible-light spectra from objects being seen by the user. Long-term wear and consequent training might lead to identification of various visually-indistinguishable materials based on the sounds of their spectra. A detailed system design and results of user testing are presented, and many possible extensions to both the sonification and the sensor package are discussed.
A Simple Method for Compressible Multifluid Flows
Authors: Richard Saurel, Rémi Abgrall
Venue: SIAM Journal on Scientific Computing (1999)

A simple second order accurate and fully Eulerian numerical method is presented for the simulation of multifluid compressible flows, governed by the stiffened gas equation of state, in hydrodynamic regime. Our numerical method relies on a second order Godunov-type scheme, with approximate Riemann solver for the resolution of conservation equations, and a set of nonconservative equations. It is valid for all mesh points and allows the resolution of interfaces. This method works for an arbitrary number of interfaces, for breakup and coalescence. It allows very high density ratios (up to 1000). It is able to compute very strong shock waves (pressure ratio up to 10 5). Contrary to all existing schemes (which consider the interface as a discontinuity) the method considers the interface as a numerical diffusion zone as contact discontinuities are computed in compressible single phase flows, but the variables describing the mixture zone are computed consistently with the density, momentum and energy. Several test problems are presented in one, two, and three dimensions. This method allows, for example, the computation of the interaction of a shock wave propagating in a liquid with a gas cylinder, as well as Richtmeyer--Meshkov instabilities, or hypervelocity impact, with realistic initial conditions. We illustrate our method with the Rusanov flux. However, the same principle can be applied to a more general class of schemes.
Why not negation by fixpoint?
Authors: Phokion G. Kolaitis, Christos H. Papadimitriou
Venue: Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (1988)

There is a fixpoint semantics for DATALOG programs with negation that is a natural generalization of the standard semantics for DATALOG programs without negation. We show that, unfortunately, several compelling complexity-theoretic obstacles rule out its efficient implementation. As an alternative, we propose Inflationary DATALOG, an efficiently implementable semantics for negation, based on inflationary fixpoints
Enabling power management for network-attached computers
Authors: Kenneth J. Christensen, Franklin ‘Bo’ Gulledge
Venue: International Journal of Network Management (1998)

Power management is an emerging area of interest for network management. This article reviews current developments and describes methods for enabling power management in network-attached computers. &copy; 1998 John Wiley & Sons, Ltd.
Do a quick conversion: put all our documentation on the web
Authors: Ann Amsler
Venue: ACM SIGUCCS Newsletter (1998)

As using the World Wide Web becomes the norm on many university and college campuses, many writers and web designers are being instructed to move most, if not all, documentation to the web. Often, they are expected to simply use an HTML converter to create web documents that are exact replicas of paper documents.This paper examines the implications, particularly for the user, when documents designed for paper are reproduced as-is online. It looks at whether all information is appropriate for the web and at how web pages differ from printed pages. It discusses some of the short comings of converted documents and, finally, offers suggestions for using a converted document as a starting place for producing a worthwhile web document.