ppxscal/embedding_network huggingface dataset:
Benchmarking the connection machine 2
Authors: R. K. Sato, P. N. Swarztrauber
Venue: Proceedings of the 1988 ACM/IEEE conference on Supercomputing (1988)

The Connection Machine 2 (CM-2) made by Thinking Machines Corporation is a massively parallel, single instruction multiple data machine with potential for computational rates in the range of several billions of floating point operations per second. A two-dimensional shallow water equations model was run on a CM-2 to obtain an estimate of its performance on atmospheric and ocean sciences problems. C* and *LISP versions were developed and the performance of these codes on the CM-2 is compared with the performance of a FORTRAN version run on a Cray X-MP/48.
An efficient reliable broadcast protocol
Authors: M. Frans Kaashoek, A. S. Tanenbaum, S. F. Hummel
Venue: ACM SIGOPS Operating Systems Review (1989)

Many distributed and parallel applications can make good use of broadcast communication. In this paper we present a (software) protocol that simulates reliable broadcast, even on an unreliable network. Using this protocol, application programs need not worry about lost messages. Recovery of communication failures is handled automatically and transparently by the protocol. In normal operation, our protocol is more efficient than previously published reliable broadcast protocols. An initial implementation of the protocol on 10 MC68020 CPUs connected by a 10 Mbit/sec Ethernet performs a reliable broadcast in 1.5 msec.
A concurrent on-board vision system for a mobile robot
Authors: J. P. Jones
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2 (1989)

Robot vision algorithms have been implemented on an 8-node NCUBE-AT hypercube system onboard a mobile robot (HERMIES) developed at Oak Ridge National Laboratory. Images are digitized using a framegrabber mounted in a VME rack. Image processing and analysis are performed on the hypercube system. The vision system is integrated with robot navigation and control software, enabling the robot to find the front of a mockup control panel, move up to the panel, and read an analog meter. Among the concurrent algorithms used for image analysis are a new component labeling algorithm and a Hough transform algorithm with load balancing.
Interfaces for strongly-typed object-oriented programming
Authors: P. S. Canning, W. R. Cook, W. L. Hill, W. G. Olthoff
Venue: ACM SIGPLAN Notices (1989)

This paper develops a system of explicit interfaces for object-oriented programming. The system provides the benefits of module interfaces found in languages like Ada and Modula-2 while preserving the expressiveness that gives untyped object-oriented languages like Smalltalk their flexibility. Interfaces are interpreted as polymorphic types to make the system sufficiently powerful. We use interfaces to analyze the properties of inheritance, and identify three distinct kinds of inheritance in object-oriented programming, corresponding to objects, classes, and interfaces, respectively. Object interfaces clarify the distinction between interface containment and inheritance and give insight into limitations caused by equating the notions of type and class in many typed object-oriented programming languages. Interfaces also have practical consequences for design, specification, and maintenance of object-oriented systems.
Hyperbook: an experiment with PCTE
Authors: M. Kempe
Venue: ACM SIGSOFT Software Engineering Notes (1989)

PCTE (A Basis for a Portable Common Tool Environment) is a Public Tool Interface (PTI) intended to provide a basis on which to construct an Integrated Project Support Environment (IPSE). Thus, PTIs are primarily concerned with IPSE needs. This paper shows that applications other than IPSEs also benefit from PTIs, by examining the design, on PCTE, of a management subsystem for structured documents It goes on to describe a prototype of such a subsystem, a hypermedia kernel named Hyperbook. Finally. in the light of this case study, we discuss the feasibility and adequacy of using PCTE for such non-IPSE applications.
Multistep Gradual Rounding
Authors: C. Lee
Venue: IEEE Transactions on Computers (1989)

A value V is to be rounded to an arbitrary precision resulting in the value V". Conventional rounding technique uses one step to accomplish this. Multistep rounding uses several steps to round the value V to successively shorter precisions with the final rounding step producing the desired value V". This alternate rounding method is one way to implement with the minimum of hardware, the denormalization process that the IEEE Floating-Point Standard 754 requires when underflow occurs. There are certain cases for which multistep rounding produces a different result than single-step rounding. To prevent such a step error, the author introduces a rounding procedure called gradual rounding that is very similar to conventional rounding with the addition of two tag bits associated with each floating-point register.
Timing Analysis Using Functional Analysis
Authors: D. Brand, V. S. Iyengar
Venue: IEEE Transactions on Computers (1988)

The usual block-oriented timing analysis for logic circuits does not take into account functional relations between signals. If functional relations are taken into consideration, it could be found that a long path is never activated. This results in more accurate delays. A comparison is made of three arrival time functions, A, B, and R. A is the arrival time as given by exhaustive simulation; B is the arrival time as calculated by a usual block-oriented algorithm; and R is the arrival time, that does functional analysis. It is shown that B contained in R contained in A. The first relation means that R is never more conservative than B and whenever the containment is proper, R is an improvement over B. The second relation means that R is correct in the sense that it will never assert a signal to be valid when it is not valid according to the ideal A. Experimental results showing how often R is an improvement over B are presented.
Classification of recursive formulas in deductive databases
Authors: Cheong Youn, Lawrence J. Henschen, Jiawei Han
Venue: Proceedings of the 1988 ACM SIGMOD international conference on Management of data (1988)

In this paper, we present results on the classification of linear recursive formulas in deductive databases and apply those results to the compilation and optimization of recursive queries. We also introduce compiled formulas and query evaluation plans for a representative query for each of these classes. To explain general recursive formulas, we use a graph model that shows the connectivity between variables. The connecticity between variables is the most critical part in processing recursive formulas. We demonstrate that based on such a graph model all the linear recursive formulas can be classified into several classes and each class shares some common characteristics in compilation and query processing. The compiled formulas and the corresponding query evaluation plans can be derived based on the study of the compilation of each class.
Multiple crossbar network integrated supercomputing framework
Authors: R. Hoebelheinrich, R. Thomsen
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

At Los Alamos National Laboratory, site of one of the world's most powerful scientific supercomputing facilities, a prototype network for an environment that links supercomputers and workstations is being developed. Driven by a need to provide graphics data at movie rates across a network from a supercomputer to a scientific workstation, the network is called the Multiple Crossbar Network (MCN). It is intended to be a coarsely-grained, loosely-coupled, general-purpose multicomputer framework that will vastly increase the speed at which supercomputers communicate with each other in large networks. The components of the network are described, as well as work done in collaboration with vendors who are interested in providing commercial products.
Using Gröbner bases to determine algebra membership, split surjective algebra homomorphisms determine birational equivalence
Authors: David Shannon, Moss Sweedler
Venue: Journal of Symbolic Computation (1988)

k is a field, X"1,..., X"n are indeterminates over k and f"1,...,f"m@?k[X"1,...,X"n]. This note presents a simple algorithm, based on Grobner bases, to test if a given polynomial g of k[X"1,...,X"n] lies in k[f"1,...,f"m]. If so, the algorithm produces a polynomial P of m variables where g=P(f"1,...,f"m). Say @w: B->k[X"1,...,X"n] is a homomorphism where @w(b"i)=f"i, for algebra generators {b"i}@?B. If @w is onto, our algorithm gives a homomorphism @l:k[X"1,...,X"n]->B, where the composite @w@l is the identity map. In particular, the algorithm computes the inverse of algebra automorphisms of the polynomial ring. A variation of our test if k[f"1,...,f"m]=k[X"1,...,X"n], tells if k(f"1,...,f"m)=k(X"1,...,X"n). Existing computer algebra systems, such as IBM's SCRATCHPAD II, have Grobner basis packages which allow the user to specify a term ordering sufficient to carry out the algorithm.
Rollback sometimes works...if filtered
Authors: B. Lubachevsky, A. Shwartz, A. Weiss
Venue: Proceedings of the 21st conference on Winter simulation (1989)

We introduce a new parallel discrete event simulation algorithm called filtered rollback. It is a combination of the Time Warp and bounded lag simulation algorithms introduced previously. The "filter" postpones event processing in some subsystems in favor of safer simulation. The filter may be tuned by the simulationist; at one extreme the algorithm is conservative, i.e., free from rollback, and at the other extreme the algorithm is purely optimistic, i.e., relying exclusively on rollback. We prove that rollback cascading, wherein a "chain reaction" of secondary and higher generation rollbacks appear in the simulation, can be bounded by an appropriate tuning. The tuning achieves a trade-off between the two extremes which yields an efficient and scalable algorithm. Our method of proof uses a representation of the rollback cascading as a tree and models such a tree as a Galton-Watson branching process on which an additional structure is defined, a random walk with a barrier.
Proof Procedure and Answer Extraction in Petri Net Model of Logic Programs
Authors: George Peterka, Tadao Murata
Venue: IEEE Transactions on Software Engineering (1989)

A proof procedure and answer extraction in a high-level Petri net model of logic programs is discussed. The logic programs are restricted to the Horn clause subset of first-order predicate logic and finite problems. The logic program is modeled by a high-level Petri net and the execution of the logic program or the answer extraction process in predicate calculus corresponds to a firing sequence which fires the goal transition in the net. For the class of the programs described above, the goal transition is potentially firable if an only if there exists a nonnegative T-invariant which includes the goal transition in its support. This is the main result proved. Three examples are given to illustrate in detail the above results.
The impact of planning languages on the development of corporate models
Authors: Gerald J. Tillman, Hugh J. Watson
Venue: ACM SIGMIS Database (1988)

Since their introduction in the late 1960's, planning languages have continued to evolve and to have a growing impact on corporate modeling. In order to better understand how planning languages affect the predevelopment, development, and implementation and use phases of corporate modeling, eight corporate models developed using a planning language and two developed using a general-purpose language were investigated. The findings suggest that planning languages impact corporate modeling in important ways.
Curvature continuity and offsets for piecewise conics
Authors: G. Farin
Venue: ACM Transactions on Graphics (TOG) (1989)

In this paper the construction of curvature continuous, planar curves (open or closed) that consist of conic segments, represented in the rational B&eacute;zier form, is discussed, and an iterative procedure to compute their offset curves is outlined.
An Insight into the Entropy and Redundancy of the English Dictionary
Authors: E. J. Yannakoudakis, G. Angelidakis
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1988)

The inherent statistical characteristics, including the economy, entropy, and redundancy, of a very large set containing 93681 words from the Shorter Oxford English Dictionary is investigated. Analytical n-gram statistics are also presented for applications in natural language understanding, text processing, test compression, error detection and correction, and speech synthesis and recognition. Experimental results show how the distribution of n-grams in the dictionary varies from the ideal as n increases from 2 to 5, that is, from bigrams to pentagrams; it is shown that the corresponding redundancy increases from 0.1067 to 0.3409. The results are of interest because, (1) the dictionary provides a finite list for deterministic analyses, (2) each entry (word) appears once, compared to free-running text where words are repeated, and (3) all entries, even rarely occurring ones, have equal weight.
Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental
Authors: K. L. Clarkson, P. W. Shor
Venue: Proceedings of the fourth annual symposium on Computational geometry (1988)

We give a simple algorithmic technique for building geometric structures. The technique is randomized and incremental. As an application, we give an algorithm of this kind for computing the intersection of a set of halfspaces in three dimensions. (This intersection problem is linear-time equivalent to the computation of the convex hull of a point set.) The algorithm requires &Ogr;(n log n) expected time, where the expectation is over the random behavior of the algorithm. A similar algorithm can be used to determine the intersection of a set of unit balls in E3, the problem of spherical intersection. This problem arises in the computation of the diameter of a point set in E3. For a set S of n points, the diameter of S is the greatest distance between two points in S. We give a randomized reduction from the problem of determining the diameter to the problem of computing spherical intersections, resulting in a Las Vegas algorithm for the diameter requiring &Ogr;(n log n) expected time. The best algorithms previously known for this problem have worst-case time bounds no better than &Ogr;(n &radic;n log n) [Agg].
Reading Chess
Authors: H. S. Baird, K. Thompson
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

By applying semantic analysis to images of extended passages of text, several volumes of a chess encyclopedia have been read with high accuracy. Although carefully proofread, the books were poorly printed and posed a severe challenge to conventional page-layout analysis and character-recognition methods. An experimental page-reader system performed strictly top-down layout analysis for identification of columns, lines, words, and characters. This proceeded rapidly and reliably thanks to a recently developed skew-estimation technique. Resegmentation of broken, touching, and dirty characters was handled in an efficient and integrated manner by a heuristic search operating on isolated words. By analyzing the syntax of game descriptions and applying the rules of chess, the error rate was reduced by a factor of 30 from what was achievable through shape analysis alone. Several computer vision systems integration issues suggested by this experience are discussed.
A Fast Algorithm for Testing Isomorphism of Permutation Networks
Authors: M. A. Sridhar
Venue: IEEE Transactions on Computers (1989)

The problem of deciding whether two given permutation sequences are conjugate is addressed. The author exhibits an algorithm that solves this problem in time O(N log N), where N is the sum of the sizes of the two sequences. The algorithm can be applied to the problem of deciding whether two permutation networks are equivalent. The time bound for the algorithm is a significant improvement over the O(N/sup 2/) bound of the algorithm due to Y.A. Oruc and M.Y. Oruc (1985). The author's method applies techniques used by the Hopcroft-Tarjan algorithm for deciding planar graph isomorphism.
Warp: an integrated solution of high-speed parallel computing
Authors: S. Borkar, R. Cohn, G. Cox, S. Gleason, T. Gross
Venue: Proceedings of the 1988 ACM/IEEE conference on Supercomputing (1988)

iWarp is a system architecture for high speed signal, image and scientific computing. The heart of an iWarp system is the iWarp component: a single chip processor that requires only the addition of memory chips to form a complete system building block, called the iWarp cell. Each iWarp component contains both a powerful computation engine (20 MFLOPS) and a high throughput (320 MBytes/sec), low latency (100-150 ns) communication engine for interfacing with other iWarp cells. Because of its strong computation and communication capabilities, the iWarp component is a versatile building block for various high performance parallel systems. These systems range from special purpose systolic arrays to general purpose distributed memory computers. They are able to support both fine-grain parallel and coarse-grain distributed computation models simultaneously in the same system. An iWarp system can include a large number of cells; the initial iWarp demonstration system consists of an 8x8 torus of iWarp cells, delivering more than 1.2 GFLOPS. It can be expanded to include up to 1,024 cells. This paper describes the iWarp architecture and how it supports various communication models and system configurations.
An in-the-lens spectrometer for high performance E-beam testing
Authors: S. C. J. Garth, J. N. Sackett, D. F. Spicer
Venue: Microelectronic Engineering (1988)

In-the-lens spectrometers using the properties of an adiabatically decreasing magnetic field have demonstrated superior performance over a number of other detectors, particularly in terms of rejection of errors due to local field effects. Traditionally, however, this has involved placing the sample in a strong magnetic field which can have deleterious effects, particularly on imaging resolution. We present a design of spectrometer which uses adiabatic electron straightening to minimize local field errors but in which the sample is maintained in a region of low magnetic field strength. The design offers all the previous advantages but with imaging capabilities approaching those attainable with a conventional SEM at short working distance.
Enumerating outer narrowing derivationsfor constructor-based term rewriting systems
Authors: Jia-Huai You
Venue: Journal of Symbolic Computation (1989)

Narrowing has been used as a mechanism for reasoning about equations and evaluatingequational logic programs, where enumeration of all narrowing derivations is often necessary in order to generate complete sets of solutions. In this paper, a special type of narrowing derivations, called outer narrowing derivations, is examined for the class of constructor-based term rewriting systems. It is shown that every narrowing derivation in this class is subsumed by an outer narrowing derivation. This result is applied to a matching problem in equational theories, i.e., whether an arbitrary term is E-matchable to a term composed of constructors and disjoint variables. It is shown that outer narrowing derivations generate complete and minimal sets of E-matchers. An E-matching procedure is presented which enumerates all and only outer narrowing derivations for the E-matching problem considered in this paper.
A modular structure for a highly detailed model of semiconductor manufacturing
Authors: S. J. Hood, E. B. Amamoto, A. T. Vandenberge
Venue: Proceedings of the 21st conference on Winter simulation (1989)

A model of semiconductor manufacturing lines, using the discrete event simulation language, SIMAN, is described. A detailed, flexible, and generic model of this large, complex system was constructed by using a highly modular structure. A user interacts with the model through an interface which requires no programming and no recompiling even if major changes to the process sequence, number of resources (tools and operators), queue control, or number of job types are made.
A paradigm for programming style research
Authors: P. W. Oman, C. R. Cook
Venue: ACM SIGPLAN Notices (1988)

Programming style guidelines and automated coding style analyzers have been developed without a solid experimental or theoretical basis. In this paper we make a distinction between typographic style characteristics and underlying structural style content and show that this distinction aids in assessing the influence of style factors. This distinction permits straightforward identification of specific style factors and a better understanding of their effect on program comprehension. The results of our studies have a direct impact on automated coding style assessment programs, programming standards, program maintainability, and code formatting tools.
Formal model of correctness without serializabilty
Authors: H. K. Korth, G. Speegle
Venue: ACM SIGMOD Record (1988)

In the classical approach to transaction processing, a concurrent execution is considered to be correct if it is equivalent to a non-concurrent schedule. This notion of correctness is called serializability. Serializability has proven to be a highly useful concept for transaction systems for data-processing style applications. Recent interest in applying database concepts to applications in computer-aided design, office information systems, etc. has resulted in transactions of relatively long duration. For such transactions, there are serious consequences to requiring serializability as the notion of correctness. Specifically, such systems either impose long-duration waits or require the abortion of long transactions. In this paper, we define a transaction model that allows for several alternative notions of correctness without the requirement of serializability. After introducing the model, we investigate classes of schedules for transactions. We show that these classes are richer than analogous classes under the classical model. Finally, we show the potential practicality of our model by describing protocols that permit a transaction manager to allow correct non-serializable executions
A Communicating Finite Automata Approach to Modeling Distributed Computation and its Application to Distributed Decision-Making
Authors: Thomas L. Casavant, Jon G. Kuhl
Venue: IEEE Transactions on Computers (1990)

A modeling technique for distributed computation based on a combination of directed graphs and finite automata is described. The paradigm of distributed decision-making (DDM) is used to illustrate the technique for its two primary purposes: providing a standard specification mechanism for different algorithms for solving the same problem and providing a common mechanism for objective quantitative evaluation and comparison of alternative DDM algorithms. This is accomplished through the definition of the terms performance and efficiency as they relate to the domain of DDM. The two terms, which have precise meanings with respect to the analysis of sequential algorithms, currently lack a common interpretation in the environment of DDM. In particular, they need to be expressed in terms of the information movement necessary to share state information. The method has been used extensively to conduct analyses of several distribution scheduling algorithms. This paper focuses on the model specification properties.