ppxscal/embedding_network huggingface dataset:
Very-High Radix Circular CORDIC: Vectoring and Unified Rotation/Vectoring
Authors: Elisardo Antelo, Tomás Lang, Javier D. Bruguera
Venue: IEEE Transactions on Computers (2000)

A very-high radix algorithm and implementation for circular CORDIC is presented. We first present in depth the algorithm for the vectoring mode in which the selection of the digits is performed by rounding of the control variable. To assure convergence with this kind of selection, the operands are prescaled. However, in the CORDIC algorithm, the coordinate $x$ varies during the execution so several scalings might be needed; we show that two scalings are sufficient. Moreover, the compensation of the variable scale factor (including the CORDIC scale factor and the prescaling factors) is done by computing the logarithm of the scale factor and performing the compensation by an exponential. Then, we combine, in a unified unit, the proposed vectoring algorithm and the very-high radix rotation algorithm, which was previously proposed by the authors. We compare with low-radix implementations in terms of latency and hardware complexity. Estimations of the delay for 32-bit precision show a speedup of about two with respect to the radix-4 case with redundant addition. This speedup is obtained at the cost of an increase in the hardware complexity, which is moderate for the pipelined implementation. We also compare at the algorithmic level with other very-high radix proposals, demonstrating the advantages of our algorithms.
DOCUMENTS: an interactive online solution to four documentation problems
Authors: T. R. Girill, Clement H. Lulc
Venue: Communications of the ACM (1983)

An adequate delivery system for user documentation addresses the problems of easy access, versatile publication, convenient administration, and good document quality. At the National Magnetic Fusion Energy Computer Center the DOCUMENT program helps solve these problems by providing a high level of service through strategies that can readily be exported to other contexts. Dividing machine-readable documents into keyword windows permits fully online, subject-oriented access to all passages. An adaptive, three-tier user interface extends flexible viewing control to novices and experts alike. DOCUMENT also supports online subject, title, and date catalogs, and provides on-demand output of hardcopy and microfiche. Several other document delivery systems are compared with DOCUMENT, and all have more rigid human interfaces, more structural display units for text, or more cumbersome output options.
RTcmix for Linux (Part 1)
Authors: Dave Topper
Venue: Linux Journal (2000)

In the first part of this three-part series on real-time audio synthesis we take you through the history and basis of RTcmix.
Objectives and objective assessment in CS1
Authors: Raymond Lister
Venue: ACM SIGCSE Bulletin (2001)

When designing a first semester "CS1" programming subject, I advocate "truth in sentencing". That is, the objectives should be explicit, and the assessment tasks should reflect the objectives. This may appear to be a statement of the obvious, but few subjects satisfy these criteria. The traditional CS1 approach is to set students the task of writing extensive code, as early as possible. On closer inspection of such subjects, one finds marking schemes for exams and assignments that are generous to the point of being inconsistent with the subject objectives. Instead, students should not write any original code in CS1, and should be examined by multiple choice question.
Generation of Rosary permutations expressed in Hamiltonian circuits
Authors: Kazuaki Harada
Venue: Communications of the ACM (1971)

Systematic generation of a specific class of permutations fundamental to scheduling problems is described. In a nonoriented complete graph with n vertices, Hamiltonian circuits equivalent to 1/2(n - 1)! specific permutations of n elements, termed rosary permutations, can be defined. Each of them corresponds to two circular permutations which mirror-image each other, and is generated successively by a number system covering 3&middot;4&middot; &middot;&middot;&middot; &middot;(n - 1) sets of edges. Every set of edges {ek}, 1 &le; ek &le; k, 3 &le; k &le; n - 1 is determined recursively by constructing a Hamiltonian circuit with k vertices from a Hamiltonian circuit with k - 1 vertices, starting with the Hamiltonian circuit of 3 vertices. The basic operation consists of transposition of a pair of adjacent vertices where the position of the pair in the permutation is determined by {ek}. Two algorithms treating the same example for five vertices are presented. It is very easy to derive all possible n! permutations from the 1/2(n - 1)! rosary permutations by cycling the permutations and by taking them in the reverse order&mdash;procedures which can be performed fairly efficiently by computer.
Computational geometry column 40
Authors: Joseph O'Rourke
Venue: ACM SIGACT News (2000)

It has recently been established by Below, De Loera, and Richter-Gebert that finding a minimum size (or even just a small) triangulation of a convex polyhedron is NP-complete. Their 3SAT-reduction proof is discussed.
Remark on algorithm 746: new features of PCOMP, a Fortran code for automatic differentiation
Authors: Michael Liepelt, Klaus Schittkowski
Venue: ACM Transactions on Mathematical Software (TOMS) (2000)

The software system PCOMP uses automatic differentiation to calculate derivatives of functions that are defined by the user in a modeling language similar to Fortran. This symbolical representation is converted into an intermediate code, which can be interpreted to calculate function and derivative values at run-time within machine accuracy. Furthermore, it is possible to generate Fortran code for function and gradient evaluation, which has to be compiled and linked separately. The first version of PCOMP was introduced in Dobmann et al. [1995]. In this article, we describe a series of extensions and additional features that have been implemented in the meantime.
Algorithm 805: computation and uses of the semidiscrete matrix decomposition
Authors: Tamara G. Kolda, Dianne P. O'Leary
Venue: ACM Transactions on Mathematical Software (TOMS) (2000)

We present algorithms for computing a semidiscrete approximation to a matrix in a weighted norm, with the Frobenius norm as a special case. The approximation is formed as a weighted sum of outer products of vectors whose elements are &plusmn;1 or 0, so the storage required by the approximation is quite small. We also present a related algorithm for approximation of a tensor. Applications of the algorithms are presented to data compression, filtering, and information retrieval; software is provided in C and in Matlab.
It knows what you're going to do: adding anticipation to a Quakebot
Authors: John E. Laird
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

The complexity of AI characters in computer games is continually improving; however they still fall short of human players. In this paper we describe an AI bot for the game Quake II that tries to incorporate some of the missing capabilities. This bot is distinguished by its ability to build its own map as it explores a level, use a wide variety of tactics based on its internal map, and in some cases, anticipate its opponents actions. The bot was developed in the Soar architecture and uses dynamical hierarchical task decomposition to organize it knowledge and actions. It also uses internal prediction based on its own tactics to anticipate its opponents actions. This paper describes the implementation, its strengths and weaknesses, and discusses future research.
Fast finite-difference solution of biharmonic problems
Authors: D. Greenspan, D. Schultz
Venue: Communications of the ACM (1972)

Setting the Reynolds number equal to zero, in a method for solving the Navier-Stokes equations numerically, results in a fast numerical method for biharmonic problems. The equation is treated as a system of two second order equations and a simple smoothing process is essential for convergence. An application is made to a crack-type problem.
Design methodologies for system level IP
Authors: G. Martin
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

System-chip design which starts at the RTL-level today has hit a plateau of productivity and re-use which can be characterized as a "Silicon Ceiling". Breaking through this plateau and moving to higher and more effective re-use of IP blocks and system-chip architectures demands a move to a new methodology: one in which the best aspects of today's RTL based methods are retained, but complemented by new levels of abstraction and the commensurate tools to allow designers to exploit the productivity inherent in these higher levels of abstraction. In addition, the need to quickly develop design derivatives, and to differentiate products based on standards, requires an increasing use of software IP. This paper will describe today's situation, the requirements to move beyond it, and sketch the outlines of near-term possible and practical solutions.
Catastrophic Short and Open Fault Detection in Bipolar CML Circuits: A Case Study
Authors: André Ivanov, Vikram Devdas
Venue: Journal of Electronic Testing: Theory and Applications (2000)

The detection of catastrophic short and open faults in bipolar current mode logic (CML) circuits is studied. The non-intrusive tests considered include functional (logic) tests, an Idd test, and a common-mode test. A 622 Mbps SONET SIPO (Serial-In/Parallel-Out) and a PISO (Parallel-In/Serial-Out) circuit form the basis of this case study.
Probabilistic Models of Appearance for 3-D Object Recognition
Authors: Arthur R. Pope, David G. Lowe
Venue: International Journal of Computer Vision (2000)

We describe how to model the appearance of a 3-D object using multiple views, learn such a model from training images, and use the model for object recognition. The model uses probability distributions to describe the range of possible variation in the object's appearance. These distributions are organized on two levels. Large variations are handled by partitioning training images into clusters corresponding to distinctly different views of the object. Within each cluster, smaller variations are represented by distributions characterizing uncertainty in the presence, position, and measurements of various discrete features of appearance. Many types of features are used, ranging in abstraction from edge segments to perceptual groupings and regions. A matching procedure uses the feature uncertainty information to guide the search for a match between model and image. Hypothesized feature pairings are used to estimate a viewpoint transformation taking account of feature uncertainty. These methods have been implemented in an object recognition system, OLIVER. Experiments show that OLIVER is capable of learning to recognize complex objects in cluttered images, while acquiring models that represent those objects using relatively few views.
Detection of Delay Faults in Memory Address Decoders
Authors: Emil Gizdarski
Venue: Journal of Electronic Testing: Theory and Applications (2000)

In this paper we present an efficient test concept for detection of delay faults in memory address decoders based on the march test tactic. The proposed Transition Sequence Generator (TSG) generates an optimal transition sequence for sensitization of the delay faults in address decoders by Hayes's transformation on a reflected Gray code. It can be used for parallel Built-In Self-Testing (BIST) of high-density RAMs. We also present an efficient Design For Test (DFT) approach for immediate detection of the effects of the delay faults in the address decoders which does not change memory access time. It requires extra logic to be attached to the outputs of the address decoders. This DFT approach can be used to increase memory testability for both on-line and off-line testing of single- and multi-port RAMs.
A foundation for representing and querying moving objects
Authors: Ralf Hartmut Güting, Michael H. Böhlen, Martin Erwig, Christian S. Jensen, Nikos A. Lorentzos, Markus Schneider, Michalis Vazirgiannis
Venue: ACM Transactions on Database Systems (TODS) (2000)

Spatio-temporal databases deal with geometries changing over time. The goal of our work is to provide a DBMS data model and query language capable of handling such time-dependent geometries, including those changing continuously that describe moving objects. Two fundamental abstractions are moving point and moving region, describing objects for which only the time-dependent position, or position and extent, respectively, are of interest. We propose to present such time-dependent geometries as attribute data types with suitable operations, that is, to provide an abstract data type extension to a DBMS data model and query language. This paper presents a design of such a system of abstract data types. It turns out that besides the main types of interest, moving point and moving region, a relatively large number of auxiliary data types are needed. For example, one needs a line type to represent the projection of a moving point into the plane, or a &ldquo;moving real&rdquo; to represent the time-dependent distance of two points. It then becomes crucial to achieve (i) orthogonality in the design of the system, i.e., type constructors can be applied unifomly; (ii) genericity and consistency of operations, i.e., operations range over as many types as possible and behave consistently; and (iii) closure and consistency between structure and operations of nontemporal and related temporal types. Satisfying these goal leads to a simple and expressive system of abstract data types that may be integrated into a query language to yield a powerful language for querying spatio-temporal data, including moving objects. The paper formally defines the types and operations, offers detailed insight into the considerations that went into the design, and exemplifies the use of the abstract data types using SQL. The paper offers a precise and conceptually clean foundation for implementing a spatio-temporal DBMS extension.
Flexible processor based on full-adder/ d-flip-flop merged module
Authors: Satoshi Sakaidani, Naoto Miyamoto, Tadahiro Ohmi
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

Flexible processor based on full-adder/D-flip-flop merged module (FDMM) has been designed and fabricated. The developed FDMM has unique ability to perform both logic and flip-flop functions with a small transistor counts by merging common part of both circuit. We have also developed a context memory block to reconfigure the hardware dynamically. The flexible processor may fill a gap between hardware performance and software programmability to jump into a novel computing such as software/hardware synthesis; "software accelerator".
An overrelaxation for a numerical inverse of a constant
Authors: Hitohisa Asai
Venue: Communications of the ACM (1980)

When division is performed by a power series implementation with additions, subtractions, digit shifts, and multiplications, the convergence rate of the power series is important in practical application. Particularly if the rate of the power series is close to one, the convergence is slow and therefore a special method to accelerate the convergence is needed. Without such an acceleration, the power series implementation is less attractive. An acceleration method is proposed for the slow convergence rate. First, the worst case convergence rate of the power series is determined for a given appropriate acceleration factor. Next, a simple way to choose the appropriate acceleration factor is presented.
Algorithm 483: Masked three-dimensional plot program with rotations
Authors: Steven L. Watkins
Venue: Communications of the ACM (1974)

PLOT3D will accept three-dimensional data in various forms, rotate it in three-space, and plot the projection of the resulting figure onto the x-y plane. Those lines or portions of lines which should be hidden by previous lines are masked.
The Nebulous future of machine translation
Authors: James P. Titus
Venue: Communications of the ACM (1967)

A report by the National Academy of Sciences that examines machine translation against the light of human translation has disturbed a good many research administrators in the government. So much bad publicity has been engendered by this report that the future of machine translation is uncertain, even though the technology is a scant twelve years old.
That's Vimprovement! A Better Vi
Authors: Steve Oualline
Venue: Linux Journal (2001)

Ouallin details the enhancement of the Vim vi clone.
Distribution sort with randomized cycle
Authors: Jeffrey Scott Vitter, David A. Hutchinson
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often difficult. In this paper we develop randomized variants of distribution sort for use with parallel independent disks. We propose a simple variant called randomized cycling distribution sort (RCD) and prove that it has optimal expected I/O complexity. The analysis uses a novel reduction to a model with significantly fewer probabilistic interdependencies. Experimental evidence is provided to support its practicality. Other simple variants are also examined experimentally and appear to offer similar advantages to RCD. Based upon ideas in RCD we propose general techniques that transparently simulate algorithms developed for the unrealistic multihead disk model so that they can be run on the realistic parallel disk model. The simulation is optimal for two important classes of algorithms; the class of multipass algorithms, which make a complete pass through their data before accessing any element a second time, and the algorithms based upon the well-known distribution paradigm of EM computation.
A Gibbs sampling method to detect over-represented motifs in the upstream regions of co-expressed genes
Authors: Gert Thijs, Kathleen Marchal, Magali Lescot, Stephane Rombauts, Bart De Moor, Pierre Rouzé, Yves Moreau
Venue: Proceedings of the fifth annual international conference on Computational biology (2001)

Microarray experiments can reveal useful information on the transcriptional regulation. We try to find regulatory elements in the region upstream of translation start of coexpressed genes. Here we present a modification to the original Gibbs Sampling algorithm [12]. We introduce a probability distribution to estimate the number of copies of the motif in a sequence. The second modification is the incorporation of a higher-order background model. We have successfully tested our algorithm on several data sets. First we show results on two selected data set: sequences from plants containing the G-box motif and the upstream sequences from bacterial genes regulated by O2-responsive protein FNR. In both cases the motif sampler is able to find the expected motifs. Finally, the sampler is tested on 4 clusters of coexpressed genes from a wounding experiment in Arabidopsis thaliana. We find several putative motifs that are related to the pathways involved in the plant defense mechanism.
The synthetic approach to decision table conversion
Authors: Helmut Schumacher, Kenneth C. Sevcik
Venue: Communications of the ACM (1976)

Previous approaches to the problem of automatically converting decision tables to computer programs have been based on decomposition. At any stage, one condition is selected for testing, and two smaller problems (decision tables with one less condition) are created. An optimal program (with respect to average execution time or storage space, for example) is located only through implicit enumeration of all possible decision trees using a technique such as branch-and-bound. The new approach described in this paper uses dynamic programming to synthesize an optimal decision tree from which a program can be created. Using this approach, the efficiency of creating an optimal program is increased substantially, permitting generation of optimal programs for decision tables with as many as ten to twelve conditions.
Generic text summarization using relevance measure and latent semantic analysis
Authors: Yihong Gong, Xin Liu
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

In this paper, we propose two generic text summarization methods that create text summaries by ranking and extracting sentences from the original documents. The first method uses standard IR methods to rank sentence relevances, while the second method uses the latent semantic analysis technique to identify semantically important sentences, for summary creations. Both methods strive to select sentences that are highly ranked and different from each other. This is an attempt to create a summary with a wider coverage of the document's main content and less redundancy. Performance evaluations on the two summarization methods are conducted by comparing their summarization outputs with the manual summaries generated by three independent human evaluators. The evaluations also study the influence of different VSM weighting schemes on the text summarization performances. Finally, the causes of the large disparities in the evaluators' manual summarization results are investigated, and discussions on human text summarization patterns are presented.
Parallel Adder Design with Reduced Circuit Complexity Using Resonant Tunneling Transistors and Threshold Logic
Authors: Christian Pacha, Oliver Kessler, Peter Glösekötter, Karl F. Goser, Werner Prost, Andreas Brennemann, Uwe Auer, Franz J. Tegude
Venue: Analog Integrated Circuits and Signal Processing (2000)

Quantum-effect devices utilizing resonant tunneling are promising candidates for future nano-scale integration. Originating from the technological progress of semiconductor technology, circuit architectures with reduced complexity are investigated by exploiting the negative-differential resistance of resonant tunneling devices. In this paper a resonant tunneling device threshold logic family based on the Monostable-Bistable Transition Logic Element (MOBILE) is proposed and applied to different parallel adder designs, such as ripple carry and binary carry lookahead adders. The basic device is a resonant tunneling transistor (RTT) composed of a resonant tunneling diode monolithically integrated on the drain contact layer of a heterostructure field effect transistor. On the circuit level the key components are a programmable NAND/NOR logic gate, threshold logic gates, and parallel counters. The special properties of MOBILE logic gates are considered by a bit-level pipelined circuit style. Experimental results are presented for the NAND/NOR logic gate.
Modeling software design diversity: a review
Authors: Bev Littlewood, Peter Popov, Lorenzo Strigini
Venue: ACM Computing Surveys (CSUR) (2001)

Design diversity has been used for many years now as a means of achieving a degree of fault tolerance in software-based systems. While there is clear evidence that the approach can be expected to deliver some increase in reliability compared to a single version, there is no agreement about the extent of this. More importantly, it remains difficult to evaluate exactly how reliable a particular diverse fault-tolerant system is. This difficulty arises because assumptions of independence of failures between different versions have been shown to be untenable: assessment of the actual level of dependence present is therefore needed, and this is difficult. In this tutorial, we survey the modeling issues here, with an emphasis upon the impact these have upon the problem of assessing the reliability of fault-tolerant systems. The intended audience is one of designers, assessors, and project managers with only a basic knowledge of probabilities, as well as reliability experts without detailed knowledge of software, who seek an introduction to the probabilistic issues in decisions about design diversity.