ppxscal/embedding_network huggingface dataset:
Efficient final placement based on nets-as-points
Authors: X. Zhang, T. L. Pillage, R. A. Rohrer
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

Deterministic optimization programs are coming to be considered as viable alternatives for the placement of very large sea-of-gate, gate array and standard cell designs. A nets-as-points placement program has been described which provides competitive results in comparison with non-deterministic placement, and at a fraction of the run time. A new pseudo Steiner tree model for the gate placement about the netpoints, along with a virtual channel snap-to-grid procedure, provides results superior to the original nets-as-points placement program without requiring iterative improvement.
Automatically generating visual syntax-directed editors
Authors: Farah Arefi, Charles E. Hughes, David A. Workman
Venue: Communications of the ACM (1990)

Since inexpensive computers possessing sophisticated graphics were introduced in the late 1970s, program development research has focused on syntax-directed editors that are based on the grammars of their underlying languages. The system presented here automatically generates object-oriented, syntax-directed editors for visual languages, which are described by a family of editing operations.
Local reorientation, global order, and planar topology
Authors: M.-Y. Kao, G. E. Shannon
Venue: Proceedings of the twenty-first annual ACM symposium on Theory of computing (1989)

Almost every problem on digraphs requires computing strongly connected components and directed spanning trees in one form or another. It has long been an open problem whether polylog time and linear processors are enough to find the strongly connected components of a digraph and compute directed spanning trees for these components. This paper provides the first non-trivial partial solution to this open problem: For a planar digraph with n vertices, the strongly connected components can be computed in O(log3n) time and O(n) processors. If the graph is strongly connected, a directed spanning tree can be built in O(log2 n) time and O(n) processors. Both algorithms are deterministic and run on a parallel random access machine that allows concurrent reads and concurrent writes in its shared memory.
An insurance simulation model
Authors: Ole M. Meyer
Venue: ACM SIGAPL APL Quote Quad (1990)

This paper describes an interactive insurance simulation model comprising all major aspects of a financial report for an insurance company. The model was developed by Topdanmark A/S for it's own use, and has been in use since it was completed in 1985. Based on actual data, some of which are collected from other APL systems, the model is used for summing up the detail budgets. Hereby a forecast financial report can be produced, and sensitivity to the assumptions behind the budgets and the composition of the budgets can be tested. The paper gives a brief introduction on how the model was conceived, and an explanation of why APL was chosen for the task. This is followed by a presentation of the model itself, with a detailed description of the extent and complexity of the model. As an example of model usage, an impact is introduced into the model, and the effect hereof is demonstrated. Finally some future ambitions regarding model development are sketched.
Item selection from menus: the influence of menu organization, query interpretation, and programming experience on selection strategies
Authors: L. M. Arnold
Venue: ACM SIGCHI Bulletin (1989)

Computer generated menus are increasingly being used to simplify the dialog between the human user and the computer system. They are most often provided to help reduce the complexity of the user interface and are characterized by presenting lists of terms (or commands) for easy recognition rather then requiring the recall of these terms from memory. Currently, menu systems are being designed for simplifying the interface to database query languages used to retrieve information stored in computers' databases (Mezzanotte amp; Kibler, 1984; Williams, 1984; Ogden, Korenshtein, amp; Smelcer, 1986). A menu-prompted interface supporting a query language would benefit users of database systems by eliminating their need to recall specific database information and by guiding them through the process of query generation.
Integrating motion into computational environments
Authors: B. Michon
Venue: ACM SIGCHI Bulletin (1989)

Motion video in the computation environment is a major step in the evolution of expressive and effective computer systems. However, video is a difficult medium to integrate into a professional workstation or a personal computer. This true from the base video mixing architecture to the functional design of the user interface.
A unifying model for consistent distributed software development environments
Authors: J. Walpole, G. S. Blair, J. Malik, J. R. Nicol
Venue: ACM SIGPLAN Notices (1989)

The increase in size and complexity of software projects over recent years has lead to the need for Software Development Environments (SDEs). SDEs are intended to provide assistance in the development of large software systems involving teams of people. It is generally agreed that SDE's should be built on a distributed base. However, the distribution of computer systems introduces several problems which make it very difficult to maintain the consistency of data. To ensure that changes to data are made consistently the concept of atomic transactions is usually adopted. However, existing transaction mechanisms are unsuitable for use in a distributed SDE. Furthermore, transactions are not the only mechanism concerned with controlling changes to the SDE database. The control of change is also a task for version and configuration control mechanisms. Traditionally, the functions of version control, configuration control and transactions have been treated as separate, unrelated issues. This paper presents a new model which unifies all three concepts in a distributed SDE. Mechanisms for supporting the new model are presented and the application of the model to the Cosmos Distributed SDE is discussed.
On the Design of a Unidirectional Systolic Array for Key Enumeration
Authors: F.-C. Lin, K. Chen
Venue: IEEE Transactions on Computers (1990)

A systolic array for enumerating keys in n keys in 3n-1 time steps is introduced. This array has unidirectional data flow and achieves the maximum data pipelining rate. Modifications of the array for solving the closest-neighbor problems in computational geometry are presented.
Process Synchronization: Design and Performance Evaluation of Distributed Algorithms
Authors: R. Bagrodia
Venue: IEEE Transactions on Software Engineering (1989)

The author presents a simple solution for the committee coordination problem, which encompasses the synchronization and exclusion problems associated with implementing multiway rendezvous, and shows how it can be implemented to develop a family of algorithms. The algorithms use message counts to solve the synchronization problem, and they solve the exclusion problem by using a circulating token or by using auxiliary resources as in the solutions for the dining or drinking philosophers' problems. Results of a simulation study of the performance of the algorithms are presented. The experiments measured the response time and message complexity of each algorithm as a function of variations in the model parameters, including network topology and level of conflict in the system. The results show that the response time for algorithms proposed is significantly better than for existing algorithms, whereas the message complexity is considerably worse.
The Distribution of Waiting Times in Clocked Multistage Interconnection Networks
Authors: C. P. Kruskal, M. Snir, A. Weiss
Venue: IEEE Transactions on Computers (1988)

Analyzes the random delay experienced by a message traversing a buffered, multistage packet-switching banyan network. The authors find the generating function for the distribution of waiting time at the first stage of the network for a very general class of traffic, assuming messages have discrete sizes. For example, traffic can be uniform or nonuniform, messages can have different sizes, and messages can arrive in batches. For light-to-moderate loads, the authors conjecture that delays experienced at the various stages of the network are nearly the same and are nearly independent. This allows us to approximate the total delay distribution. Better approximations for the distribution of waiting times at later stages of the network are attained by assuming that in the limit a sort of spatial steady state is achieved. Extensive simulations confirm the formulas and conjectures.
Non-intrusive and interactive profiling in parasight
Authors: Ziya Aral, Ilya Gertner
Venue: Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems (1988)

Debugging the performance of parallel applications is crucial for fully utilizing the potential of multiprocessor hardware. This paper describes profiling tools in Parasight, a programming environment that is geared towards non-intrusive performance analysis and high-level debugging. In Parasight, profilers execute as observer programs which run concurrently with the target program and monitor its behavior. This design grew out of our experience in debugging and monitoring the performance of real parallel programs. Parasight is used to implement an interactive profiler based on gprof, a standard UNIX profiling tool. The new profiler is an interactive tool that is dynamically controlled by the programmer and can run concurrently with the target program. It is also less intrusive than the original. This was achieved in part by off-loading the profile gathering computations to an adjacent processor and in part by allowing selective profiling. In conjunction with the new profiler, Parasight is used to implement high-level custom profiling routines that may be inserted at arbitrary locations in a target program to measure user-defined abstractions. One outcome has been to develop the beginnings of a profiling methodology in which high-level performance problems are detected through a function profiler and detailed performance bottlenecks are analyzed with custom profiling routines. Parasight, the new profiler and their associated tools have been implemented on the Encore Multimax, a shared-memory multiprocessor running UNIX. They have been used to profile both parallel and sequential programs.
A zero-one law for Boolean privacy
Authors: B. Chor, E. Kushilevitz
Venue: Proceedings of the twenty-first annual ACM symposium on Theory of computing (1989)

A Boolean function &fnof;: A1 X A2 X &hellip; X An &rarr; {0,1} is t - private if there exists a protocol for computing &fnof; so that no coalition of size &le; t can infer any additional information from the execution, other than the value of the function. We show that &fnof; is &lceil;n/2&rceil; - private if and only if it can be represented as &fnof; (x1, x2, &hellip;, xn) = &fnof; (x1) &oplus; &fnof;2(x2) &oplus; &hellip; &oplus; &fnof;n (xn, where the &fnof;i are arbitrary Boolean functions. It follows that if &fnof; is &lceil;n/2&rceil; - private, then it is also n - private. Combining this with a result of Ben-Or, Goldwasser, and Wigderson, we derive an interesting &ldquo;zero-one&rdquo; law for private distributed computation of Boolean functions: Every Boolean function defined over a finite domain is either n - private, or it is &lceil;n-1/2&rceil; - private but not &lceil;n/2&rceil; - private. We also investigate a weaker notion of privacy, where (a) coalitions are allowed to infer a limited amount of additional information, and (b) there is a probability of error in the final output of the protocol. We show that the same characterization of &lceil;n/2&rceil; - private Boolean functions holds, even under these weaker requirements. In particular, this implies that for Boolean functions, the strong and the weak notions of privacy are equivalent.
Performance prediction for the horizon super computer
Authors: R. R. Glenn
Venue: Proceedings of the 1988 ACM/IEEE conference on Supercomputing (1988)

The performance of one Horizon processing element can be quantified by user operations per instruction, the instructions per tick, and the basic clock rate. Assuming there is sufficient parallelism within a problem, the performance of one PE can be multiplied by the number of PEs contained in the Horizon system. For a 256-PE Horizon the expected sustained performance is in the order of 50 giga user operations per second for problems with sustained parallelism of 8,000 to 12,000 instruction streams.
Discussion: John von Neumann - A Case Study of Scientific Creativity
Authors: W. Aspray, P. Horvath, D. Nagy, E. Teller, N. Vonneuman, E. P. Wigner
Venue: IEEE Annals of the History of Computing (1989)

Edward Teller assesses von Neumann's influence on the development of mathematics, especially of his work on representation theory of noncompact groups. He stresses von Neumann's early realization of the significance of computers. Wigner's recollections of John von Neumann's early years emphasize the influence of von Neumann's early education on the development of his scientific creativity.
Exception handling and object-oriented programming: towards a synthesis
Authors: Christophe Dony
Venue: Proceedings of the European conference on object-oriented programming on Object-oriented programming systems, languages, and applications (1990)

The paper presents a discussion and a specification of an exception handling system dedicated to object-oriented programming. We show how a full object-oriented representation of exceptions and of protocols to handle them, using meta-classes, makes the system powerful as well as extendible and solves many classical exception handling issues. We explain the interest for object-oriented programming of handlers attached to classes and to expressions. We propose an original algorithm for propagating exceptions along the invocation chain which takes into account, at each stack level, both kind of handlers. Any class can control which exceptions will be propagated out of its methods; any method can provide context-dependant answers to exceptional events. The whole specification and some keys of our Smalltalk implementation are presented in the paper.
Precedental data bases: how and why they are worked out and used
Authors: B. Pevzner
Venue: Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval (1988)

The concept of a &ldquo;precedental data base&rdquo; is introduced. It is a linguistic data base consisting of a dictionary of lexical patterns (clishes) and a dictionary of discourses. Some algorithms for textual information processing using precedental data bases are discussed in detail. These systems are installed on mainframe and minicomputers for test runs.
Putting the puzzle together: a network picture suitable for framing
Authors: S. R. Berry
Venue: Proceedings of the 17th annual ACM SIGUCCS conference on User Services (1989)

During the past several years, rapid growth has occurred in both the number and types of computing resources available at Arizona State University. In the infancy of this growth, a limited strategy was developed to interconnect some of these resources. For the most part, though, each computing resource was viewed as an independent entity with access limited to those who directly utilized that resource. It was not entirely understood at that time how these resources would emerge to be pieces of a much larger puzzle. This is certainly understandable considering that computer network technologies were still developing, especially in the interconnectivity arena. As more pieces emerged on campus - standalone PCs and Macintoshes, local area networks, minicomputers, and mainframes, it became apparent that a puzzle did exist which, if solved, could allow these resources to be utilized more effectively and economically. Though some of the pieces existed, the enigma was to find the missing pieces and fit together a networking picture which could be framed and hung in any office. This paper details the efforts of Information Resources Management at ASU in discovering the missing pieces and both developing and implementing a network strategy which solved the puzzle on the ASU campus.
Addressing the problem of software library management for object oriented and conventional operator/operand systems, utilizing the entity-relationship approach
Authors: G. Clark, J. Clark, T. W. Ling
Venue: ACM SIGMIS Database (1989)

Large commercial and research establishments who attempt to reuse software to construct operable systems confront the problem of code management. The increasing availability and usage of Computer Aided Software Engineering, CASE, tools coupled with the production of highly reusable code modules induces the need for more sophisticated and versatile library management facilities. This paper describes how the entity relationship approach can be used to address the problem of library management for design, code, and program management libraries. This approach to library management is independent of software development methodologies, hence is capable of supporting object oriented and convential operator/operand system designs and implementations.
Introduction to SLAM II and SLAMSYSTEM
Authors: J. J. O'Reilly, K. C. Nordlund
Venue: Proceedings of the 21st conference on Winter simulation (1989)

SLAM II was the first simulation language which allowed a modeler to formulate a system description using process, event, or continuous world views or any combination of the three. Since its initial release in 1981, SLAM II has undergone continual development and application. SLAMSYSTEM, introduced in 1988, provides SLAM II with an integrated simulation system for advanced personal computers. SLAMSYSTEM supports the entire simulation process, from model building to results presentation and documentation.
The iPSC/2 node architecture
Authors: P. Close
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1 (1988)

Feedback from users of the first generation ISP system plus the development and availability of new VLSI based technologies drove the design of the iPSC/2 node. The new node design was broadly governed by the following goals: Provide true 32-bit node architecture and performance. Match the communication performance to the computational performance. Increase on board memory capacity by using new RAM technology. Employ a modular functional elements to easily incorporate future technology. Allow plug compatibility with existing iPSC systems, including interface to co-processors. Ensure software compatibility for existing iPSC applications. This paper describes how the iPSC/2 node achieved these goals by leveraging Intel's VLSI expertise and products, surface mount, CMOS and gate array technologies, and small daughter boards to implement modular subsystems.
LIZA: an extensible groupware toolkit
Authors: S. J. Gibbs
Venue: ACM SIGCHI Bulletin (1989)

Software for supporting groups of cooperating users &mdash; groupware &mdash; raises a number of new issues in user interface design. This paper gives a definition of groupware and presents a model of group tools based on active objects. The model has been applied to the design and implementation of an extensible groupware toolkit known as LIZA. The paper describes the architecture of LIZA. Examples of group tools running under LIZA are used to illustrate some of the problems in the design of multi-user interfaces.
A content analysis of ten introduction to programming textbooks
Authors: H. Willis Means
Venue: ACM SIGCSE Bulletin (1988)

A content analysis was conducted on ten introduction to programming textbooks to determine if there were any significant differences in their content. The results of the analysis indicated that the content of the older textbooks, pre 1983, was not significantly different from the more recent texts, post 1985.
&lgr;-V-CS: an extended &lgr;-calculus for scheme
Authors: Matthias Felleisen
Venue: Proceedings of the 1988 ACM conference on LISP and functional programming (1988)

The &lgr;-v-CS-calculus is a conservative extension of the &lgr;-value-calculus for reasoning about programs in Scheme-like languages. The basis of the extended calculus is a symbolic rewriting semantics for imperative programs. We show with numerous examples how to state and prove equational properties of Scheme-programs in the calculus. The examples suggest that the algebraic manipulation of imperative-functional programs is as feasible and as fruitful as that of functional ones.
On the algebraic and differential Newton-Puiseux polygons
Authors: A. Hilali
Venue: Journal of Symbolic Computation (1987)

This paper deals with the system of n linear differential equations (@D)Y^'(x)=A(x)Y(x) where A(x) is holomorphic in a punctured neighbourhood of x = 0 with a pole of order p >= 1. First, we shall give a survey of the algorithm described in Hilali & Wazner (1987) by which a system (@D) is reduced to super-irreducible form. Using the symmetric functions of the matrix A, the construction of the Newton-Puiseux polygon is demonstrated to be derived directly from this form. These results allow a generalization of the formal singularity classification and a method for the computation of formal solutions near an irregular singular point of (@D).
Extended programming in the large in a software development environment
Authors: Claus Lewerentz
Venue: ACM SIGPLAN Notices (1989)

This paper deals with the programming in the large part and the integration with related activities (programming in the small, variant control, support of technical documentation, responsibility and access control) of the software development and maintenance process. It is pointed out how these tasks are supported with an integrated and incremental software project support environment (IPSEN). Snapshots of a working session are used to demonstrate the user interface and the functionality of the tools for the above mentioned topics. The main concern of this paper is to show how an incremental and integrated tool set, regarding the consistency of software documents can support software development.
Empirical analysis of inductive knowledge acquisition methods
Authors: H. M. Chung
Venue: Issue 108 (April 1989) (1989)

The performance of modeling techniques in emulating expert decision making behavior at classification tasks might be contingent upon the characteristics of tasks to which the model is applied.
Efficient VLSI Parallel Algorithm for Delaunay Triangulation on Orthogonal Tree Network in Two and Three Dimensions
Authors: Sanjeev Saxena, P. C. Bhatt, V. C. Prasad
Venue: IEEE Transactions on Computers (1990)

An algorithm with worst case time complexity O(log/sup 2/N) in two dimensions and O(m/sup 1/2/log N) in three dimensions with N input points and m as the number of tetrahedra in triangulation is given. Its AT/sup 2/ VLSI complexity on Thompson's logarithmic delay model, (1983) is O(N/sup 2/log/sup 6/N) in two dimensions and O(m/sup 2/Nlog/sup 4/ N) in three dimensions.