ppxscal/embedding_network huggingface dataset:
Computing geographic nearest neighbors using monotone matrix searching (preliminary version)
Authors: Young C. Wee, Seth Chaiken, Dan E. Willard
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

We present an &Ogr;(N log2 N) divide-and-conquer algorithm for solving the all pairs geographic nearest neighbor problem (GNN) for a set of N sites in the plane under any Lp metric, 1 &le; p &ge; &infin;. This algorithm uses the monotone matrix searching technique of Aggarwal et. al. In addition, our method yields an &Ogr;(N logd-1 N) expected time algorithm for the d-dimensional GNN problem. We also discuss the applications of GNN approach to rectilinear Steiner trees.
Procedure for quantitatively comparing the syntactic coverage of English grammars
Authors: S. Abney, S. Flickenger, C. Gdaniec, C. Grishman, P. Harrison, D. Hindle, R. Ingria, F. Jelinek, J. Klavans, M. Liberman, M. Marcus, S. Roukos, B. Santorini, T. Strzalkowski
Venue: Proceedings of the workshop on Speech and Natural Language (1991)

The problem of quantitatively comparing the performance of different broad-coverage grammars of English has to date resisted solution. Prima facie, known English grammars appear to disagree strongly with each other as to the elements of even the simplest sentences. For instance, the grammars of Steve Abney (Bellcore), Ezra Black (IBM), Dan Flickinger (Hewlett Packard), Claudia Gdaniec (Logos), Ralph Grishman and Tomek Strzalkowski (NYU), Phil Harrison (Boeing), Don Hindle (AT amp;T), Bob Ingria (BBN), and Mitch Marcus (U. of Pennsylvania) recognize in common only the following constituents, when each grammarian provides the single parse which he/she would ideally want his/her grammar to specify for three sample Brown Corpus sentences:The famed Yankee Clipper, now retired, has been assisting (as (a batting coach)).One of those capital-gains ventures, in fact, has saddled him (with Gore Court).He said this constituted a (very serious) misuse (of the (Criminal court) processes).
Learning arithmetic read-once formulas
Authors: Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein
Venue: Proceedings of the twenty-fourth annual ACM symposium on Theory of computing (1992)

A formula is read-once if each variable appears at most once in it. An arithmetic read-once formula is one in which the operators are addition, subtraction, multiplication, and division. We present polynomial time algorithm for exactly learning (or interpolating) arithmetic read-once formulas computing functions over a field. We present an algorithm that uses randomized membership queries (or substitutions) to identify such formulas over large finite fields and infinite fields. We also present a deterministic algorithm that uses equivalence queries as well as membership queries to identify arithmetic read-once formulas over small finite fields. We then non-constructively show the existence of deterministic membership query (interpolation) algorithms for arbitrary formulas over fields of characteristic 0 and for division-free formulas over large or infinite fields. Our algorithms assume we are able to efficiently perform arithmetic operations on field elements and compute square roots in the field. It is shown that the ability to compute square roots is necessary, in the sense that the problem of computing n &ndash; 1 square roots in a field can be reduced to the problem of identifying an arithmetic formula over n variables in that field. Our equivalence queries are of a slightly non-standard form, in which counterexamples are required to not be inputs on which the formula evaluates to 0/0. This assumption is shown to be necessary for fields of size o(n/log n), for which it is shown that there is no polynomial time identification algorithm that uses just membership and standard equivalence queries.
Subsequence references: first-class values for substrings
Authors: Wilfred J. Hansen
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1992)

Arrays of characters are a basic data type in many programming languages, but strings and substrings are seldom accorded first-class status as parameters and return values. Such status would enable a routine that calls a search function to readily access context on both sides of a return value. To enfranchise substrings, this paper describes a new data type for substrings as a special case of one for general subsequences. The key idea is that values are not sequences or references to positions in sequences, but rather references to subsequences. Primitive operations on the data type are constants, concatenation, and four new functions&mdash;base, start, next, and extent&mdash;which map subsequence references to subsequence references. This paper informally presents the data type, demonstrates its convenience for defining search functions, and shows how it can be concisely implemented. Examples are given in Ness, a language incorporating the new data type, which is implemented as part of the Andrew User Interface System.
Executing the formal definition of Ada
Authors: A. Fantechi, S. Gnesi, F. Leggio, P. Talini
Venue: ACM SIGPLAN Notices (1991)

The results of a study on the effectiveness of an execution environment for the formal definition of Ada are presented. The environment is based on a logic programming approach, that is the translation of the formal definition into an executable logic program. Some experimental performance measurements for a prototype execution environment which has been developed using the same approach for a simple concurrent language are given, and their usefulness in predicting the performance of the environment for the formal definition of Ada is discussed.
Analyzing explicitly-structured discourse in a limited domain: trouble and failure reports
Authors: Catherine N. Ball
Venue: Proceedings of the workshop on Speech and Natural Language (1989)

Recent theories of focusing and reference rely crucially on discourse structure to constrain the availability of discourse entities for reference, but deriving the structure of an arbitrary discourse has proved to be a significant problem. A useful level of problem reduction may be achieved by analyzing discourse in which the structure is explicit, rather than implicit. In this paper we consider a genre of explicitly-structured discourse: the Trouble and Failure Report <i>(TFR)</i>, whose structure is both explicit and constant across discourses. We present the results of an analysis of a corpus of 331 TFRs, with particular attention to discourse segmentation and focusing. We then describe how the Trouble and Failure Report was automated in a prototype data collection and information retrieval application, using the PUNDIT natural-language processing system.
Tracing application program execution on the Cray X-MP and Cray 2
Authors: Allen D. Malony, John L. Larson, Daniel A. Reed
Venue: Proceedings of the 1990 ACM/IEEE conference on Supercomputing (1990)

Important insights into program operation can be gained by observing dynamic execution behavior. Unfortunately, many high-performance machines provide execution profile summaries as the only tool for performance investigation. We have developed a tracing library for the Cray X-MP and Cray 2 supercomputers that supports the low-overhead capture of execution events for sequential and multitasked programs. This library has been extended to use the automatic instrumentation facilities on these machines, allowing trace data from routine entry and exit, and other program segments, to be captured. To assess the utility of the trace-based tools, three of the Perfect Benchmark codes have been tested in scalar and vector modes with the tracing instrumentation. In addition to computing summary execution statistics from the traces, interesting execution dynamics appear when studying the trace histories. It is also possible to compare codes across the two architectures by correlating the event traces. Our conclusion is that adding tracing support in Cray supercomputers can have significant returns in improved performance characterization and evaluation.
Object-oriented programming in Classic-Ada
Authors: Michael L. Nelson, Gilberto F. Mota
Venue: ACM SIGAda Ada Letters (1992)

Ada is not generally considered to be an object-oriented language. Classic-Ada is a preprocessor which adds the concepts of classes, inheritance, and dynamic binding to the Ada language. In this paper, we review the use of Classic-Ada as an object-oriented programming language.
An overview of the ISO/VDM-SL standard
Authors: Nico Plat, Peter Gorm Larsen
Venue: ACM SIGPLAN Notices (1992)

VDM-SL, the notation incorporated in the formal method VDM, is currently being standardized under auspices of the International Standards Institution (ISO) and the British Standards Institution (BSI). It is one of the few formal languages of which the syntax and the semantics have been completely formally defined. In this paper we present an overview of the standard, including a report on the current status of the standardization effort.
HARE: an optimizing portable compiler for Scheme
Authors: Dan Teodosiu
Venue: ACM SIGPLAN Notices (1991)

A highly optimizing Scheme compiler called HARE is presented. A combination of several optimization techniques allows for the generation of very efficient code. Easy portability of the compiler has been achieved through the use of a virtual machine as a target for code generation. The compiler will be used as a test-bed for fine-tuning the instruction set of a symbolic architecture, the S-Machine.
Overview of the institute for research on learning
Authors: William J. Clancey
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

The Institute for Research on Learning (IRL) is a non-profit organization founded in 1986 in Palo Alto, California, committed to understanding what leads to successful learning in the schools, the workplace, and everyday life. A basic premise of IRL research, that people learn best when they are engaged with others, leads IRL's researchers to perceive schools and workplaces as communities of learners and to focus on the design of environments, technology, and activities that support learning as a collaborative activity. IRL pursues its research in collaboration with schools, universities, corporations, and government agencies&mdash;in the actual settings in which learning takes place.
YAPO: yet another preview ODA
Authors: M. A. Apollonio, G. Colasante, P. G. De Luca, A. Diana, A. Gisotti
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

The production of documents aimed at supporting the flow of information in an office environment is experiencing an evolution based on the most advanced automation systems which concerns substantially four aspects: 1) the production of manipulable documents showing a high quality of representation; 2) the production of documents that can be integrated (or exported) with other workstation formats on the basis of varying approaches (for instance the ISO standards); 3) the production of processable documents for storage or subsequent post-production; 4) the production of immaterial documents, i.e. documents that do not necessarily need a visual medium (paper, screen) representation for their informative content.
Optimal Scheduling of Signature Analysis for VLSI Testing
Authors: Y.-H. Lee, C. M. Krishna
Venue: IEEE Transactions on Computers (1991)

A simple algorithm that shows how to optimally schedule the test-application and the signature-analysis phases of VLSI testing is presented. The testing process is broken into subintervals, the signature is analyzed at the end of each subinterval, and future tests are aborted if the circuit is found to be faulty, thus saving test time. The mathematical proofs associated with the algorithm are given.
Cluster: an informal report
Authors: Shang Lujun
Venue: ACM SIGPLAN Notices (1991)

Cluster is a newly designed and implemented object-oriented programming language. This report gives an outline of the language by examples, explanations, comments, and the comparison with other languages. Though incomplete and informal, it shows interesting results in many aspects of the language.
Thoughts on large scale programming projects
Authors: Robert McLaughlin
Venue: ACM SIGPLAN Notices (1991)

Developing a theory of software design and implementation has absorbed a great deal of effort in the computer business. In practice, the theory is often ignored or proven to be of no value. In the following, I attempt to develop a pragmatic approach to large scale software projects.The basic issues of management are left out of such discussions: the issues of involving employees in their job and generating an attitude in them that management values them as creative members of a team.
Feasibility of &ldquo;perfect&rdquo; function evaluation
Authors: C. B. Dunham
Venue: ACM SIGNUM Newsletter (1990)

This paper casts doubt on the feasibility of perfect subroutines or perfect hardware for mathematical functions, in particular by conversion from double precision. It suggests a slightly relaxed standard.
Using boolean of integer arrays to analyze networks
Authors: Kenneth Fordyce, Mario Morreale, Jan Jantzen, Gerald Sullivan
Venue: ACM SIGAPL APL Quote Quad (1991)

A critical computational requirement for many of the decision technologies in the fields of operations research (PERT/CPM, Markov chains, decision trees, Bayesian analysis, MRP, simulation, hellip;), artificial intelligence (evidential reasoning, truth maintenance systems, propositional logic, rule based inference, frames and semantic nets, hellip;), and decision support systems (worksheet or financial planning models, data / entity models, hellip;) is the development and manipulation of a function network or directed graph describing the relationship between "variables", "objects", or "actors" involved in the application of the decision technology to a specific problem. The manipulation of such networks or graphs using Boolean matrices and vector of integer vectors is well known in portions of the APL community (see bibliography), but intertwined with specific applications and spread out across a variety sources (some of which are difficult to obtain). This paper succinctly and simply describes the basics of manipulating a function network with Boolean matrices and integer vectors including focusing networks, finding circular conditions (A depends on B, B depends on C, C depends on A, therefore A depends on A, hellip;), and grouping functions based on relative independence to identify parallel computational opportunities and substantially reduces the non-procedural aspect of the problem.
Experimental Evaluation of a Real-Time Scheduler for a Multiprocessor System
Authors: Ben A. Blake, Karsten Schwan
Venue: IEEE Transactions on Software Engineering (1991)

A description is given of the design, implementation, and experimental evaluation of a multiprocessor scheduler used with robotics applications and other real-time programs. The scheduler makes decisions concerning both the assignment of processes and the scheduling of these processes on each processor such that a near-optimal numer of processor deadlines is satisfied. It assumes that process execution times, deadlines, and earliest possible start times are known.
Coping with friction for non-penetrating rigid body simulation
Authors: David Baraff
Venue: Proceedings of the 18th annual conference on Computer graphics and interactive techniques (1991)

Algorithms and computational complexity measures for simulating the motion of contacting bodies with friction are presented. The bodies are restricted to be perfectly rigid bodies that contact at finitely many points. Contact forces between bodies must satisfy the Coulomb model of friction. A traditional principle of mechanics is that contact forces are impulsive if and only if non-impulsive contact forces are insufficient to maintain the non-penetration constraints between bodies. When friction is allowed, it is known that impulsive contact forces can be necessary even in the absence of collisions between bodies. This paper shows that computing contact forces according to this traditional principle is likely to require exponential time. An analysis of this result reveals that the principle for when impulses can occur is too restrictive, and a natural reformulation of the principle is proposed. Using the reformulated principle, an algorithm with expected polynomial time behaviour for computing contact forces is presented.
Integrated placement for mixed macro cell and standard cell designs
Authors: Michael Upton, Khosrow Samii, Stephen Sugiyama
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

This paper presents an approach to the automatic placement of a combination of macro blocks and standard cells. Standard cells are partitioned into flexible virtual blocks during block placement and are later placed into the target area through an integrated optimization routine. Results for a number of examples are given, including those from standard placement benchmarks.
Normal forms for a class of formulas
Authors: H. M. M. Ten Eikelder, J. C. F. Wilmont
Venue: Journal of Symbolic Computation (1991)

We consider a class of formulas which consist of real functions a1,...,aN, their derivatives, and zero or more occurrences of an integration operator I. Formulas of this type arise in some part of mathematical physics. Due to integration by parts, various formulas have the same meaning for all (suitable) functions a1,...,aN. Anormal form and a normalization algorithm are given.
Field test evaluations and optimization of speaker independent speech recognition for telephone applications
Authors: Christian Gagnoulet, Christel Sorin
Venue: Proceedings of the workshop on Speech and Natural Language (1991)

This paper presents, in a first part, the detailed results of several field evaluations of the CNET speaker independent speech recognition system in a context of 2 voice-activated servers accessible by the general French public over the telephone. The analysis of roughly 11 000 user's tokens indicates that the rejection of incorrect input is a major problem and that the gap between the recognition rates observed in real use conditions and in the most "realistic" laboratory tests remains very large.The second part of the paper describes the current improvements of the system: better rejection procedures, enhancement of the recognition performances resulting from both the introduction of field data in the training data and the increase of the number of parameters, automatic adjustments of the HMM topology allowing to either reduce overall model complexity or improve recognition performance. Tested on long distance telephone databases (450 to 750 speakers), the current version of the CNET recognition system yields a laboratory error rate of 0.7% on the 10 French digits and of 0.95% on a 36 word vocabulary.
Higher Radix Square Rooting
Authors: L. Ciminiera, P. Montuschi
Venue: IEEE Transactions on Computers (1990)

A general discussion on nonrestoring square root algorithms is presented, showing bounds and constraints delimiting the space of feasible algorithms, for all the choices of radix, digit set and representation of the partial remainder. Two classes of algorithms are then derived from the general discussion, and it is shown how it is possible to determine two parameters with a relevant impact on the implementation: the number of radicand bits to be inspected in order to obtain a starting value, and the number of partial remainder bits to be examined for digit selection. The algorithms for the specific case of radix 4 digit set (-2, -1, 0, +1, +2), and partial remainder represented in carry-save form are derived in order to show that the algorithms introduced can lead to better results than those obtained with algorithms previously presented.
Analyzing telegraphic messages
Authors: Ralph Grishman, John Sterling
Venue: Proceedings of the workshop on Speech and Natural Language (1989)

Most people have little difficulty reading telegraphic-style messages such asSHIPMENT GOLD BULLION ARRIVING STAGECOACH JAN. 7 3 PMeven though lots of material has been omitted which would be required in "standard English", such as articles, prepositions, and verbs. Our concern in this paper is how to process such messages by computer. Even though people don't send many telegrams anymore, this problem is still of importance because many military messages are written in this telegraphic style:2 FLARES SIGHTED 230704Z6 SOUTH APPROX 5 MI SPA ESTABLISHED(here 230704Z6 is the time, and SPA is the Submarine Probability Area).
Layout compaction with attractive and repulsive constraints
Authors: Akira Onozawa
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

A one-dimensional compaction algorithm with attractive and repulsive constraints is proposed. Depending on these constraints, the proposed algorithm shrinks[expands] the spaces among the specified layout elements without causing any design rule violations, as if some force were affecting them. It implies that the resultant layout has less cross talk and delay. The proposed network simplex algorithm experimentally proves to be efficient in both time and space.
A comparative evaluation of graphical user interfaces
Authors: Rainer Ebner, Gunter Haring, Franz Penz, Gerhard Weichselberger
Venue: ACM SIGCHI Bulletin (1990)

In a study based on a questionnaire and an empirical test three graphical user interfaces for the DOS operating system commands (GEM, Windows 1.04, Windows 2.01) are compared.
Spectrally optimal sampling for distribution ray tracing
Authors: Don P. Mitchell
Venue: ACM SIGGRAPH Computer Graphics (1991)

Nonuniform sampling of images is a useful technique in computer graphics, because a properly designed pattern of samples can make aliasing take the form of high-frequency random noise. In this paper, the technique of nonuniform sampling is extended from two dimensions to include the extra parameter dimensions of distribution ray tracing. A condition for optimality is suggested, and algorithms for approximating optimal sampling are developed. The technique is demonstrated at low sampling densities, so the characteristics of aliasing noise are clearly visible. At supersampling rates, this technique should move noise into frequencies above the passband of the pixel-reconstruction filter.
Implementing C function calls in rules for an expert system shell
Authors: B. I. B. Madhav, Narayan Hegde
Venue: ACM SIGPLAN Notices (1991)

In this paper, we report on the implementation of C function calls in rules for an expert system shell. The rule language supports calls to C functions in both antecedents and consequents, meta rules and queries to a relational database. The output of the compiler can be directly loaded or stored as a file. A loader and an inference engine are also provided.
Relevance feedback revisited
Authors: Donna Harman
Venue: Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval (1992)

Researchers have found relevance feedback to be effective in interactive information retrieval, although few formal user experiments have been made. In order to run a user experiment on a large document collection, experiments were performed at NIST to complete some of the missing links found in using the probabilistic retrieval model. These experiments, using the Cranfield 1400 collection, showed the importance of query expansion in addition to query reweighting, and showed that adding as few as 20 well-selected terms could result in performance improvements of over 100%. Additionally it was shown that performing multiple iterations of feedback is highly effective.