ppxscal/embedding_network huggingface dataset:
Aliasing Probabilities for Feedback Signature Compression of Test Data
Authors: John P. Robinson
Venue: IEEE Transactions on Computers (1991)

A computationally efficient Markov state space model is developed for determining the aliasing probability of a linear feedback shift register when used for test data reduction. The model studied can be used to test data errors which have a constant of probability of error, correlated or repeated use errors, or time varying error probability. Based on a number of simulations of various error models and feedback polynomials it appears that a primitive polynomial, with about half its terms nonzero, has the best dynamic performance in most cases.
Implementation aspects of large vocabulary recognition based on intraword and interword phonetic units
Authors: R. Pieraccini, C. H. Lee, E. Giachin, L. R. Rabiner
Venue: Proceedings of the workshop on Speech and Natural Language (1990)

Most large vocabulary speech recognition systems essentially consist of a training algorithm and a recognition structure which is essentially a search for the best path through a rather large decoding network. Although the performance of the recognizer is crucially tied to the details of the training procedure, it is absolutely essential that the recognition structure be efficient in terms of computation and memory, and accurate in terms of actually determining the best path through the lattice, so that a wide range of training (sub-word unit creation) strategies can be efficiently evaluated in a reasonable time period. We have considered an architecture in which we incorporate several well known procedures (beam search, compiled network, etc.) with some new ideas (stacks of active network nodes, likelihood computation on demand, guided search, etc.) to implement a search procedure which maintains the accuracy of the full search but which can decode a single sentence in about one minute of computing time (about 20 times real time) on a vectorized, concurrent processor. The ways in which we have realized this significant computational reduction are described in this paper.
Opportunities for advanced speech processing in military computer-based systems
Authors: Clifford J. Weinstein
Venue: Proceedings of the workshop on Speech and Natural Language (1990)

This paper presents a study of military applications of advanced speech processing technology which includes three major elements: (1) review and assessment of current efforts in military applications of speech technology; (2) identification of opportunities for future military applications of advanced speech technology; and (3) identification of problem areas where research in speech processing is needed to meet application requirements, and of current research thrusts which appear promising. The relationship of this study to previous assessments of military applications of speech technology is discussed, and substantial recent progress is noted. Current efforts in military applications of speech technology which are highlighted include: (1) narrowband (2400 b/s) and very low-rate (50--1200 b/s) secure voice communication; (2) voice/data integration in computer networks; (3) speech recognition in fighter aircraft, military helicopters, battle management, and air traffic control training systems; and (4) noise and interference removal for human listeners. Opportunities for advanced applications are identified by means of descriptions of several generic systems which would be possible with advances in speech technology and in system integration. These generic systems include: (1) integrated multi-rate voice/data communications terminal; (2) interactive speech enhancement system; (3) voice-controlled pilot's associate system; (4) advanced air traffic control training systems; (5) battle management command and control support system with spoken natural language interface; and (6) spoken language translation system. In identifying problem areas and research efforts to meet application requirements, it is observed that some of the most promising research involves the integration of speech algorithm techniques including speech coding, speech recognition, and speaker recognition.
Interactive modular programming in Scheme
Authors: Sho-Huan Simon Tung
Venue: Proceedings of the 1992 ACM conference on LISP and functional programming (1992)

This paper presents a module system and a programming environment designed to support interactive program development in Scheme. The module system extends lexical scoping while maintainig its flavor and benefits and supports mutually recursive modules. The programming environment supports dynamic linking, separate compilation, production code compilation, and a window-based user interface with multiple read-eval-print contexts.
Adaptive 3-D Object Recognition from Multiple Views
Authors: Michael Seibert, Allen M. Waxman
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

The authors address the problem of generating representations of 3-D objects automatically from exploratory view sequences of unoccluded objects. In building the models, processed frames of a video sequence are clustered into view categories called aspects, which represent characteristic views of an object invariant to its apparent position, size, 2-D orientation, and limited foreshortening deformation. The aspects as well as the aspect transitions of a view sequence are used to build (and refine) the 3-D object representations online in the form of aspect-transition matrices. Recognition emerges as the hypothesis that has accumulated the maximum evidence at each moment. The 'winning' object continues to refine its representation until either the camera is redirected or another hypothesis accumulates greater evidence. This work concentrates on 3-D appearance modeling and succeeds under favorable viewing conditions by using simplified processes to segment objects from the scene and derive the spatial agreement of object features.
PhD research in object-oriented systems
Authors: Guus Ramackers, Chris Laffra
Venue: ACM SIGPLAN OOPS Messenger (1992)

Preceding the ECOOP'91 conference July 17--19 1991 in Geneva, a one-day workshop for 20 doctoral students from European universities (and beyond) was held. This workshop was organised in order to enhance the personal and professional development of PhD-level students who are working in the area of object-oriented systems. It enabled them to meet, to discuss their research, and to develop their working skills. The workshop had an interactive form, where the participants worked in groups.
Chart parsing of stochastic spoken language models
Authors: Charles Hemphill, Joseph Picone
Venue: Proceedings of the workshop on Speech and Natural Language (1989)

Performance in speech recognition systems has progressed to the point where it is now realistic to begin integrating speech with natural language systems to produce spoken language systems. Two factors have contributed to the advances in speech: statistical modeling of the input signal and language constraints. To produce spoken language systems, then, the grammar formalisms used in natural language systems must incorporate statistical information and efficient parsers for these stochastic language models must be developed. In this paper we outline how chart parsing techniques provide advantages in both computation and accuracy for spoken language systems. We describe a system that models all levels of the spoken language system using stochastic language models and present experimental results.
Implications of hierarchical N-body methods for multiprocessor architecture
Authors: Jaswinder Pal Singh
Venue: ACM SIGARCH Computer Architecture News (1992)

We first examine the key architectural implications of realistically scaling a representative member of this important class of applications. Using scaling methods that reflect the concerns of an application scientist leads to different conclusions than does naive scaling model, both the communication to computation ratio and the amount of cache memory per processor required for effective performance increase with scaling. We then examine the effect of a shared address space versus message passing as the communication abstraction. We show that the lack of a shared address space substantially increases the programming complexity and performance overheads of a message-passing implementation.
Multivariate polynomials, standard tableaux, and representations of symmetric groups
Authors: Michael Clausen
Venue: Journal of Symbolic Computation (1991)

This paper is concerned with structural and algorithmic aspects of certain R-bases in polynomial rings R[X"i"j] over a commutative ring R with 1. These bases are related to standard tableaux. We shall examine the main tools in full detail: (symmetrized) bideterminants, Capelli operators, hyperdominance, and generalized Laplace's expansions. These tools are then applied to the representation theory of symmetric groups. In particular, we present an algorithm which efficiently computes for every skew module of a symmetric group an R-basis which is adapted to a Specht series. This result is a constructive, characteristic-free analogue of the celebrated Littlewood-Richardson rule. This paper will serve as the basis for a possible generalization of that rule to more general shapes.
On-line scheduling in the presence of overload
Authors: S. Baruah, G. Koren, B. Mishra, A. Raghunathan, L. Rosier, D. Shasha
Venue: Proceedings of the 32nd annual symposium on Foundations of computer science (1991)

The preemptive scheduling of sporadic tasks on a uniprocessor is considered. A task may arrive at any time, and is characterized by a value that reflects its importance, an execution time that is the amount of processor time needed to completely execute the task, and a deadline by which the task is to complete execution. The goal is to maximize the sum of the values of the completed tasks. An online scheduling algorithm that achieves optimal performance when the system is underloaded and provides a nontrivial performance guarantee when the system is overloaded is designed. The algorithm is implemented using simple data structures to run at a cost of O(log n) time per task, where n bounds the number of tasks in the system at any instant. Upper bounds on the best performance guarantee obtainable by an online algorithm in a variety of settings are derived.
Definition and analysis of a class of spanning bus orthogonal multiprocessing systems
Authors: Isaac D. Scherson
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

A graph theoretical representation for a class of interconnection networks is suggested. The idea is based on a definition of orthogonal binary vectors and leads to a construction rule for a class of orthogonal graphs. An orthogonal graph is first defined as a set of 2m nodes, which in turn are linked by 2m-n edges for every link mode defined in an integer set Q*. The degree and diameter of an orthogonal graph are determined in terms of the parameters n, m and the number of link modes defined in Q*. Routing in orthogonal graphs is shown to reduce to the node covering problem in bipartite graphs. The proposed theory is applied to describe a number of well known interconnection networks such as the binary m-cube and spanning-bus meshes. Multi-dimensional access (MDA) memories are shown as examples of orthogonal shared memory multi-processing systems.
The method of differentiating under the integral sign
Authors: Gert Almkvist, Doron Zeilberger
Venue: Journal of Symbolic Computation (1990)

A method is developed to find a differential equation satisfied by the integral R(x)=@!"-"~^~F(x,y)dy. Given the holonomic function F(x, y) the computer finds the differential equation for R(x). A continuous version of the second author's ''proof machine'' for proving hypergeometric identities is used.
Toward an open shared workspace: computer and video fusion approach of TeamWorkStation
Authors: Hiroshi Ishii, Naomi Miyake
Venue: Communications of the ACM (1991)

Groupware is intended to create a shared workspace that supports dynamic collaboration in a work group over space and time constraints. To gain the collective benefits of groupware use, the groupware must be accepted by a majority of workgroup members as a common tool. Groupware must overcome the hurdle of critical mass.
Technical summary of the second IEEE workshop on workstation operating systems
Authors: Luis-Felipe Cabrera
Venue: ACM SIGMETRICS Performance Evaluation Review (1991)

The broad spectrum of universities, industrial research laboratories, and computer companies represented at the Second IEEE Workshop on Workstation Operating Systems provided a rich snapshot of current activities in operating systems. There were representatives of 19 operating system research projects among the participants and several from commercial offerings. The attendees came from seven countries on three continents: North America, Europe, and South America.Since the last Workshop in 1987, there have been more advances in hardware than in software functions. Software standards continue to emerge in the areas of operating system interfaces, page description languages, window management interfaces, and communication protocols. New software applications exist in the areas of multimedia and multi-node computing. Object-oriented technology is already present in running systems and gaining importance. The areas that the participants perceived needing most future work were operating system abstractions, workstation operation, system responsiveness, input output, network services, management of clusters of workstations, and failure handling.While processor speeds, main memory access speeds, memory density, and secondary storage capacity continue to increase fast, disk seek times have decreased only slightly, and the bandwidth of most local-area networks has not increased at all. FDDI networks are just beginning to be deployed. The software is adjusting to this hardware scenario by using caching at multiple levels of the systems.In the last two years large main memories at individual computing nodes and multi-node computer installations have become common. It is expected that most future computing nodes will have substantial local storage and that high-bandwidth networks will enable the support of continuous media like vocie and video. Input output, to disks, to networks, and to user-oriented devices, is expected to become the central problem in future systems.
Waveform moment methods for improved interconnection analysis
Authors: Steven P. McCormick, Jonathan Allen
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

This paper describes a circuit analysis program aimed at quickly solving linear interconnection circuits with inductance and coupling. It computes circuit responses to varying degrees of detail, varying from a simple Elmore delay to a good waveform estimate. Allowable circuit forms are much more flexible than for existing Elmore delay algorithms. Large networks or distributed lines can be reduced to a form of transfer function that can subsequently be analyzed much more efficiently with the waveform moment methods.
VLSI cell placement techniques
Authors: K. Shahookar, P. Mazumder
Venue: ACM Computing Surveys (CSUR) (1991)

VLSI cell placement problem is known to be NP complete. A wide repertoire of heuristic algorithms exists in the literature for efficiently arranging the logic cells on a VLSI chip. The objective of this paper is to present a comprehensive survey of the various cell placement techniques, with emphasis on standard cell and macro placement. Five major algorithms for placement are discussed: simulated annealing, force-directed placement, min-cut placement, placement by numerical optimization, and evolution-based placement. The first two classes of algorithms owe their origin to physical laws, the third and fourth are analytical techniques, and the fifth class of algorithms is derived from biological phenomena. In each category, the basic algorithm is explained with appropriate examples. Also discussed are the different implementations done by researchers.
Hypercard automata simulation: finite-state, pushdown and Turing machines
Authors: David G. Hannay
Venue: ACM SIGCSE Bulletin (1992)

This paper describes a package of highly interactive simulation models for the concepts taught in Theory of Computing courses. Macintosh Hypercard stacks are used to demonstrate the three basic automata models: Finite-State Machines, Push-Down Machines, and Turing Machines. These simulations feature multiple named machines on the same stack, accessible via a customized menu or buttons on the screen. Because of the scripts hidden behind the visible screen, with just a click of a butto students can alter starting states, the set of input symbols, the number of states, the finality of states, or the action based on a given state/input combination. These simulations have been successfully used in conjunction with a course on the Theory of Computing at Union College since 1989. Students have responded enthusiastically to this concrete method of teaching abstract concepts.
Robust Clustering with Applications in Computer Vision
Authors: Jean-Michel Jolion, Peter Meer, Samira Bataouche
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

A clustering algorithm based on the minimum volume ellipsoid (MVE) robust estimator is proposed. The MVE estimator identifies the least volume region containing h percent of the data points. The clustering algorithm iteratively partitions the space into clusters without prior information about their number. At each iteration, the MVE estimator is applied several times with values of h decreasing from 0.5. A cluster is hypothesized for each ellipsoid. The shapes of these clusters are compared with shapes corresponding to a known unimodal distribution by the Kolmogorov-Smirnov test. The best fitting cluster is then removed from the space, and a new iteration starts. Constrained random sampling keeps the computation low. The clustering algorithm was successfully applied to several computer vision problems formulated in the feature space paradigm: multithresholding of gray level images, analysis of the Hough space, and range image segmentation.
The probabilistic method
Authors: Joel Spencer
Venue: Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms (1992)

The use of randomness is now an accepted tool in Theoretical Computer Science but not everyone is aware of the underpinnings of this methodology in Combinatorics - particularly, in what is now called the probabilistic Method as developed primarily by Paul Erdo&huml;s over the past half century. Here I will explore a particular set of problems - all dealing with &ldquo;good&rdquo; colorings of an underlying set of points relative to a given family of sets. A central point will be the evolution of these problems from the purely existential proofs of Erdo&huml;s to the algorithmic aspects of much interest to this audience.
Polynomial Complexity Algorithms for Increasing the Testability of Digital Circuits by Testing-Module Insertion
Authors: Irith Pomeranz, Zvi Kohavi
Venue: IEEE Transactions on Computers (1991)

The authors present a method for increasing the testability of combinational circuits for single stuck-at faults by partitioning the circuit and inserting testing-modules. A testing-module structure that allows lines in the circuit to be logically disconnected is shown. It allows the circuit to be partitioned into independent subcircuits. A test generation algorithm that is based on test set merging is presented. An optimal testing-module placement algorithm is described for fanout free circuits. A special type of circuit with fanout for which optimal testing-module placement can also be performed is defined, and a testing-module placement algorithm for them is outlined. For general fanout circuits, polynomial testing-module placement and test generation algorithms are described. Testing-modules are used for partitioning the circuit into fanout free subcircuits. Test set merging that yields a complete test set for the circuit is described.
T: a multithreaded massively parallel architecture
Authors: R. S. Nikhil, G. M. Papadopoulos, Arvind
Venue: ACM SIGARCH Computer Architecture News (1992)

What should the architecture of each node in a general purpose, massively parallel architecture (MPA) be? We frame the question in concrete terms by describing two fundamental problems that must be solved well in any general purpose MPA. From this, we systematically develop the required logical organization of an MPA node, and present some details of *T (pronounced Start, a concrete architecture designed to these requirements. *T is a direct descendant of dynamic dataflow architectures, and unifies them with von Neumann architectures. We discuss a hand-compiled example and some compilation issues.
Survey of graduate programs in medical information science in the United States
Authors: John P. Glaser, Jane Weiss, Charly Harersat
Venue: ACM SIGBIO Newsletter (1991)

A survey of graduate programs in Medical Information Science in the United States was conducted in 1989. The survey identified four types of programs which provide opportunities for graduate students to concentrate their education and research in the field. Thirteen programs were identified and described.This paper summarizes the survey results and presents program descriptive information.
Adapting Ada distribution and fault tolerance
Authors: A. B. Gargaro, S. J. Goldsack, R. K. Powers, R. A. Volz, A. J. Wellings
Venue: ACM SIGAda Ada Letters (1990)

During the Third International Real Time Ada Workshop held at Nemacolin Woodlands, Pennsylvania, in June 1989, the present authors formed a study group to review the changes in the Ada standard which would make the language more suitable for programming distributed systems. It was accepted that one of the important advantages of distributing embedded systems was the potential for recovery from partial failure of hardware, and that the techniques of programming recovery from such failure were not well supported by the current form of Ada. The working group made specific proposals, which have since been refined at a further meeting and discussions by electronic mail. The present paper reviews the causes of difficulty, and then outlines the new proposals, explaining their rationale in relation to the identified requirements.
Applying domain and design knowledge to requirements engineering
Authors: W. Lewis Johnson, Martin S. Feather, David R. Harris
Venue: ACM SIGOIS Bulletin (1992)

This paper describes efforts to develop a transformation-based software environment which supports the acquisition and validation of software requirements specifications. These requirements may be stated informally at first, and then gradually formalized and elaborated. Support is provided for groups of requirements analysis working together, focusing on different analysis tasks and areas of concern. The environment assists in the validation of formalized requirements by translating them into natural language and graphical diagrams, and testing them against a running simulation of the system to be built. Requirements defined in terms of domain concepts are transformed into constraints on system components. The advantages of this approach are that specifications can be traced back to requirements and domain concepts, which in turn have been precisely defined.