ppxscal/embedding_network huggingface dataset:
A message-based fault diagnosis procedure
Authors: J R Agre
Venue: ACM SIGCOMM Computer Communication Review (1986)

A new diagnostic message protocol that provides fault diagnosis capabilities for the communications in a distributed system environment is described. The protocol is designed to operate in conjunction with a standard end-to-end communication protocol and uses special messages to determine the system fault state. A diagnosis message is represented using a test dependency model that is derived from the system topology. These messages are used by an adaptive strategy designed to achieve specific objectives such as reduced testing cost. Using the test dependency model, a general purpose algorithm is developed for generating these strategies based on an information theory criterion. Specific properties of the protocol are discussed, and several examples of strategies for a distributed system topology are provided.
A fast, low-space algorithm for multiplying dense multivariate polynomials
Authors: Vangalur S. Alagar, David K. Probst
Venue: ACM Transactions on Mathematical Software (TOMS) (1987)

This paper presents an improved adaptive hybrid algorithm for multiplying dense multivariate polynomials that is both time and space efficient. The hybrid algorithm makes use of two families of univariate algorithms, one Karatsuba based and the other DFT based, which are applied recursively to solve the multivariate problem. The hybrid algorithm is adaptive in that particular univariate algorithms are selected at run time to minimize the time complexity; an order-of-magnitude speedup with respect to classical multiplication is achieved over the entire practical range except for very small problems. Empirical investigation shows that most of the theoretical superiority is maintained in actual implementation. The largest contribution to the space requirements of the total algorithm is determined by the univariate algorithm used for the outermost variable; except for quite small problems, selecting univariate algorithms to minimize run time almost always leads to situations where the space requirements of the total algorithm are extremely close to the space required merely to store the result.
Decidability and expressiveness aspects of logic queries
Authors: O. Shmueli
Venue: Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (1987)

This paper addresses some basic problems regarding logic programming based queries over relational databases. We re-examine the query classes H and YE+ defined by Chandra and Harel [2] We define H+ and YE++ which differ from H and YE+ in that the use of equality (=) and inequality (&ne;) is prohibited. We show that H+ is more expressive than YE++ and that any H+ program can be transformed into an equivalent H+ program containing a single recursive predicate without using the equality or inequality operators. As a corollary we obtain a fixpoint formula characterization of H+ queries. We consider the problems of determining containment, equivalence, and satisfiability of logic based queries. The containment and equivalence problems addressed here extend the work of Aho, Sagiv and Ullman on relational queries [1] and Papadimitrious on Prolog [10]. As corollaries we show that determining safety and literal redundancy are both undecidable problems.
Specification and verification of concurrent programs by A&forall;automata
Authors: Z. Manna, A. Pnueli
Venue: Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1987)

&forall;-automata are non-deterministic finite-state automata over infinite sequences. They differ from conventional automata in that a sequence is accepted if all runs of the automaton over the sequence are accepting. These automata are suggested as a formalism for the specification and verification of temporal properties of concurrent programs. It is shown that they are as expressive as extended-temporal-logic (ETL), and in some cases provide a more compact representation of properties than temporal logic. A structured diagram notation is suggested for the graphical representation of these automata. A single sound and complete proof rule is presented for proving that all computations of a program have the property specified by a &forall;-automaton.
Proposal for adding discriminants for Ada task types
Authors: Donald R. Clarson
Venue: ACM SIGAda Ada Letters (1987)

This paper proposes an addition to the Ada Programming Language which will allow a set of values to be passed as discriminant values when a task object is created. This feature will be useful to avoid an additional task entry call following task activation for some applications. Syntax and semantic rules are presented together with several contexts where the feature may be used.
Software bases and software archives: alternatives to support software reuse
Authors: R. T. Mittermeir, W. Rossak
Venue: Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow (1987)

The paper addresses the topic of software reuse by highlighting its various aspects. In particular, arguments are raised that the notion of &ldquo;software reuse&rdquo; cannot be limited to source code only. On this basis, two approaches for reusing software are presented. Software archives are structures supporting reuse of &ldquo;conventionally produced&rdquo; software at different levels of abstraction and for different stages of development. Software Bases, on the other hand, support the idea of programming in refinable application dependent patterns of a given problem domain. They support software reuse on a fine grain level in strict analogy to the way data is made available to a corporate audience by data base management systems.
The use of Monte Carlo methods in natural resource management models
Authors: Mark A Tumeo, Gerald T Orlob
Venue: ACM SIGSIM Simulation Digest (1986)

The Monte Carlo method provides a means of introducing natural variability in data, uncertainty of parameter estimation, chance occurrences and model reliability, into the process of simulation modeling for resource management. The technique is described and demonstrated for a hypothetical application of a Gaussian Plume Dispersion Model to a case of atmospheric pollution. It is concluded that the utility of the Monte Carlo approach lies mainly in providing decision makers with information on the likelihood of extreme occurrences and the inherent reliability of simulation modeling.
Structured tools and conditional logic: an empirical investigation
Authors: Iris Vessey, Ron Weber
Venue: Communications of the ACM (1986)

Prior research has identified two psychological processes that appear to be used by programmers when they perform design and coding tasks: (a) taxonomizing&mdash;identifying the conditions that evoke particular actions; and (b) sequencing&mdash;converting the taxa into a linear sequence of program code. Three structured tools&mdash;structured English, decision tables, and decision trees&mdash;were investigated in a laboratory experiment to determine how they facilitated these two processes. When taxonomizing had to be undertaken, structured English outperformed decision tables, and decision trees outperformed structured English. When sequencing had to be undertaken, decision trees and structured English outperformed decision tables, but decision trees and structured English evoked the same level of performance.
Tasking troubles and tips
Authors: L. Rising
Venue: ACM SIGPLAN Notices (1988)

All the problems associated with concurrency in any language are troublesome when using Ada: deadlock, critical access, race conditions, starvation, abnormal termination and timing errors. Programmers in Ada, however, must face additional concerns presented by the Ada tasking model. The following summarizes some difficulties encountered in an industrial project and others described in the literature.
Implications of automated restructuring of COBOL
Authors: J C Miller, B M Strauss,  III
Venue: ACM SIGPLAN Notices (1987)

This paper examines whether mechanical transformations of unstructured program code to a structured equivalent can provide any improvement in understandability. We specifically examine, although are not limited to, a COBOL environment. The paper reviews the basic postulates of structured programming as applied to COBOL, and discusses the transformations caused by an automated restructuring tool.Jerry Sitner has asked the basic question of whether mechanical code transformations (performed by either an automated tool or a human following a set of rigorous rules) can improve the readability of COBOL programs. Assuming equivalence (which is not the case), he asks which of the two expressions is more understandable?IF A = B GO TO C. "Unstructured"IF A = B PERFORM C. "Structured"In COBOL, a GO TO is a non-returning transfer of control and a PERFORM is a returning one. Each computer language has at least one and usually both of these constructs. BASIC has GOTO and GOSUB, PL/I (and PASCAL) has the procedure/function and the GOTO, FORTRAN has the DO and GOTO, etc. The question raises two basic issues, 1) is the structured expression equivalent to the unstructured in meaning and 2) how can understandability of program code be improved. To answer these, we need to examine what structured programming is and why it is better, then address the questions of mechanical transformations of code and of names within programs and systems.
Systems semantics: principles, applications, and implementation
Authors: Ray Boute
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1988)

Systems semantics extends the denotational semantics of programming languages to a semantics for the description of arbitrary systems, including objects that are not computations in any sense. By defining different meaning functions, the same formal description may be used to denote different system properties, such as structure, behavior, component cost, and performance aspects (e.g., timing). The definition of these semantic functions also provides guidance in language design, in particular for the match between language constructs and the system concepts to be expressed. Aiming at compositionality ensures useful properties for formal manipulation. In this fashion, the meaning functions can be made sufficiently simple to serve not only as a direct implementation on a machine but also as rules for reasoning about systems in a transformational manner. As the applications show, however, compositionality can be ensured only through careful consideration of the characteristics of the flow of information inside the system. Two classes of application are discussed: Unidirectional systems, in particular digital systems without feedback (combinational) and with feedback (sequential), and a certain class of analog systems. Nonunidirectional systems, in particular two-port analog networks. The emphasis will be on the functional style of description and on formal reasoning (theorem proving, derivation of properties). Implementation and rapid prototyping strategies in various system description environments are also briefly discussed. These would permit the concepts of system semantics to be explored without the need for a complete implementation.
The hierarchical representation of objects: the Delaunay tree
Authors: J D Boissonnat, M Teillaud
Venue: Proceedings of the second annual symposium on Computational geometry (1986)

We present, in this paper, a new hierarchical data structure called the Delaunay tree. It is defined from the Delaunay triangulation and, roughly speaking, represents a triangulation as a hierarchy of balls. The Delaunay tree provides efficient solutions to several problems such as building the Delaunay triangulation of a finite set of n points in any dimension, locating a point in the triangulation, defining neighborhood relationships in the triangulation and computing intersections. The algorithms are extremely simple and are analyzed from a theoretical and practical points of view.
Data parallel algorithms
Authors: W. Daniel Hillis, Guy L. Steele,  Jr.
Venue: Communications of the ACM (1986)

Parallel computers with tens of thousands of processors are typically programmed in a data parallel style, as opposed to the control parallel style used in multiprocessing. The success of data parallel algorithms&mdash;even on problems that at first glance seem inherently serial&mdash;suggests that this style of programming has much wider applicability than was previously thought.
Automated lip-synch and speech synthesis for character animation
Authors: J. P. Lewis, F. I. Parke
Venue: ACM SIGCHI Bulletin (1986)

An automated method of synchronizing facial animation to recorded speech is described. In this method, a common speech synthesis method (linear prediction) is adapted to provide simple and accurate phoneme recognition. The recognized phonemes are then associated with mouth positions to provide keyframes for computer animation of speech using a parametric model of the human face. The linear prediction software, once implemented, can also be used for speech resynthesis. The synthesis retains intelligibility and natural speech rhythm while achieving a &ldquo;synthetic realism&rdquo; consistent with computer animation. Speech synthesis also enables certain useful manipulations for the purpose of computer character animation.
A Smalltalk system for algebraic manipulation
Authors: S. Kamal Abdali, Guy W. Cherry, Neil Soiffer
Venue: ACM SIGPLAN Notices (1986)

This paper describes the design of an algebra system Views implemented in Smalltalk. Views contains facilities for dynamic creation and manipulation of computational domains, for viewing these domains as various categories such as groups, rings, or fields, and for expressing algorithms generically at the level of categories. The design of Views has resulted in the addition of some new abstractions to Smalltalk that are quite useful in their own right. Parameterized classes provide a means for run-time creation of new classes that exhibit generally very similar behavior, differing only in minor ways that can be described by different instantiations of certain parameters. Categories allow the abstraction of the common behavior of classes that derives from the class objects and operations satisfying certain laws independently of the implementation of those objects and operations. Views allow the run-time association of classes with categories (and of categories with other categories), facilitating the use of code written for categories with quite different interpretations of operations. Together, categories and views provide an additional mechanism for code sharing that is richer than both single and multiple inheritance. The paper gives algebraic as well as non-algebraic examples of the above-mentioned features.
A parallel PLA minimization program
Authors: R. Galivanche, S. M. Reddy
Venue: Proceedings of the 24th ACM/IEEE Design Automation Conference (1987)

In this paper we report on an implementation of a parallel algorithm to minimize PLA realizations of logic functions. The algorithm is derived from a widely available PLA minimization program called ESPRESSO-MV. The parallel algorithm was implemented on a shared memory multicomputer system. In the course of development of the parallel algorithm, some changes were made to ESPRESSO-MV which resulted in lower computing time. Experimental results using 105 PLAs are included.
Recollections on the processing of biomedical signals
Authors: J. R. Cox,  Jr.
Venue: Proceedings of ACM conference on History of medical informatics (1987)

The processing of biomedical signals took many steps forward in the two decades that followed the introduction of digital computers to the field in the late 50s. Along with my colleagues at the Central Institute for the Deaf and at the Biomedical Computer Laboratory, I was privileged to participate in this exciting early period of biomedical computing. Some of my experiences with projects, both successful and unsuccessful, in evoked response audiometry, neurophysiology, fetal electrocardiography, radiation treatment planning, electrocardiographic rhythm analysis and ambulatory monitoring of electrocardiographic rhythms are described. These recollections give less attention to scientific results than they do to selected anecdotes and observations.
Fuzzy system models on an IBM PC
Authors: Alan M. Thorndike
Venue: ACM SIGSMALL/PC Notes (1988)

Explanations of fuzzy sets usually start out with some example like the statement "John is tall". The statement conveys some information to us, but there is an element of uncertainty and no measurement of John's height is provided. It implies some set of heights greater than perhaps 5 feet 11 inches that would normally be considered tall, but there is not even any clear dividing line between "tall", "medium", and "short". Much human knowledge and thinking is like that. Fuzzy sets and systems are a rather ponderous attempt to provide a well-defined mathematical and logical procedure for dealing with such information. In general they appeal to people interested in such areas as artificial intelligence and linguistics.
Seeing the forest for the trees: hierarchical displays of hypertext structures
Authors: Steven Feiner
Venue: Proceedings of the ACM SIGOIS and IEEECS TC-OA 1988 conference on Office information systems (1988)

Most recent hypertext systems support hierarchy only as a restricted subset of directed graph structure. Consequently they do not provide many of the capabilities for graphical information hiding and structure manipulation that a tree makes possible. This paper describes display techniques developed for IGD, a hypertext system that supports the creation of large graphical documents whose arbitrary directed graph structure is embedded in a strict hierarchy. IGD offers the full generality of arbitrary keyworded links, while simultaneously allowing hierarchies to be easily manipulated and displayed with much of their structural detail selectively abstracted.
Rewrite method for theorem proving in first order theory with equality
Authors: Jieh Hsiang
Venue: Journal of Symbolic Computation (1987)

In this paper we extend the term rewriting approach to first order theorem proving, as described in Hsiang & Dershowitz 1983), to the theory of first order predicate calculus with equality. Consequently, we have showed that the term rewriting method can indeed be made to be as powerful as paramodulation and resolution combined.
Traversal recursion: a practical approach to supporting recursive applications
Authors: Arnon Rosenthal, Sandra Heiler, Umeshwar Dayal, Frank Manola
Venue: Proceedings of the 1986 ACM SIGMOD international conference on Management of data (1986)

Many capabilities that are needed for recursive applications in engineering and project management are not well supported by the usual formulations of recursion. We identify a class of recursions called &ldquo;traversal recursions&rdquo; (which model traversals of a directed graph) that have two important properties they can supply the necessary capabilities and efficient processing algorithms have been defined for them. First we present a taxonomy of traversal recursions based on properties of the recursion on graph structure and on unusual types of metadata. This taxonomy is exploited to identify solvable recursions and to select an execution algorithm. We show how graph traversal can sometimes outperform the more general iteration algorithm. Finally we show how a conventional query optimizer architecture can be extended to handle recursive queries and views.
Providing learning alternatives
Authors: Jerry Martin
Venue: Proceedings of the 15th annual ACM SIGUCCS conference on User Services (1987)

What is the best method for providing training to our users? Is it workshops, hands-on, tutorials, handouts, or perhaps Computer Based Training? These are some of the questions we must ask ourselves every time we need to develop training material for a new program, service, or announcement. In many cases, the audience addressed is so varied, it is very difficult to target a document or training to a specific segment of our users. We have those who have never used a computer before, to those who have used computers extensively; and all want only the relevant information to meet their needs. Matters are now even more difficult, because individuals may have microcomputer experience, mainframe, experience, or both. In addition, a user with experience on one type of computer, but not the other, who needs to transfer information, will probably not know important information. Another phenomenon that occurs frequently, is that the person who comes to ask the questions, is not the one who generated the data or program. Instead, they have been given the task of making it work without any background knowledge. In actual fact, it seems there is no one &ldquo;best&rdquo; way of training. We need to pool all of our knowledge of training, computers, life experiences, problem solving techniques, and anything else that might be helpful to provide us with alternatives.
Augmentation of object-oriented programming by concepts of abstract data type theory: the ModPascal experience
Authors: Walter G. Olthoff
Venue: ACM SIGPLAN Notices (1986)

Object-oriented programming and abstract data type (ADT) theory have emerged from the same origin of computer science: the inability to deal efficiently with 'programming in the large' during the early seventies. Each of the approaches has led to significant practical and theoretical results resp. Nevertheless it is still unsatisfactory that up to now the mutual influence seems to be limited to more or less syntactical issues (e.g. the provision of packages, clusters, forms). In this paper we report on the object-oriented language ModPascal that was developed as part of the Integrated Software Development and Verification (ISDV) Project. We show how the essence of concepts of ADT theory as algebraic specifications, enrichments, parameterized specifications or signature morphisms as well as their semantics can be consistently integrated in an imperative object-oriented language. Furthermore, as the experience of using ModPascal as target language of the ISDV System has shown, we claim that without similar support of theoretical concepts techniques like formal specification of programs or algebraic verification loose their power and even applicability.
Incremental linear interpolation
Authors: Dan Field
Venue: ACM Transactions on Graphics (TOG) (1985)

Two incremental linear interpolation algorithms are derived and analyzed for speed and accuracy. The first is a version of a &ldquo;simple&rdquo; digital differential analyzer (DDA) employing fixed-point arithmetic, whereas the second is a new algorithm that uses only integral arithmetic and is a generalization of Bresenham's line-drawing algorithm. The new algorithm is shown to achieve perfect accuracy and, depending on the underlying processor, may be faster than the fixed-point algorithm.
Computer and Database Location in Distributed Computer Systems
Authors: Bezalel Gavish, Hasan Pirkul
Venue: IEEE Transactions on Computers (1986)

Design of distributed computer systems is a complex task requiring solutions for several difficult problems. Location of computing resources and databases in a wide-area network is one of these problems which has not yet been solved satisfactorily. Solution of this problem involves determining number and size of computer facilities and their locations, configuring databases and allocating these databases among computer facilities. An integer programming formulation of the problem is presented. Heuristic and optimal solution procedures are developed and computational experience with these procedures is reported. Implications of the model for designing distributed systems are discussed.