16506342
Error bounds for complementarity problems with tridiagonal nonlinear functions
In this paper we consider the complementarity problem NCP(f) with f(x) = Mx + φ(x), where M ∈ Rn×n is a real matrix and φ is a so-called tridiagonal (nonlinear) mapping. This problem occurs, for example, if certain classes of free boundary problems are discretized. We compute error bounds for approximations $${\hat x}$$ to a solution x* of the discretized problems. The error bounds are improved by an iterative method and can be made arbitrarily small. The ideas are illustrated by numerical experiments.
6918514
Validation and enclosure of solutions of linear complementarity problems
An inclusion condition is presented to guarantee the existence of the solution of the linear complementarity problem in a given domain. The condition can be tested numerically with very small computational cost. Based on the condition algorithms are designed to compute an interval to enclose the unknown solution. Numerical results are reported to support the theoretical analysis in the paper.
26873860
Decomposition of Multiple-Valued Relations
This paper presents a new decomposi tion problem decomposition of multi valued MV re lations and a method of its solution Decomposition is non disjoint and multi level A fundamental di erence in decomposition of MV functions and MV relations is discussed the column cofactor pair compatibil ity translates to the group compatibility for functions but not for relations This makes the decomposition of relations more di cult The method is especially e cient for strongly unspeci ed data typical for Ma chine Learning ML It is implemented in program GUD MV
15697716
Walk to here: a voice driven animation system
We present a novel interface for directing the actions of computer animated characters and camera movements. Our system takes spoken input in combination with mouse pointing to generate desired character animation based on motion capture data. The aim is to achieve a more natural animation interface by supporting the types of dialogue and pointing that might be used when one person is explaining a desired motion to another person. We compare our voice-driven system with a button-driven animation interface that has equivalent capabilities. An informal user study indicates that for the test scenarios, the voice-user interface (VUI) is faster than an equivalent graphical user interface (GUI). Potential applications include storyboarding for film or theatre, directing characters in video games, and scene reconstruction.
13369239
On Solving the Inverse Scattering Problem with RBF Neural Networks: Noise-Free Case
Neural networks are successfully used to determine small particle properties from knowledge of the scattered light – an inverse light scattering problem. This type of problem is inherently difficult to solve as it is represented by a highly ill-posed function mapping. This paper presents a technique that solves the inverse light scattering problem for spheres using Radial Basis Function (RBF) neural networks. A two-stage network architecture is arranged to enhance network approximation capability. In addition, a new approach to computing basis function parameters with respect to the inverse scattering problem is demonstrated. The technique is evaluated for noise-free data through simulations, in which a minimum 99.06% approximation accuracy is achieved. A comparison is made between the least square and the orthogonal least square training methods.
23478055
1-V ultra-low-power CMOS LC VCO for UHF quadrature signal generation
Design, implementation, and simulation of ultra-low-power LC-VCOs with quadrature signal generation are presented, as well as the analysis and the comparison of several different VCO topologies. The VCO topology having the best performance is then used further for quadrature signal generation. Based on a 0.18mum RF/mixed-signal CMOS process, the VCOs are simulated using 1V supply voltage. It is demonstrated that the N- & P- MOS cross-coupled pair VCO with balance resistors operating at 1.6GHz has a power consumption of 0.1mW with as low as -121 dBc/Hz of phase noise at 1-MHz offset. To generate the quadrature signals at 400MHz, N- & P- MOS pair VCOs at the frequency of 400MHz, 800MHz, 1.6GHz, divide-by-two, and divide-by-four circuits are implemented and compared. It turns out that the frequency dividers degrade the phase noise. Comparison of FOMs shows that VCO at 800MHz followed by a divide-by-two is the best choice for quadrature signal generation at 400 MHz, achieving 177muW for the VCO and 25muW for the divider. The phase noise is -127dBc/Hz at 1-MHz offset
28124507
Fast unified computation of the multi-dimensional discrete sinusoidal transforms
Based on a one-to-one index mapping approach, conversions of two types of m-dimensional discrete W transforms into the multiple sums involving a number of one-dimensional discrete W transforms (1-D DWTs) are first presented. A unified fast (m-1)-dimensional polynomial transform [(m-1)-D PT] and 1-D DWTs algorithm for computing these two types of m-D DWTs are then proposed. By revealing the relationships among the m-dimensional discrete W transforms (m-D DWTs), the m-dimensional generalized discrete Fourier transforms (m-D GDFTs), the m-dimensional discrete cosine transforms (m-D DCTs), and the m-dimensional discrete sine transforms (m-D DSTs), the generalized fast algorithms for 14 types of the m-D discrete sinusoidal transforms including four types of m-D DWTs and the same number of types of m-D GDFTs, and three types of m-D DCTs and the same number of types of m-D DSTs are presented. The number of multiplications for all 14 types of the m-D discrete sinusoidal transforms needed by the proposed algorithm is only 1/m times that of the widely used corresponding row-column methods. The number of additions required by the proposed algorithm is also reduced considerably. Finally, with the help of the software platform Visual C++ 6.0 for Windows 98, the computation time comparisons between the proposed and the reported algorithms are given. The numerical experiments show that the proposed algorithms are not only highly efficient but are also very simple in computational structure.