ppxscal/embedding_network huggingface dataset:
A hierarchy preserving hierarchical compactor
Authors: David Marple
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

This paper describes a one-dimensional compactor which simultaneously compacts the contents of all cells of a layout hierarchy without changing the hierarchy. The compactor performs both compaction and wire length minimization hierarchically using the power of the Simplex method for linear programs. Compaction of arrays, compaction of overlapping cells, and symmetry preserving compaction are also handled, since these are special cases of layout hierarchies. Using dedicated Simplex algorithms for compaction and wire length minimization, a globally optimum result is produced quickly and efficiently without the use of protection frames or domains and terminals. The compactor corrects design rule violations, preserves wire widths, and maintains terminal connections automatically. It does not yet introduce jogs in wires automatically. Results are provided for a few CMOS modules, including a ROM and an SRAM core.
Computation of Probabilities for an Island-Driven Parser
Authors: Anna Corazza, Renato De Mori, Roberto Gretter, Giorgio Satta
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

The authors describe an effort to adapt island-driven parsers to handle stochastic context-free grammars. These grammars could be used as language models (LMs) by a language processor (LP) to computer the probability of a linguistic interpretation. As different islands may compete for growth, it is important to compute the probability that an LM generates a sentence containing islands and gaps between them. Algorithms for computing these probabilities are introduced. The complexity of these algorithms is analyzed both from theoretical and practical points of view. It is shown that the computation of probabilities in the presence of gaps of unknown length requires the impractical solution of a nonlinear system of equations, whereas the computation of probabilities for cases with gaps containing a known number of unknown words has polynomial time complexity and is practically feasible. The use of the results obtained in automatic speech understanding systems is discussed.
A hypercubic sorting network with nearly logarithmic depth
Authors: C. Greg Plaxton
Venue: Proceedings of the twenty-fourth annual ACM symposium on Theory of computing (1992)

A natural class of &ldquo;hypercubic&rdquo; sorting networks is defined. The regular structure of these sorting networks allows for elegant and efficient implementations on any of the so-called hypercubic networks (e.g., the hypercube, shuffle-exchange, butterfly, and cube-connected cycles). This class of sorting networks contains Batcher's O(lg2 n)-depth bitonic sort, but not the O(lg n)-depth sorting network of Ajtai, Komlo&acute;s, and Szemere&acute;di. In fact, no o(lg2 n)-depth compare-interchange sort was previously known for any of the hypercubic networks. In this paper, we prove the existence of a family of 2O((lg lg n)1/2) lg n-depth hypercubic sorting networks. Note that this depth is o(lg1+&egr; n) for any constant &egr; > 0.
High-level synthesis: technology transfer to industry
Authors: Robin C. Sarma, Mark D. Dooley, N. Craig Newman, Graham Hetherington
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

High-level synthesis has been an active research area for ten years. However, the progress in research has yet to find its way into usage in industry. This paper describes the technology transfer of high-level synthesis at Texas Instruments. It explains how we have extended one research project, the System Architect's Workbench from Carnegie-Mellon University, into a tool that designers can use. Significant enhancements were made to the Workbench to enable it to make architectural tradeoffs and simulate the designs it produces. The resulting Architecture Design Tool was tested on a Texas Instruments' design. Based on this experience, the paper discusses how close high-level synthesis research is to being industrially useful.
An Optimal Sensing Strategy for Recognition and Localization of 3D Natural Quadric Objects
Authors: Sukhan Lee, Hernsoo Hahn
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

An optimal sensing strategy for an optical proximity sensor system engaged in the recognition and localization of 3D natural quadric objects is presented. The optimal sensing strategy consists of the selection of an optimal beam orientation and the determination of an optimal probing plane that compose an optimal data collection operation known as an optimal probing. The decision of an optimal probing is based on the measure of discrimination power of a cluster of surfaces on a multiple interpretation image, where the measure of discrimination power is defined in terms of a utility function computing the expected number of interpretations that can be pruned out by a probing. An object representation suitable for active sensing based on a surface description vector distribution graph and hierarchical tables is presented. Experimental results are shown.
Solving zero-dimensional algebraic systems
Authors: D. Lazard
Venue: Journal of Symbolic Computation (1992)

It is shown that a good output for a solver of algebraic systems of dimension zero consists of a family of ''triangular sets of polynomials''. Such an output is simple, readable and contains all information which may be wanted. Different algorithms are described for handling triangular systems and obtaining them from Grobner bases. These algorithms are practicable, and most of them are polynomial in the number of solutions.
Extending the lexicon by exploiting subregularities
Authors: Robert Wilensky
Venue: Proceedings of the workshop on Speech and Natural Language (1990)

This paper is concerned with the acquisition of the lexicon. In particular, we propose a method that uses analogical reasoning to hypothesize new polysemous word senses. This method is one of a number of knowledge acquisition devices to be included in DIRC (Domain Independent Retargetable Consultant). DIRC is a kind of intelligent, natural language-capable consultant kit that can be retargeted at different domains. DIRC is essentially "empty-UC" (UNIX Consultant, Wilensky et al., 1988). DIRC is to include the language and reasoning mechanisms of UC, plus a large grammar and a general lexicon. The user must then add domain knowledge, user knowledge and lexical knowledge for the area of interest.
Enumeration of polyominoes using MACSYMA
Authors: M. Delest
Venue: Theoretical Computer Science (1991)

This paper shows the use of a symbolic language, MACSYMA, to obtain new exact or asymptotic results in combinatorics. The examples are taken among polyominoes [sic] objects. The main purpose of the paper is to show how easy it is to bring some methods into operation in order to obtain new results in enumerative combinatorics. &mdash;From the Abstract
Tail estimates for the space complexity of randomized incremental algorithms
Authors: Kurt Mehlhorn, Micha Sharir, Emo Welzl
Venue: Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms (1992)

We give tail estimates for the space complexity of randomized incremental algorithms for line segment intersection in the plane. For n the number of segments, m is the number of intersections, and m &ge; n ln n ln(3) n, there is a constant c such that the probability that the total space cost exceeds c times the expected space cost is e-&OHgr;(m/(n ln n)).
An introductory course on the use of operating systems
Authors: Catherine C. Bareiss
Venue: ACM SIGCSE Bulletin (1992)

One very frustrating problem that students often have while working on computers is the lack of ability to do productive work. They often find themselves either not being able to do something or doing it in a very complex way when there is a simpler or shorter way to accomplish the task. This is a common experience because most students do not have a structured time of learning the operating system(s) on which they work. This often occurs because the use of an operating system is not considered an academic pursuit so that a course teaching the computer science majors how to use the operating system(s) is not offered. However, the benefits of such a course can be great. The students can find the rest of their work on computers much more productive than if they had to pick up almost everything on their own.
Automatic program development using PIA-CASE tool
Authors: P. Kokol
Venue: ACM SIGSMALL/PC Notes (1990)

The PIA - CASE tool supports the PIA (Provisional Implementation Approach) which is a specific reduction of the Extended Operational Paradigm (EOP). EOP is based on the M3UO framework which takes into account Multidimensional, Multiview and Multilingual aspects of the information system development process and realizable ideas of operational prototyping and transformational paradigms. The PIA CASE tool is a continuation of the JSP Tutor and transforms the JSP operational specification expressed graphically by JSP structure diagrams and textually with newly developed Pointer-Less Array-Less Oriented Language (PLALOL) into spreadsheet and macros.
TINA: a probabilistic syntactic parser for speech understanding systems
Authors: Stephanie Seneff
Venue: Proceedings of the workshop on Speech and Natural Language (1989)

A new natural language system, TINA, has been developed for applications involving speech understanding tasks, which integrates key ideas from context free grammars, Augmented Transition Networks (ATN's) [1], and Lexical Functional Grammars (LFG's) [2]. The parser uses a best-first search strategy, with probability assignments on all arcs obtained automatically from a set of example sentences. An initial context-free grammar, derived from the example sentences, is first converted to a probabilistic network structure. Control includes both top-down and bottom-up cycles, and key parameters are passed among nodes to deal with long-distance movement and agreement constraints. The probabilities provide a natural mechanism for exploring more common grammatical constructions first. Arc probabilities also reduced test-set perplexity by nearly an order of magnitude. Included is a new strategy for dealing with movement, which can handle efficiently nested and chained gaps, and rejects crossed gaps.
Frameworks for interactive, extensible, information-intensive applications
Authors: Craig L. Zarmer, Chee Chew
Venue: Proceedings of the 5th annual ACM symposium on User interface software and technology (1992)

We describe a set of application frameworks designed especially to support information-intensive applications in complex domains, where the visual organization of an application's information is critical. Our frameworks, called visual formalisms, provide the semantic structures and editing operations, as well as the visual layout algorithms, needed to create a complete application. Examples of visual formalisms include tables, panels, graphs, and outlines. They are designed to be extended both by programmers, through subclassing, and by end users, through an integrated extension language.
Management and evaluation of interactive dialog in the air travel domain
Authors: Lewis M. Norton, Deborah A. Dahl, Donald P. McKay, Lynette Hirschman, Marcia C. Linebarger, David Magerman, Catherine N. Ball
Venue: Proceedings of the workshop on Speech and Natural Language (1990)

This paper presents the Unisys Spoken Language System, as applied to the Air Travel Planning (ATIS) domain. This domain provides a rich source of interactive dialog, and has been chosen as a common application task for the development and evaluation of spoken language understanding systems. The Unisys approach to developing a spoken language system combines SUMMIT (the MIT speech recognition system [6]), PUNDIT (the Unisys language understanding system [3]) and an Ingres database of air travel information for eleven cities and nine airports (the ATIS database). Access to the database is mediated via a general knowledge-base/database interface (the Intelligent Database Server [4]). To date, we have concentrated on the language understanding and database interface components.
Expanding the Range of Convergence of the CORDIC Algorithm
Authors: Xiaobo Hu, Ronald G. Harber, Steven C. Bass
Venue: IEEE Transactions on Computers (1991)

The limitations on the numerical values of the functional arguments that are passed to the CORDIC computational units are discussed, with a special emphasis on the binary, fixed-point hardware implementation. Research in the area of expanding the allowed ranges of the input variables for which accurate output values can be obtained is presented. The methods proposed to expand the range of convergence for the CORDIC algorithm do not necessitate any unwidely overhead calculation, thus making this work amenable to a hardware implementation. The number of extra iterations introduced in the modified CORDIC algorithms is significantly less than the number of extra iterations discussed elsewhere. This reduction in the number of extra iterations will lead to a faster hardware implementation. Examples demonstrate the usefulness of the methods in realistic situations.
A program computing the homology groups of loops spaces
Authors: Julio Rubio, Francis Sergeraert
Venue: ACM SIGSAM Bulletin (1991)

The object of this note is to describe the second version of a program allowing in theory the possibility of calculating the homology groups of iterated loop spaces Hq ( Omega;p X; Z) (solving every extension problem) if X is a reduced simplicial set with effective homology the skeleton of which begins in dimension p+1. It is understood, bearing in mind the hyper-exponential complexity of the algorithm, an overambitious choice for q, p and X would not allow the obtaining of a result in a reasonable time. But several examples of calculations already made with the help of this program show that it is possible to find groups, which up until now, have seemed to be inaccessible.
A chart representation for delineating computer disciplines (abstract)
Authors: Curt M. White
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

Colleges and universities in the United States that teach some form of computer curriculum are many. From the small community college to the major university most offer some type of sequence of computer course. Unfortunately, the computer programs offered by two different schools may be vastly different Several &ldquo;names&rdquo; for the computer disciplines have emerged: computer science, computer theory, computer engineering, information sciences, information systems, and data processing to name the more common ones. A faculty member with a doctorate in computer science might feel uncomfort-able working in an information systems department. Likewise, a student wishing to study in the area of information systems would feel ill-at-ease taking courses in a computer engineering department. Many job-seeking faculty and school-seeking students ask of a department: &ldquo;What kind of courses do you offer?&rdquo; &ldquo;Where does your emphasis lie?&rdquo; The answers to questions like these are obtained after lengthy discussions with school advisors, faculty interviewing, or digging through college catalogs. What would be helpful is a system which clearly illustrates the courses offered by a department. If this were in chart form where the courses progressed from computer theory to data processing, one could see at a glance the emphasis of a particular school's discipline. By comparing a department's chart with a faculty member's chart, one can easily and quickly see background differences and similarities, saving time and energy.
Simulation and information order as influences in the development of mental models
Authors: Matthew A. Augustine, Michael D. Coovert
Venue: ACM SIGCHI Bulletin (1991)

Research in the area of mental models (Coovert, 1987; 1990; Coovert, LaLomia, Salas, 1989) has suggested that training individuals about a procedural device can be enhanced by providing learners with a conceptual model of the device. A conceptual model conveys the underlying structure of the device, and aids the user in inferring the procedures necessary for its operation. Such models are intended to give the learner a better understanding of how the device functions, as well as assisting the learner formulate a more useful mental model. The end result is a more capable individual.
Interactive behaviors for bipedal articulated figures
Authors: Cary B. Phillips, Norman I. Badler
Venue: ACM SIGGRAPH Computer Graphics (1991)

We describe techniques for interactively controlling bipedal articulated figures through kinematic constraints. These constraints model certain behavioral tendencies which capture some of the characteristics of human-like movement, and give us control over such elements as the figures' balanced and stability. They operate in near real-time, so provide behavioral control for interactive manipulation. These constraints form the basis of an interactive motion-generation system that allows the active movement elements to be layered on top of the passive behavioral constraints.
Analysis and Design of CMOS Manchester Adders with Variable Carry-Skip
Authors: P. K. Chan, M. D. F. Schlag
Venue: IEEE Transactions on Computers (1990)

Two different CMOS implementations of the Manchester carry-skip adder are analyzed using the RC timing model, which provides a unified way of analyzing both CMOS circuits and interconnect. Based on the RC timing model, the authors develop efficient polynomial algorithms to determine near-optimal (in latency) as well as optimal block sizes for the one-level manchester adder with variable carry-skip. An analysis shows that the carry-skip delay in a Manchester adder block is linearly proportional to the block size. The approach provides a general paradigm for analysis and design, applicable to different models of ripple-propagation and carry skip.
A Prolog system for case-based classification (abstract)
Authors: William W. McMillan, Christopher J. Gardiner
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

It is becoming apparent from the research of Kolodner, Schank, and others that case-based reasoning is an important tool for artificial intelligence. We have implemented a case-based system in Prolog that classifies objects described by attribute-value pairs. It uses Prolog's facilities to manage a case database and to encode features. The basis for classification is a &ldquo;nearest neighbor&rdquo; measure on a universal scale of similarity. The user specifies a scaling factor for naturally numeric data, thus allowing comparisons across dimensions. For non-numeric data, the user can specify numeric values on the standard scale for each value of the feature. For features that take on unordered values, the user can specify a standard difference to use in the case of inequality between values. Cases can have missing values for any feature, a circumstance that arises often in real applications. In a comparison between cases where one has a missing value for a feature, a standard difference for that feature is used. The user can control the importance of features in classification by manipulating scale factors and the numbers assigned to non-numeric values. If the system misclassifies an object, it saves its description with the correct classification. As the user interacts with the program, new features can be introduced. The program has been tested successfully with numeric audiology data and with non-numeric descriptors. This program should make case-based classification more accessible to potential users.
Neurocomputations in Relational Systems
Authors: W. Pedrycz
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

Strong analogies between relational structures involving some composition operators and a certain class of neural networks are described. The problem of learning the connections of the structure is addressed, and relevant learning procedures are proposed. An optimized performance index which has a strong logical flavor is proposed. Some significant implementation details are studied. Numerical examples illustrate various schemes of learning in relational structures of different levels of complexity.
BONSAI: 3D Object Recognition Using Constrained Search
Authors: Patrick J. Flynn, Anil K. Jain
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

BONSAI, a model-based 3D object recognition system, is described. It identifies and localizes 3D objects in range images of one or more parts that have been designed on a computer-aided-design (CAD) system. Recognition is performed via constrained search of the interpretation tree, using unary and binary constraints (derived automatically from the CAD models) to prune the search space. Attention is focused on the recognition procedure, but the model-building, image acquisition, and segmentation procedures are also outlined. Experiments with over 200 images demonstrate that the constrained search approach to 3D object recognition has an accuracy comparable to that of previous systems.
A note on type composition and reusability
Authors: Michael F. Kilian
Venue: ACM SIGPLAN OOPS Messenger (1991)

With the increasing use of object-oriented approaches to the development of libraries of reusable software components, it is useful to look at various type constructions that affect the reusability of objects. Though many people equate reusability with inheritance, another important form of reusability is the composition of one object from other objects. This paper looks at several common ways of organizing objects and how these organizations can reduce the reusability of the object definitions.
Standard-output: Scheme standardization
Authors: Christopher T. Haynes
Venue: ACM SIGPLAN Lisp Pointers (1990)

This is a brief report of efforts to standardize the Scheme programming language. Scheme inherits Lisp's rich set of symbol manipulation primitives, latent storage allocation, dynamic type checking, and simple syntax. Scheme is distinguished from most Lisp dialects by a single variable environment, block structure with static scope, and uniform evaluation of the operator and operand positions of a procedure call. Since there is no storage penalty for tail-recursive procedure calls, they may be used to express iteration. Provision is made for a rich set of numerical types, and exact and inexact numbers are distinguished. The ability to create first-class escape procedures allows almost all known forms of sequential control to be expressed. Above all, Scheme achieves its expressive power through the simplicity and generality of its design, and not by the accumulation of features. (The draft standard is about 50 pages long.) The reader may wish to consult books by Abelson and Sussman [1], Springer and Friedman [2], and Dybvig [3], among others, for tutorial introductions to Scheme.
A Study of Methods of Choosing the Smoothing Parameter in Image Restoration by Regularization
Authors: Alan M. Thompson, John C. Brown, Jim W. Kay, D. Michael Titterington
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

The method of regularization is portrayed as providing a compromise between fidelity to the data and smoothness, with the tradeoff being determined by a scalar smoothing parameter. Various ways of choosing this parameter are discussed in the case of quadratic regularization criteria. They are compared algebraically, and their statistical properties are comparatively assessed from the results of all extensive simulation study based on simple images.