ppxscal/embedding_network huggingface dataset:
View from the floor (DAC trade show review)
Authors: P. M. Hefferan
Venue: ACM SIGDA Newsletter (1988)

This is the fourth annual review of the Design Automation Conference. Each year new concepts and ideas arise in the commercial DA community, and this year was no exception. Logic synthesis has emerged as the new CAE tool of 88, with a number of well-funded companies showing sophisticated offerings. Also, this year's conference will go down as the year when a standard (EDIF) was actually implemented and demonstrated, not just talked about. Additionally, there was a massive emergence of CAE and CAD tools on personal computers. A large number of quite sophisticated routers are now available for PC platform ("almost a commodity" one old router expert commented).
How to compute multivariate Pade approximants
Authors: C. Chaffy
Venue: Proceedings of the fifth ACM symposium on Symbolic and algebraic computation (1986)

We present here various ways of generalizing the Pad&eacute; approximation to multivariate functions. To compute them, we use a computer algebra system: REDUCE.
Spectral Signature Testing of Multiple Stuck-at Faults in Irredundant Combinational Networks
Authors: P K Lui, J C Muzio
Venue: IEEE Transactions on Computers (1986)

Earlier spectral signature testing methods are extended to the multiple stuck-at fault model. The testability condition for multiple- input faults is established and a minimal spanning signature (MSS) is defined to cover all these faults. It is then shown that an MSS, which in most cases contains a single spectral coefficient, will detect over 99 percent of all input and internal multiple faults. An approach is described to obtain a complete signature for all multiple faults in any irredundant combinational network with comparatively small numbers of fan-outs. Tree networks that include XOR/XNOR gates are shown to be easily tested. Internally fan-out-free and general irredundant networks are also considered. A design approach is proposed to enable a network to be tested for all single and most multiple faults using a single coefficient, with the possible overhead being an extra control input.
Diplans: a new language for the study and implementation of coordination
Authors: Anatol W. Holt
Venue: ACM Transactions on Information Systems (TOIS) (1988)

In this paper the reader is introduced to coordination in the workplace as an object of scientific study and computer automation. Diplans are the expressions of a new graphical language used to describe plans of operation in human organizations. With diplans, systems of constraint, which may or may not take the form of procedure definitions, can be specified. Among the special strengths of diplans is their ability to render explicit the interactive aspects of complex work distributed over many people and places&mdash;in other words, coordination. Diplans are central to coordination technology, a new approach to developing support for cooperative work on heterogeneous computer networks.
Evolutionary changes in microcomputer services and support
Authors: Charles A. Dyer
Venue: Proceedings of the 15th annual ACM SIGUCCS conference on User Services (1987)

&ldquo;I've got a quick question&rdquo;. Those of us who have been working in microcomputer services and support for several years have heard this question asked many times. The question has remained the same but the users asking the question, as well as the answers, have not. Evolving technology and user sophistication now require the educational community to review their services and support programs. The Ohio State University has experienced dramatic changes in users and is attempting to respond to these changes. Users now expect and demand more services. Areas of concern include: public labs with a wider range of machines and longer hours; more varied site licenses; university resale and discount programs; hands-on workshops specifically designed for faculty and staff; residence hall microcomputing facilities; comprehensive networking of the university community; file transfer capabilities with numerous mainframes and microcomputers; and increased consultant awareness of new technology and software. This paper will outline the programs that are being implemented at The Ohio State University to facilitate these needs. Emphasis is to be placed on new techniques and the anticipated results.
There is no &ldquo;Uspensky's method.&rdquo;
Authors: Alkiviadis G. Akritas
Venue: Proceedings of the fifth ACM symposium on Symbolic and algebraic computation (1986)

In this paper an attempt is made to correct the misconception of several authors [1] that there exists a method by Upensky (based on Vincent's theorem) for the isolation of the real roots of a polynomial equation with rational coefficients. Despite Uspensky's claim, in the preface of his book [2], that he invented this method, we show that what Upensky actually did was to take Vincent's method and double its computing time. Upensky must not have understood Vincent's method probably because he was not aware of Budan's theorem [3]. In view of the above, it is historically incorrect to attribute Vincent's method to Upensky.
The PegaSys System: pictures as formal documentation of large programs
Authors: Mark Moriconi, Dwight F. Hare
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1986)

PegsSys is an experimental system in which a user formally describes how a program is put together by means of a hierarchically structured collection of pictures, called formal dependency diagrams (FDDs). Icons in an FDD denote a wide range of data and control dependencies among the relatively coarse-grained entities contained in large programs. Dependencies considered atomic with respect to one level in a hierarchy can be decomposed into a number of dependencies at a lower level. Each dependency can be a predefined primitive of the FDD language or it can be defined by a PegaSys user in terms of the primitives. A PegsSys user is given the illusion that logical formulas do not exist, even though PegaSys reasons about them internally. This involves (1) checking whether an FDD is meaningful syntactically, (2) determining whether hierarchical refinements of an FDD are methodologically sound, and (3) deciding whether an FDD hierarchy is logically consistent with the program that it is intended to describe. The techniques used to provide these capabilities are discussed along with the logical properties that enable PegaSys to maintain the user illusion.
An architecture for a multimedia teleconferencing system
Authors: L Aguilar, J J Garcia-Luna-Aceves, D Moran, E Craighill, R Brungardt
Venue: Proceedings of the ACM SIGCOMM conference on Communications architectures protocols (1986)

We present an object-oriented architecture for a computer-based, real-time, multimedia conferencing system. This architecture divides the system into five functional areas: a multimedia shared workspace, a user interface, conference management, communications, and an information base. The structure and operation of the first four areas are modeled with object-based concepts that address design requirements identified during the development of a proof-of-concept prototype, that preceded the architecture specification. The shared workspace, the most important component, is thoroughly discussed; the other components support its realization. The modeling of workspace entities emphasizes their aggregation into composed entities and the homogeneous handling of several data media. The user interface manages uniformly the man-machine interaction for both local and remote user actions. Conference management deals with session establishment, participation, and control of multiple media floors. The communication functions replicate user actions over workspace objects in all hosts participating in a conference, matching traffic types with transmission services in the process.
Simulation model testing
Authors: John Craig Comfort
Venue: Proceedings of the 20th annual symposium on Simulation (1987)

THe cost of repairing an error in a simulation program increases with the length of time that the error remains in the system. <u>Simulation model testing,</u> an analog to and extension of software testing, is proposed as an attempt to aggressively seek errors latent in a simulation model/program. Goals of and a preliminary set of techniques for simulation model testing are presented, as are the results of an initial investigation of its utility.
A precompiler for modular, transportable Pascal
Authors: Max J. Egenhofer, Andrew U. Frank
Venue: ACM SIGPLAN Notices (1988)

Highly modular, object-oriented software systems require support from programming languages to produce reusable code. Pascal lacks such features that easily propagate type definitions and routines from one module to another, such as MODULA-2 or ADA. This paper describes a Pascal extension which includes directives to mark data definitions and operations as externally visible. A precompiler which handles import directives translates the source into the compiler-specific Pascal syntax. This precompiler has been successfully used for five years in education and research.
Issues and approaches to design of real-time database systems
Authors: Mukesh Singhal
Venue: ACM SIGMOD Record (1988)

Real-time database systems support applications which have severe performance constraints such as fast response time and continued operation in the face of catastrophic failures. Real-time database systems are still in the state of infancy, and issues and alternatives in their design are not very well explored. In this paper, we discuss issues in the design of real-time database systems and discuss different alternatives for resolving these issues. We discuss the aspects in which requirements and design issues of real-time database systems differ from those of conventional database systems. We discuss two approaches to design real-time database systems, viz., main memory resident databases and design by trading a feature (like serializability). We also discuss requirements in the design of real-time distributed database systems, and specifically discuss issues in the design of concurrency control and crash recovery. It is felt that long communication delays may be a factor in limiting the performance of real-time distributed database systems. We present a concurrency control algorithm for real-time distributed database systems whose performance is not limited by communication delays.
A knowledge-based message generation system for the nonverbal, profoundly motor disabled
Authors: B.-K. Sy, J. R. Deller,  Jr.
Venue: Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow (1987)

Fundamental issues related to the design of an intelligent communication (speech or text) device for the nonverbal, profoundly motor disabled are discussed. The device is to assist a person in the generation of a message by suggesting message elements one-at-a-time, for yes/no response. A graph theoretic approach to represent contextual knowledge about a fixed language is proposed, and message generation is viewed as one of decentralized control of graph search. A strategy for integrating information from a speech recognition system is formalized. Its significance is to allow the user to attempt to speak the message. The search strategy is based on a parsing tree traversal technique which dynamically adjusts its message element presentations in accordance with contextual knowledge embedded in the graph, the information from speech recognition, and the user's responses to interrogation.
Energy constraints on parameterized models
Authors: Andrew Witkin, Kurt Fleischer, Alan Barr
Venue: ACM SIGGRAPH Computer Graphics (1987)

A simple but general approach to imposing and solving geometric constraints on parameterized models is introduced, applicable to animation as well as model construction. Constraints are expressed as energy functions, and the energy gradient followed through the model's parameter space. Intuitively, energy constraints behave like forces that pull and parametrically deform the parts of the model into place. A wide variety of geometric constraints are amenable to this formulation, and may be used to influence arbitrary model parameters. A catalogue of basic constraints is presented, and results are shown.
Consulting methods used by the text consultants at a large research laboratory
Authors: Elizabeth A. McAuliffe
Venue: Proceedings of the 15th annual ACM SIGUCCS conference on User Services (1987)

This paper will cover the methods used for consulting and teaching by the text consultants at a large research laboratory. Text consulting, at this laboratory, has existed for more then ten years and many changes have occurred during this time. Some of the changes that will be discussed are supported software, number of users and their changing needs. We will also cover the day to day activities of the consultants, including the methods that have been used in past years, and discoveries and conclusions that affect the way we consult today. When and why we use formal teaching methods will be discussed, including our special secretarial training courses. The secretarial training course is, on the whole, one-on-one instruction. Why this course came into existence and the methods used (past and present) will also be mentioned.
Continuous tone representation of three-dimensional objects illuminated by sky light
Authors: Tomoyuki Nishita, Eihachiro Nakamae
Venue: Proceedings of the 13th annual conference on Computer graphics and interactive techniques (1986)

Natural lighting models to date have been limited to calculation of direct sunlight. However, this paper proposes an improved model for natural lighting calculations that adequately considers both direct sunlight and scattered light caused by clouds and other forms of water vapor in the air. Such indirect natural light is termed skylight and can be an important factor when attempting to render realistic looking images as they might appear under overcast skies.In the proposed natural lighting model, the sky is considered to be a hemisphere with a large radius (called the sky dome) that acts as a source of diffuse light with nonuniform intensity. In order to adequately take into account the nonuniform intensity of such skylight, the sky dome is subdivided into bands. The light intensity within individual bands can be assumed to be transversely uniform and longitudinally nonuniform and therefore the total luminance emanating from each band can be calculated more accurately.The proposed method significantly improves the realism of natural lighting effects. Its advantages are particularly apparent when simulating lighting under an overcast sky or when rendering surfaces that fall within a shadow cast by an obstruction lit by direct sunlight.
Implementation of a prototype CAIS environment
Authors: P Carr, R Stevenson, J Alea, J Berthold, G Croucher
Venue: ACM SIGAda Ada Letters (1987)

This paper describes a project to investigate the feasibility, performance and utility o f a CAIS compliant Ada Programming Support Environment. A working model of an environment was built, with a command language interpreter and a small toolset. Tools from the host environment have been imported and made to behave as native CAIS tools. A number of tools have been ported from a parallel effort by a MITRE corporation team with little difficulty. The prototype was built initially for correctness and enhanced later for performance improvements. The performance was found to be acceptable as a test bed for development of prototype tools and offered hope for the performance of a product-quality implementation. A test suite for compliance with the standard was partially implemented.
A new interactive supply/demand router with rip-up capability for printed circuit boards
Authors: E. Rosenberg
Venue: Proceedings of the 24th ACM/IEEE Design Automation Conference (1987)

In this router, an iterative, non-sequential &ldquo;supply/demand&rdquo; router attempts to find conflict-free (non-crossing or overlapping) paths for each net. If 100% interconnection is not achieved with supply/demand routing, the rip-up procedure removes enough nets to eliminate all conflicts. Nets that are ripped-up are returned to the supply/demand router for re-routing. The new router was compared to a Lee-type router on six double-sided boards, and on average obtained 6.8% higher completion.
Using emulators as vehicles for instruction in systems programming: prospective consideration
Authors: Amos O. Olagunju, Elvis Borders
Venue: ACM SIGCSE Bulletin (1987)

Microprogramming is a technique for implementing machine language instruction sets &mdash;it is critical in today's computer architectures and operating systems. An emulator is a set of microprograms that implements the architecture of one machine on another; microprogramming is often used in emulation to make one computer system appear as if it were another. This paper presents the architecture for a microprogrammed computer system, the VSEM. The simulated virtual computer system, its monitor and a simulated concurrent PASCAL are discussed. The usefulness of the VSEM, its monitor and the concurrent PASCAL as vehicles for instruction in systems programming is addressed.
Transformation between different levels of workload characterization for capacity planning: fundamentals and case study
Authors: Ingrid M. Graf
Venue: Proceedings of the 1987 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1987)

Queueing network models are effective tools for capacity planning of computer systems. The base of all performance oriented questions is the characterization of the computer system workload. At the capacity planning level the workload is described in user-oriented terms. At the system level the queueing network model requires input parameters, which differ from the workload description at the capacity planning level. In this paper a general procedure to transform the parameters between these two levels is presented and applied to a case study. The effect on system performance of an increase in the use of an existing application system is analysed.
Implementation concepts for an extensible data model and data language
Authors: D. S. Batory, T. Y. Leung, T. E. Wise
Venue: ACM Transactions on Database Systems (TODS) (1988)

Future database systems must feature extensible data models and data languages in order to accommodate the novel data types and special-purpose operations that are required by nontraditional database applications. In this paper, we outline a functional data model and data language that are targeted for the semantic interface of GENESIS, an extensible DBMS. The model and language are generalizations of FQL [11] and DAPLEX [40], and have an implementation that fits ideally with the modularity required by extensible database technologies. We explore different implementations of functional operators and present experimental evidence that they have efficient implementations. We also explain the advantages of a functional front-end to &not;1NF databases, and show how our language and implementation are being used to process queries on both 1NF and &not;1NF relations.
Equational theories and database constraints
Authors: S S Cosmadakis, P C Kanellakis
Venue: Proceedings of the seventeenth annual ACM symposium on Theory of computing (1985)

We present a novel way to formulate database dependencies as sentences of first-order logic, using equational statements instead of Horn clauses. Dependency implication is directly reduced to equational implication. Our approach is powerful enough to express functional and inclusion dependencies, which are the most common database constraints. We present a new proof procedure for these dependencies. We use our equational formulation to derive new upper and lower bounds for the complexity of their implication problems.
Implications of fragmentation dynamic routing for internet datagram authentication
Authors: Gene Tsudik
Venue: ACM SIGCOMM Computer Communication Review (1988)

With the recent growth of internets, large networks connecting heterogeneous entities, access control is an issue no longer confined to individual hosts. Recent literature suggests that authentication may have to be performed in gateways as well as on an end-to-end basis. In this paper we discuss the implications of fragmentation and dynamic routing on gateway-level authentication in packet-switched networks like DARPA Internet. Two algorithms are presented that permit fragmentation and dynamic routing to some extent, while allowing the gateways to authenticate successive packets belonging to authorized connections.
Global register allocation at link time
Authors: David W. Wall
Venue: ACM SIGPLAN Notices (1986)

In previous work in global register allocation, the compiler colors a conflict graph constructed from liveness dataflow information, in order to allocate the same register to many variables that are not simultaneously live. If two procedures are in separately compiled modules, however, the compiler must do this allocation separately for each procedure. As a result, the two procedures might use different registers for the same global, or the same register for different locals.We can remove these problems if we delay the register allocation until link time. Our compiler produces object modules that can be linked and run without global register allocation, but includes with each object module a body of information describing how the module uses variables and procedures. A link-time register allocator then decides which variables are used most frequently, selects registers for them, and rewrites the code to reflect the decision that these variables reside in registers rather than in memory. Construction of the call graph allows us to use the same register for locals of procedures that are not simultaneously active, giving us most of the advantages of a full-scale coloring without the expense.When we use our method for 52 registers, our benchmarks speed up by 10 to 25 percent. Even with only 8 registers, the speedup can be nearly that large if we use previously collected profile information to guide the allocation. We cannot do much better, because programs whose variables all fit in registers rarely speed up by more than 30%. Moreover, profiling shows us that we usually remove 60% to 90% of the loads and stores of scalar variables that the program performs during its execution, and often much more.
Version Support for Engineering Database Systems
Authors: Klaus R. Dittrich, Raymond A. Lorie
Venue: IEEE Transactions on Software Engineering (1988)

In engineering applications, multiple copies of object descriptions have to coexist in a single database. This paper proposes a scheme that enables users to explicitly deal with these object versions. After introducing a basic version model, the problem of "rerouting" interobject references upon the creation of new versions is solved by providing generic references and user-specific environments. Finally, logical version clusters are introduced that allow for the meaningful grouping of versions. The paper concludes with some remarks on implementation and a comparison with other approaches.
Finite State Model and Compatibility Theory: New Analysis Tools for Permutation Networks
Authors: Shing-Tsaan Huang, Satish K. Tripathi
Venue: IEEE Transactions on Computers (1986)

In this paper, we present a new model, finite permutation machine (FPM), to describe the permutation networks. A set of theorems are developed to capture the theory of operations for the permutation networks. Using this new framework, an interesting problem is attacked: are 2n - 1 passes of shuffle exchange necessary and sufficient to realize all permutations? where n = log2 N and N is the number of inputs and outputs interconnected by the network. We prove that to realize all permutations, 2n - 1 passes of shuffle exchange are necessary and that 3n - 3 passes are sufficient. This reduces the sufficient number of passes by 2 from the best-known result.