ppxscal/embedding_network huggingface dataset:
I/O and performance tradeoffs with the FunctionBus during multi-FPGA partitioning
Authors: Frank Vahid
Venue: Proceedings of the 1997 ACM fifth international symposium on Field-programmable gate arrays (1997)

We improve upon a new approach for automatically partitioning a system among several FPGAs. The new approach partitions a system's functional specification, now commonly available, rather than its structural implementation. The improvement uses a bus, the FunctionBus, for implementing function calls among FPGA's, The bus can be used with any number of and its protocol uses only a small amount of existing FPGA hardware, requiring no special hardware. While functional rather than structural partitioning can substantially reduce the number of input/output pins using (I/O) the FunctionBus takes such reduction even further. In particular, performance and I/0can be traded-off by varying the bus size, as demonstrated using several examples.
Optimal Updating of Forecasts for the Timing of Future Events
Authors: Juhwen Hwang, Medini R. Singh, W. J. Hurley, Robert A. Shumsky
Venue: Management Science (1998)

A major problem in forecasting is estimating the time of some future event. traditionally, forecasts are designed to minimize an error cost function that is evaluated once, possibly when the event occurs and forecast accuracy can be determined. However, in many applications forecast error costs accumulate over time, and the forecasts themselves may be updated with information that is collected as the expected time of the event approaches. This paper examines one such application, in which flow control managers in the U.S. air traffic system depend on forecasts of aircraft departure times to predict and alleviate potential congestion. These forecasts are periodically updated until take-off occurs, although the number of updates may be limited by the cost of collecting, processing, and distributing information. The procedures developed in this paper balance the costs of accumulated forecast errors and the costs of forecast updates. The procedures are applied to the aircraft departure forecasting problem and are compared with methods currently used by the air traffic management system. Numerical examples demonstrate that the procedures increase forecast accuracy while reducing the costs associated with frequent forecast updates.
O(n)-Depth Modular Exponentiation Circuit Algorithm
Authors: Takafumi Hamano, Naofumi Takagi, Shuzo Yajima, Franco P. Preparata
Venue: IEEE Transactions on Computers (1997)

An O(n)-depth polynomial-size combinational circuit algorithm is proposed for n-bit modular exponentiation, i.e., for the computation of xy mod m for arbitrary integers x, y, and m represented as n-bit binary integers, within bounds 2n¿1¿m
The Adaptive Verlet Method
Authors: Weizhang Huang, Benedict Leimkuhler
Venue: SIAM Journal on Scientific Computing (1997)

We discuss the integration of autonomous Hamiltonian systems via dynamical rescaling of the vector field (reparameterization of time). Appropriate rescalings (e.g., based on normalization of the vector field or on minimum particle separation in an N-body problem) do not alter the time-reversal symmetry of the flow, and it is desirable to maintain this symmetry under discretization. For standard form mechanical systems without rescaling, this can be achieved by using the explicit leapfrog--Verlet method; we show that explicit time-reversible integration of the reparameterized equations is also possible if the parameterization depends on positions or velocities only. For general rescalings, a scalar nonlinear equation must be solved at each step, but only one force evaluation is needed. The new method also conserves the angular momentum for an N-body problem. The use of reversible schemes, together with a step control based on normalization of the vector field (arclength reparameterization), is demonstrated in several numerical experiments, including a double pendulum, the Kepler problem, and a three-body problem.
Some characterizations of families of surfaces using functional equations
Authors: Enrique Castillo, Andrés Iglesias
Venue: ACM Transactions on Graphics (TOG) (1997)

In this article functional equations are used to characterize some families of surfaces. First, the most general surfaces in implicit form f(x, y, z) = 0, such that any arbitrary intersection with the planes z = z0, y = y0, and x = x0 are linear combinations of sets of functions of the other two variables, are characterized. It is shown that only linear combinations of tensor products of univariate functions are possible for fx, y, z). Second, we obtain the most general families of surfaces in explicit form such that their intersections with planes parallel to the planes y = 0 and x = 0 belong to two, not necessarily equal, parametric families of curves. Finally, functional equations are used to analyze the uniqueness of representation of Gordon-Coon surfaces. Some practical examples are used to illustrate the theoretical results.
Everything you wanted to know about the running time of Mergesort but were afraid to ask
Authors: Ian Parberry
Venue: ACM SIGACT News (1998)

Although mergesort is an algorithm that is frequently glossed over in textbooks, it provides fertile ground for planting ideas about algorithm analysis in the minds of students. Why can we assume that n is a power of 2? How big is the increase in constant multiple if we do? And how do we analyze it if we don't? Here then is an excruciatingly detailed analysis of mergesor t for the student whose enquiring mind truly wants to know.
Geodesic Active Contours
Authors: Vicent Caselles, Ron Kimmel, Guillermo Sapiro
Venue: International Journal of Computer Vision (1997)

A novel scheme for the detection of object boundaries is presented. The technique is based on active contours evolving in time according to intrinsic geometric measures of the image. The evolving contours naturally split and merge, allowing the simultaneous detection of several objects and both interior and exterior boundaries. The proposed approach is based on the relation between active contours and the computation of geodesics or minimal distance curves. The minimal distance curve lays in a Riemannian space whose metric is defined by the image content. This geodesic approach for object segmentation allows to connect classical &ldquo;snakes&rdquo; based on energy minimization and geometric active contours based on the theory of curve evolution. Previous models of geometric active contours are improved, allowing stable boundary detection when their gradients suffer from large variations, including gaps. Formal results concerning existence, uniqueness, stability, and correctness of the evolution are presented as well. The scheme was implemented using an efficient algorithm for curve evolution. Experimental results of applying the scheme to real images including objects with holes and medical data imagery demonstrate its power. The results may be extended to 3D object segmentation as well.
On the Error-Reject Trade-Off in Biometric Verification Systems
Authors: Matteo Golfarelli, Dario Maio, Davide Maltoni
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

In this work, we address the problem of performance evaluation in biometric verification systems. By formulating the optimum Bayesian decision criterion for a verification system and by assuming the data distributions to be multinormals, we derive two statistical expressions for calculating theoretically the false acceptance and false rejection rates. Generally, the adoption of a Bayesian parametric model does not allow for obtaining explicit expressions for the calculation of the system errors. As far as biometric verification systems are concerned, some hypotheses can be reasonably adopted, thus allowing simple and affordable expressions to be derived. By using two verification system prototypes, based on hand shape and human face, respectively, we show our results are well founded.
DIGITAC III digital flight control system
Authors: Richard T. Gallivan, Tom McMannus
Venue: Proceedings of the conference on TRI-ADA '90 (1990)

Implementation of fault-tolerance in an exclusively Ada flight-control system for the YA-7D aircraft. Software support tools, compilers, and software maintenance will be discussed.
HCI and simulation packages
Authors: Jasna Kuljis
Venue: Proceedings of the 28th conference on Winter simulation (1996)

Computer-based simulation modelling is one of the domains that is particularly demanding in terms of user interfaces. Issues that influence the 'usability' of such systems are examined. Several representative systems were investigated in order to generate some general assumptions with respect to those characteristics of user interfaces employed in simulation systems. There is a need for simulation systems that can support the developments of simulation models in many domains, which are not supported by contemporary simulation software. Many user interface deficiencies are discovered and reported. Proposals are made on how user interfaces for simulation systems can be enhanced to match better the needs specific to the domain of simulation modelling, and on how better to support users in simulation model developments.
Architecture and Design of 1-D Enhanced Cellular NeuralNetwork Processors for Signal Detection
Authors: Michelle Y. Wang, Bing J. Sheu, Theodore W. Berger, Wayne C. Young, Austin K. Cho
Venue: Analog Integrated Circuits and Signal Processing (1998)

One-dimensional cellular array processor architecture and design for neural-based partial response (PR) signal detection are presented. Analog parallel computing approaches have many attractive advantages in achieving low power, low cost, and faster processing speed by its uniquely coupled parallel and distributed processing nature. In this paper, we describe the maximum likelihood sequence estimation (MLSE) algorithm for PR signals, the enhanced Cellular Neural Network (CNN) processor array architecture to realize the detection algorithm, and system performance evaluation. Analytical models and simulations on a design example of the detector have been employed to demonstrate the advantages of this scalable VLSI architecture. A processing rate of 265 Mbps was achieved for a prototype detector on a silicon area of 5.14 mm by 5.81 mm is a 1.2 &micro;m CMOS technology. The processing rate can be beyond 1Gbps if it is implemented in the same amount of silicon area by using 0.5 &micro;m CMOS technology. Such promising results clearly demonstrate the ability to meet the needs in future high speed data communication by VLSI realization of maximum likelihood sequence detectors based on the enhanced cellular neural network paradigm.
Parameter Estimation in the Presence of Bounded Data Uncertainties
Authors: S. Chandrasekaran, G. H. Golub, M. Gu, A. H. Sayed
Venue: SIAM Journal on Matrix Analysis and Applications (1998)

We formulate and solve a new parameter estimation problem in the presence of data uncertainties. The new method is suitable when a priori bounds on the uncertain data are available, and its solution leads to more meaningful results, especially when compared with other methods such as total least-squares and robust estimation. Its superior performance is due to the fact that the new method guarantees that the effect of the uncertainties will never be unnecessarily over-estimated, beyond what is reasonably assumed by the a priori bounds. A geometric interpretation of the solution is provided, along with a closed form expression for it. We also consider the case in which only selected columns of the coefficient matrix are subject to perturbations.
Pavlov: an interface builder for designing animated interfaces
Authors: David Wolber
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (1997)

Conventional interface builders provide little support for interactive development of interfaces with application-specific graphics. Some Programming by Demonstration (PBD) systems do provide such support, but none provide full support for demonstrating interfaces, such as those in games, in which the graphics are animated. This article proposes a number of techniques for creating animated interfaces, all of which have been included in an exploratory system, Pavlov. Many of the techniques are based on the addition of timing controls to a form of PBD called stimulus-response demonstration. Others are based on an adaptation of a traditional animation time-line that integrates end-user interaction with animation. The article also evaluates Pavlov with (1) a comparison to other PBD systems in terms of the behaviors that can be specified interactively and (2) a report on an informal user study comparing development in Pavlov to development in a conventional interface builder.
Automatic generation of synchronous test patterns for asynchronous circuits
Authors: Oriol Roig, Jordi Cortadella, Marco A. Peña, Enric Pastor
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

This paper presents a novel approach for automatic test patterngeneration of asynchronous circuits. The techniques used for thispurpose assume that the circuit can only be exercised by applyingsynchronous test vectors, as is done by real-life testers.The main contribution of the paper is the abstraction of thecircuit's behavior as a synchronous finite state machine in such away that similar techniques to those currently used for synchronouscircuits can be safely applied for testing.Currently, the fault model being used is the input stuck-at model.Experimental results on different benchmarks show that our approachgenerates test vectors with high fault coverage.
Applications of a logic of knowledge to motion planning under uncertainty
Authors: Ronen I. Brafman, Jean-Claude Latombe, Yoram Moses, Yoav Shoham
Venue: Journal of the ACM (JACM) (1997)

Inspired by the success of the distributed computing community in apply logics of knowledge and time to reasoning about distributed protocols, we aim for a similarly powerful and high-level abstraction when reasoning about control problems involving uncertainty. This paper concentrates on robot motion planning with uncertainty in both control and sensing, a problem that has already been well studied within the robotics community. First, a new and natural problem in this domain is defined: does there exists a sound and complete termination condition for a motion, given initial and goal locations? If yes, how to construct it? Then we define a high-level language, a logic of time and knowledge, which we use to reason about termination conditions and to state general conditions for the existence of sound and complete termination conditions in a broad domain. Finally, we show that sound termination conditions that are optimal in a precise sense provide a natural example of knowledge-based programs with multiple implementations.
Disjunctive program analysis for algebraic data types
Authors: Thomas Jensen
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1997)

We describe how binding-time, data-flow, and strictness analyses for languages with higher-order functions and algebraic data types can be obtained by instantiating a generic program logic and axiomatization of the properties analyzed for. A distinctive feature of the analyses is that disjunctions of program properties are represented exactly. This yields analyses of high precision and provides a logical characterization of abstract interpretations involving tensor products and uniform properties of recursive data structures. An effective method for proving properties of a program based on fixed-point iteration is obtained by grouping logically equivalent formulae of the same type into equivalence classes, obtaining a lattice of properties of that type, and then defining an abstract interpretation over these lattices. We demonstrate this in the case of strictness analysis by proving that the strictness abstract interpretation of a program is the equivalence class containing the strongest property provable of the program in the strictness logic.
Global Positioning System (GPS) Time Dissemination for Real-Time Applications
Authors: Peter H. Dana
Venue: Real-Time Systems (1997)

This paper presents an overview of the Global Positioning System (GPS) for the potential precise time and time interval user with special reference to real-time systems. An overview of GPS operation is presented, and GPS error sources are described as they relate to the timing user. A review of receiver types and receiver tasks provides the basis for understanding GPS time transfer techniques. The accuracies provided by different techniques are reviewed and the special requirements for GPS time and frequency receivers as well as modern timing receiver enhancements are described. The precise time standard provided by GPS is traced through its path from global standards to the user application. GPS time dissemination failure modes that result from control problems, space craft failures, and receiver failures are outlined.
Expokit: a software package for computing matrix exponentials
Authors: Roger B. Sidje
Venue: ACM Transactions on Mathematical Software (TOMS) (1998)

Expokit provides a set of routines aimed at computing matrix exponentials. More precisely, it computes either a small matrix exponential in full, the action of a large sparse matrix exponential on an operand vector, or the solution of a system of linear OBEs with constant inhomogeneity. The backbone of the sparse routines consists of matrix-free Krylov subspace projection methods (Arnoldi and Lanczos processes), and that is why the toolkit is capable of coping with sparse matrices of large dimension. The software handles real and complex matrices and provides specific routines for symmetric and Hermitian matrices. The computation of matrix exponentials is a numerical issue of critical importance in the area of Markov chains and furthermore, the computed solution is subject to probabilistic constraints. In addition to addressing general matrix exponentials, a distinct attention is assigned to the computation of transient states of Markov chains.
Prospective payment: a simulation model of management strategies
Authors: Jose A. Sepulveda
Venue: Proceedings of the 17th conference on Winter simulation (1985)

A simulation model developed to evaluate the financial effects of different management policies to face Medicare's Prospective Payment System is presented. This payment system, enacted by the Tax Equity and Fiscal Responsibility Act (TEFRA) of 1982, limits Medicare's reimbursement per patient to a fixed amount depending on the patient's particular type of disease. The reimbursement is based on a set of Diagnosis Related Groups (DRGs), which categorizes patients into disease classifications. As a result, hospitals must make efficiency gains and managers must look for new ways to provide quality care while containing cost. SLAM was the simulation language of choice. The network and discrete event portions are described in detail. The approach used to select specific DRGs for the analysis, as well as the statistical models used, preparation of input data, simulation routines and results of two runs are presented to illustrate how policies are simulated and results interpreted.
An empirical study of on-chip parallelism
Authors: Mary L. Bailey, Lawrence Snyder
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

This paper presents a methodology for empirically determining the amount of parallelism on a CMOS VLSI chip. Six chips are measured, and the effect of input choice and circuit size is studied. The unexpectedly low parallelism measured here suggests that certain strategies for parallel simulators may be doomed, and earlier efforts to extrapolate parallelism from small circuits to large circuits may have been overly optimistic.
Available paralellism in video applications
Authors: Heng Liao, Andrew Wolfe
Venue: Proceedings of the 30th annual ACM/IEEE international symposium on Microarchitecture (1997)

Most recent research in instruction-level parallelism has focused on general-purpose applications such as the SPEC benchmarks. Many quantitative experiments have been performed over the years measuring the impact of different execution models and optimization techniques on these applications. Researchers have been developing various ILP architectures for media processors in order to exploit parallelism in audio, video, and graphics applications. It has been assumed that these applications contain far more potential parallelism than general-purpose code, but there have been few attempts to quantify the available parallelism. We present a linear complexity global scheduling algorithm that can process very long traces up to 1 billion operations. Therefore, traces of video applications such as MPEG1, MPEG2, MPEG4 and H.263 encoders and decoders can be analyzed. Using an idealized execution model, speedups of over 1000 have been found in some applications. The experiment shows that eliminating currently identifiable bottlenecks can allow the exploitation of huge amounts of ILP in audio and video applications.
Analyzing Partially-Implemented Real-Time Systems
Authors: George S. Avrunin, James C. Corbett, Laura K. Dillon
Venue: IEEE Transactions on Software Engineering (1998)

Most analysis methods for real-time systems assume that all the components of the system are at roughly the same stage of development and can be expressed in a single notation, such as a specification or programming language. There are, however, many situations in which developers would benefit from tools that could analyze partially-implemented systems, those for which some components are given only as high-level specifications while others are fully implemented in a programming language. In this paper, we propose a method for analyzing such partially-implemented real-time systems. Here we consider real-time concurrent systems for which some components are implemented in Ada and some are partially specified using regular expressions and Graphical Interval Logic (GIL), a real-time temporal logic. We show how to construct models of the partially-implemented systems that account for such properties as run-time overhead and scheduling of processes, yet support tractable analysis of nontrivial programs. The approach can be fully automated, and we illustrate it by analyzing a small example.
A man-machine interface simulator
Authors: S. L. Morgan, J. J. Kindon, A. Nauda
Venue: Proceedings of the 17th conference on Winter simulation (1985)

An improved software development tool for the simulation and development of man/machine interfaces is described. The Man/Machine Interface Simulation Tool (MMIST) is a versatile, interactive software system which resides in a VAX 11/780 with a device independent graphics package. With this advanced capability, designers can develop and demonstrate detailed interactive displays/menus and processing sequences early in the software design phase. MMIST capabilities include a robust display/menu construction tool set, a friendly interface for inexperienced users, and a strong simulation capability to allow end users to examine and critique the menu hierarchies and display formats before any production software is generated. The use of MMIST is demonstrated through sample menus and graphic output. Simulation capabilities are illustrated with examples of selected display sequence simulations.
The Structure of Nonthin Irreducible T-modulesof Endpoint 1: Ladder Bases and Classical Parameters
Authors: S. Hobart, T. Ito
Venue: Journal of Algebraic Combinatorics: An International Journal (1998)

Building on the work of Terwilliger, we find the structure of nonthin irreducible T-modules of endpoint 1 for P- and Q-polynomial association schemes with classical parameters. The isomorphism class of such a given module is determined by the intersection numbers of the scheme and one additional parameter which must be an eigenvalue for the first subconstituent graph. We show that these modules always have what we call a ladder basis, and find the structure explicitly for the bilinear, Hermitean, and alternating forms schemes.