Sperm whales (Physeter macrocephalus) can dive in search of food to a depth of over 1500 m and return to the surface within approximately 90 minutes. This makes conventional visual observation methods impractical to l...
详细信息
ISBN:
(纸本)9781467348232
Sperm whales (Physeter macrocephalus) can dive in search of food to a depth of over 1500 m and return to the surface within approximately 90 minutes. This makes conventional visual observation methods impractical to locate and track these animals. However it is possible to use an acoustic method for this purpose since a diving whale produces a series of loud impulsive acoustic signals or 'clicks' at a fairly constant rate. In this paper, a new method for passive whale tracking is presented based on these signals. A recursive range estimation technique is presented using the angle of arrival and periodicity. The performance is evaluated using a synthesized whale range profile.
With a high priority in database development and application, database query algorithm is especially important for complex data processing in deep level. Aiming at accomplishing queries for multi-level users, a new it...
详细信息
ISBN:
(纸本)9781457715846
With a high priority in database development and application, database query algorithm is especially important for complex data processing in deep level. Aiming at accomplishing queries for multi-level users, a new iterative query algorithm is proposed on top of the recursive algorithms. This algorithm starts from choosing a root node, which taken as the only entry and exit of the algorithm. Then it traverses to all the related nodes from the root node and the corresponding data processing will be conducted. Finally, through the experiment, the algorithm is verified and its performance is evaluated
In this article, the problem on the estimation of the convolution model parameters is considered. The recursive algorithm for estimating model parameters is introduced from the orthogonal procedure of the data, the co...
详细信息
In this article, the problem on the estimation of the convolution model parameters is considered. The recursive algorithm for estimating model parameters is introduced from the orthogonal procedure of the data, the convergence of this algorithm is theoretically discussed, and a sufficient condition for the convergence criterion of the orthogonal procedure is given. According to this condition, the recursive algorithm is convergent to model wavelet A- = （1, α1,..., αq）.
In this article, based on least square estimation, a recursive algorithm for indirect learning structure predistorter is introduced. Simulation results show that of all polynomial predistorter nonlinear terms, higher-...
详细信息
In this article, based on least square estimation, a recursive algorithm for indirect learning structure predistorter is introduced. Simulation results show that of all polynomial predistorter nonlinear terms, higher-order （higher than 7th-order） nonlinear terms are so minor that they can be omitted in practical predistorter design. So, it is unnecessary to construct predistorter with higher-order polynomials, and the algorithm will always be stable. Further results show that even when 15th-order polynomial model is used, the algorithm is convergent after 10 iterations, and it can improve out-band spectrum of 20 MHz bandwidth signal by 64 dB, with a 1.2×10^11 matrix condition number.
We address in this paper the parallelization of a recursive algorithm for triangular matrix inversion (TMI) based on the 'Divide and Conquer' (D&C) paradigm. A series of different versions of an original s...
详细信息
ISBN:
(纸本)9788360810484
We address in this paper the parallelization of a recursive algorithm for triangular matrix inversion (TMI) based on the 'Divide and Conquer' (D&C) paradigm. A series of different versions of an original sequential algorithm are first presented. A theoretical performance study permits to establish an accurate comparison between the designed algorithms. Afterwards, we develop an optimal parallel communication-free algorithm targeting a heterogeneous environment involving processors of different speeds. For this purpose, we use a non equitable and incomplete version of the D&C paradigm consisting in recursively decomposing the original TMI problem in two subproblems of non equal sizes, then decomposing only one subproblem and so on. The theoretical study is validated by a series of experiments achieved on two platforms, namely an 8-core shared memory machine and a distributed memory cluster of 16 nodes. The obtained results permit to illustrate the interest of the contribution.
This paper derives the recursive formulas of the computation of the criterion functions for the well-known weighted recursive least squares algorithm and the finite-data-window recursive least squares algorithm for li...
详细信息
ISBN:
(纸本)9781457720727
This paper derives the recursive formulas of the computation of the criterion functions for the well-known weighted recursive least squares algorithm and the finite-data-window recursive least squares algorithm for linear regressive models. The analysis indicates that the proposed recursive computation formulas can be extended to the least squares estimation algorithms for pseudo-linear regression models, e.g., the equation error systems.
The method of transforming a ladder diagram (LD) and an instruction list (IL) of PLC (Programmable Logic Controller) to each other is investigated in this paper. Firstly, ladder-step is adopted on transforming LD into...
详细信息
ISBN:
(纸本)9783037853849
The method of transforming a ladder diagram (LD) and an instruction list (IL) of PLC (Programmable Logic Controller) to each other is investigated in this paper. Firstly, ladder-step is adopted on transforming LD into IL. Ladder-step is divided series or parallel by using recursive algorithm, and then complicated ladder-step can be divided into several simple ladder-steps which can be converted to IL easily. When obtaining simple ladder-steps' IL, combining them together to get final IL program of complicated LD program. Secondly, on transforming IL into LD, stack algorithm contributes a lot. Scanning IL to generate LD of each instruction block, and then pushing them into stack. Combine LDs in the stack by operating instruction, and then IL is transformed into LD successfully. Finally, in the last part of this paper, we show our PLC software and lower position machine. In addition, this transforming algorithm has already applied in PLC software successfully.
A recursive algorithm to calculate inbreeding coefficients was modified to account for nonzero inbreeding of unknown parents. The modification was done by changing one part of a recursive formula in which the inbreedi...
详细信息
A recursive algorithm to calculate inbreeding coefficients was modified to account for nonzero inbreeding of unknown parents. The modification was done by changing one part of a recursive formula in which the inbreeding of an animal with at least one unknown parent is not zero and replacing it by the mean inbreeding of all animals born the same year. The algorithm is iterative. Testing involved 17 million US Holsteins. Convergence was reached in 6 rounds. The computing time per round was 4 min, twice as fast as the VanRaden algorithm based on the tabular method. The recursive algorithm is very simple;however, it requires that the recursion takes into account the order of animals. After a simple modification, the algorithm provides a very good approximation of inbreeding when the pedigree is unordered.
The GPS provides position of a point on the surface of the earth with high degree of speed and accuracy. However, the GPS measurements are also fraught with different types of errors. Among these errors random errors ...
详细信息
The GPS provides position of a point on the surface of the earth with high degree of speed and accuracy. However, the GPS measurements are also fraught with different types of errors. Among these errors random errors are the most unpredictable. Many applications of GPS data require accurate point position which is possible by reducing the random error in the GPS data. One of the method of reducing the random error is to adjust the network formed by the GPS control points. GPS provides large amount of data continuously at an' interval as low as 0.001 second epoch. Thus huge amount of data may better be processed by an algorithm less complex requiring less memory and computational time. Kalman Filter is a recursive algorithm which requires only the present and the previous observations may be one such algorithm which applied on GPS control network which minimizes the random error. In this study the Kalman Filter algorithm has been applied to adjust a GPS based control network. The results of proposed Kalman filter technique give better accuracy with more consistency and are found superior to the standard one (least square).
This paper proposes a new approach for global motion estimation using recursive algorithm in the sparsely sampled field, as well as we process parametric estimation in framework of one stage not in proposed pyramid st...
详细信息
ISBN:
(纸本)9780769533827
This paper proposes a new approach for global motion estimation using recursive algorithm in the sparsely sampled field, as well as we process parametric estimation in framework of one stage not in proposed pyramid structure. Firstly, we divide the image into blocks and obtain the highest gradient magnitude in each block to form a sparsely sampled field. Then, we derive a new recursive gradient-based algorithm for global motion estimation in sparsely sampled field. The low pass filtering is for eliminating noise of original images before the estimation processes. Finally, we propose one stage framework for the parametric refinement without the proposed hierarchical configuration. The simulation results show the comparisons of performance between our method and others.
暂无评论