ppxscal/embedding_network huggingface dataset:
Exploiting parallelism in pattern matching: an information retrieval application
Authors: Victor Wing-Kit Mak, Kuo Chu Lee, Ophir Frieder
Venue: ACM Transactions on Information Systems (TOIS) (1991)

We propose a document-searching architecture based on high-speed hardware pattern matching to increase the throughput of an information retrieval system. We also propose a new parallel VLSI pattern-matching algorithm called the Data Parallel Pattern Matching (DPPM) algorithm, which serially broadcasts and compares the pattern to a block of data in parallel. The DPPM algorithm utilizes the high degree of integration of VLSI technology to attain very high-speed processing through parallelism. Performance of the DPPM has been evaluated both analytically and by simulation. Based on the simulation statistics and timing analysis on the hardware design, a search rate of multiple gigabytes per second is achievable using 2-&mgr;m CMOS technology. The potential performance of the proposed document-searching architecture is also analyzed using the simulation statistics of the DPPM algorithm.
Some Sequential Algorithms for a Generalized Distance Transformation Based on Minkowski Operations
Authors: Xiaoli Wang, Gilles Bertrand
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

A generalized distance transformation (GDT) of binary images and the related medial axis transformation (MAT) are discussed. These transformations are defined in a discrete space of arbitrary dimension and arbitrary grids. The GDT is based on successive morphological operations using alternatively N arbitrary structuring elements: N is called the period of the GDT. The GDT differs from the classical distance transformations based on a point-to-point distance. However, the well-known chessboard, city-block, and hexagonal distance transformations are special cases of the one-period GDT, whereas the octagonal distance transformation is a special case of the two-period GDT. In this paper, both one- and two-period GDTs are discussed. Different sequential algorithms are proposed for computing such GDTs. These algorithms need a maximum of two scannings of the image. The computation of the MAT is also discussed.
Two-dimensional periodicity and its applications
Authors: Amihood Amir, Gary Benson
Venue: Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms (1992)

String matching is rich with a variety of algorithmic tools. In contrast, multidimensional matching has a rather sparse set of techniques. This paper presents a new algorithmic technique for two-dimensional matching, that of periodicity analysis. Periodicity in strings has been used to solve string matching problems. The success of these algorithms suggests that periodicity can be as important a tool in multidimensional matching. However, multidimensional periodicity is not as simple as it is in strings and was not formally studied or used in pattern matching. This paper's main contribution is defining and analysing two-dimensional periodicity in rectangular arrays. In addition, we introduce a new pattern matching paradigm - Compressed Matching. A text array T and a pattern array P are given in compressed forms c(T) and c(P). We seek all appearances of P in T, without decompressing T. By using periodicity analysis, we show that for the two-dimensional run-length compression there is a O(|c(T)|log|P|+|P|), or almost optimal algorithm that can achieve a search time that is sublinear in the size of the text |T|.
Recursively indefinite databases (extended abstract)
Authors: R. van der Meyden
Venue: Proceedings of the third international conference on database theory on Database theory (1990)

We define recursively indefinite databases, a new type of logical database in which indefinite information arises from partial knowledge of the fixpoint of a datalog program. Although, in general, query answering is undecidable, there exists a broad class of queries for which it is decidable, a result we establish by making connections with the theory of hypergraph edge replacement graph grammars. We analyze the complexity of query answering for this class of queries under various constraints and demonstrate a class of databases which generalizes disjunctive databases, but without increasing data complexity.
A Well-Defined Estelle Specification for the Automatic Test Generation
Authors: Do Y. Lee, Jai Y. Lee
Venue: IEEE Transactions on Computers (1991)

The characteristics of the Estelle specification language are analyzed and a well-defined specification, a restricted form of an Estelle specification, is proposed based on the analyzed results to enable a direct derivation of a single reduced finite state machine-which is called a CFG (control flow graph)-from the specification written in Estelle. The derived CFG provides a basis for the automatic test case generation. Algorithms to test whether the specification written in Estelle is well defined or not, and to generate the CFG from the well-defined specification, are developed. Finally, as an example, the proposed technique is applied to TP0 (transport protocol class 0) specification written in Estelle. In applying these algorithms to the Estelle specification, some guidelines are also suggested for the specification which is not well defined.
Group-classified polynomials of phase space in higher-order aberration expansions
Authors: Kurt Bernardo Wolf, Guillermo Krötzsch
Venue: Journal of Symbolic Computation (1991)

Polynomial functions of the classical phase variables p^2, pxq, and q^2, are used in higher-order perturbation expansions in various fields of physics, including geometric aberration optics of axially-symmetric lens and mirror systems. These polynomials participate in operations such as linear combination, multiplication, Poisson brackets, and a Baker-Campbell-Hausdorff compounding that corresponds to concatenation of optical elements. We are interested in handling the polynomials through structures and in bases where the above operations are as short as possible. The monomial basis is one obvious choice that performs efficiently under multiplication. For Poisson brackets and aberration-group products however, the symplectic basis that uses solid spherical, harmonics in three variables is shown to be a better choice. In the last operation, for seventh aberration order, we halve the computation complexity in the symplectic basis.
A common facts data base
Authors: William Crowther
Venue: Proceedings of the workshop on Speech and Natural Language (1989)

This note is about a project whose goal has been to develop methods for converting large amounts of natural language text into machine-accessible data base relations. The easiest way to explain the project is to describe its historical development, pointing out along the way key ideas relating to the project's goal, its version of "meaning," its data representation, and how it treats errors.
An ACM response: the scope and directions of Computer Science
Authors: Barbara Simons, Dennis J. Frailey, A. Joe Turner, Stuart H. Zweben, Peter J. Denning
Venue: Communications of the ACM (1991)

The National Research Council's Computer Science and Telecommunications Board (CSTB) chartered a two-year study on the scope and directions of computer science. As part of this study, ACM was asked to provide input on three important questions, the answers to which could have significant impact on the future direction of our discipline and profession.
Justification of printed music
Authors: Dorothea Blostein, Lippold Haken
Venue: Communications of the ACM (1991)

There is increasing interest in the use of computer systems for editing and printing sheet music [3, 19]. Music processing lags far behind text processing because of the complexities of music notation. Most music published today is still laid out by hand; while computers may be used, decisions about music-symbol placement are made by people. Much research remains to be done into computational methods of encoding the myriad rules of music notation. Individual rules are not difficult to formulate; it is the complex interaction among rules which is difficult to describe and control. In this article we focus on one aspect of music notation: the horizontal spacing of music to produce a right- and left- justified result.
A new placement level wirability estimate with measurements
Authors: Steve Meyer
Venue: ACM SIGDA Newsletter (1990)

An extension of the wirability estimate concept to master slice placement is presented. This estimate is usable on individual circuits, produces detailed wire requirement maps, but requires target designs to be at least partially placed. The main innovation is the discovery of an outer rectangle estimate that separates basic wire requirements from routing details. The estimate averages wires within one chip but is inapplicable to chip type wire space modeling. Steiner tree net decomposition, the half perimeter wire length estimate, and potential wire requirement reduction from a third metal layer are evaluated.
Initiating usability methods with a new engineering design tool
Authors: Aita Salasoo
Venue: ACM SIGCHI Bulletin (1991)

Goals, methods, and results of initial usability work for a new, intelligent software product are described. The approach yielded a number of expected and unforeseen benefits, as well as lessons for
3D layout manipulation functions with a glance to optimization problems
Authors: Renato Capra
Venue: ACM SIGAPL APL Quote Quad (1992)

APL syntax provides a very simple and expressive way to generate and manipulate simple 3D parametric objects. APL2 nested arrays provide powerful data structures for a compact, readable and executable description of 3D layout scenes. The paper describes a user-friendly interactive graphic system for 3D layout manipulation. The user can define and modify a layout scene by graphical interaction on a 3D perspective projection. User's commands enable change of parameters, 3D transformations and friendly operations that involve position relationship between objects. Commands are translated into &ldquo;messages&rdquo; to graphic objects, and the result of the operations is immediately reflected in a modification of the &ldquo;scene data structure&rdquo;. The system includes the capability to select objects from a catalogue, to build compound objects and to edit sub-objects. The scene data structure is well suited for interface to external graphics rendering programs. Data structure can be extended to include non-geometrical information. Moreover it is possible to apply complex numerical algorithms to geometrical and numerical data. A heuristic algorithm for Satellite Systems Layout Optimization is presented as an example.
A Distance-Based Attribute Selection Measure for Decision Tree Induction
Authors: R. López De Mántaras
Venue: Machine Learning (1991)

This note introduces a new attribute selection measure for ID3-like inductive algorithms. This measure is based on a distance between partitions such that the selected attribute in a node induces the partition which is closest to the correct partition of the subset of training examples corresponding to this node. The relationship of this measure with Quinlan's information gain is also established. It is also formally proved that our distance is not biased towards attributes with large numbers of values. Experimental studies with this distance confirm previously reported results showing that the predictive accuracy of induced decision trees is not sensitive to the goodness of the attribute selection measure. However, this distance produces smaller trees than the gain ratio measure of Quinlan, especially in the case of data whose attributes have significantly different numbers of values.
Recombinant Music: Using the Computer to Explore Musical Style
Authors: David Cope
Venue: Computer (1991)

A research project called Experiments in Musical Intelligence (EMI) is discussed. One subprogram of EMI is an expert system that uses pattern recognition processes to create recombinant music, i.e. music written in the styles of various composers by means of a contextual recombination of elements in the music of those composers. This EMI subprogram separates and analyzes musical pitches and durations and then mixes and recombines the patterns of these pitches and durations so that while each new composition is different, it substantially conforms to the style of the original. The fundamental problems in building a program to produce effective recombinant music are identified. The three steps used by the EMI program are discussed. They are: pattern matching for characteristics of the composer's style, analyzing each component for its deep hierarchical musical function, and reassembling the parts sensitively with a technique drawn from natural-language processing. Some examples of EMI's output are examined.
Putting innovation to work: adoption strategies for multimedia communication systems
Authors: Ellen Francik, Susan Ehrlich Rudman, Donna Cooper
Venue: Communications of the ACM (1991)

Multimedia communication systems promise better support for widely distributed workgroups. Their benefits for complex communication&mdash;problem-solving, negotiating, planning, and design &mdash;seem obvious, introducing appealing new technologies into the marketplace, however, can require years of Investment [13, 22]. In particular, finding productive uses for new systems takes time. Adoption strategies are needed to guide and accelerate the process.
Time distribution analysis for binary search of a linked list
Authors: Firooz Khosraviyani, Mohammad H. Moadab, Douglas F. Hale
Venue: ACM SIGCSE Bulletin (1991)

The aim of this article is to determine the probability distribution of sorting time for different sized linked lists utilizing binary search method and its comparison with results for sequential and binary tree search methods. In [1] the concept of binary search as applicable to linked lists has been discussed and compared with sequential search and (binary) tree search algorithms. Applying regression analysis, specific equations giving search times as a function of list size are determined. Regression analysis is also used to estimate the average performance of the binary search method in sorting linked lists.
Semantic heterogeneity as a result of domain evolution
Authors: Vincent Ventrone
Venue: ACM SIGMOD Record (1991)

We describe examples of problems of semantic heterogeneity in databases due to &ldquo;domain evolution&rdquo;, as it occurs in both single- and multidatabase systems. These problems occur when the semantics of values of a particular domain change over time in ways that are not amenable to applying simple mappings between &ldquo;old&rdquo; and &ldquo;new&rdquo; values. The paper also proposes facilities and strategies for solving such problems.
Some notes on program design
Authors: Robert McLaughlin
Venue: ACM SIGSOFT Software Engineering Notes (1991)

Program design is an important part of the design process. The propose of this paper is to give some guidelines to the design process. It is not possible to write down a set of rules that will deal with all design problems. However it is possible to make program design a respected science within the computer sciences.
An incremental access method for ViewCache: concept, algorithms, and cost analysis
Authors: Nicholas Roussopoulos
Venue: ACM Transactions on Database Systems (TODS) (1991)

A ViewCache is a stored collection of pointers pointing to records of underlying relations needed to materialize a view. This paper presents an Incremental Access Method (IAM) that amortizes the maintenance cost of ViewCaches over a long time period or indefinitely. Amortization is based on deferred and other update propagation strategies. A deferred update strategy allows a ViewCache to remain outdated until a query needs to selectively or exhaustively materialize the view. At that point, an incremental update of the ViewCache is performed. This paper defines a set of conditions under which incremental access to the ViewCache is cost effective. The decision criteria are based on some dynamically maintained cost parameters, which provide accurate information but require inexpensive bookkeeping. The IAM capitalizes on the ViewCache storage organization for performing the update and the materialization of the ViewCaches in an interleaved mode using one-pass algorithms. Compared to the standard technique for supporting views that requires reexecution of the definition of the view, the IAM offers significant performance advantages. We will show that under favorable conditions, most of which depend on the size of the incremental update logs between consecutive accesses of the views, the incremental access method outperforms query modification. Performance gains are higher for multilevel ViewCaches because all the I/O and CPU for handling intermediate results are avoided.
On extending computational adequacy by data abstraction
Authors: Val Breazu-Tannen, Ramesh Subrahmanyam
Venue: Proceedings of the 1992 ACM conference on LISP and functional programming (1992)

Given an abstract data type(ADT), and algebra that specifies it, and an implementation of the data type in a certain language, if the implementation is &ldquo;correct,&rdquo; a certain principle of modularity of reasoning holds. Namely, one can safely reason about programs in the language extended by the ADT, by interpreting the ADT operation symbols according to the specification algebra. The main point of this paper is to formalize correctness as a local condition involving only the specification and the implementation and to prove the equivalence of such a condition to the modularity principle. We conduct our study in the context of a language without divergence (in subsection 2.1), and for languages with divergence and general recursion (in subsections 2.2 and 2.3). We also describe a sufficient condition under which, given an implementation, there may be a finite set of observational equivalences which imply the local condition. Further, we illustrate a technique for proving in a practical situation that a given implementation of an abstract data type is correct.
Spatio-Temporal Composition of Distributed Multimedia Objects for Value-Added Networks
Authors: Thomas D. C. Little, Arif Ghafoor
Venue: Computer (1991)

The overall process necessary to perform spatial and temporal data composition for a distributed multimedia information system is addressed. With respect to delays introduced through the network, it is found that temporal composition can be most suitably achieved at the workstation. Spatial composition is most effectively performed in a hierarchical fashion as dictated by the availability of system resources. The subsequent composition methodology combines spatial and temporal composition as a network service. Database organizations and data distributions are also investigated, and spatial and temporal composition functions and their composition into the network architecture are discussed. The issue of mapping the composition process onto the network resources as a value-added service is also addressed.
Term rewriting: Some experimental results
Authors: David A. Plaisted, Richard C. Potter
Venue: Journal of Symbolic Computation (1991)

We discuss term rewriting in conjunction with sprfn, a Prolog-based theorem prover. Two techniques for theorem proving that utilize term rewriting are presented. The first technique simulates the replacement of predicates by their definitions in a Skolemtzed setting. The second technique permits tautologies to be recognized quickly. We demonstrate their effectiveness by exhibiting the results of our experiments in proving some theorems of von Neumann-Bernays-Godel set theory. We also show how the first technique can be used in any clausal theorem prover. Some outstanding problems associated with term rewriting are also addressed.
Computer science in an undergraduate liberal arts and sciences setting
Authors: Ronald E. Prather
Venue: ACM SIGCSE Bulletin (1992)

In this article, we intend to establish a collegial meeting ground among faculty and administrators for a broad discussion of the role of computer science in an undergraduate liberal arts and sciences university. And both groups are in mind as the potential audience. As our title suggests, we are specifically excluding from consideration those schools having significant graduate degree programs, though some of our observations may be appropriate there as well. And we are thinking primarily of the high-quality liberal arts and sciences institutions, or at least of those who aspire to be so designated, where a primary emphasis is placed on preparing students for graduate work at the major universities.In this restricted setting, questions arise for administrators that transcend the narrow parochial characterizations of the field of computer science, those framed by its practitioners and generally recognized authorities (usually found at the larger research universities). How well does computer science fit with the classical liberal arts and sciences tradition, and with the "mission" as a whole? Do we already have enough "computer expertise" around the campus, without initiating or maintaining a separate department? Can we afford it? Is it time to dismantle it or merge it with another department? Otherwise, is it in need of serious revision? One may judge from this line of questioning that we intend to give an equal consideration to those computer science programs that are "starting up" and those that are thinking about "starting over."
A textual processor to handle ATIS queries
Authors: Douglas O'Shaughnessy
Venue: Proceedings of the workshop on Speech and Natural Language (1991)

This paper describes the initial development of a natural language text processor, as the first step in an INRS dialogue-by-voice system. The eventual system will accept natural, spontaneous speech from users and produce responses from the databases in the form of synthetic speech. This paper reports results in processing the textual version of ATIS (Air Travel Information System) queries. The current system (programmed in C) accepts as input the cleaned-up text (SNOR) version of the spoken queries, and produces the desired Official Airline Guide (OAG) information as output. It uses only the words in the input text, and not any punctuation marks, on the assumption that such marks are difficult to obtain directly from speech input. Based on the training text data, the system correctly interprets a large majority of the textual queries.
Topological Via Minimization Revisited
Authors: M. Sarrafzadeh, D. T. Lee
Venue: IEEE Transactions on Computers (1991)

The topological via minimization problem in a two-layer environment is considered. A set of n two-terminal nets in a bounded region is given. The authors attempt to find a homotopy to assign nets to distinct layers so that no two nets on the same layer cross each other and the number of vias is minimized. A recursive approach in which an optimal solution to a two-sided channel routing problem is used as a basis is used to solve this problem optimally. The notion of partition number K of a circle graph is introduced, and the total running time of the via minimization algorithm is shown to be O((n/K)/sup 2K-2/ log (n/K)), where n is the total number of nets.