ppxscal/embedding_network huggingface dataset:
A direct manipulation interface for boolean information retrieval via natural language query
Authors: P. G. Anick, J. D. Brennan, R. A. Flynn, D. R. Hanssen, B. Alvey, J. M. Robbins
Venue: Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval (1989)

This paper describes the design of a direct manipulation user interface for Boolean information retrieval. Intended to overcome the difficulties of manipulating explicit Boolean queries as well as the &ldquo;black box&rdquo; drawbacks of so-called natural language query systems, the interface presents a two-dimensional graphical representation of a user's natural language query which not only exposes heuristic query transformations performed by the system, but also supports query reformulation by the user via direct manipulation of the representation. The paper illustrates the operation of the interface as implemented in the AI-STARS full-text information retrieval system.
Fast hashing of variable-length text strings
Authors: Peter K. Pearson
Venue: Communications of the ACM (1990)

Using only a few simple and commonplace instructions, this algorithm efficiently maps variable-length text strings small integers.
A new approach to text searching
Authors: R. A. Baeza-Yates, G. H. Gonnet
Venue: ACM SIGIR Forum (1989)

We introduce a family of simple and fast algorithms for solving the classical string matching problem, string matching with don't care symbols and complement symbols, and multiple patterns. In addition we solve the same problems allowing up to k mismatches. Among the features of these algorithms are that they are real time algorithms, they don't need to buffer the input, and they are suitable to be implemented in hardware.
Programming environments for highly parallel multiprocessors
Authors: A. P. Reeves
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1 (1988)

Emerging highly parallel multiprocessors offer an exciting alternative to conventional pipelined supercomputers for a variety of computationally intensive scientific applications. A factor that has impeded the introduction of these multiprocessor systems is that conventional languages, such as Fortran, cannot be directly used and new programming techniques must be mastered. A key issue for highly parallel systems is the development of appropriate programming environments. Programming environments are very difficult to specify for multiprocessor systems because a wide range of different programming paradigms are possible. For example, on a hypercube system, different applications require different operating systems for optimal performance. A typical hypercube programming environment includes a conventional language, such as Fortran or C, coupled with some message passing extensions. While the environment has a superficially familiar appearance, the organization of programs is much more complex and the user is now expected to program many functions which are conventionally done by the operating system. New programming environments need to be developed which have provisions for graceful fault tolerance, dynamic load balancing, dynamic algorithm selection, and automatic task decomposition and allocation.
Vectorization techniques for prolog
Authors: Yasusi Kanada, K. Kojima, M. Sugaya
Venue: Proceedings of the 2nd international conference on Supercomputing (1988)

Several techniques for running Prolog programs on pipelined vector processors, such as the Hitachi S-820 or the Cray-2, are developed. This paper presents an automatic program transformation (vectorization) method of Prolog, which enables a type of or-parallel execution of Prolog programs using vector operations. Performance is evaluated on the Hitachi S-810 using the Eight-Queens problem. Its vector execution speed is 4.5 MLIPS (18 ms). This is eight or nine times faster than scalar execution. This result confirms the effectiveness of vectorization techniques and applicability of vector processors to Prolog execution and to symbol processing applications.
Monte Carlo simulation of complex system mission reliability
Authors: E. E. Lewis, F. Boehm, C. Kirsch, B. P. Kelkhoff
Venue: Proceedings of the 21st conference on Winter simulation (1989)

A Monte Carlo methodology for the reliability simulation of highly redundant systems is presented. Two forms of importance sampling, forced transitions and failure biasing, allow large sets of continuous-time Markov equations to be simulated effectively and the results to be plotted as continuous functions of time. A modification of the sampling technique also allows the simulation of both nonhomogeneous Markov processes and of nonMarkovian processes involving the replacement of worn parts. A number of benchmark problems are examined. For problems with large numbers of components, Monte Carlo is found to result in decreases in computing times by as much as a factor of twenty from the Runge-Kutta Markov solver employed in the NASA code HARP.
Multiprocessor simulation of neural networks with NERV
Authors: R. Manner, R. Horner, R. Hauser, A. Genthner
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

A general-purpose simulation system for neural networks is computationally very demanding. This paper presents some estimations of the computing power required, the necessary interconnection bandwidth, and the requisite memory size. Next, the hardware architecture of the NERV multiprocessor system is derived that fulfills these requirements. Up to 320 processors 68020 are used in a single VME crate together with a Macintosh II as a host computer. This set-up provides a computing power of 1300 MIPS together with a friendly graphical user interface. To support the simulation of arbitrarily interconnected networks and of asynchronous update models, the VME bus has been extended by a broadcast feature and a global max finder. The software architecture is outlined. It consists of system software, utilities, and application software.
Processing natural language syntactic and semantic mechanisms
Authors: W. Hagamen, P. C. Berry, K. E. Iverson, J. C. Weber
Venue: ACM SIGAPL APL Quote Quad (1989)

This paper describes a simple approach to language processing. Knowledge of the domain is stored in a three row numeric matrix or semantic net. The meaning of individual words is contained in pointers from each word to the objects in the environment and the relations between these objects. The intersections of these pointers resolves the ambiguity inherent in the multiple meanings of words. The input string is treated as a series of triads, where the result of processing one triad is passed as an argument for the next triad. Parsing into the required noun phrases and verb phrases is done by semantic means (intersection); when words have no semantic pointers, a syntactic parser is utilized.
An automatic test generation algorithm for hardware description languages
Authors: F. E. Norrod
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

A new approach to test generation from Hardware Description Language circuit models has been developed and implemented. The described E-algorithm generates tests for control, operation, and data faults in sequential and combinational logic modeled at the functional level. A symbolic variable notation is introduced to permit systematic fault propagation through control structures. Results of the implementation are given for a set of test cases and the application of the algorithm to a semi-custom ASIC are discussed.
Toward a Model-Based Bayesian Theory for Estimating and Recognizing Parameterized 3-D Objects Using Two or More Images Taken from Different Positions
Authors: B. Cernuschi-Frias, D. B. Cooper, Y.-P. Hung, P. N. Belhumeur
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

A parametric modeling and statistical estimation approach is proposed and simulation data are shown for estimating 3-D object surfaces from images taken by calibrated cameras in two positions. The parameter estimation suggested is gradient descent, though other search strategies are also possible. Processing image data in blocks (windows) is central to the approach. After objects are modeled as patches of spheres, cylinders, planes and general quadrics-primitive objects, the estimation proceeds by searching in parameter space to simultaneously determine and use the appropriate pair of image regions, one from each image, and to use these for estimating a 3-D surface patch. The expression for the joint likelihood of the two images is derived and it is shown that the algorithm is a maximum-likelihood parameter estimator. A concept arising in the maximum likelihood estimation of 3-D surfaces is modeled and estimated. Cramer-Rao lower bounds are derived for the covariance matrices for the errors in estimating the a priori unknown object surface shape parameters.
Dixon's character table algorithm revisited
Authors: Gerhard J. A. Schneider
Venue: Journal of Symbolic Computation (1990)

Dixon's algorithm for the computation of character tables faces two problems-it requires the computation of complete class matrices, and many such class matrices will often turn out to yield no new information. This paper describes a method for overcoming these difficulties. In addition, an algorithm is presented that has a high probability of determining the two characters that span a two-dimensional character space without the need for computing an additional class matrix.
Parallel asynchronous algorithms for discrete data
Authors: Aydin Üresin, Michel Dubois
Venue: Journal of the ACM (JACM) (1990)

Many problems in the area of symbolic computing can be solved by iterative algorithms. Implementations of these algorithms on multiprocessors can be synchronous or asynchronous. Asynchronous implementations are potentially more efficient because synchronization is a major source of performance degradation in most multiprocessor systems. In this paper, sufficient conditions for the convergence of asynchronous iterations to desired solutions are given. The main sufficient condition is shown to be also necessary for the case of finite data domains. The results are applied to prove the convergence of three asynchronous algorithms for the all-pairs shortest path problem, the consistent labeling problem, and a neural net model.
Flexible processors: a promising application-specific processor design approach
Authors: A. Wolfe, P. Shen
Venue: Proceedings of the 21st annual workshop on Microprogramming and microarchitecture (1988)

A new approach to application specific processor design is presented in this paper. Existing application specific processors are either based on existing general purpose processors or custom designed special purpose processors. The availability of a new technology, the Xilinx Logic Cell Array, presents the opportunity for a new alternative. The Flexible Processor Cell is a prototype of an extremely reconfigurable application specific processor. Flexible processors can potentially provide the performance advantages of special purpose processors as well as the cost advantages of general purpose processors. The flexible processor concept opens many potential areas for future research in processor architecture and implementation. This paper presents the design, implementation, and preliminary performance evaluation of an experimental flexible processor.
About polynomial-time &ldquo;unpredictable&rdquo; generators
Authors: P. L'Ecuyer, R. Proulx
Venue: Proceedings of the 21st conference on Winter simulation (1989)

So-called "perfect" or "unpredictable" pseudorandom generators have been proposed recently by people from the area of cryptology. Many people got aware of them from an optimistic article in the New York Times (Gleick (1988)). These generators are usually based on nonlinear recurrences modulo some integer m. Under some (yet unproven) complexity assumptions, it has been proven that no polynomial-time statistical test can distinguish a sequence of bits produced by such a generator from a sequence of truly random bits.In this paper, we give some theoretical background concerning this class of generators and we look at the practicality of using them for simulation applications. We examine in particular their ease of implementation, their efficiency, periodicity, the ease of jumping ahead in the sequence, the minimum size of modulus that should be used, etc.
CRegs: a new kind of memory for referencing arrays and pointers
Authors: H. Dietz, C. H. Chi
Venue: Proceedings of the 1988 ACM/IEEE conference on Supercomputing (1988)

Often, pointer and subscripted array references touch memory locations for which there are several possible aliases, hence these references cannot be made from registers. Although conventional caches can increase performance somewhat, they do not provide many of the benefits of registers, and do not permit the compiler to perform many optimizations associated with register references. The CReg (pronounced &ldquo;C-Reg&rdquo;) mechanism combines the hardware structures of cache and registers to create a new kind of memory structure, which can be used either as processor registers or as a replacement for conventional cache memory. By permitting aliased names to be grouped together, CRegs resolve ambiguous alias problems in hardware, resulting in more efficient execution than even the combination of conventional registers and cache can provide. This paper discusses both the conceptual CReg hardware structure and the compiler analysis and optimization techniques to manage that structure.
A study parallel disk organizations
Authors: A. L. N. Reddy, P. Banerjee
Venue: ACM SIGARCH Computer Architecture News (1989)

In this paper, several issues related to designing a parallel disk system are discussed. Results of performance evaluation of several parallel disk organizations are presented. A characterization of the disk systems is also presented. Issues such as scalability, networking etc. are discussed. Several problems for future research on improving the I/O performance are pointed out.
Mesh Computer Algorithms for Computational Geometry
Authors: R. Miller, Q. F. Stout
Venue: IEEE Transactions on Computers (1989)

Asymptotically optimal parallel algorithms are presented for use on a mesh computer to determine several fundamental geometric properties of figures. For example, given multiple figures represented by the Cartesian coordinates of n or fewer planar vertices, distributed one point per processor on a two-dimensional mesh computer with n simple processing elements, Theta (n/sup 1/2/¿-time algorithms are given for identifying the convex hull and smallest enclosing box of each figure. Given two such figures, a Theta (n/sup 1/2/¿-time algorithm is given to decide if the two figures are linearly separable. Given n or fewer planar points, Theta (n/sup 1/2/¿-time algorithms are given to solve the all-nearest neighbor problems for points and for sets of points. Given n or fewer circles, convex figures, hyperplanes, simple polygons, orthogonal polygons, or iso-oriented rectangles, Theta (n/sup 1/2/¿-time algorithms are given to solve a variety of area and intersection problems. Since any serial computer has worst-case time of Omega (n) when processing n points, these algorithms show that the mesh computer provides significantly better solutions to these problems.
Object oriented programming in AIDA APL
Authors: M. Gfeller
Venue: ACM SIGAPL APL Quote Quad (1989)

The extension of APL arrays to parts and the inclusion of a hierarchical library system allows programming in an object oriented (OO) fashion without further extensions to the language. A model of a message sending mechanism is developed as an AIDA APL user defined function. A simple class structure is presented. The OO approach is examined to determine whether it can improve system design in APL.
F-logic: a higher-order language for reasoning about objects, inheritance, and scheme
Authors: Michael Kifer, Georg Lausen
Venue: ACM SIGMOD Record (1989)

We propose a database logic which accounts in a clean declarative fashion for most of the &ldquo;object-oriented&rdquo; features such as object identity, complex objects, inheritance, methods, etc. Furthermore, database schema is part of the object language, which allows the user to browse schema and data using the same declarative formalism. The proposed logic has a formal semantics and a sound and complete resolution-based proof procedure, which makes it also computationally attractive.
Some aspects of complexity in real algebraic geometry
Authors: Jean-Jacques Risler
Venue: Journal of Symbolic Computation (1988)

This paper gives a description of some aspects of complexity in real algebraic geometry: explicit bounds for the topology of real algebraic and semi-algebraic sets are given in term of the degree of the equations and inequations (results by Milnor-Thom), and then in term of the additive complexity of the equations and inequations (i.e. in term of the minimal number of addition-substractions needed to evaluate the equations) (results by Grigorlev-Risler). Those results are then used to give lower bounds for the complexity of various algorithms (results of Ben-Or). The work of Collins and its school about C.A.D. of semi-algebraic sets is mentioned, and the paper ends with a description of a class of real analytic sets to which it is possible to generalise some of the previous methods (results by Hovansky).
Performance evaluation of a formally supercomputer-based Monte Carlo program on a T800 transputer network
Authors: M. Luckas
Venue: Proceedings of the 2nd international conference on Supercomputing (1988)

The performance of a Monte Carlo program used for the computation of thermodynamic properties from sophisticated intermolecular potential functions is tested on a CYBER 205 vectorcomputer and a T800 transputer network. Carefully vectorization and optimization of the scalar code gives a mean speed-up factor of 20 on the CYBER 205. For parallel execution the time-consuming parts of the program were equally distributed among all processors of the network. The mean efficiency of this parallelization on a system with 16 processors is about 80 per cent with a mean speed ratio of 7 between the maximum performance of the CYBER 205 and the transputer network.
Ada on a hypercube
Authors: R. Clapp, T. Mudge
Venue: ACM SIGAda Ada Letters (1989)

The widespread use of parallel machines, and hypercubes in particular, is being held back by the lack of high-order parallel programming languages. In this paper we discuss the issues involved in establishing an existing language that supports parallel processing, Ada, on a hypercube multiprocessor. The majority of the paper addresses the requirements and implementation of the run-time system, which is the key to establishing any parallel language. First, the requirements of the run-time system for Ada are described from a machine-independent point of view. Next, the approach taken toward implementing this system on a hypercube is discussed, with considerations given for language-level program partitioning and interprocessor communication performance. Finally, the status of our current implementation is discussed and some concluding remarks are made about parallel languages in general, based on our experiences.
Using discrete-event computer simulation to test control systems
Authors: T. I. Miles, H. Siddeley
Venue: Proceedings of the 21st conference on Winter simulation (1989)

The material handling control system of an automated manufacturing facility is tested during the commissioning of the plant. This leads to protracted commissioning periods as well as the possibility of costly equipment damage. The testing is performed in a modular fashion so that complex interaction are often overlooked.It is suggested that simulation can play a valuable part in speeding up the commissioning stage of plant startup by interfacing the control system to a computer simulation of the factory. The control system receives information about the state of the manufacturing system from the simulation and the simulation receives information from the controller on what to do next. By developing a complete simulation model and running the simulation for long periods of simulated time, the control system can be tested rigorously prior to the plant startup.The emphasis of this paper is on some of the important practical concerns of linking a discrete-event simulation system to a controller. The impact this has on the simulation model will be discussed in conjunction with two small example problems. The examples will include some of the code used to connect the controller and the simulation.
Okies: a troubleshooter in the factory
Authors: Douglas Gordin, Douglas Foxvog, James Rowland, Pamela Surko, Gregg Vesonder
Venue: Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1988)

OKIES is an expert system that troubleshoots newly assembled AT T 3B2 computer systems. All AT T 3B2 models and configurations are analyzed by OKIES. The expert system uses an architecture-based design to apply the same knowledge to different machines. An architectural model of the machine is constructed when the session begins. This model is used to determine which tests are applicable, the components that compose the machine, and how the machine should be fixed. OKIES was built as a production system using the OPS/83[1] language. All inference is done by matching. No search or backtracking is performed. The first OKIES prototype used rules generated by a conceptual clustering system. A diagnosis is interactively developed by first having the user pick among problem descriptions. The expert system then refines this by asking the user questions. For instance, the user is asked to examine hardware connections, run tests and report on error messages. If the expert system still can not classify the problem it requests further tests or presents a new problem classification. After determining the problem a treatment is prescribed. The treatment depends on the problem found, the machine's configuration, and the machine's prior history. The current organization of OKIES is presented along with a description of the process by which it was built. Initially the system was developed ad hoc with structure later imposed. Specifically, generalization and decision trees were used to organize the knowledge.
Barriers to computer-based message systems in developing countries
Authors: Khalil F. Matta
Venue: ACM SIGCAS Computers and Society (1989)

Proponents of compute-based message systems claim that it increases the productivity and efficiency of operations. Its use has mush roomed in the last five years in industrialized nations. The use of such systems in less-developed countries is however practically nonexistent. This paper examines the barriers in those countries to its use. These barriers are divided into four categories; technical, economic, political and social. Some strategies for dealing with those barriers is also presented.