ppxscal/embedding_network huggingface dataset:
Designing conceptual models of dialog: a case for dialog charts
Authors: Gad Ariav, Linda-Jo Calloway
Venue: ACM SIGCHI Bulletin (1988)

The conceptual design of user interfaces focuses on the specification of the structure of the dialog, independent of any particular implementation approach. The intensifying discussion of conceptual dialog models is an inevitable result of the recent consolidation of a dialog management paradigm. This paradigm partitions a system/user dialog into three generic functions: the processing of syntax, the processing of control and the processing of the applications (Figure 1-1). This conceptualization essentially underlies a wide array of contemporary dialog models, expressed in various terminologies. The control processor maintains and enforces the dialog structure, practically defining the set of permissible dialogs, keeping track of the sequencing of user-system activities and maintaining the contextual information about the interaction.
Computing modular and projective character degrees of soluble groups
Authors: S. B. Conlon
Venue: Journal of Symbolic Computation (1990)

Let G be a finite soluble group and r a rational prime or zero. Let Z be a central cyclicsubgroup of G, if r>0, then the order of Z is relatively prime to r. Let F be an algebraically closed field of characteristic r. Let @l be a faithful linear character of Z in F. Such a @l gives rise to a factor system f for H=G/Z and any factor system for H in F so arises. An algorithm for determining the degrees of those irreducible representations of G, which restrict to Z to give the scalar representation, @l, is presented. If Z is the trivial subgroup, the algorithm can be used to compute the degrees of all FG-irreducibles (together with multiplicities); in particular, the number of conjugacy classes of G and for any prime r(>0), the number of r-regular conjugacy classes of G are determined. If Z is nontrivial, the same results are obtained for the twisted group algebra F"fH with respect to f. The starting point is a power-commutator presentation for G; only the supposed characteristic r of field F is used and the calculations are performed in sections of G. Clifford's theorem is used as the basic reduction tool.
Inheritance in smalltalk-80: a denotational definition
Authors: S. Kamin
Venue: Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1988)

A denotational semantic definition of SMALLTALK-80 is given. Its most notable characteristic is a surprisingly simple treatment of inheritance. An executable version of the semantics, written in STANDARD ML, is also described.
Using Occupancy Grids for Mobile Robot Perception and Navigation
Authors: A. Elfes
Venue: Computer (1989)

An approach to robot perception and world modeling that uses a probabilistic tesselated representation of spatial information called the occupancy grid is reviewed. The occupancy grid is a multidimensional random field that maintains stochastic estimates of the occupancy state of the cells in a spatial lattice. To construct a sensor-derived map of the robot's world, the cell state estimates are obtained by interpreting the incoming range readings using probabilistic sensor models. Bayesian estimation procedures allow the incremental updating of the occupancy grid, using readings taken from several sensors over multiple points of view. The use of occupancy grids from mapping and for navigation is examined. Operations on occupancy grids and extensions of the occupancy grid framework are briefly considered.
Pattern Representations and Syntactic Classification of Radar Measurements of Commercial Aircraft
Authors: O. S. Sands, F. D. Garber
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

A syntactic pattern recognition system is evaluated for applications to radar signal identification. Three different level-crossing-based pattern representation algorithms are considered. The utility of the resulting symbolic pattern representations is assessed by evaluating the performance of a maximum-likelihood classifier when the observed symbol strings are used as inputs to the decision algorithm. A syntax analysis algorithm is derived from the likelihood function classifier. Performance results of simulated classification experiments for both maximum-likelihood and language-theoretic classifiers are presented.
Logic-based approach to semantic query optimization
Authors: Upen S. Chakravarthy, John Grant, Jack Minker
Venue: ACM Transactions on Database Systems (TODS) (1990)

The purpose of semantic query optimization is to use semantic knowledge (e.g., integrity constraints) for transforming a query into a form that may be answered more efficiently than the original version. In several previous papers we described and proved the correctness of a method for semantic query optimization in deductive databases couched in first-order logic. This paper consolidates the major results of these papers emphasizing the techniques and their applicability for optimizing relational queries. Additionally, we show how this method subsumes and generalizes earlier work on semantic query optimization. We also indicate how semantic query optimization techniques can be extended to databases that support recursion and integrity constraints that contain disjunction, negation, and recursion.
Collaborative document production using quilt
Authors: Mary D. P. Leland, Robert S. Fish, Robert E. Kraut
Venue: Proceedings of the 1988 ACM conference on Computer-supported cooperative work (1988)

Quilt is a computer-based tool for collaborative document production. It provides annotation, messaging, computer conferencing, and notification facilities to support communication and information sharing among the collaborators on a document. Views of a document tailored to individual collaborators or to other of the document's users are provided by Quilt based on the user's position in a permission hierarchy that reflects an extensible set of social roles and communication types. This paper illustrates how Quilt could be used by collaborators to produce a document.
Introduction to SIMFACTORY 11.5
Authors: M. C. Rohbough
Venue: Proceedings of the 21st conference on Winter simulation (1989)

This paper provides a brief introduction to SIMFACTORY and explains how models can be developed without programming. The type of users who benefit most from SIMFACTORY, the types of systems SIMFACTORY can model, and the various implementations of SIMFACTORY are also described.
Simulating Essential Pyramids
Authors: R. Miller, Q. F. Stout
Venue: IEEE Transactions on Computers (1988)

Pyramid computers, and more generally pyramid algorithms, for image processing have the advantage of providing regular structure with a base naturally identified with an input image and a logarithmic height that permits rapid reduction of information. It is shown that it is possible to simulate systematically the effect of having a separate, so-called 'essential' pyramid over each object, greatly simplifying algorithm development since algorithms can be written assuming that there is only a single object. This approach can yield optimal or nearly optimal algorithms for the pyramid computer and can also be used on nonpyramid architectures such as the hypercube, mesh-of-trees, mesh, mesh with row and column buses, mesh with reconfigurable buses, and PRAM (parallel random-access machine). For several of these architectures, the simulated essential pyramids can simultaneously execute an algorithm nearly as fast as a pyramid computer over a single object.
Computing algebraic formulas with a constant number of registers
Authors: Richard Cleve
Venue: Proceedings of the twentieth annual ACM symposium on Theory of computing (1988)

We show that, over an arbitrary ring, the functions computed by polynomial-size algebraic formulas are also computed by polynomial-length algebraic straight-line programs which use only 3 registers (or 4 registers, depending on some definitions). We also show that polynomial-length products of 3 &times; 3 matrices compute precisely those functions that polynomial-size formulas compute (whereas, for general rings, polynomial-length 3-register straight-line programs compute strictly more functions than polynomial-size formulas). This can be viewed as an extension of the results of Barrington in [Ba1,Ba2] from the Boolean setting to the algebraic setting of an arbitrary ring.
Qlisp: experience and new directions
Authors: Ron Goldman, Richard P. Gabriel
Venue: Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems (1988)

Qlisp, a dialect of Common Lisp, has been proposed as a multiprocessing programming language which is suitable for studying the styles of parallel programming at the medium-grain level. An initial version of Qlisp has been implemented on a multiprocessor and a number of experiments with it conducted. This paper describes the implementation, reports on some of the experiments, and presents some new constructs that are suggested from programming experience with Qlisp.
Comments on &ldquo;the law of demeter&rdquo; and C++
Authors: M. Sakkinen
Venue: ACM SIGPLAN Notices (1988)

A rule of good style for object-oriented programming has recently been put forward, actually in several flavours (class vs. object, weak vs. strong). Some possible problems in the original rule are discussed, and a modified formulation is proposed to overcome at least part of the them. Doubts still remain about how useful the rule is with Smalltalk and other untyped languages. Then the application of the rule to the C++ language is studied and shown not to be as straightforward as has been suggested. This is largely a consequence of the intertwining of the conventional and the object-oriented component in C++. On the other hand, being typed, it is a promising language for enforcing rules of this kind at compile time. A new language-specific formulation is finally presented, argumenting that it is better in class than object flavour.
A Distributed Algorithm for Performance Improvement Through File Replication, File Migration, and Process Migration
Authors: Anna Hac
Venue: IEEE Transactions on Software Engineering (1989)

The author presents a distributed algorithm that considers the number of read and write accesses to files for every process type, the number of processes and their demands on system resources, the utilization of bottlenecks on all machines, and file sizes. Performance improvement obtained with the algorithm is discussed and proved. A number of experiments executed in a distributed system in order to predict the impact on performance of various algorithm strategies are examined. The experiments show changes in system performance due to file and process placement, file replication, and file and process migration.
Objects for distributed systems
Authors: M. Jazayeri
Venue: Proceedings of the 1988 ACM SIGPLAN workshop on Object-based concurrent programming (1988)

By examining the structure of distributed programs, we derive some requirements for the object paradigm to support the design and development distributed systems.
Settings and the setting structure: the description and automated propagation of networks for perusing videodisk image states
Authors: A. Parkes
Venue: ACM SIGIR Forum (1989)

This paper describes a system for formally representing spatial relationships between videodisc image states called settings. A number of setting relations are defined, these being based on the manipulations of the camera typically used in the production of the moving film: zooming in or out, panning etc.. An algorithm is presented which, given a limited level of initial specification by a describer, will constrain, where possible, the setting relations holding between all pairs of settings. The resulting network is called the settings structure. The paper begins by placing the settings structure into the context of its being one part of the CLORIS system.
Decidable optimization problems for database logic programs
Authors: Stavros Cosmadakis, Haim Gaifman, Paris Kanellakis, Moshe Vardi
Venue: Proceedings of the twentieth annual ACM symposium on Theory of computing (1988)

Datalog is the language of logic programs without function symbols. It is used as a database query language. If it is possible to eliminate recursion from a Datalog program &Pgr;, then &Pgr; is said to be bounded. It is known that the problem of deciding whether a given Datalog program is bounded is undecidable, even for binary programs. We show here that boundedness is decidable for monadic programs, i.e., programs where the recursive predicates are monadic (the non-recursive predicates can have arbitrary arity). Underlying our results are new tools for the optimization of Datalog programs based on automata theory and logic. In particular, one of the tools we develop is a theory of two-way alternating tree automata. We also use our techniques to show that containment for monadic programs is decidable.
An information structure dealing with term dependance and polysemy
Authors: P. Schauble
Venue: Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval (1988)

An information structure (IS) that is regarded as a formal description of a domain of discourse is proposed. This IS is aimed at increasing the effectiveness of an information retrieval system. It is shown how the retrieval algorithm can take into account the term dependencies that are provided by the IS. Moreover, these term dependencies can be used by an automatic indexing procedure in order to interpret polysemic terms. The theoretical framework of our IS has some favorable properties. As a consequence, the construction and maintenance of such an IS is simpler than that of a thesaurus.
Using complete K-trees to generate code in Pascal for an expert system
Authors: Edward N. Schwartz
Venue: ACM SIGART Bulletin (1990)

For the past several years, my colleagues and I have been doing work with expert systems and the representation of the knowledge in those systems. We have previously reported on the effectiveness of K-trees, an implementation independent method of knowledge representation, in all of the stages of expert system development. We use K-trees for obtaining and recording heuristics, ordering rules, translating rules into an expert system using a shell, and for documenting the system.
The Gröbner fan of an ideal
Authors: Teo Mora, Lorenzo Robbiano
Venue: Journal of Symbolic Computation (1988)

To every ideal I in the polynomial ring A:=k[X"1,..., X"n] new invariants are attached, such as the Grobner Fan F(I), the Grobner region G(I) and the set ATO(I) of the almost term-orderings of I, i.e. orderings which ''behave like'' term-orderings with respect to I. These invariants arise by considering the reduced Grobner bases of I with respect to all the term-orderings. Moreover F(I), G(I), ATO(I) can be got in a constructive way, as we show by producing a suitable algorithm which computes them.
Designing the &ldquo;cockpit&rdquo;: the application of a human-centered design philosophy to make optimization systems accessible
Authors: L. Colgan, R. Spence, P. Rankin, M. D. Applerley
Venue: ACM SIGCHI Bulletin (1989)

The Cockpit is an interactive graphical display of results from analogue circuit optimization. It aims to overcome circuit designers' reluctance to use optimization systems by providing them with an interface that is easy and natural to use. The Cockpit presents the user with a 3D display which can be used both as a way of navigating the complex optimization data and as an overview of optimization progress. The Cockpit development process includes user interviews and rapid simulation of the user interface on a hypermedia system.
Computer hardware performance: production and cost function analyses
Authors: Y. M. Kang
Venue: Communications of the ACM (1989)

Based on microeconomics, computer hardware performance is analyzed using two methods. For the cost function analysis, both purchase and lease prices are used. The results show no economies of scale for the mainframes and superminis during the 1981-1985 period.
A method of generating stone wall patterns
Authors: Kazunori Miyata
Venue: Proceedings of the 17th annual conference on Computer graphics and interactive techniques (1990)

Recently, several kinds of mapping technology, such as texture mapping and bump mapping, have played a very important role in the realization of more realistic image synthesis. The textures to be mapped are often obtained by using an optical scanner or a video camera. However, it is not easy to obtain a suitable image by taking a photo. We consider it very important to be able to generate a variety of textures and patterns easily according to the requirements. This paper proposes a new method of generating stone wall patterns as a specific case of a generalized texture generator. The advantage of the method is that it allows the user to generate a variety of stone wall patterns by specifying a few simple parameters. We have applied it to a visual simulation system in order to represent such stone textures as walls, pavements, and steps. This paper also gives some examples of its applications.
Model-based fault diagnosis: knowledge acquisition and system design
Authors: Thomas H. Schmidt
Venue: Proceedings of the 2nd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1989)

Within this paper a model-based approach for knowledge-based diagnosis-systems is discussed. The model is derived from the fault recognition and fault searching techniques used by maintenance experts in general. The presented model has implications on the knowledge acquisition method in a way that only such data that are usually known to the maintenance expert have to be gathered and interlinked. This means that knowledge acquisition has only to deal with a knowledge source that can be prestructured. The model for knowledge-based diagnosis-systems and the knowledge acquisition method has been successfully used to develop diagnosis systems for a SMD-insertion machine and an extrusion machine. Time needed for knowledge acquistion has been reduced.
The Cambridge Fast Ring Networking System
Authors: A. Hopper, R. M. Needham
Venue: IEEE Transactions on Computers (1988)

A discussion is presented of the choices facing a designer as faster speeds for local area networks are contemplated. The 100-Mb/s Cambridge fast ring (CFR) is described. The ring protocol allows one of a number of fixed-size slots to be used once or repeatedly. The network design allows sets of rings to be constructed by pushing the bridge function to the lowest hardware level. Low cost and ease of use is normally achieved by design of special chips; two-chip VLSI implementation is described. This VLSI hardware forms the basis of a kit of parts from which many different network components can be constructed.
What can we teach about human-computer interaction? (plenary address)
Authors: Terry Winograd
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: Empowering people (1990)

This paper is the closing address for CHI '90. It addresses the problem of educating computer professionals in the area of human-computer interaction, arguing that standard approaches within computer science need to be augmented and that new models of education can aid us in producing students with broad competence in the design of computer systems for human use.
Incremental software test approach for DOD-STD-2167A Ada projects
Authors: M. Springman
Venue: Proceedings of the conference on Tri-Ada '89: Ada technology in context: application, development, and deployment (1989)

One of the key challenges for large Ada software projects is to define and execute an efficient, cost effective, bounded test program that results in a quality product that meets all customer software requirements. This is particularly challenging in the current climate of Government fixed price contracts. The Command Center Processing and Display System Replacement (CCPDS-R) project is being developed entirely in Ada by TRW for the U.S. Air Force on a fixed price basis. To mitigate downstream test risks, TRW has defined an incremental test approach that satisfies TRW and Government objectives for informal development/integration testing and for formal requirements verification. Features of Ada are employed to create a software architecture that supports an incremental test philosophy and contributes to reduced integration effort and risk. The resulting test approach conforms to DOD-STD-2167A standards.
Calculating characters of p-groups
Authors: S. B. Conlon
Venue: Journal of Symbolic Computation (1990)

A central problem in computational group theory is that of getting the table of ordinary characters for a finite group. The current technique (due to Dixon and Schneider) is based on an old idea of Burnside and takes no account of any special properties which the group may have. Over the last few years a number of very poverful techniques have been developed for computing with p-groups defined by a power-commutator presentation. In this paper a character table algorithm for such groups is presented. A trial implementation of this new algorithm indicates its superiority over the generalDixon-Schneider algorithm for p-groups having order greater than p^1^2.
Tutorial: artificial intelligence and simulation
Authors: J. Rothenberg
Venue: Proceedings of the 21st conference on Winter simulation (1989)

The term "simulation" is often interpreted quite narrowly: as a way of making predictions by running a behavioral model to answer questions of the form "What-if...?". The major impact of Artificial Intelligence (AI) research on simulation is to encourage the use of additional kinds of modeling based on inferencing, reasoning, search methods, and representations that have been developed in AI. This natural--though long overdue--extension of simulation can produce behavioral models that answer questions Beyond "What-if...?". The result is sometimes referred to as "Knowledge-Based Simulation". This tutorial presents some of the major concepts of Artificial Intelligence and illustrates their applicability to simulation using examples drawn from recent Knowledge-Based Simulation research. It focuses on the present state-of-the-art, current problems and limitations, and future directions and possibilities.
A parallel pipelined data flow coprocessor
Authors: J. T. Canning, R. Miner
Venue: Proceedings of the 17th conference on ACM Annual Computer Science Conference (1989)

A parallel pipelined data flow coprocessor has been developed for the 68000 based Commodore Amiga workstation. The coprocessor, based on Nippon Electric Corporation's &mgr;PD7281 Image Pipelined Processor (ImPP), was designed as an algorithm processor for numerically intensive applications such as image processing, image synthesis, and numerical analysis. The coprocessor can accomodate up to seven of the 5-MIPS ImPP's providing over 30 MIPS of processing power to dedicated tasks. The ImPP's act as true coprocessor's providing a multi-processor arrangement consisting of the 68000 and the coprocessor's parallel pipeline. The workstation and parallel processors share all system resources including memory and peripherals. The coprocessor has its own DMA capabilities for transferring program code and data between the workstation and the pipeline. The coprocessor is completely programmable via a development environment running native on the Amiga, including an assembler, a simulator, and a runtime library. Additional programming tools are also being developed.