ppxscal/embedding_network huggingface dataset:
Synthesis of Multivalued Multithreshold Functions for CCD Implementation
Authors: M H Abd-El Barr, S G Zaky, Z G Vranesic
Venue: IEEE Transactions on Computers (1986)

Basic multivalued building blocks constructed using CCD (charge-coupled devices) technology are presented. They are used to realize simple threshold functions. Existing techniques for decomposition of multivalued multithreshold functions into simpler subfunctions are reviewed. Usage of the CCD technology in implementation of these subfunctions is discussed. Two new decomposition techniques are proposed. Their aim is to obtain realizations that are better suited to CCD technology in terms of the maximum number of thresholds per element and the generation of negative weights. Synthesis techniques based on the proposed decompositions are presented and compared. Although 4-valued logic functions are stressed, the techniques are, in principle, applicable to functions of any radix.
A Comparison of VLSI Architecture of Finite Field Multipliers Using Dual, Normal, or Standard Bases
Authors: I. S. Hsu, T. K. Truong, L. J. Deutsch, I. S. Reed
Venue: IEEE Transactions on Computers (1988)

Three different finite-field multipliers are presented: (1) a dual-basis multiplier due to E.R. Berlekamp (1982); the Massey-Omura normal basis multiplier; and (3) the Scott-Tavares-Peppard standard basis multiplier. These algorithms are chosen because each has its own distinct features that apply most suitably in particular areas. They are implemented on silicon chips with NMOS technology so that the multiplier most desirable for VLSI implementation can readily be ascertained.
Algebraic Specifications as Solutions of Implementation Equations
Authors: Norman Y. Foo
Venue: IEEE Transactions on Software Engineering (1987)

Algebraic specifications for datatypes are shown to be easy to write if succinct implementation descriptions are available. The method proposed solves out the implementation details, leaving behind the specification required. A number of examples illustrate the method. However it is also shown that in general the solution is not algorithmic. A connection to the correctness problem for implementations is made.
Global query optimization
Authors: Timos K. Sellis
Venue: ACM SIGMOD Record (1986)

In some recently proposed extensions to relational database systems as well as in deductive databases, a database system is presented with a collection of queries to process instead of just one. It is an interesting problem then, to come up with algorithms that process these queries together instead of one query at a time. We examine the problem of multiple (global) query optimization in this paper. A hierarchy of algorithms that can be used for global query optimization is exhibited and analyzed. These algorithms range from an arbitrary serial execution without any sharing of common results among the queries to an exhaustive search of all possible ways to process all queries.
On visual formalisms
Authors: David Harel
Venue: Communications of the ACM (1988)

The higraph, a general kind of diagramming object, forms a visual formalism of topological nature. Higraphs are suited for a wide array of applications to databases, knowledge representation, and, most notably, the behavioral specification of complex concurrent systems using the higraph-based language of statecharts.
Finding the optimal variable ordering for binary decision diagrams
Authors: S. J. Friedman, K. J. Supowit
Venue: Proceedings of the 24th ACM/IEEE Design Automation Conference (1987)

The ordered binary decision diagram is a canonical representation for Boolean functions, presented by Bryant as a compact representation for a broad class of interesting functions derived from circuits. However, the size of the diagram is very sensitive to the choice of ordering on the variables; hence for some applications, such as Differential Cascode Voltage Switch (DCVS) trees, it becomes extremely important to find the ordering leading to the most compact representation. We present an algorithm for this problem with time complexity O(n23n), an improvement over the previous best, which required O(n!2n).
Linking mechanism supporting end-user computing
Authors: Robert W Zmud, Mary R Lind
Venue: Proceedings of the twenty-first annual conference on Computer personnel research (1985)

It is proposed that organizations better able to exploit information-related opportunities do so because their information systems groups provide a greater number of linking mechanisms through which end-user computing is motivated and facilitated. This study examines this notion. Interviews were held in 21 organizations to determine the extent to which 12 linking mechanisms were being used to facilitate 19 issues. An examination of the findings suggests that while the linking mechanisms are being used, this usage (1) is not yet that extensive and (2) the apparently more effective links are not always those most used.
An experimental VLSI Prolog interpreter: preliminary measurements and results
Authors: P. L. Civera, F. Maddaleno, G. L. Piccinini, M. Zamboni
Venue: Proceedings of the 14th annual international symposium on Computer architecture (1987)

This work presents the preliminary results of a project oriented to the design and VLSI implementation of a Prolog interpreter. Even if the interpretative approach is being considered an inefficient way to execute high level languages when compared to that of compilation, declarative languages with embedded extralogical instructions would require the use of direct execution. Hardware interpreters have two serious problems: execution speed and lack of flexibility. Recent computer architecture and VLSI technology help us to overcome these drawbacks.
An Algebraic Model for Asynchronous Circuits Verification
Authors: Christian Berthet, Eduard Cerny
Venue: IEEE Transactions on Computers (1988)

An algebraic methodology for comparing switch-level circuits with higher-level specifications is presented. Switch-level networks, 'user' behavior, and input constraints are modeled as asynchronous machines. The model is based on the algebraic theory of characteristic functions (CF). An asynchronous automation is represented by a pair of CFs, called a dynamic CF (DCF): the first CF describes the potential stable states, and the second CF describes the possible transitions. The set of DCFs is a Boolean algebra. Machine composition and internal variables abstraction correspond, respectively, to the product and sum operations of the algebra. Internal variables can be abstracted under the presence of a domain constraint. The constraint is validated by comparison to the outside behavior. The model is well suited for speed-independent circuits for which the specification is given as a collection of properties. Verification reduces to the validation of Boolean inequalities.
Programming constructs for database system implementation in EXODUS
Authors: Joel E. Richardson, Michael J. Carey
Venue: ACM SIGMOD Record (1987)

The goal of the EXODUS extensible DBMS project is to enable the rapid development of a wide spectrum of high-performance, application-specific database systems EXODUS provides certain kernel facilities for use by all applications and a set of tools to aid the database implementor (DBI) in generating new database system software. Some of the DBI's work is supported by EXODUS tools which generate database components from a specification. However, components such as new abstract data types, access methods, and database operations must be explicitly coded by the DBI. This paper analyzes the major programming problems faced by the DBI, describing the collection of programming language constructs that EXODUS provides for simplifying the DBI's task. These constructs have been embedded in the E programming language, an extension of C++ designed specifically for implementing DBMS software.
The complexity of backtrack searches
Authors: L Carter, L Stockmeyer, M Wegman
Venue: Proceedings of the seventeenth annual ACM symposium on Theory of computing (1985)

In this paper, we study the complexity of finding an efficient search for combinatorial problems which are commonly solved by backtracking. First, a formalism is introduced. Backtrack searches are ordinarily thought of as following a tree pattern. Our model is considerably more general, and there are problems where this allows much shorter searches. Next, we look at the complexity of search strategies (probabilistic decision trees) that can solve any problem in a collection of problems. Let C be the collection of problems that can be solved by a (possibly lucky) search involving K or fewer queries. We prove a nonpolynomial lower bound (in terms of K) on any search strategy for C. We conjecture that a matching upper bound exists. Finally, a few heuristics are presented that give the flavor of an interesting line of research: to test the effectiveness of a heuristic that should work on any problem, try it out on a few specific problems of known complexity. On some simple problems, our heuristics allow polynomial-time searches.
Cooperative Distributed Algorithms for Dynamic Cycle Prevention
Authors: S. Katz, O. Shmueli
Venue: IEEE Transactions on Software Engineering (1987)

Parallel distributed algorithms are presented for adding and deleting edges in a directed graph without creating a cycle. Such algorithms are useful for a variety of problems in distributed systems such as preventing deadlock or ordering priorities. The algorithms operate in a realistic asynchronous computer network environment in which there are numerous possible interactions among overlapping instances of the algorithms.
Concurrency in linear hashing
Authors: Carla Schlatter Ellis
Venue: ACM Transactions on Database Systems (TODS) (1987)

Concurrent access to complex shared data structures, particularly structures useful as database indices, has long been of interest in the database community. In dynamic databases, tree structures such as B-trees have been used as indices because of their ability to handle growth; whereas hashing has been used for fast access in relatively static databases. Recently, a number of techniques for dynamic hashing have appeared. They address the major deficiency of traditional hashing when applied to databases that experience significant change in the amount of data being stored. This paper presents a solution that allows concurrency in one of these dynamic hashing data structures, namely linear hash files. The solution is based on locking protocols and minor modifications in the data structures.
Recent developments in expert systems
Authors: B Buchanan
Venue: Proceedings of the ACM SIGART international symposium on Methodologies for intelligent systems (1986)

The most important development in expert systems is the introduction and proliferation of frameworks, or shells, that allow rapid prototyping, easy expansion, and continued maintenance. Several shells are now in commercial use and have been used to build expert systems of recognized value. The state of the art and several new lines of development will be discussed. Some of the developments involve fundamental research in AI on knowledge representation and inference; others involve making the shell environments themselves more intelligent.
A closer look at Noahnet
Authors: D J Faber, G M Parulkar
Venue: ACM SIGCOMM Computer Communication Review (1986)

Noahnet is a robust, highly available, high bandwidth local area network (LAN) architecture, in the implementation phase at the University of Delaware. Noahnet uses a distributed switch-oriented node topology, a flooding approach for message routing, and high bandwidth communication media. The purpose of this paper is to consider some of the important issues in detail such as: the various ways flood control can be implemented; their relative advantages/disadvantages; the functions of a node; and one possible implementation of a node in Noahnet. Expected performance of the Noahnet in comparison to Ethernet and token ring networks is also discussed. Though Noahnet uses more complex structure and protocol, we demonstrate that the overhead of using flooding in Noahnet is minimal and that a Noahnet node implementation is very simple and inexpensive. The paper concludes that Noahnet provides features such as robustness, high availability, high throughput, and high communication band width at almost no additional cost.
On the Optimal Solution of Large Linear Systems
Authors: J. F. Traub, H. Woźniakowski
Venue: Journal of the ACM (JACM) (1984)

The information-based study of the optimal solution of large linear systems is initiated by studying the case of Krylov information. Among the algorithms that use Krylov information are minimal residual, conjugate gradient, Chebyshev, and successive approximation algorithms. A "sharp" lower bound on the number of matrix-vector multiplications required to compute an &aring;-approximation is obtained for any orthogonally invariant class of matrices. Examples of such classes include many of practical interest such as symmetric matrices, symmetric positive definite matrices, and matrices with bounded condition number. It is shown that the minimal residual algorithm is within at most one matrix-vector multiplication of the lower bound. A similar result is obtained for the generalized minimal residual algorithm. The lower bound is computed for certain classes of orthogonally invariant matrices. How the lack of certam properties (symmetry, positive definiteness) increases the lower bound is shown. A conjecture and a number of open problems are stated.
A practical parallel algorithm for solving band symmetric positive definite systems of linear equations
Authors: Ilan Bar-on
Venue: ACM Transactions on Mathematical Software (TOMS) (1987)

We give a practical parallel algorithm for solving band symmetric positive definite systems of linear equations in O(m* log n) time using nm/log n processors. Here n denotes the system size and m its bandwidth. Hence, the algorithm is efficient. For tridiagonal systems, the algorithm runs in O(log n) time using n/log n processors. Furthermore, an improved version runs in O(log m log n) time using nm2/(log m log n) processors.
Formal limits on the automatic generation and maintenance of integrity constraints
Authors: J. P. Delgrande
Venue: Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (1987)

A formal approach to the automatic generation and maintenance of integrity constraints in relational databases is presented. It is assumed that some portion of the database extension is known and that constraints are to be formed on the basis of this portion. Since this portion may be updated or new relations added to the database the set of hypothesised constraints may require occasional revision. The goal is this paper is to characterise those constraints that may potentially be formed on the basis of a part of the extension. Formal systems are derived by means of which the set of constraints that can be formed is precisely specified. A procedure is derived for restoring the consistency of a set of constraints after conflicting tuples are encountered. It is shown that the set of constraints to which the procedure may be applied corresponds with minor limitations to the sentences of relational algebra.
Pseudo MIMD array processor&mdash;AAP2
Authors: T. Kondo, T. Tsuchiya, T. Kitamura, Y. Sugiyama, T. Kimura
Venue: Proceedings of the 13th annual international symposium on Computer architecture (1986)

A highly integrated array processor (AAP2)-LSI has been developed. After the past 3 years study on the adaptive array processor 1 (AAP1), a challenging improvements on the SIMD's restraints are achieved by using the AAP2-LSI. The AAP2 array system makes it possible to carry out wideband modifiable operation (pseudo MIMD). Furthermore, each PE is capable of supporting a large amount of memory. The AAP2 potential for massively, parallel and pipelined processing is discussed in the field of image processing and CAD applications.A highly integrated array processor (AAP2)-LSI has been developed. After the past 3 years study on the adaptive array processor 1 (AAP1), a challenging improvements on the SIMD's restraints are achieved by using the AAP2-LSI. The AAP2 array system makes it possible to carry out wideband modifiable operation (pseudo MIMD). Furthermore, each PE is capable of supporting a large amount of memory. The AAP2 potential for massively, parallel and pipelined processing is discussed in the field of image processing and CAD applications.
A concurrent object-oriented knowledge representation language Orient84/K: its features and implementation
Authors: Yutaka Ishikawa, Mario Tokoro
Venue: ACM SIGPLAN Notices (1986)

Orient84/K is an object oriented concurrent programming language for describing knowledge systems. In Orient84/K, an object is composed of the behavior part, the knowledge-base part, and the monitor part, in order to provide object-oriented, logic-based, demon-oriented, and concurrent-programming paradigms in the object framework. Every object is capable of concurrent execution in Orient84/K.In this paper, after describing an overview of Orient84/K, we will describe implementation issues in a concurrent object oriented language. Then, a new method for an efficient implementation of concurrent objects is proposed and formally described. A new virtual machine for Orient84/K is designed using this method, and some preliminary results of evaluation are presented.
TED: a graphical technology description editor
Authors: W. Lee, G. Liu, K. Peterson
Venue: Proceedings of the 24th ACM/IEEE Design Automation Conference (1987)

Design verification has historically been performed on mainframes and minis. As a result of the pervasive use of character terminals, process technology specifications have always been provided in textual form. It is difficult to visualize and understand layer dependencies, design rules and material properties by looking at a textual description of what can be a large and complex network of relationships. The increasing complexity of new processes (and even in some of today's bipolar and Bi-MOS processes) and the proliferation of CAE workstations has made an interactive, graphical method of defining and editing technology descriptions both necessary and possible. This paper describes one such approach and its embodiment in a tool which is part of the system software on an electron-beam probe station.
Tax issues in computer technology companies
Authors: R. L. Black
Venue: Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow (1987)

The role of taxes in decision making at computer technology companies is becoming increasingly more important. The 1980s have seen the enactment of numerous new tax provisions with major implications for high-technology businesses. This paper provides and overview of some of the more important provisions effecting computer technology &mdash; e.g., the tax planning and compliance inherent in research and development, depreciation, transfers and amortization of intangibles, and certain types of entities. The consequences of the Tax Reform Act of 1986 for computer technology companies is highlighted.
Contention is no obstacle to shared-memory multiprocessing
Authors: Randall Rettberg, Robert Thomas
Venue: Communications of the ACM (1986)

Contention in large-scale shared-memory systems is less of a concern than generally believed. Through careful engineering of a parallel system, the effects of contention can be controlled.
Computational implementation of the multivariate Halley method for solving nonlinear systems of equations
Authors: Annie A. M. Cuyt, L. B. Rall
Venue: ACM Transactions on Mathematical Software (TOMS) (1985)

Cubicaliy convergent iterative methods for the solution of nonlinear systems of the multivariate Halley method, require first and second partial derivatives of the of the functions comprising the system. Automatic differentiation is used to automate the Halley method, HESSIAN and routines for the required operators and functions. A Pascal-SC which implements this method in a single-step iteration mode. The program nonlinear systems, and the results are compared with Newton's method.
A knowledge-based system for computer algebra
Authors: Jacques Calmet, Denis Lugiez
Venue: ACM SIGSAM Bulletin (1987)

This paper reports on a work in progress aiming at designing and implementing a system for representing and manipulating mathematical knowledge. Its kernel is a computer algebra system but it shows several of the features of the so-called knowledge-based systems. The main issues considered here are the software engineering aspects of the project, the definition of a new language to support the system and the use of AI techniques in a field where algebraic algorithms are the building stones of systems. This defines an environment which enables not only to have data-bases of knowledge but also to implement an expert use of this knowledge.
Ensuring court admissibility of computer-generated records
Authors: Roger King, Carolyn Stanley
Venue: ACM Transactions on Information Systems (TOIS) (1985)

An informal methodology is described for optimizing the likelihood of computer-generated records being admissible in a U.S. court of law. This methodology is intended for individuals who are converting to automated office procedures, as well as for those whose businesses are already highly computerized. However, this paper does not purport to be a formal legal guide; rather, it is intended as an overview of this issue.
A Paradigm for Developing Information Systems
Authors: B. I. Blum
Venue: IEEE Transactions on Software Engineering (1987)

This paper describes a paradigm for implementing software in which 1) a database is used to maintain virtually all recorded information about the application and 2) the executable product is generated directly from the formal specifications. A specific environment, TEDIUM®, defined for a specific application class, the interactive information system, is presented as a proof of concept. The benefits of this paradigm are evaluated briefly, and the characteristics associated with its in productivity improvement are identified.
A knowledge-based message management system
Authors: Shi-Huo Chang, L. Leung
Venue: ACM Transactions on Information Systems (TOIS) (1987)

The design approach of a knowledge-based message management system is described. A linguistic message filter is used to filter out junk messages. Relevant messages are then processed by an expert system, driven by user-defined alerter rules. An alerter rule base for a secretarial office is illustrated. Further research topics in knowledge-base design, evaluation, and learning are also discussed.
Improving a PLA area by pull-up transistor folding
Authors: C. Lursinsap, D. Gajski
Venue: Proceedings of the 24th ACM/IEEE Design Automation Conference (1987)

The constraints limiting multiple PLA folding are the positions of pull-up transistors (Tpu) and the layout architecture which supports only I/O folding. In this paper, we present a novel architecture supporting multiple I/O, term, and pull-up foldings with through-the-cell net routing. The pull-up folding allows implementation of multiple level Boolean functions. Our architecture model achieves a better densities in comparison with PLA model.
Graph attribution with multiple attribute grammers
Authors: J. Rohrich
Venue: ACM SIGPLAN Notices (1987)

Attributed graphs are well suited to represent structured sets of data objects. A multiple attribute grammar (MTAG) consists of several attribute grammars that describe an attributed graph as a union of attributed trees. Thus, from an MTAG one can automatically generate attribute evaluators for graphs. Dependency analysis at generation time of the attribute evaluator leads to fast attribute evaluation, and to significant space savings due to attribute overlay.