ppxscal/embedding_network huggingface dataset:
On speeding up extended finite state machines using catalyst circuitry
Authors: Shi-Yu Huang
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

We propose a timing optimization technique for a complex finite state machine that consists of not only random logic but also data operators. In such a design, the timing critical path often forms a cycle and thus cannot be cut down easily by popular techniques such as pipelining or retiming. The proposed technique, based on the concept of catalyst, adds a functionally redundant block - which includes a piece of combinational logic and several other registers - to the circuits under consideration so that the timing critical paths are divided into stages. During this transformation, the circuit's functionality is not affected, while the speed is improved significantly. This technique has been successfully applied to an industrial application - a Built-In Self-Test (BIST) circuit for static random access memories (SRAMs). The synthesis result indicates a 47% clock cycle time reduction.
Correct high-level synthesis: a formal perspective
Authors: J. M. Mendías, R. Hermida, M. Fernández
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

This paper presents a formal synthesis system which delegates the design space exploration to non-formal, and perhaps incorrect, high level synthesis tools. With a quadratic complexity, our system obtains either a truly correct-by-construction design, since the formal design process constitutes itself the verification process, or demonstrates that the solution found by the conventional tool was incorrect.
Quantum duck hunt&mdash;a computer game
Authors: Tarun Biswas
Venue: Computing in Science and Engineering (2001)

Historically, useful adult survival skills have often been taught to children through games. In most societies through the ages, warfare and hunting games have been encouraged for boys, and childcare games have been encouraged for girls. Today, you might argue the gender bias of such games and maybe even their usefulness, but you can't ignore the power of games as educational tools.
Interpersonal trust and common ground in electronically mediated communication
Authors: Steve Greenspan, David Goldberg, David Weimer, Andrea Basso
Venue: Proceedings of the 2000 ACM conference on Computer supported cooperative work (2000)

Communication and commerce by web or phone creates benefits and challenges for both buyer and seller. Websites provide convenience and visualization; telephones provide voice and real-time interaction. To combine key elements of these experiences, we developed PhoneChannel. Using PhoneChannel, a PC user while talking on the telephone can display visuals on the other person's television. How do these different media affect the consumer experience? In a recent laboratory study, prospective homebuyers selected houses of interest using web, telephone, or PhoneChannel. Using the telephone or PhoneChannel led to higher trust; but using web or PhoneChannel led to higher ratings on convenience, enjoyment, and 'good method' scales.
Avoiding exponential explosion: generating compact verification conditions
Authors: Cormac Flanagan, James B. Saxe
Venue: ACM SIGPLAN Notices (2001)

Current verification condition (VC) generation algorithms, such as weakest preconditions, yield a VC whose size may be exponential in the size of the code fragment being checked. This paper describes a two-stage VC generation algorithm that generates compact VCs whose size is worst-case quadratic in the size of the source fragment, and is close to linear in practice.This two-stage VC generation algorithm has been implemented as part of the Extended Static Checker for Java. It has allowed us to check large and complex methods that would otherwise be impossible to check due to time and space constraints.
A hierarchical multicast monitoring scheme
Authors: Joerg Walz, Brian Neil Levine
Venue: Proceedings of NGC 2000 on Networked group communication (2000)

Deployment of multicast routing services in corporate networks and Internet Service Providers is still tentative. Among other problems, there is a lack of monitoring and management tools and systems. Previous work in multicast management has failed to address the scalability problem present in multicast fault isolation and reporting. We propose a hierarchical, passive monitoring scheme, HPMM, that relies on a series of pre-deployed, self-organized monitoring daemons. With HPMM, fault message aggregation and local fault detection and isolation is more efficient than previous approaches. HPMM satisfies a number of design goals: scalable reporting; fault isolation; no dependencies on multicast routing for reporting; and no modifications to existing routing or diagnosis protocols are required. The tradeoff of using HPMM is it leverages a large number of software daemons deployed through out a local domain. We compare the signalling overhead of HPMM and previous work with a simulation.
A Continuous Time Auto-Zero Offset Compensated Switched Capacitor Integrator
Authors: G. Roientan Lahiji, M. Atri Ebrahimpour
Venue: Analog Integrated Circuits and Signal Processing (2000)

A continous mode CMOS switched capacitor integrator with almost zero offset is presented. The offset is compensated using an auto-zero technique and proper circut elements have been used to attenuate disturbances due to charge injection and clock feedthrough. The circuit includes two parallel paths which operate alternately in order to integrate in one path while compensating the offset in the other path. The circuit is capable of removing the offset voltage and its integral, and many other spurious signals at the output. The designed integrator has an initial offset of about &minus;250 &mu;V which raises to an amount of about &minus;400 &mu;V after one second of integration.
Morphable Models for the Analysis and Synthesis of Complex Motion Patterns
Authors: Martin A. Giese, Tomaso Poggio
Venue: International Journal of Computer Vision (2000)

The linear combination of prototypical views provides a powerful approach for the recognition and the synthesis of images of stationary three-dimensional objects. In this article, we present initial results that demonstrate that similar ideas can be developed for the recognition and synthesis of complex motion patterns. We present a technique that permits to represent complex motion or action patterns by linear combinations of a small number of prototypical image sequences. We demonstrate the applicability of this new approach for the synthesis and analysis of biological motion using simulated and real video data from different locomotion patterns. Our results show that complex motion patterns are embedded in pattern spaces with a defined topological structure, which can be uncovered with our methods. The underlying pattern space seems to have locally, but not globally, the properties of a linear vector space. We show how the knowledge about the topology of the pattern space can be exploited during pattern recognition. Our method may provide a new interesting approach for the analysis and synthesis of video sequences and complex movements.
SIMULA: an ALGOL-based simulation language
Authors: Ole-Johan Dahl, Kristen Nygaard
Venue: Communications of the ACM (1966)

This paper is an introduction to SIMULA, a programming language designed to provide a systems analyst with unified concepts which facilitate the concise description of discrete event systems. A system description also serves as a source language simulation program. SIMULA is an extension of ALGOL 60 in which the most important new concept is that of quasi-parallel processing.
Scalable parallel coset enumeration using bulk definition
Authors: Gene Cooperman, Victor Grinberg
Venue: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (2001)

Several researchers have worked on parallel coset enumeration strategies using shared memory. This is important not only for speed, but also because the large memory requirements of coset enumeration often make memory the dominant cost, and this cost can be reduced by using many CPU's to reduce the time during which this memory must be &ldquo;rented&rdquo;. We take as our testbed an enumeration of Lyons's group (approximately 8.87 million cosets). Lyons's group is one of the largest enumerations carried out in the literature. Previous enumerations of this group in the literature do not appear to scale well as the number of processors increase, with speedups such as a factor of 2 using 4 processors and a speedup of 4 using 16 processors. By using what we call bulk definition of cosets, we achieve nearly linear speedup of the parallel portion of our program. This result depends on two new heuristics for bulk coset definition, clouds and prescan, and a theorem showing that when using parallelized bulk coset definition, the enumeration, including the order in which cosets are defined, is independent of the number of processors used for parallelization. A total computation of 9.4 hours = 473 min. (clouds phase) + 41 min. (prescan phase) is reduced using 32 processors to 23 min. (clouds, par.) + 50 min. (clouds, seq.) + 41 min. (prescan). Parallel timings are presented for the clouds phase, while the prescan phase will be parallelized at a later date. The parallelization of our coset enumeration software was achieved using TOP-C. Some of these ideas may also be useful in parallelizations of related algorithms, such as Gr&ouml;bner bases and Knuth-Bendix.
Reducing the retrieval time of hashing method by using predictors
Authors: Seiichi Nishihara, Katsuo Ikeda
Venue: Communications of the ACM (1983)

Many methods for resolving collisions in hashing techniques have been proposed. They are classified into two main categories: open addressing and chaining. In this paper, other methods are presented that are intermediate between the two categories. The basic idea of our methods is the use of one or more predictors reserved per cell instead of a link field as in the chaining method. The predictors are used to maintain loose synonym chains. After describing the methods, the efficiencies are estimated theoretically and verified experimentally. In comparison with the chaining method, we prove that our methods significantly reduce the average number of probes necessary to retrieve a key without expending extra space.
File-handling within FORTRAN
Authors: Malcolm C. Harrison
Venue: Communications of the ACM (1965)

This note describes some FORTRAN subroutines to facilitate handling of tape files. They allow symbolic naming or information files, without violating the casual scientific programmer's idea of simplicity. Some comments on two years use of these subroutines are given.
Some basic determinants of computer programming productivity
Authors: Earl Chrysler
Venue: Communications of the ACM (1978)

The purpose of this research was to examine the relationship between processing characteristics of programs and experience characteristics of programmers and program development time. The ultimate objective was to develop a technique for predicting the amount of time necessary to create a computer program. The fifteen program characteristics hypothesized as being associated with an increase in programming time required are objectively measurable from preprogramming specifications. The five programmer characteristics are experience-related and are also measurable before a programming task is begun. Nine program characteristics emerged as major influences on program development time, each associated with increased program development time. All five programmer characteristics were found to be related to reduced program development time. A multiple regression equation which contained one programmer characteristic and four program characteristics gave evidence of good predictive power for forecasting program development time.
Wireless ad hoc multicast routing with mobility prediction
Authors: Sung-Ju Lee, William Su, Mario Gerla
Venue: Mobile Networks and Applications (2001)

An ad hoc wireless network is an infrastructureless network composed of mobile hosts. The primary concerns in ad hoc networks are bandwidth limitations and unpredictable topology changes. Thus, efficient utilization of routing packets and immediate recovery of route breaks are critical in routing and multicasting protocols. A multicast scheme, On-Demand Multicast Routing Protocol (ODMRP), has been recently proposed for mobile ad hoc networks. ODMRP is a reactive (on-demand) protocol that delivers packets to destination(s) on a mesh topology using scoped flooding of data. We can apply a number of enhancements to improve the performance of ODMRP. In this paper, we propose a mobility prediction scheme to help select stable routes and to perform rerouting in anticipation of topology changes. We also introduce techniques to improve transmission reliability and eliminate route acquisition latency. The impact of our improvements is evaluated via simulation.
Improving locality by critical working sets
Authors: Domenico Ferrari
Venue: Communications of the ACM (1974)

A new approach to program locality improvement via restructuring is described. The method is particularly suited to those systems where primary memory is managed according to a working set strategy. It is based on the concept of critical working set, a working set which does not contain the next memory reference. The data the method operates upon are extracted from a trace of the program to be restructured. It is shown that, except in some special cases, the method is not optimum. However, the experimental results obtained by using the method to restructure an interactive text editor and the file system module of an operating system have shown its substantial superiority over the other methods proposed in the literature.
Dynamic-CBT and ChIPS&mdash;router support for improved multimedia performance on the Internet
Authors: Jae Chung, Mark Claypool
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

The explosive increase in the volume and variety of Internet traffic has placed a growing emphasis on congestion control and fairness in Internet routers. Approaches to the problem of congestion, such as active queue management schemes like Random Early Detection (RED) use congestion avoidance techniques and are successful with TCP flows. Approaches to the problem of fairness, such as Fair Random Early Drop (FRED), keep per-flow state and punish misbehaved, non-TCP flows. Unfortunately, these punishment mechanisms also result in a significant performance drop for multimedia flows that use flow control. We extend Class-Based Threshold (CRT) [12], and propose a new active queue management mechanism as an extension to RED called Dynamic Class-Based Threshold (D- CBT) to improve multimedia performance on the Internet. Also, as an effort to reduce multimedia jitter, we propose a lightweight packet scheduling called Cut-In Packet Scheduling (ChIPS) as an alternative to FIFO packet scheduling. The performance of our proposed mechanisms is measured, analyzed and compared with other mechanisms (RED and CBT) in terms of throughput, fairness and multimedia jitter through simulation using NS. The study shows that D-CBT improves fairness among different classes of flows and ChIPS improves multimedia jitter without degrading fairness.
Probabilistic temporal databases, I: algebra
Authors: Alex Dekhtyar, Robert Ross, V. S. Subrahmanian
Venue: ACM Transactions on Database Systems (TODS) (2001)

Dyreson and Snodgrass have drawn attention to the fact that, in many temporal database applications, there is often uncertainty about the start time of events, the end time of events, and the duration of events. When the granularity of time is small (e.g., milliseconds), a statement such as &ldquo;Packet p was shipped sometime during the first 5 days of January, 1998&rdquo; leads to a massive amount of uncertainty (5&times;24&times;60&times;60&times;1000) possibilities. As noted in Zaniolo et al. [1997], past attempts to deal with uncertainty in databases have been restricted to relatively small amounts of uncertainty in attributes. Dyreson and Snodgrass have taken an important first step towards solving this problem. In this article, we first introduce the syntax of Temporal-Probabilistic (TP) relations and then show how they can be converted to an explicit, significantly more space-consuming form, called Annotated Relations. We then present a theoretical annotated temporal algebra (TATA). Being explicit, TATA is convenient for specifying how the algebraic operations should behave, but is impractical to use because annotated relations are overwhelmingly large. Next, we present a temporal probabilistic algebra (TPA). We show that our definition of the TP-algebra provides a correct implementation of TATA despite the fact that it operates on implicit, succinct TP-relations instead of overwhemingly large annotated relations. Finally, we report on timings for an implementation of the TP-Algebra built on top of ODBC.
Validation of an Augmented Lagrangian Algorithm with a Gauss-Newton Hessian Approximation Using a Set of Hard-Spheres Problems
Authors: Nataša Krejić, José Mario Martínez, Margarida Mello, Elvio A. Pilotta
Venue: Computational Optimization and Applications (2000)

An Augmented Lagrangian algorithm that uses Gauss-Newton approximations of the Hessian at each inner iteration is introduced and tested using a family of Hard-Spheres problems. The Gauss-Newton model convexifies the quadratic approximations of the Augmented Lagrangian function thus increasing the efficiency of the iterative quadratic solver. The resulting method is considerably more efficient than the corresponding algorithm that uses true Hessians. A comparative study using the well-known package LANCELOT is presented.
Syntactic accidents in program analysis: on the impact of the CPS transformation
Authors: Daniel Damian, Olivier Danvy
Venue: Proceedings of the fifth ACM SIGPLAN international conference on Functional programming (2000)

We show that a non-duplicating CPS transformation has no effect on control-flow analysis and that it has a positive effect on binding-time analysis: a monovariant control-flow analysis yields equivalent results on a direct-style program and on its CPS counterpart, and a monovariant binding-time analysis yields more precise results on a CPS program than on its direct-style counterpart. Our proof technique amounts to constructing the continuation-passing style (CPS) counterpart of flow information and of binding times.Our results confirm a folklore theorem about binding-time analysis, namely that CPS has a positive effect on binding times. What may be more surprising is that this benefit holds even if contexts or continuations are not duplicated.The present study is symptomatic of an unsettling property of program analyses: their quality is unpredictably vulnerable to syntactic accidents in source programs, i.e., to the way these programs are written. More reliable program analyses require a better understanding of the effect of syntactic change.
On estimating end-to-end network path properties
Authors: Mark Allman, Vern Paxson
Venue: Workshop on Data communication in Latin America and the Caribbean (2001)

The more information about current network conditions available to a transport protocol, the more efficiently it can be use the network to transfer its data. In networks such as the Internet, the transport protocol must often form its own estimates of network properties based on measurements performed by the connection endpoints. We consider two basic transport estimation problems: determination the setting of the retransmission timer (RTO) for a reliable protocol, and estimating the bandwidth available to a connection as it begins. We look at both of these problems in the context of TCP, using a large TCP measurement set [Pax97b] for trace-driven simulations. For RTO estimation, we evaluate a number of different algorithms, finding that the performance of the estimators is dominated by their minimum values, and to a lesser extent, the timer granularity, while being virtually unaffected by how often round-trip time measurements are made or the settings of the parameters in the exponentially-weighted moving average estimators commonly used. For bandwidth estimation, we explore techniques previously sketched in the literature [Hoe96, AD98] and find that in practice they perform less well than anticipated. We then develop a receiver-side algorithm that performs significantly better.
Dynamic planar convex hull operations in near-logarithmic amortized time
Authors: Timothy M. Chan
Venue: Journal of the ACM (JACM) (2001)

We give a data structure that allows arbitrary insertions and deletions on a planar point set P and supports basic queries on the convex hull of P, such as membership and tangent-finding. Updates take O(log1+&egr;n) amori tzed time and queries take O (log n time each, where n is the maximum size of P and &egr; is any fixed positive constant. For some advanced queries such as bridge-finding, both our bounds increase to O(log3/2n). The only previous fully dynamic solution was by Overmars and van Leeuwen from 1981 and required O(log2n) time per update and O(log n) time per query.
The Linux Telephony Kernel API
Authors: Greg Herlein
Venue: Linux Journal (2001)

Herlein explains the integration of the telephony device driver into the Linux kernel.
Least-Squares Mixed Finite Element Solution of Variably Saturated Subsurface Flow Problems
Authors: Gerhard Starke
Venue: SIAM Journal on Scientific Computing (1999)

A least-squares mixed finite element formulation is applied to the nonlinear elliptic problems arising in each time-step of an implicit Euler discretization for variably saturated flow problems. This approach simultaneously constructs approximations to the flux in Raviart--Thomas spaces and to the hydraulic potential by standard H1-conforming linear finite elements. Two important properties of the least-squares approach are investigated in detail: the local least-squares functional provides an a posteriori error estimator and Gauss--Newton methods are robust iterative solvers for the resulting nonlinear least-squares problems. Computational experiments conducted for a realistic water table recharge problem illustrate the effectiveness of this approach.
Towards an integrated, web-executable parallel programming tool environment
Authors: Insung Park, Nirav H. Kapadia, Renato J. Figueiredo, Rudolf Eigenmann, José A. B. Fortes
Venue: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) (2000)

We present a new parallel programming tool environment that is (1) accessible and executable &ldquo;anytime, anywhere,&rdquo; through standard Web browsers and (2) integrated in that it provides tools which adhere to a common underlying methodology for parallel programming and performance tuning. The environment is based on a new network computing infrastructure developed at Purdue University. We evaluate our environment qualitatively by comparing our tool access method with conventional schemes of software download and installation. We also quantitatively evaluate the efficiency of interactive tool access in our environment. We do this by measuring the response times of various functions of the Ursa Minor tool and compare them with those of a Java Applet-based "anytime, anywhere" tool access method. We found that our environment offers significant advantages in terms of tool accessibility, integration, and efficiency.