ppxscal/embedding_network huggingface dataset:
Methodology for allocating resources for data quality enhancement
Authors: Donald P. Ballou, Giri Kumar. Tayi
Venue: Communications of the ACM (1989)

The issue of effective use of resources committed to data integrity maintenance is addressed via a heuristic which uses parameter estimates that are iteratively refined to partition available resources among multiple data sets.
An Approach to Implementing Multiplication with Small Tables
Authors: H. Ling
Venue: IEEE Transactions on Computers (1990)

Table look-up is an attractive approach to implementing multiplication; however, the size of the requisite multiplication table is prohibitively large for wide operands. A novel transformation which reduces the number of table entries from 2/sup 2b/ to 2/sup b/, where b is the width of the operands, is presented. Two implementation schemes are presented.
EXPRESS: an experimental interface for factual information retrieval
Authors: G. Zinßmeister
Venue: Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval (1989)

The EXPRESS system has been designed and implemented in order to explore methods for user assistance in accessing complexly structured factual databases, e.g. relational product databases. Terminological support in this area has to take into account that different controlled vocabularies may be used in a variety of attributes spread over several relations. In our approach, traditional thesaurus structures are extended in order to cope with these problems and to encode further domain-specific knowledge. User support in query reformulation is based on this enriched thesaurus as well as on the local evaluation of the retrieved data sets. Concepts for the representation of retrieval strategies in the form of plans and their potential use in future systems are discussed.
Specifications of Twelve Early Computers Made in France
Authors: Pierre-E. Mounier-Kuhn
Venue: IEEE Annals of the History of Computing (1990)

Tables 1 and 2 present the main computers designed and installed in France during the first two "generations." Two IBM machines - the 650 and the 1401 - are included to enable readers to compare the French computers with these two "bestsellers" which marked their time.
A Multiple Fault-Tolerant Processor Network Architecture for Pipeline Computing
Authors: J. Tyszer
Venue: IEEE Transactions on Computers (1988)

Certain fault-tolerant multiprocessor networks that can emulate linear array interconnections are considered. The system is fault tolerant of (m-1) node and link failures. One of the particularly attractive features of this network is that it allows for a linear array structure starting with any node even in spite of (m-2) faults. The configuration algorithm is fully distributed, and is performed on the basis of test results obtained from nonfaulty processors only. A simple fault identification procedure is developed using the above routing algorithm.
Quicksort Revisited
Authors: C. M. Davidson
Venue: IEEE Transactions on Software Engineering (1988)

H.D. Mills and R.C. Linger (1986) propose adding the datatype set to existing programming languages. During some investigations using sets, it became apparent that Quicksort can be written without using stacks (or recursion). Using sets can lead to efficient multiprocessor usage, because if the elements of a set can be processed in any order, they can frequently be processed simultaneously. An example of the possibilities is an intelligent disk control unit based on External Quicksort, using four processors and four read/write heads., The control unit can sort a large disk file in about 1/3 of the time taken by the one-processor version.
Computing Minimal Distances on Polyhedral Surfaces
Authors: E. Wolfson, E. L. Schwartz
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

The authors implement an algorithm that finds minimal (geodesic) distances on a three-dimensional polyhedral surface. The algorithm is intrinsically parallel, in as much as it deals with all nodes simultaneously, and is simple to implement. Although exponential in complexity, it can be used with a companion gradient-descent surface-flattening algorithm that produces an optimal flattening of a polyhedral surface. Together, these two algorithms have made it possible to obtain accurate flattening of biological surfaces consisting of several thousand triangular faces (monkey visual cortex) by providing a characterization of the distance geometry of these surfaces. The authors propose this approach as a pragmatic solution to characterizing the surface geometry of the complex polyhedral surfaces which are encountered in the cortex of vertebrates.
Software development: advice by analogy
Authors: P. Salenieks
Venue: ACM SIGSOFT Software Engineering Notes (1989)

This paper draws an analogy between software development and mountaineering, suggesting how exponents of the former can learn from the experiences of the latter. The advice given is illustrated by triumphs and tragedies described in the mountaineering and computing literature.
An extension of Buchberger's algorithm and calculationsin enveloping fields of lie algebras
Authors: J. Apel, W. Lassner
Venue: Journal of Symbolic Computation (1988)

The powerful concept of Grobner bases and an extension of the Buchberger algorithm for their computation have been generalised to enveloping algebras of Lie algebras. Algorithms for the computation of syzygies by use of Grobner bases are given. This is the first method which allows the transformation of right fractions into left fractions in the Lie field of any finite dimensional Lie algebra. That enables CAS calculations in Lie fields. An AMP program LIEFIELD has been written for this purpose. Another AMP program SYZYGY produces a generating set of the syzygy module of any finite subset of an enveloping algebra. Examples for both programs are presented for the Weyl algebra and the so(3).
Justified advice: a semi-naturalistic study of advisory strategies
Authors: W. C. Hill, J. R. Miller
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1988)

&ldquo;Wizard of Oz&rdquo; techniques were used to observe the interaction between users of a statistical package and a human playing the role of an simulated intelligent advisory system. The results emphasized the complexities of the advisory process. More than half of the clients' requests sought help on planning actions toward achieving task goals. Further, protocols collected from the advisor while advice was given revealed the importance of constructing models of the user's current and past interaction with the application, and of addressing the high-level goals that underlie clients' explicit questions. The relevance of these findings to the development of intelligent advisory systems is discussed.
Experience with concurrent simulation
Authors: D. W. Jones, C.-C. Chou, D. Renk, S. C. Bruell
Venue: Proceedings of the 21st conference on Winter simulation (1989)

We have successfully implemented a concurrent simulator and we report initial speedup measurements for this technique. Our algorithm requires a shared-memory multiprocessor and is appropriate to any discrete-event simulation model. In addition, our algorithm places no constraints on minimum service times or the presence of cycles in the simulation model. Our experimental simulator runs on an Encore Multimax computer and is applicable to closed product-form queueing networks. We have observed speedups of 2.3 for a central-server queueing model using our simulator.
Simulation sensitivity analysis using frequency domain experiments
Authors: D. J. Morrice, L. W. Schruben
Venue: Proceedings of the 21st conference on Winter simulation (1989)

In this paper we review frequency domain experiments (FDE) for simulation sensitivity analysis and contrast it with conventional methodology. With very few runs of the model (often one or two runs is sufficient), FDE can be used to gain information on which factors significantly influence the performance of the simulated system. Two examples are given which illustrate some of the fundamental differences between frequency domain and conventional run-oriented analysis.
Non-commutative Gröbner bases in algebras of solvable type
Authors: A. Kandri-Rody, V. Weispfenning
Venue: Journal of Symbolic Computation (1990)

We introduce a class of non-commutative polynomial rings over fields intermediate betweencommutative polynomial rings and general non-commutative polynomial rings. This class of solvable polynomial rings includes many rings arising naturally in mathematics and physics, such as iterated Ore extensions of fields and enveloping algebras of finite dimensional Lie algebras. We present algorithms that compute Grobner bases of one- and two-sided ideals in solvable polynomial rings. They extend Buchberger's algorithm (see Buchberger, 1985) in the commutative case and Apel and Lassner's algorithms (see Apel & Lassner, 1988) for one-sided ideals in enveloping algebras of Lie algebras, as well as the results on one-sided standard bases in Weyl algebras, sketched in Galligo (1985). We show that reduced one- and two-sided Grobner bases in solvable polynomial rings are unique, and we solve the word problem and the ideal membership problem for algebras of solvable type, in particular in Clifford algebras. Further applications include the computation of elimination ideals, computing in residue modules and the computation of generators for modules of syzygies.
A technology-adaptive allocation of functional units and connections
Authors: N.-S. Woo, H. Shin
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

A new algorithm of allocating functional units and connections in the data path synthesis has been developed. The algorithm determines the types and numbers of both functional units and connections simultaneously based on their cost (i.e., area) obtained from the input technology data. The algorithm performs trade-off between the functional units and connections to produce data paths with minimal cost. The algorithm is adaptive to different technologies: if the cost of a functional unit changes or if a new functional unit becomes available, the algorithm produces a new data path optimized in the new environment. The algorithm has O(n3) timing complexity in the worst case, where n is the number of operations in the input problem. Experiments show that costs of data paths constructed by our algorithm are smaller than or as much as those by other published approaches.
Redundant and On-Line CORDIC: Application to Matrix Triangularization and SVD
Authors: M. D. Ercegovac, Tomas Lang
Venue: IEEE Transactions on Computers (1990)

Several modifications to the CORDIC method of computing angles and performing rotations are presented: (1) the use of redundant (carry-free) addition instead of a conventional (carry-propagate) one; (2) a representation of angles in a decomposed form to reduce area and communication bandwidth; (3) the use of on-line addition (left-to-right, digit-serial addition) to replace shifters by delays; and (4) the use of online multiplication, square root, and division to compute scaling factors and perform the scaling operations. The modifications improve the speed and the area of CORDIC implementations. The proposed scheme uses efficiently floating-point representations. The application of the modified CORDIC method to matrix triangularization by Givens' rotations and to the computation of the singular value decomposition (SVD) are discussed.
Retrieval based on user behaviour
Authors: A. J. Kok, A. M. Botman
Venue: Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval (1988)

This paper gives an overview of the ongoing research in the Active Data Bases project at the Vrije Universiteit, Amsterdam. In this project we are specifying and building a system that helps a user in his search for useful and interesting information in large, complex information systems. The system is able to do this, because it learns from the interaction about the users and the data it contains. The indications of the users are expressed in terms of interests in the data, which serve as building blocks for user and data models. These models are then used to improve the search for interesting data.
The programming system PRIZ
Authors: G. Mints, E. Tyugu
Venue: Journal of Symbolic Computation (1988)

The programming system PRIZ combines conventional programming technique with automatic synthesis of programs from specifications. It enables one to build specifications from descriptions of application domains. They are automatically encoded into propositional calculus and used by the system for the program synthesis. PRIZ is not bound to any particular problem domain, but applicable for synthesis of programs solving problems of a wide class called computational problems. From the theoretical side it has the deductive power of the intuitionistic propositional calculus.
Trellis: turning designs into programs
Authors: Michael Kilian
Venue: Communications of the ACM (1990)

When designing an object-oriented program, there are several goals to achieve: The program should accurately model the real-world objects to be represented. This leads to a program that is easier to understand and therefore simpler to maintain. Code that implements the model accurately must also be robust. Inconsistent models should be detected at design time, not diagnosed as a run-time error at a customer's installation. The programming environment must allow for convenient exploration of the application; it should foster a reuse of existing types of objects, thus reducing the scale of the design. It should also facilitate changes to the program as the application design is updated. The Trellis programming system is an integrated language and environment that provides many of the mechanisms needed to design and implement object-oriented programs. The remainder of this sidebar discusses how Trellis helps attain the goals outlined above.
Acoustic wavefield propagation using paraxial extrapolators
Authors: R. W. Clayton, R. W. Graves
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2 (1989)

Modeling by paraxial extrapolators is applicable to wave propagation problems in which most of the energy is traveling within a restricted angular cone about a principle axis of the problem. Frequency domain finite-difference solutions are readily generated by using this technique. Input models can be described either by specifying velocities or appropriate media parameters on a two or three dimensional grid of points. For heterogeneous models, transmission and reflection coefficients are determined at structural boundaries within the media. The direct forward scattered waves are modeled with a single pass of the extrapolator operator in the paraxial direction for each frequency. The first-order back scattered energy can then be modeled by extrapolation (in the opposite direction) of the reflected field determined on the first pass. Higher order scattering can be included by sweeping through the model with more passes. The chief advantages of the paraxial approach are 1) active storage is reduced by one dimension as compared to solutions which must track both up-going and down-going waves simultaneously, thus even realistic three dimensional problems can fit on today's computers, 2) the decomposition in frequency allows the technique to be implemented on highly parallel machines such the hypercube, 3) attenuation can be modeled as an arbitrary function of frequency, and 4) only a small number of frequencies are needed to produce movie-like time slices. By using this method a wide range of seismological problems can be addressed, including strong motion analysis of waves in three-dimensional basins, the modeling of VSP reflection data, and the analysis of whole earth problems such as scattering at the core-mantle boundary or the effect of tectonic boundaries on long-period wave propagation.
Gray Codes for Partial Match and Range Queries
Authors: C. Faloutsos
Venue: IEEE Transactions on Software Engineering (1988)

It is suggested that Gray codes be used to improve the performance of methods for partial match and range queries. Specifically, the author illustrates the improved clustering of similar records that Gray codes can achieve with multiattribute hashing. Gray codes are used instead of binary codes to map record signatures to buckets. In Gray codes, successive codewords differ in the value of exactly one bit position; thus, successive buckets hold records with similar record signatures. The proposed method achieves better clustering of similar records, thus reducing the I/O time. A mathematical model is developed to derive formulas giving the average performance of both methods, and it is shown that the proposed method achieves 0-50% relative savings over the binary codes. The author also discusses how Gray codes could be applied to some retrieval methods designed for range queries, such as the grid file and the approach based on the so-called z-ordering. Gray codes are also used to design good distance-preserving functions, which map a k-dimensional (k-D) space into a one-dimensional one, in such a way that points are close in the k-D space are likely to be close in the 1-D space.
The internet worm program: an analysis
Authors: Eugene H. Spafford
Venue: ACM SIGCOMM Computer Communication Review (1989)

On the evening of 2 November 1988, someone infected the Internet with a worm program. That program exploited flaws in utility programs in systems based on BSD-derived versions of UNIX. The flaws allowed the program to break into those machines and copy itself, thus infecting those systems. This program eventually spread to thousands of machines, and disrupted normal activities and Internet connectivity for many days.This report gives a detailed description of the components of the worm program---data and functions. It is based on study of two completely independent reverse-compilations of the worm and a version disassembled to VAX assembly language. Almost no source code is given in the paper because of current concerns about the state of the "immune system" of Internet hosts, but the description should be detailed enough to allow the reader to understand the behavior of the program.The paper contains a review of the security flaws exploited by the worm program, and gives some recommendations on how to eliminate or mitigate their future use. The report also includes an analysis of the coding style and methods used by the author(s) of the worm, and draws some conclusions about his abilities and intent.
K9: a simulator of distributed-memory parallel processors
Authors: P. Beadle, C. Pommerell, M. Annaratone
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

K9 is a software package for the simulation and performance evaluation of distributed-memory parallel processors (DMPPs). It is written in C++ and runs on Sequent Symmetry and SUN-3. K9 provides the user with four building-blocks (processor cells, communication channels, multi-port shared-memories, and I/O processors), and one abstraction mechanism (the DMPP interconnection topology). Application code for K9 can be written in C++ or C. When timing analysis is turned on, the simulation runs between 10 and 20 times slower than if comparable code were executed by the host. When timing analysis is turned off, the simulation proceeds as fast as comparable code running on the host. K9's fast execution allows the simulation of large application programs. Finally, a graphical interface visualizes&mdash;with animation&mdash;different parameters of the DMPP architecture (hot spots phenomena, load-balancing problems, and so on).
A simplified graphic notation for Ada programs
Authors: D. Sterne, G. Pretti, A. Glendening, B. Jachowski
Venue: Proceedings of the conference on TRI-Ada '88 (1989)

A number of graphic notations for describing Ada programs have been proposed. In general, these are not supported by off-the-shelf tools; they are perceived by nonexperts as incomprehensible; they obscure simple design deficiencies; and they cannot adequately represent design overviews. To address these problems, a simplified graphic notation has been developed and used in a large Ada application at GTE Government Systems Corporation, in Rockville, Maryland. The notation consists of three interrelated diagrams based on extensions of structure chart concepts.
On the path length of binary trees
Authors: Rolf Klein, Derick Wood
Venue: Journal of the ACM (JACM) (1989)

It is shown that the external path length of a binary tree is closely related to the ratios of means of certain integers and establish the upper bound ExternalPathLength&le;N log2N+D -log2D -0.6623, where N denotes the number of external nodes in the tree and D is the difference in length between a longest and shortest path. Then it is proved that this bound is tight up to an ON term if D&le;N . If D>N , we contstruct binary trees whose external path length is at least as large as Nlog2 N+fN,D D-log2 D-4 , where fN,D=1/ 1+2D/N .
Design environments for constructive and argumentative design
Authors: G. Fischer, R. McCall, A. Morch
Venue: ACM SIGCHI Bulletin (1989)

Design Environments are computer systems which support design by enabling cooperative problem solving between designer and computer. There are two complementary problem solving activities in design: constructive design and argumentative design. We have created two computer-supported environments, CRACK and VIEWPOINTS, to support these two activities.CRACK is a knowledge-based critic which has knowledge about how kitchen appliances can be assembled into functional kitchens. VIEWPOINTS is a hypertext system based on the IBIS design methodology and contains useful information about the principles of kitchen design. The integration of these two types of systems will eliminate shortcomings of the individual systems.
The Organization of Permutation Architectures with Bused Interconnections
Authors: Joe Kilian, Shlomo Kipnis, Charles E. Leiserson
Venue: IEEE Transactions on Computers (1990)

The problem of efficiently permuting data stored in VLSI chips in accordance with a predetermined set of permutations is explored. By connecting chips with shared bus interconnections, as opposed to point-to-point interconnections, it is shown that the number of pins per chip can often be reduced. As an example, for infinitely many n, the authors exhibit permutation architectures that can realize any of the n cyclic shifts on n chips in one clock tick, where the upper limit on the number of pins per chip is the greatest integer >or= square root n. When the set of permutations forms a group with p elements, any permutation in the group can be realized in one clock tick by an architecture with O( square root plg p) pins per chip. When the permutation group is abelian, O( square root p) pins suffice. These results are all derived from a mathematical characterization of uniform permutation architectures based on the combinatorial notion of a difference cover. The authors also consider uniform permutation architectures that realize permutations in several clock ticks instead of one, and show that further savings in the number of pins per chip can be obtained.
Some results concerning clock-regulated queues
Authors: Ora E. Percus
Venue: ACM SIGARCH Computer Architecture News (1988)

A single clock-regulated queue is fed by two Bernouilli streams of messages. We present the distributions of queue length, of waiting time, and of output for such a system. This is generalized as well to the case of a queue of finite capacity.