ppxscal/embedding_network huggingface dataset:
Higher-order arity raising
Authors: John Hannan, Patrick Hicks
Venue: Proceedings of the third ACM SIGPLAN international conference on Functional programming (1998)

Arity raising, also known as variable splitting or flattening, is the program optimization which transforms a function of one argument into a function of several arguments by decomposing the structure of the original one argument into individual components in that structure. This optimization eliminates the need for the structuring of the components and also allows more arguments to be passed in registers during a function call. We present a formal specification of arity raising for a higher-order functional language. This specification supports the general arity raising of functions, even for functions which are passed as arguments or returned as values. We define a practical algorithm, based on algorithm W, which implements arity raising, and we prove this algorithm sound with respect to the deductive system. These results provide a declarative framework for reasoning about arity raising and support a richer form of the transformation than is currently found in compilers for functional languages.
Access conflicts in multiprocessor memories queueing models and simulation studies
Authors: Ingrid Y. Bucher, Donald A. Calahan
Venue: ACM SIGARCH Computer Architecture News (1990)

The performance of an interleaved common memory accessed uniformly by multiple processors is modeled by queueing methods. The model includes access conflicts at the bank level while assuming an ideal access network. A scaling relation is derived that is generally valid and indicates that memory access delays are given by the product of the bank reservation time and a function of the memory utilization, which is given by the average number of access requests arriving at a bank per bank reservation time. For light memory traffic, access delays are proportional to the square of the bank reservation time and the ratio of the number of active memory access streams to the number of memory banks. Assuming random access patterns, an open and a closed queueing model are developed that are validated by simulations. Delay dependence on bank reservation time is quadratic for light loads and linear for very heavy loads. A heuristic extension of our model for vector accessing of banks in sequential mode is proposed.
Visual and Textual Consistency Checking Tools for Graphical User Interfaces
Authors: Rohit Mahajan, Ben Shneiderman
Venue: IEEE Transactions on Software Engineering (1997)

Designing user interfaces with consistent visual and textual properties is difficult. To demonstrate the harmful effects of inconsistency, we conducted an experiment with 60 subjects. Inconsistent interface terminology slowed user performance by 10 to 25 percent. Unfortunately, contemporary software tools provide only modest support for consistency control. Therefore, we developed SHERLOCK, a family of consistency analysis tools, evaluates visual and textual properties of user interfaces. It provides graphical analysis tools such as a dialog box summary table that presents a compact overview of visual properties of all dialog boxes. SHERLOCK provides terminology analysis tools including an Interface Concordance, an Interface Spellchecker, and Terminology Baskets to check for inconsistent use of familiar groups of terms. Button analysis tools include a Button Concordance and a Button Layout Table to detect variant capitalization, distinct typefaces, distinct colors, variant button sizes, and inconsistent button placements. This paper describes the design, software architecture, and the use of SHERLOCK. We tested SHERLOCK with four commercial prototypes. The outputs, analysis, and feedback from designers of the applications are presented.
Simulation in the design of ground-based intrabay automation systems
Authors: Thomas Jefferson, Madhav Rangaswami, Gregory Stoner
Venue: Proceedings of the 28th conference on Winter simulation (1996)

Material transport within a semiconductor factory (fab) can be broken into two categories - interbay (bay to bay movement) and intrabay (within bay) movement. Due to the fragile properties of semiconductors, there are risks associated with any movement of material. These risks range from misprocessed or damaged wafers, to throughput loss. These risks are increased during manual intrabay handling, where several operations may be taking place in a populated, confined area. Intrabay automated material handling is a means by which the above-mentioned risks can be reduced or eliminated. Simulation can play a key role in the design of intrabay automation systems, in verifying that the system will not negatively affect throughput of an area. A simulation model has been developed to analyze the effects of intrabay AMHS on a manufacturing bay. Model architecture is discussed, and three case studies demonstrate applications of the model.
Wave-indices: indexing evolving databases
Authors: Narayanan Shivakumar, Héctor García-Molina
Venue: Proceedings of the 1997 ACM SIGMOD international conference on Management of data (1997)

In many applications, new data is being generated every day. Often an index of the data of a past window of days is required to answer queries efficiently. For example, in a warehouse one may need an index on the sales records of the last week for efficient data mining, or in a Web service one may provide an index of Netnews articles of the past month. In this paper, we propose a variety of wave indices where the data of a new day can be efficiently added, and old data can be quickly expired, to maintain the required window. We compare these schemes based on several system performance measures, such as storage, query response time, and maintenance work, as well as on their simplicity and ease of coding.
Performance analysis of integrated navigation systems
Authors: Keith Brodie, Donald Eller, Gregory Seibert
Venue: Proceedings of the 17th conference on Winter simulation (1985)

A generalized Covariance Error Analysis Simulator (CEASIM) has been developed for GPS/INS integrated navigation systems. Equations for the propagation in time of the attitude, position, velocity and sensor errors are implemented with a 64-state system model. Alignment equations for a typical fourth-order INS alignment/calibration loop are incorporated for covariance initialization. CEASIM can be used to study various Kalman filter and sensor configurations as part of proposal or preliminary design efforts. The simulator is capable of analyzing GPS/INS system performance over a variety of mission profiles, including aircraft, ships and land vehicles.
Performance Evaluation and Cost Analysis of Cache Protocol Extensions for Shared-Memory Multiprocessors
Authors: Fredrik Dahlgren, Michel Dubois, Per Stenström
Venue: IEEE Transactions on Computers (1998)

We evaluate three extensions to directory-based cache coherence protocols in shared-memory multiprocessors. These extensions are aimed at reducing the penalties associated with memory accesses and include a hardware prefetching scheme, a migratory sharing optimization, and a competitive-update mechanism. Since each extension targets distinct components of the read and write penalties, they can be combined effectively. This paper identifies the combinations yielding the best performance gains and cost trade-offs in the context of a class of cache-coherent NUMA (Non-Uniform Memory Access) architectures. Detailed architectural simulations of a multiprocessor with single-issue, statically scheduled CPUs, using five benchmarks, show that the protocol extensions often provide additive gains when they are properly combined. For example, the combination of prefetching with the competitive-update mechanism speeds up the execution by nearly a factor of two under release consistency. The same speedup is obtained under sequential consistency by combining prefetching with the migratory sharing optimization. This paper shows that a basic write-invalidate protocol augmented by appropriate extensions can eliminate most memory access penalties without any support from the programmer or the compiler.
Estimating the Attainable Accuracy of Recursively Computed Residual Methods
Authors: Anne Greenbaum
Venue: SIAM Journal on Matrix Analysis and Applications (1997)

Many conjugate gradient-like methods for solving linear systems $Ax=b$ use recursion formulas for updating residual vectors instead of computing the residuals directly. For such methods it is shown that the difference between the actual residuals and the updated approximate residual vectors generated in finite precision arithmetic depends on the machine precision $\epsilon$ and on the maximum norm of an iterate divided by the norm of the true solution. It is often observed numerically, and can sometimes be proved, that the norms of the updated approximate residual vectors converge to zero or, at least, become orders of magnitude smaller than the machine precision. In such cases, the actual residual norm reaches the level $\epsilon \| A \| \| x \|$ times the maximum ratio of the norm of an iterate to that of the true solution. Using exact arithmetic theory to bound the size of the iterates, we give a priori estimates of the size of the final residual for a number of algorithms.
An Optimal Algorithm to Find the Jump Number of Partially Ordered Sets
Authors: L. Bianco, P. Dell‘olmo, S. Giordani
Venue: Computational Optimization and Applications (1997)

The jump number of a partially ordered set (poset) P is the minimum number of incomparable adjacent pairs (jumps) in some linear extension of P. The problem of finding a linear extension of P with minimum number of jumps (jump number problem) is known to be NP-hard in general and, at the best of our knowledge, no exact algorithm for general posets has been developed. In this paper, we give examples of applications of this problem and propose for the general case a new heuristic algorithm and an exact algorithm. Performances of both algorithms are experimentally evaluated on a set of randomly generated test problems.
Rapid frequency-domain analog fault simulation under parameter tolerances
Authors: Michael W. Tian, C.-J. Richard Shi
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

Fault-driven analog and mixed-signal testing calls for rapid fault simulationtechniques. A problem that has not been addressed effectivelyby existing research is that circuit parameters have tolerance ranges.In this paper, we propose representing parameters under variations asintervals, and present an efficient algorithm - based on interval analysisand Householder's formula - to compute the worst-case responsebounds of good and faulty linear(ized) circuits under parameter variations.Our approach takes CPU time comparable to one nominal circuitsimulation, and always produces correct and conservative results. Thealgorithm has been implemented into SPICE3F5. Experimental resultsshow an acceptable accuracy.
Improved hierarchical bit-vector compression in document retrieval systems
Authors: A. S. Fraenkel, S. T. Klein, Y. Choueka, E. Segal
Venue: Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval (1986)

The &ldquo;concordance&rdquo; of an information retrieval system can often be stored in form of bit-maps, which are usually very sparse and should be compressed. Hierarchical bit-vector compression consists of partitioning a vector vi into equi-sized blocks, constructing a new bit-vector vi+1 which points to the non-zero blocks in vi, dropping the zero-blocks of vi, and repeating the process for vi+1. We refine the method by pruning some of the tree branches if they ultimately point to very few documents; these document numbers are then added to an appended list which is compressed by the prefix-omission technique. The new method was thoroughly tested on the bit-maps of the Responsa Retrieval Project, and gave a relative improvement of about 40% over the conventional hierarchical compression method.
Difference Sets with n = 2p^m
Authors: Mikhail Muzychuk
Venue: Journal of Algebraic Combinatorics: An International Journal (1998)

Let D be a (v,k,&lambda;) difference set over an abelian group G with even n = k - &lambda;. Assume that t &isin; N satisfies the congruences t &equiv; q^fi_i (mod exp(G)) for each prime divisor q_i of n/2 and some integer f_i. In [4] it was shown that t is a multiplier of D provided that n > &lambda;, (n/2, &lambda;) = 1 and (n/2, v) = 1. In this paper we show that the condition n > &lambda; may be removed. As a corollary we obtain that in the case of n= 2p^a when p is a prime, p should be a multiplier of D. This answers an open question mentioned in [2].
Lambda-splitting: a higher-order approach to cross-module optimizations
Authors: Matthias Blume, Andrew W. Appel
Venue: Proceedings of the second ACM SIGPLAN international conference on Functional programming (1997)

We describe an algorithm for automatic inline expansion across module boundaries that works in the presence of higher-order functions and free variables; it rearranges bindings and scopes as necessary to move nonexpansive code from one module to another. We describe---and implement---the algorithm as transformations on lambda;-calculus. Our inliner interacts well with separate compilation and is efficient, robust, and practical enough for everyday use in the SML/NJ compiler. Inlining improves performance by 4--8% on existing code, and makes it possible to use much more data abstraction by consistently eliminating penalties for modularity.
BestFit, distribution-fitting software by Palisade Corporation
Authors: Linda Jankauskas, Sam McLafferty
Venue: Proceedings of the 28th conference on Winter simulation (1996)

BestFit is distribution-fitting software for Microsoft Windows that finds the statistical distribution function that best fits a data set. BestFit provides a flexible, easy to-use environment for analysis that allows users to focus on their data, not their software. Users of simulation software can use distributions produced by BestFit to define uncertainty in their simulation models. BestFit helps you find the best representation of randomness in your model, making your simulation results more accurate. Users of @RISK, ProModel or any other simulation software will find BestFit an invaluable tool for defining uncertainty.
A Fourth Order Bandpass Delta-Sigma Modulator with DigitallyProgrammable Passband Frequency
Authors: Ronald F. Cormier,  Jr., Roberto H. Bamberger, Terry L. Sculley
Venue: Analog Integrated Circuits and Signal Processing (1997)

The design and implementation of a fourth order switched-capacitor bandpass delta-sigma modulator with digitally programmable passband is described. The quantization noise null can be programmed from 0.4&pi; (0.2f_s) to 0.6&pi;(0.3f_s) in steps of 0.01&pi; (f_s/200) by changing digital switch settings. This design enables the A/D conversion of a bandpass signal with digital tuning of the center frequency for application in systems such as a transceiver IF stage. The modulator IC measures 4.8mm^2 in a 2&micro; m CMOS process and achieves an SNR of 47 and 59 dB over a 0.01&pi; bandwidth at sampling rates of 2.358 MHz and 1.25 MHz, respectively.
Architectural and physical design challenges for one-million gate FPGAs and beyond
Authors: Jonathan Rose, Dwight Hill
Venue: Proceedings of the 1997 ACM fifth international symposium on Field-programmable gate arrays (1997)

Process technology advances tell us that the one-million gate Field-Programmable Gate Array (FPGA) will soon be here, and larger devices shortly after that. We feel that current architectures will not estend directly to this scale because: they do not handle routing delays effectively; they require excessive compile/place/route times; and because they do not exploit new opportunities are presented by the increase in available transistors and wiring. In this paper we describe several challenges that will need to be solved for these large-scale FPGAs to realize their full potential.
Fast, Accurate and Consistent Modeling of Drainage andSurrounding Terrain
Authors: P. Fua
Venue: International Journal of Computer Vision (1998)

We propose an automated approach to modeling drainage channels&mdash;and, more generally, linear features that lie on the terrain&mdash;from multiple images. It produces models of the features and of the surrounding terrain that are accurate and consistent and requires only minimal human intervention.We take advantage of geometric constraints and photommetric knowledge. First, rivers flow downhill and lie at the bottom of valleys whose floors tend to be either V- or U-shaped. Second, the drainage pattern appears in gray-level images as a network of linear features that can be visually detected.Many approaches have explored individual facets of this problem. Ours unifies these elements in a common framework. We accurately model terrain and features as 3-dimensional objects from several information sources that may be in error and inconsistent with one another. This approach allows us to generate models that are faithful to sensor data, internally consistent and consistent with physical constraints. We have proposed generic models that have been applied to the specific task at hand. We show that the constraints can be expressed in a computationally effective way and, therefore, enforced while initializing the models and then fitting them to the data. Furthermore, these techniques are general enough to work on other features that are constrained by predictable forces.
Tutorial on artificial intelligence
Authors: James K. Hightower
Venue: Proceedings of the 17th conference on Winter simulation (1985)

Artificial Intelligence (AI) is experiencing a resurgence of popularity as expert systems show commercial success. This tutorial will be an overview of AI theories, concepts and techniques. The major areas of problem solving and knowledge representation will be discussed. Emphasis will be placed on rule-based systems. While the majority of the time will be spent on topics dealing with the current state of AI, a portion of time will be devoted to potential interaction between AI and Simulation in such areas as Decision Support Systems, modelling uncertainty, etc. Attendees will be encouraged to participate in discussions and suggest possible approaches to problem solving issues. Each attendee will receive a set of readings on the topics discussed along with a copy of the viewgraphs used in the tutorial. The notes also include a selected bibliography on artificial intelligence and descriptions of several successful systems.
The disjunctive decomposition of logic functions
Authors: Valeria Bertacco, Maurizio Damiani
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

We present an algorithm for extracting a disjunctive decomposition from the BDD representation of a logic function F. The output of the algorithm is a multiple-level netlist exposing the hierarchical decomposition structure of the function. The algorithm has theoretical quadratic complexity in the size of the input BDD. Experimentally, we were able to decompose most synthesis benchmarks in less than one second of CPU time, and to report on the decomposability of several complex ISCAS combinational benchmarks. We found the final netlist to be often close to the output of more complex dedicated optimization tools.
Simulation analysis of two adjacent traffic signals
Authors: Kiyoshi Yamada, Tenny N. Lam
Venue: Proceedings of the 17th conference on Winter simulation (1985)

The traffic delay and signal timing offset of adjacent signalized intersections are studied by stochastic computer simulation. The emphasis is on the effect of turning movements on traffic signal coordination. Coordination synchronizes the flow of traffic through a sequence of signals in order to minimize delays and stops. It's application is traditionally restricted to major thoroughfares where turning movements from side streets are insignificant. This study attempts to show that there are benefits of coordination for some combinations of side street turning traffic and how to obtain the optimal offsets from the simulation model.
A Geometric Approach to Perturbation Theory of Matrices and Matrix Pencils. Part I: Versal Deformations
Authors: Alan Edelman, Erik Elmroth, Bo Kågström
Venue: SIAM Journal on Matrix Analysis and Applications (1997)

We derive versal deformations of the Kronecker canonical form by deriving the tangent space and orthogonal bases for the normal space to the orbits of strictly equivalent matrix pencils. These deformations reveal the local perturbation theory of matrix pencils related to the Kronecker canonical form. We also obtain a new singular value bound for the distance to the orbits of less generic pencils. The concepts, results, and their derivations are mainly expressed in the language of numerical linear algebra. We conclude with experiments and applications.
Monotone Circuits for Connectivity Have Depth (log n)2-o(1)
Authors: Mikael Goldmann, Johan Håstad
Venue: SIAM Journal on Computing (1998)

We prove that a monotone circuit of size nd recognizing connectivity must have depth $\Omega((\log n)^2/\log d)$. For formulas this implies depth $\Omega((\log n)^2/\log\log n)$. For polynomial-size circuits the bound becomes $\Omega((\log n)^2)$ which is optimal up to a constant.
Computer graphics pioneers
Authors: Carl Machover
Venue: ACM SIGGRAPH Computer Graphics (1997)

When Editor Gordon Cameron asked me if I thought a regular column in Computer Graphics authored by computer graphics "pioneers" would be a good idea, I responded with an enthusiastic "yes." Then he asked me if I wanted to write it, and I became somewhat less enthusiastic. However, I've been able to convince Sherry Keowen, Executive Director of the Computer Graphics Pioneers, a society comprised of long-time computer graphics professionals, to co-write the column with me. Between the two of us, we should be able to develop a regular feature.Of course, there is one question we might ask: "Is anyone really interested in a column about the Computer Graphics Pioneers?" At the August 1996 board meeting of the editorial board of IEEE Computer Graphics and Applications (CG amp;A), I suggested that CG amp;A do something in conjunction with the 25th anniversary of ACM SIGGRAPH conferences. One of our board members looked me in the eye and said, "Is anybody interested in that old stuff?" That's a valid question. However, since we attracted about 2,000 to the "Into The Fifth Decade Of Computer Graphics" panel on the last day of SIGGRAPH 96, I suppose I can respond with a tentative "yes."In any case, we plan to share with you some stories of the people and events that have shaped computer graphics; some quite significant, some modest recollections.
Symmetry and Network Structure
Authors: Stefan Reimann
Venue: Neural Processing Letters (1997)

In this paper, the auto-association problem is discussed using group theoretical methods. Considering the symmetry group of a given set of test sequences, it is shown to be possible to construct a class of neural networks acting as auto-associators on this set. It turns out that the symmetry of the network structure is already determined by the symmetries of the set of test sequences, indicating that learning a set of elements applied is concerned with finding invariant relations inherent in this set. Moreover, the main result offers the possibility, to construct all optimal network structures and, hence, to decide whether a solution found by a particular learning algorithm is optimal or not.