ppxscal/embedding_network huggingface dataset:
Mean Value Analysis by Chain of Product form Queueing Networks
Authors: A. E. Conway, E. de Souza e Silva, S. S. Lavenberg
Venue: IEEE Transactions on Computers (1989)

A computational algorithm is developed for closed multichain product-form queueing networks. For networks that consist of only single-server fixed rate and infinite-server service centers, it involves only mean performance measures. The algorithm, called mean value analysis by chain (MVAC), is based on a recursion that is quite different in form from the recursion used in the well-known mean value analysis (MVA) algorithm and has quite different computational and storage costs. For networks with few service centers and many chains, MVAC typically has much lower costs than MVA, although it becomes more costly than MVA as the number of service centers increases. The MVAC recursion is similar in structure to a recursion involving normalizing constants that was derived by A.E. Conway and N.D. Georganas (1986). That recursion formed the basis for their recursion by chain (RECAL) algorithm for computing the normalizing constant and from it the mean performance measures. The computational and storage costs for MVAC are shown to be similar to those for RECAL.
Massively parallel symbolic computation
Authors: A. Deprit
Venue: Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation (1989)

A massively parallel processor proves to be a powerful tool for manipulating the very large Poisson series encountered in non-linear dynamics. Exploiting the algebraic structure of Poisson series leads quite naturally to parallel data structures and algorithms for symbolic manipulation. Exercising the parallel symbolic processor on the solution of Kepler's equation reveals the need to reexamine the serial computational methods traditionally applied to problems in dynamics.
Analysis of a 3D toroidal network for a shared memory architecture
Authors: F. Pittelli, D. Smitley
Venue: Proceedings of the 1988 ACM/IEEE conference on Supercomputing (1988)

This paper describes a synchronized network model suitable for the Horizon architecture. The model is defined in terms of a topology and routing policy. A three dimensional toroidal topology is investigated for its multiple redundant paths, memory locality and simplicity in both routing and construction. The routing policy is based on a desperation routing scheme in which it is not guaranteed that a message will make progress on a given network cycle. This scheme requires no complex deadlock avoidance algorithms or node to node flow control, allowing a very simple and efficient implementation. Design considerations and preliminary performance results are discussed.
Lower bounds on the length of universal traversal sequences
Authors: A. Borodin, W. L. Ruzzo, M. Tompa
Venue: Proceedings of the twenty-first annual ACM symposium on Theory of computing (1989)

Universal traversal sequences for d-regular n-vertex graphs require length &OHgr;(d2n2 + dn2 log n/d), for 3 &le; d &le; n/3 - 2. This is nearly tight for d = &THgr;(n). We also introduce and study several variations on the problem, e.g. edge-universal traversal sequences, showing how improved lower bounds on these would improve the bounds given above.
Automatic filing and retrieval of official documents using global mail attributes and a viewdata system with symbolically named pages
Authors: A. O. Amadi
Venue: ACM SIGOIS Bulletin (1988)

The filing and retrieval of messages in the office is a very important part of the office function. In this paper the global attributes of office message type, such as letter, memo, etc., the direction of flow of message, e.g. incoming, outgoing and internal, and the location of sender and subject matter are used to index official messages for filing in a hierarchical filing system. The filing is automatically done by an electronic mail system without user intervention. Retrieval of messages is done using a viewdata system.
Tense as discourse anaphor
Authors: Bonnie Lynn Webber
Venue: Computational Linguistics (1988)

In this paper, I consider a range of English expressions and show that their context-dependency can be characterized in terms of two properties:1. They specify entities in an evolving model of the discourse that the listener is constructing;2. The particular entity specified depends on another entity in that part of the evolving "discourse model" that the listener is currently attending to.Such expressions have been called anaphors. I show how tensed clauses share these characteristics, usually just attributed to anaphoric noun phrases. This not only allows us to capture in a simple way the oft-stated but difficult-to-prove intuition that tense is anaphoric, but also contributes to our knowledge of what is needed for understanding narrative text.
International Conference on Fifth Generation computer systems 1988
Authors: J. Nielsen
Venue: ACM SIGCHI Bulletin (1989)

The Fifth Generation project is a large Japanese research project aiming at producing a new kind of computer by 1991. It was originally started after much debate about the necessity for significantly more usable computers which should proliferate "like air" throughout society and among other things take care of the ageing population and lifelong learning. The people in MITI1 who sponsored the project must have had a good marketing consultant to pick the name of the project, for just its very name has inspired a lot of interest around the world.
Rapid prototyping of a parallel operating system for a generalized hypercube
Authors: E. F. Gehringer, B. D. Harry
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1 (1988)

B-HIVE is an experimental multiprocessor system under construction at North Carolina State University. Its operating system is derived from XINU, an operating system designed for teaching purposes. XINU was chosen because it is unusually well documented and supplied most of the features that were necessary at the outset of the project. Among the few changes made to XINU are a supervisor state and an interprocessor communication system.
The i860TM 64-bit supercomputing microprocessor
Authors: L. Kohn, N. Margulis
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

The Intel i860TM processor is a RISC-based microprocessor incorporating a RISC core with memory management, a floating point unit, and caches on a single chip. The 1,000,000 transistors allow a single chip implementation with highly optimized interunit communication and wide internal data buses. The parallelism and pipelining between the execution units, and the innovative cache management techniques are under explicit control of software. Vectorizable applications can use the pipelined adder and multiplier units to achieve up to 80 Mflops at 40 Mhz for the inner loops of common calculations. Special instructions allow using the data cache as a flexible vector register and support high data bandwidth from main memory. Finally, to support visualization of data, special hardware for 3D graphics is included.
A system for example-based programming
Authors: L. R. Neal
Venue: ACM SIGCHI Bulletin (1989)

We present an approach to programming environments that integrates syntax-directed editors with concepts borrowed from software reuse. We call our approach example-based programming, and we define it as programming using examples as visual aids or to fully or partially copy into programs. To implement an example-based programming environment, we augmented a syntax-directed editor with a window for example programs. The example programs, which are easily accessible, can be used as examples of language constructs, thus providing syntactic information through instantiations of templates, or as examples of algorithms or programs. The code in the example window can be viewed, totally or partially copied, or run. We discuss the motivation for example-based programming, describe our system implementing example-based programming in greater depth, and report on the results of an experiment to see how the system is used by programmers.
A three-processor Lisp machine architecture based on statistical analysis of Common Lisp programs
Authors: A. J. Klaassen, A. M. van Wezenbeek
Venue: ACM SIGPLAN Notices (1989)

A package has been written for statically analyzing Common Lisp source code programs. The analysis was performed on source code of the implementation of the Common Lisp dialect Spice Lisp and indicated which parts of Lisp are used often and therefore are important to be implemented such that they run fast. Based upon the identification of those parts we sketch the outlines of a three-processor Lisp machine architecture.
Algorithm 681: INTBIS, a portable interval Newton/bisection package
Authors: R. Baker Kearfott, Manuel Novoa,  III
Venue: ACM Transactions on Mathematical Software (TOMS) (1990)

We present a portable software package for finding all real roots of a system of nonlinear equations within a region defined by bounds on the variables. Where practical, the package should find all roots with mathematical certainty. Though based on interval Newton methods, it is self-contained. It allows various control and output options and does not require programming if the equations are polynomials; it is structured for further algorithmic research. Its practicality does not depend in a simple way on the dimension of the system or on the degree of nonlinearity.
Learnable and Nonlearnable Visual Concepts
Authors: H. Shvayster
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

Valiant's theory of the learnable is applied to visual concepts in digital pictures. Several visual concepts that are easily perceived by humans are shown to be learnable from positive examples. These concepts include a certain type of inaccurate copies of line drawings, identifying a subset of objects at specific locations, and pictures of lines in a fixed slope. Several characterizations of visual concepts by templates are shown to be nonlearnable (in the sense of Valiant) from positive-only examples. The importance of representations is demonstrated by showing that even though one can easily learn to identify pictures with at least one of two objects, identifying the objects is sometimes much harder (computationally infeasible).
Planar maps: an interaction paradigm for graphic design
Authors: P. Baudelaire, M. Gangnet
Venue: ACM SIGCHI Bulletin (1989)

Compared to traditional media, computer illustration software offers superior editing power at the cost of reduced freedom in the picture construction process. To reduce this discrepancy, we propose an extension to the classical paradigm of 2D layered drawing, the map paradigm, that is conducive to a more natural drawing technique. We present the key concepts on which the new paradigm is based: a) graphical objects, called planar maps, that describe shapes with multiple colors and contours; b) a drawing technique, called map sketching, that allows the iterative construction of arbitrarily complex objects. We also discuss user interface design issues in map based illustration software.
Entity-life modeling and structured analysis in real-time software design&mdash;a comparison
Authors: Bo Sanden
Venue: Communications of the ACM (1989)

While structure analysis is sometimes used as a first step towards a real-time software design with concurrent tasks, a more appropriate task structure can often be based directly on concurrent patterns in the problem environment.
Finite field manipulations in Macsyma
Authors: K. T. Rowney, R. D. Silverman
Venue: ACM SIGSAM Bulletin (1989)

We present the implementation of an extensive system of routines, in Macsyma, which allows finite field arithmetic and manipulation of symbolic objects in finite fields,
Integrating logic, object-oriented and procedural paradigms in a fault diagnosis and monitoring system
Authors: Gerhard Fleischanderl Gerhard Friedrich Wolfgang Neijdl, Johannes Retti
Venue: Proceedings of the 2nd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1989)

This paper describes ARTEX, a knowledge based system developed for quality assurance and fault localization in audio routing systems. Our system covers a large class of routing systems which may be flexibly configured. ARTEX uses an object-oriented model to represent the generic concepts and individual configurations. Fault localization strategies are realized by methods associated with objects and by heuristic rules focusing the diagnostic search.
A Taxonomy for Computer Architectures
Authors: David B. Skillicorn
Venue: Computer (1988)

A taxonomy is presented that extends M.J. Flynn's (IEEE Trans.Comput., vol. C-21, no.9, p.948-60, Sept. 1972), especially in the multiprocessor category. It is a two-level hierarchy in which the upper level classifies architectures based on the number of processors for data and for instructions and the interconnections between them. A lower level can be used to distinguish variants even more precisely; it is based on a state-machine view of processors. The author suggests why taxonomies are useful in studying architecture and shows how this applies to a number of modern architectures.
ParcBench: a benchmark for shared-memory architectures
Authors: N. J. Gunther, M. T. Noga
Venue: ACM SIGARCH Computer Architecture News (1989)

PARCBench is a non-synthetic, multi-component benchmark written in C and directed at Unix-based shared-memory multiprocessor architectures. Unlike most conventional benchmarks PARCBench generates multivariate data to produce a characterization of shared-memory architectures which necessarily goes beyond the single timing datum.
Query optimization in a memory-resident domain relational calculus database system
Authors: Kyu-Young Whang, Ravi Krishnamurthy
Venue: ACM Transactions on Database Systems (TODS) (1990)

We present techniques for optimizing queries in memory-resident database systems. Optimization techniques in memory-resident database systems differ significantly from those in conventional disk-resident database systems. In this paper we address the following aspects of query optimization in such systems and present specific solutions for them: (1) a new approach to developing a CPU-intensive cost model; (2) new optimization strategies for main-memory query processing; (3) new insight into join algorithms and access structures that take advantage of memory residency of data; and (4) the effect of the operating system's scheduling algorithm on the memory-residency assumption. We present an interesting result that a major cost of processing queries in memory-resident database systems is incurred by evaluation of predicates. We discuss optimization techniques using the Office-by-Example (OBE) that has been under development at IBM Research. We also present the results of performance measurements, which prove to be excellent in the current state of the art. Despite recent work on memory-resident database systems, query optimization aspects in these systems have not been well studied. We believe this paper opens the issues of query optimization in memory-resident database systems and presents practical solutions to them.
Efficient decoding of prefix codes
Authors: Daniel S. Hirschberg, Debra A. Lelewer
Venue: Communications of the ACM (1990)

A special case of the data compression problem is presented, in which a powerful encoder transmits a coded file to a decoder that has severely constrained memory. A data structure that achieves minimum storage is presented, and alternative methods that sacrifice a small amount of storage to attain faster decoding are described.
Process management and exception handling in multiprocessor operating systems using object-oriented design techniques
Authors: Vincent Russo, Gary Johnston, Roy Campbell
Venue: ACM SIGPLAN Notices (1988)

The programming of the interrupt handling mechanisms, process switching primitives, scheduling mechanisms, and synchronization primitives of an operating system for a multiprocessor require both efficient code in order to support the needs of high-performance or real-time applications and careful organization to facilitate maintenance. Although many advantages have been claimed for object-oriented class hierarchical languages and their corresponding design methodologies, the application of these techniques to the design of the primitives within an operating system has not been widely demonstrated. To investigate the role of class hierarchical design in systems programming, the authors have constructed the Choices multiprocessor operating system architecture using the C++ programming language. During the implementation, it was found that many operating system design concerns can be represented advantageously using a class hierarchical approach, including: the separation of mechanism and policy; the organization of an operating system into layers, each of which represents an abstract machine; and the notions of process and exception management. In this paper, we discuss an implementation of the low-level primitives of this system and outline the strategy by which we developed our solution.
A presentation manager based on application semantics
Authors: S. McKay, W. York, M. McMahon
Venue: Proceedings of the 2nd annual ACM SIGGRAPH symposium on User interface software and technology (1989)

We describe a system for associating the user interface entities of an application with their underlying semantic objects. The associations are classified by arranging the user interface entities in a type lattice in an object-oriented fashion. The interactive behavior of the application is described by defining application operations in terms of methods on the types in the type lattice. This scheme replaces the usual &ldquo;active region&rdquo; interaction model, and allows application interfaces to be specified directly in terms of the objects of the application itself. We discuss the benefits of this system and some of the difficulties we encountered.
GABRIEL: a design environment for programmable DSPs
Authors: E. A. Lee, E. Goei, H. Heine, W. Ho, S. Bhattacharyya, J. Bier, E. Guntvedt
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

Gabriel is a retargetable software system for the development of assembly code and microcode for single or multiple programmable DSPs. It is intended to ease code development even for processors that are not easy targets for conventional compilers. Code generation for the Motorola DSP56001 is emphasized. A Thor-based simulator supplies a variety of target multi-DSP architectures based on the DSP56001. The top-level algorithm description is a large grain data flow graph, and a graphical interface using OCT and VEM provides a natural representation of the high level structure of the algorithm.
Debugging distributed C programs by real time reply
Authors: Larry D. Wittie
Venue: ACM SIGPLAN Notices (1989)

Bugnet is a portable Unix system designed to debug C programs distributed within a local area network. A graphics interface allows the user of a Sun workstation to manage process groups and monitor process interactions very conveniently. Bugnet gives information about interprocess communication, I/O events, and execution traces for each component process. It allows the user to detect an error visually, to roll global program state back to a time before the error, and to replay events almost exactly as they previously occurred. Current work on Bugnet is making the implementation easier to port, seeing if replay accuracy can be improved by minor adjustments in the Unix process scheduler, linking it with Unix dbx to control individual processes, and determining useful tools for filtering of long event strings and for detecting errors. The Bugnet project is testing how well existing multiprocess C programs can be debugged without special hardware features that make porting difficult. An initial version is running on a network of Suns. It currently reproduces real time execution sequences with an accuracy of 0.01 to 0.10 seconds.
File concepts for parallel I/O
Authors: T. W. Crockett
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

The subject of I/O has often been neglected in the design of parallel computer systems, although for many problems I/O rates will limit the speedup attainable. The I/O problem is addressed here by considering the role of files in parallel systems. The notion of parallel files is introduced. Parallel files provide for concurrent access by multiple processes, and utilize parallelism in the I/O system to improve performance. Parallel files can also be used conventionally by sequential programs. A set of standard parallel file organizations is proposed, based on common data partitioning techniques. Implementation strategies for the proposed organizations are suggested, using multiple storage devices. Problem areas are also identified and discussed.
Communication methods of the vocally disabled: a review
Authors: L. Condie
Venue: Issue 41 (January 1989) (1989)

Despite the growing number of augmentative aids for the vocally disabled, none allows communication at anything near speaking rates. This review looks at the types of vocal disabilities that exist and the aids available to these people. Additionally, the prostheses and speaking techniques available to laryngectomees are examined in some detail. Finally, some of the current research into augmentative aids for the vocally disabled is briefly covered.
Applying qualitative knowledge to aircraft engine system design
Authors: R. E. Phillips, W. W. Wison, K. Parmenter
Venue: Proceedings of the 2nd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1989)

The design of an aircraft engine involves careful application of quantitative analysis and qualitative evaluation to determine a suitable configuration for meeting functional constraints. In the traditional approach this implies a tedious manual process must be performed. In addition, the depth of experience of the practitioner plays a large role in the qualitative evaluation which may lead to inconsistent results. In this study, the Engineous Design Shell is utilized to automate the tedious nature of the manual process and to capture the qualitative knowledge necessary to produce consistently optimal results.
On the D-bases of polynomial ideals over principal ideal domainst
Authors: Luquan Pan
Venue: Journal of Symbolic Computation (1989)

A new reduction, the D-reduction, and new bases, the D-bases, are introduced for polynomial ideals. Every polynomial ideal has a D-basis, and every polynomial in the ideal D-reduces to zero by that basis. A necessary and sufficient condition for testing such bases is given, and a simple algorithm for constructing them is presented. The reductions and Groner bases that were introduced by Buchberger (1984) and by Kandri-Rody & Kaput (1984b) are extended to B-reductions and B-bases for polynomial ideals over B-domains. The relations between B-bases and D-bases, and between B-bases, are investigated. Finally, we discuss the relation between D-bases and B-bases over Euclidean domains.
Application of Affine-Invariant Fourier Descriptors to Recognition of 3-D Objects
Authors: K. Arbter, W. E. Snyder, H. Burhardt, G. Hirzinger
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

The method of Fourier descriptors is extended to produce a set of normalized coefficients which are invariant under any affine transformation (translation, rotation, scaling, and shearing). The method is based on a parameterized boundary description which is transformed to the Fourier domain and normalized there to eliminate dependencies on the affine transformation and on the starting point. Invariance to affine transforms allows considerable robustness when applied to images of objects which rotate in all three dimensions, as is demonstrated by processing silhouettes of aircraft maneuvering in three-space.