ppxscal/embedding_network huggingface dataset:
Shift-register sequence random number generators on the hypercube conurrent computers
Authors: T-W. Chiu
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2 (1989)

We discuss the design of a class of shift-register sequence random number generators for the MIMD parallel computers, and particularly for the hypercube concurrent computers. The simplest implementation is to have each processor generating its own sequence provided that the initial seeds are linearly independent. We generate these initial seeds by using distinct linear congruential generators and finally bit-by-bit-exclusive-or with the system time in microseconds. Our shift-register sequence random number generators are coded in C and run under the CUBIX. The statistical tests are performed on each sequence generated by every single processor as well as on the combined sequence produced by all processors. The tests include chi- square, Kolmogorov-Smirnov, auto-correlation, runlength and n-tuple distribution tests. A statistical test has been devised for testing the sequences of random numbers generated by a MIMD parallel computer. Our test results indicate that our generators do provide independent sequences of random numbers with extremely long periods.
Multi-axis NC postprocessor for machining centers
Authors: Thomas M. Olsen
Venue: ACM SIGAPL APL Quote Quad (1990)

APL2 is applied to postprocessing CL (cutter location) datafiles output from CADCAM systems APT, CATIA, and CADAM NC. For MULTAX (multi-axis; XYZ with one or two rotary axes) applications, and APL PP (postprocessor) was found more convenient and expedient than commercially-available PPs. The availability of &ldquo;source code&rdquo; plus immediate response to user need outweigh higher cost of processing with an APL interpreter. The paper briefly reviews the concept of NC postprocessing and evolution of the subject PP from an earlier version marketed by IBM Germany. Implementation notes include use of ADRS to maintain NC machine characteristics and APL2 functions, a FORTRAN interface to CL-data, and WSSIZE minimization.
A software development environment for law-governed systems
Authors: Naftaly H. Minsky, David Rozenshtein
Venue: Proceedings of the third ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments (1989)

This paper describes a software development environment based on a new approach for managing large-scale evolving systems. Under this approach, the conventional notion of a system is augmented with a new component called the law of the system, which is an explicit and strictly enforced set of rules about the operation of the system, about its evolution, and about the evolution of the law itself. The resulting combination is called a law-governed system.
Programmable user models for predictive evaluation of interface designs
Authors: R. M. Young, T. R. G. Green, T. Simon
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: Wings for the mind (1989)

A Programmable User Model (PUM) is a psychologically constrained architecture which an interface designer is invited to program to simulate a user performing a range of tasks with a proposed interface. It provides a novel way of conveying psychological considerations to the designer, by involving the designer in the process of making predictions of usability. Development of the idea leads to a complementary perspective, of the PUM as an interpreter for an &ldquo;instruction language&rdquo;. The methodology used in this research involves the use of concrete HCI scenarios to assess different approaches to cognitive modelling. The research findings include analyses of the cognitive processes involved in the use of interactive computer systems, and a number of issues to be resolved in future cognitive models.
Painting multiple views of complex objects
Authors: John Alan McDonald, Werner Stuetzle, Andreas Buja
Venue: Proceedings of the European conference on object-oriented programming on Object-oriented programming systems, languages, and applications (1990)

This paper reviews and illustrates a direct manipulation approach to visualization of complex objects called painting multiple views. We describe a programming model for direct manipulation in general and for painting in particular, based on simple constraints between entities in an the underlying scientific database and the components of displays used to examine the data. With this model, the original notion of &ldquo;brushing scatterplots&rdquo; is easily extended.
Database support for evolving design objects
Authors: A. Biliris
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

One of the most important problems of database management systems for CAD applications is support for evolving design objects. In this paper we provide an integrated solution for three very important issues: design project decomposition into subprojects, design synchronization among engineers working on different parts of a large design, and documentation of the design process. We discuss the interaction of versioning with time and we show how these two orthogonal concepts can be used in the documentation of the design process in an engineering design environment.
Scheduling in multiprogrammed parallel systems
Authors: S. Majumdar, D. L. Eager, R. B. Bunt
Venue: ACM SIGMETRICS Performance Evaluation Review (1988)

Processor scheduling on multiprocessor systems that simultaneously run concurrent applications is currently not well-understood. This paper reports a preliminary investigation of a number of fundamental issues which are important in the context of scheduling concurrent jobs on multiprogrammed parallel systems. The major motivation for this research is to gain insight into system behaviour and understand the basic principles underlying the performance of scheduling strategies in such parallel systems. Based on abstract models of systems and scheduling disciplines, several high level issues that are important in this context have been analysed.
Increase organizational effectiveness: Support self-managed IS development teams
Authors: J. T. Nosek
Venue: Proceedings of the ACM SIGCPR conference on Management of information systems personnel (1988)

This paper focuses on the choices in organizational design &mdash; specifically, on the choices in structure, reward systems, and people to support the information and decision processes employed in accomplishing organizational tasks. Forces in the changing IS development environment plus characteristics of IS personnel greatly influence organizational design requirements. The self-managed IS development team emerges as an appealing organizational design to meet these requirements. Changes which must accompany the creation of self-managed IS development teams are offered, plus some of the benefits of these teams, and some of their problems.
Message passing in parallel real time continuous systems simulations
Authors: A. M. Baum, D. J. McMillan
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1 (1988)

We have developed a mechanism for reducing the communication costs (total communication time) of a class of parallel real time simulation algorithms for execution on a hypercube parallel processing computer. The mechanism involves bundling together messages destined for transmission on the same channel. The theoretical savings range from 25% to 61% for hypercubes of dimensions two through five. Experiments demonstrate substantial agreement with the theoretical values.
On Conditions for Defining a Closed Cover to Verify Progress for Communicating Finite State Machines
Authors: A. Chung, D. P. Sidhu
Venue: IEEE Transactions on Software Engineering (1989)

The closed cover technique is a technique for verifying progress for two communicating finite state machines exchanging messages over two lossless and FIFO channels. It was first introduced by Gouda.A set of global states is called a closed cover if it satisfies some conditions given in Gouda's paper, but an intuitive description of why one of the conditions is necessary is not provided. It is found that the definition of a closed cover is too restrictive in one paper and incorrect in the other. This correspondence clarifies this and suggests improved definitions for a closed cover which are increasingly less restrictive.
A Set of Inference Rules for Quantified Formula Handling and Array Handling in Verification of Programs Over Integers
Authors: D. Sarkar, S. C. De Sarkar
Venue: IEEE Transactions on Software Engineering (1989)

Because of the undecidability problem of program verification, it becomes necessary for an automated verifier to seek human assistance for proving theorems which fall beyond its capability. In order that the user be able to interact smoothly with the machine, it is desired that the theorems be maintained and processed by the prover in a form as close as possible to the popular algebraic notation. Motivated by the need of such an automated verifier, which works in an environment congenial to human participation and at the same time uses the methodologies of resolution provers of first-order logic, some inference rules have previously been proposed by the authors for integer arithmetic, and their completeness issues have been discussed. In the present work, the authors examine how these rules can be applied to quantified formulas vis-a-vis verification of programs involving arrays. An interesting situation, referred to as bound-extension, has been found to occur frequently in proving the quantified verification conditions of the paths in a program. A novel rule, called bound-extension rule, has been devised to consolidate and depict the various issues involved in a bound-extension process. It has been proved that the rule set proposed previously by the authors is adequate for handling a more general phenomenon, called bound-modification, which covers bound-extension in all its entirety.
Modeling complex structures in object-oriented logic programming
Authors: C. Lécluse, P. Richard
Venue: Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (1989)

In this paper, we present a type model for object-oriented databases. Most object-oriented databases only provide users with flat objects whose structure is a record of other objects. In order to have a powerful expression power, an object-oriented database should not only provide objects but also complex values recursively built using the set, tuple and disjunctive constructors. Our type model presents two notions: that of classes whose instances are objects with identity and that of types whose instances are complex values. The two notions are mixed in that an object is modeled as a pair containing an identifier and a value, and a value is a complex structure which contains objects and values. We define in this context the notions of subtyping and provide a set inclusion semantics for subtyping.
Real-time robot motion planning using rasterizing computer graphics hardware
Authors: Jed Lengyel, Mark Reichert, Bruce R. Donald, Donald P. Greenberg
Venue: Proceedings of the 17th annual conference on Computer graphics and interactive techniques (1990)

We present a real-time robot motion planner that is fast and complete to a resolution. The technique is guaranteed to find a path if one exists at the resolution, and all paths returned are safe. The planner can handle any polyhedral geometry of robot and obstacles, including disjoint and highly concave unions of polyhedra.The planner uses standard graphics hardware to rasterize configuration space obstacles into a series of bitmap slices, and then uses dynamic programming to create a navigation function (a discrete vector-valued function) and to calculate paths in this rasterized space. The motion paths which the planner produces are minimal with respect to an L1 (Manhattan) distance metric that includes rotation as well as translation.Several examples are shown illustrating the competence of the planner at generating planar rotational and translational plans for complex two and three dimensional robots. Dynamic motion sequences, including complicated and non-obvious backtracking solutions, can be executed in real time.
On the number of halving planes
Authors: I. Bárány, Z. Füredi, L. Lovász
Venue: Proceedings of the fifth annual symposium on Computational geometry (1989)

Let S &sub; R3 be an n-set in general position. A plane containing three of the points is called a halving plane if it dissects S into two parts of equal cardinality. It is proved that the number of halving planes is at most &Ogr;(n2.998). As a main tool, for every set Y of n points in the plane a set N of size &Ogr;(n4) is constructed such that the points of N are distributed almost evenly in the triangles determined by Y.
Computer algebra application for determining Lie and Lie-Bäcklund symmetries of differential equations
Authors: W. I. Fushchich, V. V. Kornyak
Venue: Journal of Symbolic Computation (1989)

The application of computer algebra for determining Lie and Lie-Backlund (LB) symmetries of differential equations is considered. Algorithms for calculating the symmetries are developed and implemented on the basis of computer algebra systems REDUCE, AMP and FORMAC. The most effective and advanced program is written in FORMAC. It finds LB symmetries completely automatically. In many cases the program yields the full algebra of symmetries. If the program fails in full integration of the determining system, it reduces the remaining determining equations to the system in involution.
Implicative formulae in the proofs of computations' analogy
Authors: Andrea Asperti, Gian Luigi Ferrari, Roberto Gorrieri
Venue: Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1989)

In [As87] a correspondence between the subset of Linear Logic [Gi86] involving the conjunctive tensor product only and Place/Transition Petri Nets [Rei85] is established. In this correspondence, formulae are regarded as distributed states and provable sequents are computations in the net. Developing this idea, Mart&igrave;-Oliet and Meseguer [MaM89] have suggested that all the other computations of Linear Logic, which do not have an immediate correspondence with Petri Nets, should be regarded as &ldquo;gedanken&rdquo; or idealized processes, providing a richer language for the specification and the study of properties of distributed computations. In this paper we apply this program to the fundamental connective of linear implication. We prove that the introduction of linear implication allows us to observe the net at a lower, more decentralized level of atomicity, where the preemption of each resource needed for the firing of a transition is represented as a separate move. We give a conservative theorem relating computations at different levels of abstraction. The categorical semantics establishes a tight correspondence among Petri nets, monoidal closed categories and tensor theories, reminiscent of the well known relation among functional languages, Cartesian closed categories and intuitionistic logic [LS86]. The identification of computations in the categorical model naturally suggests the generalisation of the notion of process [DMM89] at the lower level of atomicity.
Processing queries aganist database procedures: a performance analysis
Authors: Eric N. Hanson
Venue: Proceedings of the 1988 ACM SIGMOD international conference on Management of data (1988)

A database procedure is a collection of queries stored in the database. Several methods are possible for processing queries that retrieve the value returned by a database procedure. The conventional algorithm is to execute the queries in a procedure whenever it is accessed. A second strategy requires caching the previous value returned by the database procedure. If the cached value is valid at the time of a query, the value is returned immediately. If the cached value has been invalidated by an update, the value is recomputed, stored back into the cache, and then returned. A third strategy uses a differential view maintenance algorithm to maintain an up-to-date copy of the value returned by the procedure. This paper compares the performance of these three alternatives. The results show that which algorithm is preferred depends heavily on the database environment, particularly, the frequency of updates and the size of objects retrieved by database procedures.
The experimental literature of the internet: an annotated bibliography
Authors: Jeffrey C. Mogul
Venue: ACM SIGCOMM Computer Communication Review (1989)

The DARPA Internet is the most successful experiment in heterogeneous internetworking. It connects computer systems from almost every major vendor, using a wide variety of wide-area and local-area network technology, and is in continual use by thousands of people. This annotated bibliography covers the literature of the Internet as an experiment: publications which convey the experience acquired by the experimenters.
Parallelism in bubba
Authors: H. Boral
Venue: Proceedings of the first international symposium on Databases in parallel and distributed systems (2000)

Bubba is a parallel computer system for data intensive applications under design at MCC. Bubba is intended as a replacement for mainframe systems providing scalable, continuous, high-performance-per-dollar access to large amounts of shared data for a large number of concurrent application types. To meet these ambitious goals, we adopted a data-driven, message passing army of ants approach. In this talk I provide a brief rationale for this choice. I then discuss some implications. Next I describe a number of the mechanisms used to enable and manage parallelism in Bubba. I conclude with an outline of the research methodology used.
Analysis of computation-communication issues in dynamic dataflow architectures
Authors: D.S. Ghosal, S. K. Tripathi, L. N. Bhuyan, H. Jiang
Venue: ACM SIGARCH Computer Architecture News (1989)

This paper presents analytical results of computation-communication issues in dynamic dataflow architectures. The study is based on a generalized architecture which encompasses all the features of the proposed dynamic dataflow architectures. Based on the idea of characterizing dataflow graphs by their average parallelism, a queueing network model of the architecture is developed. Since the queueing network violates properties required for product from solution, a few approximations have been used. These approximations yield a multi-chain closed queueing network in which the population of each chain is related to the average parallelism of the dataflow graph executed in the architecture. Based on the model, we are able to study the effect on the performance of the system due to factors such as scalability, coarse grain vs. fine grain parallelism, degree of decentralized scheduling of dataflow instructions, and locality.
Graphical specification of flexible user interface displays
Authors: S. E. Hudson
Venue: Proceedings of the 2nd annual ACM SIGGRAPH symposium on User interface software and technology (1989)

This paper describes the implementation concepts behind the user interface editor of the Apogee UIMS. This editor allows many aspects of a user interface to be specified graphically without a conventional textual specification. The system supports the specification of flexible user interfaces &mdash; ones that can adapt automatically to changes in the size of objects they present and that can adapt to specific user needs in a dynamic and responsive fashion. To serve as an implementation base for this editor, the Apogee UIMS supports an active data model based on one-way constraints. This model is implemented by a small object-oriented programming language embedded within the system.
Large-grain pipelining on hypercube multiprocessors
Authors: C-T. King, L. M. Ni
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2 (1989)

A new paradigm, called large-grain pipelining, for developing efficient parallel algorithms on distributed-memory multiprocessors, e.g., hypercube machines, is introduced. Large-grain pipelining attempts to maximize the degree of overlapping and minimize the effect of communication overhead in a multiprocessor system through macro-pipelining between the nodes. Algorithms developed through large-grain pipelining to perform matrix multiplication are presented. To model the pipelined computations, an analytic model is introduced, which takes into account both underlying architecture and algorithm behavior. Through the analytic model, important design parameters, such as data partition sizes, can be determined. Experiments were conducted on a 64-node NCUBE multiprocessor. The measured results match closely with the analyzed results, which establishes the analytic model as an integral part of algorithm design. Comparison with an algorithm which does not use large-grain pipelining also shows that large-grain pipelining is an efficient scheme for achieving a greater parallelism.
Writing applications for uniform operation on a mainframe or PC: a metric conversion program
Authors: Charles A. Schulz
Venue: ACM SIGAPL APL Quote Quad (1990)

The metric system of measurement is the primary standard in all countries except the USA and two others. Use of the metric system is becoming more important to the USA for trade and commerce in the world economy. A metric conversion program was developed to convert 350 measurement units between inch-pound (or USA customary) and metric systems for engineering design and documentation. The program follows the primary national metric standard with its conversion factors and special rules for arithmetic, rounding, accuracy, formatting, and terminology. It was first developed in APL on a VM CMS mainframe system, but subsequent demand warranted a PC version. The program has been presented at national metric meetings and is briefly described here. The portability of APL2 under VM CMS and PC DOS was exploited in moving the mainframe program to the PC, maintaining much of the code in identical form, thus giving advantages in testing, verification, and user experience. Differences between the environments fell mainly in the user and file interface areas, which led to a matched set of cover functions for system dependent operations. These functions and differences between the two systems are described for file operations, pop-up windows, printing, stack and host system commands. The capability and portability of APL enabled this application to become the first internally written example at this company of IBM's new user interface guidelines working on both a central mainframe and a PC.
C-logic of complex objects
Authors: W. Chen, D. S. Warren
Venue: Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (1989)

Our objective is to have a logical framework for natural representation and manipulation of complex objects. We start with an analysis of semantic modeling of complex objects, and attempt to understand what are the fundamental aspects which need to be captured. A logic, called C-logic, is then presented which provides direct support for what we believe to be basic features of complex objects, including object identity, multi-valued labels and a dynamic notion of types. C-logic has a simple first-order semantics, but it also allows natural specification of complex objects and gives us a framework for exploring efficient logic deduction over complex objects.