ppxscal/embedding_network huggingface dataset:
MIKE: the menu interaction kontrol environment
Authors: Dan R. Olsen,  Jr.
Venue: ACM Transactions on Graphics (TOG) (1986)

A User Interface Management System (UIMS) called MIKE that does not use the syntactic specifications found in most UIMSs is described. Instead, MIKE provides a default syntax that is automatically generated from the definition of the semantic commands that the interaction is to support. The default syntax is refined using an interface editor that allows modification of the presentation of the interface. It is shown how active pictures can be created by adding action expressions to the viewports of MIKE's windowing system. The implications of MIKE's command-based dialogue description are discussed in terms of extensible interfaces, device and dialogue-style independence, and system support functions.
ASTA: LSI design management system
Authors: T. Ogihara, H. Toyoshima, S. Murai
Venue: Proceedings of the 24th ACM/IEEE Design Automation Conference (1987)

This paper deals with an LSI design management system which automates CAD program performance analysis. CAD program/library version control, design process control, design cost estimation and the collection of such statistical information as the sizes of the circuits being designed. The design management automation has been accomplished by analyzing statistical and control information generated by all the CAD programs and the operating system.
Software considerations for the &ldquo;black box&rdquo; solver FIDISOL for partial differential equations
Authors: Willi Schönauer, Eric Schnepf
Venue: ACM Transactions on Mathematical Software (TOMS) (1987)

FIDISOL is a program package for the solution of nonlinear systems of two-dimensional and three-dimensional elliptic and parabolic partial differential equations (PDEs) with nonlinear boundary conditions (BCs) on the boundaries of a rectangular domain. A finite difference method (FDM) with an arbitrary grid and arbitrary consistency order is used, these are either prescribed by the user or are self-adapted for a given relative tolerance. FIDISOL has been designed to be fully vectorizable on vector computers. In this paper we discuss several problems from the viewpoint of software development and user interface, for example, how to deliver the PDEs and BCs to FIDISOL and how to allow a flexible use by a suitable parameter list.
An introduction to the transmission performance capabilities of IEEE 802-5 token-ring networks
Authors: D. Irvin
Venue: ACM SIGCOMM Computer Communication Review (1987)

Transmission performance capabilities of the IEEE Standard 802.5 token-ring network are explored from the perspective of a network designer. Typical workloads are presented which quantify the demand placed on transmission resources by various classes of users. Next, a means of characterizing a network's size is developed, and several reference networks are presented. The performance of these networks under the demands of the typical workloads is then projected.
Efficient Computation of the Maximum of the Sum of Two Sequences and Applications
Authors: Victor Konrad
Venue: IEEE Transactions on Computers (1986)

Computing max{a1+ b1, a2+ b2, ... ,an+ bn} trivially takes n additions. We show that if we are given the ranking for the a's and the b's separately, then an algorithm exists which will compute the maximum in ?2n additions on the average. This can be generalized to yield an efficient algorithm to compute max{h(a1,b1
Parallel processors and systems for algebraic manipulation: current work
Authors: Carl G. Ponder
Venue: ACM SIGSAM Bulletin (1988)

What efforts are needed to produce a parallel system (computer architecture and interconnection network) for fast algebraic manipulation? This paper outlines current steps toward such a system, including work in related areas of parallel symbolic processing languages and general- and special-purpose multiprocessor systems.
The Alpine file system
Authors: M. R. Brown, K. N. Kolling, E. A. Taft
Venue: ACM Transactions on Computer Systems (TOCS) (1985)

Alpine is a file system that supports atomic transactions and is designed to operate as a service on a computer network. Alpine's primary purpose is to store files that represent databases. An important secondary goal is to store ordinary files representing documents, program modules, and the like. Unlike other file servers described in the literature, Alpine uses a log-based technique to implement atomic file update. Another unusual aspect of Alpine is that it performs all communication via a general-purpose remote procedure call facility. Both of these decisions have worked out well. This paper describes Alpine's design and implementation, and evaluates the system in light of our experience to date. Alpine is written in Cedar, a strongly typed modular programming language that includes garbage-collected storage. We report on using the Cedar language and programming environment to develop Alpine.
On the order of magnitude of fourier coefficients
Authors: J. B. Reade
Venue: SIAM Journal on Mathematical Analysis (1986)

In a new institution, planning a Macintosh network proceeded in step with planning a campus and a library building. The initial installation connected twenty-five Macintosh and DOS computers, and four network printers using Farallon Computing PhoneNet system LocalTalk hubs, wiring, and connectors. After three years of growth, the network consists of over fifty devices, including servers, netmodem, router, and Internet gateway. Migration toward individual microcomputer connections to Ethernet and CD-ROM servers is under development.
Rule-based transformation of relational queries into iterative programs
Authors: Johann Christoph Freytag, Nathan Goodman
Venue: ACM SIGMOD Record (1986)

Over the last decade many techniques for optimizing relational queries have been developed. However, the problem of translating these set-oriented query specifications into other forms for efficient execution has received little attention. This paper presents an algorithm that translates algebra-based query specifications into iterative programs for an efficient execution. While the source level operates on sets of tuples, the generated programs manipulate tuples as their basic objects. The algorithm incorporates techniques which have been developed in the areas of functional programming and program transformation.
Scale and performance in a distributed file system
Authors: John H. Howard, Michael L. Kazar, Sherri G. Menees, David A. Nichols, M. Satyanarayanan, Robert N. Sidebotham, Michael J. West
Venue: ACM Transactions on Computer Systems (TOCS) (1988)

The Andrew File System is a location-transparent distributed tile system that will eventually span more than 5000 workstations at Carnegie Mellon University. Large scale affects performance and complicates system operation. In this paper we present observations of a prototype implementation, motivate changes in the areas of cache validation, server process structure, name translation, and low-level storage representation, and quantitatively demonstrate Andrews ability to scale gracefully. We establish the importance of whole-file transfer and caching in Andrew by comparing its performance with that of Sun Microsystems NFS tile system. We also show how the aggregation of files into volumes improves the operability of the system.
Novice mistakes: are the folk wisdoms correct?
Authors: James C. Spohrer, Elliot Soloway
Venue: Communications of the ACM (1986)

An evaluation of two folk wisdoms serves to elucidate the underlying or "deep-structure" reasons for novice errors.
Associative table lookup processing for multioperand residue arithmetic
Authors: Christos A. Papachristou
Venue: Journal of the ACM (JACM) (1987)

This paper investigates the complexity of multioperand residue addition and multiplication implemented by associative table lookup processing. The complexity measure used is the size of the associative memory, that is, the number of matching words in memory. This measure largely depends on the residue recurrencies, or multiplicities, in the addition and multiplication tables module M. The major effort in this work is to evaluate the recurrencies in simultaneous multioperand residue addition and multiplication. The evaluation is simple in case of addition mod M, and also in multiplication mod M if M is prime. To treat the more difficult case of M nonprime, a recursive procedure was developed for computing the 2-operand multiplication recurrencies mod M. The basis of this technique is the precedence relationships associated with a tree representation of the factors of M. It is then shown that the general D-operand multiplication mod M, D > 2 and M nonprime, can be reduced to the 2-operand case by isomorphic transformation. Computation results of 2-operand residue arithmetic operations are provided. Applications to RNS arithmetic implementation are discussed.
No members, no officers, no dues: A ten year history of the software psychology society
Authors: Ben Shneiderman
Venue: ACM SIGCHI Bulletin (1986)

For ten years we have joyfully overcome our insecurity with anarchy and successfully conducted the "business" of the Software Psychology Society. Our business has always been science; to improve our understanding of how people use computers. The two-horse team of computer science and psychology usually pulled in the same direction. Sometimes it leaned towards design guidelines, software, and hardware, other times it leaned towards cognitive models, personality theory, and human problem-solving. Mostly our travel was steadied by an appreciation of the importance of empirical studies, data collection, and controlled experiments with an occasional diversion into theoretical models or inspirational system designs. Our destinations have included programming and command language design, human-computer interaction models, menu selection strategies, natural language interaction, software engineering metrics and methods, educational packages, expert system user interfaces, voice communications and conferencing systems, screen readability, use of color, user interface management systems, and text editor design.
An experiment in the use of Ada in course in software engineering
Authors: Guy Lapalme, Jean-Francois Lamy
Venue: Proceedings of the seventeenth SIGCSE technical symposium on Computer science education (1986)

This paper describes our experience in using Ada as a vehicle for teaching Software Engineering concepts in a course for first year undergraduate students at the University of Montreal. We first review the curriculum at our university and then give an idea of the hardware and software at our disposition. We describe the goals we had in mind in using Ada as a teaching language and then we detail the topics and the assignments chosen in our course. We conclude by describing a few lessons learned from that experience. All in all, we are very satisfied with this experiment and we intend to carry on next year.
Image base management system: a promising tool in the large office system environment
Authors: Leonardo Felician
Venue: ACM SIGMIS Database (1987)

Data base systems are now faced with a new application field---Image Based Systems. An "image" is simply a digitalized document page stored as a bit string. Applications in office automation include filing, large multimedia data bases, library storage and retrieval, and in science and medicine the recording and storage of satellite, geological and body scanner pictures. This paper defines the requirements for an architecture of an image base management system (IBMS) stored on large magnetic and optical disks and points out the problems introduced by the nonerasable constraint of optical disks. Suitable data structures and the main algorithms to manage an image base are discussed in details.
An Semantic Feedback in the Higgens UIMS
Authors: Scott E. Hudson, Roger King
Venue: IEEE Transactions on Software Engineering (1988)

Almost all applications using interactive graphics contain important structures and concepts which are deeper than the geometres used to display them to the user. One of the major tasks of the system implementer is to cause the user interface to reflect this deeper structure accurately so that it may be directly manipulated by the user. The authors describe a tool, the Higgens user interface management system (UIMS), which can automate much of this task for a wide class of systems using interactive graphics. It is able to generate graphical user interfaces automatically from a high-level interface specification. These specifications are primarily nonprocedural in nature. They describe how graphical images can be automatically derived and updated based on applications entities, and how graphical inputs can be translated back into terms which are appropriate to the application.
A guide to the major commercial AI issues and concerns
Authors: Wendy Rauch-Hindin
Venue: Proceedings of the conference on The 1987 ACM SIGBDP-SIGCPR Conference (1987)

Companies (and organizations) are increasingly recognizing the importance of AI in enhancing and improving existing operations, and are opting to commit their companies, at least to some degree, to using AI in business operations. A number of AI-based prototype systems developed at many companies, in addition to a few production applications, have demonstrated that AI is commercially feasible. However, building a prototype is only about 10 percent of the commercial AI story.
Computer algebra in the undergraduate mathematics classroom
Authors: B. W. Char, K. O. Geddes, G. H. Gonnet, B. J. Marshman, P. J. Ponzo
Venue: Proceedings of the fifth ACM symposium on Symbolic and algebraic computation (1986)

Unrestricted usage of the computer algebra system Maple was made available to many sections of undergraduate mathematics classes in 1985 as part of an on-going investigation into the uses of computers in mathematics education. The paper discusses some of the results of the experiment as it has proceeded so far, as well as directions for future work.
Plotting contour surfaces of a function of three variables
Authors: Granville Sewell
Venue: ACM Transactions on Mathematical Software (TOMS) (1988)

A technique is presented for the graphical representation of some contour (level) surfaces of a function of three variables defined by its values on an array of points (xi, yj, zk). The algorithm involves drawing and projecting the contour curves corresponding to the cross sections x = xI and y = yj. Because the curves are drawn as thick, opaque bands, which mask all bands in the immediate background, a sense of depth is retained, yet background contours are still visible between the bands.
Tags and type checking in LISP: hardware and software approaches
Authors: Peter Steenkiste, John Hennessy
Venue: ACM SIGPLAN Notices (1987)

One of the major factors that distinguishes LISP from many other languages (Pascal, C, Fortran, etc.) is the need for run-time type checking. Run-time type checking is implemented by adding to each data object a tag that encodes type information. Tags must be compared for type compatibility, removed when using the data, and inserted when new data items are created. This tag manipulation, together with other work related to dynamic type checking and generic operations, constitutes a significant component of the execution time of LISP programs. This has led both to the development of LISP machines that support tag checking in hardware and to the avoidance of type checking by users running on stock hardware. To understand the role and necessity of special-purpose hardware for tag handling, we first measure the cost of type checking operations for a group of LISP programs. We then examine hardware and software implementations of tag operations and estimate the cost of tag handling with the different tag implementation schemes. The data shows that minimal levels of support provide most of the benefits, and that tag operations can be relatively inexpensive, even when no special hardware support is present.
Orderings and partition of PDE computations for a fixed-size VLSI architecture
Authors: E. P. Papadopoulou, Y. G. Saridakis, T. S. PJapatheodorou
Venue: Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow (1987)

The parallel iterative solution of systems arising from the finite element discretization of elliptic PDEs, is the problem considered here. A red-black ordering is introduced to increase the degree of parallelism of the computation. Space-time domain expansion techniques are used to partition the computation for a proposed fixed-size VLSI architecture.
Software challenges&mdash;large organizations
Authors: E. R. Bond
Venue: Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow (1987)

The comments describe five items that are significant challenges in large decentralized organizations. Of the many problems that we face in managing the deployment of information technology in large organizations &hellip; particularly large decentralized organizations, I will comment on the five that I find most challenging. The first of these has to do with the dilemma arising from the desire to purchase more application-ready made solutions but finding that components that make them up are not consistent with individual corporate standards. Notions of layering such as in the OSI model or preparing for increasingly interconnected systems, or use of standard data base methodologies or embedded security/authentication features, etc. are frequently not found in the packages. Given the lack of industry-wide system's infrastructure standards, the growth and richness of product offerings, product differentiation characteristics, and the existing embedded base of technology, there are inherent conflicts with make/buy tradeoffs. The conflicts may even be growing. With pressures on the banking/financial services sector for improved tactical results, achieving strategic visions involving distributed processing made up of multiple vendors is still a long way off. The second item derives from the first. If one envisions distributed processing systems that are global, interconnected, composed of components of varying price/performance/functionality/ and vendor make, what are the underlying fundamentals that should be utilized in the logical and physical placement of these capabilities. Simply stated, what are the principles that should determine how to distribute functionality across the corporation. The third issue has to do with design for and managing risks arising from security, authentication, Trojan horses and failures in these meshed networks. The fourth issue deals with achieving effective merging of the specialty areas of telecommunications, office automation, DP centers, application software and data base administration to effect a total solution capability. Not only from a &ldquo;build&rdquo; perspective but from an operate, maintain, service and user marketing perspective. The fifth deals with disciplines. How to develop good practices in the so-called naive end-user community. They are in the process of learning, making the same mistakes we made and rediscovering everything we learned back in the 50s, 60s, or early 70s. The large central organizations are loosing influences. They no longer are able to harass or bureaucratize the users to deal with issues such as documenting programs, adhering to standards, implementing data security and recovery techniques and resolving data integrity issues. The users have a growing self-sufficiency that makes them no longer naive. They outnumber the &ldquo;old guard&rdquo;.
Tree rebalancing in optimal time and space
Authors: Q. F Stout, B. L Warren
Venue: Communications of the ACM (1986)

A simple algorithm is given which takes an arbitrary binary search tree and rebalances it to form another of optimal shape, using time linear in the number of nodes and only a constant amount of space (beyond that used to store the initial tree). This algorithm is therefore optimal in its use of both time and space. Previous algorithms were optimal in at most one of these two measures, or were not applicable to all binary search trees. When the nodes of the tree are stored in an array, a simple addition to this algorithm results in the nodes being stored in sorted order in the initial portion of the array, again using linear time and constant space.
A theory of reliability in database systems
Authors: Vassos Hadzilacos
Venue: Journal of the ACM (JACM) (1988)

Reliable concurrent processing of transactions in a database system is examined. Since serializability, the conventional concurrency control correctness criterion, is not adequate in the presence of common failures, another theory of correctness is proposed, involving the concepts of commit serializability, recoverability, and resiliency.
Sparsity structure and Gaussian elimination
Authors: I. S. Duff, A. M. Erisman, C. W. Gear, J. K. Reid
Venue: ACM SIGNUM Newsletter (1988)

In this paper we collate and discuss some results on the sparsity structure of a matrix. If a matrix is irreducible, Gaussian elimination yields an LU factorization in which L has at least one entry beneath the diagonal in every column except the last and U has at least one entry to the right of the diagonal in every row except the last. If this factorization is used to solve the equation Ax=b, the intermediate vector has an entry in its last component and the solution x is full. Furthermore, the inverse of A is full.Where the matrix is reducible, these results are applicable to the diagonal blocks of its block triangular form.
Grammatical category disambiguation by statistical optimization
Authors: Steven J. DeRose
Venue: Computational Linguistics (1988)

Several algorithms have been developed in the past that attempt to resolve categorial ambiguities in natural language text without recourse to syntactic or semantic level information. An innovative method (called "CLAWS") was recently developed by those working with the Lancaster-Oslo/Bergen Corpus of British English. This algorithm uses a systematic calculation based upon the probabilities of co-occurrence of particular tags. Its accuracy is high, but it is very slow, and it has been manually augmented in a number of ways. The effects upon accuracy of this manual augmentation are not individually known.The current paper presents an algorithm for disambiguation that is similar to CLAWS but that operates in linear rather than in exponential time and space, and which minimizes the unsystematic augments. Tests of the algorithm using the million words of the Brown Standard Corpus of English are reported; the overall accuracy is 96%. This algorithm can provide a fast and accurate front end to any parsing or natural language processing system for English.
Muse A Computer Assisted Verification System
Authors: J. Daniel Halpern, Sam Owre, Norman Proctor, William F. Wilson
Venue: IEEE Transactions on Software Engineering (1987)

Muse is a verification system which extends the collection of tools developed by SRI International for their Hierarchical Development Methodology (HDM). It enhances the SRI system by providing a capability for proving invariants and constraints for the state machine described by a specification written in SPECIAL (the specification language of HDM). In particular, it enables one to use the HDM system to meet the requirements for formal verification in a National Computer Security Center A1 evaluation of a secure operating system. In addition to the tools provided by SRI, Muse has a parser, a facility to handle multiple modules, a formula generator, and a theorem prover. The theorem prover has a number of interesting features designed to facilitate human direction of the proving process. In concept, it is open-ended. We introduce the notion of a theorem prover kernel as a device for ensuring the logical soundness of the prover in the face of continual improvements to its functionality.