ppxscal/embedding_network huggingface dataset:
The HiPAC project: combining active databases and timing constraints
Authors: U. Dayal, B. Blaustein, A. Buchmann, U. Chakravarthy, M. Hsu, R. Ledin, D. McCarthy, A. Rosenthal, S. Sarin, M. J. Carey, M. Livny, R. Jauhari
Venue: ACM SIGMOD Record (1988)

The HiPAC (High Performance ACtive database system) project addresses two critical problems in time-constrained data management: the handling of timing constraints in databases, and the avoidance of wasteful polling through the use of situation-action rules that are an integral part of the database and are monitored by DBMS's condition monitor. A rich knowledge model provides the necessary primitives for definition of timing constraints, situation-action rules, and precipitating events. The execution model allows various coupling modes between transactions, situation evaluations and actions, and provides the framework for correct concurrent execution of transactions and triggered actions. Different approaches to scheduling of time-constrained tasks and transactions are explored and an architecture is being designed with special emphasis on the interaction of the time-constrained, active DBMS and the operating system. Performance models are developed to evaluate the various design alternatives.
Formal specification of a small example based on GKS
Authors: D. A. Duce, E. V. C. Fielding, L. S. Marshall
Venue: ACM Transactions on Graphics (TOG) (1988)

Implicit regeneration is a fundamental concept of the Graphical Kernel System (GKS), an IS0 International Standard, but it is difficult to understand as presented in the English language specification of GKS. Consequently, it is a good example to use in determining whether formal specification techniques can be used effectively to describe and clarify graphics concepts of this kind. The problem is first motivated informally with a description of GKS concepts and terminology. A formal specification of implicit regeneration using a simplified model is then presented, and the notation that is used for its formalization (VDM) is described. Finally, properties of implicit regeneration are formulated and the specification is proved to conform to these properties. This demonstrates the applicability of formal specification to graphics software, because a sufficiently precise description of a complicated concept is provided that enables its consistency to be checked against an intuitive understanding of the concept as derived from the GKS document.
Investigation of non-interference real-time debugging through bus cycle simulation and interpretation
Authors: T. R. Cahall,  Jr., K. Y. Fang
Venue: Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow (1987)

In the recent decade, software development and debugging advancements have been greatly outpaced by the advancements in hardware design and integration. The largest portion of time spent in software development is testing and debugging. Symbolic debuggers, syntax directed editors, and high level language oriented breakpoint systems have helped reduce the time spent by software developers in debugging their programs. This is not the case for timing and load sensitive real-time software. Conventional breakpoint debuggers cause interference to the target system which alters critical timing and load characteristics. This renders them useless for real-time debugging. A non-interfering debugger is of major importance to the successful debugging of real-time software applications. Such a system must be comprised of both hardware and software components to ensure complete independence from target system resources. This paper discusses the creation of a bus cycle image simulator for a general purpose microprocessor based system. The simulator represents an extensible model of a microprocessor at the bus cycle level. It will be utilized in the research of the hardware and software components of a non-interfering debugger.
PARLOG: parallel programming in logic
Authors: Keith Clark, Steve Gregory
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1986)

PARLOG is a logic programming language in the sense that nearly every definition and query can be read as a sentence of predicate logic. It differs from PROLOG in incorporating parallel modes of evaluation. For reasons of efficient implementation, it distinguishes and separates and-parallel and or-parallel evaluation. PARLOG relations are divided into two types: single-solution relations and all-solutions relations. A conjunction of single-solution relation calls can be evaluated in parallel with shared variables acting as communication channels for the passing of partial bindings. Only one solution to each call is computed, using committed choice nondeterminism. A conjunction of all-solutions relation calls is evaluated without communication of partial bindings, but all the solutions may be found by an or-parallel exploration of the different evaluation paths. A set constructor provides the main interface between single-solution relations and all-solutions relations. This paper is a tutorial introduction to PARLOG. It assumes familiarity with logic programming. Categories and Subject Descriptors: D.l.l [Programming Techniques]: Applicative (Functional)
Ada runtime environment working group&mdash;a framework for describing Ada runtime environment
Venue: ACM SIGAda Ada Letters (1988)

The concept of a runtime environment to support program execution has always been associated with application software - it has only been with programming languages like Ada that the concept has become more apparent and significant to application effectiveness. The purpose of this paper is to explain the basic elements of Ada runtime environments in order to support the presentation of ARTEWG documents, such as the Catalogue of Runtime Implementation Dependencies. Additionally, this paper may be useful as a framework (or common vocabulary) for buyers and builders of Ada runtime environments to discuss details of Ada runtime environments.The paper begins with a historical perspective on runtime environments to show how the technology evolved to the current state exhibited by Ada runtime environments. This leads into a proposed framework for describing runtime environments, including a taxonomy. A concise and consistent set of terms, which are summarized in a glossary, explains different elements of Ada runtime environments.
A computer science perspective of bridge design
Authors: Alfred Spector, David Gifford
Venue: Communications of the ACM (1986)

What kinds of lessons does a classical engineering discipline like bridge design have for an emerging engineering discipline like computer systems design? Case-study editors Alfred Spector and David Gifford consider the insight and experience of bridge designer Gerard Fox to find out how strong the parallels are.
Managing stack frames in Smalltalk
Authors: J. E. B. Moss
Venue: Papers of the Symposium on Interpreters and interpretive techniques (1987)

The Smalltalk programming language allows contexts (stack frames) to be accessed and manipulated in very general ways. This sometimes requires that contexts be retained even after they have terminated executing, and that they be reclaimed other than by LIFO stack discipline. The authoritative definition of Smalltalk [Goldberg and Robson 83] uses reference counting garbage collection to manage contexts, an approach found to be inadequate in practice [Krasner, et al. 83]. Deutsch and Schiffman have described a technique that uses an actual stack as much as possible [Deutsch and Schiffman 84]. Here we offer a less complex technique that we expect will have lower total overhead and reclaim many frames sooner and more easily. We are implementing our technique as part of a state of the art Smalltalk interpreter. The approach may apply to other languages that allow indefinite lifetimes for execution contexts, be they interpreted or compiled.
Computing in higher education: the Athena experience
Authors: Edward Balkovich, Steven Lerman, Richard P. Parmelee
Venue: Communications of the ACM (1985)

Project Athena at MIT is an experiment to explore the potential uses of advanced computer technology in the university curriculum. About 60 different educational development projects, spanning virtually all of MIT's academic departments, are already in progress.
A VLIW architecture for a trace scheduling compiler
Authors: Robert P. Colwell, Robert P. Nix, John J. O'Donnell, David B. Papworth, Paul K. Rodman
Venue: ACM SIGARCH Computer Architecture News (1987)

Very Long Instruction Word (VLIW) architectures were promised to deliver far more than the factor of two or three that current architectures achieve from overlapped execution. Using a new type of compiler which compacts ordinary sequential code into long instruction words, a VLIW machine was expected to provide from ten to thirty times the performance of a more conventional machine built of the same implementation technology.Multiflow Computer, Inc., has now built a VLIW called the TRACETM along with its companion Trace SchedulingTM compacting compiler. This new machine has fulfilled the performance promises that were made. Using many fast functional units in parallel, this machine extends some of the basic Reduced-Instruction-Set precepts: the architecture is load/store, the microarchitecture is exposed to the compiler, there is no microcode, and there is almost no hardware devoted to synchronization, arbitration, or interlocking of any kind (the compiler has sole responsibility for runtime resource usage).This paper discusses the design of this machine and presents some initial performance results.
Structuring computer-mediated communication systems to avoid information overload
Authors: Starr R. Hiltz, Murray Turoff
Venue: Communications of the ACM (1985)

Unless computer-mediated communication systems are structured, users will be overloaded with information. But structure should be imposed by individuals and user groups according to their needs and abilities, rather than through general software features.
The future of computer languages: implications for education
Authors: Naomi S. Baron
Venue: ACM SIGCSE Bulletin (1986)

Which computer languages should we be teaching our students &mdash; and why? This paper examines the multitude of languages now available from three perspectives: classificatory, predictive, and pedagogical. It offers a &ldquo;linguistic&rdquo; analysis of computer languages in terms of their structure, their function, and their genealogy. Using these classifications, the paper then analyzes current and future trends for each language type. The classifications and predictions suggest a fundamental distinction between two sorts of languages: those appropriate for public computing (i.e. programming done by most professional computer scientists) and those appropriate for private computing (computing by individuals for their own purposes). The paper suggests that while would-be computer scientists need to learn public computing languages, private computing languages may be especially appropriate for non-professional computer users.
Aesop: a tool for automated transistor sizing
Authors: K. S. Hedlund
Venue: Proceedings of the 24th ACM/IEEE Design Automation Conference (1987)

This work addresses the problem of automating the electrical optimization of combinatorial MOS circuits. Improvements to a circuit's speed, area and power consumption are sought through modifications to the transistor sizes in the circuit; no changes in the circuit structure, number of gates or clocking are introduced. Linear algorithms are presented for computing optimal transistor sizes to minimize delay, area or power. These algorithms are implemented in an interactive tool, Aesop. Aesop is a powerful and fast &ldquo;what-if&rdquo; tool that allows the designer to explore the space of designs having optimal transistor sizes. When compared to manual designs, the circuits produced by Aesop are typically faster or have substantially lower area and power consumption. Compared to untuned circuits, Aesop typically increases circuit speed by a factor of 2 to 4. Alternatively, power consumption and transistor area can be reduced by 25 &mdash; 50% with no sacrifice in circuit speed. These improvements are computed interactively on a professional workstation for circuits containing thousands of transistors.
The Comparison Approach to Multiprocessor Fault Diagnosis
Authors: Anton T. Dahbura, Krishan K. Sabnani, Linda L. King
Venue: IEEE Transactions on Computers (1987)

In this correspondence a system-level, comparison-based strategy for identifying faulty processors in a multiprocessor system is described. Unlike other strategies which have been proposed in the literature, the comparison approach is more efficient and relies on more realistic assumptions about the system under consideration. The new strategy is shown to correctly identify the set of faulty processors with a remarkably high probability, making it an attractive and viable addition or alternative to present fault diagnosis techniques.
Automated Concept Acquisition in Noisy Environments
Authors: Francesco Bergadano, Attilio Giordana, Lorenza Saitta
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1988)

A system that performs automated concept acquisition from examples and has been specially designed to work in noisy environments is presented. The learning methodology is aimed at the target problem of finding discriminant descriptions of a given set of concepts and uses both examples and counterexamples. The learned knowledge is expressed in the form of production rules, organized into separate clusters, linked together in a graph structure. Knowledge extraction is guided by a top-down control strategy, through a process of specialization. The system also utilizes a technique of problem reduction to contain the computational complexity. Several criteria are proposed for evaluating the acquired knowledge. The methodology has been tested on a problem in the field of speech recognition and the experimental results obtained are reported and discussed.
A path selection global touter
Authors: Y. C. Hsu, Y. Pan, W. J. Kubitz
Venue: Proceedings of the 24th ACM/IEEE Design Automation Conference (1987)

In this paper, a new path selection heuristic search algorithm is proposed for connecting two components of vertices. A novel feature of the algorithm is that the active terminals (vertices in the net which are not yet connected) are modeled as magnets during the path searching process. The heuristic search algorithm is applied to two commonly used multi-terminal net tree connection algorithms. Experimental results show that the new path selection heuristic search algorithm is better than the other algorithms which do not consider the active terminals.
Attributes of the performance of central processing units: a relative performance prediction model
Authors: Phillip Ein-Dor, Jacob Feldmesser
Venue: Communications of the ACM (1987)

Using readily available data on CPU characteristics&mdash;main memory size, cache memory size, number of channels, and machine cycle time&mdash;it is possible to predict relative CPU performance for a wide range of machines. Statistical analyses indicate that these characteristics explain virtually all the variance in relative performance.
Managing APL public code for an in-house APL system (before and after LOGOS)
Authors: D. F. Stoneburner
Venue: Proceedings of the international conference on APL: APL in transition (1987)

This paper will present APL Public Library management concepts used in a large in-house APL system development environment and describe a number of tools developed for this purpose. Public libraries, workspaces, functions and variables are discussed as well as documentation, reporting of changes, audit records, backup versions, and test versions. User tools discussed include functions for describing APL public files, libraries, workspaces, functions and variables, locating these objects, keyword searches, and a glossary of terms. Other user facilities include a NEWS system and an online system for submitting problem reports and requests for enhancements. Further maintenance tools include automatic generation of WSDOC listings when changes are made and automatically generated reports providing a variety of information such as libraries or workspaces lacking descriptions, lists of APL public workspaces and files with their status, function source verification, and exception reporting of workspace changes. A discussion of LOGOS, a programming environment for APL offered by IP Sharp Associates, is also presented and how it enhances the capabilities previously described.
New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM
Authors: B. Awerbuch, Y. Shiloach
Venue: IEEE Transactions on Computers (1987)

Parallel algorithms for finding the connected components (CC) and a minimum spanning FOREST (MSF) of an undirected graph are presented. The primary model of computation considered is that called "shuffle-exchange network" in which each processor has its own local memory, no memory is shared, and communication among processors is done via a fixed degree network. This model is very convenient for actual realization. Both algorithms have depth of O(log2 n) while using n2 processors. Here n is the number of vertices in the graph. The algorithms are first presented for the PRAM (parallel RAM) model, which is not realizable, but much more convenient for the design and presentation of algorithms. The CC and MSF algorithms are no exceptions. The CC PRAM algorithm is a simplification of the one appearing in [17]. A modification of this algorithm yields a simple and efficient MSF algorithm. Both have depth of O(log m) and they use m processors, where m is the number of edges in the graph.
An improved introduction to computing emphasizing the development of algorithms and using the Apple Macintosh Pascal
Authors: William G. Bulgren, Earl J. Schweppe, Tim Thurman
Venue: Proceedings of the seventeenth SIGCSE technical symposium on Computer science education (1986)

Many colleges and universities offer an introductory computer science course based on a specific programming language. The Department of Computer Science at the University of Kansas has recently created a new environment in order to better teach such topics as problem solving, algorithmic design, elementary programming techniques, and elementary computer techniques. This paper will discuss the transition from a time-sharing environment to a modern microcomputer laboratory. It will also discuss the pedagogic techniques used in the new environment. It is hoped that others will benefit from our experiences.
Single-factor Hensel lifting and its application to the straight-line complexity of certain polynomials
Authors: E. Kaltofen
Venue: Proceedings of the nineteenth annual ACM symposium on Theory of computing (1987)

Three theorems are presented that establish polynomial straight-line complexity for certain operations on polynomials given by straight-line programs of unbounded input degree. The first theorem shows how to compute a higher order partial derivative in a single variable. The other two theorems impose the degree of the output polynomial as a parameter of the length of the output program. First it is shown that if a straight-line program computes an arbitrary power of a multivariate polynomial, that polynomial also admits a polynomial bounded straight-line computation. Second, any factor of a multivariate polynomial given by a division-free straight-line program with relatively prime co-factor also admits a straight-line computation of length polynomial in the input length and the degree of the factor. This result is based on a new Hensel lifting process, one where only one factor image is lifted back to the original factor. As an application we get that the greatest common divisor of polynomials given by a division-free straight-line program has polynomial straight-line complexity in terms of the input length and its own degree.
The synthesis of cloth objects
Authors: Jerry Weil
Venue: ACM SIGGRAPH Computer Graphics (1986)

In image synthesis, cloth objects such as clothes are most often modelled as textures mapped onto rigid surfaces. However, in order to represent such objects more realistically, their physical properties must be examined. This paper describes a method for modelling cloth material hanging in three dimensions when supported by any number of constraint points. The cloth synthesized with this model contains folds and appears more realistic than simple texture mapping. This paper also describes a method for rendering the cloth once its free-hanging shape has been determined.The computation of the surface of a free-hanging cloth is performed in two stages. The first stage approximates the shape of the surface which is interior to the constraint points, and the second stage performs a relaxation process on all points on the surface to arrive at a close approximation to its shape. The rendering of the surfaces is done using a ray-tracer which treats the surface as a mesh of line segments.
Mach and Matchmaker: kernel and language support for object-oriented distributed systems
Authors: Michael B. Jones, Richard F. Rashid
Venue: Conference proceedings on Object-oriented programming systems, languages and applications (1986)

Mach, a multiprocessor operating system kernel providing capability-based interprocess communication, and Matchmaker, a language for specifying and automating the generation of multi-lingual interprocess communication interfaces, are presented. Their usage together providing a heterogeneous, distributed, object-oriented programming environment is described. Performance and usage statistics are presented. Comparisons are made between the Mach/Matchmaker environment and other related systems. Possible future directions are examined.
Typesetting APL using a Macintosh
Authors: John E. Howland
Venue: ACM SIGAPL APL Quote Quad (1986)

This paper describes a low-cost approach to providing high quality printing of text which contains APL characters as well as other text fonts. APL fonts for the Macintosh&trade;computer and the Apple LaserWriter&trade;printer have been developed which allow low-cost typesetting of APL expressions and functions. Since the Macintosh computer can be used as a work station on several commercial typesetting machines, these fonts can be used to provide commercial quality printing of APL manuscripts.
Spreadsheet calculations of probabilities from the F, t, χ2, and normal distribution
Authors: Frank G. Landram, James R. Cook, Marvin Johnston
Venue: Communications of the ACM (1986)

By computing probabilities from the normalization of the F distribution (instead of by numerical integration methods), statistical capabilities in spreadsheet operations can be greatly expanded and enhanced.
Macros by Example in Graphical UIMS
Authors: Dan R. Olsen,  Jr., John R. Dance
Venue: IEEE Computer Graphics and Applications (1988)

A macro facility that allows end users to extend interactive graphical applications is presented as part of a user-interface management system (UIMS). Such macros are expressed by example; that is, the end user programs the macro in the application's generated user interface. Problems with macros-by-example in graphical applications are explored, and requirements to accommodate such a facility are defined for the UIMS dialogue model. Existing UIMS models are reviewed relative to these requirements, and the unique facilities of the MIKE (menu interaction kontrol environment) semantics-based model are presented. The implementation of the macro-by-example system is discussed, as well as the particular implementation of a multicommand UNDO facility, which is necessary when editing micros by example.