In this paper an on-line fuzzy identification of Takagi Sugeno fuzzy model is presented. The presented method combines a recursive Gustafson–Kessel clustering algorithm and the fuzzy recursive least squares method. The on-line Gustafson–Kessel clustering method is derived. The recursive equations for fuzzy covariance matrix, its inverse and cluster centers are given. The use of the method is pr...

In this paper, we propose a recursive Taylor method for ray-casting algebraic surfaces. The performance of this approach is compared with four other candidate approaches to raycasting: using interval arithmetic on the power form, using interval arithmetic on centered forms, using affine arithmetic, and using modified affine arithmetic. Test results show that the recursive Taylor method compares...

In this paper, we solve higher index differential algebraic equations (DAEs) by transforming them into integral algebraic equations (IAEs). We apply collocation methods on continuous piece-wise polynomials space to solve the obtained higher index IAEs. The efficiency of the given method is improved by using a recursive formula for computing the integral part. Finally, we apply the obtained algo...

We present two methods for expressing computations based on recurrence relations and discuss their relative merits. One method, the structural blanks approach, is built on top of traditional programming languages like Fortran or Pascal. The other method, the constructive recursive approach , is based on recursive relations over graphs.

A method for calculating breakdown probabilities of recursive stack "lters is presented. The method is based on Markov chain models and on an interpretation of a noisy signal as a binary signal. As an example, the breakdown probabilities of recursive median "lters are calculated. ( 2001 Elsevier Science B.V. All rights reserved.

A novel method for calculating breakdown probabilities of recursive stack filters is presented. The method is based on Markov chain models and on an interpretation of a noisy signal as a binary signal. As an example, the breakdown probabilities of recursive median filters are calculated.

In Constructive Type Theory, recursive and corecursive definitions are subject to syntactic restrictions which guarantee termination for recursive functions and productivity for corecursive functions. However, many terminating and productive functions do not pass the syntactic tests. Bove proposed in her thesis an elegant reformulation of the method of accessibility predicates that widens the r...

We consider the stationary memoryless channels with input cost. We prove that for transmission rates above the capacity the correct probability of decoding tends to zero exponentially as the block length n of codes tends to infinity. In the case where both of channel input and output sets are finite, we determine the optimal exponent function on the above exponential decay of the correct probab...

In this paper, a low order recursive linear prediction method and recursive least square as an adaptive filter (LP-RLS) are introduced to predict the speech and the excitation signals. In real-time packet-based communication systems, one major problem is misrouted or delayed packets which results in degraded perceived voice quality. If packets are not available on time, the packet is known as l...