ppxscal/embedding_network huggingface dataset:
XWIB: an X-Windows interface builder for scientific and engineering application programs
Authors: Roberta Tagliavini, Stephen Rondeau, Steven Chin
Venue: ACM SIGSMALL/PC Notes (1992)

Input to scientific programs (particularly, numerical simulation programs) traditionally requires an in-depth knowledge of complex and interdependent syntactic, semantic, and conceptual information. The effort to acquire this knowledge can deter a novice user from learning a program or cause an expert user to make errors. The XWIB (X-Windows Interface Builder) tool is designed to reduce this cognitive burden by supporting the specification and execution of a graphical user interface oriented toward creating input files for scientific programs.
Incomplete information in object-oriented databases
Authors: Roberto Zicari
Venue: ACM SIGMOD Record (1990)

We present a way to handle incomplete information both at schema and object instance level in an object-oriented database. Incremental schema design becomes possible with the introduction of generic classes. Incomplete data in an object instance is handled with the introduction of explicit null values in a similar way as in the relational and nested relations data models.
Two ways to act
Authors: Scott D. Anderson, David M. Hart, Paul R. Cohen
Venue: ACM SIGART Bulletin (1991)

We derive a simple mathematical model of the interaction of two tasks running concurrently on a uniprocessor. Specifically, we model the rate at which two periodic tasks will interrupt each other. The predictions of this model are supported by simulation experiments. From the model, we argue that placing reflexive control and cognitive control on different processors is not justified by the different time-scales over which they act, but is justified by the extent to which the higher priority task dominates the uniprocessor.
A Modular Fault-Tolerant Binary Tree Architecture with Short Links
Authors: Adit D. Singh, Hee Yong Youn
Venue: IEEE Transactions on Computers (1991)

The authors present a novel modular fault-tolerant binary tree architecture which is shown to be more effective in overcoming both operational faults and fabrication defects than earlier approaches. Furthermore, for practical size trees of up to eight levels, it is shown how the proposed design can be efficiently load out in VLSI with very short interconnections. Thus, the design is suitable for monolithic implementation of a large binary tree architectures. For board level multichip designs, a hybrid scheme, combining the new design with the SOFT approach, is presented. It shows better reliability than either design alone.
Scientific data visualization: a formal introduction to the rendering and geometric modeling aspects
Authors: Vincent J. Harrand, Amar Choudry, John P. Ziebarth
Venue: Proceedings of the 1990 ACM/IEEE conference on Supercomputing (1990)

Rendering and geometric modeling are two basic research areas for scientific data visualization and are also well-known in the established CAD/CAM-world. Several fundamental differences can be pointed out between CAD/CAM and scientific data visualization applications. As a result, a new class of rendering and geometric modeling algorithms especially for scientific data visualization is evolving. Depending on the characteristics of the data available, several complexity levels can be distinguished, resulting in a hierarchy of visualization problems. This hierarchical relationship is emphasized to obtain a theoretical and application independent framework for classification of visualization algorithms. An overview of the rendering and geometric modeling algorithms for scientific data visualization is given according to this framework.
An Efficient Routing Algorithm for Realizing Linear Permutations on p/sup t/-Shuffle-Exchange Networks
Authors: Shing-Tsaan Huang, Satish K. Tripathi, Nian-Shing Chen, Yu-Chee Tseng
Venue: IEEE Transactions on Computers (1991)

The authors present an efficient routing algorithm for realizing any permutation in LIN (linear-permutation-class) on single-stage shuffle-exchange networks with k*k switching elements, where k=p is a prime number. For any positive integer number n there are N=k/sup n/ processors connected by the network. The proposed algorithm can realize LIN in 2n-1 passes; it can be implemented by using Nn processors in O(n) time. It can also be extended to the shuffle-exchange networks with (p/sup t/*p/sup t/) switching elements, where t is a positive integer number. In addition, the routing of any arbitrary permutations on the networks with any integer k
Liouvillian Solutions of Linear Differential Equations with Liouvillian Coefficients
Authors: Michael F. Singer
Venue: Journal of Symbolic Computation (1991)

Let L(y) = b be a linear differential equation with coefficients in a differential field K. We discuss the problem of deciding if such an equation has a non-zero solution in K and give a decision procedure in case K is an elementary extension of the field of rational functions or is an algebraic extension of a transcendental liouvillian extension of the field of rational functions. We show how one can use this result to give a procedure to find a basis for the space of solutions, liouvillian over K, of L(y) = 0 where K is such a field and L(y) has coefficients in K.
APL catches the bus
Authors: Curtis A. Jones
Venue: ACM SIGAPL APL Quote Quad (1990)

IBM's APL2/PC includes the AP488IBM and AP488NI auxiliary processors for the IEEE-488 General Purpose Interface Bus (GPIB) to control a wide variety of I/O devices, instruments and tools. Process control and measurement in the lab and on the production line through the GPIB can be efficiently implemented with APL2/PC.The manuals for the GPIB software are large, and the manuals for the instruments that connect to the bus can be even larger. The system does have many capabilities, but most situations can be handled with a few basic commands. This short introduction can't claim to provide all that's needed to use the GPIB, but it may be enough to start an application, and it purports to point out the pertinent parts of the paper pile.
The philosophy of Lisp
Authors: Kenneth H. Sinclair, David A. Moon
Venue: Communications of the ACM (1991)

We consider here the importance of an overall systems viewpoint in avoiding computer-related risks. According to Webster's, a system is a regularly interacting or interdependent group of items forming a unified whole. In computer systems, one person's components may be another person's system, and one person's system may in turn be one of another person's components. That is, each layer of abstraction may have it own concept of a system. We speak of a memory system, a multiprocessor system, a distributed system, a multisystem system, a networked system, and so on. A system design can most effectively be considered as a unified whole when it is possible to analyze the interdependent subsystems individually and then to evaluate, reason about, and test the behavior of the entire system based on the interactions among the subsystems. This is particularly true of distributed systems that mask the presence of distributed storage, processing, and control. At each layer of abstraction, it is desirable to design (sub)systems that are context-free, but in reality there may be subtle interactions that must be accommodated&mdash;particularly those involving the operating environment.
Symbolic treatment of geometric degeneracies
Authors: Chee-Keng Yap
Venue: Journal of Symbolic Computation (1990)

Many descriptions of algorithms in computational geometry exclude degeneracies by fiat. Practitioners are left to their own devices for dealing with degeneracies when implementing such algorithms. Since degeneracies tend to be numerous and hard to enumerate exhaustively, this is often a reason against implementing such algorithms. This paper proposes a symbolic scheme for treating degeneracies. Our method is simple to use, and is applicable to a variety of problems in computational geometry. Implementation, limitations and wider issues are discussed.
A retrospective on database application development frameworks
Authors: Lawrence A. Rowe
Venue: ACM SIGMOD Record (1992)

Four application framework models developed by the author for database application development systems are described. The key feature of these systems is to provide a model for the definition of high level objects that represent interface abstraction that can be used to build an application. Structuring application code around interface objects reduces the conceptual distance between the executing program and its specification. At the same time, good programming practices must be supported (e.g., code modularity, reusable components, and information hiding).
3-D Shape Recovery Using Distributed Aspect Matching
Authors: Sven J. Dickinson, Alex P. Pentland, Azriel Rosenfeld
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

An approach to the recovery of 3-D volumetric primitives from a single 2-D image is presented. The approach first takes a set of 3-D volumetric modeling primitives and generates a hierarchical aspect representation based on the projected surfaces of the primitives; conditional probabilities capture the ambiguity of mappings between levels of the hierarchy. From a region segmentation of the input image, the authors present a formulation of the recovery problem based on the grouping of the regions into aspects. No domain-independent heuristics are used; only the probabilities inherent in the aspect hierarchy are exploited. Once the aspects are recovered, the aspect hierarchy is used to infer a set of volumetric primitives and their connectivity. As a front end to an object recognition system, the approach provides the indexing power of complex 3-D object-centered primitives while exploiting the convenience of 2-D viewer-centered aspect matching; aspects are used to represent a finite vocabulary of 3-D parts from which objects can be constructed.
Good pedagogical random number generators
Authors: J. S. Warford
Venue: Proceedings of the twenty-third SIGCSE technical symposium on Computer science education (1992)

A CACM by Park and Miller [6] advocated a standard for random number generators based on the Lehmer generator [5] and criticised a number of computer science textbooks for presenting bad random number generators. This paper advocates the proposed standard and presents a set of generators based on theoretically sound principles that are also useful for microcomputer implementation and classroom presentations at the introductory level.
A course in computer law
Authors: D. G. Kay
Venue: Proceedings of the twenty-third SIGCSE technical symposium on Computer science education (1992)

We describe a course for computer science students that covers the legal issues that apply to computing, from intellectual property protection to liability for system failures to computer crime.
Retrieval activities in a database consisting of heterogeneous collections of structured text
Authors: Forbes J. Burkowski
Venue: Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval (1992)

The first part of this paper briefly describes a mathematical framework (called the containment model) that provides the operations and data structures for a text dominated database with a hierarchical structure. The database is considered to be a hierarchical collection of continuous extents each extent being a word, word phrase, text element or non-text element. The filter operations making up a search command are expressed in terms of containment criteria that specify whether a contiguous extent will be selected or rejected during a search. This formalism, comprised of the mathematical framework and its associated language, defines a conceptual layer upon which we can construct a well-defined higher level layer, specifically the user interface that serves to provide a level of functionality that is closer to the needs of the user and the application domain. With the conceptual layer established, we go on to describe the design and implementation of a versatile interface which handles queries that search and navigate a heterogeneous collection of structured documents. Interface functionality is provided by a set of &ldquo;worker&rdquo; modules supported by an &ldquo;environment&rdquo; that is the same for all interfaces. The interface environment allows a worker to communicate with the underlying text retrieval engine using a well-defined command protocol that is based on a small set of filter operators. The overall design emphasizes: a) interface flexibility for a variety of search and browsing capabilities, b) the modular independence of the interface with respect to its underlying retrieval engine, and c) the advantages to be accrued by defining retrieval commands using operators that are part of a text algebra that provides a sound theoretical foundation for the database.
An extended type generalization of standard ML polymorphism (abstract)
Authors: R. Ghosh-Roy
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

It has been long argued that the well known Milner type inference system implemented in the programming language Standard ML is inadequate [cop80]. The arguments were presented on the basis of intersection-type inference systems [bar85]. However no algorithm has been developed and the intersection-type inference systems have been proved undecidable. The paper presents a new type inference system using conjunction-types which extends the notion of intersection-types. The algorithm presented in the author's previous paper [gho89] is easily adoptable into the Standard ML. Unlike the intersection-type inference systems, the conjunction-type inference system is: decidable semantically sound for all types semantically sound and complete for basic types.
Dynamic three-dimensional linear programming
Authors: David Eppstein
Venue: Proceedings of the 32nd annual symposium on Foundations of computer science (1991)

Linear programming optimizations on the intersection of k polyhedra in R/sup 3/, represented by their outer recursive decompositions, are performed in expected time O(k log k log n+ square root k log k log/sup 3/ n). This result is used to derive efficient algorithms for dynamic linear programming problems ill which constraints are inserted and deleted, and queries must optimize specified objective functions. As an application, an improved solution to the planar 2-center problem, is described.
The CMU air travel information service: understanding spontaneous speech
Authors: Wayne Ward
Venue: Proceedings of the workshop on Speech and Natural Language (1990)

Understanding spontaneous speech presents several problems not found in processing read speech input. Spontaneous speech is often not fluent. It contains stutters, filled pauses, restarts, repeats, interjections, etc. Casual users do not know the lexicon and grammar used by the system. It is therefore very difficult for a speech understanding system to achieve good coverage of the lexicon and grammar that subjects might use.
On the worst case of three algorithms for computing the Jacobi symbol
Authors: Jeffrey Shallit
Venue: Journal of Symbolic Computation (1990)

We study the worst-case behavior of three iterative algorithms for computing the Jacobi symbol (vu). Each algorithm is similar in format to the Euclidean algorithm for computing gcd(u, v). Eisenstein's algorithm chooses an even quotient at each step. It is shown that the worst case occurs when u = 2n + 1, v = 2n - 1. Lebesgue's algorithm is essentially the least-remainder Euclidean algorithm with powers of 2 removed at each step. Its worst case occurs when u = 2L"n - L"n" "-" "1, v = L"n, where L"0 = 1, L"1 = 1, and L"n = 2L"n" "-" "1 + L"n" "-" "2 for n >= 2. The ''ordinary'' Jacobi symbol algorithm is essentially the ordinary Euclidean algorithm with powers of 2 removed at each step. It is the most interesting mathematically of the three. We prove that if the ordinary algorithm on input (u, v) performs n division steps, with u>v>0 and u + v as small as possible, then u = A"n and v = A"n" "-" "1, where A"0 = 1, A"1 = 3, A"2"n = A"2"n" "-" "1 + 2A"2"n" "-" "2 for n >= 1, and A"2"n"+"1 = 2A"2"n + A"2"n" "-" "1 for n >= 1. We also discuss the worst-case inputs to the ordinary algorithm under the lexicographic and reverse lexicographic orderings.
On the Complexity of Generating Optimal Test Sequences
Authors: Sylvia C. Boyd, Hasan Ural
Venue: IEEE Transactions on Software Engineering (1991)

The authors investigate whether maximal overlapping of protocol test subsequences can be achieved in polynomial time. They review the concepts related to FSM (finite state machine)-based test sequence generation and then define the optimal test sequence generation (OTSG) problem. It is proved that the OTSG problem is NP-complete. Therefore an efficient solution to the problem should not be expected in the general case.
Functional completeness in object-oriented databases
Authors: Priti Mishra, Margaret Eich
Venue: ACM SIGMOD Record (1992)

A definition of completeness in the context of Object Oriented Databases (OODBs) is proposed in this paper. It takes into account the existence of various categories of functions in OODBs, each of which must be complete in itself. The functionality of an OODB can be divided into sets of related functions. For example, functions needed to perform all schema evolution operations or all version management operations belong in two distinct sets. Further, each set of functions must include all functions needed to perform all operations defined for that set. Thus, for an OODB to be functionally complete, it must support a certain number of sets (or categories) of functions and each such set must be complete in itself. The purpose of this paper is not to give a precise definition of the categories of functions but rather to define a framework within which such categories should be examined. This paper contains a working definition of functional completeness. We would welcome any feedback on our proposal.
Least-Squares Estimation of Transformation Parameters Between Two Point Patterns
Authors: Shinji Umeyama
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

In many applications of computer vision, the following problem is encountered. Two point patterns (sets of points) (x/sub i/) and (x/sub i/); i=1, 2, . . ., n are given in m-dimensional space, and the similarity transformation parameters (rotation, translation, and scaling) that give the least mean squared error between these point patterns are needed. Recently, K.S. Arun et al. (1987) and B.K.P. Horn et al. (1987) presented a solution of this problem. Their solution, however, sometimes fails to give a correct rotation matrix and gives a reflection instead when the data is severely corrupted. The proposed theorem is a strict solution of the problem, and it always gives the correct transformation parameters even when the data is corrupted.
Standard bases for general coefficient rings and a new constructive proof of Hilbert's basis theorem
Authors: Carl Jacobsson, Clas Löfwall
Venue: Journal of Symbolic Computation (1991)

A constructive proof is given of the termination of the algorithm for computing standard bases in polynomial rings over a ''constructively noetherian'' ring. A new constructive version of the noetherian chain condition is introduced and Hilbert's basis theorem is proved with this new condition and the construction of standard bases.
An analysis of dynamic page placement on a NUMA multiprocessor
Authors: Richard P. LaRowe,  Jr., Mark A. Holliday, Carla Schlatter Ellis
Venue: Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems (1992)

The class of NUMA (nonuniform memory access time) shared memory architectures is becoming increasingly important with the desire for larger scale multiprocessors. In such machines, the placement and movement of code and data are crucial to performance. The operating system can play a role in managing placement through the policies and mechanisms of the virtual memory subsystem. In this paper, we develop an analytic model of memory system performance of a Local/Remote NUMA architecture based on approximate mean-value analysis techniques. The model assumes that a simple workload model based on a few parameters can often provide insight into the general behavior of real applications. The model is validated against experimental data obtained with the DUnX operating system kernel for the BBN GP1000 while running a synthetic workload. The results of this validation show that in general, model predictions are quite good, though in some cases the model fails to include the effect of unexpected behaviors in the implementation. Experiments investigate the effectiveness of dynamic multiple-copy page placement. We investigate the cost of incorrect policy decisions by introducing different percentages of policy error and measuring their effect on performance.
An algorithm for determining talker location using a linear microphone array and optimal hyperbolic fit
Authors: Harvey F. Silverman
Venue: Proceedings of the workshop on Speech and Natural Language (1990)

One of the problems for all speech input is the necessity for the talker to be encumbered by a head-mounted, hand-held, or fixed position microphone. An intelligent, electronically-aimed unidirectional microphone would overcome this problem. Array techniques hold the best promise to bring such a system to practicality. The development of a robust algorithm to determine the location of a talker is a fundamental issue for a microphone-array system. Here, a two-step talker-location algorithm is introduced. Step 1 is a rather conventional filtered cross-correlation method; the cross-correlation between some pair of microphones is determined to high accuracy using a some-what novel, fast interpolation on the sampled data. Then, using the fact that the delays for a point source should fit a hyperbola, a best hyperbolic fit is obtained using nonlinear optimization. A method which fits the hyperbola directly to peak-picked delays is shown to be far less robust than an algorithm which fits the hyperbola in the cross-correlation space. An efficient, global nonlinear optimization technique, Stochastic region Contraction (SRC) is shown to yield highly accurate ( gt;90%), and computationally efficient, results for a normal ambient.
The Knuth-Bendix procedure for strings as a substitute for coset enumeration
Authors: Charles C. Sims
Venue: Journal of Symbolic Computation (1991)

This note describes two examples in which the Knuth-Bendix procedure for strings is more useful than coset enumeration for studying a finitely presented group.
Global wiring on a wire routing machine
Authors: Ravi Nair, Se June Hong, Sandy Liles, Ray Villani
Venue: Proceedings of the 19th Design Automation Conference (1982)

A new global wiring algorithm designed for implementation on special purpose physical design machines is described. This algorithm computes more accurate estimates of wiring channel demand and supply than other known algorithms. It also makes better use of this information in determining wire routes. By exploiting the parallel processing capability of an interconnected array of microcomputers, the global wiring is completed effectively and quickly even for large chips.