ppxscal/embedding_network huggingface dataset:
Concepts of the System/370 vector architecture
Authors: B. Moore, A. Padegs, R. Smith, W. Buchholz
Venue: Proceedings of the 14th annual international symposium on Computer architecture (1987)

This paper discusses the performance, complexity and system-integration considerations that shaped the System/370 Vector Architecture [1, 9]. The architecture is intended for compatible systems providing a range of price and performance. The paper reviews the reasons for choosing a register-oriented architecture with compound instructions over storage-to-storage operations and vector-instruction chaining. Then it discusses the role of cache in stride-N storage accessing, and describes some new facilities introduced for control-program purposes.
The UNIVAC SHORT CODE
Authors: William F. Schmitt
Venue: IEEE Annals of the History of Computing (1988)

The UNIVAC SHORT CODE, the first example of a high level programming language actually intended to be used with an electronic computer was proposed by John W. Mauchly in July 1949. SHORT CODE was implemented as an interpreter by W.F. Schmitt and was first run on UNIVAC I Serial 1 in 1950. A revised version prepared in 1952 by A.B. Tonik and J.R. Logan still exists and is described with some examples. Some of Mauchly's thoughts on programming at that time are set forth in a previously unpublished fragment attached as an appendix.
Embedding boolean expressions into logic programming
Authors: Wolfram Buttner, Helmut Simonis
Venue: Journal of Symbolic Computation (1987)

Boolean expressions play a major role in computer science. They can be used to represent sets, formulas of propositional logic and digital circuits. In this paper we present an algorithm to compute the most general unifier (mgu) of boolean expressions, which is unique, if it exists. The fact that there is always at most one mgu, i.e. the theory of boolean expressions is unitary, is of particular importance for the embedding of the data type 'boolean expression' into logic programming. First experiemes with an integration into a PROLOG system are shown.
The next 15 years of computer technology in Korea
Authors: S. Y. Bang
Venue: Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow (1987)

In this report the long-range plan to advance the computer technology in Korea is presented. This plan actually is part of the entire science and technology advancement plan recently finalized by Ministry of Science and Technology of Korea. The advancement of the entire science and technology is necessitated by the requirement of the shift in the industrial structure from labor intensive oriented to technology oriented sectors. Overall objective of the plan is to advance the information industry in Korea to the level of those in advanced countries. In order to achieve the objective, the plan in turn sets the objectives for each technology of computer, communication, software and semiconductor. Among them this paper highlights computer technology and software technology. For each technology the paper presents the analysis of the current status, the objectives to be achieved in the next 15 years and the candidate projects to be executed to accomplish the objectives.
Linear Dependencies in Linear Feedback Shift Registers
Authors: C L Chen
Venue: IEEE Transactions on Computers (1986)

Linear feedback shift registers have been proposed to generate test patterns for the self-test of logic networks. The probability of linear dependence among k bit positions of a subset of k bits in a maximum length shift register sequence is an outstanding problem. In this correspondence, we derive a formula for the calculation of the probability.
A fair share scheduler
Authors: J. Kay, P. Lauder
Venue: Communications of the ACM (1988)

Central-processing-unit schedulers have traditionally allocated resources fairly among processes. By contrast, a fair Share scheduler allocates resources so that users get their fair machine share over a long period.
Delay-Independent Design for Distributed Systems
Authors: Gregor Bochmann
Venue: IEEE Transactions on Software Engineering (1988)

Methods of limiting the impact of communication delays on the logical behavior of distributed systems are considered. It is assumed that a distributed system is described in terms of a number of interconnected modules, and each module is described in terms of its possible states and the possible state transitions. Transitions may be initiated spontaneously by a module and may give rise to output messages, which will be received, after some possible delay, by another module as an input. Otherwise, transitions may be initiated by received input. If the system has the property called regularity, its behavior is logically independent of the communication delays. A simple condition for regularity is given. This condition is the basis for the implementation of counter-based synchronization conditions in a distributed environment. Weaker forms of regularity, which make abstraction of internal operations invisible from the point of view of an outside observer, are also considered. The application of these concepts to the design of module interfaces involving 'collisions' and to communication including timeouts is discussed in some detail with examples.
Pygmalion at the interface
Authors: Brian M. Slator, Matthew P. Anderson, Walt Conley
Venue: Communications of the ACM (1986)

Appropriate mnemonic feedback built into a natural-language interface can act as a teacher to help users acquire formal-language skills as they work, without a large initial investment of effort in a learning period.
Querying part hierarchies: a knowledge-based approach
Authors: A. Rosenthal, S. Heiler
Venue: Proceedings of the 24th ACM/IEEE Design Automation Conference (1987)

Part Hierarchies are a fundamental datatype in CAD applications. But intelligent and efficient processing requires major extensions to DBMS data models, query languages, and processing algorithms. We explore formulations and execution algorithms for path-traversal queries. Hierarchy semantics are then exploited for spatial data and to intelligently choose an appropriate detail level for query output.
Design of Fast Self-Testing Checkers for a Class of Berger Codes
Authors: S. J. Piestrak
Venue: IEEE Transactions on Computers (1987)

The Berger codes are optimal separable codes that detect all undirectional errors. In this correspondence a new procedure of designing self-testing checkers (STC's) for codes with I information bits, where I = {2K-2, 2K-l} and I = 3, is proposed. I = 3. The new checker is basically composed of u = ?(I + 1)/2? STC's for m-out-of-n codes with n = I + 1 and m = 2p + 1, O = p = u
An Approach and Mechanism for Auditable and Testable Advanced Transaction Processing Systems
Authors: Roger D. Schultz, Alfonso F. Cardenas
Venue: IEEE Transactions on Software Engineering (1987)

An architectural approach and a software mechanism is presented to enhance the auditability and testability of advanced transaction processing EDP systems. A high degree of auditability can be achieved through integrated support of auditability mechanisms as opposed to the traditional after-the-fact, ad hoc, add-on audit and test approaches. A programmable audit evidence gathering mechanism called an audit probe is proposed. A generic model of the audit probe is presented and its major features outlined. Audit hooks are proposed as standard probe interfaces for audit software. An overview of a high level audit-oriented audit probe definition language (APDL) for specifying the evidence gathering requirements for audit is highlighted. Audit test concurrent with the normal operation of the system and the capability of filtering only selected audit data are advocated. An example is presented illustrating the use of APDL and its value to auditing and quality control.
Collection and analysis of data from communication system networks
Authors: Ronald E. Rice
Venue: Proceedings of the ACM SIGOIS and IEEECS TC-OA 1988 conference on Office information systems (1988)

This paper provides a brief overview of a new, limited and specific direction in the study of computer-based information systems: the study of communication networks by means of computer-monitored usage and content. This area of research is the result of the interaction of two foci in recent research: (1) the increasing use of computer-mediated communication systems in organizations, and (2) the conceptualization of communication as a process of convergence, or networks of relations.
Word games and search spaces
Authors: G. Alan Creak
Venue: Issue 103 (Jan., 1988) (1988)

When teaching artificial intelligence, it is not always easy to find convincing illustrations. I have sometimes found it quite hard to provide illuminating examples of fundamental topics which I wish to introduce early in the course - such as learning, heuristics, search spaces, and the like.
A structural approach to the maintenance of structure-oriented environments
Authors: Barbara J Staudt, Charles W Krueger, David Garlan
Venue: Proceedings of the second ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments (1987)

A serious problem for programming environments and operating systems is that existing software becomes invalid when the environment or operating system is replaced by a new release. Unfortunately, there has been no systematic treatment of the problem; current approaches are manual, ad hoc, and time consuming both for implementers of programs and for their users. In this paper we present a new approach. Focusing on a solution to the problems for structure-oriented environments, we show how automatic converters can be generated in terms of an implementor's changes to formal descriptions of these environments.
Computer graphics course recommendations in computer science education
Authors: Mark R Ohlson
Venue: ACM SIGGRAPH Computer Graphics (1986)

The SIGGRAPH education committee has been considering recommedations for inclusion of graphics in various curricula for higher education. Several issues of computer graphics in computer science or computer science/engineering curricula are identified here. Recommendations as outlined in this paper are being prepared through the SIGGRAPH education committee, and feedback by interested parties is needed and encouraged. Emphasis is on the enlarged scope of material available for graphics courses, and the need to identify legitimate "core" material for all undergraduates and elective material for students with strong interest in graphics specialization.
Mathematical modeling and Ada simulation of some synchronization processes
Authors: Martin D. Fraser, Ross A. Gagliano
Venue: Proceedings of the 20th annual symposium on Simulation (1987)

Previously, a simulation model was proposed for the purpose of investigating synchronization, a phenomenon which is demonstrated in the well-known Rope Game (or Tug-of-War). Synchronous activity is evident in so-called self-organizing systems, particularly muscle and brain tissues. This paper gives an exact matrix description of the rope model and shows that study of the synchronous behavior of this model can be done by applying Markov chain analysis. In modeling neural networks, however, such features as refraction, inhibition, noise, and discrete neuron responses frequently are incorporated in simulation models. Simulations are presented that indicate certain neural network models can be more simply modeled in part using a matrix representation similar to that for the rope game. A lemma is proved and used to obtain a formula for neuron firing expected in steady state.
A Flexible Vision-Based Algorithm for a Book Sorting System
Authors: Toshiyuki Gotoh, Takashi Toriu, Shigeru Sasaki, Masumi Yoshida
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1988)

A flexible vision-based algorithm for a book sorting system is presented. The algorithm is based on a discrimination model that is adaptively generated for the current object classes by learning. The algorithm consists of an image normalization process, a feature element extraction process, a learning process, and a recognition process. The image normalization process extracts the contour of the object in an image, and geometrically normalizes the image. The feature extraction process converts the normalized image to the pyramidal representation, and the feature element is extracted from each resolution level. The learning process generates a discrimination model, which represents the differences between classes, based on hierarchical clustering. In the recognition process, the input images are hierarchically discriminated under the control of the decision tree. To evaluate the algorithm, a simulation system was implemented on a general-purpose computer and an image processor was developed.
A model curriculum for a liberal arts degree in computer science
Authors: Norman E. Gibbs, Allen B. Tucker
Venue: Communications of the ACM (1986)

This report proposes developing a rigorous undergraduate curriculum for a B.A.-degree program in computer science. The curriculum is intended as a model not only for high-quality undergraduate colleges and universities, but also for larger universities with strong computer science programs in a liberal arts setting.
Expressions for batched searching of sequential and hierarchical files
Authors: Prashant Palvia
Venue: ACM Transactions on Database Systems (TODS) (1985)

Batching yields significant savings in access costs in sequential, tree structured, and random files. A direct and simple expression is developed for computing the average number of records/pages accessed to satisfy a batched query of a sequential tile. The advantages of batching for sequential and random files are discussed. A direct equation is provided for the number of nodes accessed in unhatched queries of hierarchical files. An exact recursive expression is developed for node accesses in batched queries of hierarchical files. In addition to the recursive relationship, good, closed-form upper- and lower-bound approximations are provided for the case of batched queries of hierarchical files.
OBJEKT&mdash;a persistent object store with an integrated garbage collector
Authors: D M Harland, B Beloff
Venue: ACM SIGPLAN Notices (1987)

This paper describes OBJEKT, a single-level persistent storage system designed for the REKURSIV architecture.It will be shown that OBJEKT can be microcoded to implement "objects" efficiently, and that data integrity can be guaranteed by provision of an object oriented instruction set. Particular attention will be paid to its facilities for type and range checking, to its object by- object paging strategy and to ways of enhancing parallelism during garbage collection.
A linear time algorithm for optimal routing around a rectangle
Authors: Teofilo F. Gonzalez, Sing-Ling Lee
Venue: Journal of the ACM (JACM) (1988)

The problem of connecting a set of terminals that lie on the sides of a rectangle to minimize the total area is discussed. An O(n) algorithm is presented to solve this problem when the set of n terminals is initially sorted. The strategy in this paper is to reduce the problem to several problems such that no matter what instance is started with, at least one of these problems can be solved optimally by a greedy method.
Fast temporary storage for serial and parallel execution
Authors: J. Swensen, Y. Patt
Venue: Proceedings of the 14th annual international symposium on Computer architecture (1987)

There is an apparent conflict between the hardware requirements for fast parallel execution and the hardware requirements for fast serial execution. For example, fast vector execution is achieved by maintaining high execution concurrency over extended periods of time. With many operations executing in parallel, the time to carry out individual operations is much less important than the average execution concurrency.Fast serial execution, on the other hand, requires rapid execution of relatively few operations at a time; hardware concurrency can be sacrificed in favor of short execution times. Fewer registers and memory locations are required, but they must have shorter access times than for parallel execution.We show how to integrate these seemingly conflicting requirements into a single computer, using asymmetric distribution of hardware, and sometimes using software to allocate variables to appropriate parts of the storage hierarchy.
VISTA: Visual Interpretation System for Technical Applications-Architecture and Use
Authors: D. Paul, W. Hättich, W. Nill, S. Tatari, G. Winkler
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1988)

The present state of the construction of a vision system for the fast interpretation of complicated industrial scenes is reported. The system is being built at the Fraunhofer Institute for Information and Data Process in Karlsruhe, West Germany. The scenes for which the system is intended are also presented. They form the basis for specifying the requirements for the system called VISTA. Its principal architecture as a bus-oriented multiprocessor system is discussed. Some special hardware modules of VISTA are described in more detail, and its basic software concept is introduced. As an application, detection and classification of defects that appear in automatic visual inspection of hard wood are reviewed. Using special modules for the iconic and the symbolic stage, VISTA is capable of real-time processing and evaluation of endless images, image sequences, images of various formats, and multisensorial data.
Locking performance in centralized databases
Authors: Y. C. Tay, Nathan Goodman, R. Suri
Venue: ACM Transactions on Database Systems (TODS) (1985)

An analytic model is used to study the performance of dynamic locking. The analysis uses only the steady-state average values of the variables. The solution to the model is given by a cubic, which has exactly one valid root for the range of parametric values that is of interest. The model's predictions agree well with simulation results for transactions that require up to twenty locks. The model separates data contention from resource contention, thus facilitating an analysis of their separate effects and their interaction. It shows that systems with a particular form of nonuniform access, or with shared locks, are equivalent to systems with uniform access and only exclusive locks. Blocking due to conflicts is found to impose an upper bound on transaction throughput; this fact leads to a rule of thumb on how much data contention should be permitted in a system. Throughput can exceed this bound if a transaction is restarted whenever it encounters a conflict, provided restart costs and resource contention are low. It can also be exceeded by making transactions predeclare their locks. Raising the multiprogramming level to increase throughput also raises the number of restarts per completion. Transactions should minimize their lock requests, because data contention is proportional to the square of the number of requests. The choice of how much data to lock at a time depends on which part of a general granularity curve the system sees.
Strongly Fault Secure PLAs and Totally Self-Checking Checkers
Authors: Yinghua Min, Jintao Li
Venue: IEEE Transactions on Computers (1988)

A general approach is presented to the design of totally self-checking (TSC) programmable logic arrays (PLAs). A strongly fault secure (SFS) implementation is suggested for the functional PLA, which is shown to be SFS whenever the output is encoded by two-rail code. K-unit TSC checker (TSCC) element are defined to construct TSC checkers. The TSCC is very appropriate for the companion of the SLF PLA since a given input codeword set is sufficient for testing the TSCC. The minimum number of tests needed for a type-m two-rail code K-unit TSCC is 12/sup m/. This is a generalization of the fact that four test patterns are sufficient for testing an XOB parity checker tree. As an application, a novel design of a TSC comparator with an arbitrary number of inputs is presented.
Finite monoids and the fine structure of NC1
Authors: D. Barrington, D. Therien
Venue: Proceedings of the nineteenth annual ACM symposium on Theory of computing (1987)

Recently a new connection was discovered between the parallel complexity class NC1 and the theory of finite automata, in the work of Barrington [Ba86] on bounded width branching programs. There (non-uniform) NC1 was characterized as those languages recognized by a certain non-uniform version of a DFA. Here we extend this characterization to show that the internal structures of NC1 and the class of automata are closely related. In particular, using Th&eacute;rien's classification of finite monoids [Th81], we give new characterizations of the classes AC0, depth-k AC0, and ACC, the last being the AC0 closure of the mod q functions for all constant q. We settle some of the open questions in [Ba86], give a new proof that the dot-depth hierarchy of algebraic automata theory is infinite [BK78], and offer a new framework for understanding the internal structure of NC1.
Processing dictionary definitions with phrasal pattern hierarchies
Authors: Hiyan Alshawi
Venue: Computational Linguistics (1987)

This paper shows how dictionary word sense definitions can be analysed by applying a hierarchy of phrasal patterns. An experimental system embodying this mechanism has been implemented for processing definitions from the Longman Dictionary of Contemporary English. A property of this dictionary, exploited by the system, is that it uses a restricted vocabulary in its word sense definitions. The structures generated by the experimental system are intended to be used for the classification of new word senses in terms of the senses of words in the restricted vocabulary. Examples illustrating the output generated are presented, and some qualitative performance results and problems that were encountered are discussed. The analysis process applies successively more specific phrasal analysis rules as determined by a hierarchy of patterns in which less specific patterns dominate more specific ones. This ensures that reasonable incomplete analyses of the definitions are produced when more complete analyses are not possible, resulting in a relatively robust analysis mechanism. Thus the work reported addresses two robustness problems faced by current experimental natural language processing systems: coping with an incomplete lexicon and with incomplete knowledge of phrasal constructions.
A commitment-based communication model for distributed office environments
Authors: Charles C. Koo
Venue: Proceedings of the ACM SIGOIS and IEEECS TC-OA 1988 conference on Office information systems (1988)

In an office environment where agents cooperate to accomplish a certain tasks, the agents perform their tasks based on certain plans. To ensure the integrity of their teamwork, agents communicate with one another to coordinate their plans. Meanwhile, tasks are distributed to other agents via this communication process. This report describes a commitment-based communication model for autonomous agents to synchronize and track their activities in office environments. The communication model includes a communication process, a set of protocols to bind commitments, a set of communication operators and a set of commitment tracking operators.
Bureaucracies as deontic systems
Authors: Ronald M. Lee
Venue: ACM Transactions on Information Systems (TOIS) (1988)

Bureaucratic offices are not only for clerical work, but more important, they are for officiating in the sense of issuing directives, granting permissions, enforcing prohibitions, waiving obligations, and so forth. Bureaucracies are thus deontic systems for organizational and social control. Conventional information processing approaches are inadequate for capturing these aspects of bureaucratic modeling. A logic-based representation that emphasizes deontic and performative aspects is proposed.