ppxscal/embedding_network huggingface dataset:
Benchmarks for cell synthesis
Authors: Dwight D. Hill, Bryan Preas
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

Cell synthesis is the process of transforming detailed, transistor level specifications and technology information into layout. While cell synthesis has been investigated for several years, only recently has it become practical and pervasive. To accelerate this process and to encourage further refinement, a set of benchmarks was developed for cell synthesis tools. The benchmarks try to balance the objective of universal participation against that of comprehensive testing. They cover the areas of arithmetic, FSM, RAM, and analog design and include detailed descriptions of technology rules. This paper discusses the benchmarks, and how they were received at the 1989 Physical Design Workshop, and how they may be used as a guide to future work in this field.
Automated test plan generator for database applications systems
Authors: Maryann Robbert, Fred J. Maryanski
Venue: ACM SIGSMALL/PC Notes (1991)

As database applications become larger and more complex, the development of suitable test plans to assure robust and reliable software becomes essential. The testing procedure must establish the applications reliability from the human expectation viewpoint as well as its correctness and robustness.The predetermined goals of this testing procedure are to assure high reliability of the application and ascertain that the software performed according to specifications, while remaining within the project's time and budgetary constraints. Errors identified during development can be corrected with minimal cost when compared to errors uncovered by users after the software release. By overlapping testing with development, and automating the production of a standardized set of test plans, the incremental production time can be minimized. By generating an application specific test plan, syntactic and semantic specifications of the actual system applications can be tested. A side effect of this specific, interleaved correctness testing is the uncovering of user interface inconsistencies and their refinement before exposure of the application to the real end user.Analysis of the results of our experimental testing showed the keystone to be the test plan. Since the completeness and veracity of this document is a prime determining factor in the validity of the testing, we have developed program using C++ on a Sun workstation to automatically generate test plans from the design schema.This paper presents an automated/manual testing scheme suitable for assuring the validity of large database applications. The initial premises, design execution and consequences of the test procedure is detailed followed by a description of the automation of strategic components.
Implementation of a &ldquo;Lisp comprehension&rdquo; macro
Authors: Guy Lapalme
Venue: ACM SIGPLAN Lisp Pointers (1991)

This paper describes a set of Lisp macros that enable the use of "list comprehensions" which are a very powerful notation that provides a very compact expression of common list operations see [2] for a full discussion. List comprehensions have been introduced by David Turner in KRC, where they were called ZF-expressions [7]. They have since been introduced in several other pure functional languages like SASL [8], Miranda1 [5] and Haskell [3].
Deterministic skip lists
Authors: J. Ian Munro, Thomas Papadakis, Robert Sedgewick
Venue: Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms (1992)

We explore techniques based on the notion of a skip list to guarantee logarithmic search, insert and delete costs. The basic idea is to insist that between any pair of elements above a given height are a small number of elements of precisely that height. The desired behaviour can be achieved by either using some extra space for pointers, or by adding the constraint that the physical sizes of the nodes be exponentially increasing. The first approach leads to simpler code, whereas the second is ideally suited to a buddy system of memory allocation. Our techniques are competitive in terms of time and space with balanced tree schemes, and, we feel, inherently simpler when taken from first principles.
Dragon systems resource management benchmark results&mdash;February 1991
Authors: James Baker, Janet Baker, Paul Bamberg, Larry Gillick, Lori Lamel, Robert Roth, Francesco Scattone, Dean Sturtevant, Ousmane Ba, Richard Benedict
Venue: Proceedings of the workshop on Speech and Natural Language (1991)

In this paper we present preliminary results obtained at Dragon Systems on the Resource Management benchmark task. The basic conceptual units of our system are Phonemes-in-Context (PICs), which are represented as Hidden Markov Models, each of which is expressed as a sequence of Phonetic Elements (PELs). The PELs corresponding to a given phoneme constitute a kind of alphabet for the representation of PICs.For the speaker-dependent tests, two basic methods of training the acoustic models were investigated. The first method of training the Resource Management models is to re-estimate the models for each test speaker from that speaker's training data, keeping the PEL spellings of the PICs fixed. The second approach is to use the re-estimated models from the first method to derive a segmentation of the training data, then to respell the PICs in a largely speaker-dependent manner in order to improve the representation of speaker differences. A full explanation of these methods is given, as are results using each method.In addition to reporting on two different training strategies, we discuss N-Best results. The N-Best algorithm is a modification of the algorithm proposed by Soong and Huang at the June 1990 workshop. This algorithm runs as a post-processing step and uses an A*-search (an algorithm also known as a 'stack decoder').
Generating textures on arbitrary surfaces using reaction-diffusion
Authors: Greg Turk
Venue: Proceedings of the 18th annual conference on Computer graphics and interactive techniques (1991)

This paper describes a biologically motivated method of texture synthesis called reaction-diffusion and demonstrates how these textures can be generated in a manner that directly matches the geometry of a given surface. Reaction-diffusion is a process in which two or more chemicals diffuse at unequal rates over a surface and react with one another to form stable patterns such as spots and stripes. Biologists and mathematicians have explored the patterns made by several reaction-diffusion systems. We extend the range of textures that have previously been generated by using a cascade of multiple reaction-diffusion systems in which one system lays down an initial pattern and then one or more later systems refine the pattern. Examples of patterns generated by such a cascade process include the clusters of spots on leopards known as rosettes and the web-like patterns found on giraffes. In addition, this paper introduces a method which reaction-diffusion textures are created to match the geometry of an arbitrary polyhedral surface. This is accomplished by creating a mesh over a given surface and then simulating the reaction-diffusion process directly on this mesh. This avoids the often difficult task of assigning texture coordinates to a complex surface. A mesh is generated by evenly distributing points over the model using relaxation and then determining which points are adjacent by constructing their Voronoi regions. Textures are rendered directly from the mesh by using a weighted sum of mesh values to compute surface color at a given position. Such textures can also be used as bump maps.
A functional approach to strategic planning information resources: the key roles of the IS and HR functions
Authors: Raymond McLeod,  Jr.
Venue: ACM SIGCPR Computer Personnel (1991)

Much has been written about strategic planning for information resources, implying generally that such planning is the sole responsibility of the information systems (IS) function. This article explains why other functions, including human resources (HR), share this responsibility. The article describes how such planning might be done.
Computer aided software engineering (CASE) based on transformation with object-oriented logic (TOOL)
Authors: Jin W. Chang
Venue: Proceedings of the 1992 ACM annual conference on Communications (1992)

Traditional software engineering separates conceptual software development from design, assuming that concentration on the conceptual level yields a consistent software system&mdash;an assumption that may, due to weak communication links between conceptual and actual design, be incorrect. In this paper, a new paradigm&mdash;&ldquo;Transformation with Object-Oriented Logic&rdquo; (TOOL)&mdash;is proposed.
Using semantics to correct parser output for ATIS utterances
Authors: Sheryl Young
Venue: Proceedings of the workshop on Speech and Natural Language (1991)

This paper describes the structure and operation of SOUL, or Semantically-Oriented Understanding of Language. SOUL is a knowledge intensive reasoning system which is opportunistically used to provide a more thorough, fine grained analysis of an input utterance following its processing by a case-frame speech parser. The SOUL postprocessor relies upon extensive semantic and pragmatic knowledge to correct, reject and/or clarify the outputs of the CMU PHOENIX case-frame parser for speech and speech transcripts. Specifically, we describe briefly both some of the linguistic phenomena which SOUL addresses and how SOUL works to correct inaccurate interpretations produced by the PHOENIX parser. Finally, we present the results on four separate, non-overlapping test sets. Our "pilot" test sets include the June 1990 DARPA ATISO test set and two test sets composed of unseen ATISO data distributed in June 1990 that, unlike the DARPA test sets, contain unrestricted utterances. Our forth test set is the official DARPA February 1991 ATIS1 test set. These evaluations illustrate the decrease in error rate that results from SOUL's semantic and pragmatic postprocessing are most pronounced in unrestricted, as opposed to carefully constrained test sets. Specifically, a performance comparison between unrestricted and restricted test sets in pilot experiments show that error rates are reduced by 84% as opposed to 54% when no utterances are pruned from the speaker transcripts.
Memory latency effects in decoupled architectures with a single data memory module
Authors: Lizyamma Kurian, Paul T. Hulina, Lee D. Coraor
Venue: ACM SIGARCH Computer Architecture News (1992)

Decoupled computer architectures partition the memory access and execute functions in a computer program and achieve high performance by exploiting the fine-grain parallelism between the two. These architectures make use of an access processor to perform the data fetch ahead of demand by the execute process and hence are often less sensitive to memory access delays than conventional architectures. Past performance studies of decoupled computers used memory systems that are interleave or pipelined. We undertake a simulation study of the latency effects in decoupled computers when connected to a single, conventional non-interleaved data memory module so that the effect of decoupling is isolated from the improvement caused by interleaving. We compare decoupled computer performance to single processors with caches, study the memory latency sensitivity of the decoupled systems, and also perform simulations to determine the significance of data caches in a decoupled computer architecture. The Lawrence Livermore Loops and two signal processing algorithms are used as the simulation benchmark.
Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices
Authors: Ilan Adler, Peter A. Beling
Venue: Proceedings of the 32nd annual symposium on Foundations of computer science (1991)

It is shown that a modified variant of the interior point method can solve linear programs (LPs) whose coefficients are real numbers from a subring of the algebraic integers. By defining the encoding size of such numbers to be the bit size of the integers that represent them in the subring, it is proved that the modified algorithm runs in time polynomial in the encoding size of the input coefficients, the dimension of the problem, and the order of the subring. The Tardos scheme is then extended to this case, yielding a running time that is independent of the objective and right-hand side data. As a consequence of these results, it is shown that LPs with real circulant coefficient matrices can be solved in strongly polynomial time. It is also shown how the algorithm can be applied to LPs whose coefficients belong to the extension of the integers by a fixed set of square roots.
Performance evaluation of disk subsystems
Authors: Ruben Yomtov
Venue: ACM SIGARCH Computer Architecture News (1992)

Mainframe Central Processor Unit (CPU) speed/performance has increased by more than two orders of magnitude since the 1970's. However, the I/O subsystem performance has only quadrupled in the same period of time. There is a need for a computer architecture with an effective storage hierarchy to complement improvements made in the CPU performance. This paper presents a technique to calculate the I/O performance of disk subsystems with and without disk cache buffers. Through a series of calculation it is shown that the best way to improve I/O performance is to increase the number of data paths and use disk memory caching.
A process for inserting chips into planar microwave structures on semiconductor substrates
Authors: V. Güngerich, R. Schadel, R. Ramisch, P. Russer
Venue: Microelectronic Engineering (1992)

A process to insert chips into planar microwave structures on semiconductor substrates is described. The process consists mainly of a photolithography step, a wet etching and a connection step and follows conventional thin film technology. Using this process, lower chip-to-circuit inductances compared to wire bonding are achieved. Also, connections are precisely reproducible, which reduces uncertainties in circuit modelling.
Exact Real Computer Arithmetic with Continued Fractions
Authors: J. Vuillemin
Venue: IEEE Transactions on Computers (1990)

A representation of the computable real numbers by continued fractions is introduced. This representation deals with the subtle points of undecidable comparison and integer division, as well as representing the infinite 1/0 and undefined 0/0 numbers. Two general algorithms for performing arithmetic operations are introduced. The algebraic algorithm, which computes sums and products of continued fractions as a special case, basically operates in a positional manner, producing one term of output for each term of input. The transcendental algorithm uses a general formula of Gauss to compute the continued fractions of exponentials, logarithms, trigonometric functions, and a wide class of special functions. A prototype system has been implemented in LeLisp and the performance of these algorithms is promising.
Theory of Matrix Morphology
Authors: Stephen S. Wilson
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

The current concept of mathematical morphology (called scalar morphology here) is extended to a matrix morphology formalism. A formal definition of matrix morphology on binary images is followed by a complete pictorial example of a nontrivial application. Binary matrix morphology is extended to gray-scale matrix morphology using a traditional development. General window transforms are expressed in terms of matrices. An application to character recognition is given.
Knowledge representing schemes for planning
Authors: Wan-Bih Liaw, Frank M. Brown
Venue: Proceedings of the 1992 ACM annual conference on Communications (1992)

An investigation of recent development of planning systems is performed, with emphasis on issues of knowledge representation, and the possible solutions for representing the effects of actions are pointed out.
Parallel multiplication and powering of polynomials
Authors: Carl G. Ponder
Venue: Journal of Symbolic Computation (1991)

This paper examines the most efficient known serial and parallel algorithms for multiplying and powering polynomials. For sparse polynomials the Simp algorithm multiplies using a simple divide and conquer approach, and the NOMC algorithm computes powers using a multinomial expansion. For dense polynomials the FFT multiplies and powers by evaluating polynomials at a set of points, performing pointwise multiplication or powering, and interpolating a polynomial through the results. Practical issues of applying these algorithms in algebraic manipulation systems are discussed.
Composable attribute grammars: support for modularity in translator design and implementation
Authors: R. Farrow, T. J. Marlowe, D. M. Yellin
Venue: Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1992)

This paper introduces Composable Attribute Grammars (CAGs), a formalism that extends classical attribute grammars to allow for the modular composition of translation specifications and of translators. CAGs bring to complex translator writing systems the same benefits of modularity found in modern programming languages, including comprehensibility, reusability, and incremental meta-compilation. A CAG is built from several smaller component AGs, each of which solves a particular subproblem, such as name analysis or register allocation. A component AG is based upon a simplified phrase-structure that reflects the properties of its subproblem rather than the phrase-structure of the source language. Different component phrase-structures for various subproblems are combined by mapping them into a phrase-structure for the source language. Both input and output attributes can be associated with the terminal symbols of a component AG. Output attributes enable the results of solving a subproblem to be distributed back to anywhere that originally contributed part of the subproblem, e.g. transparently distributing the results of global name analysis back to every symbolic reference in the source program. After introducing CAGs by way of an example, we provide a formal definition of CAGs and their semantics. We describe a subclass of CAGs and their semantics. We describe a subclass of CAGs, called separable CAGs, that have favorable implementation properties. We discuss the novel aspects of CAGs, compare them to other proposals for inserting modularity into attribute grammars, and relate our experience using CAGs in the Linguist translator-writing system.
A design for the ICARUS architecture
Authors: Pat Langley, Kathleen B. McKusick, John A. Allen, Wayne F. Iba, Kevin Thompson
Venue: ACM SIGART Bulletin (1991)

We describe our designs for ICARUS, an integrated architecture for controlling an intelligent agent in a complex physical environment. By navigating between locations and manipulating other objects, the agent influences the world and achieves its goals. The architecture includes components for perceiving the environment, for generating plans to solve problems, and for executing the plans generated. A fourth component manages the agent's long-term memory. Our assessment of the design suggests that it is general, versatile, scales well to larger problems, and is consistent with a variety of psychological results.
What's in a scenario?
Authors: Peter Wright
Venue: ACM SIGCHI Bulletin (1992)

Robert Campbell's article "Will the real scenario please stand up" comes at an interesting time for me because I have just begun work on a project concerned with HCI issues on the aircraft flight deck and I think I may have come across yet another use of the term 'scenario'. In this domain, the term is used to refer to a detailed and sometimes complex sequences of events. Mission scenarios for example are a detailed specification of a flight plan, a series of aircraft maneuvers and pilot tasks. These can be used to train pilots, or to consider the performance requirements of an aircraft. The term scenario is also used to refer to specific incidents or accidents. So for example, the 'Kegworth Scenario' (Cooper 1990) describes a particular accident that happened to an aircraft in the UK. One of the engines on the aircraft became damaged when a turbofan blade fractured. The pilots, in attempting to contain the fault, shut down one of the engines. What they did not realize at the time was that they had shut down the healthy engine by mistake. Later in the flight they carried out maneuvers for their final approach and the increased load on the damaged engine led it to fail entirely. The pilots were unable to restart the healthy engine they had mistakenly shutdown and the aircraft crashed onto a motorway just short of the runway threshold.
Simple Calibration Algorithm for High-Distortion Lens Camera
Authors: Yoshihiko Nomura, Michihiro Sagara, Hiroshi Naruse, Atsushi Ide
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

A simple and useful calibration method for a TV camera with a high-distortion lens is presented. The parameters to be calibrated are effective focal length, one-pixel width on an image plane, image distortion center, and distortion coefficient. A simple-pattern calibration chart composed of parallel straight lines is introduced as a reference for calibration. An ordinary 2D model fitting is decomposed into two 1D model fittings on the column and row of a frame buffer across the image distortion center by ingeniously utilizing the point symmetry characteristic of image distortion. Some parameters with a calibration chart are eliminated by setting up a calibration chart precisely and by utilizing negligibly low distortion near the image distortion center. Thus, the number of unknown parameters to be calibrated is drastically decreased, enabling simple and useful calibration. The effectiveness of the proposed calibration method is confirmed by experimentation.
Distributed, object-based programming systems
Authors: Roger S. Chin, Samuel T. Chanson
Venue: ACM Computing Surveys (CSUR) (1991)

The development of distributed operating systems and object-based programming languages makes possible an environment in which programs consisting of a set of interacting modules, or objects, may execute concurrently on a collection of loosely coupled processors. An object-based programming language encourages a methodology for designing and creating a program as a set of autonomous components, whereas a distributed operating system permits a collection of workstations or personal computers to be treated as a single entity. The amalgamation of these two concepts has resulted in systems that shall be referred to as distributed, object-based programming systems. This paper discusses issues in the design and implementation of such systems. Following the presentation of fundamental concepts and various object models, issues in object management, object interaction management, and physical resource management are discussed. Extensive examples are drawn from existing systems.
Complex Autoregressive Model for Shape Recognition
Authors: Iwao Sekita, Takio Kurita, Nobuyuki Otsu
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

A complex autoregressive model for invariant feature extraction to recognize arbitrary shapes on a plane is presented. A fast algorithm to calculate complex autoregressive coefficients and complex PARCOR coefficients of the model is also shown. The coefficients are invariant to rotation around the origin and to choice of the starting point in tracing a boundary. It is possible to make them invariant to scale and translation. Experimental results that the complicated shapes like nonconvex boundaries can be recognized in high accuracy, even in the low-order model. It is seen that the complex PARCOR coefficients tend to provide more accurate classification than the complex AR coefficients.