ppxscal/embedding_network huggingface dataset:
A data management extension architecture
Authors: Bruce Lindsay, John McPherson, Hamid Pirahesh
Venue: ACM SIGMOD Record (1987)

A database management system architecture is described that facilitates the implementation of data management extensions for relational database systems. The architecture defines two classes of data management extensions alternative ways of storing relations called relation &ldquo;storage methods&rdquo;, and access paths, integrity constraints, or triggers which are &ldquo;attachments&rdquo; to relations. Generic sets of operations are defined for storage methods and attachments, and these operations must be provided in order to add a new storage method or attachment type to the system. The data management extension architecture also provides common services for coordination of storage method and attachment execution. This article describes the data management extension architecture along with some implementation issues and techniques.
Eliminating go to's while preserving program structure
Authors: Lyle Ramshaw
Venue: Journal of the ACM (JACM) (1988)

Suppose we want to eliminate the local go to statements of a Pascal program by replacing them with multilevel loop exit statements. The standard ground rules for eliminating go to's require that we preserve the flow graph of the program, but they allow us to completely rewrite the control structures that glue together the program's atomic tests and actions. The go to's can be eliminated from a program under those ground rules if and only if the flow graph of that program has the graph-theoretic property named reducibility. This paper considers a stricter set of ground rules, introduced by Peterson, Kasami, and Tokura, which demand that we preserve the program's original control structures, as well as its flow graph, while we eliminate its go to's. In particular, we are allowed to delete the go to statements and the labels that they jump to and to insert various exit statements and labeled repeat-endloop pairs for them to jump out of. But we are forbidden to change the rest of the program text in any way. The critical issue that determines whether go to's can be eliminated under these stricter rules turns out to be the static order of the atomic tests and actions in the program text. This static order can be encoded in the program's flow graph by augmenting it with extra edges. It can then be shown that the reducibility of a program's augmented flow graph, augmenting edges and all, is a necessary and sufficient condition for the eliminability of go to's from that program under the stricter rules.
In-house documentation in a small college
Authors: Mark Castner, Cathy Bacon
Venue: Proceedings of the 15th annual ACM SIGUCCS conference on User Services (1987)

Canisius College is a private, Jesuit college with about 2,500 day students and 2,000 evening students. There is one computer center serving both academic and administrative needs with a staff of 19 people. As a functional unit within the Computer Center, User Services consists of a manager, two programmer analysts, and a documentation librarian. We are responsible for three supervised public computing sites; an Apple lab, an IBM lab, and the main computing lab which contains Apples, IBM PCs and VAX terminals. There are two non-staffed public computing sites containing VAX terminals. To staff the labs, there is a minimum of 10 student consultants and about 35 site operators reporting to the Public Site Coordinator, a graduate assistant position usually filled by an MBA student. The staff of User Services supports instructional and research computing as well as administrative uses of microcomputers. We don't have the luxury to specialize in a particular type of computer, software, or user. Each of us needs to be familiar with much of the supported software and be ready to answer those quick questions from a variety of sources. Often, a well-written handout is the fastest and most effective way of doing this. A well-written handout is one you give to a person and you don't see that person again to explain the handout. This paper will describe the methods by which we develop, catalogue, and distribute what are hopefully well-written handouts. Documentation can be formal or informal. We are all familiar with the following scenario. Someone asks you a question. You go through the procedure with them and accomplish the task at hand. But for that person to perform this procedure on their own, the next day or a few months from now, what was done needs to be written down or, if appropriate, pointed out in the manual. The most accurate instructions are written as you work through the procedure, not after the procedure is done. But every question and every procedure can not become a formal document. So what should be documented? Obviously, handouts that address frequently asked questions are worthwhile and handouts that introduce new capabilities or methods to the user are valuable. Start with the application packages that are in heaviest use on your campus. The most common type of document is designed to get a person started on a software package. It provides the basics: how to start up the package, how to enter information, how to load, save and print the document or file. It does not cover more advanced topics
A randomized protocol for signing contracts
Authors: Shimon Even, Oded Goldreich, Abraham Lempel
Venue: Communications of the ACM (1985)

Randomized protocols for signing contracts, certified mail, and flipping a coin are presented. The protocols use a 1-out-of-2 oblivious transfer subprotocol which is axiomatically defined.The 1-out-of-2 oblivious transfer allows one party to transfer exactly one secret, out of two recognizable secrets, to his counterpart. The first (second) secret is received with probability one half, while the sender is ignorant of which secret has been received.An implementation of the 1-out-of-2 oblivious transfer, using any public key cryptosystem, is presented.
A tutorial on developing a computer-controlled camera system
Authors: Neil Sullivan, C Durward Rogers, Stephen Daniel
Venue: ACM SIGGRAPH Computer Graphics (1986)

A research organization or graphics house often has a need for custom pictures for presentations or other purposes. These pictures may be prohibitively expensive, if not impossible to create, if they are produced by a commercial art firm. For groups that have such a need, an in-house computer-controlled camera may be a solution. To develop a quality system, users will have to overcome a series of electronic, mechanical, photographic and computer-related hurdles. This tutorial deals with adjustments to the system in four classes to achieve the best possible pictures. The adjustments are for clean signal, image placement and focus, contrast and brightness, and software interface. In each case, common problems are discussed, some options are given, and the chosen solution is explained.
A conceptual programming environment
Authors: S. P. Reiss
Venue: Proceedings of the 9th international conference on Software Engineering (1987)

Conceptual programming means having programmers work directly with their models of how their system is put together. It means providing them with the means for designing, coding and maintaining systems on a computer using the pictures and text they normally use on paper. An environment for conceptual programming requires flexibility to support a wide range of languages and graphics to support languages based on pictures. The GARDEN system is a prototype conceptual programming environment that uses an object-oriented framework to meet these requirements.
An informal overview of CUINFO (Cornell's computer-based bulletin board)
Authors: Steven Worona
Venue: Proceedings of the 4th annual international conference on Systems documentation (1986)

Judith Turner's article on CUINFO (The Chronicle of Higher Education, July 10, 1985) resulted in a number of requests for more information. This note is intended to answer the most frequently asked questions. For more details, please get in touch with me at 401 Uris Hall, Cornell University, Ithaca, NY 14853; (607)256-4981; SLW@CORNELLA.BITNET.
A model for self-adaptation in a robot colony
Authors: T V D Kumar, N Parameswaran
Venue: Proceedings of the ACM SIGART international symposium on Methodologies for intelligent systems (1986)

A model for self-adaptation in a colony of robots to changes occurring in the environment is presented. The model employs two levels of computations : one at a metalevel and the other at a lowerlevel. The metalevel computations produce a learning behaviour in the robot which is responsible for the adaptation and those at the low-level control the robot motions. Inductive learning is employed as the learning strategy. An instance of the 'Producer-Consumer' problem is presented in this context.
An example case study on Ada tasking
Authors: Ken Sumate
Venue: ACM SIGAda Ada Letters (1987)

Case studies are an important method for teaching complex aspects of a programming language. This is especially true for real-time/concurrent systems. This paper presents a software requirements specification for a small but realistic real-time system, and then presents the solution in Ada. The actual hardware interactions are abstracted out, allowing the solution to be developed on a multi-user system. The focus of the solution is on treatment of certain aspects of concurrency. The solution model is based on a paradigm of top-level design, detailed design, and code.
Register allocation in the SPUR Lisp compiler
Authors: James R. Larus, Paul N. Hilfinger
Venue: ACM SIGPLAN Notices (1986)

Register allocation is an important component of most compilers, particularly those for RISC machines. The SPUR Lisp compiler uses a sophisticated, graph-coloring algorithm developed by Fredrick Chow [Chow84]. This paper describes the algorithm and the techniques used to implement it efficiently and evaluates its performance on several large programs. The allocator successfully assigned most temporaries and local variables to registers in a wide variety of functions. Its execution cost is moderate.
Constraint hierarchies
Authors: Alan Borning, Robert Duisberg, Bjorn Freeman-Benson, Axel Kramer, Michael Woolf
Venue: Conference proceedings on Object-oriented programming systems, languages and applications (1987)

Constraints describe relations that must be maintained, and provide a useful tool for such applications as interactive simulations, algorithm animation, and graphical user interface construction. We describe a major overhaul and extension to the constraint satisfaction mechanism in ThingLab, a constraint-oriented simulation laboratory written in the Smalltalk-80 language. First, a specification is presented of constraint hierarchies. Such hierarchies include both required constraints and default constraints of differing strengths, thus adding considerable expressive power to the system. Second, an algorithm for satisfying constraint hierarchies is described. The new satisfier is substantially faster than the previous version, even though it also includes new functionality.
Topological Properties of Hypercubes
Authors: Youcef Saad, Martin H. Schultz
Venue: IEEE Transactions on Computers (1988)

The n-dimensional hypercube is a highly concurrent loosely coupled multiprocessor based on the binary n-cube topology. Machines based on the hypercube topology have been advocated as ideal parallel architectures for their powerful interconnection features. The authors examine the hypercube from the graph-theory point of view and consider those features that make its connectivity so appealing. Among other things, they propose a theoretical characterization of the n-cube as a graph and and show how to map various other topologies into a hypercube.
CSG set-theoretic solid modelling and NC machining of blend surfaces
Authors: D Zhang, A Bowyer
Venue: Proceedings of the second annual symposium on Computational geometry (1986)

This paper presents a new solid modelling system capable of representing three dimensional objects consisting of both simple and complicated surfaces and, equally importantly, blend surfaces between them. Implicit polynomial inequalities and set theoretic techniques are used to specify the models. The modelling system can generate shaded pictures and NC machining instructions for cutting complicated objects automatically.The modelling system uses a technique for generating polynomials for blends and fillets that allows the user complete control over their extent without requiring him or her explicitly to devise the polynomial inequalities needed to represent them.
A modular approach to program visualization in computer science instruction
Authors: Don C. Stone
Venue: ACM SIGCSE Bulletin (1987)

The approach to program visualization in computer science instruction discussed here has two components: the graphic display of algorithms and the graphic display of their execution. Both types of display are based on the same hierarchical representation of an algorithm (in terms of Scandura FLOWforms, an enhancement and generalization of Nassi-Shneiderman diagrams). The execution display is obtained by the addition of explicit display commands to the basic algorithm, but the execution display details can be largely suppressed when the algorithm itself is being displayed. Two major characteristics of this approach are the modularity and the easy modifiability of demonstration procedures. The hardware required is an IBM PC or AT or compatible.
Sometimes an FEXPR is better than a macro
Authors: Z Lichtman
Venue: Issue 97 (July 1986) (1986)

Common Lisp, which is becoming THE Lisp standard, does not support call by text (FEXPR mechanism in Mac/Franz Lisp). This effect can be obtained using macros. Based on the experience of converting an OPS5 implementation from Franz Lisp to Common Lisp, it is argued that sometimes call by text is needed for efficiency, despite its negative aspects.In the case of languages embedded in a Lisp system, using the macro alternative for call by text can cause marco expansion at execution time. This leads to a some-what less efficient implementation of the embedded language.
Parallel algorithms for data compression
Authors: M. E. Gonzalez Smith, J. A. Storer
Venue: Journal of the ACM (JACM) (1985)

Parallel algorithms for data compression by textual substitution that are suitable for VLSI implementation are studied. Both &ldquo;static&rdquo; and &ldquo;dynamic&rdquo; dictionary schemes are considered.
Distributed Recovery in Fault-Tolerant Multiprocessor Networks
Authors: R M Yanney, J P Hayes
Venue: IEEE Transactions on Computers (1986)

A methodology for characterizing dynamic distributed recovery in fault-tolerant multiprocessor systems is developed using graph theory. Distributed recovery, which is intended for systems with no central supervisor, depends on the cooperation of a set of processors to execute the recovery function, since each processor is assumed to have only a limited amount of information about the system as a whole. Facility graphs, whose nodes denote the system components (processors), and whose edges denote interconnection between components, are used to represent multiprocessor systems, and error conditions. A general distributed recovery strategy R, which allows global recovery to be achieved via a sequence of local actions, is given. R recovers the system in several steps in which different nodes successively act as the local supervisor. R is specialized for two important classes of systems: loop networks and tree networks. For each of these cases, fault-tolerant designs and their associated distributed recovery strategies, which allow recovery from up to k faults within a specified number of steps, are presented.
Decidable problems for powerful programs
Authors: Eitan M. Gurari
Venue: Journal of the ACM (JACM) (1985)

Two of the most powerful classes of programs for which interesting decision problems are known to be solvable are the class of finite-memory programs and the class of programs that characterize the Presburger, or semilinear, sets. In this paper, a new class of programs that presents solvable decision problems similar to the other two classes of programs is introduced. However, the programs in the new class are shown to be computationally more powerful (i.e., capable of defining larger sets of input-output relations).
Threshold spectra for random graphs
Authors: S. Shelah, J. Spencer
Venue: Proceedings of the nineteenth annual ACM symposium on Theory of computing (1987)

Let G = G(n, p) be the random graph with n vertices and edge probability p and &fnof;(n, p, A) be the probability that G has A, where A is a first order property of graphs. The evolution of the random graph is discussed in terms of a spectrum of p = p(n) where &fnof;(n, p, A) changes. A partial characterization of possible spectra is given. When p = n-a, a irrational, and A is any first order statement, it is shown that lim &fnof;(n, p, A) = 0 or 1.
Security and inference in multilevel database and knowledge-base systems
Authors: Matthew Morgenstern
Venue: ACM SIGMOD Record (1987)

This paper addresses the threat to multilevel security that arises from logical inference and the semantics of the application. Such compromises of security are particularly challenging since they circumvent traditional security mechanisms and rely on a user's knowledge of the application. The problems of inference and security have heretofore been amorphous and difficult to circumscribe. We focus on these problems in the context of a multilevel database system and show their relevance to knowledge-based systems, sometimes referred to as expert systems. Here we establish a framework for studying these inference control problems, describe a representation for relevant semantics of the application, develop criteria for safety and security of a system to prevent these problems, and outline algorithms for enforcing these criteria.
Efficiently supporting procedures in relational database systems
Authors: Timos K. Sellis
Venue: ACM SIGMOD Record (1987)

We examine an extended relational database system which supports database procedures as full fledged objects. In particular, we focus on the problems of query processing and efficient support for database procedures. First, a variation to the original INGRES decomposition algorithm is presented. Then, we examine the idea of storing results of previously processed procedures in secondary storage (caching). Using a cache, the cost of processing a query can be reduced by preventing multiple evaluations of the same procedure. Problems associated with cache organizations, such as replacement policies and validation schemes are examined. Another means for reducing the execution cost of queries is indexing. A new indexing scheme for cached results, Partial Indexing, is proposed and analyzed.
The role of frame-based representation in reasoning
Authors: Richard Fikes, Tom Kehler
Venue: Communications of the ACM (1985)

A frame-based representation facility contributes to a knowledge system's ability to reason and can assist the system designer in determining strategies for controlling the system's reasoning.
Computer assisted instruction for therapy of heart failure based on simulation of cardiovascular system
Authors: Toshiro Sato, Akihiro Takeuchi, Jun Yamagami, Hareaki Yamamoto, Shigeaki Akiyama, Kyoko Endou, Masuo Shirataka, Noriaki Ikeda, Harukazu Tsuruta
Venue: ACM SIGBIO Newsletter (1987)

Adequate treatment of cardiac failure should reflect both clinical rules and quantitative evaluation of hemodynamics. For the latter we assumed an extensive model of heart and vessels: For the left and right ventricles the EMAX models were assumed with the parameters of contractilities and diastolic compliances. The model of the vessels was composed of systemic and pulmonary vascular networks with arterial, capillary and venous segments. Heart failure of various types was simulated by the model and the optimal therapeutic regimen was formulated. The cardiovasular parameters of patients with heart failure could be esimated from the hemodynamic measurements through the model and the optimal therapy was computed with the technique of nonlinear programming.The simulation thechnique was incorporated in the computer assisted instruction system based on the clinical emirical rules. The program was written with TURBO PASCAL for a microcomputer with CPU 80286. The response time was within a tolerable range for use in the clinical practice.
A Unified Approach to a Class of Data Movements on an Array Processor
Authors: Peter M. Flanders
Venue: IEEE Transactions on Computers (1982)

The most effective use of mesh-connected array processors is achieved by paying careful attention to the organization of data. Storage and movement of the elements of multidimensional arrays of data within a multidimensional store for a particular problem is a difficult task, often handled in an ad hoc way. For an important class of problems, considerable conceptual simplification arises from considering a specification of the mapping rather than the physical location of data.
A graphical simulation software for predicting IEEE 802.5 token-ring performances
Authors: Dennis S. Mok
Venue: Proceedings of the 20th annual symposium on Simulation (1987)

GRASP (Graphical Ring Access Simulation Program) is a graphical simulation software created specifically for analysing the performance of computer communications networks conforming to the IEEE802.5 local area networking standard. The performance parameters evaluated by the software are: the maximum, and the average, achieveable data rate of each node; the maximum, and the average, message queueing delay; as well as, the maximum number of data bits at the output buffer of each node. All these results are provided by GRASP in evaluating the performance of a token-ring network.
The formal specification of adaptive user interfaces using command language grammar
Authors: D. P. Browne, B. Sharratt, M. Norman
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1986)

The design and implementation of adaptive systems as opposed to non-adaptive systems creates new demands on user interface designers. This paper discusses a few of these demands as encountered by the authors while utilising a formal notation for the design of an adaptive user interface to an electronic mail system. Recommendations for the extension of this formal notation are proposed and discussed.
On the (non-) relationship between SLR(1) and NQLALR(1) grammars
Authors: Manuel E. Bermudez, Karl M. Schimpf
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1988)

A popular but &ldquo;not-quite&rdquo; correct technique for computing LALR(1) look-ahead sets has been formalized by DeRemer and Pennello and dubbed NQLALR(l). They also claim that the class of SLR(l) grammars is a subset of the class of NQLALR(1) grammars. We prove here that no such relationship exists between those two classes. We do so with a counterexample that, ironically, appeared in DeRemer and Pennello's own paper.
Estimating the cost of updates in a relational database
Authors: M. Schkolnick, P. Tiberio
Venue: ACM Transactions on Database Systems (TODS) (1985)

In this paper, cost formulas are derived for the updates of data and indexes in a relational database. The costs depend on the data scan type and the predicates involved in the update statements. We show that update costs have a considerable influence, both in the context of the physical database design problem and in access path selection in query optimization for relational DBMSs.