ppxscal/embedding_network huggingface dataset:
Project GROPEHaptic displays for scientific visualization
Authors: Frederick P. Brooks,  Jr., Ming Ouh-Young, James J. Batter, P. Jerome Kilpatrick
Venue: Proceedings of the 17th annual conference on Computer graphics and interactive techniques (1990)

We began in 1967 a project to develop a haptic+display for 6-D force fields of interacting protein molecules. We approached it in four stages: a 2-D system, a 3-D system tested with a simple task, a 6-D system tested with a simple task, and a full 6-D molecular docking system, our initial goal. This paper summarizes the entire project---the four systems, the evaluation experiments, the results, and our observations. The molecular docking system results are new.Our principal conclusions are: bull; Haptic display as an augmentation to visual display can improve perception and understanding both of force fields and of world models populated with impenetrable objects. bull; Whereas man-machine systems can outperform computer-only systems by orders of magnitude on some problems, haptic-augmented interactive systems seem to give about a two-fold performance improvement over purely graphical interactive systems. Better technology may give somewhat more, but a ten-fold improvement does not seem to be in the cards. bull; Chemists using GROPE-III can readily reproduce the true docking positions for drugs whose docking is known (but not to them) and can find very good docks for drugs whose true docks are unknown. The present tool promises to yield new chemistry research results; it is being actively used by research chemists. bull; The most valuable result from using GROPE-III for drug docking is probably the radically improved situation awareness that serious users report. Chemists say they have a new understanding of the details of the receptor site and its force fields, and of why a particular drug docks well or poorly. bull; We see various scientific/education applications for haptic displays but believe entertainment, not scientific visualization, will drive and pace the technology. bull; The hardware-software system technology we have used is barely adequate, and our experience sets priorities for future development. bull; Some unexpected perceptual phenomena were observed. All of these worked for us, not against us.
A proof of Holt's algorithm
Authors: Gregory Butler
Venue: Journal of Symbolic Computation (1988)

Holt's algorithm obtains a p-step central series and a power commutator presentation for a p-group given by permutations that initially form a subnormal series, The permutations also contain a strong generating set for each group in the serics. A proof of the algorithm, based on assertions, is presented.
Parallelism and concurrency control performance in distributed database machines
Authors: Michael J. Carey, Miron Livny
Venue: ACM SIGMOD Record (1989)

While several distributed (or 'shared nothing') database machines exist in the form of prototypes or commercial products, and a number of distributed concurrency control algorithms are available, the effect of parallelism on concurrency control performance has received little attention. This paper examines the interplay between parallelism and transaction performance in a distributed database machine context. Four alternative concurrency control algorithms are considered, including two-phase locking, wound-wait, basic timestamp ordering, and optimistic concurrency control. Issues addressed include how performance scales as a function of machine size and the degree to which partitioning the database for intra-transaction parallelism improves performance for the different algorithms. We examine performance from several perspectives, including response time, throughput, and speedup, and we do so over a fairly wide range of system loads. We also examine the performance impact of certain important overhead factors (e.g., communication and process initiation costs) on the four alternative concurrency control algorithms.
Parallel discrete-event simulation of FCFS stochastic queueing networks
Authors: David M. Nicol
Venue: Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems (1988)

Physical systems are inherently parallel; intuition suggests that simulations of these systems may be amenable to parallel execution. The parallel execution of a discrete-event simulation requires careful synchronization of processes in order to ensure the execution's correctness; this synchronization can degrade performance. Largely negative results were recently reported in a study which used a well-known synchronization method on queueing network simulations. In this paper we discuss a synchronization method, appointments, which has proven itself to be effective on simulations of FCFS queueing networks. The key concept behind appointments is the provision of lookahead. Lookahead is a prediction on a processor's future behavior, based on an analysis of the processor's simulation state. We show how lookahead can be computed for FCFS queueing network simulations, give performance data that demonstrates the method's effectiveness under moderate to heavy loads, and discuss performance trade-offs between the quality of lookahead, and the cost of computing lookahead.
Computerized writing tools for the 80's and 90's
Authors: R. Hanson
Venue: ACM SIGSMALL/PC Notes (1989)

The traditional setting for a person composing a paper is be seated in front of an aging typewriter surrounded by handwritten notes, empty coffee cups and crumpled typewriter pages. Today, at least for those with a sufficiently large computer budget, the typewriter has been replaced with a computer running a word processor. While word processors were a major step forward, they did not address all the steps of a writing effort. Producing a paper or book usually involves the following four steps:[TABLE]
MIES: a microarchitecture design tool
Authors: J. A. Nestor, B. Soudan, Z. Mayet
Venue: Proceedings of the 22nd annual workshop on Microprogramming and microarchitecture (1989)

This paper describes MIES, a design tool for the modeling, visualization, and analysis of VLSI microarchitectures. MIES combines a graphical data path model and symbolic control model and provides a number of user interfaces which allow these models to be created, simulated, and evaluated.
A Theorem Prover for Verifying Iterative Programs Over Integers
Authors: D. Sarkar, S. C. De Sarkar
Venue: IEEE Transactions on Software Engineering (1989)

An implementation of a rule-based theorem prover for verifying iterative programs over integers is presented. The authors emphasize the overall proof construction strategy of the prover which has been able to construct the correctness proofs of all iterative programs taken from the literature. Two performance measures for the prover are proposed, and its proof construction for an array-sorting program is evaluated using these measuress.
Computer Science at the CNRS and in French Universities: A Gradual Institutional Recognition
Authors: Georges-Louis Baron, Pierre-E. Mounier-Kuhn
Venue: IEEE Annals of the History of Computing (1990)

This article describes a case of institutional innovation - the development of a new activity among established scientific disciplines. The official recognition of computer science in the French research and educational organizations met many obstacles, at least until the mid-1970s, although research and teaching had been carried on in this field for 20 years. In the CNRS, informatics emerged as a sub-discipline of applied mathematics and fluid mechanics, then of mathematics, before a specific assessment committee was created in 1976 for computer sciences and automation. In the university system, a subcommittee was established in 1972 and became a full committee in 1982; at that time, computer activities had already penetrated the secondary schools.
An O(KN lg N) algorithm for optimum K-level quantization on histograms of N points
Authors: X. Wu, J. Rokne
Venue: Proceedings of the 17th conference on ACM Annual Computer Science Conference (1989)

Optimum quantization is a fundamental problem in digital signal processing and information theory. In 1964 Bruce [1] devised a polynomial-time algorithm to solve this particular non-linear programming problem using the dynamic programming technique. For the mean-square error measure and when the amplitude density function of the quantized signal is represented by a histogram of N points, Bruce's algorithm can generate the optimum K-level quantizer in O(KN2) time. This paper proposes an efficient algorithm which can do the same job with the worst-case time complexity of O(KN lg N). This is due to the discovery of some useful properties of optimum meansquare quantizers and an innovative algorithm structure combining the two algorithmic techniques, dynamic programming and divide-and-conquer. This algorithm structure contributes a new effective methodology to the design of efficient algorithms. Finally the paper outlines a more sophisticated algorithm which can reduce both the time and space complexity of the O(KN lg N) algorithm derived in the paper.
Univariate power series expansions in REDUCE
Authors: J. Padget, A. Barnes
Venue: Proceedings of the international symposium on Symbolic and algebraic computation (1990)

We describe the development of a formal power series expansion package for Reduce which takes advantage of Reduce's domain mechanism to make for a seamless integration of series values with the rest of the Reduce system. Consequently, series values may be manipulated with the same algebraic operators as other algebraic objects. To create the illusion of infinite power series a simulated lazy-evaluation mechanism has been used. This paper reports our experience of using the Reduce domain mechanism and documents the algorithms and data structures that can be used to implement and to represent power series.
A realistic evaluation of consistency algorithms for replicated files
Authors: Jehan-Francois Paris, Darrell D. E. Long, Alexander Glockner
Venue: Proceedings of the 21st annual symposium on Simulation (1988)

Data are often replicated in distributed systems to protect them against site failures and network malfunctions. When this is the case, an access policy must be chosen to insure that a consistent view of the data is always presented. Voting protocols guarantee consistency of replicated data in the presence of any scenario involving non-Byzantine site failures and network partitions. While Static Majority Consensus Voting protocols use static quorums, Dynamic Voting protocols, like Dynamic Voting and Lexicographic Dynamic Voting, dynamically adjust quorums to changes in the status of the network of sites holding the copies. The availabilities of replicated data managed by these three protocols are compared using a simulation model with realistic parameters. Dynamic Voting is found to perform better than Majority Consensus Voting for all files having more than three copies while Lexicographic Dynamic Voting performs much better than the two other protocols for all eleven configurations under study.
VideoDraw: a video interface for collaborative drawing
Authors: John C. Tang, Scott L. Minneman
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: Empowering people (1990)

This paper describes VideoDraw, a shared drawing tool, and the process by which it is being designed and developed. VideoDraw is a prototype, videobased, tool that provides a shared &ldquo;virtual sketchbook&rdquo; among two or more collaborators. It not only allows the collaborators to see each others' drawings, but also conveys the accompanying hand gestures and the process of creating and using those drawings. Its design stems from studying how people collaborate using shared drawing spaces. Design implications raised by those studies were embodied in a prototype, which was in turn observed in use situations. Continued research studying the use of VideoDraw (in comparison with other collaborative media) will lead to a better understanding of collaborative drawing activity and inform the continued technical development of VideoDraw.
Capturing the capture concepts: a case study in the design of computer-supported meeting environments
Authors: Marilyn Mantei
Venue: Proceedings of the 1988 ACM conference on Computer-supported cooperative work (1988)

Designing interactive interfaces for individual usage is a significantly hard task that is being surmounted by evolving theory and hours of trial and error. The task of designing interactive interfaces for cooperative work is even more difficult. Not only is it necessary to deal with the individual's cognitive processes and model of the computer aided task, but also to build software to support human - human communication with all the underlying socialization and group dynamics that this communication implies. In the development of the Capture Lab environment, guesswork was coupled with a study of human behavior in meetings both electronic and conventional, an extrapolation of existing research and a series of mini-experiments to test out various ideas about the design. These approaches are described in the body of the paper along with the design considerations at issue and the meeting behaviors we have since observed as a result of our design choices.
Verified data transfer protocols with variable flow control
Authors: A. Udaya Shankar
Venue: ACM Transactions on Computer Systems (TOCS) (1989)

We present and verify a sliding window protocol which uses modulo-N sequence numbers to achieve reliable flow-controlled data transfer between a producer and a consumer connected by unreliable channels. The consumer's data needs are represented by a receive window whose size can vary with time. The producer entity sends segments of data words that lie within the consumer's receive window. The consumer entity sends acknowledgment, selective acknowledgment, and selective reject messages that inform the producer entity of the current receive window size, the data word next expected, and the reception (or lack of reception) of out-of-sequence data segments. Our protocol is, therefore, a proper extension of existing transport and data link protocol standards such as TCP, IS0 TP, HDLC, ADCCP, and so forth. We consider two types of unreliable channels. The first type, referred to as transport channels, can lose, duplicate, and reorder messages to an arbitrary extent, but impose an upper bound on message lifetimes (which can be very large, e.g., days). The second type, referred to as data link channels, can only lose messages. For both types of channels, we obtain the minimum value of N that ensures safe operation without imposing any constraints on the retransmissions of messages or on the data segment sizes. Thus, any retransmission or acknowledgment policy that optimizes the protocol's performance can be used. For transport channels, this value of N is a function of the maximum message transmission rate, the maximum message lifetime, and the maximum receive window size. For data link channels, this value of N is a function only of the maximum receive window size. We verify progress under three different liveness assumptions: retransmissions initiated by both entities, only by the producer entity, and only by the consumer entity. The protocol also satisfies a convenient noninterference safety property between the acknowledgement, selective acknowledgment, and selective reject messages. The protocols are specified as event-driven systems and verified hierarchically in two major stages. First, we verify that correct flow-controlled data transfer results if the sequence numbers in the channels satisfy certain correct interpretation bounds, irrespective of the types of errors that the channels may have. Second, for both transport and data link channels, we verify that the correct interpretation bounds are enforced by the corresponding minimum values of N. For the verification of the transport channel case, we use a system model with continuous measures of time in which real-time constraints can be formally specified and verified.
The Turing programming language
Authors: Richard C. Holt, James R. Cordy
Venue: Communications of the ACM (1988)

Turing, a new general purpose programming language, is designed to have Basic's clean interactive syntax, Pascal's elegance, and C's flexibility.
Identity authentication based on keystroke latencies
Authors: Rick Joyce, Gopal Gupta
Venue: Communications of the ACM (1990)

The variables that help make a handwritten signature a unique human identifier also provide a unique digital signature in the form of a stream of latency periods between keystrokes. This article describes a method of verifying the identity of a user based on such a digital signature, and reports results from trial usage of the system.
Knowledge representation, connectionism and conceptual retrieval
Authors: R. J. Brachman, D. L. McGuinness
Venue: Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval (1988)

Knowledge Representation (KR) systems provide support for Artificial Intelligence systems that reason about relationships between objects in their domains of expertise. Because of their support for inference, KR systems appear to have potential to enrich the kind of retrievals that IR systems might make. Ironically, however, the most useful KR systems are limited to reasoning based on a rigid notion of validity, and thus are awkward to use when relevant but inexact retrievals are desired. We have been exploring the potential of a &ldquo;connectionist&rdquo; model&mdash;the Boltzmann Machine&mdash;to overcome this limitation. We report on a number of experiments in which we use a connectionist simulator to support similarity-based reasoning in a frame representation. We draw some tentative, mixed conclusions on the potential for a union of KR, IR, and connectionism.
Weyl group orbits
Authors: Dennis M. Snow
Venue: ACM Transactions on Mathematical Software (TOMS) (1990)

A new technique is presented for calculating the orbits of the finite Weyl group of a semisimple Lie group G in the weight lattice of G. Such calculations are important in the representation theory of G, and have previously been difficult to carry out for large Weyl groups such as E8. This new technique allows large orbits to be computed using only a small fraction of the computer memory required when using standard techniques. In the case of E8, the memory requirements can be reduced by a factor of 30,000.
HYTREM-A Hybrid Text-Retrieval Machine for Large Databases
Authors: Dik Lun Lee, Frederick H. Lochovsky
Venue: IEEE Transactions on Computers (1990)

The design of a text-retrieval machine, called HYTREM (hybrid text-retrieval machine), for the support of large unformatted text databases is described. A signature file is used as an access method to reduce the amount of data that need to be searched directly. Therefore, HYTREM consists of two major subsystems: a signature processor and a text processor. The signature processor is based on a world-parallel, bit-serial organization which is faster, more efficient, and more flexible than a word-serial, bit-parallel organization proposed by S.R. Ahuja and C.S. Roberts (1980). The text processor, called ALTEP (associative linear text processor), is a linear array of logic cells capable of matching regular expressions at a much higher speed than that of previous designs. Since both the signature processor and ALTEP are highly parallel processors, a high-speed multiple-response resolver is provided to facilitate data transfer between the processors and the controllers over a single common bus. Issues about th design of a cost-effective mass-storage system are also discussed. Performance and implementation issues for HYTREM are discussed.
Area-Time Optimal Adder Design
Authors: Belle W. Wei, Clark D. Thompson
Venue: IEEE Transactions on Computers (1990)

A systematic method of implementing a VLSI parallel adder is presented. A family of adders based on a modular design is defined. The design uses three types of component cells, which are implemented in static CMOS. The adder design is formulated as a dynamic programming problem, optimizing with respect to area and time. The result is an area-time optimal adder in the design family. The approach is illustrated by implementing a 66-bit adder for use in a floating-point processor. It is shown how to use the method for implementations in technologies and design styles other than static CMOS.
The ismorphism conjecture fails relative to a random oracle
Authors: S. A. Kurtz, S. R. Mahaney, J. S. Royer
Venue: Proceedings of the twenty-first annual ACM symposium on Theory of computing (1989)

Berman and Hartmanis [BH77] conjectured that there is a polynomial-time computable isomorphism between any two languages m-complete (&ldquo;Karp&rdquo; complete) for NP. Joseph and Young [JY85] discovered a structurally defined class of NP-complete sets and conjectured that certain of these sets (the Kk&fnof;'s) are not isomorphic to the standard NP-complete sets for some one-way functions &fnof;. These two conjectures cannot both be correct. We introduce a new family of strong one-way functions, the scrambling functions. If &fnof; is a scrambling function, then Kkfnof; is not isomorphic to the standard NP-complete sets, as Joseph and Young conjectured, and the Berman-Hartmanis conjecture fails. As evidence for the existence of scrambling functions, we show that much more powerful one-way functions--the annihilating functions--exist relative to a random oracle.
Symbolic&mdash;numerical computations in the stability analyses of difference schemes
Authors: S. I. Mazurik, E. V. Vorozhtsov
Venue: Proceedings of the international symposium on Symbolic and algebraic computation (1990)

We propose a number of symbolic-numeric approaches to the computer aided construction of the stability domains of difference schemes approximating the partial differential equations with constant coefficients. We use the Fourier method, the algebraic methods of the Routh-Hurwitz and Schur-Cohn theories for the localization of the polynomial zeros, the methods of the optimization theory as well as the means of computer algebra, digital image processing and computer graphics. The efficiency of the approaches is demonstrated at the practical examples of difference schemes for the fluid dynamics problems.
Evaluating Associativity in CPU Caches
Authors: M. D. Hill, A. J. Smith
Venue: IEEE Transactions on Computers (1989)

The authors present new and efficient algorithms for simulating alternative direct-mapped and set-associative caches and use them to quantify the effect of limited associativity on the cache miss ratio. They introduce an algorithm, forest simulation, for simulating alternative direct-mapped caches and generalize one, which they call all-associativity simulation, for simulating alternative direct-mapped, set-associative, and fully-associative caches. The authors find that although all-associativity simulation is theoretically less efficient than forest simulation or stack simulation (a commonly used simulation algorithm), in practice it is not much slower and allows the simulation of many more caches with a single pass through an address trace. The authors also provide data and insight into how varying associatively affects the miss ratio.
A new heuristic for single row routing problems
Authors: N. A. Sherwani, J. S. Deogun
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

In this paper, we present a new heuristic algorithm for the classical single row routing problem. The algorithm is based on a graph theoretic decomposition scheme and uses modified cut-numbers. The algorithm was implemented in C on VAX 8200. The experimental results show that the quality of solutions generated by our algorithm could be up to 36% better as compared to the existing algorithms.