Purpose: Interest in developing methods appropriate for mapping increasing amounts of genome-wide molecular data are increasing rapidly. There is also an increasing need for methods that are able to efficiently simula...
详细信息
In this paper, a novel complex bandpass filter is presented which overcomes the pitfalls of the techniques in common use. This complex bandpass filter can correctly extract the phasor of the fundamental component and ...
详细信息
In this paper, a novel complex bandpass filter is presented which overcomes the pitfalls of the techniques in common use. This complex bandpass filter can correctly extract the phasor of the fundamental component and symmetrical components in voltage or current waveforms and then accurately estimate their instantaneous amplitude, phase angle, and frequency, even encountering various power disturbances. Further, a recursive algorithm is also developed for the complex bandpass filtering that updates current filtering output only using several previous sample values and filtering outputs. This attribute greatly reduces the computational complexity of complex bandpass filtering, which is the weakness of the continuous wavelet transform based on the well-known Morlet Wavelet. Thus, this recursive algorithm is highly desirable for real-time applications. The performance of the proposed technique is ascertained by using both simulated and practical power disturbance waveforms.
The paper introduced recursive algorithm of fractal graphics,put forward fractal graphics parallel algorithm. Analyzing recursive algorithmic time complexity and speedup rate of the parallel *** experimental results o...
详细信息
The paper introduced recursive algorithm of fractal graphics,put forward fractal graphics parallel algorithm. Analyzing recursive algorithmic time complexity and speedup rate of the parallel *** experimental results of PC cluster show that the theoretical analysis and the experimental results of fractal graphics parallel algorithm are consistency with a marked speedup rate.
Most subspace identification methods are developed for linear time-invariant system. However, in reality, most systems are time-varying. Hence the recursive version of subspace identification methods is urgently desir...
详细信息
ISBN:
(纸本)9781424472352
Most subspace identification methods are developed for linear time-invariant system. However, in reality, most systems are time-varying. Hence the recursive version of subspace identification methods is urgently desired. In this paper, we propose a unifying framework of recursive subspace model identification algorithm, which is based on the orthogonal projection and principal component analysis (PCA). Based on our framework, the bona fide recursive algorithm is applied to update the QR factorization. Two recursive subspace model identification algorithms are developed for open loop and closed loop condition, respectively. The numerical simulations demonstrate the efficiency of the two algorithms comparing with other algorithms.
Both the material utilization and the complexity of the cutting process should be considered when generating cutting patterns. This paper presents a recursive algorithm for constrained two-dimensional guillotine-cutti...
详细信息
Both the material utilization and the complexity of the cutting process should be considered when generating cutting patterns. This paper presents a recursive algorithm for constrained two-dimensional guillotine-cutting problems of rectangles. It uses homogeneous T-shape patterns to simplify the cutting process. Only homogeneous strips are allowed, each of which contains rectangular items of the same type. The plate is divided into two segments, each of which consists of strips with the same length and direction. The strip directions of the two segments are perpendicular to each other. Two recursion functions are established. The first generates optimal layouts of parallel strips on segments with specified sizes, and the second determines the optimal T-shape pattern on the plate. The optimal solution to the unconstrained version of the cutting problem is used to reduce the computation time. The computational results indicate that the algorithm is efficient both in computation time and in material utilization.
recursive algorithm (RA) need a great number of storage space for continue operations (such as push) on stack, which easily causes stack overflow. In the paper, we present a novel recursive algorithm to solve this int...
详细信息
ISBN:
(纸本)1424400600
recursive algorithm (RA) need a great number of storage space for continue operations (such as push) on stack, which easily causes stack overflow. In the paper, we present a novel recursive algorithm to solve this intractability throw constructing recursive tree, which only restoring valuable data for decreasing the spatial complexity, and then traversing recursive tree. In this way, the problem of spatial complexity of recursive algorithm could be solved effectively, making recursive algorithm more practical in application.
An extension to the analytical design of digital equiripple comb FIR filters is presented here. The filters are optimal in Chebyshev sense. The design runs from the filter specification through the degree formula to t...
详细信息
An extension to the analytical design of digital equiripple comb FIR filters is presented here. The filters are optimal in Chebyshev sense. The design runs from the filter specification through the degree formula to the impulse response coefficients, which are evaluated by an extremely efficient recursive algorithm. The proposed design method outperforms the standard procedures in terms of speed and robustness.
By introducing a bivariate matrix-valued linear functional on the scalar polynomial space. a general two-dimensional (2-D) matrix Pade-type approximant (BMPTA) in the inner product space is defined in this paper. The ...
详细信息
By introducing a bivariate matrix-valued linear functional on the scalar polynomial space. a general two-dimensional (2-D) matrix Pade-type approximant (BMPTA) in the inner product space is defined in this paper. The coefficients of its denominator polynomials are determined by taking the direct inner product of matrices. The remainder formula is developed and an algorithm for the numerator polynomials is presented when the generating polynomials are given in advance. By means of the Hankel-like coefficient matrix, a determinantal expression of BMPTA is presented. Moreover, to avoid the computation of the determinants, two efficient recursive algorithms are proposed. At the end the method of BMPTA is applied to partial realization problems of 2-D linear systems. (C) 2009 Elsevier B.V. All rights reserved.
A belief rule base inference methodology using the evidential reasoning approach (RIMER) has been developed recently, where a new belief rule base (BRB) is proposed to extend traditional IF-THEN rules and can capture ...
详细信息
A belief rule base inference methodology using the evidential reasoning approach (RIMER) has been developed recently, where a new belief rule base (BRB) is proposed to extend traditional IF-THEN rules and can capture more complicated causal relationships using different types of information with uncertainties, but these models are trained off-line and it is very expensive to train and re-train them. As such, recursive algorithms have been developed to update the BRB systems online and their calculation speed is very high, which is very important, particularly for the systems that have a high level of real-time requirement. The optimization models and recursive algorithms have been used for pipeline leak detection. However, because the proposed algorithms are both locally optimal and there may exist some noise in the real engineering systems, the trained or updated BRB may violate some certain running patterns that the pipeline leak should follow. These patterns can be determined by human experts according to some basic physical principles and the historical information. Therefore, this paper describes under expert intervention, how the recursive algorithm update the BRB system so that the updated BRB cannot only be used for pipeline leak detection but also satisfy the given patterns. Pipeline operations under different conditions are modeled by a BRB using expert knowledge, which is then updated and fine tuned using the proposed recursive algorithm and pipeline operating data, and validated by testing data. All training and testing data are collected from a real pipeline. The study demonstrates that under expert intervention, the BRB expert system is flexible, can be automatically tuned to represent complicated expert systems, and may be applied widely in engineering. It is also demonstrated that compared with other methods such as fuzzy neural networks (FNNs), the RIMER has a special characteristic of allowing direct intervention of human experts in deciding the in
In this paper, a new computation structure of image watermarking in DCT domain is presented. This structure employs a single DCT block, instead of two in many existing DCT watermarking systems, for the DCT computation...
详细信息
ISBN:
(纸本)9781424444793
In this paper, a new computation structure of image watermarking in DCT domain is presented. This structure employs a single DCT block, instead of two in many existing DCT watermarking systems, for the DCT computation of the image signal and that of the watermark. Using the single DCT block does not double the time required for the two 2-D DCT computations, as the amount of the calculations in this structure is effectively reduced compared to those with two DCT blocks. By using a special condensed 2-D DCT algorithm, the DCT computation of the watermark is divided into two parts and only the part necessary and sufficient for the watermarking is performed to achieve a significant reduction of the overall computation. This structure can be easily implemented into a circuit. Using the single DCT block, the hardware reduction in the 2-D DCT part of the watermarking circuit can reach 50% with the time delay increase of only 34%. It has been confirmed by the preliminary results of the FPGA implementation.
暂无评论