A new method for suppressing transients in time-varying recursive filters is proposed. The technique is based on modifying the state variables when the filter coefficients are changed so that the filter enters a new state smoothly without transient attacks, as originally proposed by Zetterberg and Zhang. In this contribution we modify the Zetterberg–Zhang algorithm to render it feasible for eff...

A technique for the modeling of nonlinear control processes using fuzzy modeling approach based on the Takagi–Sugeno fuzzy model with a combination of genetic algorithm and recursive least square is proposed. This paper discusses the identification of the parameters at the antecedent and consequent parts of the fuzzy model. For the antecedent fuzzy parameters, genetic algorithm is used to tune ...

Recursive digital lters are potentially less computationally expensive than their non-recursive counterparts. However, algorithms for adjusting the coeecients of recursive lters may produce biased or sub-optimal estimates of the optimal coeecent values. In addition, recursive lters may become unstable if the adaptive algorithm updates a feedback coeecient so that one of the poles remains outsid...

A major problem in the design of recursive digital filters is stability. Although an unstable recursive filter obtained from a design algorithm can be stabilized by reciprocal substitution of the unstable factors of the filter without changing its amplitude response, this stabilization technique cannot be applied if phase response is a part of the design specifications. In this paper, we propos...

A shape-analysis algorithm statically analyzes a program to determine information about the heap-allocated data structures that the program manipulates. The results can be used to optimize, understand, debug, or verify programs. Existing algorithms are quite imprecise in the presence of recursive procedure calls. This is unfortunate, since recursion provides a natural way to manipulate linked d...

A noise canceling technique based on a model-based recursive processor is presented. Beginning with a canceling scheme using a reference source, it is shown how to obtain an estimate of the noise, which can then be incorporated in a recursive noise canceler. Once this is done, recursive detection and estimation schemes are developed. The approach is to model the nonstationary noise as an autore...

A recursive design technique for forming holographic elements which can be incorporated into helmet displays has been developed. To ensure that the holographic elements have low aberrations and high diffraction efficiency they must be recorded with complex wavefronts. These wavefronts are derived from relatively simple intermediate holograms whose readout geometry and wavelength differ from tho...

T-system is a tool for parallel computing developed at the PSI RAS. The most recent implementation is available on both Linux and Windows platforms. The paper is dedicated to one of important T-system aspects — ability to change parallelism granule size at runtime. The technique is available, primarily, for recursive programs, but it’s possible to extent it to non-recursive ones as well. In the...

Recursive approximation of the set of feasible parameters is a key problem in set membership identification. In this paper a new technique is presented, aimed at recursively computing an outer orthotopic approximation of polytopic feasible parameter sets. The main idea is to exploit the concept of binding constraints in linear programs, in order to select a limited number of constraints providi...

we study the limiting distribution of the degree of a given node in a scaled attachment random recursive tree, a generalized random recursive tree, which is introduced by devroye et. al (2011). in a scaled attachment random recursive tree, every node $i$ is attached to the node labeled $lfloor ix_i floor$ where $x_0$, $ldots$ , $x_n$ is a sequence of i.i.d. random variables, with support in [0,...