ppxscal/embedding_network huggingface dataset:
Query processing in a heterogeneous retrieval network
Authors: P. Simpson
Venue: Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval (1988)

The concept of a large-scale information retrieval network incorporating heterogeneous retrieval systems and users is introduced, and the necessary components for enabling term-based searching of any database by untrained end-users are outlined. We define a normal form for expression of queries, show that such queries can be automatically produced, if necessary, from a natural-language request for information, and give algorithms for translating such queries, with little or no loss of expressiveness, into equivalent queries on both Boolean and term-vector type retrieval systems. We conclude with a proposal for extending this approach to arbitrary database models.
An O(nlogm) algorithm for VLSI design rule checking
Authors: C. R. Bonapace, C.-Y. Lo
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

This paper describes a new variant of the segment tree approach for VLSI design rule checking. The best known algorithms to date for flat VLSI design rule checking require O(nlogn) expected time and O(&radic;n) expected space, where n is the total number of edges on a mask layer of the chip. We present a new algorithm that can run in O(nlogm) expected time, where m is the maximum feature size on a particular mask layer. Since the maximum feature size must be bounded by the height of a chip, i.e. m &le; O(&radic;n), the new algorithm is adaptively more efficient than O(nlogn). For layers such as diffusion or contact windows where the maximum feature size is independent of chip size, i.e. m = O(1), the new algorithm runs in O(n) expected time, a definite improvement. The improved time efficiency is achieved without sacrificing O(&radic;n) expected space complexity.
Parallel implementation of domain decomposition techniques on Intel's hypercube
Authors: M. Haghoo, W. Proskurowski
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2 (1989)

Parallel implementation of domain decomposition techniques for elliptic PDEs in rectangular regions is considered. This technique is well suited for parallel processing, since in the solution process the subproblems either are independent or can be easily converted into decoupled problems. More than 80% of execution time is spent on solving these independent and decoupled problems. The hypercube architecture is used for concurrent execution. The performance of the parallel algorithm is compared against the sequential version. The speed-up, efficiency, and communication factors are studied as functions the number of processors. Extensive tests are performed to find, for a given mesh size, the number of subregions and nodes that minimize the overall execution time.
Curved surfaces and coherence for non-penetrating rigid body simulation
Authors: David Baraff
Venue: Proceedings of the 17th annual conference on Computer graphics and interactive techniques (1990)

A formulation for the contact forces between curved surfaces in resting (non-colliding) contact is presented. In contrast to previous formulations, constraints on the allowable tangential movement between contacting surfaces are not required. Surfaces are restricted to be twice-differentiable surfaces without boundary. Only finitely many contact points between surfaces are allowed; however, the surfaces need not be convex. The formulation yields the contact forces between curved surfaces and polyhedra as well. Algorithms for performing collision detection during simulation on bodies composed of both polyhedra and strictly convex curved surfaces are also presented. The collision detection algorithms exploit the geometric coherence between successive time steps of the simulation to achieve efficient running times.
Concurrent and vectorized Monte Carlo simulation of the evolution of an assembly of particles increasing in number
Authors: C.-H. Wu, C.-J. Wang
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

Parallel Monte Carlo techniques for simulating the evolution of an assembly of charged particles interacting with a background gas medium under the influence of the electrical field are presented. This simulation problem has inherent parallelism in nature. All the particles can be traced independently in a short time interval. We have overcome three major difficulties: 1) the number of particles to be simulated is increasing over time due to the ionization process; 2) the conditional branching statements do not inhibit multiprocessing through proper manual program tuning; 3) concurrency and vectorization are fully utilized through the new parallelized Monte Carlo method. The shared&mdash;memory vector multiprocessor Alliant FX/80 has been used for performance measurements. Significant speedup has been achieved.
View updates in relational databases with an independent scheme
Authors: Rom Langerak
Venue: ACM Transactions on Database Systems (TODS) (1990)

A view on a database is a mapping that provides a user or application with a suitable way of looking at the data. Updates specified on a view have to be translated into updates on the underlying database. We study the view update translation problem for a relational data model in which the base relations may contain (indexed) nulls. The representative instance is considered to be the correct representation of all data in the database; the class of views that is studied consists of total projections of the representative instance. Only independent database schemes are considered, that is, schemes for which global consistency is implied by local consistency. A view update can be an insertion, a deletion, or a modification of a single view tuple. It is proven that the constant complement method of Bancilhon and Spyratos is too restrictive to be useful in this context. Structural properties of extension joins are derived that are important for understanding views. On the basis of these properties, minimal algorithms for translating a single view-tuple update are given.
Summary of the international seminar on parallel processing systems
Authors: S. R. Das
Venue: ACM SIGDA Newsletter (1989)

I had the opportunity of participating as an author of contributed papers, as an invited lecturer, and as a Session Chairperson at the Fourth National Convention of Computer Engineers - Seminar on Parallel Processing Systems and their Applications held at the Institution of Engineers (India), West Bengal State Center, Calcutta, India during December 9-11, 1988, and at the International Computer Symposium held at Tamkang University, Tamsui, Taiwan, Republic of China during December 15-17, 1988. In the following I will first endeavor to discuss some of the important aspects of the Fourth National Convention of Computer Engineers which will be succeeded by discussions on the various aspects of the International Computer Symposium.
Collection from the left and other strategies
Authors: C. R. Leedham-Green, L. H. Soicher
Venue: Journal of Symbolic Computation (1990)

We describe experiments with various collection strategies for the multiplication of elements of a p-group. We conclude that collection from the left is a very good strategy, then analyse the computational complexity of collection from the left, and compare it with that of collection from the right. Collection from the left also appears to be an excellent strategy for the multiplication of elements of a finite soluble group.
The crystal ball of research: how to use it to learn about the user community
Authors: Susan Grajek
Venue: Proceedings of the 16th annual ACM SIGUCCS Conference on User Services (1988)

With computing becoming more diverse and ubiquitous, it will be increasingly important in the future for user services departments to learn about the characteristics and needs of the people we serve. As a research psychologist working at Yale's Computer Center, I have spent much of my time during the past year developing a research program to do just that. This paper will detail the development of the research agenda, describing the process involved, the program itself, and results we've obtained so far. I will end by offering suggestions on how other universities can develop their own user research programs.
Crisis and aftermath
Authors: E. H. Spafford
Venue: Communications of the ACM (1989)

Last November the Internet was infected with a worm program that eventually spread to thousands of machines, disrupting normal activities and Internet connectivity for many days. The following article examines just how this worm operated.
A file structure supporting traversal recursion
Authors: P.-A. Larson
Venue: ACM SIGMOD Record (1989)

Traversal recursion is a class of recursive queries where the evaluation of the query involves traversal of a graph or a tree. This limited type of recursion arises in many applications. In this report we investigate a simple file structure that efficiently supports traversal recursion over large, acyclic graphs. The nodes of the graph are sorted in topological order and stored in a B-tree. Hence, traversal of the graph can be done in a single scan. Nodes and edges can also be inserted, deleted, and modified efficiently.
Use of structure-based models in the development of expert systems
Authors: J. G. Ramirez
Venue: Issue 109 (July 1989) (1989)

The Knowledge representation method plays an important role in the way the knowledge is accessed and used; thats the reason why the Knowledge representation is the key factor in the expert systems or Knowledge based systems development.
A Study of Associative Evidential Reasoning
Authors: Y. Cheng, R. L. Kashyap
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

Associative evidential reasoning is the mechanism of combining evidence and evaluating hypotheses, which is the core of many computational systems. It is shown that under the generalized symmetry condition, that is, f(a,b)=neg (f(neg(a), neg(b))), where f is the combination operator satisfying common requirements like associativity and monotonicity, and neg maps positive elements to negative ones and vice versa, f is uniquely determined by a one-place mapping from the positive region to the set of positive reals. Furthermore, such combination formulas cannot be made robust, and quantizing the region will cause the loss of associativity or other inconsistencies. The implications on evidential reasoning system are: there exists often only one kind of formula for combining evidence; the quest for robust combination is often infeasible; and the attempt of converting numerical degrees of belief to linguistic quantifiers and vice versa is destined to be fruitless.
Generalized Multidimensional Orthogonal Polynomials with Applications to Shape Analysis
Authors: J. Xu, Y.-H. Yang
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

A technique using the generalized multidimensional orthogonal polynomials (GMDOP) for 2-D shape analysis is proposed. In shape analysis, spatial invariances (i.e. translational invariance, scaling invariance, rotational invariance, etc.) are important requirements for a shape analysis algorithm. The described technique provides not only the three invariant properties but also mirror-image rotational invariance and permutational invariance. Experimental results supporting the theory are presented.
Software Pivotal to Strategic Defense
Authors: Ware Myers
Venue: Computer (1989)

The role of software in the success of the Strategic Defense System, as reflected in the keynote address and papers at the Second International Conference on Software for Strategic Systems, in Huntsville, Alabama, October 26, 1988, is discussed. The dominant theme is that making huge aggregations of weapons work together depends on well-conceived architecture and battle-scale simulation, which takes increased investment in software environments. The issues of software reliability, software engineering environments, simulation, and software productivity are examined. An approach to software engineering called the Ada process model is defined and characterized by a set of guidelines.
A parallel APL machine
Authors: Jügen Sauermann
Venue: ACM SIGAPL APL Quote Quad (1990)

The suitability of APL as a programming language for parallel computers seems to be obvious. Nevertheless, integral concepts of parallel APL machines are rare. Some ideas published so far are either not feasible with today's technology (e.g. needing large crossbar switches, which are expensive) or not detailed enough to prove their feasibility At SaarbrUcken university, we developed a 32-processor prototype of a parallel APL machine along with a high performance network designed for up to 256 processors. Besides building the prototype (which shows the feasibility with today's technology), we specified in detail, in which way the parallel APL machine is operating. In this paper, we present the basic principles of the parallel APL machine together with the efficiency of the machine for the most important APL functions. The details are described in [Sa].
Design of a testable RISC-to-CISC control architecture
Authors: Y. K. Malaiya, S. Feng
Venue: Proceedings of the 21st annual workshop on Microprogramming and microarchitecture (1988)

A new control architecture is introduced. It is highly testable, and it will support both simple and complex instruction sets. The flexibility is achieved by use of allocable-storage (AS) blocks. An AS block may be assigned to the control part to hold the microcode, or it may be assigned to the data part to hold data or instructions.
Dynamic simulation of autonomous legged locomotion
Authors: Michael McKenna, David Zeltzer
Venue: Proceedings of the 17th annual conference on Computer graphics and interactive techniques (1990)

Accurate simulation of Newtonian mechanics is essential for simulating realistic motion of joined figures. Dynamic simulation requires, however, a large amount of computation when compared to kinematic methods, and the control of dynamic figures can be quite complex. We have implemented an efficient forward dynamic simulation algorithm for articulated figures which has a computational complexity linear in the number of joints. In addition, we present a strategy for the coordination of the locomotion of a six-legged figure - a simulated insect - which has two main components: a gait controller which sequences stepping, and motor programs which control motions of the figure by the application of forces. The simulation is capable of generating gait patterns and walking phenomena observed in nature, and our simulated insect can negotiate planar and uneven terrain in a realistic manner. The motor program techniques should be generally applicable to other control problems.
Formal Analysis of the Alternating Bit Protocol by Temporal Petri Nets
Authors: Ichiro Suzuki
Venue: IEEE Transactions on Software Engineering (1990)

Temporal Petri nets are Petri nets in which certain restrictions on the firings of transitions are represented by formulas containing temporal operators. The use of temporal Petri nets for formal specification and verification of the alternating bit protocol is discussed. The temporal Petri net which models the protocol is analyzed formally using the existing theory of omega -regular expressions and Buchi-automata.
Performance Prediction and Calibration for a Class of Multiprocessors
Authors: D. F. Vrsalovic, D. P. Siewiorek, Z. Z. Segall, E. F. Gehringer
Venue: IEEE Transactions on Computers (1988)

A model for predicting multiprocessor performance on iterative algorithms is developed. Each iteration consists of some amount of access to global data and some amount of local processing. The iterations may be synchronous or asynchronous, and the processors may or may not incur waiting time, depending on the relationship between the access time and processing time. The effect on performance of the speed of the processor, memory, and the interconnection network is studied. The model also illustrates the significant impact on performance of decomposing an algorithm into parallel processes. The model's predictions are calibrated with experimental measurements.
Dependability Modeling and Evaluation of Software Fault-Tolerant Systems
Authors: Jean Arlat, Karama Kanoun, Jean-Claude Laprie
Venue: IEEE Transactions on Computers (1990)

Dependability modeling and evaluation (encompassing reliability and safety issues) of the two major fault tolerance software approaches-recovery blocks (RBs) and N version programming (NVP)-are presented. The study is based on the detailed analysis of software fault-tolerance architectures able to tolerate a single fault (RB: two alternates and an acceptance test; NVP: three versions and a decider). For each approach a detailed model based on the software production process is established and then simplified by assuming that only a single fault type may manifest during execution of the fault-tolerant software and that no error compensation may take place within the software. The analytical results obtained make it possible to identify the improvement, compared to a non-fault-tolerant software, that could result from the use of RB (the acceptance test has to be more reliable from the alternates) and NVP (related faults among the versions and the decider have to be minimized) and to determine the most critical types of related faults. Nested RBs are studied, showing that the proposed analysis approach can be applied to such realistic software structures and that when an alternate is itself an RB, the results are analogous to the case of the addition of a third alternate. The reliability analysis shows that only a small improvement can be expected.
Fully abstract compositional semantics for logic programs
Authors: H. Gaifman, E. Shapiro
Venue: Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1989)

We propose a framework for discussing fully abstract compositional semantics, which exposes the interrelations between the choices of observables, compositions, and meanings. Every choice of observables and compositions determines a unique fully abstract equivalence. A semantics is fully abstract if it induces this equivalence. We study the semantics of logic programs within this framework. We find the classical Herbrand-base semantics of logic programs inadequate, since it identifies programs that should be distinguished and vice versa. We therefore propose alternative semantics, and consider the cases of no compositions, composition by program union, and composition of logic modules (programs with designated exported and imported predicates). Although equivalent programs can be in different vocabularies, we prove that our fully abstract semantics are always in a subvocabulary of that of the program. This subvocabulary, called the essential vocabulary, is common to all equivalent programs. The essential vocabulary is also the smallest subvocabulary in which an equivalent program can be written.
Using cumulative graphic traces in the visualization of sorting algorithms
Authors: D. C. Stone
Venue: ACM SIGCSE Bulletin (1989)

Some instructionally oriented graphic displays of algorithm execution can be enhanced by the use of a cumulative graphic trace, which presents a stylized visual representation of the history of the algorithm's operation on a data structure. This graphic trace can convey information about the order in which operations were done or elements were processed, information which is often not available in dynamic displays of algorithm execution. It can also in some cases serve as in "icon" to help students remember the algorithm or contrast it with similar algorithms. The use of cumulative graphic traces in the study of various sorting algorithms is illustrated.
SNA and OSI: three strategies for interconnection
Authors: Matthew A. Tillman, David C.-C. Yen
Venue: Communications of the ACM (1990)

The rise of the Open Systems Interconnection Reference Model (OSI) in the past five years is forcing IBM to rethink its plans for its proprietary network standard Systems Network Architecture (SNA). This article reviews three interconnection strategies to be considered.
Stratification and knowledge base management
Authors: Catherine Lassez, Ken McAloon, Graeme Port
Venue: Journal of Symbolic Computation (1989)

We address the problem of interactively constructing models of a knowledge base expressed in logic. User inputs in the form of assertions are added to the initial knowledge base and some specific logical consequences of the assertions are used to provide guidance for further interaction. We show that the concept of stratification applied to disjunctive knowledge bases provides a framework for maintaining the computational complexity of the interaction to a manageable level. We discuss the dynamics of the stratification and the related complexity issues. Several algorithms that form the core of an interactive knowledge base maintainance system are presented including a linear time stratification algorithm based on a graph theoretic characterization of the concept of stratifiability.
Multiprocessor main memory transaction processing
Authors: K. Li, J. F. Naughton
Venue: Proceedings of the first international symposium on Databases in parallel and distributed systems (2000)

In this paper we describe an experiment designed to evaluate the potential transaction processing system performance achievable through the combination of multiple processors and massive memories. The experiment consisted of the design and implementation of a transaction processing kernel on stock multiprocessors. We found that with sufficient memory, multiple processors can greatly improve performance. A prototype implementation of the kernel on a pair of Firefly multiprocessors (each with five 1-MIP processors) runs the standard debit-credit benchmark at over 1000 transactions per second.
Localization and Noise in Edge Detection
Authors: E. de Micheli, B. Caprile, P. Ottonello, V. Torre
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

Two aspects of edge detection are analyzed, namely accuracy of localization and sensitivity to noise. The detection of corners and trihedral vertices is analyzed for gradient schemes and zero-crossing schemes. It is shown that neither scheme correctly detects corners of trihedral vertices, but that the gradient schemes are less sensitive to noise. A simple but important conclusion is that the noise present in digital images of typical indoor scenes is small and the signal-to-noise ratio is high. The noise present in digital images is so small as to make the performances of a variety of filters almost indistinguishable. As a consequence small filters can be used and the exact shape of the filter is not critical.
State assignment using a new embedding method based on an intersecting cube theory
Authors: G. Saucier, C. Duff, F. Poirot
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

The controller state assignment methodology proposed here features two improvements over existing methods. First, a larger set of predictive minimizations in the control flowgraph is performed. Secondly, the embedding phase uses a new theory of intersecting cubes in the Boolean lattice. Practical results using the VLSI Technology Logic-Synthesizer on both PLA and multi-level logic demonstrate the effectiveness of the approach.
A new approach to derive robust sets for stuck-open faults in CMOS combinational logic circuits
Authors: J. F. Wang, T.-Y. Kuo, J.-Y. Lee
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

In this paper, we address the problem of deriving robust tests for single stuck-open faults in CMOS combinational circuits. We first examine the characteristics of the transition of the two patterns belonging to a two-pattern test. Then, a sufficient and necessary condition for a test to be robust is given. According to the given condition, we propose a new method to derive robust tests. Robustness verification of the derived tests is no longer required when using our approach.