ppxscal/embedding_network huggingface dataset:
Efficient interpretation of synchronizable series expressions
Authors: R. C. Waters
Venue: Papers of the Symposium on Interpreters and interpretive techniques (1987)

The benefits of programming in a functional style are well known. For example, algorithms which are expressed as compositions of functions operating on series/vectors/streams of data elements are much easier to understand and modify than equivalent algorithms expressed as loops. Unfortunately, many programmers hesitate to use series expressions because they are typically implemented very inefficiently-the prime source of inefficiency being the creation of intermediate series objects.A restricted class of series expressions, obviously synchronizable series expressions, is defined which can be evaluated very efficiently because they do not require the creation of any intermediate series objects. A Common Lisp macro package has been implemented which supports obviously synchronizable series expressions. Using this macro package, programmers can obtain the advantages of expressing computations as series expressions without incurring any runtime overhead. Obviously synchronizable series expressions could be straightforwardly supported in any programming language.
On cacheability of lock-variables in tightly coupled multiprocessor systems
Authors: Reinder J. Bril
Venue: ACM SIGARCH Computer Architecture News (1987)

This paper presents a discussion of the cacheability of lock variables in tightly coupled multiprocessor systems with private cache memories. It shows that lock operations can give rise to a problem even when the requirement for a memory scheme to be coherent is met. This problem is called the lock consistency problem.Several solutions are presented to overcome this problem using standard instructions like test-and-set, and optionally a dedicated unlock (or reset) instruction meant to be used for lock-variables exclusively. The feasibility of these solutions depends on the kind of the interconnection network used (i.e., circuit switching or packet switching) and on how a cache memory may get exclusiveness of a block containing a lock-variable.Finally, it Is shown that the lock consistency problem may be solved independently from the cache consistency problem by distinguishing between lock-blocks and non-lock-blocks, facilitating a separation of concerns.
Reconfiguration Procedures for a Polymorphic and Partitionable Multiprocessor
Authors: W Lin, Chaun-Lin Wu
Venue: IEEE Transactions on Computers (1986)

This correspondence presents a collection of reconfiguration procedures for a multiprocessor which employs multistage interconnection networks. These procedures are used to dynamically partitipn the multiprocessor into many subsystems, and reconfigure them to form a variety commonly used topologies to match task graphs. By examining the switching capability of the interconnection network, design rules for avoiding connection conflicts are exploited. Then, on the basis of these rules, parallel procedures are designed. With the procedures, a subsystem can be reconfigured in the form of the desired topologies without interfering with other subsystems. In addition, the reconfiguration of a subsystem can be accomplished in constant time, independently of subsystem size.
Design of a distributed system support based on a centralized parallel bus
Authors: Claudio Kirner, Eduardo Marques
Venue: ACM SIGARCH Computer Architecture News (1986)

This paper presents the design of a distributed system based in a centralized parallel bus. The architecture of the system is described and the design of the bus and communication processor is analysed.
On Scheduling Tasks with a Quick Recovery from Failure
Authors: C M Krishna, K G Shin
Venue: IEEE Transactions on Computers (1986)

Multiprocessors used in life-critical real-time systems must recover quickly from failure. Part of this recovery consists of switching to a new task schedule that ensures that hard deadlines for critical tasks continue to be met. We present a dynamic programming algorithm that ensures that backup, or contingency, schedules can be efficiently embedded within the original, "primary" schedule to ensure that hard deadlines continue to be met in the face of up to a given maximum number of processor failures. Several illustrative examples are included.
An evaluation of retrieval effectiveness for a full-text document-retrieval system
Authors: David C. Blair, M. E. Maron
Venue: Communications of the ACM (1985)

An evaluation of a large, operational full-text document-retrieval system (containing roughly 350,000 pages of text) shows the system to be retrieving less than 20 percent of the documents relevant to a particular search. The findings are discussed in terms of the theory and practice of full-text document retrieval.
An historical review of iterative methods
Authors: D. M. Young
Venue: Proceedings of the ACM conference on History of scientific and numeric computation (1987)

*The preparation of this paper was supported in part by The National Science Foundation through Grant DCR - 8518722, by the Department of Energy through Grant A505-81ER10954, and the U.S. Air Force Office of Scientific Research and Development through Grant AF-85-0052. The U.S. Government retains a non-exclusive, royalty-free license to publish or reproduce the published form of this contribution, or allow others to do so for U.S. Government purposes.
The extraction of a minimum set of semantic primitives from a monolingual dictionary is NP-complete
Authors: David P. Daiely
Venue: Computational Linguistics (1986)

Within the last 15 years, a variety of unsolved problems of interest primarily to operations researchers, computer scientists, and mathematicians have been demonstrated to be equivalent in the sense that a solution to any of them would yield a solution to all of them. This class of problems, known as NP-complete, contains many long-standing problems of scheduling, routing, and resource allocation. This note contains a demonstration that a problem of interest to applied linguistics also belongs to this class - namely, the process of extracting a minimum set of semantic primitives from a monolingual dictionary is NP-complete, implying that the task is currently computationally insoluble.
On convergence toward a database of program transformations
Authors: David Barstow
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1985)

Several fairly large sets of programming rules have been developed recently. It is natural to ask whether the process of developing such rule bases may converge. Having developed sets of rules for specific programming tasks and domains, will they be helpful when other tasks and domains are considered? While it is too early to give definitive answers, experience with the rules of the PECOS system has been positive. Both during the process of developing the rule set and while developing rules for another domain, the existence of already codified rules proved very helpful.
The vocabulary problem in human-system communication
Authors: G. W. Furnas, T. K. Landauer, L. M. Gomez, S. T. Dumais
Venue: Communications of the ACM (1987)

In almost all computer applications, users must enter correct words for the desired objects or actions. For success without extensive training, or in first-tries for new targets, the system must recognize terms that will be chosen spontaneously. We studied spontaneous word choice for objects in five application-related domains, and found the variability to be surprisingly large. In every case two people favored the same term with probability
Digital halftones by dot diffusion
Authors: Donald E. Knuth
Venue: ACM Transactions on Graphics (TOG) (1987)

This paper describes a technique for approximating real-valued pixels by two-valued pixels. The new method, called dot diffusion, appears to avoid some deficiencies of other commonly used techniques. It requires approximately the same total number of arithmetic operations as the Floyd-Steinberg method of adaptive grayscale, and it is well suited to parallel computation; but it requires more buffers and more complex program logic than other methods when implemented sequentially. A &ldquo;smooth&rdquo; variant of the method may prove to be useful in high-resolution printing.
A quorum-consensus replication method for abstract data types
Authors: Maurice Herlihy
Venue: ACM Transactions on Computer Systems (TOCS) (1986)

Replication can enhance the availability of data in distributed systems. This paper introduces a new method for managing replicated data. Unlike many methods that support replication only for uninterpreted files, this method systematically exploits type-specific properties of objects such as sets, queues, or directories to provide more effective replication. Each operation requires the cooperation of a certain number of sites for its successful completion. A quorum for an operation is any such set of sites. Necessary and sufficient constraints on quorum intersections are derived from an analysis of the data type's algebraic structure. A reconfiguration method is proposed that permits quorums to be changed dynamically. By taking advantage of type-specific properties in a general and systematic way, this method can realize a wider range of availability properties and more flexible reconfiguration than comparable replication methods.
KAHLUA: a hierarchical circuit disassembler
Authors: B. Lin, A. R. Newton
Venue: Proceedings of the 24th ACM/IEEE Design Automation Conference (1987)

A new tool called a circuit disassembler has been developed to transform a mask level layout into an equivalent symbolic layout. This technique has been implemented in the program called KAHLUA that can handle mask layout containing arbitrary Manhattan geometry and is independent of the circuit technology. Circuits designed using physical layout systems can be automatically disassembled into a symbolic environment. Once converted, the disassembled cells can be manipulated further by any existing symbolic design or verification tools. In particular, these cells can be automatically remapped for a new technology. Our formulation of the problem consists of two major stages: device extraction, and net decomposition. In the first stage the transistors and contacts are extracted from the layout to form leaf cells. In the second stage a set of symbolic wires is derived from the remaining interconnect geometry. KAHLUA has been tested on a wide range of physical cells and has produced high quality results with modest execution times. An additional feature of the technique include the ability to disassemble hierarchically, which makes disassembling large layouts feasible.
Monitoring database performance&mdash;a control issue
Authors: Carl S. Guynes
Venue: ACM SIGSAC Review (1987)

This paper attempts to examine the major control and performance issues associated with database management systems. Monitoring and evaluation of database systems is necessary in order to maintain effective security, audit, and control in a computer-based environment. A database system must perform at a level that is acceptable to both database users and the database administration team. The database system is expected to perform many different functions for the organization. It is one of the database administator's jobs to determine what performance expectations are realistic and how to control the performance of the database. If a database system is to be effective, it must meet the expectations of the user community.
Improving virtual-grid compaction through grouping
Authors: L. S. Nyland, S. W. Daniel, D. Rogers
Venue: Proceedings of the 24th ACM/IEEE Design Automation Conference (1987)

In the past, Virtual-Grid Compactors have not been well received because they generated sparse layouts. In analyzing this problem, we found three major areas where improvements could be made: breaking the virtual-grid lines into segments; decoupling the placement of non-interacting layers; and eliminating the centered nature of elements. The result is a compactor with substantially better mask generation.
SYSTEM/U: a database system based on the universal relation assumption
Authors: Henry F. Korth, Gabriel M. Kuper, Joan Feigenbaum, Allen van Gelder, Jeffrey D. Ullman
Venue: ACM Transactions on Database Systems (TODS) (1984)

System/U is a universal relation database system under development at Standford University which uses the language C on UNIX. The system is intended to test the use of the universal view, in which the entire database is seen as one relation. This paper describes the theory behind System/U, in particular the theory of maximal objects and the connection between a set of attributes. We also describe the implementation of the DDL (Data Description Language) and the DML (Data Manipulation Language), and discuss in detail how the DDL finds maximal objects and how the DML determines the connection between the attributes that appear in a query.
SYREL: A Symbolic Reliability Algorithm Based on Path and Cutset Methods
Authors: S. Hariri, C. S. Raghavendra
Venue: IEEE Transactions on Computers (1987)

Symbolic terminal reliability algorithms are important for analysis and synthesis of computer networks. In this paper, we present a simple and efficient algorithm, SYREL, to obtain compact terminal reliability expressions between a terminal pair of computers of complex networks. This algorithm incorporates conditional probability,, set theory, and Boolean algebra in a distinct approach in which most of the computations performed are directly executable Boolean operations. The conditibnal probability is used to avoid applying at each iteration the most time consuming step in reliability algorithms, which is making a set of events mutually exclusive. The algorithm has been implemented on a VAX 11/750 and can analyze fairly large networks with modest memory and time requirements.
People and organizations in software production: a review of the literature
Authors: Sarah H. Nash, Samuel T. Redwine,  Jr.
Venue: ACM SIGCPR Computer Personnel (1988)

The growing demand for software requires increasingly productive people and organizations, yet little is known about how best to select, train, organize, and manage people and organizations to produce software. Boehm's COCOMO software costing model has shown that people and organizations can have a dramatic effect on productivity and costs. Issues of project organization, education and training, professional development, career paths, personnel selection, evaluation, group dynamics, and motivation play a significant part in software productivity. As this review of 130 references to the recent research literature indicates, work is being done on these issues, however, some gaps need to be filled and methods developed to insure their effective use.
Teaching operating systems with Modula-2
Authors: Jeffrey A. Brumfield
Venue: Proceedings of the seventeenth SIGCSE technical symposium on Computer science education (1986)

Programming projects in an operating systems course expose students to issues involved in the design and implementation of operating systems. The Modula-2 language provides features needed in such projects. This paper overviews the capabilities of Modula-2 and describes a programming project in which students implement a process manager for an operating system. The process manager supports concurrent processes and provides operations for their synchronization and communication.
Composite object support in an object-oriented database system
Authors: Won Kim, Jay Banerjee, Hong-Tai Chou, Jorge F. Garza, Darrel Woelk
Venue: ACM SIGPLAN Notices (1987)

Many applications in such domains as computer-aided design require the capability to define, store and retrieve as a single unit a collection of related objects known as a composite object. A composite object explicitly captures and enforces the IS-PART-OF integrity constraint between child and parent pairs of objects in a hierarchical collection of objects. Further, it can be used as a unit of storage and retrieval to enhance the performance of a database system. This paper provides a formal definition of the semantics of composite objects within an object-oriented data model, and describes their use as units of integrity control, storage and retrieval, and concurrency control in a prototype object-oriented database system we have implemented.
Simultaneous-distributive coordination and context-freeness
Authors: Michael B. Kac, Alexis Manaster-Ramer, William C. Rounds
Venue: Computational Linguistics (1987)

English is shown to be trans-context-free on the basis of coordinations of the respectively type that involve strictly syntactic cross-serial agreement. The agreement in question involves number in nouns and reflexive pronouns and is syntactic rather than semantic in nature because grammatical number in English, like grammatical gender in languages such as French, is partly arbitrary. The formal proof, which makes crucial use of the Interchange Lemma of Ogden et al., is so constructed as to be valid even if English is presumed to contain grammatical sentences in which respectively operates across a pair of coordinate phrases one of whose members has fewer conjuncts than the other; it thus goes through whatever the facts may be regarding constructions with unequal numbers of conjuncts in the scope of respectively, whereas other arguments have foundered on this problem.
Automatic Identification of Software System Differences
Authors: B. Steinholtz, K. Walden
Venue: IEEE Transactions on Software Engineering (1987)

A well-known method for software version control on the source file level is the incremental change technique, which isolates the differences, commonly called a delta, between two versions of a source module, and then stores only the delta. Any version of a source module can then be reconstructed from the original by successive application of deltas. The significant advantages of this approach include accuracy (because it is automatic), visibility (because it highlights differences), and economy (because it conserves storage space).
Dynamic elastic interpolation for 3-D object reconstruction from serial cross-sectional images
Authors: W.-C. Lin, C.-C. Liang, C.-T. Chen
Venue: Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow (1987)

In many scientific and technical endeavors, a three-dimensional (3-D) object must be reconstructed from serial cross-sections, either to aid in the comprehension of the object's structure or to facilitate its automatic manipulation and analysis. If the cross-sections are not closely spaced, interpolation is needed to recapture the appearance of the embedded 3-D object. In this paper, we propose an interpolation scheme for filling the space between the contours in two successive slices. The essential idea is to identify a force field acting on one contour and trying to distort it to be like the other contour. The major advantages of this method are its superior capabilities in handling the branching problem and making use of the graphics rendering method for solid objects composed of slices of voxels. Several experiments were conducted to demonstrate the interpolation method using both synthetic and real data.
A Measure of Guaranteed Availability and its Numerical Evaluation
Authors: A. Goyal, A. N. Nantawi
Venue: IEEE Transactions on Computers (1988)

A success (risk) measure of guaranteed availability is proposed. Using a genetic system model, the authors describe the measure and study the effects of the guaranteed level and the observation period on it. Furthermore, they introduce a numerical approach for continuous-time Markov chain models which allows component-level modeling, Coxian failure and repair distributions, time-dependent failure and repair rates and deferred repair and nondeferred repair strategies to be handled. An example of a fault-tolerant database computer system is considered and the measure of guaranteed availability is evaluated for various guaranteed levels and observation periods.
Series reversion as the reversed chain rule
Authors: Charles L. Lawson
Venue: ACM SIGNUM Newsletter (1988)

I recently had occasion to extend a derivative-computation package I had written in 1971 to add the capability of dealing with a function defined implicitly. This led me to see the duality between Taylor series reversion and the chain rule of differentiation of a composite function. I was also struck with the compactness with which these algorithms could be expressed in a programming language, which in my case was Fortran 77. The basic ideas involved will probably not be new to persons who have worked on computerization of symbolic mathematics or other approaches to derivative computation, however, I think this may be of interest to many readers of this newsletter as an instance of a very small body of code implementing a mathematical transformation that might a priori be thought to be somewhat complicated.
A second course in database management
Authors: Evans J. Adams
Venue: Proceedings of the seventeenth SIGCSE technical symposium on Computer science education (1986)

A second course in Database Management which stresses database design principles is described. The first course emphasizes database implementation utilizing both a relational and a CODASYL database management system. Students become familiar with the usage of a database management system as a implementation framework for databases. The second course provides the student with tools to perform logical database design and with techniques for converting logical designs into efficient physical implementations.
A Remote Computation Facility for a Heterogeneous Environment
Authors: Brian N. Bershad, Henry M. Levy
Venue: Computer (1988)

The authors describe THERE (the heterogeneous environment for remote execution), a general-purpose facility designed to simplify the adaptation of nonnetworked, nonheterogeneous applications to a distributed heterogeneous environment. Existing applications made accessible with THERE become heterogeneous network services, and users of those services become heterogeneous network clients. They discuss the problems of remote computation, provide an overview of THERE, and describe the building of THERE applications. They present TPL, THERE programming language, which is tailored toward building execution environments for application programs (on the server sided), defining client interfaces to remote services (on the client side), and providing system-independent communication between client and server interfaces.
Design and algorithms for parallel testing of random access and content addressable memories
Authors: P. Mazumder, J. H. Patel, W. K. Fuchs
Venue: Proceedings of the 24th ACM/IEEE Design Automation Conference (1987)

This paper presents a design strategy for efficient and comprehensive parallel testing of both Random Access Memory (RAM) and Content Addressable Memory (CAM). Based on this design for testability approach, parallel testing algorithms for CAMs and RAMs are developed for a broad class of pattern sensitive faults. The resulting test procedures are significantly more efficient than previous approaches. For example, the design for testability strategy allows an entire w word CAM to be read in just one operation with a resulting speed up in testing as high as w. In the case of an n bit RAM, the improvement in test efficiency is by a factor of &Ogr;(&radic;n). The overall reduction in testing time is considerable for large size memories.