ppxscal/embedding_network huggingface dataset:
Diagnosis of realistic bridging faults with single stuck-at information
Authors: Brian Chess, David B. Lavo, F. Joel Ferguson, Tracy Larrabee
Venue: Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design (1995)

Abstract: Precise failure analysis requires accurate fault diagnosis. A previously proposed method for diagnosing bridging faults using single stuck-at dictionaries was applied only to small circuits, produced large and imprecise diagnoses, and did not take into account the Byzantine Generals Problem for bridging faults. We analyze the original technique and improve it by introducing the concepts of match restriction, match requirement, and failure recovery. Our new technique, which requires no information other than that used by standard stuck-at methods, produces diagnoses that are an order of magnitude smaller than those produced by the original technique and produces many fewer misleading diagnoses than that of traditional stuck-at diagnosis.
Simple and effective link-time optimization of Modula-3 programs
Authors: Mary F. Fernández
Venue: Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation (1995)

Modula-3 supports development of modular programs by separating an object's interface from its implementation. This separation induces a runtime overhead in the implementation of objects, because it prevents the compiler from having complete information about a program's type hierarchy. This overhead can be reduced at link time, when the entire type hierarchy becomes available. We describe opportunities for link-time optimization of Modula-3, present two link-time optimizations that reduce the runtime costs of Modula-3's opaque types and methods, and show how link-time optimization could provide C++ which the benefits of opaques types at no additional runtime cost.Our optimization techniques are implemented in mld, a retargetable linker for the MIPS, SPARC, and Intel 486, mld links a machine-independent intermediate code that is suitable for link-time optimization and code generation. Linking intermediate code simplifies implementation of the optimizations and makes it possible to evaluate them on a wide range of architectures. mld's optimizations are effective: they reduce the total number of instructions executed by up to 14% and convert as many as 79% of indirect calls to direct calls.
Advanced methods for simulation output analysis
Authors: Christos Alexopoulos
Venue: Proceedings of the 27th conference on Winter simulation (1995)

This paper reviews statistical methods for analyzing output data from computer simulations of single systems. In particular, it focuses on the problems of choosing initial conditions and estimating steady-state system parameters. The estimation techniques include the replication/deletion approach, the regenerative method, the batch means method, the standardized time series method, the autoregressive method, and the spectral estimation method.
Two recent algorithms for the global minimum cut problem
Authors: Ashok Subramanian
Venue: ACM SIGACT News (1995)

This article provides a self-contained exposition of two recent algorithms for the Global Minimum Cut problem. In this problem, we are given an undirected graph with positive weights on its edges, and we seek a proper subset S of the vertices that minimizes the total weight of all edges that have exactly one endpoint in S. Unlike traditional approaches to this problem, the new algorithms are not based on network flow computations. Instead they are based on a decomposition of the weighted graph into a sequence of weighted forests. The decomposition is used to identify a light set of edges that contains every light cutset of the graph. In general, such a decomposition requires too much space (and hence time) to write down. However, there is an efficient graph search procedure, Maximum Adjacency Search, that can be used to compute an implicit representation of such a decomposition in O(m + n log n) time.The first algorithm we discuss, due to Nagamochi and Ibaraki [5, 6], requires O(n) invocations of Maximum Adjacency Search to compute a global minimum cut. The second algorithm, due to Matula [4], requires O(log n) invocations of Maximum Adjacency Search to compute an approximately minimum cut. We do not discuss here the randomized algorithms of Karger or the matroid-based approach of Gabow.
Vector Orthogonal Polynomials and Least Squares Approximation
Authors: Adhemar Bultheel, Marc Van Barel
Venue: SIAM Journal on Matrix Analysis and Applications (1995)

We describe an algorithm for complex discrete least squares approximation, which turns out to be very efficient when function values are prescribed in points on the real axis or on the unit circle. In the case of polynomial approximation, this reduces to algorithms proposed by Rutishauser, Gragg, Harrod, Reichel, Ammar, and others. The underlying reason for efficiency is the existence of a recurrence relation for orthogonal polynomials, which are used to represent the solution. We show how these ideas can be generalized to least squares approximation problems of a more general nature.
QMRPACK: a package of QMR algorithms
Authors: Roland W. Freund, Noël M. Nachtigal
Venue: ACM Transactions on Mathematical Software (TOMS) (1996)

The quasi-minimal residual (QMR) algorithm is a Krylov-subspace method for the iterative solution of large non-Hermitian linear systems. QMR is based on the look-ahead Lanczos algorithm that, by itself, can also be used to obtain approximate eigenvalues of large non-Hermitian matrices. QMRPACK is a software package with Fortran 77 implementations of the QMR algorithm and variants thereof, and of the three-term and coupled two-term look-ahead Lanczos algorithms. In this article, we discuss some of the features of the algorithms in the package, with emphasis on the issues related to using the codes. We describe in some detail two routines from the package, one for the solution of linear systems and the other for the computation of eigenvalue approximations. We present some numerical examples from applications where QMRPACK was used.
Data and computation transformations for multiprocessors
Authors: Jennifer M. Anderson, Saman P. Amarasinghe, Monica S. Lam
Venue: ACM SIGPLAN Notices (1995)

Effective memory hierarchy utilization is critical to the performance of modern multiprocessor architectures. We have developed the first compiler system that fully automatically parallelizes sequential programs and changes the original array layouts to improve memory system performance. Our optimization algorithm consists of two steps. The first step chooses the parallelization and computation assignment such that synchronization and data sharing are minimized. The second step then restructures the layout of the data in the shared address space with an algorithm that is based on a new data transformation framework. We ran our compiler on a set of application programs and measured their performance on the Stanford DASH multiprocessor. Our results show that the compiler can effectively optimize parallelism in conjunction with memory subsystem performance.
Semantic assumptions and query evaluation in temporal databases
Authors: Claudio Bettini, X. Sean Wang, Elisa Bertino, Sushil Jajodia
Venue: Proceedings of the 1995 ACM SIGMOD international conference on Management of data (1995)

When querying a temporal database, a user often makes certain semantic assumptions on stored temporal data. This paper formalizes and studies two types of semantic assumptions: point-based and interval-based. The point-based assumptions include those assumptions that use interpolation methods, while the interval-based assumptions include those that involve different temporal types (time granularities). Each assumption is viewed as a way to derive certain implicit data from the explicit data stored in the database. The database system must use all explicit as well as (possibly infinite) implicit data to answer user queries. This paper introduces a new method to facilitate such query evaluations. A user query is translated into a system query such that the answer of this system query over the explicit data is the same as that of the user query over the explicit and the implicit data. The paper gives such a translation procedure and studies the properties (safety in particular) of user queries and system queries.
Knowledge-based editing and visualization for hypermedia encyclopedias
Authors: Christoph Hüser, Klaus Reichenberger, Lothar Rostek, Norbert A. Streitz
Venue: Communications of the ACM (1995)

One of the main goals in developing digital libraries is to provide users with opportunities for accessing and using information in highly flexible and user-oriented ways not available in current information repositories. This implies a focus on supporting the intellectual access to information and to consider the context of the information request. Systems for digital libraries should be able to select the appropriate type and amount of information from a comprehensive pool and compose it on the fly for a meaningful and coherent presentation which might have never occurred before or never will again after this event because it is customized to the current situation.
Stochastic version of second-order (Newton-Raphson) optimization using only function measurements
Authors: James C. Spall
Venue: Proceedings of the 27th conference on Winter simulation (1995)

Consider the problem of loss function minimization when only (possibly noisy) measurements of the loss function are available. In particular, no measurements of the gradient of the loss function are assumed available (as required in the steepest descent or Newton-Raphson algorithms). Stochastic approximation (SA) algorithms of the multivariate Kiefer-Wolfowitz (finite-difference) form have long been considered for such problems, but with only limited success. The simultaneous perturbation SA (SPSA) algorithm has successfully addressed one of the major shortcomings of those finite-difference SA algorithms by significantly reducing the number of measurements required in many multivariate problems of practical interest. This SPSA algorithm displays the classic behaviour of 1st-order search algorithms by typically exhibiting a steep initial decline in the loss function followed by a slow decline to the optimum. This paper presents a 2nd-order SPSA algorithm that is based on estimating both the loss function gradient and inverse Hessian matrix at each iteration. The aim of this approach is to emulate the acceleration properties associated with deterministic algorithms of Newton-Raphson form, particularly in the terminal phase where the 1st-order SPSA algorithm slows down in its convergence. This 2nd-order SPSA algorithm requires only three loss function measurements at each iteration, independent of the problem dimension. This paper includes a formal convergence result for this 2nd-order approach.
Pattern generation for a deterministic BIST scheme
Authors: Sybille Hellebrand, Birgit Reeb, Steffen Tarnick, Hans-Joachim Wunderlich
Venue: Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design (1995)

Recently a deterministic built-in self-test scheme has been presented based on reseeding of multiple-polynomial linear feedback shift registers. This scheme encodes deterministic test sets at distinctly lower costs than previously known approaches. In this paper it is shown how this scheme can be supported during test pattern generation. The presented ATPG algorithm generates test sets which can be encoded very efficiently. Experiments show that the area required for synthesizing a BIST scheme that encodes these patterns is significantly less than the area needed for storing a compact test set. Furthermore, it is demonstrated that the proposed approach of combining ATPG and BIST synthesis leads to a considerably reduced hardware overhead compared to encoding a conventionally generated test set.
Evaluation of multithreaded uniprocessors for commercial application environments
Authors: Richard J. Eickemeyer, Ross E. Johnson, Steven R. Kunkel, Mark S. Squillante, Shiafun Liu
Venue: ACM SIGARCH Computer Architecture News (1996)

As memory speeds grow at a considerably slower rate than processor speeds, memory accesses are starting to dominate the execution time of processors, and this will likely continue into the future. This trend will be exacerbated by growing miss rates due to commercial applications, object-oriented programming and micro-kernel based operating systems. We examine the use of coarse-grained multithreading to address this important problem in uniprocessor on-line transaction processing environments where there is a natural, coarse-grained parallelism between the tasks resulting from transactions being executed concurrently, with no application software modifications required. Our results suggest that multithreading can provide significant performance improvements for uniprocessor commercial computing environments.
A forward and backward linkage agricultural production simulation model
Authors: Fe Zinnia Albay, Conrado M. Gempesaw,  II, J. Richard Bacon, Levsiri Munasinghe
Venue: Proceedings of the 27th conference on Winter simulation (1995)

The paper illustrates the use of a forward and backward linkage agricultural production simulation model. CHICKSIM III is a comprehensive, farm-level, and stochastic capital budgeting simulation model which provides an analytical framework for simulating probable consequences of production, marketing, financial, and policy variables on the profitability of a farm or agribusiness firm. The model is applied to evaluate the profitability of a representative farm producing broiler, beef, corn, and kenaf.
Building the interspace: the Illinois Digital Library Project
Authors: Bruce Schatz
Venue: Communications of the ACM (1995)

The University of Illinois is building a large-scale digital library testbed, planned to grow to thousands of users and thousands of documents, with the goal of bringing professional quality search and display to Internet information services. Concurrently, research is designing and implementing a prototype of the Interspace, a vision of what the Internet will evolve into where the distributed network of interconnected machines is replaced by a distributed space of interlinked information.
Computational approach to the statistical mechanics of protein folding
Authors: Ming-Hong Hao, Harold A. Scheraga
Venue: Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM) (1995)

A statistical mechanical approach to the protein folding problem is developed based on computer simulations. The properties of proteins related to conformation and folding are determined from the density of states of the protein. A new simulation procedure, the Entropy Sampling Monte Carlo method, is used to determine accurately the density of states of the protein. To enhance the efficiency of sampling the conformational space of a protein, two techniques (a conformational-biased chain regrowth procedure and a jump-walking method) were introduced into the simulation. Applications of the approach to study a number of model polypeptides and a small protein, Bovine Pancreatic Trypsin Inhibitor, have been carried out. The results obtained demonstrate that the new approach is more powerful and produces richer information about the thermodynamics and folding behavior of proteins than conventional simulation methods.
The handwritten trie: indexing electronic ink
Authors: Walid Aref, Daniel Barbará, Padmavathi Vallabhaneni
Venue: Proceedings of the 1995 ACM SIGMOD international conference on Management of data (1995)

The emergence of the pen as the main interface device for personal digital assistants and pen-computers has made handwritten text, and more generally ink, a first-class object. As for any other type of data, the need of retrieval is a prevailing one. Retrieval of handwritten text is more difficult than that of conventional data since it is necessary to identify a handwritten word given slightly different variations in its shape. The current way of addressing this is by using handwriting recognition, which is prone to errors and limits the expressiveness of ink. Alternatively, one can retrieve from the database handwritten words that are similar to a query handwritten word using techniques borrowed from pattern and speech recognition. In particular, Hidden Markov Models (HMM) can be used as representatives of the handwritten words in the database. However, using HMM techniques to match the input against every item in the database (sequential searching) is unacceptably slow and does not scale up for large ink databases. In this paper, an indexing technique based on HMMs is proposed. The new index is a variation of the trie data structure that uses HMMs and a new search algorithm to provide approximate matching. Each node in the tree contains handwritten letters, where each letter is represented by an HMM. Branching in the trie is based on the ranking of matches given by the HMMs. The new search algorithm is parametrized so that it provides means for controlling the matching quality of the search process via a time-based budget. The index dramatically improves the search time in a database of handwritten words. Due to the variety of platforms for which this work is aimed, ranging from personal digital assistants to desktop computers, we implemented both main-memory and disk-based systems. The implementations are reported in this paper, along with performance results that show the practicality of the technique under a variety of conditions.
Commercial applications of natural language processing
Authors: Kenneth W. Church, Lisa F. Rau
Venue: Communications of the ACM (1995)

Vast quantities of text are becoming available in electronic form, ranging from published documents (e.g., electronic dictionaries, encyclopedias, libraries and archives for information retrieval services), to private databases (e.g., marketing information, legal records, medical histories), to personal email and faxes. Online information services are reaching mainstream computer users. There were over 15 million Internet users in 1993, and projections are for 30 million in 1997. With media attention reaching all-time highs, hardly a day goes by without a new article on the National Information Infrastructure, digital libraries, networked services, digital convergence or intelligent agents. This attention is moving natural language processing along the critical path for all kinds of novel applications.
Principles for writing reusable libraries
Authors: Glenn S. Fowler, David G. Korn, Kiem-Phong Vo
Venue: ACM SIGSOFT Software Engineering Notes (1995)

Over the past 10 years, the Software Engineering Research Department in AT T has been engaging in a research program to build a collection of highly portable advanced software tools known as Ast, Advanced Software Technology. A recent monograph, &ldquo;Practical Reusable UNIX Software&rdquo; (John Wiley Sons, Inc., 1995), summarizes the philosophy and components of this research program. A major component of this program is a collection of portable, and reusable libraries servicing a wide range of functions, from a porting base to all known UNIX platforms, to efficient buffered I/O, memory allocation, data compression, and expression evaluation. The libraries currently stand at about 150,000 non-commented lines of C code. They are developed and maintained independently by different researchers. Yet they work together seamlessly&mdash;largely because of a collection of library design principles and conventions developed to help maintaining interface consistency and reducing needless or overlapped work.
An example of error propagation reinterpreted as subtractive cancellation
Authors: James A. Delaney
Venue: ACM SIGNUM Newsletter (1996)

The simple recursive algorithm Ik = 1 - k Ik-1 with I0 = 1 - 1/e (the result of an integration by parts) has served as an example of catastrophic error propagation. The traditional interpretation is that an initially small roundoff error in 1/e grows by a factor of k1. This note presents an alternate error analysis in terms of subtractive cancellation. From this perspective, the precise error is observable in detail, as is the effect of the floating point mantissa length. (Related material is referenced in 6.)
The future of computational complexity theory: part I
Authors: Christos H. Papadimitriou
Venue: ACM SIGACT News (1996)

As you probably already know, there is an active discussion going on---in forums ranging from lunch-table conversations to workshops on "strategic directions" to formal reports---regarding the future of theoretical computer science. Since your complexity columnist does not know The Answer, I've asked a number of people to contribute their comments on the narrower issue of the future of complexity theory. The only ground rule was a loose 1-page limit; each contributor could choose what aspect(s) of the future to address, and the way in which to address them. The first installment of contributions appears in this issue, and one or two more installments will appear among the next few issues.Also coming during the next few issues: the search for the perfect theory journal, and (for the sharp-eyed) Lance Fortnow dons a clown suit. Finally, let me mention that work of Russell Impagliazzo resolves one of the open questions from Complexity Theory Column 11.
Application of Vector-Valued Rational Approximations to the Matrix Eigenvalue Problemand Connections with Krylov Subspace Methods
Authors: Avram Sidi
Venue: SIAM Journal on Matrix Analysis and Applications (1995)

Let $F(z)$ be a vector-valued function $F : {\bf C} \rightarrow {\bf C}^N$, which is analytic at $z = 0$ and meromorphic in a neighborhood of $z = 0$, and let its Maclaurin series be given. In a recent work [J. Approx. Theory, 76 (1994), pp. 89--111] by the author, vector-valued rational approximation procedures for $F(z)$ that are based on its Maclaurin series, were developed, and some of their convergence properties were analyzed in detail. In particular, a Koenig-type theorem concerning their poles and a de Montessus-type theorem concerning their uniform convergence in the complex plane were given. With the help of these theorems it was shown how optimal approximations to the poles of $F(z)$ and the principal parts of the corresponding Laurent series expansions can be obtained. In this work we use these rational approximation procedures in conjunction with power iterations to develop bona fide generalizations of the power method for an arbitrary $N \times N$ matrix that may or may not be diagonalizable. These generalizations can be used to obtain simultaneously several of the largest distinct eigenvalues and corresponding eigenvectors and other vectors in the invariant subspaces. We provide interesting constructions for both nondefective and defective eigenvalues and the corresponding invariant subspaces, and present a detailed convergence theory for them. This is made possible by the observation that vectors obtained by power iterations with a matrix are actually coefficients of the Maclaurin series of a vector-valued rational function, whose poles are the reciprocals of some or all of the nonzero eigenvalues of the matrix being considered, while the coefficients in the principal parts of the Laurent expansions of this rational function are vectors in the corresponding invariant subspaces. In addition, it is shown that the generalized power methods of this work are equivalent to some Krylov subspace methods, among them the methods of Arnoldi and Lanczos. Thus, the theory of the present work provides a set of completely new results and constructions for these Krylov subspace methods. At the same time this theory suggests a new mode of usage for these Krylov subspace methods that has been observed to possess computational advantages over their common mode of usage in some cases. We illustrate some of the theory and conclusions derived from it with numerical examples.