ppxscal/embedding_network huggingface dataset:
On computational properties of chains of recurrences
Authors: Eugene V. Zima
Venue: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (2001)

Backward and mixed chains of recurrences are introduced. A complete set of chains of recurrences manipulation tools is described. Applications of these tools, related to the safety and numeric stability of chained computations are given.
Variable-precision exponentiation
Authors: P. L. Richman
Venue: Communications of the ACM (1973)

A previous paper presented an efficient algorithm, called the Recomputation Algorithm, for evaluating a rational expression to within any desired tolerance on a computer which performs variable-precision arithmetic operations. The Recomputation Algorithm can be applied to expressions involving any variable-precision operations having O(10-p + &sum; | &egr;i |) error bounds, where p denotes the operation's precision and &egr;i denotes the error in the operation's ith argument. This paper presents an efficient variable-precision exponential operation with an error bound of the above order. Other operations, such as log, sin, and cos, which have simple series expansions, can be handled similarly.
Compiled communication for all-optical TDM networks
Authors: Xin Yuan, R. Melhem, R. Gupta
Venue: Proceedings of the 1996 ACM/IEEE conference on Supercomputing (CDROM) (1996)

While all-optical networks offer large bandwidth for transferring data, the control mechanisms to dynamically establish all-optical paths incur large overhead. In this paper, we consider the problem of adapting all-optical multiplexed networks in multiprocessor or multicomputer environment by using compiled communication as an alternative to dynamic network control. In compiled communication, the network resources are managed statically and therefore, run time control overhead is eliminated. In addition, complex offline algorithms can be incorporated to manage the network resources more efficiently. We studied several off-line connection scheduling algorithms for optimizing the multiplexing degree required to satisfy communication requests. The performance of compiled communication for communication patterns that can be determined at compile time in application programs is evaluated and compared with dynamically controlled communication assuming a two-dimmension torus topology. Our results show that the compiled communication out-performs the dynamic communication to a large degree for these communication patterns. Since most of the communication patterns in parallel applications can be determined at compile time, we conclude that compiled communication is an effective mechanism for all-optical network in multiprocessor environments.
Multimodal error correction for speech user interfaces
Authors: Bernhard Suhm, Brad Myers, Alex Waibel
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2001)

Although commercial dictation systems and speech-enabled telephone voice user interfaces have become readily available, speech recognition errors remain a serious problem in the design and implementation of speech user interfaces. Previous work hypothesized that switching modality could speed up interactive correction of recognition errors. This article presents multimodal error correction methods that allow the user to correct recognition errors efficiently without keyboard input. Correction accuracy is maximized by novel recognition algorithms that use context information for recognizing correction input. Multimodal error correction is evaluated in the context of a prototype multimodal dictation system. The study shows that unimodal repair is less accurate than multimodal error correction. On a dictation task, multimodal correction is faster than unimodal correction by respeaking. The study also provides empirical evidence that system-initiated error correction (based on confidence measures) may not expedite error correction. Furthermore, the study suggests that recognition accuracy determines user choice between modalities: while users initially prefer speech, they learn to avoid ineffective correction modalities with experience. To extrapolate results from this user study, the article introduces a performance model of (recognition-based) multimodal interaction that predicts input speed including time needed for error correction. Applied to interactive error correction, the model predicts the impact of improvements in recognition technology on correction speeds, and the influence of recognition accuracy and correction method on the productivity of dictation systems. This model is a first step toward formalizing multimodal interaction.
An Improved Context-Free Recognizer
Authors: Susan L. Graham, Michael Harrison and Walter L. Ruzzo
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1980)

A new algorithm for recognizing and parsing arbitrary context-free languages is presented, and several new results are given on the computational complexity of these problems. The new algorithm is of both practical and theoretical interest. It is conceptually simple and allows a variety of efficient implementations, which are worked out in detail. Two versions are given which run in faster than cubic time. Surprisingly close connections between the Cocke-Kasami-Younger and Earley algorithms are established which reveal that the two algorithms are &ldquo;almost&rdquo; identical.
Advanced programming and the aims of standardization
Authors: Saul Gorn
Venue: Communications of the ACM (1966)

Some of the most advanced programming techniques have emerged either because of the complete lack of coordinated standards, or because there was too rigid standardization and too soon, whether it was planned that way or not. The standardization that was lacking, or too rigid, was in programming techniques, programming languages, programming terminology, equipment techniques, available equipment, and specification and documentation methods for equipment, programs, languages, and problems to be solved. For example, common programming languages developed because of the lack of standardized equipment or languages for their use.
RF CMOS Cells for Wireless Applications
Authors: Robert H. Caverly, Scott Smith, Jiangang Hu
Venue: Analog Integrated Circuits and Signal Processing (2000)

There is increasing interest in the use of CMOS circuits for high frequency highly integrated wireless telecommunications systems. This paper presents the results of on-going work into the development of a cell library that includes many of the circuit elements required for the high frequency sub-systems of communications integrated circuits. The cell library studied included an RF control element, single ended Class A amplifier, RF isolator, and Gilbert cell mixer circuit topologies. Circuit design criteria and measurement results are presented. All cells were fabricated using standard 2.0, 1.2, and 0.8 &mu;m CMOS integrated circuit fabrication processes with no post-processing performed. The results indicate that 2.0 &mu;m CMOS can be used successfully up to approximately 250 MHz with 0.8 &mu;m cells useful up to approximately 1000 MHz.
On removing multiple redundancies in combinational circuits
Authors: S.-C. Chang, D. I. Cheng, C.-W. Yeh
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

Redundancy removal is an important step in combinational logic optimization. After a redundant wire is removed, other originally redundant wires may become irredundant, and some originally irredundant wires may become redundant. When multiple redundancies exist in a circuit, this creates a problem where we need to decide which redundancy to remove first. In this paper, we present an analysis and a very efficient heuristic to deal with multiple redundancies. We associate with each redundant wire a Boolean function that describes how the wire can remain redundant after removing other wires. When multiple redundancies exist, this set of Boolean functions characterizes the global relationship among redundancies.
Comment on a paper on parallel processing
Authors: M. R. Nekora
Venue: Communications of the ACM (1961)

The article by Lynn Yarbrough on Parallel Processing in the October Communications is interesting since it attracts attention to a subject which needs to be given increased consideration. His indictment of manufacturers for failing to provide what he feels is minimal to realizing the advantages of multi-programming is not applicable to STRETCH, however. It may be recalled that his specific complaint concerns the lack of protection of any program or monitor from the unpredictable actions of any other program. On page 15 of the STRETCH Data Processing System Reference Manual, we read: Address monitoring facilities are provided &hellip; The upper and lower boundaries of the storage area to be defined are placed in two address boundary registers. An alarm will be given when an address falls either inside or outside the defined area, whichever is desired. Storing in protected areas is normally suppressed.
Knowledge Discovery from Series of Interval Events
Authors: Roy Villafane, Kien A. Hua, Duc Tran, Basab Maulik
Venue: Journal of Intelligent Information Systems (2000)

Knowledge discovery from data sets can be extensively automated by using data mining software tools. Techniques for mining series of interval events, however, have not been considered. Such time series are common in many applications. In this paper, we propose mining techniques to discover temporal containment relationships in such series. Specifically, an item A is said to contain an item B if an event of type B occurs during the time span of an event of type A, and this is a frequent relationship in the data set. Mining such relationships provides insight about temporal relationships among various items. We implement the technique and analyze trace data collected from a real database application. Experimental results indicate that the proposed mining technique can discover interesting results. We also introduce a quantization technique as a preprocessing step to generalize the method to all time series.
Eventually consistent failure detectors
Authors: Mikel Larrea, Antonio Fernández, Sergio Arévalo
Venue: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures (2001)

The concept of unreliable failure detecto was introduced by Chandra and Toueg [2] as a mechanism that provides (possibly incorrect) information about process failures. This mechanism has been used to solve different problems in async hronous systems, in particular the Consensus problem. In this paper, we present a new class of unreliable failure detectors, which we call Eventually Consistent and denote by &diams;C. This class adds to the failure detection capabilities of other classes an eventual leader election capability. We study the relationship between &diams;C and other classes of failure detectors. We also propose an efficient algorithm to transform &diams;C into &diams;P. Finally, to show the power of this new class of failure detectors, we present an efficient Consensus algorithm based on &diams;C. Due to space limitation, the reader is referred to [4] for an in-depth presentation of the algorithms. Here, we only present their general idea.
An overview of MiniJava
Authors: Eric Roberts
Venue: ACM SIGCSE Bulletin (2001)

This paper describes the implementation of MiniJava, a teaching-oriented programming language closely based on the Java language developed by Sun Microsystems [6]. The core of the MiniJava environment is a restricted subset of the standard Java release and is designed to reduce the intimidation factor introductory students experience when they encounter a system as large as the Java environment. The paper outlines the particular restrictions and extensions that define MiniJava along with pedagogical justifications for each.
Efficient Vector Quantization Using the WTA-Rule with Activity Equalization
Authors: Gunther Heidemann, Helge Ritter
Venue: Neural Processing Letters (2001)

We propose a new algorithm for vector quantization, the Activity Equalization Vector quantization (AEV). It is based on the winner takes all rule with an additional supervision of the average node activities over a training interval and a subsequent re-positioning of those nodes with low average activities. The re-positioning is aimed to both an exploration of the data space and a better approximation of already discovered data clusters by an equalization of the node activities. We introduce a learning scheme for AEV which requires as previous knowledge about the data only their bounding box. Using an example of Martinetz et al. &lsqb;1&rsqb;, AEV is compared with the Neural Gas, Frequency Sensitive Competitive Learning (FSCL) and other standard algorithms. It turns out to converge much faster and requires less computational effort.
Concurrency, objects and visualisation
Authors: Chris Exton, Michael Kölling
Venue: Proceedings of the Australasian conference on Computing education (2000)

Object-oriented programming and concurrency are increasingly popular in computing education. Both are difficult topics in themselves, and the combination of both introduces subtle interactions that are not easily understood. We propose the development of a visualisation tool to illustrate both object-orientation as well as concurrency issues. Designing such a tool is a challenging task. It has been shown that visualisation tools are not always as effective as their authors had hoped, and the issues to be illustrated by our potential tools are not yet well defined. In this paper, we investigate both the visualisation aspect and the functionality that such a tool may have and we develop some guidelines for the design of a concurrent object visualisation tool.
Towards standards for handwritten zero and oh: much ado about nothing (and a letter), or a partial dossier on distinguishing between handwritten zero and oh
Authors: R. W. Bemer
Venue: Communications of the ACM (1967)

The Chairman of the ACM Standards Committee, Julien Green, has charged me with making &ldquo;more effective use of CACM for communication &hellip; to get grass-roots opinions from the ACM membership.&rdquo; This paper is the first attempt. A partial dossier on distinguishing between handwritten zero and the letter oh is assembled here. This presentation was triggered by a request for guidance in this matter presented by the United Kingdom Delegation to ISO/TC97/SC2, Character Sets and Coding, at the meeting in Paris on 1967 March 13-16. The matter is just now in the province of USASI X3.6, to which comments might be directed. Comments will be expected within sixty days [by approximately October 1st].
The Maxmin of Recursive Games with Incomplete Information on one Side
Authors: Dinah Rosenberg, Nicolas Vieille
Venue: Mathematics of Operations Research (2000)

We prove the existence of the maxmin of zero-sum recursive games with one sided information.
More types for nested data parallel programming
Authors: Manuel M. T. Chakravarty, Gabriele Keller
Venue: Proceedings of the fifth ACM SIGPLAN international conference on Functional programming (2000)

This paper generalises the flattening transformation---a technique for the efficient implementation of nested data parallelism---and reconciles it with main stream functional programming. Nested data parallelism is significantly more expressive and convenient to use than the flat data parallelism typically used in conventional parallel languages like High Performance Fortran and C*. The flattening transformation of Blelloch and Sabot is a key technique for the efficient implementation of nested parallelism via flat parallelism, but originally it was severely restricted, as it did not permit general sum types, recursive types, higher-order functions, and separate compilation. Subsequent work, including some of our own, generalised the transformation and allowed higher-order functions and recursive types. In this paper, we take the final step of generalising flattening to cover the full range of types available in modern languages like Haskell and ML; furthermore, we enable the use of separate compilation. In addition, we present a completely new formulation of the transformation, which is based on the standard lambda calculus notation, and replace a previously ad-hoc transformation step by a systematic generic programming technique. First experiments demonstrate the efficiency of our approach.
ARLEQUIN: an integrated Java application
Authors: Zarko Stankovski
Venue: Proceedings of the 2001 joint ACM-ISCOPE conference on Java Grande (2001)

In the six years since Java was offered to the developer community, it has proven to be an extraordinary product of recent achievements in computer science. But Java has the reputation, especially among non-java users, to be slow and non-well suited for the development of large computer codes with intensive numerical calculations. This is the main reason for the hesitations of high-performance computer code developers to adopt it, even though the well-known qualities of this language (to build homogeneous applications - GUI, command language, numerical code - and the &ldquo;write once, run anywhere&rdquo; advantages) are well established.
Temporal authorization bases: from specification to integration
Authors: Elisa Bertino, Piero Andrea Bonatti, Elena Ferrari, Maria Luisa Sapino
Venue: Journal of Computer Security (2000)

In this paper we present a powerful authorization mechanism which provides support for: (1) periodic authorizations (both positive and negative), that is, authorizations that hold only in specific periods of time; (2) user-defined deductive temporal rules, by which new authorizations can be derived from those explicitly specified; (3) a hierarchical organization of subjects and objects, supporting a more adequate representation of their semantics. From the authorizations explicitly specified, additional authorizations are automatically derived by the system based on those hierarchies. The resulting model is therefore very flexible in terms of the kinds of protection requirements that it can represent. The flexibility provided to the users requires a non trivial underlying formal model where temporal constraints, derivation rules and object and subject hierarchies can be represented. In particular, when inheritance and derivation rules are used simultaneously, there is need for conditions ensuring that the authorization base is free from ambiguities. In this paper, we introduce a notion of safeness , and prove that it guarantees the absence of ambiguities and inconsistencies in the specification. Moreover, we define an efficient algorithm for computing authorizations from safe specifications. Finally, we provide a methodology for supporting temporal authorizations in heterogeneous, distributed systems.
Algorithms for finding a fundamental set of cycles for an undirected linear graph
Authors: C. G. Gotlieb, D. G. Corneil
Venue: Communications of the ACM (1967)

Given the adjacency matrix of the graph, the algorithm presented in this paper finds a spanning tree and then constructs the set of fundamental cycles. Our algorithm is slower than an algorithm presented by Welch by a ratio of N/3 (N is the number of nodes) but requires less storage. For graphs with a large number of nodes and edges, when storage is limited our algorithm is superior to Welch's; however, when the graphs are small, or machine storage is very large, Welch's algorithm is superior. Timing estimates and storage requirements for both methods are presented.
Efficient compilation of process-based concurrent programs without run-time scheduling
Authors: B. Lin
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

Currently, run-time operating systems are widely used to implement concurrent embedded applications. This run-time approach to multi-tasking and inter-process communication can introduce significant overhead to execution times and memory requirements -- prohibitive in many cases for embedded applications where processor and memory resources are scarce. In this paper, we present a static compilation approach that generates ordinary C programs at compile-time that can be readily retargeted to different processors, without including or generating a run-time scheduler. Our method is based on a novel Petri net theoretic approach.
Statistical Design of Low Power Square-Law CMOS Cells for High Yield
Authors: Tuna B. Tarim, H. Hakan Kuntman, Mohammed Ismail
Venue: Analog Integrated Circuits and Signal Processing (2000)

A robust design of low voltage low power square law CMOS composite cells using statistical VLSI design techniques is presented. Since random device/process variations do not scale down with feature size or supply voltage, the statistical design of low voltage circuits is essential in order to keep functional yields of low voltage circuits at levels that are competitive and cost effective. The Response Surface Methodology and Design of Experiment techniques were used as statistical techniques. This article shows that statistical techniques will result in area/layout optimization which will enhance functional yield of low voltage analog ICs.
Numerical Solution of Infinite-Horizon Optimal-Control Problems
Authors: Peter Kunkel, Oskar Von Dem Hagen
Venue: Computational Economics (2000)

The paper presents an algorithm that solves two-point boundary-value problems that arise in economic control models in continuous time with an infinite time horizon and several state variables. The algorithm can determine optimal trajectories that converge to an isolated equilibrium point. It therefore provides a numerical solution to a large class of problems for which no solvers were yet available.
Survey of formula manipulation
Authors: Jean E. Sammet
Venue: Communications of the ACM (1966)

The field of formula manipulation is surveyed, with particular attention to the specific capabilities of differentiation, integration and the supporting capabilities of simplification, displays and input/output editing, and precision arithmetic. General systems&mdash;both batch and online&mdash;are described. Finally, some programs to solve specific applications are discussed.
Interchange rolls of perforated tape for information interchange
Authors: M. Stuart Lynn
Venue: Communications of the ACM (1970)

This proposed American National Standard has been accepted for publication by American National Standards (formerly USASI) Committee X3, Computers and Information Processing. In order that the final version of the proposed standard reflect the largest public consensus, X3 authorized publication of this document to elicit comment and general public reaction, with the understanding that such a working document is an intermediate result in the standardization process and is subject to change, modification, or withdrawal in part or in whole. Comments should be addressed to the X3 Secretary, Business Equipment Manufacturers Association, 235 East 42 Street, New York, NY 10017.&mdash;C.K.
On solutions of linear functional systems
Authors: Sergei A. Abramov, Manuel Bronstein
Venue: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (2001)

We describe a new direct algorithm for transforming a linear system of recurrences into an equivalent one with nonsingular leading or trailing matrix. Our algorithm, which is an improvement to the EG elimination method [2], uses only elementary linear algebra operations (ranks, kernels and determinants) to produce an equation satisfied by the degrees of the solutions with finite support. As a consequence, we can bound and compute the polynomial and rational solutions of very general linear functional systems such as systems of differential or (q&mdash;) difference equations.