ppxscal/embedding_network huggingface dataset:
A Computer Music System that Follows a Human Conductor
Authors: Hideyuki Morita, Shuji Hashimoto, Sadamu Ohteru
Venue: Computer (1991)

An electronic orchestra with a complex performance database and MIDI (Musical Instrument Digital Interface) controllers is presented. This system responds to the gestures of a conductor through a CCD camera and a sensor glove. The processing of musical information is examined, and the system and its operation are described. It consists of a gesticulation system and the MIDI controllers. The human interface is also discussed. The first professional conductor who tried the system could direct it without special skills or knowledge of either MIDI or a computer. Tests revealed feedback effects on the behavior of the users through their auditory sense, which in turn suggested some ways to determine the parameters of tempo prediction and compensation. The system can play in concert with human performers and even as a part of a symphony orchestra.
A completion procedure for conditional equationst
Authors: Harald Ganzinger
Venue: Journal of Symbolic Computation (1991)

The paper presents a new completion procedure for conditional equations. The work is based on the notion of reductive conditional rewriting and the procedure has been designed to handle in particular non-reductive equations that are generated during completion. The paper also describes techniques for simplification of conditional equations and rules, so that the procedure terminates on more specifications. The correctness proofs which form a substantial part of this paper employ recursive path orderings on the proof trees of conditional equational logic, an extension of the ideas of Bachmair, Dershowitz & Hsiang to the conditional case.
Trie Hashing with Controlled Load
Authors: Witold A. Litwin, Nick Roussopoulos, Gerald Levy, Wang Hong
Venue: IEEE Transactions on Software Engineering (1991)

Trie hashing (TH), a primary key access method for storing and accessing records of dynamic files, is discussed. The key address is computed through a trie. A key search usually requires only one disk access when the trie is in core and two disk accesses for very large files when the trie must be on disk. A refinement to trie hashing, trie hashing with controlled load (THCL), is presented. It is designed to control the load factor of a TH file as tightly as that of a B-tree file, allows high load factor of up to 100% for ordered insertions, and increases the load factor for random insertions from 70% to over 85%. It is shown that these properties make trie hashing preferable to a B-tree.
Comments on the Decoding Algorithms of DBEC-TBED Reed-Solomon Codes
Authors: F. Zeynep Köksal, Melek D. Yücel
Venue: IEEE Transactions on Computers (1992)

Two decoding algorithms for double-byte error correcting-triple-byte error detecting (DBEC-TBED) Reed-Solomon (RS) codes are implemented using Turbo-Pascal. The first one is the noniterative decoding algorithm developed by R.H. Deng and D.J. Costello. The second one is a frequency-domain RS decoding method given by R.E. Blahut (Theory and Practice of Error Control Codes, Reading, MA, Addison-Wesley, 1983), which implements a standard Berlekamp-Massey algorithm; it is used as reference. Several executions of the software show that the algorithm of Deng-Costello fails in the detection of some triple-byte errors, whereas the standard reference algorithm succeeds in detection always. An example is presented in which the algorithm of Deng-Costello cannot detect a triple-error pattern. The authors also propose a modification to the algorithm of Deng-Costello for its proper operation and make a comparison between the two algorithms.
Real zero isolation for trigonometric polynomials
Authors: Achim Schweikard
Venue: ACM Transactions on Mathematical Software (TOMS) (1992)

An exact and practical method for determining the number, location, and multiplicity of all real zeros of the trigonometric polynomials is described. All computations can be performed without loss of accuracy. lThe method is based on zero isolation techniques for algebraic polynomials. An efficient method for the calculation of the coefficients of a corresponding algebraic polynomial is stated. The complexity of trigonometric zero isolation depending on the degree and the coefficient size of the given trigonometric polynomial is analyzed. In an experimental evaluation, the performance of the method is compared to the performance of recently developed numeric techniques for the approximate determination of all roots of trigonometric polynomials. The case of exponential or hyperbolic polynomials is treated in an appendix.
Modularity of cycles and paths in graphs
Authors: E. M. Arkin, C. H. Papadimitriou, M. Yannakakis
Venue: Journal of the ACM (JACM) (1991)

Certain problems related to the length of cycles and paths modulo a given integer are studied. Linear-time algorithms are presented that determine whether all cycles in an undirected graph are of length P mod Q and whether all paths between two specified nodes are of length P mod Q, for fixed integers P.Q. These results are compared to those for directed graphs.
Failure-Resilient Transaction Management in Multidatabase
Authors: Nandit Soparka, Henry F. Korth, Abraham Silberschatz
Venue: Computer (1991)

Failure recovery in a multidatabase environment is addressed. It is shown that local autonomy considerations force the designer of a multidatabase system to trade off certain desirable properties to achieve reliability for transaction management. Representative techniques in the research literature are contrasted and compared. The author's approach to the problem is described.
SE-OSI: a prototype support environment for Open Systems Interconnection
Authors: Owen Newnan
Venue: ACM SIGCOMM Computer Communication Review (1992)

SE-OSI is a prototype of a support environment (SE) for Open Systems Interconnection (OSI). Written in the C++ programming language, it demonstrates object-oriented application programming interfaces (APIs) for OSI as well as Open Distributed Processing (ODP) and investigates transparent transition to OSI and ODP through use of common APIs. Preliminary benchmarks suggest that the SE-OSI approach is suitable for real-time applications. This approach is contrasted with communications APIs currently being developed in standards bodies and consortiums, with recommendations made as to future directions for standardization of APIs and supporting environments.
Generating explicit communication from shared-memory program references
Authors: Jingke Li, Marina Chen
Venue: Proceedings of the 1990 ACM/IEEE conference on Supercomputing (1990)

This paper addresses the problem of data distribution and communication synthesis in generating parallel programs targeted for massively parallel, distributed-memory machines. The source programs can be sequential, functional, or parallel programs based on a shared-memory model. Our approach is to analyze source program references and match syntactic reference patterns with appropriate aggregate communication routines which can be implemented efficiently on the target machine. We use an explicit communication metric to guide optimizations to reduce communication overhead. The target code with explicit communication is proven to be free from deadlock introduced by the compilation process.
Some virtues and limitations of action inferring interfaces
Authors: Edwin Bos
Venue: Proceedings of the 5th annual ACM symposium on User interface software and technology (1992)

An action inferring facility for a multimodal interface called Edward is described. Based on the actions the user performs, Edward anticipates future actions and offers to perform them automatically. The system uses inductive inference to anticipate actions. It generalizes over arguments and results, and detects patterns on the basis of a small sequence of user actions, e.g. &ldquo;copy a lisp file; change extension of original file into .org; put the copy in the backup folder&rdquo;. Multimodality (particularly the combination of natural language and simulated pointing gestures) and the reuse of patterns are important new features. Some possibilities and problems of action inferring interfaces in general are addressed. Action inferring interfaces are particularly useful for professional users of general-purpose applications. Such users are unable to program repetitive patterns because either the applications do not provide the facilities or the users lack the capabilities.
On synthesizing and identifying stuck-open testable CMOS combinational circuits (extended abstract)
Authors: Sreejit Chakravarty
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

We show that a class of CMOS circuits is a testable realization and static CMOS circuits synthesized by some existing synthesis systems belongs to this class. We propose a more &ldquo;direct&rdquo; solution to the problem of computing robust test-pairs for stuck-open faults by defining a new six-valued logic. This in turn gives us a solution to the problem of identifying stuck-open testable circuits.
Strong concentration for Quicksort
Authors: Colin McDiarmid, Ryan Hayward
Venue: Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms (1992)

Let Qn be the random number of comparisons made by quicksort in sorting n distinct keys, when we assume that all n! possible orderings are equally likely. Known results concerning moments for Qn do not show how rare it is for Qn to make large deviations from its mean. Here we give a good approximation to the probability of such a large deviation, and find that this probability is quite small. As well as the basic quicksort we consider the variant in which the partitioning key is chosen as the median of (2t+1) keys.
Fugue: A Functional Language for Sound Synthesis
Authors: Roger B. Dannenberg, Christopher Lee Fraley, Peter Velikonja
Venue: Computer (1991)

A description is given of Fugue, a language that lets composers express signal processing algorithms for sound synthesis, musical scores, and higher level musical procedures all in one language. Fugue provides functions to create and manipulate sounds as abstract, immutable objects. The interactive language supports behavioral abstraction, so composers can manage complex musical structures. Fugue's capabilities and an example of a score it generated are examined. The implementation of Fugue in a combination of C and XLisp, to run on Unix workstations, is discussed. An example of how Fugue's implementation of lazy evaluation works is given. Future extensions and applications of Fugue are indicated.
Processor coupling: integrating compile time and runtime scheduling for parallelism
Authors: Stephem W. Keckler, William J. Dally
Venue: ACM SIGARCH Computer Architecture News (1992)

The technology to implement a single-chip node composed of 4 high-performance floating-point ALUs will be available by 1995. This paper presents processor coupling, a mechanism for controlling multiple ALUs to exploit both instruction-level and inter-thread parallelism, by using compile time and runtime scheduling. The compiler statically schedules individual threads to discover available intra-thread instruction-level parallelism. The runtime scheduling mechanism interleaves threads, exploiting inter-thread parallelism to maintain high ALU utilization. ALUs are assigned to threads on a cycle by cycle basis, and several threads can be active concurrently. We provide simulation results demonstrating that, on four simple numerical benchmarks, processor coupling achieves better performance than purely statically scheduled or multi-processor machine organizations. We examine how performance is affected by restricted communication between ALUs and by long memory latencies. We also present an implementation and feasibility study of a processor coupled node.
A parallel randomized approximation scheme for shortest paths
Authors: Philip N. Klein, S. Sairam
Venue: Proceedings of the twenty-fourth annual ACM symposium on Theory of computing (1992)

We give a randomized parallel algorithm for approximate shortest path computation in an undirected weighted graph. The algorithm is based on a technique used by Ullman and Yannakakis in a parallel algorithm for breadth-first search. It has application, e.g., in approximate solution of multicommodity flow problems with unit capacities. We also show how to adapt the algorithm to perform better for planar graphs.
The V project manager tools
Authors: Shaun Marsh
Venue: ACM SIGSOFT Software Engineering Notes (1991)

This paper proposes a simple set of tools for managing the concurrent development of a given project by many developers. These tools may be added to most programming environments while not hiding the files from other tools which the developer may wish to use.
Asymptotically optimal PRAM emulation on faulty hypercubes (extended abstract)
Authors: Yonatan Aumann, Michael Ben-Or
Venue: Proceedings of the 32nd annual symposium on Foundations of computer science (1991)

A scheme for emulating the parallel random access machine (PRAM) on a faulty hypercube is presented. All components of the hypercube, including the memory modules, are assumed to be subject to failure. The faults may occur at any time during the emulation and the system readjusts dynamically. The scheme, which rests on L.G. Valiant's BSP model (1990), is the first to achieve optimal and work-preserving PRAM emulation on a dynamically faulty network.
APLITDS: an APL development system
Authors: Carlo Alberto Spinicci
Venue: Proceedings of the international conference on APL '91 (1991)

In spite of its tremendous expressive power, APL lacks a convenient environment for developing large, interactive systems. The workspace structure prevents easy sharing of code and the realization of user interfaces is at least as difficult as in other languages. This paper describes an integrated development environment that attempts to overcome these limitations.
Bi-Level Reconfigurations of Fault Tolerant Arrays
Authors: Rami G. Melhem
Venue: IEEE Transactions on Computers (1992)

Two types of algorithms are considered, namely, local algorithms and global algorithms. In a local algorithm, no processors need to know the status of all other processors in the system. The recovery process is distributed among the processors with each processor using extremely local knowledge. With these properties, the reconfiguration algorithm may achieve fast recovery and real time response but many sacrifice the optimal use of redundancy. In contrast, the goal of a global algorithm is to optimize the use of redundancy with respect to some fault tolerance criteria. This, however, requires global knowledge about other processors in the system and often necessitates extensive changes in the configuration of the system. For unmaintained, long-life systems, local fault tolerance algorithms have the advantages of fast recovery, while global fault tolerance algorithms provide better reliability and longer life expectancy. Fortunately, under certain conditions, it is possible to combine the advantages of the two types of algorithms. These conditions are described.
Analysis and Design of Linear Finite State Machines for Signature Analysis Testing
Authors: Maurizio Damiani, Piero Olivo, Bruno Riccó
Venue: IEEE Transactions on Computers (1991)

The authors present a theoretical investigation of the aliasing error probability (AEP) in signature analysis testing by means of linear finite state machines (LFSMs). The equations of the resulting Markov chain model of the LFSM are solved to determine an exact expression of the AEP as a function of the main LFSM features and of the relevant parameters of the testing environment. This expression is used to prove criteria for the synthesis of LFSMs with minimum asymptotic and transient AEP. A fundamental lower bound on the AEP is presented, which represents the performance limit of any LFSM with respect to aliasing minimization. It is shown that the AEP in machines realizing counters mod 2/sup k/-1 is the closest to such a bound, in particular periodically reaching it.
Software piracy and software security in business schools: an ethical perspective
Authors: Jin H. Im, Pamela D. Van Epps
Venue: ACM SIGMIS Database (1991)

Many business schools have become heavily dependent on microcomputers for educational purposes. That exposes them to a new type of ethical issue---the ramifications involved with unauthorized software copying by faculty, staff, and students. This article presents the results of a field survey on software piracy and software security in 241 member schools of the American Assembly of Collegiate Schools of Business (AACSB). The authors discuss some important findings concerning software security procedures and policies to reduce legal responsibilities for copyright infringements by faculty, staff and students. The article concludes with some recommendations for creating and sustaining an environment where conditions contributing to software piracy and security issues are minimized.
Pictures, poseurs, and posers
Authors: Sylvie J. Rueff
Venue: ACM SIGGRAPH Computer Graphics (1992)

"The only thing you can do with computer graphics is make pretty pictures." That was the thinking of most people a decade ago, and it still is the opinion of all too many people. At the same time, an enormous amount of attention is now being paid to the use of computer based pictures in the realm of the sciences.Because of concerns about weaknesses in mathematics and science, there is a movement to make math and science more entertaining. Certainly it is of value to make math and science more interesting and more accessible, and pictures can be great communicators, as shown by the work done in The Mechanical Universe and Mathematics! Science and math are about understanding, and understanding requires that people participate, ask questions, observe well, discover clues, and find solutions. Both of the animations mentioned above are used within the context of the classroom, with support materials.Many people are producing pictures from data in the laboratory. This process of creating images is exhilarating, but not all images created with the use of a computer are scientifically useful. It is a challenge to make good pictures which focus either on the investigation or on the attributes of the data being examined. These should be accurate and contain all the information required for understanding the data.
Evaluation of queries in independent database schemes
Authors: Yehoshua Sagiv
Venue: Journal of the ACM (JACM) (1991)

A simple characterization of independent database schemes is proved. An algorithm is given for translating a tableau T, posed as a query on a representative instance, to a union of tableaux that is equivalent to T, but can be applied directly to database relations. The algorithm may take exponential time (in the size of T and the database scheme), and it is applicable only to independent database schemes. If T is a just a projection of a representative instance, then the algorithm has a simpler form (which is still exponential in the worst case) and is polynomial in some cases.
On finding a stable roommate, job, or spouse: a case study crossing the boundaries of computer science courses
Authors: Owen Astrachan
Venue: Proceedings of the twenty-third SIGCSE technical symposium on Computer science education (1992)

The use of real world problems as the basis for assignments in Computer Science courses is attractive for many reasons. At the same time it is difficult to find such a problem that offers the same richness that is found, for example, in sorting or searching. In this paper a problem is presented that has many real-world instances and which is pedagogically attractive at all levels of Computer Science from the level of a non-major's course to that of an advanced algorithms course.
Locking protocols for concurrency control in real-time database systems
Authors: S. L. Hung, K. Y. Lam
Venue: ACM SIGMOD Record (1992)

Concurrency Control in real-time database systems is complicated by the requirement to maintain database consistency at the same time to minimize the number of transactions missing their deadlines. The scheduling of data in Basic Two Phase Locking (2PL) completely ignores the urgency of a transaction and thus the effectiveness of the adopted real-time resource scheduling protocol is greatly reduced. In Restart based locking protocols (R2PL), same priorities are used for both data and resources scheduling and should have fewer transactions missing their deadlines. However, Restart based protocols sufferred the intrinsic weakness of high restart overhead owing to ensure atomicity of transactions. In this paper, based on their weaknesses, a hybrid concurrency control protocol (H2PL) is proposed. Through performance study, results indicate that it can perform well under different degree of deadline constraint and workload as compared with other real-time locking protocols.
A model for the protection of reusable software
Authors: Pam Denkins, Sue LeGrand
Venue: ACM SIGSAC Review (1991)

In applied efforts to reduce the cost of the software life-cycle process, government agencies and industry are focusing on the reusability of software. Software reusability, both between various automated information systems and software projects, has become a primary requirement in many requests for proposals. Software reusability is, perhaps, one of the most significant low technology, cost-cutting methods available to the data processing community today. Without effective protective measures established and in place, however, reusing software can result in the proliferation of malicious code, resulting in the loss of dollars, possibly even lives. An effective protection plan for reusable software must combine verification of the software by the developer, appropriate protection of the software during both storage and use, guaranteed delivery and integrity when software is transferred, and re-verification of software by the new user prior to incorporation in a new design. NASA's approach to software protection establishes four hierarchical levels of automated information sensitivity and criticality and provides guidance for appropriate protective measures for each level. We advocate the addition of protection domains to the current NASA schema.
Performance optimization of pipelined primary cache
Authors: Kunle Olukotun, Trevor Mudge, Richard Brown
Venue: ACM SIGARCH Computer Architecture News (1992)

The CPU cycle time of a high-performance processor is usually determined by the access time of the primary cache. As processors speeds increase, designers will have to increase the number of pipeline stages used to fetch data from the cache in order to reduce the dependence of CPU cycle time on cache access time. This paper studies the performance advantages of a pipelined cache for a GaAs implementation of the MIPS based architecture using a design methodology that includes long traces of multiprogrammed applications and detailed timing analysis. The study evaluates instruction and data caches with various pipeline depths, cache sizes, block sizes, and refill penalties. The impact on CPU cycle time of these alternatives is also factored into the evaluation. Hardware-based and software-based strategies are considered for hiding the branch and load delays which may be required to avoid pipeline hazards. The results show that software-based methods for mitigating the penalty of branch delays can be as successful as the hardware-based branch-target buffer approach, despite the code-expansion inherent in the software methods. The situation is similar for load delays; while hardware-based dynamic methods hide more delay cycles than do static approaches, they may give up the advantage by extending the cycle time. Because these methods are quite successful at hiding small numbers of branch and load delays, and because processors with pipelined caches also have shorter CPU cycle times and larger caches, a significant performance advantage is gained by using two to three pipeline stages to fetch data from the cache.