Numerical software, common in scientific computing or embedded systems, inevitably uses a finiteprecision approximation of the real arithmetic in which most algorithms are designed. In many applications, the roundoff errors introduced by finite-precision arithmetic are not the only source of inaccuracy, and measurement and other input errors further increase the uncertainty of the computed resu...

Queuing is a common phenomenon in theme parks which negatively affects visitor experience and revenue yields. There is thus a need for park operators to infer the real queuing delays without expensive investment in human effort or complex tracking infrastructure. In this paper, we depart from the classical queuing theory approach and provide a data-driven and online approach for estimating the ...

An important problem that arises in different areas of science and engineering is that of computing limits of sequences of vectors fxmg, where xm 2C, and the dimension N is very large in many applications. Such vector sequences arise, for example, in the numerical solution of very large systems of linear or nonlinear equations by fixedpoint iterative methods, and limm!1xm are simply the require...

As part of ongoing research at the CU-Boulder Fast Hybrid Testing laboratory, new methods are examined which can improve the hybrid testing process. One such method involves the use of a Field-Programmable Gate-Array (FPGA) which is capable of performing simulation computations on hundreds of degrees-of-freedom (DOFs), enabling the simulation of extremely complicated structures. While the curre...

Fixed-point hardware implementations of signal processing algorithms can often achieve higher performance with lower computational requirements than a floating-point implementation. However, the design of such systems is hard due to the difficulty of addressing the quantization issues. This paper presents an optimization approach to determining the wordlengths of fixed-point operators in a spee...

While SAT-based algorithms have largely displaced BDD-based verification techniques due to their typically higher scalability, there are classes of problems for which BDDbased reachability analysis is the only existing method for an automated solution. Nonetheless, reachability engines require a high degree of tuning to perform well on challenging benchmarks. In addition to clever partitioning ...

In this paper we describe the design of a voice-enabled interface embedded in a Personal Digital Assistant (PDA). It is a component of a more complex system which allows the access to real-time information (for example, prices on stock exchange) via the General Packet Radio Service (GPRS). Specifically, we have focused on the Automatic Speech Recognition (ASR) module: we have implemented a fixe...

In this paper, we present a novel method for designing polynomial-predictive FIR differentiators for fixed-point environments. Our method yields filters that exactly fulfill the given constraints even with short coefficient word lengths. Under ordinary quantization, either by rounding or truncation, these filters in most cases loose their predictive and/or differentiating properties, making the...

In this paper, we develop a multidimensional companding scheme for the preceptual distortion measure by S. van de Par [1]. The scheme is asymptotically optimal in the sense that it has a vanishing rate-loss with increasing vector dimension. The compressor operates in the frequency domain: in its simplest form, it pointwise multiplies the Discrete Fourier Transform (DFT) of the windowed input si...