ppxscal/embedding_network huggingface dataset:
A Data-Driven VLSI Array for Arbitrary Algorithms
Authors: Israel Koren, Bilha Mendelsom, Irit Peled, Gabriel M. Silberman
Venue: Computer (1988)

The design of specialized processing array architectures, capable of executing any given arbitrary algorithm, is proposed. An approach is adopted in which the algorithm is first represented in the form of a dataflow graph and then mapped onto the specialized processor array. The processors in this array execute the operations included in the corresponding nodes (or subsets of nodes) of the dataflow graph, while regular interconnections of these elements serve as edges of the graph. To speed up the execution, the proposed array allows the generation of computation fronts and their cancellation at a later time, depending on the arriving data operands; thus it is called a data-driven array. The structure of the basic cell and its programming are examined. Some design details are presented for two selected blocks, the instruction memory and the flag array. A scheme for mapping a dataflow graph (program) onto a hexagonally connected array is described and analyzed. Two distinct performance measures-mapping efficiency and array utilization-and some performance results are discussed.
Optimized communication in an extended remote procedure call model
Authors: Marc F. Pucci, J. L. Alberi
Venue: ACM SIGARCH Computer Architecture News (1988)

Increased latency associated with remote operations is a serious problem facing any distributed system. This problem is compounded if the distributed system must work over several forms of interconnect since designing an efficient solution for one may make accommodating another awkward or impractical. On the other hand, a common interprocessor communications protocol may not exploit the advantages of new technology. This paper describes an interprocessor communications model that provides a uniform interface to high level system functions, while encouraging optimizations based on unique characteristics of a particular interconnect. It has been successfully applied to local, backplane and traditional network style interconnects.
Knuth-Bendix procedure and Buchberger algorithm: a synthesis
Authors: F. Winkler
Venue: Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation (1989)

The Knuth-Bendix procedure for the completion of a rewrite rule system and the Buchberger algorithm for computing a Gr&ouml;bner basis of a polynomial ideal are very similar in two respects: they both start with an arbitrary specification of an algebraic structure (axioms for an equational theory and a basis for a polynomial ideal, respectively) which is transformed to a very special specification of this algebraic structure (a complete rewrite rule system and a Gr&ouml;bner basis of the polynomial ideal, respectively). This special specification allows to decide many problems concerning the given algebraic structure. Moreover, both algorithms achieve their goals by employing the same basic concepts: formation of critical pairs and completion. Although the two methods are obviously related, the exact nature of this relation remains to be clarified. Based on previous work we show how the Knuth-Bendix procedure and the Buchberger algorithm can be seen as special cases of a more general completion procedure.
Inferring Surface Trace and Differential Structure from 3-D Images
Authors: P. T. Sander, S. W. Zucker
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

Early image understanding seeks to derive analytic representations from image intensities. The authors present steps towards this goal by considering the inference of surfaces from three-dimensional images. Only smooth surfaces are considered and the focus is on the coupled problems of inferring the trace points (the points through which the surface passes) and estimating the associated differential structure given by the principal curvature and direction fields over the estimated smooth surfaces. Computation of these fields is based on determining an atlas of local charts or parameterizations at estimated surface points. Algorithm robustness and the stability of results are essential for analyzing real images; to this end, the authors present a functional minimization algorithm utilizing overlapping local charts to refine surface points and curvature estimates, and develop an implementation as an iterative constraint satisfaction procedure based on local surface smoothness properties. Examples of the recovery of local structure are presented for synthetic images degraded by noise and for clinical magnetic resonance images.
Transformation of data flow analysis models to object oriented design
Authors: Bruno Alabiso
Venue: ACM SIGPLAN Notices (1988)

This paper describes a strategy to transform Data Flow Analysis into Object Oriented Design. This transformation is performed by extracting information from the Data Flow Model, by enriching with Design decision and by finally producing an Object Oriented Design Model. Semiformal transformation rules are described. Also a special notation is introduced to describe the Object Oriented Design Model. The Model used to represent Data Flow Analysis is the one originally proposed by Yourdon, complemented with Ward-Mellor's Real Time extensions (the &ldquo;Essential Model&rdquo;).
XY-WINS: an integraded environment for developing graphical user interfaces
Authors: Alessandro Giacalone
Venue: Proceedings of the 1st annual ACM SIGGRAPH symposium on User Interface Software (1988)

XY-WINS is an integrated environment that supports design, prototyping, implementation, and debugging of graphical user interfaces. XY-WINS tools allow user interface designers to work at an abstract level, thus enabling non-experts in computer graphics to quickly prototype graphical interfaces. However, the tools also allow great flexibility in defining graphical features. XY-WINS supports the development of user interfaces consisting of two main modules: a Graphical Abstract Machine (GRAM), and a High-level Interaction Component (HIC). The GRAM encapsulates the lower levels of input and output, and provides the HIC with an abstract view of the user based on abstract representations of pictures and on input tokens incoming through input channels. The HIC implements the dialogue between this abstraction of the user and the back-end of the system. The environment provides tools for generating a GRAM from abstract specifications of the graphical constructs and the input tokens that are to be used in a user interface. These specifications can be edited interactively and graphically. The HIC can be specified as a system of independent communicating processes/objects by using a high-level concurrent language, which also includes control structures designed to support the definition of complex user/system interactions. Finally, an interactive debugging system allows one to execute the user interface, while simultaneously visualizing end-user screen, state of the GRAM, and state of the HIC.
Multidatabase update issues
Authors: Yuri Breitbart, Avi Silberschatz
Venue: Proceedings of the 1988 ACM SIGMOD international conference on Management of data (1988)

A formal model of data updates in a multidatabase environment is developed, and a theory of concurrency control in such an environment is presented. We formulate a correctness condition for the concurrency control mechanism and propose a protocol that allows concurrent execution of a set of global transactions in presence of local ones. This protocol ensures the consistency of the multidatabase and deadlock freedom. We use the developed theory to prove the protocol's correctness and discuss complexity issues of implementing the proposed protocol.
A Formal Evaluation of Data Flow Path Selection Criteria
Authors: L. A. Clarke, A. Podgurski, D. J. Richardson, S. J. Zeil
Venue: IEEE Transactions on Software Engineering (1989)

The authors report on the results of their evaluation of path-selection criteria based on data-flow relationships. They show how these criteria relate to each other, thereby demonstrating some of their strengths and weaknesses. A subsumption hierarchy showing their relationship is presented. It is shown that one of the major weaknesses of all the criteria is that they are based solely on syntactic information and do not consider semantic issues such as infeasible paths. The authors discuss the infeasible-path problem as well as other issues that must be considered in order to evaluate these criteria more meaningfully and to formulate a more effective path-selection criterion.
Some problems in computational representation theory
Authors: Gerhard O. Michler
Venue: Journal of Symbolic Computation (1990)

Modern computers and computer algebra systems yield powerful tools for mathematicalresearch. In this article, some applications of computer algebra packages and scientific software in the theory of modular representations of finite groups are described. Ten mathematical problems are mentioned, the solutions of which require new algorithms and most likely extensions of the present mathematical software. It is hoped that the corresponding computer experiments stimulate further mathematical research. Furthermore, they will show the importance of the development of computer algebra for theoretical mathematics.
An evaluation of directory schemes for cache coherence
Authors: A. Agarwal, R. Simoni, J. Hennessy, M. Horowitz
Venue: Proceedings of the 15th Annual International Symposium on Computer architecture (1988)

The problem of cache coherence in shared-memory multiprocessors has been addressed using two basic approaches: directory schemes and snoopy cache schemes. Directory schemes have been given less attention in the past several years, while snoopy cache methods have become extremely popular. Directory schemes for cache coherence are potentially attractive in large multiprocessor systems that are beyond the scaling limits of the snoopy cache schemes. Slight modifications to directory schemes can make them competitive in performance with snoopy cache schemes for small multiprocessors. Trace driven simulation, using data collected from several real multiprocessor applications, is used to compare the performance of standard directory schemes, modifications to these schemes, and snoopy cache protocols.
Effect of skew on join performance in parallel architectures
Authors: M. Seetha Lakshmi, P. S. Yu
Venue: Proceedings of the first international symposium on Databases in parallel and distributed systems (2000)

Skew in the distribution of values taken by an attribute is identified as a major factor that can affect the performance of parallel architectures for relational joins. The effect of skew on the performance of two parallel architectures is evaluated using analytic models. In one architecture, called database machine (DBMC), data as well as processing power are distributed; while in the other architecture, called Single Processor Parallel Input/output (SPPI), data is distributed but the processing power is concentrated in one processor. The two architectures are compared in terms of the ratio of MIPS used by DBMC and SPPI to deliver the same throughput and response time. In addition, the horizontal growth potential of DBMC is evaluated in terms of maximum speedup achievable by DBMC relative to SPPI response time. The MIPS ratio as well as speedup are found to be very sensitive to the amount of skew. These suggest, careful thought should be given in parallelizing database applications and in the design of algorithms and query optimizer for parallel architectures.
Scheme86: a system for interpreting scheme
Authors: Andrew Berlin, Henry Wu
Venue: Proceedings of the 1988 ACM conference on LISP and functional programming (1988)

Scheme86 is a computer system designed to interpret programs written in the Scheme dialect of Lisp. A specialized architecture, coupled with new techniques for optimizing register management in the interpreter, allow Scheme86 to execute interpreted Scheme at a speed comparable to that of compiled Lisp on conventional workstations.
Multiprocessors with a serial multiport memory and a pseudo crossbar of serial links used s a processor-memeory switch
Authors: Daniel Litaize, Omar Hammami, Mustapha Lalam, Adelaziz Mzoughi, Pascl Sinrat
Venue: ACM SIGARCH Computer Architecture News (1989)

This paper presents an inventive information exchange pro-cess between the main memory and cache equipped processors. It makes use of serial multiport memories and high throughput serial transmission supports. It is then possible to consider the realization of a multiprocessor with a common memory shared by several hundreds processors set with a performance level close to that of a crossbar network one's without having its disadvantages. This exchange process generates a family of possible architectures in which serial transfers of informations are parallelized, in the contrary of conventional architectures which serialize parallel transfers of informations.
Playing detective with full text searching software
Authors: Darrell R. Raymond, Heather J. Fawcett
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1990)

Searching large text databases often resembles detective work. We explored this notion with an experiment in which subjects used powerful full text searching software to solve problems about the Arthur Conan Doyle story The Hound of the Baskervilles. The experiment was conducted in two parts: in the first part subjects attempted to teach themselves about the software using only the documentation; in the second part, subjects used the software to answer questions such as What brand of cigarette does Watson smoke? The experiment provided a great deal of feedback about the usability of the software and the documentation. Among the results that have wider implications are the need for better display of context, and a need for careful documentation of the characteristics of full text searching.
Integrating testing techniques through process programming
Authors: D. Richardson, S. Aha, L. Osterweil
Venue: ACM SIGSOFT Software Engineering Notes (1989)

Integration of multiple testing techniques is required to demonstrate high quality of software. Technique integration has four basic goals: reduced development costs, incremental testing capabilities, extensive error detection, and cost-effective application. We are experimenting with the use of process programming as a mechanism for integrating testing techniques. Having set out to develop a process that provides adequate coverage and comprehensive fault detection, we proposed synergistic use of DATA FLOW testing and RELAY to achieve all four goals. We developed a testing process program much as we would develop a software product from requirements through design to implementation and evaluation. We found process programming to be effective for explicitly integrating the techniques and achieving the desired synergism. Used in this way, process programming also mitigates many of the other problems that plague testing in the software development process.
Data typing in APL
Authors: D. Livingstone, H. Gharib
Venue: Conference proceedings on APL as a tool of thought (1989)

This paper describes a form of data typing implemented in APL. By contrast with conventional data typing, which basically specifies a storage format for a data type, it is a means of specifying the set of logical values that a variable is to be permitted to take. To assign a data type, a new copula analogous to value-assign is used. Hence only a single new symbol is added to APL, not a whole data typing sublanguage, but the full power of APL is available to define a type.The objectives and overall design of the data typing are described, plus an overview of its usefulness in writing application software.
Two-Dimensional Linear Prediction Model-Based Decorrelation Method
Authors: Z. Lin, Y. Attikiouzel
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

A unified feature extraction scheme, the two-dimensional (2-D) linear prediction model-based decorrelation method, is presented. By applying 2-D causal linear prediction model to decorrelate a textured image, the very heavy computation load required when using a whitening operator to decorrelate the image, or the significant information loss when using the gradient operator to approximately whiten the image is avoided. The texture model-based decorrelation provides three sets of features to perform texture classification: the coefficients of the 2-D linear prediction, the moments of error residuals and the autocorrelation values. An optimum feature-selection scheme using modified branch-and-bound method was introduced to reduce information redundancy. After feature selection, 100% classification accuracy was achieved for a 20-class texture problem. Experiments show that this feature extraction scheme is truly information lossless, effective, and fast.
PMothra: scheduling mutants for execution on a hypercube
Authors: B. Choi, A. Mathur, B. Pattison
Venue: Proceedings of the ACM SIGSOFT '89 third symposium on Software testing, analysis, and verification (1989)

Reliable software testing is a time consuming operation. In addition to the time spent by the tester in identifying, locating, and correcting bugs, a significant time is spent in the execution of the program under test and its instrumented or fault induced variants. When using mutation based testing to achieve high reliability, the number of such variants can be very large. In this paper we describe the architecture of a tool named PMothra that is designed to provide an architecture-transparent interface to a tester. In its current version, PMothra exploits the hypercube architecture by scheduling the execution of mutants on a 128-node Ncube/7 hypercube.
Parallel objects on distributed constraint logic programming machines
Authors: J. F. Koegel
Venue: ACM SIGPLAN Notices (1989)

The programming language POOL (Parallel Object Oriented Logic) allows computation to be represented as a collection of parallel objects which communicate via asynchronous message passing. Object procedures are Constraint Logic Programming (CLP) programs. POOL objects are mapped transparently to a network of CLP machines which execute concurrently. An implementation on a distributed network of workstations supports parallel object execution, automatic object placement, and a global object name space.
Ada in the Post Deployment Software Support Environment
Authors: T. Archer
Venue: Proceedings of the conference on Tri-Ada '89: Ada technology in context: application, development, and deployment (1989)

This paper presents TELOS Federal Systems experiences with the development, evolution, and provision of Post Deployment Software Support (PDSS) for the U.S. Army at Fort Sill, Oklahoma and the impact of Ada on future PDSS of Mission Critical Defense Systems (MCDS). TELOS Federal Systems provides technical and engineering PDSS to the U.S. Army Communications and Electronics Command (CECOM) for the U.S. Army Battlefield Automated Systems that comprise the Fire Support Segment of the Army Command and Control System.
An iterative solution to speical linear systems on a vector hypercube
Authors: L. de Pillis
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2 (1989)

An Intel Hypercube implementation of a new stationary iterative method developed by one of us (JdP) is presented. This algorithm finds the solution vector x for the invertible n &times; n linear system Ax = (I - B)x = f where A has real spectrum. The solution method converges quickly because the Jacobi iteration matrix B is replaced by an equivalent iteration matrix with a smaller spectral radius. The parallel algorithm partitions A row-wise among all the processors in order to keep memory load to a minimum and to avoid duplicate computations. With the introduction of vector hardware to the Hypercube, more modifications have been made to the implementation algorithm in order to exploit that hardware and reduce run-time even further. Example problems and timings will be presented.
A microcomputer oriented computer literacy course
Authors: Alice L. Clarke, Gerald W. Adkins
Venue: ACM SIGCSE Bulletin (1988)

The development of a computer literacy course at the University of Georgia is described. Demographic information regarding students taking the class is provided. The course consists of two main parts: 1) microcomputer lab sessions devoted to working with word processing, spreadsheet, and data base software and to programming in BASIC; and 2) readings in a course text and viewing of telecourse tapes. Course content and testing procedures are described in detail. How the course is changing with time and experience is also discussed.
Personal computing: simple complexity and COMDEX
Authors: Larry Press
Venue: Communications of the ACM (1990)

One of today's emerging paradigms is the view that complex behavior or form can emerge from the interaction of relatively simple components, if you have enough of them and they have enough time to do whatever they do. The emergent behavior or form might seem systematic or chaotic. Some examples are neural nets, cellular automata, fractals, electronic mail networks, market economies, whirlpools, and snowflakes. Years ago, similar systems were often called self-organizing, and they were found in models of memory, pattern recognition, multilevel stores, and libraries. The area languished, however, awaiting the development of theory and powerful hardware. Personal workstations played an important role in facilitating experimentation and mass market personal computers are now up to the task.
On the communication complexity of graph properties
Authors: András Hajnal, Wolfgang Maass, György Turán
Venue: Proceedings of the twentieth annual ACM symposium on Theory of computing (1988)

We prove &thgr;(n log n) bounds for the deterministic 2-way communication complexity of the graph properties CONNECTIVITY, s-t-CONNECTIVITY and BIPARTITENESS (for arbitrary partitions of the variables into two sets of equal size). The proofs are based on combinatorial results of Dowling-Wilson and Lov&aacute;sz-Saks about partition matrices using the M&ouml;bius function, and the Regularity Lemma of Szemer&eacute;di. The bounds imply improved lower bounds for the VLSI complexity of these decision problems and sharp bounds for a generalized decision tree model which is related to the notion of evasiveness.
The Object-Oriented Functional Data Language
Authors: Michael V. Mannino, In Jun Choi, Don S. Batory
Venue: IEEE Transactions on Software Engineering (1990)

The object-oriented functional data language (O/sup 2/FDL) is an interactive strongly typed database programming language that integrates the object-oriented and functional programming paradigms. It was designed for advanced applications that require a powerful and uniform database programming language supporting the software engineering principles of these tow paradigms. To this end, the O/sup 2/FDL supports inheritance and encapsulation of object-oriented languages, and an equational notation and strong typing of functional programming. Strong typing is extended with type restrictions to constrain the instantiations of type variables in function interfaces, while inheritance is augmented with a monotonic subtype rule for function redefinition. The O/sup 2/FDL also supports novel features. For the core of the O/sup 2/FDL, a denotational semantics based on an extended lambda -calculus is provided. For selected system-defined functions, operational semantics are provided and it is demonstrated that a subset of the O/sup 2/FDL is at least as expressive as the relational algebra.