ppxscal/embedding_network huggingface dataset:
Symbolic and Geometric Connectivity Graph Methods for Route Planning in Digitized Maps
Authors: Peter D. Holmes, Erland R. A. Jungert
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

The results of research involving spatial reasoning within digitized maps are reported, focusing on techniques for 2D route planning in the presence of obstacles. Two alternative approaches to route planning are discussed, one involving heuristic symbolic processing and the other employing geometric calculations. Both techniques employ A* search over a connectivity graph. The geometric system produces a simple list of coordinate positions, whereas the symbolic system generates a symbolic description of the planned route. The symbolic system achieves this capability through the use of inference rules that can analyze and classify spatial relationships within the connectivity graph. The geometric method calculates an exact path from the connectivity information in the graph. Thus, the connectivity graph acts both as a knowledge structure on which spatial reasoning can be performed and as a data structure supporting geometrical calculations. An extension of the methodology that exploits a hierarchical data structure is described.
Dyna, an integrated architecture for learning, planning, and reacting
Authors: Richard S. Sutton
Venue: ACM SIGART Bulletin (1991)

Dyna is an AI architecture that integrates learning, planning, and reactive execution. Learning methods are used in Dyna both for compiling planning results and for updating a model of the effects of the agent's actions on the world. Planning is incremental and can use the probabilistic and ofttimes incorrect world models generated by learning processes. Execution is fully reactive in the sense that no planning intervenes between perception and action. Dyna relies on machine learning methods for learning from examples---these are among the basic building blocks making up the architecture---yet is not tied to any particular method. This paper briefly introduces Dyna and discusses its strengths and weaknesses with respect to other architectures.
Discourse structure in the TRAINS project
Authors: James F. Allen
Venue: Proceedings of the workshop on Speech and Natural Language (1991)

In a natural dialog, a considerable proportion of the utterances actually relate to the maintenance of the dialog itself rather than to furthering the task or goals motivating the conversation. For example, many utterances serve to acknowledge, clarify, correct a previous utterance rather than pursue some goal in the domain. In addition, natural dialog is full of false starts, ungrammatical sentences and other complexities not found in in written language. This paper describes our recent efforts to define and construct a model of discourse interaction that handle dialogs that are rich in these natural dialog-related phenomena.
Protecting rights in user interface designs
Authors: Ben Shneiderman
Venue: ACM SIGCHI Bulletin (1990)

Sacrificing individual rights in the hopes of benefitting the public good is a tempting but often misguided pursuit. I believe that protecting individual rights (civil, voting, privacy, intellectual property, etc.) is usually the best way to benefit and advance the public good.
Optimization of Computation Time for Systolic Arrays
Authors: Yiwan Wong, Jean-Marc Delosme
Venue: IEEE Transactions on Computers (1992)

This work deals with the general case of processors with multiple, possibly pipelined, functional units that operate concurrently and presents a method for the minimization of the actual computation time n/sub sys/*t/sub sys/. The selection of a linear scheduling function, which minimizes n/sub sys/*t/sub sys /is formulated as a combinatorial optimization problem, which is shown to have a bounded search space. An efficient branch-and-bound method for the solution of that problem is proposed and applied to several examples.
Algorithms for library-specific sizing of combinational logic
Authors: Pak K. Chan
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

We examine the problem of choosing the proper sizes from a cell library for the logic elements of a Boolean network to meet timing constraints on the propagation delay along every path from the primary input to the primary output. If the Boolean network has a tree topology, we show that there exists a pseudo-polynomial time algorithm for finding the optimal solution to this problem. A backtracking-based algorithm for finding feasible solutions for networks that are not trees is also suggested and evaluated.
Minimization Algorithms for Multiple-Valued Programmable Logic Arrays
Authors: Parthasarathy P. Tirumalai, Jon T. Bulter
Venue: IEEE Transactions on Computers (1991)

The performance of various heuristic algorithms for minimizing realizations of multiple-valued functions by the charge-coupled device (CCD) and CMOS programmable logic arrays (PLAs) of H.G. Kerkhoff and J.T. Butler (1986) and J.G. Samson (1988), respectively, is analyzed. The functions realized by the PLAs are in sum-of products form, where the sum is ordinary addition truncated to the highest logic value and the product represents the MIN operation of functions of the input variables that are the interval literal operations. Three heuristics, proposed by G. Pomper and J.A. Armstrong (1981), P.W. Besslich (1986), and G.W. Dueck and D.M. Miller (1987), are compared over sets of random and random-symmetric functions. An exact minimization method that is a tree search using backtracking is described. A reduction in the search space is achieved by considering constrained implicant sets and by eliminating some implicants altogether. Even with this improvement, the time required for exact minimization is extremely high when compared to all three heuristics. The case involving only prime implicants is considered, and it is shown that such implicants have marginal value compared to constrained implicant sets. The basis of comparison is the average number of product terms.
Making all types typedefed
Authors: Ron Ben-Natan
Venue: ACM SIGSOFT Software Engineering Notes (1992)

Encapsulation has been recognized as one of the most important methods for assuring that software systems maintenance is made possible. Many modern programming languages now provide specific constructs for encapsulation and abstraction. This note emphasizes the fact that the return types of an encapsulation's interface is a part of the interface functions themselves, and as such must also be encapsulated. The examples are given in C++ and encapsulating of the types is done using typedefs.
Telos: representing knowledge about information systems
Authors: John Mylopoulos, Alex Borgida, Matthias Jarke, Manolis Koubarakis
Venue: ACM Transactions on Information Systems (TOIS) (1990)

We describe Telos, a language intended to support the development of information systems. The design principles for the language are based on the premise that information system development is knowledge intensive and that the primary responsibility of any language intended for the task is to be able to formally represent the relevent knowledge. Accordingly, the proposed language is founded on concepts from knowledge representations. Indeed, the language is appropriate for representing knowledge about a variety of worlds related to a particular information system, such as the subject world (application domain), the usage world (user models, environments), the system world (software requirements, design), and the development world (teams, metodologies). We introduce the features of the language through examples, focusing on those provided for desribing metaconcepts that can then be used to describe knowledge relevant to a particular information system. Telos' fetures include an object-centered framework which supports aggregation, generalization, and classification; a novel treatment of attributes; an explicit representation of time; and facilities for specifying integrity constraints and deductive rules. We review actual applications of the language through further examples, and we sketch a formalization of the language.
Poor estimates of context are worse than none
Authors: William A. Gale, Kenneth W. Church
Venue: Proceedings of the workshop on Speech and Natural Language (1990)

It is difficult to estimate the probability of a word's context because of sparse data problems. If appropriate care is taken, we find that it is possible to make useful estimates of contextual probabilities that improve performance in a spelling correction application. In contrast, less careful estimates are found to be useless. Specifically, we will show that the Good-Turing method makes the use of contextual information practical for a spelling corrector, while attempts to use the maximum likelihood estimator (MLE) or expected likelihood estimator (ELE) fail. Spelling correction was selected as an application domain because it is analogous to many important recognition applications based on a noisy channel model (such as speech recognition), though somewhat simpler and therefore possibly more amenable to detailed statistical analysis.
USSA&mdash;universal syntax and semantics analyzer
Authors: Boris Burshteyn
Venue: ACM SIGPLAN Notices (1992)

This article presents a new tool for defining syntax and semantics of formal systems, called USSA (Universal Syntax and Semantics Analyzer). USSA is based on modifiable grammars introduced in [1, 2]. While parsing or generating the source text, USSA applies context-free rules from the current set of rules and modifies this set on the fly. The USSA concepts are illustrated by a rich variety of syntax and semantic constructions from programming languages.
Multiresolution Hough Transform-An Efficient Method of Detecting Patterns in Images
Authors: M. Atiquzzaman
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

A new multiresolution coarse-to-fine search algorithm for efficient computation of the Hough transform is proposed. The algorithm uses multiresolution images and parameter arrays. Logarithmic range reduction is proposed to achieve faster convergence. Discretization errors are taken into consideration when accumulating the parameter array. This permits the use of a very simple peak detection algorithm. Comparative results using three peak detection methods are presented. Tests on synthetic and real-world images show that the parameters converge rapidly toward the true value. The errors in rho and theta , as well as the computation time, are much lower than those obtained by other methods. Since the multiresolution Hough transform (MHT) uses a simple peak detection algorithm, the computation time will be significantly lower than other algorithms if the time for peak detection is also taken into account. The algorithm can be generalized for patterns with any number of parameters.
The validation of a political model of information systems development cost estimating
Authors: Albert L. Lederer, Jayesh Prasad
Venue: ACM SIGCPR Computer Personnel (1991)

Accurate estimation of information systems development costs is important to management. Political behavior may compromise the estimating process. This research sought to validate a political perspective of cost estimating. A survey of 116 information systems managers and analysts revealed that user management, user representatives, information systems managers, estimators, and developers had differing objectives with regard to the development of information systems. These differing objectives were linked with differing behaviors in the form of pressures to increase or decrease systems development cost estimates.
The practical need for fourth normal form
Authors: Margaret S. Wu
Venue: Proceedings of the twenty-third SIGCSE technical symposium on Computer science education (1992)

Many practitioners and academicians believe that data violating fourth normal form is rarely encountered. We report upon a study of forty organizational databases; nine of them contained data violating fourth normal form. Consequently, the need to understand and user fourth normal form is more important than previously believed.
Architecture of an intelligent agent in SNePS
Authors: Deepak Kumar, Stuart C. Shapiro
Venue: ACM SIGART Bulletin (1991)

This paper describes some accomplishments and ongoing work relating to a system called The SNePS Actor. Cognitive agents modeled using this system are capable of representing and reasoning about beliefs, acts, and plans. The architecture of the SNePS Actor being developed is based on our investigations of the relationships between beliefs, plans, effective acts, and sensory acts, and between reasoning and acting, in the context of a computational rational agent. The representations and reasoning mechanisms used are those of SNePS- an intensional, propositional, semantic network-based system.
A new approach to debugging optimized code
Authors: Gary Brooks, Gilbert J. Hansen, Steve Simmons
Venue: Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation (1992)

Debugging optimized code is a desirable capability not provided by most current debuggers. Users are forced to debug the unoptimized code when a bug occurs in the optimized version. Current research offers partial solutions for a small class of optimizations, but not a unified approach that handles a wide range of optimizations, such as the sophisticated optimizations performed by supercomputer compilers. The trend with current research is to make the effects of optimization transparent, i.e., provide the same behavior as that of the unoptimized program. We contend that this approach is neither totally feasible nor entirely desirable. Instead, we propose a new approach based on the premise that one should be able to debug the optimized code. This implies mapping the current state of execution back to the original source, tracking the location of variables, and mapping compiler-synthesized variables back to user-defined induction variables. To aid the user in understanding program behavior, various visual means are provided, e.g., different forms of highlighting and annotating of the source/assembly code. While this unavoidably requires the user to have a basic understanding of the optimizations performed, it permits the user to see what is actually happening, infer the optimizations performed, and detect bugs. An example illustrates the effectiveness of visual feedback. To support conventional debugger functionality for optimized code, the compiler must generate additional information. Current compiler-debugger interfaces (CDIs) were neither designed to handle this new information nor are they extensible in a straight forward manner. Therefore, a new CDI was designed that supports providing visual feedback and the debugging of optimized code. This paper specifies the details of a new CDI and relates each feature back to the debugger functionality it supports.
The Design and Use of Steerable Filters
Authors: William T. Freeman, Edward H. Adelson
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

The authors present an efficient architecture to synthesize filters of arbitrary orientations from linear combinations of basis filters, allowing one to adaptively steer a filter to any orientation, and to determine analytically the filter output as a function of orientation. Steerable filters may be designed in quadrature pairs to allow adaptive control over phase as well as orientation. The authors show how to design and steer the filters and present examples of their use in the analysis of orientation and phase, angularly adaptive filtering, edge detection, and shape from shading. One can also build a self-similar steerable pyramid representation. The same concepts can be generalized to the design of 3-D steerable filters.
An integrating pedagogical tool based on writing articles
Authors: Vianney Côté, Guy Custeau
Venue: ACM SIGCSE Bulletin (1992)

This article describes a teaching method based on the writing of review or vulgarization articles by the students in their fields of study. The best articles are published in a magazine distributed to data processing managers and practitioners. The advantages of this method and a list of evaluation criteria are presented.
When is an extension of a specification consistent? Decidable and undecidable cases
Authors: Friedrich Otto
Venue: Journal of Symbolic Computation (1991)

The problem of consistency is the following decision problem: Instance: Two finite specifications (@?, E) and (@?"1, E"1), where the signature @? is contained in the signature @?"1. Question: Is (@?"1, E"1) a consistent extension of (@?, E)? For the special case of string-rewriting systems we present decidable and undecidable cases of this problem. As it turns out in order to obtain decidability rather severe restrictions are necessary either on the syntactic form of the equations in E and E"1 or on the algebraic structure of the algebras (i.e. monoids) that are presented by (@?, E) and (@?"1, E"1), respectively.
A metamodel for the runtime architecture of an interactive system: the UIMS tool developers workshop
Venue: ACM SIGCHI Bulletin (1992)

Developers of interactive systems must make difficult engineering trade-offs in order to optimize their development processes and end products. The trade-offs are made among desirable, but sometimes conflicting, goals such as minimizing the future effects of changing technology and improving system runtime performance. The purpose of this paper is to provide developers with a framework for understanding these tradeoffs and for helping them define and evaluate candidate runtime architectures.
Randomized parallel algorithms for matroid union and intersection, with applications to arboresences and edge-disjoint spanning trees
Authors: H. Narayanan, Huzur Saran, Vijay V. Vazirani
Venue: Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms (1992)

The strong link between matroids and matching is used to extend the ideas that resulted in the design of Random NC algorithms for matching to obtain RNC algorithms for the well-known problems of finding an arboresence and a maximum cardinality set of edge-disjoint spanning trees in a graph. The key tools used are linear algebra and randomization.
Feature structures and nonmonotonicity
Authors: Gosse Bouma
Venue: Computational Linguistics (1992)

Unification-based grammar formalisms use feature structures to represent linguistic knowledge. The only operation defined on feature structures, unification, is information-combining and monotonic. Several authors have proposed nonmonotonic extensions of this formalism, as for a linguistically adequate description of certain natural language phenomena some kind of default reasoning seems essential. We argue that the effect of these proposals can be captured by means of one general, nonmonotonic, operation on feature structures, called default unification. We provide a formal semantics of the operation and demonstrate how some of the phenomena used to motivate nonmonotonic extensions of unification-based formalisms can be handled.
Use of syntactic context to produce term association lists for text retrieval
Authors: Gregory Grefenstette
Venue: Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval (1992)

One aspect of world knowledge essential to information retrieval is knowing when two words are related. Knowing word relatedness allows a system given a user's query terms to retrieve relevant documents not containing those exact terms. Two words can be said to be related if they appear in the same contexts Document co-occurrence gives a measure of word relatedness that has proved to be too rough to be useful. The relatively recent apparition of on-line dictionaries and robust and rapid parsers permits the extraction of finer word contexts from large corpora. In this paper, we will describe such an extraction technique that uses only coarse syntactic analysis and no domain knowledge. This technique produces lists of words related to any work appearing in a corpus. When the closest related terms were used in query expansion of a standard information retrieval testbed, the results were much better than that given by document co-occurence techniques, and slightly better than using unexpanded queries, supporting the contention that semantically similar words were indeed extracted by this technique.
Rule-Based Design Methodology for Solving Control Problems
Authors: Farhad S. Etessami, Gurdeep S. Hura
Venue: IEEE Transactions on Software Engineering (1991)

A rule-based design methodology for solving control problems is presented. For the representation of various constraints, activities, and other dependency properties of the control problem, abstract Petri nets (APNs) which are an extended form of Petri net modeling are used as a specification and formalism tool which can be analyzed using the analysis techniques of Petri-net-based models. The APN provides a compact, consistent, and verifiable description of the dynamic behaviour of the system under consideration in a structured mode. The proposed design methodology supports specification, validation, and analysis through high-level interaction with the modeled system. The various steps which were taken towards the development of such a design paradigm are explained. An example which shows the APN modeling of an elevator system is given.
Castles in the air revisited
Authors: Boris Aronov, Micha Sharir
Venue: Proceedings of the eighth annual symposium on Computational geometry (1992)

We show that the total number of faces bounding any single cell in an arrangement of n (d&ndash;1)-simplices in IRd is O(nd&ndash;1 log n), thus almost settling a conjecture of Pach and Sharir. We present several applications of this result, mainly to translational motion planning in polyhedral environments. We then extend our analysis technique to derive other results on complexity in simplex arrangements. For example, we show that the number of vertices in such an arrangement, which are incident to the same cell on more than one &ldquo;side,&rdquo; is O(nd-1 log n). We also show that the number of repetitons of a &ldquo;k-flap,&rdquo; formed by intersecting d&ndash;k simplices, along the boundary of the same cell, summed over all cells and all k-flaps, is O(nd-1 log n). We use this quantity, which we call the excess of the arrangement, to derive bounds on the complexity of m distinct cells of such an arrangement.
Comparison of empirical testing and walkthrough methods in user interface evaluation
Authors: Claire-Marie Karat, Robert Campbell, Tarra Fiegel
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

We investigated the relative effectiveness of empirical usability testing and individual and team walkthrough methods in identifying usability problems in two graphical user interface office systems. The findings were replicated across the two systems and show that the empirical testing condition identified the largest number of problems, and identified a significant number of relatively severe problems that were missed by the walkthrough conditions. Team walkthroughs achieved better results than individual walkthroughs in some areas. About a third of the significant usability problems identified were common across all methods. Cost-effectiveness data show that empirical testing required the same or less time to identify each problem when compared to walkthroughs.