ppxscal/embedding_network huggingface dataset:
Receiver-initiated busy-tone multiple access in packet radio networks
Authors: C. Wu, V. Li
Venue: Proceedings of the ACM workshop on Frontiers in computer communications technology (1987)

The ALOHA and Carrier Sense Multiple Access (CSMA) protocols have been proposed for packet radio networks (PRN). However, CSMA/CD which gives superior performance and has been successful applied in local area networks cannot be readily applied in PRN since the locally generated signals will overwhelm a remote transmission, rendering it impossible to tell whether a collision has occurred or not. In addition, CSMA and CSMA/CD suffer from the &ldquo;hidden node&rdquo; problem in a multihop PRN. In this paper, we develop the Receiver-Initiated Busy-Tone Multiple Access Protocol to resolve these difficulties. Both fully connected and multihop networks are studied. The busy tone serves as an acknowledgement and prevents conflicting transmissions from other nodes, including &ldquo;hidden nodes&rdquo;.
Real time Ada compilers for the 68020
Authors: L. Asplund, M. Carlsson, S. Wengelin, G. Bray
Venue: ACM SIGAda Ada Letters (1989)

Three cross compilers hosted on a VAX/VMS for the Motorola 68020 processor have been evaluated. The target machine, a VME system with a MVME133 processor card and a MVME340 digital IO-card, has been set up in an environment with a function generator and an oscilloscope in order to measure the real time response. The compilers supply the run time kernel. It is possible to use Ada for real time applications, with the use of optimization of accept statements task switch times can come down to the order of 15 - 20 us.
Givens elimination on systolic arrays
Authors: B. Louka
Venue: Proceedings of the 2nd international conference on Supercomputing (1988)

In this paper, we study the QR factorization of a square matrix of order n, through Givens rotations. The task allocation method developed among others by QUINTON, SAKHO and TCHUENTE, is used to parallelize the QR factorization scheme introduced by SAMEH and KUCK. This yields a solution which runs in optimal time T* = 3n-1, on an hexagonally connected array of size 5n2/18 + 0(n), composed of programmable cells. This improves the best previously known solution introduced by COSNARD and ROBERT, and which runs in optimal time on an array of size 3n2/8 + 0(n).
Extensible query processing in starburst
Authors: L. M. Haas, J. C. Freytag, G. M. Lohman, H. Pirahesh
Venue: ACM SIGMOD Record (1989)

Today's DBMSs are unable to support the increasing demands of the various applications that would like to use a DBMS. Each kind of application poses new requirements for the DBMS. The Starburst project at IBM's Almaden Research Center aims to extend relational DBMS technology to bridge this gap between applications and the DBMS. While providing a full function relational system to enable sharing across applications, Starburst will also allow (sophisticated) programmers to add many kinds of extensions to the base system's capabilities, including language extensions (e.g., new datatypes and operations), data management extensions (e.g., new access and storage methods) and internal processing extensions (e.g., new join methods and new query transformations). To support these features, the database query language processor must be very powerful and highly extensible. Starburst's language processor features a powerful query language, rule-based optimization and query rewrite, and an execution system based on an extended relational algebra. In this paper, we describe the design of Starburst's query language processor and discuss the ways in which the language processor can be extended to achieve Starburst's goals.
Expert Systems and Optimization
Authors: Andrew Kusiak, Sunderesh S. Heragu
Venue: IEEE Transactions on Software Engineering (1989)

A problem-solving approach involving the integration of expert systems and optimization techniques is presented. A class of expert systems called tandem expert systems is introduced. Three variants of the tandem expert system, the data-reducing, model-based, and model-modifying expert systems, are explained with examples. It is emphasized that optimization techniques can be used more frequently in future expert systems.
AWEsim: asymptotic waveform evaluation for timing analysis
Authors: L. T. Pillage, X. Huang, R. A. Rohrer
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

Most timing analyzers rely upon a linear approximate interconnect model, typically an RC tree, to estimate efficiently the propagation delays for digital MOS integrated circuits. RC tree methods are adequate to analyze a large class of MOS circuits, but are not sufficient in general for high speed, dynamic and precharge MOS circuits. In addition bipolar logic and board level digital systems can have interconnect models which may not be compatible with RC tree topologies. In this paper we describe AWEsim, a variable refinement waveform estimator for generalized linear RLC approximate interconnect models.
A survey of commercial parallel processors
Authors: Edward Gehringer, Janne Abullarade, Michael H. Gulyn
Venue: ACM SIGARCH Computer Architecture News (1988)

This paper compares eight commercial parallel processors along several dimensions. The processors include four shared-bus multiprocessors (the Encore Multimax, the Sequent Balance system, the Alliant FX series, and the ELXSI System 6400) and four network multiprocessors (the BBN Butterfly, the NCUBE, the Intel iPSC/2, and the FPS T Series). The paper contrasts the computers from the standpoint of interconnection structures, memory configurations, and interprocessor communication. Also, the shared-bus multiprocessors are compared in terms of cache-coherence strategies, and the network multiprocessors are compared in terms of node structure. Where possible, price and performance information has been included. The reader is cautioned that this survey is based largely on information submitted by manufacturers; the authors have not performed any independent evaluation.
John Reid Reports
Authors: John Reid
Venue: ACM SIGPLAN Fortran Forum (1989)

For the moment, the Committee is in deadlock. All formal proposals require that at least half the Committee members (21) vote 'yes' and that there are at least twice as many 'yes' votes as 'no' votes. We need a proposal (or rather set of proposals) that will not be unacceptable to a third of the members because it removes too much of the present language or unacceptable to a third because it does not simplify the language enough.The Chairman has charged members to prepare proposals for the next meeting that aim for acceptability to two-thirds of the members. I will be preparing one such proposal jointly with Brian Smith of Argonne.
Three steps of better documentation
Authors: Barbara Cunningham, Mary Beth Commisso
Venue: Proceedings of the 16th annual ACM SIGUCCS Conference on User Services (1988)

Our Computing Lab documents written during the late 1970s and early 1980s targeted the new mainframe computing user. At that time there was a limited offering of user reference materials and those that were available served primarily as reference guides for the experienced programmer. We tried to supplement these technical materials with some home grown, simple instructions and explanations. However, in retrospect, we realize these documents tended to have lengthy explanations and no two looked quite the same. In other words, there was not a standard format or user interface. With the arrival of personal computers and the accompanying personal computing software packages, the new user began to see some tutorials and simplified instructions on how to work with computers. But as you know the evolution of personal computing software documentation lagged far behind the technical development of the programs themselves. Tutorials, on disk or in binders, and new-users guides were generally not included as a part of the package, although a number were available for separate purchase. Do you remember the word processing manual which came with an updated supplement listing manual changes and then a second smaller supplement listing corrections to the first supplement. These manuals lacked the simplicity and readability necessary to step the inexperienced user through a new computing experience. Bookstores like B. Dalton and McGraw-Hill began stocking computing books on every conceivable topic. These how-to-books gave the new user an opportunity to tap an ever increasing variety of printed materials. As user requirements changed, we decided what it was time to re-examine what we were producing and to determine what documentation, if any, was needed in our computing labs. This re-examination determined which documents which were no longer relevant to users and the areas in which there was a need for new documentation.
Modular rational sparse multivariate polynomial interpolation
Authors: E. Kaltofen, Y. N. Lakshman, J.-M. Wiley
Venue: Proceedings of the international symposium on Symbolic and algebraic computation (1990)

The problem of interpolating multivariate polynomials whose coefficient domain is the rational numbers is considered. The effect of intermediate number growth on a speeded Ben-Or and Tiwari algorithm is studied. Then the newly developed modular algorithm is presented. The computing times for the speeded Ben-Or and Tiwari and the modular algorithm are compared, and it is shown that the modular algorithm is markedly superior.
MGDPs and DSDPS-Two Stages of an Early Operating System
Authors: William,  J. Jones
Venue: IEEE Annals of the History of Computing (1989)

The purpose of these recollections is to describe an operating system(called MGDPS, then DSDPS) that made possible the efficient and timely processing of missile test data by the General Electric Company for the Atlas Missile program in the late 1950s.
The Raid Distributed Database System
Authors: Bharat Bhargava, John Riedl
Venue: IEEE Transactions on Software Engineering (1989)

Raid, a robust and adaptable distributed database system for transaction processing, is described. Raid is a message-passing system, with server processes on each site. The servers manage concurrent processing, consistent replicated copies during site failures and atomic distributed commitment. A high-level, layered communications package provides a clean, location-independent interface between servers. The latest design of the communications package delivers messages via shared memory in a high-performance configuration in which several servers are linked into a single process. Raid provides the infrastructure to experimentally investigate various methods for supporting reliable distributed transaction processing. Measurements on transaction processing time and server CPU time are presented. Data and conclusions of experiments in three categories are also presented: communications software, consistent replicated copy control during site failures, and concurrent distributed checkpointing. A software tool for the evaluation of transaction processing algorithms in an operating system kernel is proposed.
Interprocedural slicing using dependence graphs
Authors: Susan Horwitz, Thomas Reps, David Binkley
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1990)

The notion of a program slice, originally introduced by Mark Weiser, is useful in program debugging, automatic parallelization, and program integration. A slice of a program is taken with respect to a program point p and a variable x; the slice consists of all statements of the program that might affect the value of x at point p. This paper concerns the problem of interprocedural slicing&mdash;generating a slice of an entire program, where the slice crosses the boundaries of procedure calls. To solve this problem, we introduce a new kind of graph to represent programs, called a system dependence graph, which extends previous dependence representations to incorporate collections of procedures (with procedure calls) rather than just monolithic programs. Our main result is an algorithm for interprocedural slicing that uses the new representation. (It should be noted that our work concerns a somewhat restricted kind of slice: rather than permitting a program to b e sliced with respect to program point p and an arbitrary variable, a slice must be taken with respect to a variable that is defined or used at p.) The chief difficulty in interprocedural slicing is correctly accounting for the calling context of a called procedure. To handle this problem, system dependence graphs include some data dependence edges that represent transitive dependences due to the effects of procedure calls, in addition to the conventional direct-dependence edges. These edges are constructed with the aid of an auxiliary structure that represents calling and parameter-linkage relationships. This structure takes the form of an attribute grammar. The step of computing the required transitive-dependence edges is reduced to the construction of the subordinate characteristic graphs for the grammar's nonterminals.
The IC system for protocol development
Authors: D. M. Cohen, T. M. Guinther
Venue: Proceedings of the ACM workshop on Frontiers in computer communications technology (1987)

The realization of a new protocol is a long and complicated procedure whose inherent technical difficulty is exacerbated by the scarcity of useful tools. This paper discusses the initial use of a system that is being developed by Bell Communication Research to help in the specification, analysis, and implementation of communications protocols. This paper describes the application of this system to the specification and implementation of an industry standard protocol.
Nondeterministic polynomial-time computations and models of arithmetic
Authors: Attila Máté
Venue: Journal of the ACM (JACM) (1990)

A semantic, or model theoretic, approach is proposed to study the problems P =? NP and NP =? co-NP. This approach seems to avoid the difficulties that recursion-theoretic approaches appear to face in view of the result of Baker et al. on relativizations of the P =? NP question; moreover, semantical methods are often simpler and more powerful than syntactical ones. The connection between the existence of certain partial extensions of nonstandard models of arithmetic and the question NP =? co-NP is discussed. Several problems are stated about nonstandard models, and a possible link between the Davis-Matijasevi@@@@-Putnam-Robinson theorem on Diophantine sets and the NP =? co-NP question is mentioned.
Formal Program Construction by Transformations-Computer-Aided, Intuition-Guided Programming
Authors: Friedrich Ludwig Bauer, Bernhard Möller Helmut Partsch, Peter Pepper
Venue: IEEE Transactions on Software Engineering (1989)

Formal program construction by transformations is a method of software development in which a program is derived from a formal problem specification by manageable, controlled transformation steps which guarantee that the final product meets the initial specification. This methodology has been investigated in the Munich project CIP (computer-aided intuition-guided programming). The research includes the design of a wide-spectrum language specifically tailored to the needs of transformational programming, the construction of a transformation system to support the methodology, and the study of transformation rules and other methodological issues. Particular emphasis has been laid on developing a sound theoretical basis for the overall approach.
Evaluation of a vector hypercube for seismic modelling
Authors: R. Renaut, J. Petersen
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2 (1989)

Seismic modelling to produce realistic seismic traces is a computationally intensive problem. A 2D synthetic wave propagation code using explicit finite differences with absorbing boundary conditions has been implemented on an Intel Hypercube with 32 processors. The algorithm is highly parallel with good load balancing between processors and speed up proportional to the number of processors being used. A vectorised version of the code has been used to evaluate the performance of the Intel IPSC-VX 5d vector hypercube. Mflop rates up to 71 are achieved.
Post implementation evaluation of computer-based information systems: current practices
Authors: Kuldeep Kumar
Venue: Communications of the ACM (1990)

Contrary to the widely-held view that post implementation evaluations are performed to assess and improve the information system and the system development practices, this study suggests that in practice, the primary reason for such evaluations seems to be project closure and not project improvement.
A computational algorithm for LU decomposition of a sequence of matrices that differ only in one or more elements
Authors: M. S. Zahir
Venue: ACM SIGNUM Newsletter (1989)

A computational algorithm for an efficient LU decomposition of a sequence of matrices that differ in one or more elements is presented and some possible areas of engineering and business applications are outlined. CPU time, as measured in an implementation of the algorithm using FORTRAN code, is shown to agree very well with the estimated operations count.
Dialing a name: alphabetic entry through a telephone keypad
Authors: Lisa Fast, Roy Ballantine
Venue: ACM SIGCHI Bulletin (1988)

Problem:---The standard home telephone has an extremely limited user interface device (few keys, no 'Q' or 'Z' etc.)--- People are reluctant to read manuals, remember codes or use prompt cards--- Given these, is it possible to provide sopisticated character-based features such as personal directories on basic residential sets, and with the right interface, would people be able to use them without documentation support?
Failure Transparency in Remote Procedure Calls
Authors: K. Ravindran, S. T. Chanson
Venue: IEEE Transactions on Computers (1989)

A model of remote procedure call (RPC) which reflects certain generic properties of the application layer that can be exploited by the RPC layer during failure recovery is presented. A technique of adopting orphans caused by failures, which is based on the model, is described. The technique minimizes the rollback which may be required in orphan-killing techniques. Algorithmic details of the adoption technique are described, and a quantitative analysis is presented. The model is implemented as a prototype on a local area network. The simplicity and generality of the failure recovery renders the RPC model useful in distributed systems, particularly those that are large and heterogeneous and hence have complex failure modes.
Reducing the effects of infeasible paths in branch testing
Authors: D. Yates, N. Malevris
Venue: Proceedings of the ACM SIGSOFT '89 third symposium on Software testing, analysis, and verification (1989)

Branch testing, which is one of the most widely used methods for program testing, see White [1] for example, involves executing a selected set of program paths in an attempt to exercise all program branches. Criteria for selecting such paths have, to date, received scant attention in the literature and it is the issue of developing a suitable path selection strategy to which this paper is addressed. Specifically, a selection strategy, which aims at reducing the number of infeasible paths generated during the branch testing exercise is proposed. The strategy is founded on an assertion concerning the likely feasibility of program paths. Statistical evidence in support of the assertion is provided, a method implementing the strategy is described, and the results obtained from applying the method to a set of program units are reported and analysed.
An empirical study of the reliability of UNIX utilities
Authors: Barton P. Miller, Louis Fredriksen, Bryan So
Venue: Communications of the ACM (1990)

The following section describes the tools we built to test the utilities. These tools include the fuzz (random character) generator, ptyjig (to test interactive utilities), and scripts to automate the testing process. Next, we will describe the tests we performed, giving the types of input we presented to the utilities. Results from the tests will follow along with an analysis of the results, including identification and classification of the program bugs that caused the crashes. The final section presents concluding remarks, including suggestions for avoiding the types of problems detected by our study and some commentary on the bugs we found. We include an Appendix with the user manual pages for fuzz and ptyjig.
A student system development diagrammer
Authors: Iraj Hirmanpour
Venue: ACM SIGCSE Bulletin (1988)

New approaches to system development depend heavily on graphical methods for representation of system requirements and the depiction of final design configuration. Among various diagramming methods, Data Flow Diagrams, Entity-Relationship diagrams and Structure Charts have received the most attention. An automated diagramming tool is created and is made available to students. This tool requires minimum hardware and does not require the use of licensed software to operate. It therefore can be made accessible to many students at different schools.
A geometric characterization of parametric cubic curves
Authors: Maureen C. Stone, Tony D. DeRose
Venue: ACM Transactions on Graphics (TOG) (1989)

In this paper, we analyze planar parametric cubic curves to determine conditions for loops, cusps, or inflection points. By expressing the curve to be analyzed as a linear combination of control points, it can be transformed such that three of the control points are mapped to specific locations on the plane. We call this image curve the canonical curve. Affine maps do not affect inflection points, cusps, or loops, so the analysis can be applied to the canonical curve instead of the original one. Since the first three points are fixed, the canonical curve is completely characterized by the position of its fourth point. The analysis therefore reduces to observing which region of the canonical plane the fourth point occupies. We demonstrate that for all parametric cubes expressed in this form, the boundaries of these regions are tonics and straight lines. Special cases include B&eacute;zier curves, B-splines, and Beta-splines. Such a characterization forms the basis for an easy and efficient solution to this problem.
Goal-directed semantic tutor
Authors: Hikyoo Koh, Daniel Ming-Jen Wu
Venue: Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1988)

An efficient Pascal semantic tutoring system is being built that aims at detecting and correcting semantic errors in Pascal programs after programs have been successfully compiled. In order to determine that an input program is correct (more precisely, the program seems to be correct), we attempt to compare the program against certain properties deemed necessary for a correct program. Basic approaches taken include: A problem description which an input program is intended to solve is converted to several properties called, goals, all of which a correct input program must satisfy. From each goal, plans are established which become the conditioin parts of production rules. The action parts of production rules contain certain effects that reflect consequences of goals so far satisfied by the input test program. The input test program is converted to an equivalent LISP expression that preserves the program semantic with such auxiliary words as BEGIN, END, DO, TO, ELSE, THEN eliminated. The resulting expression is more suitable for comparison against aforementioned plans.Pattern symbols and pattern variables are used to facilitate more flexible and powerful pattern matching. In addition, association lists are used to keep track of variables that are actually used in the input test program.