In this paper, we build up a framework for sparse interpolation. We first investigate the theoretical limit of the number of unisolvent points for sparse interpolation under a general setting and try to answer some basic questions of this topic. We also explore the relation between classical interpolation and sparse interpolation. We second consider the design of the interpolation points for th...

We propose a deterministic annealing (DA) algorithm to design classifiers based on continuous observation hidden Markov models. The algorithm belongs to the class of minimum classification error (MCE) techniques that are known to outperform maximum likelihood (ML) design. Most MCE methods smooth the piecewise constant classification error cost to facilitate the use of local descent optimization...

We study the value and quality of deterministic solutions to scheduled stochastic capacitated multi-commodity service network design problems. We study both the fixed and variable (integer and continuous) capacity cases, and investigate models with and without asset-balance constraints. For the deterministic cases, we replace the random variables in the stochastic model with the 50 th and the 7...

The paper presents implementation of a test pattern generation technique that uses cellular automaton construction based on the analysis of a pre-computed test set. The algorithm is included into the Java applet for automatic synthesis of the built-in self-test structure into a digital circuit modeled in VHDL.

We have considered the problem of protein design based on a model where the contact energy between amino acid residues is fitted phenomenologically using the Miyazawa–Jernigan matrix. Due to the simple form of the contact energy function, an analytical prescription is found which allows us to design energetically stable sequences for fixed amino acid residues compositions and target structures....

This paper presents a reduced-complexity deterministic annealing (DA) approach for vector quantizer (VQ) design by using soft information processing with simplified assignment measures. Low-complexity distributions are designed to mimic the Gibbs distribution, where the latter is the optimal distribution used in the standard DA method. These low-complexity distributions are simple enough to fac...

The ...rst setup we study is a deterministic model with spatial separation where we consider alternative payments systems institutions and their implications for allocation and welfare. A payments system with period-by-period settlement in outside money improves on decentralized exchange. An e¢cient allocation is supported by a payments system where settlement is not imposed. In the second mode...

We introduce a class of deterministic higher-order patterns to Template Haskell for supporting declarative transformational programming with more elegant binding of pattern variables. Higher-order patterns are capable of checking and binding subtrees far from the root, which is useful for program manipulation. However, there are three major problems. First, it is difficult to explain why a part...