ppxscal/embedding_network huggingface dataset:
An Instruction Issuing Approach to Enhancing Performance in Multiple Functional Unit Processors
Authors: R D Acosta, J Kjelstrup, H C Torng
Venue: IEEE Transactions on Computers (1986)

Processors with multiple functional units, such as CRAY-1, Cyber 205, and FPS 164, have been used for high-end scientific computation tasks. Much effort has been put into increasing the throughput of such systems. One critical consideration in their design is the identification and implementation of a suitable instruction issuing scheme. Existing approaches do not issue enough instructions per machine cycle to fully utilize the functional units and realize the high-performance level achievable with these powerful execution resources.
The spatial metaphor for user interfaces: experimental tests of reference by location versus name
Authors: William P. Jones, Susan T. Dumais
Venue: ACM Transactions on Information Systems (TOIS) (1986)

The enduring dichotomy between spatial and symbolic modes of representation and retrieval acquires an added pragmatic dimension through recent developments in computer-based information retrieval. The standard name-based approach to object reference is now supplemented on some systems by a spatial alternative-often driven by an office or desktop metaphor. Little rigorous evidence is available, however, to support the supposition that spatial memory in itself is more effective than symbolic memory. The accuracy of spatial versus symbolic reference was assessed in three experiments. In Experiment 1 accuracy of location reference in a location-only filing condition was initially comparable to that in a name-only condition, but deteriorated much more rapidly with increases in the number of objects filed. In Experiment 2 subjects placed objects in a two-dimensional space containing landmarks (drawings of a desk, table, filing cabinets, etc.) designed to evoke an office metaphor, and in Experiment 3 subjects placed objects in an actual, three-dimensional mock office. Neither of these enhancements served to improve significantly the accuracy of location reference, and performance remained below that of a name-only condition in Experiment 1. The results raise questions about the utility of spatial metaphor over symbolic filing and highlight the need for continuing research in which considerations of technological and economic feasibility are balanced by considerations of psychological utility.
Formal Verification of Hardware Correctness: Introduction and Survey of Current Research
Authors: Paolo Camurati, Paolo Prinetto
Venue: Computer (1988)

Formal verification techniques are analyzed, focusing on two key points: suitable representation systems and mechanizable proofs. Different approaches to hardware verification are first examined, and formal verification and automated synthesis are compared to show how they cooperate in producing zero-defect designs. The different techniques are evaluated. Cross fertilization with software verification techniques is discussed.
The dark side of computer operations: implementing user policies
Authors: Phyllis Griggs
Venue: Proceedings of the 15th annual ACM SIGUCCS conference on User Services (1987)

Computer centers today aren't like the computer centers in the good ol' days. Back then, users came to the window and handed us their keypunched cards. The computer operator stacked them on top of a batch of other cards in the card stacker with a divider card, and we all patiently waited. A half a day later the user would come back to see if his cards had been batch processed yet. He asked the status of his job, the operator told him, and the user accepted his word for it. When the user finally did get his cards and printout, he was grateful and amazed at the all-powerful computer and at the cooperation of the computer operator. Life was so simple. The computer center of 1987 is altogether different. The computer is merely taken for granted, and the distressed operator takes abuse that defies description. What went wrong? When did the operator lose control of his little kingdom? Why is it becoming increasingly difficult to implement policies? In the old days, users accepted the operator's word for everything, mainly because they had no choice. Today, nearly every user has his own terminal or microcomputer right on top of his desk. The user can easily monitor the operator's every move. The user is able to determine which jobs are waiting in which queue and how long they've been waiting. If the user is really alert, he can tell if a job has been waiting an unusually long time, and possibly if the operator is asleep at the wheel. And to add to the operator's grief, the user can take it one step further by &ldquo;notifying&rdquo; the delinquent operator via console messages that his work could stand improvement. In the time it takes the operator to respond to the irate user, the operator could have put the printer on line or repaired whatever damage was occurring without any prompting from the user. In an environment of 2000 plus users, responding to console remarks can be a full-time occupation. And responses to users must be handled diplomatically. After all, the comments that are made are all right there in black and white&mdash;there is no denying the unintentional sarcastic overtones in the response. When life was more tranquil, it was simply our word against theirs.
On computational efficiency of the iterative methods for the simultaneous approximation of polynomial zeros
Authors: G. V. Milovanovic, M. S. Petkovic
Venue: ACM Transactions on Mathematical Software (TOMS) (1986)

A measure of efficiency of simultaneous methods for determination of polynomial zeros, defined by the coefficient of efficiency, is considered. This coefficient takes into consideration (1) the R-order of convergence in the sense of the definition introduced by Ortega and Rheinboldt (Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, New York, 1970) and (2) the number of basic arithmetic operations per iteration, taken with certain weights depending on a processor time. The introduced definition of computational efficiency was used for comparison of the simultaneous methods with various structures.
A CAD system in APL
Authors: Uday G. Gujar, Joseph W. P. So
Venue: Proceedings of the international conference on APL: APL in transition (1987)

A two-dimensional Computer Aided DEsign Tutorial System (CADETS) has been designed and implemented and is reported in this paper. The graphics screen is divided into five windows. The main, and the largest, window is used for graphics; the others are used for user communication which is achieved through a structure of well defined menus and the system messages. There are currently eleven ways to create a point, thirteen ways to create a line segment, ten ways to specify a circular arc, several functions to generate common geometric objects such as triangles, rectangles, polygons, conics and ten fonts to write labels. Once created, the user may pick the geometric entities in the current model for inquiry, transformation or deletion through a series of selection menus. Translation, scaling, rotation, and mirroring is facilitated by transformation functions. Model file management functions enable the user to store the created geometric models on an auxiliary device and retrieve and manipulate them with options to move, copy or duplicate the transformed entities. The power of CADETS is further enhanced by the introduction of layers. This facility enables the user to view and draw each individual layer independently or to view selected layers simultaneously.
A conceptual model for case grammar analysis
Authors: K. Efe, P. A. Ng
Venue: Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow (1987)

Case grammars are useful formalisms in natural language processing. Their usefulness in realistic implementation projects have been demonstrated in the form of working systems by a number of researchers. However a close inspection, made during an attempt to use case grammars in generating user tailored error messages, has revealed serious limitations: There are so many anomalies and inconsistencies in earlier models that a completely new approach to the characterization of case grammars has been found necessary. After reviewing representative work about case grammars the present state of crisis is explained. To solve these problems a new model is proposed, which is based on dividing sentences into a small number of categories depending on similarity in their meanings. For each meaning category, a unique paradigm is defined to formally characterize the semantic relations between sentence components. Together with the use of well defined combination rules, the proposed set of paradigms can represent sentences with arbitrary complexity.
Binding performance at language design time
Authors: J. Cai, R. Paige
Venue: Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1987)

An important research goal in software engineering and programming languages is the development of principles underlying the specification of computable problems, the translation of these problems into efficient and correct programs, and the performance analysis of these programs. This paper uncovers some of these principles, which are used to design a problem specification language L1 restricted to problems that can be compiled automatically into programs whose worst case asymptotic time and space complexities are linear in the input/output space. Any problem expressible in L1 can be compiled into a linear cost program. A compiler for L1 has been implemented in the RAPTS transformational programming system.
Operation specific locking in B-trees
Authors: A. Biliris
Venue: Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (1987)

B-trees have been used as an access and for both primary and secondary indexing for quite some time. This paper presents a deadlock free locking mechanism in which different processes make use of different lock types in order to reach the leaf nodes. The compatibility relations among locks on a node, do not exclusively depend on their type, but also on the node status and the number and kind of processes acting currently on the node. As a result, a number of insertion or deletion processes can operate concurrently on a node. The paper presents an appropriate recovery strategy in case of failure, and discusses the protocol modifications that are required so it can be used in other similar structures such as B+-trees, compressed B-trees, and R-trees for spatial searching.
Communication Performance in Multiple-Bus Systems
Authors: Qing Yang, Safwat G. Zaky
Venue: IEEE Transactions on Computers (1988)

A simple queueing model is presented for studying the effect of multiple-bus interconnection networks on the performance of asynchronous multiprocessor systems. The proposed model is suitable for systems in which each processor has a local memory and is thus able to continue processing while waiting for a response from the global memory. An approximate, closed-form solution is given that is simple and easy to use for any number of processors, buses, or memory modules and for arbitrary memory block size. The model is used to study the access time of the global memory as a function of the number of buses for different local-memory/global-memory traffic rates.
Behavioral experiments on handmarkings
Authors: John D. Gould, Josiane Salaun
Venue: ACM Transactions on Information Systems (TOIS) (1987)

Handmarkings or handwritten editing marks can be used as direct editing commands to an interactive computer system. Five exploratory experiments studied the potential value of handmarkings for editing text and pictures, as well as for some specific results. Circles are the most frequently used scoping mark, and arrows are the most frequently used operator and target indicators. Experimental comparisons showed that handmarkings have the potential to be faster than keyboards and mice for editing tasks. Their ultimate value will, however, depend on the style and details of their user-interface implementation.
Computer-aided modeling and planning (CAMP)
Authors: Ike Sagie
Venue: ACM Transactions on Mathematical Software (TOMS) (1986)

Many planning methods are based on mathematical modeling. A multitude of computer aids covers different facets of the planning activity: data management, linear programming, statistical analysis, graphics, and word processing. However, the diversity and complexity of the available software inhibit the widespread use of computers for planning. The integrated Computer-Aided Modeling and Planning (CAMP) system offers a simple and coherent tool for the planner. A Data Definition Language provides the means for building data banks; a Model Definition Language provides the means for defining mathematical models featuring abstract linear programming, advanced array arithmetics, and assertions; a Picture Definition Language facilitates formation of tables and diagrams; a Text Definition Language combines word processing with illustrations of modeling results. The man-machine interface is based on interactive panels for controlling the planning process and on a command language for analyzing modeling results. A multilingual capability allows selection of the national language for interfacing with the system. The architecture of CAMP is presented, and its design, implementation, and use in regional planning are discussed.
Trading group theory for randomness
Authors: L Babai
Venue: Proceedings of the seventeenth annual ACM symposium on Theory of computing (1985)

In a previous paper [BS] we proved, using the elements of the theory of nilpotent groups, that some of the fundamental computational problems in matriz groups belong to NP. These problems were also shown to belong to coNP, assuming an unproven hypothesis concerning finite simple groups. The aim of this paper is to replace most of the (proven and unproven) group theory of [BS] by elementary combinatorial arguments. The result we prove is that relative to a random oracle B, the mentioned matrix group problems belong to (NP&cap;coNP)B. The problems we consider are membership in and order of a matrix group given by a list of generators. These problems can be viewed as multidimensional versions of a close relative of the discrete logarithm problem. Hence NP&cap;coNP might be the lowest natural complexity class they may fit in. We remark that the results remain valid for black box groups where group operations are performed by an oracle. The tools we introduce seem interesting in their own right. We define a new hierarchy of complexity classes AM(k) &ldquo;just above NP&rdquo;, introducing Arthur vs. Merlin games, the bounded-away version of Papdimitriou's Games against Nature. We prove that in spite of their analogy with the polynomial time hierarchy, the finite levels of this hierarchy collapse to AM=AM(2). Using a combinatorial lemma on finite groups [BE], we construct a game by which the nondeterministic player (Merlin) is able to convince the random player (Arthur) about the relation [G]=N provided Arthur trusts conclusions based on statistical evidence (such as a Slowly-Strassen type &ldquo;proof&rdquo; of primality). One can prove that AM consists precisely of those languages which belong to NPB for almost every oracle B. Our hierarchy has an interesting, still unclarified relation to another hierarchy, obtained by removing the central ingredient from the User vs. Expert games of Goldwasser, Micali and Rackoff.
Translation among WYSIWYG word processors in Chameleon
Authors: Sandra A. Mamrak, Craig L. Joseph
Venue: ACM SIGOIS Bulletin (1988)

There is a need for widespread exchange of electronic documents in domains as diverse as book publishing, automated offices, factories, and research laboratories. The broad variety of data representations, particularly data created by wysiwyg word processors, is an obstacle to this exchange. This paper describes how the Chameleon translation-generation system accommodates this class of electronic documents. A comparison to an existing commercial product, with similar functionality, is also presented.
Fortran 8X abridgement
Authors: S. Miyawaki
Venue: ACM SIGPLAN Fortran Forum (1987)

Shortly after the acceptance of ANSI X3. 9-1978 (FORTRAN 77) on April 3, 1978, a project proposal for the next Fortran standard was prepared and in 1979 the development cycle for Fortran 8x began. ANSI X3J3 Technical Committee, Fortran (X3J3) is responsible for producing an American standard Fortran language and the International Standards Organization, Working Group 5 (WG5) is responsible for producing an international standard. Since X3J3 had been involved with the technical development, WG5 became a review and advisory board. WG5, therefore, has the duty to ensure that the document is internationally acceptable.
Reasoning with worlds and truth maintenance in a knowledge-based programming environment
Authors: Robert Filman
Venue: Communications of the ACM (1988)

In traditional knowledge-based system development environments, the fundamental representational building blocks are mechanisms such as frames, rules, and attached procedures. The KEE system has been extended to include both a context (worlds) system and a truth maintenance system.
Interfacing UNIX to Data Communications Networks
Authors: Fabio Panzieri, Brian Randell
Venue: IEEE Transactions on Software Engineering (1985)

We propose an interface for use from within UNIX1 user programs for communicating over multiple and varied local and wide area networks. This interface aids the design of a distributed application program by hiding the actual communications protocols used over each network, and providing instead simple primitives for sending and receiving (possibly large) datagrams, using a simple standardized network addressing scheme based on a pair.
Footprints in the cache
Authors: Dominique Thiebaut, Harold S. Stone
Venue: ACM Transactions on Computer Systems (TOCS) (1987)

This paper develops an analytical model for cache-reload transients and compares the model to observations based on several address traces. The cache-reload transient is the set of cache misses that occur when a process is reinitiated after being suspended temporarily. For example, an interrupt program that runs periodically experiences a reload transient at each initiation. The reload transient depends on the cache size and on the sizes of the footprints in the cache of the competing programs, where a program footprint is defined to be the set of lines in the cache in active use by the program. The model shows that the size of the transient is related to the normal distribution function. A simulation based on program-address traces shows excellent agreement between the model and the observations.
Formal representation of a conceptual knowledge model for a database based expert system
Authors: Ramin Yasdi
Venue: Proceedings of the twenty-first annual conference on Computer personnel research (1985)

With the actual penetration of expert systems into the business world, the question is, how can expert systems be used to enhance the existing information systems with more intelligence in usage and operation. This interest is not surprising due to the advancement of the fifth generation of computer technology and avid interest in the field of Artificial Intelligence. This paper presents a conceptual model for analysing complex real world problems. The model, known as the Conceptual Knowledge Model (CKM), is represented by a Graphical &mdash; and Formal &mdash; Representation. The Graphical Representation consists of three graphs: Conceptual Requirements Graph, Conceptual Behavior Graph, and Conceptual Structure Graph. These graphs are developed by involving the expert in the design process. The graphs are then transformed into first-order predicate logic to represent the logical axioms of a theory, which constitutes the knowledge base of the Expert System.
An Approach to Performance Specification of Communication Protocols Using Timed Petri Nets
Authors: Kumkum Garg
Venue: IEEE Transactions on Software Engineering (1985)

There has been a lot of interest in the past decade in using timed Petri nets to model computer systems. In this paper we show how such timed Petri nets can be used to great advantage in describing and algebraically specifying communication system performance. We make use of the time parameter of timed Petri nets to model the delay in performing certain operations of a communication protocol. The specification is borrowed from the recently reported AFFIRM language, and the protocol chosen for illustration is the ECMA transfer protocol, proposed for the ISO reference model. However, the methodology can be used with other protocols as well. We also show how liveness properties can be specified, easily using timed Petri nets.
Experience and evolution of concurrent Smalltalk
Authors: Yasuhiko Yokote, Mario Tokoro
Venue: Conference proceedings on Object-oriented programming systems, languages and applications (1987)

ConcurrentSmalltalk is an object-oriented concurrent programming language/system which has been running since late 1985. ConcurrentSmalltalk has the following features: Upper-compatibility with Smalltalk-80. Asynchronous method calls and CBox objects yield concurrency. Atomic objects have the property of running one at a time so that it can serialize the many requests sent to it. Through experience in writing programs, some disadvantages have become apparent related to concurrency control and the behavior of a block context. In this paper, these issues are re-examined in detail, and then the evolution of the solutions for overcoming these shortcomings is described along with the model of computation in ConcurrentSmalltalk. New features are explained with an example program. The implementation of the ConcurrentSmalltalk virtual machine is also presented along with the evaluation of it.
A computer with low-level parallelism QA-2: its applications to 3-D graphics and Prolog/Lisp machines
Authors: S. Tomita, K. Shibayama, T. Nakata, S. Yuasa, H. Hagiwara
Venue: Proceedings of the 13th annual international symposium on Computer architecture (1986)

We proposed a computer with low-level parallelism as one of the basic computer architectures and built a large scale experimental system called QA-2. By low-level parallelism, we mean that a long-word instruction controls simultaneously many ALUs, busses, registers and memories in a mode of fine-grained parallelism. The QA-2 employs a 256-bit instruction by which four different ALU operations, four memory accesses to different/continuous locations and one powerful sequence control are all specified and performed in parallel. If many simultaneously executable operations are detected and embedded in one instruction at compile time, this type of computer can provide a high-degree of performance for a wide variety of applications. This paper describes the architectural benefits and limitations of low-level parallelism in performing 3-D color image generation and interpreting Prolog/Lisp programs. The hardware organization with four ALUs, which are actually implemented in the QA-2, is verified to be adequate. In fact, nearly three out of four ALUs can work in parallel. Any architecture with more than four ALUs can not achieve a significant degree of performance enhancement. This paper also shows the degree of performance improvement achieved by the techniques such as ALU chaining and highly-structured sequence control mechanisms. As compared with the IBM 370 architecture, the QA-2 can generate 3-D color images in 1/5 of dynamic instruction steps. The compiler version of Prolog machine on the QA-2 is as fast (45K LIPS) as the ICOT's PSI. From all results, we expect that the QA-2 is a high-performance computer which will be utilized in the future personal computing environment.