ppxscal/embedding_network huggingface dataset:
Transformation of concurrent object systems
Authors: E. Shibayama
Venue: ACM SIGPLAN Notices (1989)

Rapid progress of hardware technology makes it feasible to construct a network system consisting of hundreds of small computers. Today, such a system can offer more computing power than a single large computer in a cheaper way. Moreover, a network computer system is much more flexible and, even when some of the processors fall in trouble, the other processors can possibly continue their work. Widely use of network computer systems is expected in near future. In order to utilize distributed computing systems, we need distributed software. However, the progress of software technology is relatively slow. The design and development of distributed software is a difficult task at least under today's technologies. We need more sophisticated methodologies for design and development of distributed software.
The Abingdon Cross Benchmark Survey
Authors: Kendall Preston,  Jr.
Venue: Computer (1989)

The status of preliminary efforts to evaluate image processing computers is reported. The author focuses on the use of the Abingdon Cross, a benchmark test for evaluating image processing computers. The task of the benchmark is to find the medial axis of a cross in a noisy background. Results from testing 51 machines are presented.
Requirements analysis for real time automation projects
Authors: M. Hagemann
Venue: Proceedings of the 10th international conference on Software engineering (1988)

It is in general accepted that the development of software consists of a series of activities which in ideal case follows one another sequentially. This general concept is represented through several life-cycle models, among which the most renowned model was proposed by B. Boehm in his life-cycle model [l]. PROREC (System for Process oriented Requirements Capturing) has been developed on the basis of such a model and in the first phase of this development the analysis of the requirements and their formulations are investigated.
An Architecture for Addition and Subtraction of Long Word Length Numbers in the Logarithmic Number System
Authors: David M. Lewis
Venue: IEEE Transactions on Computers (1990)

An architecture is described for performing addition and subtraction of numbers in the logarithmic number system using small lookup tables. Previous implementations require approximately 4*2/sup F/ words for F bits of precision in the fraction. The author shows how to reduce the size of the lookup table to fewer than (18+F)*2/sup F/2/ words. The key to this is the use of a linear approximation of the nonlinear functions stored in the lookup tables. The functions involved are highly nonlinear in some regions, so variable size regions are used for the approximation. The replacement of the F exponential dependence on the number of words by F/2 allows roughly 50% more bits of fractional precision to be obtained for a given amount of ROM. The architecture is mathematically analyzed, yielding explicit expressions for all design parameters. The approach is illustrated with an example logarithmic addition and subtraction unit using 32-b words with 30-b exponents containing 22 fractional bits. A factor of 118 reduction in table size compared to previous techniques is achieved for this example.
BABEL: a base for an experimental library
Authors: J. Seo, H. Ait-Kaci, R. Nasr
Venue: Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval (1988)

This report discusses the implementation of a knowledge base for a library information system. It is done using a typed logic programming language&mdash;LOGIN&mdash;where type inheritance is built in. The knowledge base is structured in a hierarchical taxonomy of library object classes where each class is represented in a FRAME style knowledge structure and inherits the properties of its parents, and where infrastructural inference rules have been established through typed Horn clauses. Also in this document, some programming techniques aimed at using the power of inheritance as taxonomic inference are discussed.
A two-tier memory architecture for high-performance multiprocessor systems
Authors: T. M. Nguyen, V. P. Srini, A. M. Despain
Venue: Proceedings of the 2nd international conference on Supercomputing (1988)

Performance of high-speed multiprocessor systems is limited by the available bandwidth to memory and the need to synchronize write sharable data. This paper presents a new memory system that separates synchronization related data from others. The memory system has two tiers: synchronization memory and high bandwidth (HB) memory. The synchronization memory consists of snooping caches connected to a bus and is used to store synchronization variables such as locks and semaphores. The HB memory is used to store the bulk of the application program code and data. It contains caches and a high bandwidth interconnection network to memory, such as the crossbar, but does not have full snooping among caches. The two tier memory system has been evaluated by analyzing the memory behavior of the simulated parallel execution of Prolog programs. Initial results indicate that the two tier memory system potentially reduces memory interference and speeds up synchronization. Three different schemes have been studied for the caches on the HB memory and the results are presented. The two-tier memory system has potential applications in areas where synchronization is light to medium and local data is often accessed.
Computer art - an oxymoron? Views from the mainstream
Authors: D. Spencer, H. Rand, K. Huffman, P. Pearlstein, B. Riley, Will Stapp, Vivian Rainer
Venue: ACM SIGGRAPH 89 Panel Proceedings (1989)

Hello. My name is Dorothy Spencer, and this is a special session entitled Computer Art - An Oxymoron? Views from the Mainstream.Before I introduce the panel members I want to tell you two things briefly about the session. First I'm going to tell you what the session does not focus on, and to do that I'm going to read from the SIGGRAPH 89 Show daily that came out this morning. So, for any of you that read it and came here expecting to hear museum curators, gallery owners and artists discuss the evolution of computer art as a means for artistic expression, you can go away now; we're not going to do it.What we are going to do is talk about the fact that computer generated imagery --- although it's been around for several decades, the mainstream art world has been slow to acknowledge it as a viable medium for the creation of fine art. There have been few computer art exhibitions and even fewer reviews. Like photography, is computer art going to take three-quarters of a century before it's accepted into the mainstream?Is it partially the fault of the artist? Are artists too wrapped up in the technological processes to be concerned with the aesthetic results?Does the majority of the artists using the computer not participate in regular juried shows because they feel their work is not understood?Does the technology need to be understood before the work can be judge aesthetically?These are just a few of the questions that we hope to discuss this morning and hopefully we'll have answers for. After each panelist has made his or her presentation, we'll let the panelists respond to each other's remarks before we let you people loose with questions and answers.My first panelist is Harry Rand. He's curator of painting and sculpture at the Museum of American Art in Washington, D.C. He'll be followed by Kathy Huffman, She's the director of the Institute of Contemporary Art, Boston. Followed by Philip Pearlstein, internationally-known artist and former professor of painting at Brooklyn College; Bob Riley, curator of media art, San Francisco Museum of Modern Art; Will Stapp, curator of photography of the National Portrait Gallery; and Vivian Rainer, art critic for the New York Times. We hope you enjoy the session. Thank you.
APL object manager
Authors: B. Bykerk
Venue: ACM SIGAPL APL Quote Quad (1987)

In order to co-ordinate APL code written for the European Commission, which has several different computers (mainframes, minis and micros) and thus several different APL's, a comprehensive set of programming standards was developed. The standards outline, amongst other topics, how workspaces, APL objects and files should be structured, especially with respect to documentation. To aid the programmer to follow the standards, a development environment was produced and is now being used to develop systems written in DYALOG APL. The development environment guides the user through various programming tasks and organizes the documentation associated with each APL object. This paper discusses the concepts and facilities of the development environment with specific references to the standards.
Internet protocol implementation experiences in PC-NFS
Authors: G. Arnold
Venue: Proceedings of the ACM workshop on Frontiers in computer communications technology (1987)

A team at Sun Microsystems East Coast Division has been engaged in developing and supporting a PC implementation of Sun's Network File System (NFS&trade;) protocols. In the course of this work we were faced with the problem of implementing Internet protocol software within the PC environment. Our experiences revealed that there are some unique obstacles to be overcome in this kind of system, and indicate that further work is needed in the development of protocols to manage networks of low-end machines.
Efficient optimization of simple chase join expressions
Authors: Paolo Atzeni, Edward P. F. Chan
Venue: ACM Transactions on Database Systems (TODS) (1989)

Simple chase join expressions are relational algebra expressions, involving only projection and join operators, defined on the basis of the functional dependencies associated with the database scheme. They are meaningful in the weak instance model, because for certain classes of schemes, including independent schemes, the total projections of the representative instance can be computed by means of unions of simple chase join expressions. We show how unions of simple chase join expressions can be optimized efficiently, without constructing and chasing the corresponding tableaux. We also present efficient algorithms for testing containment and equivalence, and for optimizing individual simple chase join expressions.
Testing polynomials
Authors: Jean-Jaques Risler, Felice Ronga
Venue: Journal of Symbolic Computation (1990)

Let S @? @?^n be a finite set(@a"1 ..., @a"k) of exponents. We construct explicitly a testing set T"s @? @?^n with k elements t"1 ..., t"k (namely t"i = (2^@a^"^t^^^i,..., 2^@a^"^t^^^n)), such that if P=@?@a@?Sa"@aX^@a@?@?[X"1...,X"n] then there exists i (1 @? i @? k) such that P(t"i)
Parallel characteristics of sequence alignment algorithms
Authors: A. K. Iyengar
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

Parallel algorithms for analyzing DNA and protein sequences are becoming increasingly important as sequence data continues to grow. This paper examines the parallel characteristics of four sequence alignment algorithms. The four algorithms presented are the dynamic programming algorithm developed by Needleman, Wunsch, and Sellers (the NWS algorithm), Fickett's algorithm, a parallel algorithm using some of Fickett's ideas, and an algorithm which uses some of Wilbur and Lipman's ideas for constructing alignments which are not always optimal. The NWS algorithm contains the most parallelism but also does more work than any of the other algorithms which we studied. Fickett's algorithm contains the least parallelism. However, a parallel algorithm which requires significantly fewer instructions than the NWS algorithm is obtained by modifying Fickett's algorithm. The algorithms have been implemented for a dataflow computer in the dataflow language Id.
Response surface analysis of stochastic network performance
Authors: T. G. Bailey, K. Bauer, A. B. Marsh
Venue: Proceedings of the 21st conference on Winter simulation (1989)

This paper describes a response surface approach to the stochastic network improvement problem. The network addressed in this study is acyclic, simple, and directed; and, is characterized by single commodity flow from multiple sources to multiple sinks. The network is stochastic in that the reliability of network components is described by a binary distribution of operative or failed states, where Psi is the ith component's probability of survival. A new class of control variables is introduced to reduce the variance of the maximal flow estimators.
Inference networks for document retrieval
Authors: H. Turtle, W. B. Croft
Venue: Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval (1989)

The use of inference networks to support document retrieval is introduced. A network-based retrieval model is described and compared to conventional probabilistic and Boolean models.
An expert system for Cobol program debugging
Authors: Chuck Litecky
Venue: ACM SIGMIS Database (1989)

The purpose of this research is to assess the feasibility of applying expert systems techniques for improved error control and productivity of commercial programming. Error control in programming: error detection, error removal and error prevention is a major problem for productivity (Jones,1986). Improved error control appears to offer substantial potential for improving programmer productivity. The purpose of this paper is to analyze and describe the structure of an expert systems model for COBOL debugging. COBOL was selected as part of this research due to its importance in commercial programming. The Data Processing Management Association's Educational Foundation has sponsored the development of a pilot model suitable for testing the feasibility of this research. This is a preliminary paper which is limited to the development of the expert systems model and it's rationale. As this is an early paper, feedback and suggestions are solicited.This paper is organized into two major sections. The first part reports on utilizing previous empirical research on COBOL error frequency to build a knowledge base of errors in programming. The second part of the paper is an analysis of an expert systems model in which the COBOL error frequency and debugging strategies are implemented on an experimental basis.
Computable process
Authors: Yiannis N. Moschovakis
Venue: Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1989)

In this paper we study concurrent, asynchronous processes and functions on them which can be programmed using the (full) unfair or the fair merge operations. The main result is a normal form theorem for these (relatively) &ldquo;computable process functions&rdquo; which implies that although they can be very complex when viewed as classical set-functions, they are all &ldquo;loosely implementable&rdquo; in the sense of Park [7]. We also announce a variation and a substantial strengthening of the main &ldquo;transfer principle&rdquo; of [4] which have applications to the semantics and logic of programming languages with interactive (deterministic) or concurrent (non-deterministic) constructs.
Transportable applications environment (TAE) plus experiences in &ldquo;Object&rdquo;-ively modernizing a user interface environment
Authors: Martha R. Szczur, Philip Miller
Venue: ACM SIGPLAN Notices (1988)

This paper describes the evolution of the Transportable Applications Executive (TAE) (developed at NASA/Goddard Space Flight Center) from a traditional procedural menu and command-oriented system to an object-oriented, modeless user interface management system, known as TAE Plus. The impetus for developing this environment and early experiments which led to its current implementation are addressed. The current version of TAE Plus provides design and prototyping functions, working in tandem with a mature application management system. The main components are (1) a user interface designers' WorkBench that allows an application developer to interactively layout an application screen and define the static and/or dynamic areas of the screen; (2) an application programmer subroutine package that provides runtime services used to display and control WorkBench-designed &ldquo;interaction objects&rdquo; on the screen; and (3) an extension to the existing TAE command language that provides commands for displaying and manipulating interaction objects, thus providing a means to quickly prototype an application's user interface. During TAE Plus development, many design and implementation decisions were based on the state-of-the-art within graphics workstations, windowing systems and object-oriented programming languages, and this paper shares some of the problems and issues experienced during implementation. Some of the topics discussed include: lessons learned in using the Smalltalk&trade; language to prototype the initial WorkBench; why C++ was selected (over other languages) to build the WorkBench; and experiences in using X Window System&trade; and Stanford's InterViews object library. The paper concludes with open issues and a description of the next steps involved in implementing the &ldquo;totally modern&rdquo; TAE.
A flexible method for estimating inverse distribution functions in simulation experiments
Authors: A. Avramidis, J. R. Wilson
Venue: Proceedings of the 21st conference on Winter simulation (1989)

To generate random variates from an unknown continuous distribution via the inverse transform method, we present a flexible, computationally tractable procedure for estimating the associated inverse distribution function based on sample data. Previously proposed methods for estimating inverse distribution functions can fail in either the distribution-fitting or variate-generation stages of application. To avoid these difficulties, we have developed the procedure IDPF for estimating an Inverse Distribution with a Polynomial Filter. After a first-cut or reference distribution has been obtained by some standard technique, a front-end polynomial filter for the inverse of the reference distribution is estimated by constrained nonlinear regression so that the resulting inverse distribution has minimum "distance" from the empirical inverse distribution. The constraints on the regression ensure that the fitted inverse distribution function is nondefective and monotonically nondecreasing. A specific implementation of this procedure is based on well-known techniques for obtaining a reference fit from the Johnson translation system of distributions. We present the results of a Monte Carlo study to demonstrate the effectiveness of the method. Compared to the reference fit, procedure IDPF yields significantly better approximations not only to the empirical inverse distribution function but also to the underlying theoretical inverse distribution function.
Crystal: from functional description to efficient parallel code
Authors: M. Chen, Y. Choo, J. Li
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1 (1988)

This paper describes how Crystal&mdash;a language based on familiar mathematical notation and the lambda calculus&mdash;addresses the issues of programmability and performance for parallel machines. What is new about Crystal (or how it is different from existing functional languages) lies in its model of parallel computation and a theory of parallel-program optimization based upon the model. We illustrate the power of our approach with benchmarks of compiled parallel code from the Crystal source. The target machines are hypercube multiprocessors with distributed memory, on which it is considered difficult for functional programs and parallelizing compilers to achieve high efficiency.
On the Optimal Design of Multiple-Valued PLAs
Authors: Tsutomo Sasao
Venue: IEEE Transactions on Computers (1989)

A description is given of the design and analysis of three types of multivalued PLAs (programmable logic arrays). Type 1 PLAs realize functions directly in the form of the max of min of literal functions and constants. In Type 2 PLAs, the body of the PLA is binary and the output is encoded as a multiple-valued logic value. Type 3 PLAs are the same as type 2 PLAs except for the use of 2-bit decoders and a permutation network on the input. Using the number of columns required to realize a given function as a measure to compare PLAs, it is shown that type 3 PLAs are superior to type 2, which in turn are superior to type 1.
Generating Single-Stuck-Fault Coverage From a Collapsed-Fault Set
Authors: Mark Heap, William A. Rogers
Venue: Computer (1989)

Fault simulators do not simulate all the single stuck faults (SSFs), because as the simulated fault set grows, the increase in their runtime and memory requirements is greater than linear. Fault-set size is reduced, or collapsed, during circuit preprocessing by using the concepts of equivalence and dominance. It is shown that collapsed-fault (CF) coverage is not the same as SSF coverage and that this difference has a large effect on the defect level as the coverage approaches 100%. A very-low-overhead technique is presented that calculates true fault coverage while simulating with a CF set, thereby retaining the runtime and memory savings of simulating with CFs without sacrificing fault-coverage accuracy. This technique can be applied to any fault model exhibiting equivalence and dominance properties. The results are confirmed by benchmark results.
An Orthogonal Multiprocessor for Parallel Scientific Computations
Authors: K. Hwang, D. Kim, P.-S. Tseng
Venue: IEEE Transactions on Computers (1989)

An architecture called an orthogonal multiprocessor (OMP) is proposed. This OMP architecture has a simplified busing structure and partially shared memory and compares very favorably with fully shared-memory multiprocessors using crossbar switches, multiple buses, or multistage networks. The higher performance comes mainly from significantly increased memory bandwidth, fully exploited parallelism, reduced communication overhead, and lower hardware control complexities. Parallel algorithms being mapped include matrix arithmetic, linear system solver, FFT, array sorting, linear programming, and parallel PDE solutions. In most cases, linear speedup can be achieved on the OMP system. The OMP architecture provides linearly scalable performance and is well suited for building special-purpose scientific computers.
Databases and Cell-Selection Algorithms for VLSI Cell Libraries
Authors: Simon Y. Foo, Yoshiyasu Takefuji
Venue: Computer (1990)

The issues that must be addressed before commercial database management systems can be used to manage VLSI CAD data are defined. A survey is presented of approaches addressing four of the defined issues: design hierarchies and multilevel representations, design alternatives and version control, common interface between cell libraries and efficient cell selection based on given design constraints. A frame-based model is considered as a case study of the special-purpose design database management system approach. This framework for capturing design data is based on semantic networks. It is well suited for application-specific ICs, yet general enough for other CAD/CAM environments. Benchmark results for the selection algorithms that run on top of the frame-based database system are presented.
Data integrity and security of the corporate data base: the dilemma of end user computing
Authors: Lawrence S. Corman
Venue: ACM SIGMIS Database (1988)

This article addresses the data integrity issues and security risks created by the advent of end user computing. The author proposes possible alternatives which do not inhibit the growth of end user computing, yet provide support to the data base administrator's function. Activities such as uploading and downloading, data editing, and concurrency control are also discussed in this paper. In addition, microcomputer networking is proposed as one means by which a data base administrator may insure data integrity and security in an end user environment.