ppxscal/embedding_network huggingface dataset:
A shared, segmented memory system for an object-oriented database
Authors: Mark F. Hornick, Stanley B. Zdonik
Venue: ACM Transactions on Information Systems (TOIS) (1987)

This paper describes the basic data model of an object-oriented database and the basic architecture of the system implementing it. In particular, a secondary storage segmentation scheme and a transaction-processing scheme are discussed. The segmentation scheme allows for arbitrary clustering of objects, including duplicates. The transaction scheme allows for many different sharing protocols ranging from those that enforce serializability to those that are nonserializable and require communication with the server only on demand. The interaction of these two features is described such that segment-level transfer and object-level locking is achieved.
A model of organizational communications
Authors: Mary R. Lind
Venue: ACM SIGMIS Database (1987)

The study of organizational communications has proceeded without a widely accepted model. In this paper a framework of analysis for organizational communication is presented. It is based on the OSI model of data communication which was developed as a standard model to guide data communications systems development. The OSI model is composed of seven layers that each have responsibility for various aspects of data communications. Using this model as a guide, comparisons are made to an organizational communication network resulting in a model of organizational communications.
Some experiments in object-oriented simulation
Authors: Jean Bezivin
Venue: ACM SIGPLAN Notices (1987)

Discrete event simulation has been a constant source of inspiration for language designers. The present interest in Object-Oriented Programming (O.O.P.) can be traced back to the Simula 67 language. In return, simulation languages are currently getting back many advantages from the ongoing research in O.O.P. One of the main present research trends is the possibility of concurrently executing a simulation program composed of a set of interacting and communicating objects. Conditions which will make this possible are discussed together with some induced problems. More precisely this paper presents some experiments in object-oriented simulation that reveal the great flexibility of the Smalltalk-801 programming system for building evaluation environments.
Min-max heaps and generalized priority queues
Authors: M. D. Atkinson, J.-R. Sack, B. Santoro, T. Strothotte
Venue: Communications of the ACM (1986)

A simple implementation of double-ended priority queues is presented. The proposed structure, called a min-max heap, can be built in linear time; in contrast to conventional heaps, it allows both FindMin and FindMax to be performed in constant time; Insert, DeleteMin, and DeleteMax operations can be performed in logarithmic time. Min-max heaps can be generalized to support other similar order-statistics operations efficiently (e.g., constant time FindMedian and logarithmic time DeleteMedian); furthermore, the notion of min-max ordering can be extended to other heap-ordered structures, such as leftist trees.
Efficient evaluation for a subset of recursive queries
Authors: G. Grahne, S. Sippu, E. Soisalon-Soininen
Venue: Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (1987)

Well-known results on graph traversal are used to develop a practical, efficient algorithm for evaluating regularly and linearly recursive queries in databases that contain only binary relations. Transformations are given that reduce a subset of regular and linear queries involving n-ary relations (n > 2) to queries involving only binary relations.
A statistical similarity measure
Authors: S. K. M. Wong, Y. Y. Yao
Venue: Proceedings of the 10th annual international ACM SIGIR conference on Research and development in information retrieval (1987)

Within the framework of the vector space models, a statistical similarity measure between document and query is proposed. In this approach the assumption that term (or atomic) vectors are pairwise orthogonal is not required. In addition, it provides a natural and consistent interpretation of term occurrence frequencies obtained from autoindexing.
The circle-brush algorithm
Authors: K. C. Posch, W. D. Fellner
Venue: ACM Transactions on Graphics (TOG) (1988)

Brushing commonly refers to the drawing of curves with various line widths in hit-mapped graphics systems. It is best done with circles of suitable diameter so that a constant line width, independent of the curve's slope, is obtained. Allowing all possible integer diameters corresponding to all possible integer line widths results in every second width having an odd value. Thus, the underlying circle algorithm must be able to handle both integer and half-integer radii. Our circle-brush algorithm handles both situations and produces a &ldquo;best approximation&rdquo;: All grid points produced simultaneously minimize (1) the residual, (2) the Euclidean distance to the circle, and (3) the displacement along the grid line from the intersection with the circle. Our circle-brush algorithm was developed in careful consideration of its implementation in VLSI.
Review of the environments symposium
Authors: K Reed
Venue: ACM SIGSOFT Software Engineering Notes (1987)

This Report deals with the recent Software Development Environment symposium, examining what were, in the author's view, the significant papers, and issues which arose during the panel sessions. It also comments on some aspects of SDE design, and the absence of "hard" data on the effectiveness of SDEs presented during the symposium.
Operating system design: towards a holistic approach?
Authors: John R Nicol, Gordon S Blair, Jonathan Walpole
Venue: ACM SIGOPS Operating Systems Review (1987)

Recent years have marked the beginning of a new era for operating systems. Distributed computing is clearly one dimension of this. We argue that qualitative issues add a second major dimension. These changes will have a profound effect on operating system design. In this short paper, we present a personal view of what the response to these changes should be. The argument is supported by our experiences in the design of the Cosmos distributed operating system.
The perils of top-down design
Authors: Richard A. Zahniser
Venue: ACM SIGSOFT Software Engineering Notes (1988)

Classic top-down design, which defines the system as a set of subsets of progressively more detailed functions, is the primary technique used in defining software components during requirements definition. This early "design", enforced by two major standards, is frequently used to assign work to development teams, which sometimes has a DISASTROUS effect on the overall system development effort.
Optimal Diagnosable System Design Using Full-Difference Triangles
Authors: N F Maxemchuk, A T Dahbura
Venue: IEEE Transactions on Computers (1986)

In the literature on diagnosable multiprocessor systems, regular testing structures which isolate up to t1 faulty processors to within a set of t1 processors have been studied. These structures are called D(n, t0, X) systems and are said to be t1/t1-diagnosable. In this correspondence, the problem of designing regular testing structures which isolate the largest number of faulty processors is shown to be equivalent to determining full-difference triangles. These triangles have been used to design error-correcting convolutional codes and transmission systems without third-order intermodulation interference, and have been studied extensively. Recognizing this relationship allows results from these areas to be applied directly to the design of diagnosable systems. A list of the best-known systems is given.
Constructive solid geometry for polyhedral objects
Authors: David H. Laidlaw, W. Benjamin Trumbore, John F. Hughes
Venue: ACM SIGGRAPH Computer Graphics (1986)

Constructive Solid Geometry (CSG) is a powerful way of describing solid objects for computer graphics and modeling. The surfaces of any primitive object (such as a cube, sphere or cylinder) can be approximated by polygons. Being abile to find the union, intersection or difference of these objects allows more interesting and complicated polygonal objects to be created. The algorithm presented here performs these set operations on objects constructed from convex polygons. These objects must bound a finite volume, but need not be convex. An object that results from one of these operations also contains only convex polygons, and bounds a finite volume; thus, it can be used in later combinations, allowing the generation of quite complicated objects. Our algorithm is robust and is presented in enough detail to be implemented.
Public protection of software
Authors: Amir Herzberg, Shlomit S. Pinter
Venue: ACM Transactions on Computer Systems (TOCS) (1987)

One of the overwhelming problems that software producers must contend with is the unauthorized use and distribution of their products. Copyright laws concerning software are rarely enforced, thereby causing major losses to the software companies. Technical means of protecting software from illegal duplication are required, but the available means are imperfect. We present protocols that enable software protection, without causing substantial overhead in distribution and maintenance. The protocols may be implemented by a conventional cryptosystem, such as the DES, or by a public key cryptosystem, such as the RSA. Both implementations are proved to satisfy required security criteria.
Worst-case optimal hidden-surface removal
Authors: Michael McKenna
Venue: ACM Transactions on Graphics (TOG) (1987)

An O(n2) hidden-surface removal algorithm is shown. This is an improvement over the previous best worst-case performance of O(n2 log n). It has been established that the hidden-line and hidden-surface problems have an &OHgr;(n2) worst-case lower bound, so the algorithm is optimal. However, the algorithm is not output-size sensitive. Two corollaries to the result are (1) hidden-lines can be removed in optimal O(n2) time, and (2) the portion of a 3-D polyhedron visible from a given interior point is constructible in optimal O(n2) time.
Experience with Flamingo: a distributed, object-oriented user interface system
Authors: David B. Anderson
Venue: ACM SIGPLAN Notices (1986)

The Flamingo Window Management System is based on a remote method invocation mechanism that provides separate processes running in a heterogeneous, distributed computing environment with complete access to Flamingo's objects and methods. This object-oriented interface has made Flamingo a kernel window manager into which device drivers, graphics libraries, window managers and user interfaces can be dynamically loaded. This paper discusses the strengths and weaknesses of Flamingo's system architecture, and introduces a new architecture which will provide a network-wide object space with object protection, migration, and garbage collection.
Fast object partitioning using Stochastic learning automata
Authors: B. J. Oommen, D. Ma
Venue: Proceedings of the 10th annual international ACM SIGIR conference on Research and development in information retrieval (1987)

Let &OHgr; = {A1, &hellip;, AW} be a set of W objects to be partitioned into R classes {P1, &hellip;, PR}. The objects are accessed in groups of unknown size and the size of these groups need not be equal. Additionally, the joint access probabilities of the objects are unknown. The intention is that the objects accessed more frequently together are located in the same class. This problem has been shown to be NP-hard [15, 16]. In this paper, we propose two stochastic learning automata solutions to the problem. Although the first one is relatively fast, its accuracy is not so remarkable in some environments. The second solution, which uses a new variable structure stochastic automation, demonstrates an excellent partitioning capability. Experimentally, this solution converges an order of magnitude faster than the best known algorithm in the literature [15, 16].
Usage patterns in an integrated voice and data communications system
Authors: Robert T. Nicholson
Venue: ACM Transactions on Information Systems (TOIS) (1985)

Recently, office communication systems have begun to integrate voice recordings into their mail and data communications facilities. The study of usage patterns on one such system shows that voice is used for informal, person-to-person communications, as opposed to the formal content of typed messages. Voice messages are generally sent to fewer recipients (often only one), and sometimes replace face-to-face meetings.
The complexity of perfect zero-knowledge
Authors: L. Fortnow
Venue: Proceedings of the nineteenth annual ACM symposium on Theory of computing (1987)

A Perfect Zero-Knowledge interactive proof system convinces a verifier that a string is in a language without revealing any additional knowledge in an information-theoretic sense. We show that for any language that has a perfect zero-knowledge proof system, its complement has a short interactive protocol. This result implies that there are not any perfect zero-knowledge protocols for NP-complete languages unless the polynomial time hierarchy collapses. This paper demonstrates that knowledge complexity can be used to show that a language is easy to prove.
On the Implementation and Use of Ada on Fault-Tolerant Distributed Systems
Authors: J. C. Knight, J. I. A. Urquhart
Venue: IEEE Transactions on Software Engineering (1987)

In this paper, we discuss the use of Ada® on distributed systems in which failure of processors has to be tolerated. We assume that tasks are the primary object of distribution, and that communication between tasks on separate processors will take place using the facilities of the Ada language. It would be possible to build a separate set of facilities for communication between processors, and to treat the software on each machine as a separate program. This is unnecessary and undesirable. In addition, the Ada language Reference Manual states specifically that a system consisting of communicating processors with private memories is suitable for executing an Ada program.
Taking &ldquo;computer literacy&rdquo; literally
Authors: Carolynn Van Dyke
Venue: Communications of the ACM (1987)

Computer literacy implies an analogy between computer-related skills and linguistic literacy that has not been seriously explored. Recent studies of linguistic literacy can illuminate the definition of computer literacy and can suggest new ways of teaching it.
Shortest Semijoin Schedule for a Local Area Distributed Database System
Authors: S. Masuyama, T. Ibaraki, S. Nishio, T. Hasegawa
Venue: IEEE Transactions on Software Engineering (1987)

The semijoin provides a means of reducing the amount of data transmission among sites in a distributed database system. Previously the semijoin has been studied mainly for reducing communication cost in an environment with global public communication networks. In a local area system, however, wide bandwidth is usually available and the communication cost is virtually negligible. In view of this, we adopt a simplified model of a local area network, imposing no constraint on the transmission line capacity and the communication processing capability at each site. For this model, an efficient algorithm for obtaining the shortest semijoin schedule, in the sense of minimizing the total number of semijoin transmissions, is developed. It is based on a schedule diagram newly introduced to represent the semijoin schedule.
The scope of APL in nuclear measurements
Authors: C. Bastian
Venue: ACM SIGAPL APL Quote Quad (1986)

The whole range of data acquisition and analysis in experimental nuclear physics can be covered with a few APL application workspaces. Typical steps of the treatment of statistical data are highlighted and compared with nearly-equivalent solutions in other languages.
IFO: a formal semantic database model
Authors: Serge Abiteboul, Richard Hull
Venue: ACM Transactions on Database Systems (TODS) (1987)

A new, formally defined database model is introduced that combines fundamental principles of &ldquo;semantic&rdquo; database modeling in a coherent fashion. Using a graph-based formalism, the IFO model provides mechanisms for representing structured objects, and functional and ISA relationships between them. A number of fundamental results concerning semantic data modeling are obtained in the context of the IFO model. Notably, the types of object structure that can arise as a result of multiple uses of ISA relationships and object construction are described. Also, a natural, formal definition of update propagation is given, and it is shown that (under certain conditions) a correct update always exists.
Faster methods for random sampling
Authors: Jeffrey Scott Vitter
Venue: Communications of the ACM (1984)

Several new methods are presented for selecting n records at random without replacement from a file containing N records. Each algorithm selects the records for the sample in a sequential manner&mdash;in the same order the records appear in the file. The algorithms are online in that the records for the sample are selected iteratively with no preprocessing. The algorithms require a constant amount of space and are short and easy to implement. The main result of this paper is the design and analysis of Algorithm D, which does the sampling in O(n) time, on the average; roughly n uniform random variates are generated, and approximately n exponentiation operations (of the form ab, for real numbers a and b) are performed during the sampling. This solves an open problem in the literature. CPU timings on a large mainframe computer indicate that Algorithm D is significantly faster than the sampling algorithms in use today.
System = program + users + law
Authors: N. H. Minsky, D. Rozenshtein
Venue: Proceedings of the 1st international conference on Artificial intelligence and law (1987)

This paper is based on a new approach for dealing with large scale software systems. This approach is based on the concept of a Law-Governed System, which is a triple >program, users, law< where the law is an explicit and strictly enforced set of rules about the structure and operation of the program, and about the evolution of the entire system. We describe Darwin, a skeleton of a programming environment that supports our notion of law-governed systems. Darwin is based on the object-oriented programming paradigm and uses logic programming to express and enforce the law.
Commonsense metaphysics and lexical semantics
Authors: Jerry R. Hobbs, William Croft, Todd Davies, Douglas Edwards, Kenneth Laws
Venue: Computational Linguistics (1987)

In the TACITUS project for using commonsense knowledge in the understanding of texts about mechanical devices and their failures, we have been developing various commonsense theories that are needed to mediate between the way we talk about the behavior of such devices and causal models of their operation. Of central importance in this effort is the axiomatization of what might be called "commonsense metaphysics". This includes a number of areas that figure in virtually every domain of discourse, such as granularity, scales, time, space, material, physical objects, shape, causality, functionality, and force. Our effort has been to construct core theories of each of these areas, and then to define, or at least characterize, a large number of lexical items in terms provided by the core theories. In this paper we discuss our methodological principles and describe the key ideas in the various domains we are investigating.
An intelligent compiler subsystem for a silicon compiler
Authors: D. L. Johannsen, S. K. Tsubota, K McElvain
Venue: Proceedings of the 24th ACM/IEEE Design Automation Conference (1987)

This paper presents a module generator which automatically generates and optimizes circuitry to satisfy constraints of speed, area and power. The user has complete control over the clock timing driving the circuitry and the area, width, or height of the resulting module. Unlike other programs that have been optimized for area and speed, this program supports more degrees of freedom and a broad range of circuit constructs, permitting a complete integrated circuit to be designed to meet the overall IC project objectives.
The expanding equilibrium algorithm
Authors: Michael H. Schneider
Venue: ACM Transactions on Mathematical Software (TOMS) (1987)

Spatial-equilibrium models are the primary framework for applied equilibrium modeling and policy analysis. An effective procedure for solving single commodity problems is described based on a variable dimension, complementary pivoting algorithm of Jones, Saigal, and Schneider. An implementation of this approach called the expanding equilibrium algorithm is described using network data structures and sparse graphs. The data structure that is used presorts the graph to avoid using linked lists while maintaining the flexibility to add arcs to the graph as the algorithm is executing. A computational experiment is developed showing the algorithm's ability to exploit the problem's underlying network and economic structure. Computational results are presented for a computer code written in C and tested on a large-scale, randomly generated problem.
Conversion from data-driven to synchronous execution in loop programs
Authors: Janice E. Cuny, Lawrence Snyder
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1987)

Conversion algorithms are presented that would enable programmers to write programs in a high-level, data flow language and then run those programs on a synchronous machine. A model of interprocess communication systems is developed in which both data-driven and synchronous execution modes are represented. Balancing equations are used to characterize a subclass of parallel programs, called loop programs, for which conversions are possible. We show that all loop programs having the finite buffer property can be converted into synchronous mode. Finally two algorithms for the conversion of loop programs are presented and discussed.
Identity verification (authentication) working group
Authors: Tom Berson, P. Capek, J. Schweitzer, C. Weissman
Venue: ACM SIGSAC Review (1988)

Every reader of this report has at some time verified his or her identity to a computer system. Entry of a userid and password in response to computer prompting is the almost universal model for this simple but essential act.
Using objects to design and build radar ESM systems
Authors: Brian M. Barry, John R. Altoft
Venue: Conference proceedings on Object-oriented programming systems, languages and applications (1987)

This paper describes the application of object-oriented programming to the design of a multiprocessor ESM testbed. The ESM testbed uses an object-oriented development environment which integrates Smalltalk and C language tools with the Harmony real-time operating system in a shared memory multiprocessor. All development for an application is done using personal computers which are themselves processors in the real-time testbed. We first discuss two aspects of the ESM testbed: a framework for investigating ESM signal processing algorithms based on an object-oriented emitter database and blackboard objects which implement probabilistic reasoning; and an object-oriented ESM simulation environment which illustrates the use of object-oriented techniques for the development of complex real-time systems. In the second part of the paper we describe our software engineering approach and tools. Throughout the paper, the role played by object-oriented programming in the design of hybrid multiprocessors is highlighted.