This paper presents a new change detection method with the aid of subspace identification. The proposed method is based on monitoring a change in variance of a statistic generated by a recursive subspace identificatio...
详细信息
This paper presents a new change detection method with the aid of subspace identification. The proposed method is based on monitoring a change in variance of a statistic generated by a recursive subspace identification algorithm. An asymptotic property of the statistic is presented. Without changes during sampling, it is shown that, under relevant assumptions. the statistic converges in probability to a stack of noise vectors multiplied from the left side by a Toeplitz matrix. A numerical example illustrates that the proposed method can detect changes in the dynamics of a system, without being disturbed by changes in the dynamics of an input signal which are not our concern.
The problem of MIMO state space recursive identification is considered and analyzed using subspace model identification (SMI) techniques. In this paper the use of projection tracking techniques for the update of the o...
详细信息
The problem of MIMO state space recursive identification is considered and analyzed using subspace model identification (SMI) techniques. In this paper the use of projection tracking techniques for the update of the observability subspace is proposed: existing results are used for the output error case and a novel instrumental variable (IV) projection tracking approach is proposed, to accommodate for arbitrary correlation of the disturbances. Simulation results show the performance achievable with the given algorithms.
In this paper, we present a novel algorithm for sampling rate conversion by an arbitrary factor. Theoretically, sampling rate conversion of a discrete-time (DT) sequence can be performed by converting the sequence to ...
详细信息
In this paper, we present a novel algorithm for sampling rate conversion by an arbitrary factor. Theoretically, sampling rate conversion of a discrete-time (DT) sequence can be performed by converting the sequence to a series of continuous-time (CT) impulses. This series of impulses is filtered with a CT lowpass filter, and the output is then sampled at the desired rate. If the CT filter is chosen to have a rational transfer function. then this system can be simulated using a DT algorithm for which both computation and memory requirements are low. The DT implementation is comprised of a parallel structure, where each branch consists of a time-varying filter with one or two taps, followed by a fixed recursive filter operating at the output sampling rate. The coefficients of the time-varying filters are calculated recursively. This eliminates the need to store a large table or coefficients, as is commonly done.
We present a noel approach to deal with the problem of reconstructing, the duplication history of tandemly repeated genes that are supposed to have arisen from unequal recombination, We first describe the mathematical...
详细信息
We present a noel approach to deal with the problem of reconstructing, the duplication history of tandemly repeated genes that are supposed to have arisen from unequal recombination, We first describe the mathematical model of evolution by tandem duplication and introduce duplication histories and duplication trees. We then provide a simple recursive algorithm which determines whether or not a given rooted phylogeny call be a duplication history and another algorithm that simulates the unequal recombination process and searches for the best duplication trees according to the maximum parsimony criterion. We use real data sets of human immunglobulins and T-cell receptor, to validate Our methods and algorithms. Identity between most parsimonious duplication trees and most parsimonious with additional knowledge about phlogenies for the same data. combined with the agreement with additional knowledge about sequences, such as the presence of polymorphisms, shows strong evidence that our reconstruction procedure provides good insights into the duplication histories of the loci.
This article presents a simulation-based strategy for sizing the actuators of a redundantly actuated robotic mechanism. The class of robotic mechanisms we consider may contain one or more closed loops and possess an a...
详细信息
This article presents a simulation-based strategy for sizing the actuators of a redundantly actuated robotic mechanism. The class of robotic mechanisms we consider may contain one or more closed loops and possess an arbitrary number of active and passive joints, and the number of actuators may exceed the mechanism's kinematic degrees of freedom. Our approach relies on a series of dynamic simulations of the mechanism, by applying Taguchi's method to systematically perform the simulations. To efficiently perform each of the dynamic simulations, we develop, using tools from modern screw theory, new recursive algorithms for the forward and inverse dynamics of the class of redundantly actuated mechanisms described. (C) 2002 Wiley Periodicals, Inc.
Efficient algorithms are derived for computing the entries of the Bezout resultant matrix for two univariate polynomials of degree n and for calculating the entries of the Dixon-Cayley resultant matrix for three bivar...
详细信息
Efficient algorithms are derived for computing the entries of the Bezout resultant matrix for two univariate polynomials of degree n and for calculating the entries of the Dixon-Cayley resultant matrix for three bivariate polynomials of bidegree (m, n). Standard methods based on explicit formulas require O(n(3)) additions and multiplications to compute all the entries of the Bezout resultant matrix. Here we present a new recursive algorithm for computing these entries that uses only O(n(2)) additions and multiplications. The improvement is even more dramatic in the bivariate setting. Established techniques based on explicit formulas require O(m(4)n(4)) additions and multiplications to calculate all the entries of the Dixon-Cayley resultant matrix. In contrast, our recursive algorithm for computing these entries uses only O(m(2)n(3)) additions and multiplications. (C) 2002 Academic Press.
The sequence of estimates formed by the LMS algorithm for a standard linear regression estimation problem is considered. In this paper it is first shown that smoothing the LMS estimates using a matrix updating will le...
详细信息
The sequence of estimates formed by the LMS algorithm for a standard linear regression estimation problem is considered. In this paper it is first shown that smoothing the LMS estimates using a matrix updating will lead to smoothed estimates with optimal tracking properties, also in the case the true parameters are slowly changing as a random walk. The choice of smoothing matrix should be tailored to the properties of the random walk. Second, it is shown that the same accuracy can be obtained also for a modified algorithm, SLAMS, which is based on averages and requires much less computations.
Despite being one of the fastest growing alternative fuel sources, little attention has been given to control of the air fuel ratio at the point of combustion in liquefied petroleum gas (LPG) engines. In this paper a ...
详细信息
Despite being one of the fastest growing alternative fuel sources, little attention has been given to control of the air fuel ratio at the point of combustion in liquefied petroleum gas (LPG) engines. In this paper a mean value engine model is presented for LPG throttle body injected engines. Based on this model, a control algorithm capable of adapting to errors in both the fuel and air systems is proposed to ensure accurate stoichiometric fuel injection control. Simulation results are presented to validate the proposed approach.
This paper addresses a number of open problems concerning the generalized likelihood ratio (GLR) rules for online detection of faults and parameter changes in control systems. It is shown that with an appropriate choi...
详细信息
This paper addresses a number of open problems concerning the generalized likelihood ratio (GLR) rules for online detection of faults and parameter changes in control systems. It is shown that with an appropriate choice of the threshold and window size, these GLR rules are asymptotically optimal, The rules are also extended to nonlikelihood statistics that are widely used in monitoring adaptive algorithms for system identification and control by establishing Gaussian approximations to these statistics when the window size is chosen suitably. recursive algorithms are developed for practical implementation of the procedure, and importance sampling techniques are introduced for determining the threshold of the rule to satisfy prescribed bounds on the false alarm rate.
A new compact way to store a symmetric or triangular matrix called RPF for recursive Packed Format is fully described. Novel ways to transform RPF to and from standard packed format are included. A new algorithm, call...
详细信息
A new compact way to store a symmetric or triangular matrix called RPF for recursive Packed Format is fully described. Novel ways to transform RPF to and from standard packed format are included. A new algorithm, called RPC for recursive Packed Cholesky, that operates on the RPF format is presented. Algorithm RPC is based on level-3 BLAS and requires variants of algorithms TRSM and SYRK that work on RPF. We call these RP_TRSM and RP_SYRK and find that they do most of their work by calling GEMM. It follows that most of the execution time of RPC lies in GEMM. The advantage of this storage scheme compared to traditional packed and full storage is demonstrated. First, the RPC storage format uses the minimal amount of storage for the symmetric or triangular matrix. Second, RPC gives a level-3 implementation of Cholesky factorization whereas standard packed implementations are only level 2. Hence, the performance of our RPC implementation is decidedly superior. Third, unlike fixed block size algorithms, RPC requires no block size tuning parameter. We present performance measurements on several current architectures that demonstrate improvements over the traditional packed routines. Also SMP parallel computations on the IBM SMP computer are made. The graphs that are attached in Section 7 show that the RPC algorithms are superior by a factor between 1.6 and 7.4 for order around 1000, and between 1.9 and 10.3 for order around 3000 over the traditional packed algorithms. For some architectures, the RPC performance results are almost the same or even better than the traditional full-storage algorithm results.
暂无评论