ppxscal/embedding_network huggingface dataset:
How DENDRAL was conceived and born
Authors: J. Lederberg
Venue: Proceedings of ACM conference on History of medical informatics (1987)

As agreed with your organizers, this will be a somewhat personal history. They have given me permission to recall how I came to work with Ed Feigenbaum on DENDRAL, an exemplar of expert systems and of modeling problem-solving behavior. My recollections are based on a modest effort of historiography, but not a definitive survey of and search for all relevant documents. On the other hand, they will give more of the flow of ideas and events as they happened than is customary in published papers in scientific journals &mdash; accounts so dry that Medawar lugubriously calls them fraudulent {43}; cf. Merton Zuckerman {44, 45, 61}. These authors point out that the standard scientific publication is narrowmindedly devoted to the context of justification. The DENDRAL effort (along with much of medical informatics) is dedicated to discovery: should we use a different standard for its history? I hope it will be eventually possible to divert my colleagues from the more important work they do from day to day, and join me in a larger effort at historical research and informed consensus. My account is inevitably incomplete, especially about what others were thinking at a given moment. Built into the phenomenon of history, as soon as enough time has passed to enable some detached judgment, the evidence becomes frail, and we become vulnerable to the myths we create. Understanding all of these limitations, I will no longer qualify every remark: it should be implicit that each is &ldquo;to the best of my recollection / or / as best as can be inferred from the fragmentary documentary record&rdquo;. I will assume you are generally familiar with DENDRAL, and will concentrate mainly on material not found in the published papers, especially as there is a comprehensive synopsis {41}. As computer science is not my primary profession, my relationship to it has been more episodic; and I can more readily isolate how I came to take some part in it, at Stanford from 1962 - 1978, mainly in very close collaboration with Ed Feigenbaum, Bruce Buchanan, and a host of others. My central scientific commitments have been to molecular genetics, starting when I was a 20-year old medical student in 1945 {38}. At Columbia and then at Yale, I worked on the genetics of bacteria, a specialty which converged with the role of DNA as genetic information. My first academic appointment was at the University of Wisconsin from 1947 - 1958; then I went to Stanford in 1959 to take part in the reconstruction of its School of Medicine (formerly in San Francisco) at the Palo Alto campus. My role was to found a new Department of Genetics; I had no plan to be working with computers. In fact, I met Ed Feigenbaum in 1963. Then, promptly after he moved from Berkeley to Stanford faculty in early 1965, we initiated the collaboration that became the DENDRAL project.
VALKYRIE: a validation subsystem of a version server for computer-aided design data
Authors: R. Bhateja, R. H. Katz
Venue: Proceedings of the 24th ACM/IEEE Design Automation Conference (1987)

Design methodologies specify the sequence in which verification programs must be successfully executed to determine a design's correctness. We present a mechanism for assisting designers in adhering to their methodology, specified as Prolog rules that must match a verification event log. A new version cannot be released if a methodology violation is detected. Designers can query for the source of their violation. The system has been implemented within a prototype Version Server.
Tool interfaces in integrated project support environments
Authors: A. Hall
Venue: Proceedings of the 9th international conference on Software Engineering (1987)

It is generally agreed that to meet these objectives and achieve integration an IPSE should be built round a kernel or infrastructure of common services.Coherence is then achieved if the infrastructure provides services to tools which relieve the toolwriter of the need to code, for example, user interface handling. Not only does this aid uniformity, but of course it also offers economic leverage.Control of the environment resides in the kernel and it is not possible for tools to ignore the controls and prejudice the integrity of the project data.Sharing is achieved because the project data and its structure reside in the database which is under the control of the kernel.Early efforts to build such an IPSE were based on the STONEMAN model, where the kernel was the KAPSE. The crucial interface in this architecture is the KAPSE interface, which offers services to all tools. We did not sufficiently realise, however, that there is a major economic problem in designing a new interface from scratch. All tools which are to be used in an environment must, by definition, conform to this interface definition. This means that all the tools have to be specially written to use the new interface, and it became apparent that no single organisation could or should expect to provide a complete new tool kit in this way. Rather one wants an open market in software tools, in the same way that it is hoped Ada will lead to an open market in software components. The more recent history of IPSE efforts, therefore, has been an attempt to resolve the conflict between the desire for integration and the need for environments to accept a wide range of tools from various sources. Perhaps the most ambitious project taking this approach is ASPECT, a project within the UK Alvey programme, which is currently delivering prototypes for evaluation. ASPECT aims to provide a highly functional Open Tool Interface covering coherence, control and sharing. It does this by treating the Open Tool Interface as a special case of an adaptable interface which provides user-defined views of the underlying kernel. This approach depends heavily on the notions of views developed in the relational database world.
Word division in Spanish
Authors: José A. Mañas
Venue: Communications of the ACM (1987)

Spanish is a language with very precise and regular orthographic rules. A syllabication algorithm strictly based on syntactic analysis, not requiring any semantic knowledge, is presented and further extended to include hyphenation. Algorithms are presented as pattern matching schemata, and efficient implementations are considered.
Good worst-case algorithms for inserting and deleting records in dense sequential files
Authors: Dan E. Willard
Venue: ACM SIGMOD Record (1986)

Consider a file which arranges records in sequential order, and stores them with possible empty spaces in M consecutive pages of memory. We develop an insertion-deletion algorithm which runs in a worst-case time approximately proportional to log2M divided by the page-size when the set of manipulated records has cardinality O(M).
A graph based approach to object feature recognition
Authors: L. De Floriani
Venue: Proceedings of the third annual symposium on Computational geometry (1987)

Shape features, such as protrusions or depressions on faces, and through-holes or handles, are extracted from a boundary model of a solid object, called a Generalized Edge-Face Graph (GEFG). This graph provides a face-based topological description of the object boundary. The feature identification and classification are based on the analysis of the connectivity properties of the edge-face graph associated with the GEFG and on some geometric considerations. The result is a hierarchical graph decomposition of the object boundary into components representing features.
APL compilation and interpretation by translating to F83VEC
Authors: Richard Naugle
Venue: Proceedings of the international conference on APL (1986)

There are many applications where APL would be advantageous, but slowness or excessive memory requirements preclude its use. The remedy which is explored here is translating APL into F83VEC.
Toward hypertext publishing
Authors: Robin Hanson
Venue: ACM SIGIR Forum (1988)

Hypertext publishing, the integration of a very large body of public writings into a unified hypertext environment, will require the simultaneous solution of problems involving very wide database distribution, copyright, freedom of speech, privacy, and information overload. This paper describes these problems and presents, for criticism and discussion, an abstract design called LinkText which seems to solve many of them. LinkText is presented both as a specification and as design approaches grouped around various levels of electronic publishing.
Dual integer linear programs and the relationship between their optima
Authors: R Aharoni, P Erdös, N Linial
Venue: Proceedings of the seventeenth annual ACM symposium on Theory of computing (1985)

We consider dual pairs of packing and covering integer linear programs. Best possible bounds are found between their optimal values. Tight inequalities are obtained relating the integral optima and the optimal rational solutions.
Issues in the design of object-oriented database programming languages
Authors: Toby Bloom, Stanley B. Zdonik
Venue: ACM SIGPLAN Notices (1987)

We see a trend toward extending object-oriented languages in the direction of databases, and, at the same time, toward extending database systems with object-oriented ideas. On the surface, these two activities seem to be moving in a consistent direction. However, at a deeper level, we see difficulties that may inhibit their ending up at the same point. We feel that many of these difficulties are a result of the underlying assumptions that are inherent in the fields of programming language and database systems research. Many of these assumptions are historical and contribute to a set of cultural biases that often prevent the two communities from interacting as effectively as possible. The purpose of this paper is to try to uncover some of the cultural presuppositions that have inhibited development of a fully integrated database programming language. We have identified database and language features that seem to be difficult to reconcile. We try to uncover the basic problems in these two areas that these features were intended to solve. In order to resolve these problems, we attempt to distinguish fundamental differences from historical artifacts.
Synchronizing Transactions on Objects
Authors: B. R. Badrinath, Krithi Ramamritham
Venue: IEEE Transactions on Computers (1988)

A method is discussed for synchronizing operations on objects when the operations are invoked by transactions. The technique, which is motivated by a desire to make use of possible concurrency in accessing objects, takes into consideration the granularity at which operations affect an object. A dynamic method is presented for determining the compatibility of an invoked operation with respect to operations in progress. In making decisions, it utilizes the state of the object, the semantics of the uncommitted operations, the actual parameters of the invoked operation, and the effect of the operations on the objects. One of the attractive features of this technique is that a single framework can be used to deal with the problem of synchronizing access to simple objects as well as compound objects, i.e. objects in which some components are themselves objects.
Gaining efficiency in transport services by appropriate design and implementation choices
Authors: Richard W. Watson, Sandy A. Mamrak
Venue: ACM Transactions on Computer Systems (TOCS) (1987)

End-to-end transport protocols continue to be an active area of research and development involving (1) design and implementation of special-purpose protocols, and (2) reexamination of the design and implementation of general-purpose protocols. This work is motivated by the perceived low bandwidth and high delay, CPU, memory, and other costs of many current general-purpose transport protocol designs and implementations. This paper examines transport protocol mechanisms and implementation issues and argues that general-purpose transport protocols can be effective in a wide range of distributed applications because (1) many of the mechanisms used in the special-purpose protocols can also be used in general-purpose protocol designs and implementations, (2) special-purpose designs have hidden costs, and (3) very special operating system environments, overall system loads, application response times, and interaction patterns are required before general-purpose protocols are the main system performance bottlenecks.
Alkahest III: automatic analysis of periodic weakly nonlinear ODEs
Authors: J. Fitch, A. Norman, M. A. Moore
Venue: Proceedings of the fifth ACM symposium on Symbolic and algebraic computation (1986)

In previous papers by the current authors various attempts that have been made in the automatic derivation of periodic solutions to weakly nonlinear differential equations have been reported. The equations in question are all perturbations of y&prime;+y = 0, related to the equations that occur in the study of celestial mechanics. In the current paper the analysis of these equations has been taken further, with the automatic system, named Alkahest III, being able to determine the solution to equations even when the user's initial conditions are invalid. The system can produce an approximate solution itself, and there are facilities to write an algebra program for REDUCE or CAMAL to generate higher order solutions.
The LINC was early and small
Authors: Wesley Clark
Venue: Proceedings of the ACM Conference on The history of personal workstations (1986)

The LINC represents one of the earliest attempts to put the stored program computer into the form of a general instrument for laboratory use. In a deliberate departure from the technology of Timesharing then just beginning nearly two decades of development, the LINC was designed for use by individual experimenters and thus anticipated features of the modern personal computer and personal workstation. Built at M.I.T. in 1962, its immediate forebears were the TX-0, ARC-1, and L-1 computers, in turn direct descendents of the M.I.T. Whirlwind and MTC computers. Of course the LINC in its day was neither personal computer nor personal workstation but simply the LINC. The LINC was an outgrowth of interactions between two M.I.T. groups of scientists and engineers: the Communications Biophysics Laboratory interested in the quantification of neuro-electric activity, and the Lincoln Laboratory Digital Computer Group engaged in the development of advanced computers. Twelve LINCs were placed initially in biomedical research laboratories across the country under a unique NIH/NASA-sponsored evaluation program. Ultimately more than 1200 LINC or LINC variants were manufactured commercially for worldwide use. The basic system design went on to influence the design of the DEC PDP-4 and PDP-5 computers, which in turn helped to pave the way to the PDP-8.
Implementing Precise Interrupts in Pipelined Processors
Authors: James E. Smith, Andrew R. Pleszkun
Venue: IEEE Transactions on Computers (1988)

Five solutions to the precise interrupt problem in pipelined processors are described and evaluated. An interrupt is precise if the saved process state corresponds to a sequential model of program execution in which one instruction completes before the next begins. In a pipelined processor, precise interrupts are difficult to implement because an instruction may be initiated before its predecessors have completed. The first solution forces instructions to complete and modify the process state in architectural order. The other four solutions allow instructions to complete in any order, but additional hardware is used, so that a precise state can be restored when an interrupt occurs. All the methods are discussed in the context of a parallel pipeline structure. Simulation results for the Cray-1S scalar architecture are used to show that the first solution results in a performance degradation of at least 16%. The remaining four solutions offer better performance, and three of them result in as little as a 3% performance loss. Several extensions, including vector architectures, virtual memory, and linear pipeline structures, are briefly discussed.
Environmental and institutional models of system development: a national criminal history system
Authors: Kenneth C. Laudon
Venue: Communications of the ACM (1985)

This article tests two competing theories of system development referred to here as environmental and institutional models. These models form the basis for most explanations of why systems are developed and utilized. We will examine both models in detail and apply them to a single set of data concerned with the emerging national computerized criminal history system (CCH). A hybrid model, which combines elements of environmental and institutional approaches, is also developed and tested. A substantive result of this new model will alter our understanding of why a national CCH system is being developed. At the theoretical level, we conclude that a hybrid model is more powerful than either an environmental or an institutional model taken separately and that future research must take this into account.
Very fast LR parsing
Authors: Thomas J. Pennello
Venue: ACM SIGPLAN Notices (1986)

LR parsers can be made to run 6 to 10 times as fast as the best table-interpretive LR parsers. The resulting parse time is negligible compared to the time required by the remainder of a typical compiler containing the parser.A parsing speed of 1/2 million lines per minute on a computer similar to a VAX 11/780 was achieved, up from an interpretive speed of 40,000 lines per minute. A speed of 240,000 lines per minute on an Intel 80286 was achieved, up from an interpretive speed of 37,000 lines per minute.The improvement is obtained by translating the parser's finite state control into assembly language. States become code memory addresses. The current input symbol resides in a register and a quick sequence of register-constant comparisons determines the next state, which is merely jumped to. The parser's push-down stack is implemented directly on a hardware stack. The stack contains code memory addresses rather than the traditional state numbers.The strongly-connected components of the directed graph induced by the parser's terminal and nonterminal transitions are examined to determine a typically small subset of the states that require parse-time stack-overflow-check code when hardware does not provide the check automatically.The increase in speed is at the expense of space: a factor of 2 to 4 increase in total table size can be expected, depending upon whether syntactic error recovery is required.
DES key crunching for safer cypher keys
Authors: Lynn Grant
Venue: ACM SIGSAC Review (1987)

Providing passwords or cipher keys that are easy to remember but hard to guess has long been a problem. Message authentication techniques used by the banking industry can be harnessed to provide such keys. These techniques combine the bit-shuffling properties of the Data Encryption Standard with the error-propagation properties of cipher block chaining. The result is an algorithm that takes a long, but easily remembered, string of characters, such as a snippet of verse or a familiar jingle, and transforms it into a key. The transformed key is highly sensitive to any changes in the input string.
A decidable query answering algorithm for circumscriptive theories
Authors: T C Przymusinski
Venue: Proceedings of the ACM SIGART international symposium on Methodologies for intelligent systems (1986)

We describe a decidable algorithm to answer queries in circumscriptive theories, that allows the use of variable predicates. This significantly extends the results obtained in our earlier paper [P], where a similar algorithm was constructed for circumscriptive theories without variable predicates. Since prioritized circumscription is equivalent to a conjunction of parallel circumscriptions with variables, the algorithm can be used to answer queries in theories circumscribed by prioritized circumscription. The Closed-World Assumption (CWA) and its generalization, the Extended Closed-World Assumption (ECWA), can be considered as a special form of circumscription. Consequently, our method also applies to answering queries in theories using the Closed-World Assumption or its generalizations. For the sake of clarity, we restrict our attention to theories consisting of ground clauses. Our algorithm, however, has a natural extension to theories consisting of arbitrary clauses.
The information structure of distributed mutual exclusion algorithms
Authors: Beverly A. Sanders
Venue: ACM Transactions on Computer Systems (TOCS) (1987)

The concept of an information structure is introduced as a unifying principle behind several of the numerous algorithms that have been proposed for the distributed mutual exclusion problem. This approach allows the development of a generalized mutual exclusion algorithm that accepts a particular information structure at initialization and realizes both known and new algorithms as special cases. Two simple performance metrics of a realized algorithm can be obtained directly from the information structure. A new failure recovery mechanism called local recovery, which requires no coordination between nodes and no additional messages beyond that needed for failure detection, is introduced.
Critical issues regarding HPS, a high performance microarchitecture
Authors: Y. N. Patt, S. W. Melvin, W. M. Hwu, M. C. Shebanow
Venue: Proceedings of the 18th annual workshop on Microprogramming (1985)

HPS is a new model for a high performance microarchitecture which is targeted for implementing very dissimilar ISP architectures. It derives its performance from executing the operations within a restricted window of a program out-of-order, asynchronously, and concurrently whenever possible. Before the model can be reduced to an effective working implementation of a particular target architecture, several issues need to be resolved. This paper discusses these issues, both in general and in the context of architectures with specific characteristics.
Discrete Optimization Problem in Local Networks and Data Alignment
Authors: M.A. Fiol, J. L. A. Yebra, I. Alegre, M. Valero
Venue: IEEE Transactions on Computers (1987)

This paper presents the solution of the following optimization problem that appears in the design of double-loop structures for local networks and also in data memory, allocation and data alignment in SIMD processors.
Multipipeline Networking for Compound Vector Processing
Authors: K. Hwang, Z. Xu
Venue: IEEE Transactions on Computers (1988)

An efficient vector-processing technique is proposed; it is based on a novel concept of multipipeline networking, which is generalized from the techniques of pipeline chaining and systolization. The authors also present the design principles of pipeline nets and provide programming, compiling and run-time techniques for converting scientific programs into pipeline net implementations. Performance analysis of the pipeline net is provided with projected performance of various Livermore loops implemented with pipeline nets of various sizes.
Lower Overhead Design for Testability of Programmable Logic Arrays
Authors: Saied Bozorgui-Nesbat, Edward J. McCluskey
Venue: IEEE Transactions on Computers (1986)

A new technique for designing easily testable PLA's is presented. The salient features of this technique are: 1) low overhead, 2) high fault coverage, 3) simple design, and 4) little or no impact on normal operation of PLA's. This technique consists of the addition of input lines in such a way that, in test mode, any single product line can be activated and its associated circuitry and device can be tested. Using this technique, all multiple stuck-at faults, as well as all multiple extra and multiple missing device faults, are detected.