ppxscal/embedding_network huggingface dataset:
An empirical study of user satisfaction with a microcomputer-based campus-wide
Authors: Timothy J. Foley, Monica A. Newman
Venue: Proceedings of the 16th annual ACM SIGUCCS Conference on User Services (1988)

The expansion of computing resources at colleges and universities throughout the country has encouraged a decentralized approach to providing computer resources. This decentralization is most evident in the widespread proliferation of microcomputers on college campuses. Universities are currently exploring the use of networking technology to connect all the resources and maximize the tremendous investment in hardware and software. This research examined a project at Lehigh University, where networking technology was used to combine the power and storage capacity of the mainframe computer with the ease of use of the personal computer. The major objective of the project was to provide the Lehigh campus &mdash; of over 7000 faculty, staff and students &mdash; with computer networking services.
Automatic sizing of power/ground (P/G) networks in VLSI
Authors: R. Dutta, M. Marek-Sadowska
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

This paper presents a fast and efficient method for sizing power/ground networks. No restrictions on network topology or number of supplying pads are imposed. Wire widths are calculated such that the weighted area of wire segments is minimized while electromigration and voltage drops constraints are fulfilled. The algorithm proposed here runs 50% faster than the best methods reported for tree type network topologies.
Models, instances, and concurrency in software development
Authors: G. Chroust
Venue: ACM SIGSOFT Software Engineering Notes (1988)

Triggered by a recent paper [Aoyama_86] on a Concurrent Software Development paradigm, implicit concurrency in current Software Process Models is discussed.
Simulating inheritance with Ada
Authors: E. Perez
Venue: ACM SIGAda Ada Letters (1988)

Inheritance is one of the key concepts of the object-oriented paradigm. In this article, we briefly review a very commonly known model of inheritance---Smalltalk 80---and the different steps that are taken in the inheritance process. We then analyze the Ada concept of derived types in order to simulate the inheritance mechanism that has been presented. By means of short Ada examples, it is shown how the derived types can help us with each of the steps defined in the model of inheritance presented.
Fast geometric approximation techniques and geometric embedding problems
Authors: M. W. Bern, H. J. Karloff, P. Raghavan, B. Schieber
Venue: Proceedings of the fifth annual symposium on Computational geometry (1989)

Given an undirected n-vertex graph G and a set of n points in Rd, we wish to embed the vertices of G onto the points so as to minimize the total embedded edge length. Important special cases of this geometric embedding problem are those in which G is a binary tree, a cycle, or a star. We give fast approximation algorithms for embedding these graphs on the line and in the plane in several metrics. Our principal techniques are: a notion of &ldquo;approximate geometric sorting&rdquo; that can be computed in linear time, and fast approximation schemes for the minimum spanning tree problem in the plane. We expect that these approximation techniques can be applied to many geometric problems besides the embedding problem. We give the example of approximating the convex hull of a set of points in the plane.
HDB-a high level debugging
Authors: D. Y. Cheng
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

This paper presents a new high level debugging tool, HDB, for debugging large scientific programs running on a moderate number of processors. The unique feature of HDB is that checksums are used to compress arrays and groups of variables without losing meaningful information for debugging. Using checksums makes it possible to use invariance assertions to detect misbehavior of a program at a place near the source of the error. Tracing the checksums allows the tracing of a large amount of data with a small amount of output. Comparing the traced checksums of a program and the traced checksums of its reference copy can rapidly reduce the potential error sources to a small number of subroutines. These subroutines can then be directly probed for further investigation. If desired, a debugger providing break points and single stepping source code can be used in conjunction with HDB. Examples show that using the HDB method can rapidly uncover bugs hidden in both parallel and sequential programs.
From objects to actors: study of a limited symbiosis in smalltalk-80
Authors: J.-P. Briot
Venue: Proceedings of the 1988 ACM SIGPLAN workshop on Object-based concurrent programming (1988)

In this paper we describe an implementation of actors in Smalltalk-80, named Actalk. This attempt is designed as a minimal extension preserving the Smalltalk-80 language.Actors are active and autonomous objects, as opposed to standard passive Smalltalk-80 objects. An actor is built from a standard Smalltalk-80 object by associating a process with it and by serializing the messages it could receive into a queue.We will study the cohabitation and synergy between the two models of computation: transfer of active messages (message and thread of activity) between passive objects, and exchange of passive messages between active objects. We propose a sketch of methodology in order to have a safe combination between these two programming paradigms.We show how to extend the Actalk kernel into various extensions to define the basic Actor model of computation, higher level programming constructs such as the 3 types of message passing (asynchronous, synchronous, and eager) proposed in the ABCL/1 programming language, and distributed architectures. All these examples are constructed as simple extensions (by using inheritance) of our kernel model.
Arithmetic algorithms in a proof-oriented set-theoretic language
Authors: T. G. Windeknecht
Venue: Proceedings of the 17th conference on ACM Annual Computer Science Conference (1989)

Recently, a pseudocode language for set-theoretic algorithms hos been investigated for use In discrete math/structures courses [1-4]. The language is highly intuitive and contains only eight elementary statements. In the language, it is possible to (a) readily express the elementary algorithms of discrete mathematics and (b) develop correctness proofs using set theory and its underlying logic (without resort to logical-invariance proofs). In this paper, it is demonstrated that correct algorithms for the arithmetic operations over natural numbers are essentially corollaries of two easily-proved theorems about primitive recursion. In essence, for a function defined over natural numbers, a correct definition by mathematical induction immediately yields a correct algorithm for computation.
Sweeping arrangements of curves
Authors: J. Snoeyink, J. Hershberger
Venue: Proceedings of the fifth annual symposium on Computational geometry (1989)

We consider arrangements of curves that intersect pairwise in at most k points. We show that a curve can sweep any such arrangement and maintain the k-intersection property if and only if k equals 1 or 2. We apply this result to an eclectic set of problems: finding Boolean formulae for polygons with curved edges, counting triangles and digons in arrangements of pseudocircles, and finding extension curves for arrangements. We also discuss implementing the sweep.
TEAM: a support environment for testing, evaluation, and analysis
Authors: Lori A. Clarke, Debra J. Richardson, Steven J. Zeil
Venue: Proceedings of the third ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments (1989)

Current research indicates that software reliability needs to be achieved through the careful integration of a number of diverse testing and analysis techniques. To address this need, the TEAM environment has been designed to support the integration of and experimentation with an ever growing number of software testing and analysis tools. To achieve this flexibility, we exploit three design principles: component technology so that common underlying functionality is recognized; generic realizations so that these common functions can be instantiated as diversely as possible; and language independence so that tools can work on multiple languages, even allowing some tools to be applicable to different phases of the software lifecycle. The result is an environment that contains building blocks for easily constructing and experimenting with new testing and analysis techniques. Although the first prototype has just recently been implemented, we feel it demonstrates how modularity, genericity, and language independence further extensibility and integration.
Teaching simulation with MOR/DS
Authors: G. L. Curry, B. L. Deuermeyer, R. M. Feldman
Venue: Proceedings of the 21st conference on Winter simulation (1989)

The goal in many introductory simulation courses is to focus on the concepts of simulation and minimize the time spent in learning language specific techniques. The MOR/DS (Microcomputer support for perations Research and Management Science--Discrete Simulation) language has been developed with this goal in mind: to provide a microcomputer environment designed for teaching simulation. In this paper, we discuss its use as a teaching tool for simulation and as an introduction to languages that students will most likely use after leaving school.
Asynchronous design/evaluation methods for hypertext technology development
Authors: G. Perlman
Venue: Proceedings of the second annual ACM conference on Hypertext (1989)

A process model used in the design and evaluation of hypertext systems is discussed. The model includes asynchronous processes of task analysis, document analysis, literature survey and systems evaluation, interpretation of data, designing and building systems, and collecting data. For each process, experiences with NaviText&trade; SAM, a hypertext interface to a reference source, are discussed. A variety of new methods for evaluation of experimental systems are presented along with several empirical results.
Indirect naming in distributed programming languages
Authors: D. D. Jung, E. Sibert
Venue: ACM SIGPLAN Notices (1989)

Direct naming of processes in message communication is not desirable in distributed programming, because it requires a priori knowledge of sending and receiving process names. This not only complicates the construction of library or utility programs, but also is not suitable for a dynamic process creation environment. Indirect naming of processes in distributed message communication can be achieved either by introducing channels (ports) or by using process variables. This paper discusses how a new distributed programming language, COPL, achieves indirect naming effectively by using process variables without introducing shared objects, such as channels, in a distributed environment where dynamic process acitivation and selection of communicating partners are important.
A global optimization algorithm using stochastic differential equations
Authors: Filippo Aluffi-Pentini, Valerio Parisi, Francesco Zirilli
Venue: ACM Transactions on Mathematical Software (TOMS) (1988)

SIGMA is a set of FORTRAN subprograms for solving the global optimization problem, which implements a method founded on the numerical solution of a Cauchy problem for a stochastic differential equation inspired by statistical mechanics. This paper gives a detailed description of the method as implemented in SIGMA and reports the results obtained by SIGMA attacking, on two different computers, a set of 37 test problems which were proposed elsewhere by the present authors to test global optimization software. The main conclusion is that SIGMA performs very well, solving 35 of the problems, including some very hard ones. Unfortunately, the limited results available to us at present do not appear sufficient to enable a conclusive comparison with other global optimization methods.
Comments on 'Can Redundancy and Masking Improve the Performance of Synchronizers?'
Authors: A. EL-Amawy
Venue: IEEE Transactions on Computers (1989)

It is claimed in the above-mentioned work that redundancy and masking techniques are ineffective in improving synchronizer performance due to metastable behavior. This claim is based on an input model that is not always valid, particularly in reliability analysis. The commenter points out the weakness in the assumed model and provides an alternative input model which can be used to analyze redundant synchronizer reliability. Based on the proposed alternative model it is shown that, under certain conditions, redundancy and masking can indeed improve synchronizer reliability. The authors reply that their original paper was the first to examine the question and naturally adopts the simplest modeling approach based on a deterministic model. They note that the differences in conclusion derive from the modeling assumptions for metastability, and asset that these need to be examined further by researchers. Some initial comments are given.
A Simplex-Like Algorithm for the Relaxation Labeling Process
Authors: X. Zhuang, R. M. Haralick, H. Joo
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

A simplex-like algorithm is developed for the relaxation labeling process. The algorithm is simple and has a fast convergence property which is summarized as a one-more-step theorem. The algorithm is based on fully exploiting the linearity of the variational inequality and the linear convexity of the consistent-labeling search space in a manner similar to the operation of the simplex algorithm in linear programming.
R256: a research parallel processor for scientific computation
Authors: T. Fukazawa, T. Kimura, M. Tomizawa, K. Takeda, Y. Itoh
Venue: ACM SIGARCH Computer Architecture News (1989)

A scientific parallel processor called the R256 has been developed. The R256 is composed of 16x16 processing elements, and has the outstanding features of a &ldquo;distributed parallel network&rdquo; as well as on IEEE 80-bit extended floating point computation ability. The computation accuracy, required by an exhaustive number of iterations in scientific computations, is resolved by the dedicated 80-bit VLSI processor, which was developed here for the R256. The innovative distributed parallel network was designed so as to effectively resolve heavy communication problems, which are found in applications based on the Monte Carlo simulation technique. The R256 network was very economical at a hardware cost of &radic;N-folds (16 folds in this case) to that of an ideal full-crossbar switch, at the same time keeping the rates comparable to that of an ideal switch. The R256 demonstrates high performance of 2-GB/s data transfer rates and 500-MFLOPS computation rates on a semiconductor device simulation application.
Using a model railroad to teach digital process control
Authors: John W. McCormick
Venue: ACM SIGCSE Bulletin (1988)

This paper describes experiences with a course designed to introduce undergraduate students to the design and implementation of real-time systems for the monitoring and control of laboratory and industrial processes. A model railroad is suggested as an inexpensive process to control. A variety of laboratory exercises involving such a model railroad are presented.
Generalized Signed-Digit Number Systems: A Unifying Framework for Redundant Number Representations
Authors: Behrooz Parhami
Venue: IEEE Transactions on Computers (1990)

Signed-digit (SD) number representation systems have been defined for any radix r¿3 with digit values ranging over the set (- alpha , . . ., -1, 0, 1, . . ., alpha ), where alpha is an arbitrary integer in the range 1/2r> alpha >r. Such number representation systems possess sufficient redundancy to allow for the annihilation of carry or borrow chains and hence result in fast propagation-free addition and subtraction. The author refers to the above as ordinary SD number systems and defines generalized SD number systems which contain them as a special symmetric subclass. It is shown that the generalization not only provides a unified view of all redundant number systems which have proven useful in practice (including stored-carry and stored-borrowed systems), but also leads to new number systems not examined before. Examples of such new number systems are stored-carry-or-borrow systems, stored-double-carry systems, and certain redundant decimal representations.
Adventures in associative-commutative unification
Authors: Patrick Lincoln, Jim Christian
Venue: Journal of Symbolic Computation (1989)

We have discovered an efficient algorithm for matching and unification in associative-commutative (AC) equational theories. In most cases of AC unification our method obviates the need for solving diophantine equations, and thus avoids one of the bottlenecks of other associative-commutative unification techniques. The algorithm efficiently utilizes powerful constraints to eliminate much of the search involved in generating valid substitutions. Moreover, it is able to generate solutions lazily, enabling its use in an SLD-resolution-based environment like Prolog. We have found the method to run much faster and use less space than other associative-commutative unification procedures on many commonly encountered AC problems.
Hidden curve removal for free form surfaces
Authors: Gershon Elber, Elaine Cohen
Venue: Proceedings of the 17th annual conference on Computer graphics and interactive techniques (1990)

This paper describes a hidden curve algorithm specifically designed for sculptured surfaces. A technique is described to extract the visible curves for a given scene without the need to approximate the surface by polygons. This algorithm produces higher quality results than polygon based algorithms, as most of the output set has an exact representation. Surface coherence is used to speed up the process. Although designed for sculptured surfaces, this algorithm is also suitable for polygonal data.
Data communications buzzwords
Authors: P. D. Moulton
Venue: Proceedings of the ACM SIGCPR conference on Management of information systems personnel (1988)

This paper provides an introduction to some of the basic data communications buzzwords that information systems personnel and other professionals need to know to effectively deal with information systems through the 90's. Its approach is to first present how information systems are changing today into BALANCED COMPUTING systems and then to identify the primary data communication issue, compatibility, that is caused by the evolution to future Balanced Computing networks. The buzzwords users encounter throughout their careers are then presented in the context of the requirements for compatibility.
Vectorization of conjugate-gradient methods for large-scale minimization
Authors: I. M. Navon, P. K. H. Phua, M. Ramamurthy
Venue: Proceedings of the 1988 ACM/IEEE conference on Supercomputing (1988)

Vectorization techniques are applied here for the vectorization of the non-linear conjugate-gradient method for large-scale unconstrained minimization. Until now the main thrust of vectorization techniques has been directed towards vectorization of linear conjugate-gradient methods designed to solve symmetric linear systems of algebraic equations. Computational results are presented using a robust limited-memory Quasi-Newton-like conjugate-gradient algorithm due to Shanno and Phua [21], applied to large-scale unconstrained minimization problems arising in meteorological applications. The vectorization of the non-linear conjugate-gradient method results in speed-ups up to a factor of 21 compared to the performance of the scalar code, when minimizing non-linear functions of 104 - 105 variables. A sizable reduction in the CPU, time required for the minimization of large-scale non-linear functions is obtained-pointing to the advantages of vectorization for large-scale numerical unconstrained minimization problems, where local minima of non-linear functions is to be found using the non-linear conjugate-gradient method.
Describing 1-D Intensity Transitions with Gaussian Derivatives at the Resolutions Matching the Transition Widths
Authors: W. L. van Warmerdam, V. R. Algazi
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

A full description of image edges requires a complete characterization of their local intensity transitions, the spatial structure of those transitions, and a description of adjacent image regions. The authors propose, as a step toward this end, a 1-D algorithm for describing local intensity transitions by their Gaussian derivatives at a resolution where the support of the Gaussian smoothing matches their widths (blur). The algorithm estimates the transition width from the second derivative of 1-D Gaussian response zero-crossing slope and leads to a characterization of the transition with its first three derivatives at the resolution matching the width. The authors describe how this algorithm can be applied to images and give an example.
Multiprocessor Online Scheduling of Hard-Real-Time Tasks
Authors: M. L. Dertouzos, A. K. Mok
Venue: IEEE Transactions on Software Engineering (1989)

The problems of hard-real-time task scheduling in a multiprocessor environment are discussed in terms of a scheduling game representation of the problem. It is shown that optimal scheduling without a priori knowledge is impossible in the multiprocessor case even if there is no restriction on preemption owing to precedence or mutual exclusion constraints. Sufficient conditions that permit a set of tasks to be optimally scheduled at run time are derived.
Parallel branch and bound algorithms on hypercube multiprocessors
Authors: T. S. Abdelrahman, T. N. Mudge
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2 (1989)

Branch and Bound (BB) algorithms are a generalization of many search algorithms used in Artificial Intelligence and Operations Research. This paper presents our work on implementing BB algorithms on hypercube multiprocessors. The 0-1 integer linear programming (ILP) problem is taken as an example because it can be implemented to capture the essence of BB search algorithms without too many distracting problem specific details. A BB algorithm for the 0-1 ILP problem is discussed. Two parallel implementations of the algorithm on hypercube multiprocessors are presented. The two implementations demonstrate some of the tradeoffs involved in implementing these algorithms on multiprocessors with no shared memory, such as hypercubes. Experimental results from the NCUBE/six show the performance of the two implementations of the algorithm. Future research work is discussed.
Practical parallel processing with transputers
Authors: A. J.G. Hey
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1 (1988)

This paper explores methods for extracting parallelism from a wide variety of numerical applications. Load-balancing considerations and communication overheads for implementing scientific and engineering problems on networks of transputers are then discussed. Some case studies are presented in detail. The paper demonstrates that reconfigurable transputer arrays provide a flexible, powerful and easily programmable approach to parallel processing.