ppxscal/embedding_network huggingface dataset:
Tablet: personal computer of the year 2000
Authors: B. W. Mel, S. M. Omohundro, A. D. Robison, S. S. Skiena, K. H. Thearling
Venue: Communications of the ACM (1988)

A design represents a compromise between conflicting goals, and the design of the personal computer of the year 2000 is no exception. We seek something that will fit comfortably into people's lives while dramatically changing them. This may appear to be a contradiction that cannot be reconciled. But if the technology does not fit easily into the habits and lifestyles of its human users, it will be discarded by those it was meant to help. And if this new tool does not change the life of its owner, it is only because we have been too shortsighted to imagine the possibilities. Our way out of this dilemma is to base the design upon something which is already integrated into everyone's life, to take a vital tool and give it more life. We have chosen to improve something that most people use everyday, the humble paper notebook. We have all heard the computer revolution was supposed to eliminate paper from the workplace. Instead, it has lead to desktop publishing; now we can not only write papers but typeset them ourselves. Paper notebooks have many properties that make them particularly friendly. They are light and portable. No one thinks twice about taking a pad anywhere. They are easy and natural to use, as accessible to the toddler as to the octogenarian and as relevant to the artist as the engineer. They can be used to communicate with other people. They are the ideal medium for integrating text and graphics, and perfect for creative doodling. Moreover, notebooks are forgiving of mistakes, simply peel off the page and start anew. It is natural to revise and edit written documents. There is something satisfying about crossing out an offending sentence from a written draft, a feeling that word processors have not captured. We aim for a computer that will provide all of these benefits and more. Thus, the personal computer of the year 2000 will be a portable machine the size of a notebook. We will write and draw with a stylus on a screen which mimics a physical writing surface. Enhancing this with the powers of computation and communication, we create a tool that will improve the way we live and work. This report provides a more concrete depiction of the machine we have in mind, namely TABLET.
Compression, information theory, and grammars: a unified approach
Authors: Abraham Bookstein, Shmuel T. Klein
Venue: ACM Transactions on Information Systems (TOIS) (1990)

Text compression is of considerable theoretical and practical interest. It is, for example, becoming increasingly important for satisfying the requirements of fitting a large database onto a single CD-ROM. Many of the compression techniques discussed in the literature are model based. We here propose the notion of a formal grammar as a flexible model of text generation that encompasses most of the models offered before as well as, in principle, extending the possibility of compression to a much more general class of languages. Assuming a general model of text generation, a derivation is given of the well known Shannon entropy formula, making possible a theory of information based upon text representation rather than on communication. The ideas are shown to apply to a number of commonly used text models. Finally, we focus on a Markov model of text generation, suggest an information theoretic measure of similarity between two probability distributions, and develop a clustering algorithm based on this measure. This algorithm allows us to cluster Markov states, and thereby base our compression algorithm on a smaller number of probability distributions than would otherwise have been required. A number of theoretical consequences of this approach to compression are explored, and a detailed example is given.
On high-speed computing with a programmable linear array
Authors: P. Z. Lee, Z. M. Kedem
Venue: Proceedings of the 1988 ACM/IEEE conference on Supercomputing (1988)

It has been observed by many researchers that systolic arrays are very suitable for certain high-speed computations. In this paper, using a formal methodology, a single simple programmable linear systolic array capable of solving large number of problems drawn from a variety of applications is designed. The methodology is applicable to problems solvable by sequential algorithms that can be specified as nested for loops of arbitrary depth. The algorithms of this form that can be computed on the array presented in this paper include 25 algorithms dealing with signal and image processing, algebraic computations, matrix arithmetic, pattern matching, database operations, sorting, and transitive closure. Assuming bounded I/O, for 18 of those algorithms the time and storage complexities are optimal, and therefore no improvement can be expected by utilizing dedicated special purpose linear systolic arrays designed for individual algorithms.
Calculating joint queue-length distributions in product-form queuing networks
Authors: Edmundo de Souza e Silva, S. S. Lavenberg
Venue: Journal of the ACM (JACM) (1989)

A new computational algorithm called distribution analysis by chain (DAC) is developed. This algorithm computes joint queue-length distributions for product-form queuing networks with single-server fixed rate, infinite server, and queue-dependent service centers. Joint distributions are essential in problems such as the calculation of availability measures using queuing network models. The algorithm is efficient since the cost to evaluate joint queue-length probabilities is of the same order as the number of these probabilities. This contrasts with the cost of evaluating these probabilities using previous algorithms. The DAC algorithm also computes mean queue lengths and throughputs more efficiently than the recently proposed RECAL and MVAC algorithms. Furthermore, the algorithm is numerically stable and its recursion is surprisingly simple.
CEDIF: a data driven EDIF reader
Authors: M. Roberts
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

The Electronic Design Interchange Format (EDIF) allows tools at all levels of the design process to exchange data. This paper describes an efficient method for reading incremental, hierarchical EDIF and the issues involved. The approach taken allows the data to drive the interpretation process by attaching functions to the EDIF keywords. The key to this approach is the representation and interpretation of the EDIF keyword semantics.
Proof-tree transformation theorems and their applications
Authors: R. Ramakrishnan, Y. Sagiv, J. D. Ullman, M. Y Vardi
Venue: Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (1989)

For certain sets of logical rules, one can demonstrate that for every proof tree there is another tree proving the same fact and having a special form. One technique for detecting such opportunities is to reduce the question to one of conjunctive-query containment. A more powerful technique is to test whether one conjunctive query is contained in the infinite union of conjunctive queries formed by expanding a set of recursive rules. We discuss two applications of these techniques. First, we give tests for commutativity of linear rules. When linear rules commute, we can reduce the complexity of &ldquo;counting&rdquo; methods for query evaluation from exponential to polynomial; commutativity also implies separability in the sense of Naughton. A second application is the discovery of linear rules that are equivalent to given nonlinear rules.
An Automated Tactile Sensing Strategy for Planar Object Recognition and Localization
Authors: J. L. Schneiter, T. B. Sheridan
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

The planning problem associated with tactile exploration for object recognition and localization is addressed. Given that an object has been sensed and is one of a number of modeled objects, and given that the data obtained so far are insufficient for recognition and/or localization, the methods developed determin the paths along which a point contact sensor must be directed in order to obtain further highly diagnostic measurements. Three families of sensor paths are found. The first is the family of paths for which recognition and localization are guaranteed. The second guarantees only that something will be learned. The third represents paths to avoid because nothing new will be learned. The methods are based on a small but powerful set of geometric ideas and are developed for two-dimensional, planar-faced objects. They are conceptually easily generalized to handle three-dimensional objects, including objects with through holes.
A fusion of Lotus 1-2-3 and APL2
Authors: E. Friis
Venue: Conference proceedings on APL as a tool of thought (1989)

A fusion of the most popular computer program to date with one of the most. powerful and innovative programming language to date presents a great opportunity for synergy and accomplishment. Part of this synergy has been explored in the construction of an APL2 based prototype system called FUSION. The FUSION prototype has encompassed the ability to communicate with Lotus Development Corporation's 1-2-3 by way of the binary .WK1 file format.The following salient features of the FUSION prototype are discussed: bull; the modelling of a worksheet in APL2 bull; the translation of Lotus 1-2-3 formulas to executable APL2 expressions bull; access to other host programs from the worksheet
Limitation of optimism in the time warp operating system
Authors: P. L. Reiher, F. Wieland, D. Jefferson
Venue: Proceedings of the 21st conference on Winter simulation (1989)

Optimistic systems execute events out of order and must undo their errors to produce correct results. Undoing incorrect work can be expensive. By restraining their optimism, such systems might execute fewer events out of order and thereby run faster. This paper examines two methods tested in the Time Warp Operating System. The first method explicitly prevents events from executing in the far simulation future. The second method tries to identify objects that are doing work that has to be undone; such objects are allowed to execute less often. Experimental results show that only modest gains were realized, and that even these gains were unpredictable. While other methods remain untested, the value of limiting optimism seems small.
Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem
Authors: R. Brown
Venue: Communications of the ACM (1988)

A new priority queue implementation for the future event set problem is described in this article. The new implementation is shown experimentally to be O(1) in queue size for the priority increment distributions recently considered by Jones in his review article. It displays hold times three times shorter than splay trees for a queue size of 10,000 events. The new implementation, called a calendar queue, is a very simple structure of the multiple list variety using a novel solution to the overflow problem.
Fault Injection Experiments Using FIAT
Authors: J. H. Barton, E. W. Czeck, Z. Z. Segall, D. P. Siewiorek
Venue: IEEE Transactions on Computers (1990)

The results of several experiments conducted using the fault-injection-based automated testing (FIAT) system are presented. FIAT is capable of emulating a variety of distributed system architectures, and it provides the capabilities to monitor system behavior and inject faults for the purpose of experimental characterization and validation of a system's dependability. The experiments consists of exhaustively injecting three separate fault types into various locations, encompassing both the code and data portions of memory images, of two distinct applications executed with several different data values and sizes. Fault types are variations of memory bit faults. The results show that there are a limited number of system-level fault manifestations. These manifestations follow a normal distribution for each fault type. Error detection latencies are found to be normally distributed. The methodology can be used to predict the system-level fault responses during the system design stage.
A data/knowledge base management testbed and experimental results on data/knowledge base query and update processing
Authors: R. Ramnarayan, H. Lu
Venue: ACM SIGMOD Record (1988)

This paper presents our experience in designing and implementing a data/knowledge base management testbed. The testbed consists of two layers, the knowledge manager and the database management system, with the former at the top. The testbed is based on the logic programming paradigm, wherein data, knowledge, and queries are all expressed as Horn clauses. The knowledge manager compiles pure, function-free Horn clause queries into embedded-SQL programs, which are executed by the database management system to produce the query results. The database management system is a commercial relational database system and provides storage for both rules and facts. First, the testbed architecture and major data structures and algorithms are described. Then, several preliminary tests conducted using the current version of the testbed and the conclusions from the test results are presented. The principal contributions of this work have been to unify various concepts, both previously published and new ones we developed, into a real system and to present several insights into data/knowledge base management system design gleaned from the test results and our design and implementation experience.
A logic of authentication
Authors: M. Burrows, M. Abadi, R. Needham
Venue: Proceedings of the twelfth ACM symposium on Operating systems principles (1989)

Authentication protocols are the basis of security in many distributed systems, and it is therefore essential to ensure that these protocols function correctly. Unfortunately, their design has been extremely error prone. Most of the protocols found in the literature contain redundancies or security flaws. A simple logic has allowed us to describe the beliefs of trustworthy parties involved in authentication protocols and the evolution of these beliefs as a consequence of communication. We have been able to explain a variety of authentication protocols formally, to discover subtleties and errors in them, and to suggest improvements. In this paper, we present the logic and then give the results of our analysis of four published protocols, chosen either because of their practical importance or because they serve to illustrate our method.
Direct Analytical Methods for Solving Poisson Equations in Computer Vision Problems
Authors: T. Simchony, R. Chellappa, M. Shao
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

Direct analytical methods are discussed for solving Poisson equations of the general form Delta u=f on a rectangular domain. Some embedding techniques that may be useful when boundary conditions (obtained from stereo and occluding boundary) are defined on arbitrary contours are described. The suggested algorithms are computationally efficient owing to the use of fast orthogonal transforms. Applications to shape from shading, lightness and optical flow problems are also discussed. A proof for the existence and convergence of the flow estimates is given. Experiments using synthetic images indicate that results comparable to those using multigrid can be obtained in a very small number of iterations.
An expert system for configuring a device simulator for semiconductor structures
Authors: P. Conradi, D. Schroder, Peter Schefe
Venue: Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1988)

As simulation is both indispensable and expensive in semiconductor device development, it is quite desirable to attempt any effort reducing the computing costs by more intelligent configuration. These knowledge intensive processes are partly automated by a prototype expert system (called CoDeX). The paper will describe the embedding context, of the expert system, the concept of CoDeX, some of the implementation problems in the given environment, the provisional achievements, and will give an outlook on further work.
Reducing Contention in Shared-Memory Multiprocessors
Authors: Per Stenström
Venue: Computer (1988)

The techniques that can be used to design a memory system that reduces the impact of contention are examined. To exemplify the techniques, the implementations and the design decisions taken in each are reviewed. The discussion covers memory organization, interconnection networks, memory allocation, cache memory, and synchronization and contention. The multiprocessor implementations considered are C.mmp, CM*, RP3, Alliant FX, Cedar, Butterfly, SPUR, Dragon, Multimax, and Balance.
The Software Life Cycle Support Environment (SLCSE): a computer based framework for developing software systems
Authors: Tom Strelich
Venue: Proceedings of the third ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments (1989)

The Software Life Cycle Support Environment (SLCSE) is a VAX/VMS-based software development environment framework which presents a common and consistent user interface accessing a comprehensive set of software development tools supporting the full spectrum of DOD-STD-2 167A software life cycle activities from Requirements Analysis to Maintenance. These tools utilize a Project Database which maintains information relevant not only to the software under development (e.g., requirements allocation, software interfaces, etc.), but also information relating to the project as a whole (e.g., schedules, milestones, Quality Assurance, Configuration Management, etc.). The Project Database supports the DOD-STD-2167A life cycle model and associated Data Item Descriptions (DIDs). SLCSE's framework approach supports the integration of new tools into the environment and permits the SLCSE to evolve over time and adapt to advances in software engineering technology.
Performance-Measurement Tools in a Multiprocessor Environment
Authors: H. Burkhart, R. Millen
Venue: IEEE Transactions on Computers (1989)

A family of monitoring facilities is proposed which are used in combination, e.g. a breakpoint monitor used for debugging purposes, a mailbox monitor for analysis of synchronization traffic, and a bus monitor for measurements of bus load. These tools are used in multi-monitor mode, for which both a common programming-language interface and a user interface are provided. Design concepts are presented, along with the overall structure of such an integrated monitoring tool set in a multiprocessor environment. How a combination of hardware and software monitors is embedded into a MODULA-2 multiprocessor environment is outlined, as a case study.
Register allocation across procedure and module boundaries
Authors: Vatsa Santhanam, Daryl Odnert
Venue: Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation (1990)

This paper describes a method for compiling programs using interprocedural register allocation. A strategy for handling programs built from multiple modules is presented, as well as algorithms for global variable promotion and register spill code motion. These algorithms attempt to address some of the shortcomings of previous interprocedural register allocation strategies. Results are given for an implementation on a single register file RISC-based architecture.
A Note on the Computational Cost of the Linearizer Algorithm for Queueing Networks
Authors: E. de Souza e Silva, R. R. Muntz
Venue: IEEE Transactions on Computers (1990)

Linearizer is one of the best known approximation algorithms for obtaining numeric solutions for closed-product-form queueing networks. In the original exposition of Linearizer, the computational cost was stated to be O(MK/sup 3/) for a model with M queues and K job classes. It is shown that with some straightforward algebraic manipulation, Linearizer can be modified to require a cost that is only O(MK/sup 2/).
An acyclicity theorem for cell complexes in d dimensions
Authors: H. Edelsbrunner
Venue: Proceedings of the fifth annual symposium on Computational geometry (1989)

Let C be a cell complex in d-dimensional Euclidean space whose faces are obtained by orthogonal projection of the faces of a convex polytope in d + 1 dimensions. For example, the Delaunay triangulation of a finite point set is such a cell complex. This paper shows that the in_front/behind relation defined for the faces of C with respect to any fixed viewpoint x is acyclic. This result has applications to hidden line/surface removal and other problems in computational geometry.
Legal reasoning - a jurisprudential description
Authors: P. Wahlgren
Venue: Proceedings of the 2nd international conference on Artificial intelligence and law (1989)

This paper provides a description of a legal reasoning process. The presentation originates from a research project combining Law and Artificial Intelligence (AI) and contains theoretical results from system-developing activities that have been carried out in cooperation with the Swedish Court Administration and a major Swedish employer's association. The research project, and several parallel projects at the Swedish Law and Informatics Research Institute (IRI), is being documented in the series IRI-reports. Related work, especially focusing on computerized formalization of legal norms and legal decision processes from a jurisprudential perspective is carried out at The Norwegian Research Center for Computers and Law, but contributions have also been made by many others1 and legal reasoning has been investigated from somewhat different perspectives2.
An introduction to the parallel distributed processing model of cognition and some examples of how it is changing the teaching of artificial intelligence
Authors: George M. Whitson
Venue: ACM SIGCSE Bulletin (1988)

Artificial Intelligence programming involves representing knowledge, using paradigms to manipulate the knowledge, and having a learning process modify both the knowledge and the paradigms. One could consider this process as building a model of how one thinks, i.e. how the brain operates at the cognitive psychology level [2]. Recently, cognitive scientists have developed a model of how one thinks at the neural level. This model is called the Parallel Distributed Processing (PDP) model of cognition and is described in the definitive work of Rumelhart and McClelland [1]. The idea that we can actually model the brain as an electrical network of neurons and then develop Artificial Intelligence in terms of the model is extremely attractive. The program has had some success, especially in the area of sensory perception and motor activity, but still has some problems to overcome before it can be said to be the ideal foundation for Artificial Intelligence. Much of the power of the PDP model derives from the learning algorithms. In this paper we consider a classification of learning algorithms that helps to organize the many developing techniques seen in the literature. We also discuss how the PDP model is changing the way we teach Artificial Intelligence. This is an important aspect of the PDP model, since the model has produced a number of new problem-solving techniques for Artificial Intelligence as well as holding out the promise of a better foundation for the basic theory of this field. If the PDP model fulfills its promise we would develop Artificial Intelligence programs that are really intelligent rather than programs that only appear to be intelligent.