ppxscal/embedding_network huggingface dataset:
Computer Technology and Architecture: An Evolving Interaction
Authors: John L. Hennessy, Norman P. Jouppi
Venue: Computer (1991)

The interaction between computer architecture and IC technology is examined. To evaluate the attractiveness of particular technologies, computer designs are assessed primarily on the basis of performance and cost. The focus is mainly on CPU performance, both because it is easier to measure and because the impact of technology is most easily seen in the CPU. The technology trends discussed concern memory size, design complexity and time, and design scaling. Architectural trends in the areas of pipelining, memory systems, and multiprocessing are considered. Opportunities and problems to be solved in the years ahead are identified.
Stochastic representation of conceptual structure in the ATIS task
Authors: Roberto Pieraccini, Esther Levin, Chin-Hui Lee
Venue: Proceedings of the workshop on Speech and Natural Language (1991)

We propose a model for a statistical representation of the conceptual structure in a restricted subset of spoken natural language. The model is used for segmenting a sentence into phrases and labeling them with concept relations (or cases). The model is trained using a corpus of annotated transcribed sentences. The performance of the model was assessed on two tasks, including DARPA ATIS class A sentences.
Table of special function integrals
Authors: Jean C. Pigquette
Venue: ACM SIGSAM Bulletin (1990)

This paper is the result of a suggestion by B. F. Caviness [1] to publish a table of integrals obtained using the special function integration technique that has been described in detail elsewhere [2]-[8], since only a much abbreviated version of the table could be accommodated in [7]. This integration technique permits symbolic evaluation of integrals of the form[EQUATION]where f(x) is an essentially arbitrary function and IIR is a product of any of a very broad class of special functions including, but not limited to, Bessel functions, Legendre functions, Hermite functions, Laguerre functions, Chebychev polynomials, Jacobi polynomials, and Gegenbauer polynomials. In [7] is described a method which can be used to enhance the on-board integrator of a symbolic software system to include analytical symbolic evaluation of integrals of this type. The method is currently being evaluated for possible inclusion in the program Mathematica trade; [9].
Semi-Automatic Program Construction from Specifications Using Library Modules
Authors: Fujio Nishida, Shinobu Takamatsu, Yoneharu Fujita, Tadaaki Tani
Venue: IEEE Transactions on Software Engineering (1991)

A method of semiautomatic specification refinement and program generation using library modules, is described. Users write their specifications and modify and rearrange them so that they can be refined with the aid of the library modules. When a specification is given, a refinement system, called MAPS (module-aided program construction system) searches for library modules applicable to the given specification, replaces the specification with a more detailed description written in the operation part of the modules, and converts the refined specification into a program written in a programming language designated by the user. Case-like expressions or pseudo-natural language expressions are used for describing user's specifications and specifications for library modules.
Building black holes, gravitational waves, and relativistic fluid flows: supercomputer cinema
Authors: Stuart L. Shapiro, Saul A. Teukolsky
Venue: Proceedings of the 1990 ACM/IEEE conference on Supercomputing (1990)

We have constructed a new computer code to solve Einstein's equations of general relativity for the dynamical evolution of a relativistic star cluster. The cluster may contain a large number of stars that move in a strong gravitational field at velocities approaching the speed of light. Unstable star clusters undergo catastrophic collapse to black holes. The collapse of an unstable cluster to a supermassive black hole at the center of a galaxy may explain the origin of quasars and active galactic nuclei. By means of a supercomputer simulation and color graphics, the whole process can be viewed in real time on a movie screen. We have also written a multidimensional, relativistic hydrodynamics code to determine the flow of gas onto such black holes. This problem has defied solution for 45 years. Even the generation of gravitational waves can now be calculated on a supercomputer. Longstanding theoretical questions such as the validity of the Cosmic Censorship Hypothesis and the Hoop Conjecture may soon be settled by numerical simulations.
Different perspectives of the N-Queens problem
Authors: Cengiz Erbas, Seyed Sarkeshik, Murat M. Tanik
Venue: Proceedings of the 1992 ACM annual conference on Communications (1992)

The N-Queens problem is a commonly used example in computer science. There are numerous approaches proposed to solve the problem. We introduce several definitions of the problem, and review some of the algorithms. We classify the algorithms for the N-Queens problem into 3 categories. The first category comprises the algorithms generating all the solutions for a given N. The algorithms in the second category are desinged to generate only the fundamental solutions [34]. The algorithms in the last category generate only one or several solutions but not necessarily all of them.
CAPS: a coding aid for PASM
Authors: James E. Lumpp,  Jr., Samuel A. Fineberg, Thomas L. Casavant, Wayne G. Nation, Edward C. Bronson, Howard Jay Siegel, Pierre H. Pero, Dan C. Marinescu, Thomas Schwederski
Venue: Communications of the ACM (1991)

Programming parallel machines is very difficult. First, generating an algorithm requires the programmer to assimilate the interactions of multiple threads of control. Second, synchronization and communication among the threads must be addressed to avoid contention and deadlock. Then, once the program is executing on the parallel system and does not function correctly or performs poorly, the debugging of multiple threads is a complicated problem [21]. Additionally, debugging software is an activity that requires systematic attention to detail. Success is a function of the experienced individual involved and the tools employed. The ability to efficiently debug software requires the wisdom to know what questions to ask, the ability to analyze the answers received, and the knowledge to formulate the best next question. To aid in this interactive process, the programmer needs information about the run-time behavior of the program.
An optimal algorithm for the on-line closest-pair problem
Authors: Christian Schwarz, Michiel Smid, Jack Snoeyink
Venue: Proceedings of the eighth annual symposium on Computational geometry (1992)

We give an algorithm that computes the closest pair in a set of n points in k-dimensional space on-line, in O(n log n) time. The algorithm only uses algebraic functions and, therefore, is optimal. The algorithm maintains a hierarchical subdivision of k-sapce into hyper-rectangles, which is stored in a binary tree. Centroids are used to maintain a balanced decomposition of this tree.
An Iterative Growing and Pruning Algorithm for Classification Tree Design
Authors: Saul B. Gelfand, C. S. Ravishankar, Edward J. Delp
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

A critical issue in classification tree design-obtaining right-sized trees, i.e. trees which neither underfit nor overfit the data-is addressed. Instead of stopping rules to halt partitioning, the approach of growing a large tree with pure terminal nodes and selectively pruning it back is used. A new efficient iterative method is proposed to grow and prune classification trees. This method divides the data sample into two subsets and iteratively grows a tree with one subset and prunes it with the other subset, successively interchanging the roles of the two subsets. The convergence and other properties of the algorithm are established. Theoretical and practical considerations suggest that the iterative free growing and pruning algorithm should perform better and require less computation than other widely used tree growing and pruning algorithms. Numerical results on a waveform recognition problem are presented to support this view.
Mastering J
Authors: Donald B. McIntyre
Venue: Proceedings of the international conference on APL '91 (1991)

J is a new dialect of APL that provides much additional power over earlier dialects, and also provides a challenge to the user to master this new power. This paper discusses some of the problems the author encountered in learning J, and how they were overcome.
On selecting a satisfying truth assignment (extended abstract)
Authors: Christos H. Papadimitriou
Venue: Proceedings of the 32nd annual symposium on Foundations of computer science (1991)

The complexity of certain natural generalizations of satisfiability, in which one of the possibly exponentially many satisfying truth assignments must be selected, is studied. Two natural selection criteria, default preference and minimality (circumscription), are considered. The thrust of the complexity results seems to be that hard problems become harder, while easy problems remain easy. This consideration yields as a byproduct a new and very natural polynomial-time randomized algorithm for 2SAT.
The Soviet computer industry: a tale of two sectors
Authors: S. E. Goodman, W. K. McHenry
Venue: Communications of the ACM (1991)

For the Soviet economy in general, and the Soviet computing community in particular, the last few years have been a period of unprecedented troubles and changes. The old, stable, centrally planned economic system has proven to be far more brittle than almost anyone expected; but attempts to build a market economy have fallen far short of many hopes and expectations. The net result to date is an economy in confusion and shambles (e.g., see [3, 6]).
Low Latency Time CORDIC Algorithms
Authors: Dirk Timmermann, Helmut Hahn, Bedrich J. Hosticka
Venue: IEEE Transactions on Computers (1992)

Several methods for increasing the speed of the CORDIC algorithm are presented. First, an improved method which guarantees a constant scale factor when employing redundant addition schemes is developed. Then, an architecture with increased parallelism which considerably reduces the CORDIC latency time and the amount of hardware is described.
A reference architecture for the component factory
Authors: Victor R. Basili, Gianluigi Caldiera, Giovanni Cantone
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (1992)

Software reuse can be achieved through an organization that focuses on utilization of life cycle products from previous developments. The component factory is both an example of the more general concepts of experience and domain factory and an organizational unit worth being considered independently. The critical features of such an organization are flexibility and continuous improvement. In order to achieve these features we can represent the architecture of the factory at different levels of abstraction and define a reference architecture from which specific architectures can be derived by instantiation. A reference architecture is an implementation and organization independent representation of the component factory and its environment. The paper outlines this reference architecture, discusses the instantiation process, and presents some examples of specific architectures by comparing them in the framework of the reference model.
Managing objects in a user interface system with ROBA
Authors: Rumi Hiraga, Yeong-Chang Lien
Venue: ACM SIGCHI Bulletin (1990)

Relational OBject Architecture (ROBA) is a software architecture designed for efficient management of user interface objects in the Mugen system [LHMM89]. Mugen, created at IBM's Tokyo Research Laboratory, is a prototype system for an application development environment, which has the paradigm of generating new applications from provided existing integrated applications. Figure 1 shows a dialogue panel of a new application created in Mugen. There are three boxes for entry points of tasks. A user can dynamically change, add, or delete a task box through Mugen's user interface system, which has the following features: (1) the user interface is created in a WYSIWYG manner, and (2) the layout object can link to a task, which carries out a recorded sequence of a user's operations on applications. The system for building a user interface in Mugen is called the user interface enabler.
Inlining semantics for subroutines which are recursive
Authors: Henry G. Baker
Venue: ACM SIGPLAN Notices (1992)

Many modern programming languages offer a facility for "inlining" designated procedure and function calls, but this process is not well defined in most language standards documents. We offer a model for inlining which has the property that the resulting code does not depend upon the presentation of the order of function definitions, and which also provides a finite and consistent interpretation for the inlining of mutually recursive functions. Finally, when used on "tail-recursive" functions, our model of inlining provides for the equivalent of "loop unrolling".
Regular paper: A novel lift-off process using low-temperature PECVD silicon nitride for the fabrication of self-aligned gate GaAs MESFETs and InP MISFETs
Authors: Joseph Ya-min Lee, Mandar M. Dange, K. Sooriakumar
Venue: Microelectronic Engineering (1992)

A novel lift-off process for the fabrication of self-aligned gate GaAs MESFETs and InP MISFETs was developed using low-temperature plasma-enhanced chemical vapor deposition (PECVD) silicon nitride films. The gate areas of the GaAs MESFETs and InP MISFETs were defined by silicon nitride lift-off in a substitutional gate process so that the gate electrodes of the field effect transistors were automatically aligned with the source and drain areas. The lift-off of silicon nitride was made possible by characterizing PECVD silicon nitride at low temperatures and performing the silicon nitride deposition at 60^oC which was lower than the soft bake temperature of normal photoresist.
The Meta-Pi Network: Building Distributed Knowledge Representations for Robust Multisource Pattern Recognition
Authors: John B. Hampshire,  II, Alex Waibel
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

The authors present the Meta-Pi network, a multinetwork connectionist classifier that forms distributed low-level knowledge representations for robust pattern recognition, given random feature vectors generated by multiple statistically distinct sources. They illustrate how the Meta-Pi paradigm implements an adaptive Bayesian maximum a posteriori classifier. They also demonstrate its performance in the context of multispeaker phoneme recognition in which the Meta-Pi superstructure combines speaker-dependent time-delay neural network (TDNN) modules to perform multispeaker /b,d,g/ phoneme recognition with speaker-dependent error rates of 2%. Finally, the authors apply the Meta-Pi architecture to a limited source-independent recognition task, illustrating its discrimination of a novel source. They demonstrate that it can adapt to the novel source (speaker), given five adaptation examples of each of the three phonemes.
Reaction-diffusion textures
Authors: Andrew Witkin, Michael Kass
Venue: ACM SIGGRAPH Computer Graphics (1991)

We present a method for texture synthesis based on the simulation of a process of local nonlinear interaction, called reaction-diffusion, which has been proposed as a model of biological pattern formation. We extend traditional reaction-diffusion systems by allowing anisotropic and spatially non-uniform diffusion, as well as multiple competing directions of diffusion. We adapt reaction-diffusion system to the needs of computer graphics by presenting a method to synthesize patterns which compensate for the effects of non-uniform surface parameterization. Finally, we develop efficient algorithms for simulating reaction-diffusion systems and display a collection of resulting textures using standard texture- and displacement-mapping techniques.
Experience with the language SR in an undergraduate operating systems course
Authors: Stephen J. Hartley
Venue: ACM SIGCSE Bulletin (1992)

In undergraduate operating systems classes, students learn about concurrent process synchronization, including such things as shared data, race conditions, critical sections, mutual exclusion, semaphores, monitors, and the test-and-set hardware instruction. They also study interprocess communication, message passing, rendezvous, and remote procedure calls. Solutions to classical problems, such as the dining philosophers, producers and consumers, bounded buffers, and readers and writers, are presented using the above concepts. However, students need to write programs in a language that provides facilities for concurrent programming in order to appreciate fully the above concepts. This paper describes the SR language and discusses its successful use as an environment for concurrent programming in an undergraduate operating systems class.
Learning switching concepts
Authors: Avrim Blum, Prasad Chalasani
Venue: Proceedings of the fifth annual workshop on Computational learning theory (1992)

We consider learning in situations where the function used to classify examples may switch back and forth between a small number of different concepts during the course of learning. We examine several models for such situations: oblivious models in which switches are made independent of the selection of examples, and more adversarial models in which a single adversary controls both the concept switches and example selections. We show relationships between the more benign models and the p-concepts of Kearns and Schapire, and present polynomial-time algorithms for learning switches between two k-DNF formulas. For the most adversarial model, we present a model of success patterned after the popular competitive analysis used in studying on-line algorithms. We describe a randomized query algorithm for such adversarial switches between two monotone disjunctions that is &ldquo;1-competitive&rdquo; in that the total number of mistakes plus queries is with high probability bounded by the number of switches plus some fixed polynomial in n (the number of variables). We also use notions described here to provide sufficient conditions under which learning a p-concept class &ldquo;with a decision rule&rdquo; implies being able to learn the class &ldquo;with a model of probability.&rdquo;.
Time dilation visualization in relativity
Authors: Ping-Kang Hsiung, Robert H. Thibadeau, Christopher B. Cox, Robert H. P. Dunn
Venue: Proceedings of the 1990 ACM/IEEE conference on Supercomputing (1990)

This work extends our previous effort in visualizing the spatial aspect of relativistic effects, and treats the phenomenon of time dilation; an inherent temporal effect of special relativity. Here, we demonstrate through still-frame images and live animations that in observing the viewing independent time dilation, the finite light transit time involved in performing the observation makes the observed time dilation also depend on the viewing condition. As we introduce the physics of special relativity into ray-tracing and make time to pass as a ray travels through space, we are able to link the spatial and temporal dimensions in a fundamental and consistent way in our simulations, and generate images that reveal the spatial and temporal properties of the 4D geometry of spacetime. Our exploration highlights the interplay of the imaging process and the imaged physical events in producing the final images. It reveals a richly detailed physical reality which the mathematical language of thought experiment in relatively does not directly provide.
An analysis technique for examining integration in a project support environment
Authors: Alan W. Brown, Peter H. Feiler
Venue: ACM SIGSOFT Software Engineering Notes (1992)

While many Computer-Aided Software Engineering (CASE) tool vendors claim to provide open, integrated environments for software development, in practice such claims must be examined very carefully to understand what is meant. One of the problems faced in trying to examine these claims is that there is no established technique for examining software development environments with regard to their integration characteristics.
A Graphical Notation Editing System (AGNES): support for DataBase modeling using the extended E-R model
Authors: HsiaoYing Liu
Venue: ACM SIGSMALL/PC Notes (1991)

A Graphical Notation Editing System (AGNES) project was initially undertaken in order to resolve some of the traditional problems in textual interfaces as manifested in most database management systems and knowledge base management systems. Entity-Relationship (E-R) Models have provided a popular technique for use in information modeling and analysis [Zhang, 1983]. Although offering a visual model containing a great deal of information in relatively little space, E-R models need to be supported by the necessary graphical tools for accessing and manipulating data. AGNES is an icon based editing tool which provides a graphic user interface between a Database Management System and the user. As the work began, it became immediately apparent that such an interface could also greatly enhance the modeling capability of E-R models. What follows is a set of enhancement tools that can be implemented.
Sci-fi at CHI: Cyberpunk novelists predict future user interfaces
Authors: Aaron Marcus, Donald A. Norman, Rudy Rucker, Bruce Sterling, Vernor Vinge
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

This plenary panel will explore ideas about future user interfaces, their technology support, and their social context as proposed in the work of leading authors of science fiction characterized as the Cyberpunk movement. Respondents will react to and comment upon the authors' presentations.
Electronic frontier: coming into the country
Authors: John P. Barlow
Venue: Communications of the ACM (1991)

Imagine discovering a continent so vast that it may have no end to its dimensions. Imagine a new world with more resources than all our future greed might exhaust, more opportunities than there will ever be entrepreneurs to exploit, and a peculiar kind of real estate that expands with development.
The server network generator (SNG): a CASE tool for distributed cooperative processing
Authors: L. E. Zeidner
Venue: Proceedings of the international conference on APL '91 (1991)

The Server Network Generator (SNG) is a CASE tool that employs a problem solver's ability to represent an application as an ordinary block diagram, a graphical specification of its macroscopic structure. This functional decomposition provides a natural mechanism for subdividing the application into processing tasks that can be distributed across a computing network. Each "server" is a software process that assumes the role of one block in the diagram, performing one processing task, employing interprocess communication as indicated graphically. This approach differs from related research in its use of a functional decomposition in the application context, and its use of graphical programming of the application's macroscopic structure. A distributed network of IBM 7437 VM/SP Technical Workstations are shown as a powerful platform for problem solving, using the SNG as a CASE tool. Distributed computing models based upon networks of microprocessors have long been proposed as an alternative to centralized mainframe computing. The 7437 provides a genuine VM/370 computing environment, so that this approach to distributed computing allows large mainframe systems to be the most powerful nodes in the network, rather than attempting to replace them. A recently completed auxiliary processor is presented that was required to support interprocess communication via the shared-variable interface between virtual machines on different hosts.