ppxscal/embedding_network huggingface dataset:
A desk supporting computer-based interaction with paper documents
Authors: William Newman, Pierre Wellner
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

Before the advent of the personal workstation, office work practice revolved around the paper document. Today the electronic medium offers a number of advantages over paper, but it has not eradicated paper from the office. A growing problem for those who work primarily with paper is lack of direct access to the wide variety of interactive functions available on personal workstations. This paper describes a desk with a computer-controlled projector and camera above it. The result is a system that enables people to interact with ordinary paper documents in ways normally possible only with electronic documents on workstation screens. After discussing the motivation for this work, this paper describes the system and two sample applications that can benefit from this style of interaction: a desk calculator and a French to English translation system. We describe the design and implementation of the system, report on some user tests, and conclude with some general reflections on interacting with computers in this way.
Manhattonian proximity in a simple polygon
Authors: Rolf Klein, Andrzej Lingas
Venue: Proceedings of the eighth annual symposium on Computational geometry (1992)

Let P be a simple planar polygon. We present a linear worst-case time algorithm for constructing the bounded Voronoi diagram of P in the Manhattan metric, where each point z in P belongs to the region of the closest vertex of P that is visible from z. Among other consequences, the minimal spanning tree of the vertices in the Manhattan metric that is contained in P can be computed within optimal linear time.
A Graph Model for Software Evolution
Authors: Luqi
Venue: IEEE Transactions on Software Engineering (1990)

A graph model of software evolution is presented. The author seeks to formalize the objects and activities involved in software evolution in sufficient detail to enable automatic assistance for maintaining the consistency and integrity of an evolving software system. This includes automated support for propagating the consequences of a change to a software system. The evolution of large and complex software systems receives particular attention.
Collection and analysis of data from real users: implications for speech recognition/understanding systems
Authors: Judith Spitz
Venue: Proceedings of the workshop on Speech and Natural Language (1991)

Performance estimates given for speech recognition/understanding systems are typically based on the assumption that users will behave in ways similar to the observed behavior of laboratory volunteers. This includes the acoustic/phonetic characteristics of the speech they produce as well as their willingness and ability to constrain their input to the device according to instructions. Since speech recognition devices often do not perform as well in the field as they do in the laboratory, analyses of real user behavior have been undertaken. The results of several field trials suggest that real user compliance with instructions is dramatically affected by the particular details of the prompts supplied to the user. A significant amount of real user speech data has been collected during these trials (34,000 utterances, 29 hours of data). These speech databases are described along with the results of an experiment comparing the performance of a speech recognition system on real user vs. laboratory speech.
Double-step incremental linear interpolation
Authors: J. Rokne
Venue: ACM Transactions on Graphics (TOG) (1992)

A two-step incremental linear interpolation algorithm is derived and analyzed. It is shown that the algorithm is correct, that it is reversible, and that it is faster than previous single-step algorithms. An example is given of the execution of the algorithm.
The use of observability and external don't cares for the simplification of multi-level networks
Authors: Hamid Savoj, Robert K. Brayton
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

We give an algorithm for computing subsets of observability don't cares at the nodes of a multi-level Boolean network. These subsets are based on an extension of the methods introduced in [4] for computing compatible sets of permissible functions (CSPF's) at the nodes of networks composed of NOR gates. The extensions presented are in four directions; an arbitrary logic function is allowed at any node, the don't cares are expressed in terms of both primary inputs and intermediate variables, a new ordering scheme is used, and maximal CSPF's are computed. These ideas are incorporated in an algorithm designed to take full advantage of the power of two-level minimization in multi-level logic synthesis systems. This has been implemented in MIS-II and we present results that demonstrate the effectiveness of these techniques.
Multimedia Conferencing in the Etherphone Environment
Authors: Herrick M. Vin, Polle T. Zellweger, Daniel C. Swinehart, P. Venkat Rangan
Venue: Computer (1991)

The latest extension of the Etherphone project is described. It creates a powerful conferencing system that lets users control their participation in multiple conferences across multimedia networks. The emphasis is on the software mechanisms that support its new features: first, a Sparcstation facility called Phoenix that extends the Etherphone software architecture to permit more flexible conferencing and to control Sparcstation-based Ethernet audio transmission, and, second, the integration of the Phoenix capabilities with Macaw, the earlier video extensions. Also described is a multicast packet protocol for audio transmission, which reimplements and extends the earlier special-purpose protocols, adding per-channel volume control and full support for the extended conferencing modes.
ABSL: an actor-based specification language for office automation
Authors: Hossein Saiedian, Elizabeth A. Unger
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

Applications for use in an office environment are often very difficult to implement and/or prototype. One reason for such difficulty is the unavailability of an appropriate specification methodology through which an office analyst can specify the functional behavior of office applications at a high-level of abstraction and in a non-procedural fashion to the implementors. As a result, a great deal of effort, time, and money is often spent on &ldquo;re-inventing the wheel&rdquo; whenever a new office system concept is to be developed and/or prototyped. In this paper, we address the above problem by introducing a formal specification methodology, called ABSL, to be used for the specification of applications for offices. In this new methodology, which is based on the actor model, every office entity is uniformly viewed as an active computing component, or an active object. Each active object is viewed as a self-contained entity that models a logical or physical component appearing in an office environment. An example is provided to show the expressiveness of ABSL. Plans for future research in this area are given at the end of paper.
Embedding Rectangular Grids Into Square Grids
Authors: John A. Ellis
Venue: IEEE Transactions on Computers (1991)

It is shown that two-dimensional rectangular grids of large aspect ratio can be embedded into rectangular grids of smaller aspect ratios with small expansion and dilation. In particular, width can be reduced by a factor of up to two with optimal expansion, i.e. when the host rectangle is the smallest sufficient to contain the guest, and optimal dilation, i.e., two. A width reduction factor of three can be obtained with optimal expansion and dilation three. In general, any rectangular grid can be embedded into a square grid that is no more than unity larger on the side than the minimum possible, with dilation no more than three. These results improve on those previously obtained, in which dilation of better than 18 could not be guaranteed. They might be applicable to more complex grid embedding problems, such as embedding multidimensional grids into hypercubes.
Modeling and Online Scheduling of Flexible Manufacturing Systems Using Stochastic Petri Nets
Authors: Itsuo Hatono, Keiichi Yamagata, Hiroyuki Tamura
Venue: IEEE Transactions on Software Engineering (1991)

The authors discuss the modeling of flexible manufacturing systems (FMSs) under uncertainty and evaluate a rule base for online scheduling. To represent uncertain events in an FMS, such as failure of machine tools, repair time, and processing time, they develop continuous-time and discrete-time stochastic Petri nets with hierarchical structures for constructing the FMS model. For obtaining an efficient schedule for the FMS with an online real-time basis, they construct a rule base and evaluate its performance using the FMS simulation system proposed.
The combination of scheduling, allocation, and mapping in a single algorithm
Authors: Richard J. Cloutier, Donald E. Thomas
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

We present a single high level synthesis algorithm that schedules the operations of a data dependence graph, allocates the necessary hardware, and maps the operations to specific functional units. This is achieved by extending the global analysis approach developed for force-directed scheduling to include individual module instances. This new algorithm should be applicable to any behavioral synthesis system that schedules operations from a data dependence graph.
Some further analysis of the essential blocking recurrence
Authors: John T. Robinson
Venue: ACM SIGMOD Record (1991)

In previous work,1 a random graph model of concurrency control was developed, in which there are n concurrent transactions (represented as vertices of a graph), and where for each pair of transactions (vertices), a conflict (edge between the vertices) initially occurs independently with probability p. Given such a graph, a scheduling function selects a subset of transactions to complete based on the conflicts and possibly on an ordering of the transactions. At the end of each unit of time, the transactions selected by the scheduling function to complete are removed from the graph, and are replaced by new transactions from a transaction sequence. For each pair of transactions in the new graph, if the transactions were both in the previous graph then a conflict occurs between them if and only if there was a conflict in the previous graph; otherwise one or both of the transactions are new and a conflict occurs independently with probability p.
On the polynomial representation of generalized Liouville operators
Authors: V. Sailer, G. Morales-Luna
Venue: Journal of Symbolic Computation (1991)

The generalized Liouville operators are given as determinants of square matrices whose entries are higher order derivatives of real valued functions in two variables. The composition of these operators has very interesting properties in connection with polynomials over these operators. Their expansions grow so quickly that it is necessary to build efficient computer algorithms in order to manage them symbolically and to check inclusion properties. We prove that a general polynomial representation of the operator composition cannot exist, and we recognize other polynomial expressions, included in the composition, which group a great quantity of terms.
Design and Analysis of Master/Slave Multiprocessors
Authors: Albert G. Greenberg, Paul E. Wright
Venue: IEEE Transactions on Computers (1991)

A simple model of master/slave processors is presented, along with two simple, practical scheduling algorithms. An approximate analysis of the model yields simple formulas for performance measures in terms of the hardware and workload parameters, and gives insight into the power and the limitations of master/slave systems. In particular, formulae are obtained for the maximal processing power (throughput) of the system, a quantity that remains bounded as the number of slave processors increases. This analysis is applicable to symmetric multiprocessors, where performance considerations such as cache performance may dictate asymmetric assignment of system tasks to the processors.
Two-handed gesture in multi-modal natural dialog
Authors: Richard A. Bolt, Edward Herranz
Venue: Proceedings of the 5th annual ACM symposium on User interface software and technology (1992)

Tracking both hands in free-space with accompanying speech input can augment the user's ability to communicate with computers. This paper discusses the kinds of situations which call for two-handed input and not just the single hand, and reports a prototype in which two-handed gestures serve to input concepts, both static and dynamic, manipulate displayed items, and specify actions to be taken. Future directions include enlargement of the vocabulary of two-handed &ldquo;coverbal&rdquo; gestures and the modulation by gaze of gestural intent.
Computational geometry
Authors: Joseph O'Rourke
Venue: ACM SIGACT News (1992)

Recent solutions of three "art gallery" problems are reported. Three related still-open problems are discussed.
Performing integrated syntactic and semantic parsing using classification
Authors: Robert T. Kasper, Eduard H. Hovy
Venue: Proceedings of the workshop on Speech and Natural Language (1990)

This paper describes a particular approach to parsing that utilizes recent advances in unification-based parsing and in classification-based knowledge representation. As unification-based grammatical frameworks are extended to handle richer descriptions of linguistic information, they begin to share many of the properties that have been developed in KL-ONE-like knowledge representation systems. This commonality suggests that some of the classification-based representation techniques can be applied to unification-based linguistic descriptions. This merging supports the integration of semantic and syntactic information into the same system, simultaneously subject to the same types of processes, in an efficient manner. The result is expected to be more efficient parsing due to the increased organization of knowledge.
The maintenance of common data in a distributed system
Authors: Baruch Awerbuch, Leonard J. Schulman
Venue: Proceedings of the 32nd annual symposium on Foundations of computer science (1991)

A basic task in distributed computation is the maintenance at each processor of the network, of a current and accurate copy of a common database. Such a database must be updated in the wake of locally generated changes to its contents. Due to previous disconnections of parts of the network, a maintenance protocol may need to update processors holding widely varying versions of the database. A deterministic protocol, which has only polylogarithmic overhead in its time and communication complexities, is provided for this problem. Previous deterministic solutions required polynomial overhead in at least one of these measures.
An explanatory and &ldquo;argumentative&rdquo; interface for a model-based diagnostic system
Authors: Christopher A. Miller, Raymond Larson
Venue: Proceedings of the 5th annual ACM symposium on User interface software and technology (1992)

That intelligent systems need an explanatory capability if they are to aid or support human users has long been understood. A system which can justify its decisions generally obtains improved user trust, greater accuracy in use and offers embedded training potential. Extensive work has been done to provide rule-based systems with explanatory interfaces, but little has been done to provide the same benefits for model-based systems. We develop an approach to organizing the presentation of large amounts of model-based data in an interactive format patterned after a model of human-human explanatory and argumentative discourse. Portions of this interface were implemented for Honeywell's model-based Flight Control Maintenance and Diagnostic System (FCMDS). We conclude that sufficient information exists in a model-based system to provide a wide range of explanation types, and that, the discourse approach is a convenient, powerful and broadly applicable method of organizing and controlling information exchange involving this data.
Distributed systems and self-organization
Authors: June Power
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

This paper examines distributed systems as complex systems which need to evolve in order to adapt to unpredictable events. As a consequence, system management must concern itself not only with changing resources, but also with the way information changes through its use. The central theme is that distributed systems are systems of relations between objects which are commensurate with language. Information exchanged between entities is a reflection of a coupling between their organisational domains. It is this shared aspect of communication that forms a basis for evolving knowledge in the system. The Learning Classifier System (LCS) is introduced as a paradigm for evolving knowledge within this framework. The LCS is a learning system that learns rules, called classifiers, to guide its interaction in some specified environment. It builds up its components from significant bit clusters, called schemata, which represent the attributes of the underlying system. The paper concludes by suggesting the LCS as a prototype agent which cooperates with local access mechanisms to adapt to changes in the environment.
Needed: a new test of intelligence
Authors: W. Lewis Johnson
Venue: ACM SIGART Bulletin (1992)

The Economist, one of the most influential news magazines in the English language, has been a careful follower of progress in artificial intelligence. They regularly publish articles summarizing material published in the SIGART Bulletin and elsewhere. I was therefore interested to note that their August 1st issue includes an editorial criticizing the Turing Test and its role as a measure of artificial intelligence.
SQL_ArmAda: an Ada-appropriate interface to SQL
Authors: Dieter Baer, Klaus Sun, Leon Treff
Venue: ACM SIGAda Ada Letters (1990)

The use of the programming language Ada for the development of commercial applications largely depends on the availability of interfaces to database and interactive communication systems. This paper introduces an interface from Ada to the database language SQL. The approach taken in this paper is different from that taken in the interface definition Ada/SQL which is proposed as a binding of the ANSI standard database language SQL. This interface is defined as an Ada package with nested generic packages and generic subprograms, an d presents a complete model of the interface in an Ada application. A small but complete example explains the use of the interface in an Ada application. It also demonstrates that the interface is well suited for use by Ada programmers who are not database and SQL experts.
Robot Vision Using a Feature Search Strategy Generated from a 3D Oobject Model
Authors: Yoshinori Kuno, Yasukazu Okamoto, Satoshi Okada
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

A robot vision system that automatically generates an object recognition strategy from a 3D model and recognizes the object using this strategy is presented. The appearance of an object from various viewpoints is described in terms of visible 2D features such as parallel lines and ellipses. Features are then ranked according to the number of viewpoints from which they are visible. The rank and feature extraction cost of each feature are used to generate a treelike strategy graph. This graph gives an efficient feature search order when the viewpoint is unknown, starting with commonly occurring features and ending with features specific to a certain viewpoint. The system searches for features in the order indicated by the graph. After detection, the system compares a lines representation generated from the 3D model with the image features to localize the object. Perspective projection is used in the localization process to obtain the precise position and attitude of the object, whereas orthographic projection is used in the strategy generation process to allow symbolic manipulation. Experimental results are given.
The B-Network: A Multistage Interconnection Network with Backward Links
Authors: Kyungsook Y. Lee, Hyunsoo Yoon
Venue: IEEE Transactions on Computers (1990)

A multistage interconnection network (MIN) for multiprocessor systems is proposed. The proposed MIN, called the B-network, uses backward links to provide backward paths for the requests blocked at switches or memory due to contentions. The gamma network is known to contain a cube network (specifically, the inverse omega network) as a substructure. The B-network is obtained from the gamma network by preserving the cube structure but reversing the direction of all other links. These backward links are used as alternate paths for requests blocked due to path or memory contentions. The B-network can be controlled by the simple destination tag control algorithm; packets navigating through the B-network, using both regular forward links and backward links, can reach their destinations under the destination tag control. The performance of the B-network is analyzed under the uniform traffic model and compared to various networks of interest. It is shown that the B-network surpasses the performance of the gamma network, the crossbar switch, and single-buffered MINs based on (2*2) switches, while having the same hardware complexity as the gamma network.
DARPA ATIS test results June 1990
Authors: D. S. Pallett, W. M. Fisher, J. G. Fiscus, J. S. Garofolo
Venue: Proceedings of the workshop on Speech and Natural Language (1990)

The first Spoken Language System tests to be conducted in the DARPA Air Travel Information System (ATIS) domain took place during the period June 15 - 20, 1989. This paper presents a brief description of the test protocol, comparator software used for scoring results at NIST, test material selection process, and preliminary tabulation of the scored results for seven SLS systems from five sites: BBN, CMU, MIT/LCS, SRI and Unisys. One system, designated cmu-spi(r) in this paper, made use of digitized speech as input (.wav files), and generated CAS-format answers. Other systems made use of SNOR transcriptions (.snr files) as input.
Interactive simulation in a multi-person virtual world
Authors: Christopher Codella, Reza Jalili, Lawrence Koved, J. Bryan Lewis, Daniel T. Ling, James S. Lipscomb, David A. Rabenhorst, Chu P. Wang, Alan Norton, Paula Sweeney, Greg Turk
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

A multi-user Virtual World has been implemented combining a flexible-object simulator with a multisensory user interface, including hand motion and gestures, speech input and output, sound output, and 3-D stereoscopic graphics with head-motion parallax. The implementation is based on a distributed client/server architecture with a centralized Dialogue Manager. The simulator is inserted into the Virtual World as a server. A discipline for writing interaction dialogues provides a clear conceptual hierarchy and the encapsulation of state. This hierarchy facilitates the creation of alternative interaction scenarios and shared multiuser environment.