ppxscal/embedding_network huggingface dataset:
Compression of Three-State Data Serial Streams by Means of a Parallel LFSR Signature Analyzer
Authors: Andrzej Hlawiczka
Venue: IEEE Transactions on Computers (1986)

In this paper drawbacks of the three-state data compressor in the form of the unit decoder 3/2 JK flip-flop are described. The main results of the paper are the algebraic operation model and the description of detection capability of a new three-state data stream compressor consisting of decoder 3/2 and a two-input shift register TISR. In particular, the properties of the unit decoder 3/2 TISR in detecting faults of the s-a-0, s- a-1, and s-a-HZ type are discussed. In this paper important aspects of the application of the new compressor are given. An example of the new compressor's performance scheme is also described. An additional result of this paper is the description of the operation model and the detection capability of the multiinput shift register MISR in which the most significant bit and other selected flip-flop output signals are fed back to the least significant bit positions via Exclusive-OR gates outside the flip-flops.
Superviews: Virtual Integration of Multiple Databases
Authors: A. Motro
Venue: IEEE Transactions on Software Engineering (1987)

An important advantage of a database system is that it provides each application with a custom view of the data. The issue addressed in this paper is how to provide such custom views to applications that access multiple databases. The paper describes a formal method that generates such superviews, in an interactive process of schema editing operations. A mapping of the superview into the individual databases is derived from the editing process, and is stored together with the superview as a virtual database. When this database is interrogated, the mapping is used to decompose each query into a set of queries against the individual databases, and recompose the answers to form an answer to the original query. As this process is transparent to the user, virtual databases may be regarded as a more general type of databases. A prototype database system, that allows users to construct virtual databases and interrogate them, has been developed.
Functional Description of Connector-Switch-Attenuator Networks
Authors: E. Cerny, J. Gecsei
Venue: IEEE Transactions on Computers (1988)

The switch-level abstraction of digital MOS circuits has been used primarily in simulators. In formal verification, a functional description must be first extracted from the switch network. It is shown here how the theory of characteristic functions can be applied to analyze such networks and to extract their functional description.
Minimal degrees for polynomial reducibilities
Authors: Steven Homer
Venue: Journal of the ACM (JACM) (1987)

The existence of minimal degrees is investigated for several polynomial reducibilities. It is shown that no set has minimal degree with respect to polynomial many-one or Turing reducibility. This extends a result of Ladner in which only recursive sets are considered. A polynomial reducibility &le;hT is defined. This reducibility is a strengthening of polynomial Turing reducibility, and its properties relate to the P = ? NP question. For this new reducibility, a set of minimal degree is constructed under the assumption that P = NP. However, the set constructed is nonrecursive, and it is shown that no recursive set is of minimal &le; hT degree.
Virtual time
Authors: David R. Jefferson
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1985)

Virtual time is a new paradigm for organizing and synchronizing distributed systems which can be applied to such problems as distributed discrete event simulation and distributed database concurrency control. Virtual time provides a flexible abstraction of real time in much the same way that virtual memory provides an abstraction of real memory. It is implemented using the Time Warp mechanism, a synchronization protocol distinguished by its reliance on lookahead-rollback, and by its implementation of rollback via antimessages.
Distributed decision making: a research agenda
Authors: Clyde W. Holsapple, Andrew B. Whinston
Venue: ACM SIGOIS Bulletin (1988)

Beyond the narrow objective of supporting individual problem solving, computerized decision support systems have a potential for more directly supporting decisions distributed across multiple participants. The realization of distributed support system potential depends on a clear understanding of distributed decision making. Here, we introduce the broad outlines of a conceptual, general-purpose framework for describing and studying distributed decision making. It provides a basis for addressing both the structure and dynamics of distributed decision making with respect to the three elements of individual problem solving, communication, and coordination. The framework provides a foundation for comparing, contrasting, designing, and managing distributed decision making systems which are jointly human-computer in nature. We offer a commentary on a variety of research issues that deserve to be investigated within the framework's context.
A note on the speed of Prolog
Authors: J. Paakki
Venue: ACM SIGPLAN Notices (1988)

Based on an experiment in compiler writing methods, we discuss the speed of Prolog programs of modest size when compared with operationally equivalent Pascal programs. We have produced three versions of a compiler for the programming language Edison using three different tools: Pascal, Prolog, and a compiler writing system (GAG). The Prolog and Pascal programs analyzed in this case are the semantic analysis and the code transformation phases of the Edison compiler. Our analysis shows that it is possible to write Prolog programs that are able to compete in speed with the corresponding programs written in Pascal.
Analysis of object oriented spatial access methods
Authors: Christos Faloutsos, Timos Sellis, Nick Roussopoulos
Venue: ACM SIGMOD Record (1987)

This paper provides an analysis of R-trees and a variation (R+-trees) that avoids overlapping rectangles in intermediate nodes of the tree. The main contributions of the paper are the following. We provide the first known analysis of R-trees. Although formulas are given for objects in one dimension (line segments), they can be generalized for objects in higher dimensions as well. We show how the transformation of objects to higher dimensions [HINR83] can be effectively used as a tool for the analysis of R- and R+- trees. Finally, we derive formulas for R+-trees and compare the two methods analytically. The results we obtained show that R+-trees require less than half the disk accesses required by a corresponding R-tree when searching files of real life sizes R+-trees are clearly superior in cases where there are few long segments and a lot of small ones.
Analyzing the structure of argumentative discourse
Authors: Robin Cohen
Venue: Computational Linguistics (1987)

Consider a discourse situation where the speaker tries to convince the hearer of a particular point of view. The first task for the hearer is to understand what it is the speaker wants him to believe--to analyze the structure of the argument being presented, before judging credibility and eventually responding.This paper describes a model for the analysis of arguments that includes:&bull; a theory of expected coherent structure which is used to limit analysis to the reconstruction of particular transmission forms;&bull; a theory of linguistic clues which assigns a functional interpretation to special words and phrases used by the speaker to indicate the structure of the argument;&bull; a theory of evidence relationships which includes the demand for pragmatic analysis to accommodate beliefs not currently held.The implications of this particular design for dialogue analysis in general are thus:&bull; structure is an important feature to extract in a representation to control the processing;&bull; linguistic constructions can be assigned useful interpretations;&bull; pragmatic analysis is crucial in cases where the participants differ in beliefs.
Church-Rosser Thue systems and formal languages
Authors: Robert McNaughton, Paliath Narendran, Friedrich Otto
Venue: Journal of the ACM (JACM) (1988)

Since about 1971, much research has been done on Thue systems that have properties that ensure viable and efficient computation. The strongest of these is the Church-Rosser property, which states that two equivalent strings can each be brought to a unique canonical form by a sequence of length-reducing rules. In this paper three ways in which formal languages can be defined by Thue systems with this property are studied, and some general results about the three families of languages so determined are studied.
The architecture of the hardware unification unit and an implementation
Authors: N. S. Woo
Venue: Proceedings of the 18th annual workshop on Microprogramming (1985)

This paper describes the architecture and the current implementation of the hardware unification unit (HUU). The HUU performs the literal unification operation in Prolog processing. It is designed as a coprocessor to a host system that handles other operations of Prolog processing such as bookkeeping and sequencing. After the host system provides input values to the HUU and activates it, the HUU works independently from the host system; when it finishes its operation it reports the result to the host system. The HUU contains local memory that stores the variable binding information. The microinstructions and a sample microprogram of the HUU are described. Performance measures obtained from the HUU simulator are presented and discussed.
An historical perspective on clinical laboratory information systems
Authors: T. L. Lincoln
Venue: Proceedings of ACM conference on History of medical informatics (1987)

The clinical laboratory environment represents a microcosm in which practical solutions to operational problems in medical informatics have gone hand in hand with the development of laboratory instrumentation and computer technologies. These achievements follow a typical pattern in technological development, leading from the specific to the inclusive. The history of laboratory computing offers insights, not only for the past, but also for the future.
Circuit simulation on the connection machine
Authors: D. M. Webber, A. Sangiovanni-Vincentelli
Venue: Proceedings of the 24th ACM/IEEE Design Automation Conference (1987)

Accurate circuit simulation is a very important step in the design of high performance integrated circuits. The ever increasing size of integrated circuits requires the use of an inordinate amount of computer time to be spent in circuit simulation. Parallel processors have been considered to speed up the simulation process. Massively parallel computers have been made available recently and present a new interesting paradigm for expensive CAD applications. This paper describes algorithms and programming techniques needed to develop SUM (Simulation Using Massively parallel computers), a relaxation-based circuit simulator on the Connection Machine, a massively parallel processor with up to 65536 processors. SUM can simulate circuits at almost constant CPU time per iteration, regardless of circuit size. SUM can simulate very large circuits. Circuit simulators running on the largest super computers can run circuits of comparable size, however SUM is easily scalable as the number of processors in the Connection Machine increases, with almost no increase in CPU time.
Abstract interaction tools: a language for user interface management systems
Authors: Jan Van Den Bos
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1988)

A language model is presented for the specification of User Interface Management Systems. The model, called the Abstract Interaction Tool (AIT) model, offers a tree-like hierarchy of interaction objects. Each object represents a subtree and can be considered as an abstract input device containing a syntax-like specification of the required input pattern. The hierarchy of specifications amounts to a system of syntactical productions with multiple control. Terminal nodes of the AIT tree represent the interface to the physical interaction devices. The AIT model features hierarchical output resource management. At the higher, more abstract, level the input-output is loosely coupled. At lower levels the coupling becomes increasingly tight. At the upper levels, AITs model the functions (what) required by the user, whereas at the lower levels the way to accomplish them (how) is stressed. The AIT model has modes for multithread and multiple-device user interaction. There are facilities for context-dependent prompting, echoing, feedback, error correction, and expertise levels. A special section in the AIT provides for links to application modules. As a model for general interactive systems, AITs can be applied to graphics, process control, dialogue, and real-time systems. AITs can also be used to define controlled production rules in knowledge-based systems. In addition the model can provide tools for the software engineering phases specification and prototyping.
Data sharing in group work
Authors: Irene Greif, Sunil Sarin
Venue: ACM Transactions on Information Systems (TOIS) (1987)

Data sharing is fundamental to computer-supported cooperative work: People share information through explicit communication channels and through their coordinated use of shared databases. This paper examines the data management requirements of group work applications on the basis of experience with three prototype systems and on observations from the literature. Database and object management technologies that support these requirements are briefly surveyed, and unresolved issues in the particular areas of access control and concurrency control are identified for future research.
Virtual memory on a narrow machine for an object-oriented language
Authors: Ted Kaehler
Venue: ACM SIGPLAN Notices (1986)

LOOM (Large Object-Oriented Memory) is a virtual memory implemented in software that supports the Smalltalk-80(&trade;) programming language and environment on the Xerox Dorado computer. LOOM provides 8 billion bytes of secondary memory address space and is specifically designed to run on computers with a narrow word size (16-bit wide words). All storage is viewed as objects that contain fields. Objects may have an average size as small as 10 fields. LOOM swaps objects between primary and secondary memory, and addresses each of the two memories with a different sized object pointer. When objects are cached in primary memory, they are known only by their short pointers. On a narrow word size machine, the narrow object pointers in primary memory allow a program such as the Smalltalk-80 interpreter to enjoy a substantial speed advantage. Interesting design problems and solutions arise from the mapping between the two address spaces and the temporary nature of an object's short address. The paper explains why the unusual design choices in LOOM were made, and provides an interesting example of the process of designing an integrated virtual memory and storage management system.
Discovery procedures for sublanguage selectional patterns: initial experiments
Authors: Ralph Grishman, Lynette Hirschman, Ngo Thanh Nhan
Venue: Computational Linguistics (1986)

Selectional constraints specify, for a particular domain, the combinations of semantic classes acceptable in subject-verb-object relationships and other syntactic structures. These constraints are important in blocking incorrect analyses in natural language processing systems. However, these constraints are domain-specific and hence must be developed anew when a system is ported to a new domain. A discovery procedure for selectional constraints is therefore essential in enhancing the portability of such systems.This paper describes a semi-automated procedure for collecting the co-occurrence patterns from a sample of texts in a domain, and then using these patterns as the basis for selectional constraints in analyzing further texts. We discuss some of the difficulties in automating the collection process, and describe two experiments that measure the completeness of these patterns and their effectiveness compared with manually-prepared patterns. We then describe and evaluate a procedure for selectional constraint relaxation, intended to compensate for gaps in the set of patterns. Finally, we suggest how these procedures could be combined with a system that queries a domain expert, in order to produce a more efficient discovery procedure.
Nonbinary Arithmetic AN Codes Using Odd Radix Expressions
Authors: Ryosaku Shimada, Yoshiteru Ohkura, Junichi Aoe
Venue: IEEE Transactions on Computers (1985)

Arithmetic AN codes are useful for error correction in both arithmetic operations and digital data transmission. This paper presents a theoretical approach to a new class of nonbinary arithmetic AN codes using symmetric R-ary expressions and Lee-type arithmetic distance.
An Efficient Algorithm for Identifying the Most Likely Fault Set in a Probabilistically Diagnosable System
Authors: Anton T. Dahbura
Venue: IEEE Transactions on Computers (1986)

An O(n3) algorithm is given for determining the most likely set of faulty processors in a class of systems introduced by Maheshwari and Hakimi[6], known as probabilistically diagnosable systems. The technique uses the a priori probability of failure of each unit combined with the results of tests which the processors administer to one another to perform diagnosis. The algorithm uses wel
Teaching theory of computation at the junior level
Authors: Y. S. Chua, C. N. Winton
Venue: Proceedings of the international conference on APL: APL in transition (1987)

Theory of computation courses have traditionally been taught at the advanced-undergraduate or graduate level, primarily due to the level of mathematical rigor associated with the topics involved. The topics covered include automata theory, formal languages, computability, uncomputability, and computational complexity. If the essentials of these topics are introduced earlier in the undergraduate computer science curriculum, students gain deeper insights and better comprehend the underlying computational issues associated with the material covered in subsequent computer science courses. Such a course is required of all computer science majors at the University of North Florida. Experience has demonstrated that a minimum background for the course includes Freshman-Sophomore mathematics (presently calculus) and a typical introduction to computer science. Thus the course is best positioned within the curriculum at the Junior-level. Recognizing that Junior level students are rarely mathematically sophisticated, the treatment is not as rigorous as that of a more advanced course on the theory of computation. Moreover, to reinforce the &ldquo;theory&rdquo; covered in class, an integral portion of the course is devoted to &ldquo;hands-on&rdquo; exercises using APL and software tools implemented in APL. These exercises generally require the construction of automata of various forms, with observation of their step by step operation. Further exercises illustrate the connections between various automata and areas such as hardware design and compiler construction. The paper describes the course, the unique advantages of APL in conducting the &ldquo;hands-on&rdquo; component of the course, and the exercises.
Intermedia: A case study of the differences between relational and object-oriented database systems
Authors: Karen E. Smith, Stanley B. Zdonik
Venue: ACM SIGPLAN Notices (1987)

This paper compares two approaches to meeting the data handling requirements of Intermedia, a hypermedia system developed at the Institute for Research in Information and Scholarship at Brown University. Intermedia, though written using an object-oriented programming language, relies on a traditional relational database management system for data storage and retrieval. We examine the ramifications of replacing the relational database with an object-oriented database. We begin by describing the important characteristics each database system. We then describe Intermedia and give an overview of its architecture and its data handling requirements. We explain why and how we used a relational database management system and the problems that we encountered with this system. We then present the design of an object-oriented database schema for Intermedia and compare the relational and object-oriented database management system approaches.
The complexity of the equivalence problem for commutative semigroups and symmetric vector addition systems
Authors: D T Huynh
Venue: Proceedings of the seventeenth annual ACM symposium on Theory of computing (1985)

This paper shows that the equivalence problems for commutative semigroups and symmetric vector addition systems are decidable in space cNlogN for some fixed constant c, solving an open question by Cardoza, Lipton, Mayr, and Meyer. From the exponential-space completeness of the word problems, it follows that our upper bound is nearly optimal.
A formal approach to undo operations in programming languages
Authors: George B. Leeman,  Jr.
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1986)

A framework is presented for adding a general Undo facility to programming languages. A discussion of relevant literature is provided to show that the idea of Undoing pervades several areas in computer science, and even other disciplines. A simple model of computation is introduced, and it is augmented with a minimal amount of additional structure needed for recovery and reversal. Two different interpretations of Undo are motivated with examples. Then, four primitives are defined in a language-independent manner; they are sufficient to support a wide range of Undo capability. Two of these primitives carry out state saving, and the others mirror the two versions of the Undo operation. Properties of and relationships between these primitives are explored, and there are some preliminary remarks on how one could implement a system based on this formalism. The main conclusion is that the notions of recovery and reversal of actions can become part of the programming process.
EPIC - a retargetable, highly optimizing Lisp compiler
Authors: R. R. Kessler, J. C. Peterson, H. Carr, G. P. Duggan, J. Knell
Venue: ACM SIGPLAN Notices (1986)

The Experimental Portable Standard Lisp Compiler (EPIC) is a compiler testbed for experimentation with, and development of, Lisp compilation strategies. EPIC uses an architectural description of the target machine to increase portability, and performs extensive optimizations in the form of source-to-source transformations, register allocation, and peephole optimization. It introduces machine-specific instructions early to enable machine-specific optimizations in the initial passes. EPIC produces better code than the original Portable Standard Lisp compiler, has an improved portability model, and is easier to maintain.
The cosmic cube
Authors: Charles L. Seitz
Venue: Communications of the ACM (1985)

Sixty-four small computers are connected by a network of point-to-point communication channels in the plan of a binary 6-cube. This &ldquo;Cosmic Cube&rdquo; computer is a hardware simulation of a future VLSI implementation that will consist of single-chip nodes. The machine offers high degrees of concurrency in applications and suggests that future machines with thousands of nodes are both feasible and attractive.
Tutorial: reading and reviewing the common schema for electrical design and analysis
Authors: C. H. Parks
Venue: Proceedings of the 24th ACM/IEEE Design Automation Conference (1987)

This tutorial introduces the language, tools, and methods used to develop an information model by an IEEE Task Team. The model identifies the data and data relationships necessary to define electrical products. Reviews are now required for consensus by technical experts who are also familiar with this subject matter. The model will be used to evaluate data transfer formats and establish their mappings without compromising proprietary data structures.