ppxscal/embedding_network huggingface dataset:
A partitioned translation lookaside buffer approach to reducing address bandwith (abstract)
Authors: Matthew Farrens, Arvin Park, Rob Fanfelle, Pius Ng, Gary Tyson
Venue: ACM SIGARCH Computer Architecture News (1992)

Simulations indicate a simple modification of existing virtual memory hardware can significantly reduce the number of pins required to transmit address information from processor to off-chip memory. This modification consists of partitioning a TLB so that virtual page numbers are stored in a cache on the processor and corresponding real page numbers are sotred in registers at the memory, making it possible to transmit a small register index instead of the entire real page number.
Lazy evaluation of C++ static constructors
Authors: Marc Sabatella
Venue: ACM SIGPLAN Notices (1992)

Static constructors in C+ + are functions that are executed implicitly to initialize objects at run time. Although a C+ + implementation is allowed to defer the construction of objects defined in a given translation unit until the first use of any function or object defined in that translation unit, most implementations execute all static constructors for the entire program before the invocation of main(). In this paper, we describe an implementation that defers the execution of static constructors for objects defined by a translation unit in a shared library until the first potential access of any function or object defined in that translation unit. This design relies on the deferred dynamic binding facility provided by the HP-UX shared library implementations. We describe how to modify our design to apply to statically linked programs as well, while avoiding most of the overhead normally associated with dynamic linking.
A Visual Language Compiler for Information Retrieval by Visual Reasoning
Authors: Shi-Kuo Chang
Venue: IEEE Transactions on Software Engineering (1990)

When a database increases in size, retrieving the data becomes a major problem. An approach based on data visualization and visual reasoning is described. The main idea is to transform the data objects and present sample data objects in a visual space. The user can use a visual language to incrementally formulate the information retrieval request in the visual space. A prototype system is described with the following features: (1) it is built on top of the SIL-ICON visual language compiler and therefore can be customized for different application domains; (2) it supports a fuzzy icon grammar to define reasonable visual sentences; (3) it incorporates a semantic model of the database for fuzzy visual query translation; and (4) it incorporates a VisualNet which stores the knowledge learned by the system in its interaction with the user so that the VisualReasoner can adapt its behavior.
A Performance Comparison of the IBM RS/6000 and the Astronautics ZS-1
Authors: William Mangione-Smith, Santosh G. Abraham, Edward S. Davidson
Venue: Computer (1991)

A performance evaluation method for comparing and improving concurrent uniprocessor architectures is introduced, and a detailed case study of its application to two machines is reported. The architectures of the machines, the IBM RS/6000 and the Astronautics ZS-1, are described. The measured performance is given, and a model that yields hard bounds on a machine's performance on a benchmark is presented. The sources of performance loss, i.e. the difference between the model-derived bounds and the measured performance, are examined, and areas for improving the architectures are determined.
Wu's method and the Khovanskii finiteness theorem
Authors: Daniel Richardson
Venue: Journal of Symbolic Computation (1991)

The Khovanskii finiteness theorem calculates an upper bound for the number of connected components of the intersection of an algebraic set with a Pfaff manifold in R^n. This paper uses the algebraic methods of Wu Wen-tsun to give an elementary pioof of Khovanskii's theorem. An extension of the Wu-Ritt zero structure theorem is also obtained.
Automatic resumption mechanism for program debugging
Authors: Takao Shimomura
Venue: ACM SIGSOFT Software Engineering Notes (1991)

In program debugging, tracing control instructions that examine internal program states can be saved in a file and this file can be used to initialize the debugging environment when a program is loaded by a debugger. When a source program is modified because of bugs, however, source line numbers are also changed. It is therefore necessary to update the source line numbers in a tracing control instruction file according to the modifications in the source program. This paper proposes a solution by means of an automatic resumption mechanism that simplifies the debugging procedure from source modification to the beginning of the next debugging. While a programmer is creating an executable program using make after he has modified the program, the tracing control instruction file is updated automatically, so the programmer does not even have to think of updating them. This mechanism makes it very easy to resume debugging with the same debugging environment after program modification.
Towards the Automatic Generation of Software Diagrams
Authors: L. Beth Protsko, Paul G. Sorenson, J. Paul Tremblay, Douglas A. Schaefer
Venue: IEEE Transactions on Software Engineering (1991)

The authors formulate the criteria for drawing dataflow diagrams and describe the placement and routing algorithms used in a system called MONDRIAN. A generalized approach to the question of software diagrams is proposed based on the authors' experience with MONDRIAN and a metasystem approach to the creation of CASE (computer-aided software engineering) environments. A formal approach to the definition of software objects and their graphical representation is given. The use of location constraints as a basis for generalized layout algorithms is discussed.
Formal object-oriented methods in communication standards
Authors: Elspeth Cusack, Gregor von Bochmann
Venue: ACM SIGPLAN OOPS Messenger (1992)

Communication standards are specifications or models of protocols and related systems. To be fit for their purpose they must be sufficiently abstract to be implementation-independent and free from substantial errors, as they will be used many times, and mistakes found after publication are extremely costly. Such standards --- especially Open Systems Interconnection (OSI) --- have therefore over the past ten years been a fruitful area for the trial of formal techniques[l, 3].
On deftly introducing procedural elements into unification parsing
Authors: R. Bobrow, Lane Ramshaw
Venue: Proceedings of the workshop on Speech and Natural Language (1990)

Unification grammars based on complex feature structures are theoretically well-founded, and their declarative nature facilitates exploration of various parsing strategies. However, a straightfoward implementation of such parsers can be painfully inefficient, exploding lists of possibilities and failing to take advantage of search control methods long utilized in more procedurally-oriented parsers. In the context of BBN's Delphi NL system, we have explored modifications that gain procedural efficiency without sacrificing the theoretical advantages of unification-based CFG's.
An overview of construction-integration model: a theory of comprehension as a foundation for a new cognitive architecture
Authors: Cathleen Wharton, Walter Kintsch
Venue: ACM SIGART Bulletin (1991)

The Construction-Integration Model is a theory of discourse comprehension that is being used as the foundation for a new Integrated Intelligent Architecture. It is a hybrid model, combining symbolic features with connectionist techniques, that emphasizes bottom-up, data-driven comprehension processes over more rigid top-down search strategies. Recent work has focussed on using the Model to simulate problem solving behavior as might be seen during routine computing tasks. As a consequence of this latter work, we are extending the Model even further so that it can be considered a general purpose Cognitive Architecture so that it can be compared to other architectures.
TOOLI: Table Object-Oriented Language Interface
Authors: Brian Meyerpeter, Razan Diab
Venue: ACM SIGPLAN OOPS Messenger (1992)

Object-oriented database management systems address complexity and conceptual modeling but lack standards, availability, and reliability. Object-oriented programming interfaces to object-oriented databases address application extendibility and flexibility but also lack standards. Relational database systems are available and robust, but their programming interfaces, although standardized, do not offer the benefits that object-oriented systems provide. This paper presents the requirements and design of the Table Objected-Oriented Language Interface (TOOLI), a database independent, SQL based, object-oriented application programming interface to relational database management systems. We give examples of inheritance structures used by TOOLI that represent different queries.
Are complete K-trees something more than decision trees?
Authors: Gabriel Valiente
Venue: ACM SIGART Bulletin (1991)

I have just read the research report "Using Complete K-Trees to Generate Code in Pascal for an Expert System" by Dr. Edward N. Schwartz, appeared in SIGART Bulletin 1(2): 12--13. The report first presents K-trees as an "implementation independent method of knowledge representation," useful "in all stages of expert system development." The idea of a complete K-tree is then introduced, in which all possible values of every property are explicitly recorded in the tree. As this is the central result presented in the report, I think it deserves some comments.
Comparison of priority rules in pattern matching and term rewriting
Authors: Alain Laville
Venue: Journal of Symbolic Computation (1991)

Programming languages such as ML provide function calls with pattern matching. For each function, there is a given set of patterns for arguments with the corresponding definition of the function. Cases corresponding to different patterns of a given function may not be exclusive, and often a priority rule (typically the order of the program text) is followed to disambiguate overlapping cases. In this paper, term rewriting systems are taken as models for function calls with pattern matching. It is shown that, in the useful set of constructors based linear systems, all priority rules are essentially equivalent. Moreover the translation from one rule to another one may be mechanically done. These results hold both for lazy and eager evaluations.
Theorem proving using equational matings and rigid E-unification
Authors: Jean Gallier, Paliath Narendran, Stan Raatz, Wayne Snyder
Venue: Journal of the ACM (JACM) (1992)

In this paper, it is shown that the method of matings due to Andrews and Bibel can be extended to (first-order) languages with equality. A decidable version of E-unification called rigid E-unification is introduced, and it is shown that the method of equational matings remains complete when used in conjunction with rigid E-unification. Checking that a family of mated sets is an equational mating is equivalent to the following restricted kind of E-unification. Problem Given E&ar;=Ei&mid; 1&le;i&le;n a family of n finite sets of equations and S=ui,vi &mid;1&le;i&le;n a set of n pairs of terms, is there a substitution q such that, treating each set qEi as a set of ground equations (i.e., holding the variables in qEi &ldquo;rigid&rdquo;), qui , and qvi are provably equal from qEi for i=1,...,n ? Equivalently, is there a substitution q such that qui and qvi can be shown congruent from qEi by the congruence closure method for i=1,...,n ? A substitution q solving the above problem is called a rigid E&ar; -unifier of S, and a pair E&ar;,S such that S has some rigid E&ar; -unifier is called an equational premating. It is show that deciding whether a pair E&ar;,S is an equational premating is an NP-complete problem.
Merging expert systems with multimedia technology
Authors: Janice C. Sipior, Edward J. Garrity
Venue: ACM SIGMIS Database (1992)

Traditional methods of interaction with ES can be a burden to users who are forced to translate conceptualizations of problem attributes and characteristics into text form and then convert back to conceptualizations in interpreting and recommending solutions. This burden can be relieved by merging ES with multimedia technology. In addition to text, the user would be able to selectively access information with graphics, full-motion video, or animation; and hear with stereo sound, voice recording, or music. Such a combination provides a powerful interactive interface enabling the various facets of expertise to be more fully communicated to the user. This article describes multimedia expert systems and considerations for implementing them.
Undirected Graph Models for System-Level Fault Diagnosis
Authors: Andrzej Pelc
Venue: IEEE Transactions on Computers (1991)

The author considers two comparison-based diagnosis models previously introduced by K.Y. Chwa et al. (1981) and M. Malek (1980). For each of them, classical t-diagnosability and probabilistic diagnosability based on the maximum likelihood principle are discussed, probabilistic model for comparison testing is introduced. In all considered models, optimal diagnosable systems, i.e., those which use the least possible number of testing links, are designed. These systems have a linear number of links and can be diagnosed in linear time. It is proved, however, that for general systems, both diagnosis and diagnosability problems are NP-hard. The model is used for fault diagnosis of multiprocessor systems.
CLOS: integrating object-oriented and functional programming
Authors: Richard P. Gabriel, Jon L. White, Daniel G. Bobrow
Venue: Communications of the ACM (1991)

Lisp has a long history as a functional language,* where action is invoked by calling a procedure, and where procedural abstraction and encapsulation provide convenient modularity boundaries. A number of attempts have been made to graft object-oriented programming into this framework without losing the essential character of Lisp&mdash;to include the benefits of data abstraction, extensible type classification, incremental operator definition, and code reuse through an inheritance hierarchy. The Common Lisp Object System (CLOS) [3], a result of the ANSI standardization process for Common Lisp, represents a marriage of these two traditions. This article explores the landscape in which the major object-oriented facilities exist, showing how the CLOS solution is effective within the two contexts.
Database programming with delayed updates
Authors: Dean Jacobs, Richard Hull
Venue: Proceedings of the third international workshop on Database programming languages : bulk types persistent data: bulk types persistent data (1992)

There are a variety of advanced database features which require the ability to manipulate &ldquo;virtual&rdquo; database states along with the actual stored state; examples of this include rule-based triggers in active databases, supports for hypothetical reasoning, and some concurrent transaction processing system. This paper introduces the database programming language Heraclitus[Rel], which provides a general framework for experimenting with the semantics and implementation of virtual states. The primary novel feature presented is the notation of a delayed update or delta, which is a first-class value representing a set of proposed modifications to the state. Deltas can be created, inspected, and combined without committing to the given modifications. Heraclitus[Rell] provides a rich relational calculus sublanguage that can be used to compute relations and deltas. The usual notion of &ldquo;safety&rdquo; for calculus formulas is extended to support both a sophisticated notion of quantifiers and the use of variables and functions defined elsewhere in a program. Safe formulas can be translated into extended relational algebra expressions for evaluation.
The use of commercial natural language interface in the ATIS task
Authors: Evelyne Tzoukermann
Venue: Proceedings of the workshop on Speech and Natural Language (1991)

A natural language interface for relational databases has been utilized at AT amp;T Bell Laboratories as the natural language component of the DARPA ATIS common task. This is a part of a larger project that consists of incorporating a natural language component into the Bell Laboratories Speech Recognizer.The commercially available system used in this project was developed by Natural Language Incorporation (NLI), in particular by J. Ginsparg [Ginsparg, 1976]. We relate our experience in adapting the NLI interface to handle domain dependent ATIS queries. The results of this allowed the exploration of several important issues in speech and natural language:1. the feasabilitiy of using an off-the-shelf commercial product for a language understanding front end to a speech recognizer,2. the constraints of using a general-purpose product for a specific task.
Error handling in large, object-based Ada systems
Authors: Philippe Kruchten
Venue: ACM SIGAda Ada Letters (1990)

The purpose of this paper is to show the kind of problems that appear while using a "schoolbook" error-handling strategy based on Ada exceptions in large, object-based systems.' The paper will show that the common solutions used to alleviate those problems are inadequate, and it will suggest two alternative strategies.
One dimensional motion tailoring for the disabled: a user study
Authors: Randy Pausch, Laura Vogtle, Matthew Conway
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

The Tailor project allows physically disabled users to provide real-time analog input to computer applications. We use a Polhemus tracking device and create a custom tailored mapping from each user's best range and type of motion into the analog control signal. The application is a simple video game based on Pong, where the analog input controls the position of the player's paddle. A group of able-bodied subjects was able to correctly hit the ball with the paddle 77% of the time, and a comparison group of children with Cerebral Palsy performed at the 50% level. More than half the disabled users were able to perform at a higher level than the worst able-bodied user.
A VHDL design environment
Authors: Alan R. Martello, Steven P. Levitan
Venue: ACM SIGDA Newsletter (1991)

Hardware Description Languages (HDLs) provide a way to textually represent physical electronic systems [1,2]. They are used for description, documentation, and communication of digital electronic designs. More recently, they have been used for design verification, simulation, and synthesis. One language, the V(HSIC) hardware description language (VHDL) is now an IEEE standard [3].
Algebraic surface design with Hermite interpolation
Authors: Chanderjit L. Bajaj, Insung Ihm
Venue: ACM Transactions on Graphics (TOG) (1992)

This paper presents an efficient algorithm called Hermite interpolation, for constructing low-degree algebraic surfaces, which contain, with C1 or tangent plane continuity, any given collection of points and algebraic space curves having derivative information. Positional as well as derivative constraints on an implicitly defined algebraic surface are translated into a homogeneous linear system, where the unknowns are the coefficients of the polynomial defining the algebraic surface. Computaional details of the Hermite interpolation algorithm are presented along with several illustrative applications of the interpolation technique to construction of joining or blending surfaces for solid models as well as fleshing surfaces for curved wire frame models. A heuristic approach to interactive shape control of implicit algebraic surfaces is also given, and open problems in algebraic surface design are discussed.
Tools for Distributed Application Management
Authors: Keith Marzullo, Robert Cooper, Mark D. Wood, Kenneth P. Birman
Venue: Computer (1991)

The issues of managing distributed applications are discussed, and a set of tools, the meta system, that solves some longstanding problems is presented. The Meta model of a distributed application is described. To make the discussion concrete, it is shown how NuMon, a seismological analysis system for monitoring compliance with nuclear test-ban treaties is managed within the Meta framework. The three steps entailed in using Meta are described. First the programmer instruments the application and its environment with sensors and actuators. The programmer then describes the application structure using the object-oriented data modeling facilities of the authors' high-level control language, Lomita. Finally, the programmer writes a control program referencing the data model. Meta's performance and real-time behavior are examined.
Evaluation of the CMU ATIS system
Authors: Wayne Ward
Venue: Proceedings of the workshop on Speech and Natural Language (1991)

The CMU Phoenix system is an experiment in understanding spontaneous speech. It has been implemented for the Air Travel Information Service task. In this task, casual users are asked to obtain information from a database of air travel information. Users are not given a vocabulary, grammar or set of sentences to read. They compose queries themselves in a spontaneous manner. This task presents speech recognizers with many new problems compared to the Resource Management task. Not only is the speech not fluent, but the vocabulary and grammar are open. Also, the task is not just to produce a transcription, but to produce an action, retrieve data from the database. Taking such actions requires parsing and "understanding" the utterance. Word error rate is not as important as utterance understanding rate.Phoenix attempts to deal with phenomena that occur in spontaneous speech. Unknown words, restarts, repeats, and poorly formed or unusual grammar are common is spontaneous speech and are very disruptive to standard recognizers. These events lead to misrecognitions which often cause a total parse failure. Our strategy is to apply grammatical constraints at the phrase level and to use semantic rather than lexical grammars. Semantics provide more constraint than parts of speech and must ultimately be delt with in order to take actions. Applying constraints at the phrase level is more flexible than recognizing sentences as a whole while providing much more constraint than word-spotting. Restarts and repeats are most often between phase occurences, so individual phrases can still be recognized correctly. Poorly constructed grammar often consists of well-formed phrases, and is often semantically well-formed. It is only syntactically incorrect. We associate phrases by frame-based semantics. Phrases represent word strings that can fill slots in frames. The slots represent information which the frame is able to act on.The current Phoenix system uses a bigram language model with the Sphinx speech recognition system. The top-scoring word string is passed to a flexible frame-based parser. The parser assigns phrases (word strings) from the input to slots in frames. The slots represent information content needed for the frame. A beam of frame hypotheses is produced and the best scoring one is used to produce an SQL query.
Task-Aware user interfaces
Authors: Jasmina Pavlin
Venue: ACM SIGCHI Bulletin (1990)

While the demand for computer systems that are more and more complex in terms of size and variety of applications is steadily increasing, design support tools and abstraction mechanisms for such systems are lagging badly behind. This places an increased burden on users and software developers alike. We believe that making the knowledge about the user's tasks and about the system's functionality explicit can reduce this burden significantly.