A new method for establishing the equations of motion of multibody mechanisms based on canonical momenta is introduced in this paper. In absence of constraints, the proposed forward dynamics formulation results in a H...
详细信息
A new method for establishing the equations of motion of multibody mechanisms based on canonical momenta is introduced in this paper. In absence of constraints, the proposed forward dynamics formulation results in a Hamiltonian set of 2n first order ODEs in the generalized coordinates q and the canonical momenta p. These Hamiltonian equations are derived from a recursive Newton Euler formulation. As an example, it is shown how, in the case of a serial structure with rotational joints, an O(n) formulation is obtained. The amount of arithmetical operations is considerably less than acceleration based O(n) formulations.
In this paper, a recursive algorithm for the computation of 2-D DCT is proposed. With this algorithm, the 2-D DCT can be performed by only one 1-D DCT block, which makes a significant reduction of the number of multip...
详细信息
ISBN:
(纸本)9781424414482
In this paper, a recursive algorithm for the computation of 2-D DCT is proposed. With this algorithm, the 2-D DCT can be performed by only one 1-D DCT block, which makes a significant reduction of the number of multiplications. The proposed algorithm can be easily implemented in VLSI circuits. A circuit structure has also been proposed. For a 4x4 DCT, the reduction of multiplication operations can reach 44% without increasing the processing time. With the advantage of a smaller number of multiplications, the circuit is made simple and power-efficient.
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.
This paper presents a new recursive algorithm for computing bounds on the reliability of a directed, source-sink network whose arcs either function or fail with known probabilities. The reliability is the probability ...
详细信息
Multiple bridged knife-edge diffraction estimation can be seen as a generalization of the multiple knife-edge diffraction one which can be found in many applications of wireless communications. The considered model is...
详细信息
ISBN:
(纸本)9789082797060
Multiple bridged knife-edge diffraction estimation can be seen as a generalization of the multiple knife-edge diffraction one which can be found in many applications of wireless communications. The considered model is formed by bridging the spaces among knife-edges with reflecting planes. So far, the series-based standard solution for this problem suffers from high computational complexity, thus limiting its use in practice. We, thus, propose a fast recursive algorithm to tackle its computational burden. To illustrate the effectiveness of the proposed algorithm, we compare our results with the state-of-the-art algorithms. Numerical results show that the running time of the proposed algorithm is much faster than that of the standard solution while benefiting from similar accuracy.
Mining frequent itemsets and association rules are an essential task within data mining and data analysis. In this paper, we introduce PrefRec, a recursive algorithm for finding frequent itemsets and association rules...
详细信息
A recursive algorithm of moving horizon estimation (MHE) with the convergence property is presented in this paper. In this work, we formulate the state estimation problem as a quadratic program problem with fixed-size...
详细信息
ISBN:
(纸本)078037729X
A recursive algorithm of moving horizon estimation (MHE) with the convergence property is presented in this paper. In this work, we formulate the state estimation problem as a quadratic program problem with fixed-size estimation window and a recursive formula for prior state estimation and covariance matrix is established. The proposed algorithm can improve the performance of MHE and offers advantages over other algorithm of MHE and Kalman filter.
Focusing on the unconstrained circle cutting problem, a recursive algorithm which can generate four-block cutting pattern was presented. With the four-block cutting pattern, a sheet can be cut into four blocks. Each b...
详细信息
ISBN:
(纸本)9781538612446
Focusing on the unconstrained circle cutting problem, a recursive algorithm which can generate four-block cutting pattern was presented. With the four-block cutting pattern, a sheet can be cut into four blocks. Each block contains strips of the same direction and length. In each strip more than one row of identical blanks can appear. The optimal arrangement of strips on each block was determined by the recursive algorithm. An implicit enumeration method was used to determine the combination of blocks in sheet to make the material usage reach its maximum. The experimental results show that, the algorithm is efficient in both the computation time and the material usage.
The constrained serial dictatorship mechanism is a popular method used in school admissions. However, due to the number of combinations possible, simulating the behaviour of students in their selection of schools and ...
详细信息
The constrained serial dictatorship mechanism is a popular method used in school admissions. However, due to the number of combinations possible, simulating the behaviour of students in their selection of schools and computing the best strategy for them to select a limited number of schools is currently a highly complex and time-consuming endeavour. The purpose of this study is to propose a recursive algorithm to significantly reduce this computational time and to provide an empirical application by employing this algorithm. To do this, I studied how the behaviours and utilities of students will change if provided with more choices for college admissions in Guangxi in China. The results indicate that neither the behaviours nor the utilities change significantly with the provision of more choices, which implies that increasing the available choices of schools for students in Guangxi would be a waste of resources.
Axial impact between two elastic rods with piecewise constant characteristic impedance is considered. The distribution of characteristic impedance of the impacted rod and the impact velocity are given. By use of a 1D ...
详细信息
Axial impact between two elastic rods with piecewise constant characteristic impedance is considered. The distribution of characteristic impedance of the impacted rod and the impact velocity are given. By use of a 1D recursive algorithm, the characteristic impedances of the impacting rod are determined as long as they are all positive so that a prescribed impact force is realized. A condition for positivity of the characteristic impedance is derived in terms of transmission coefficients for wave energy. At the time from which positivity of all characteristic impedances cannot be maintained, or earlier, the characteristic impedance of the impacting body is continued, e.g., at the level of the last positive characteristic impedance or at level zero corresponding to cutting off the impacting rod. Examples of prescribed exponentially decreasing and linearly increasing impact forces are presented for a uniform impacted rod with constant characteristic impedance. In these examples, there is good agreement between the prescribed impact force and the impact force obtained from 3D FE simulation with a piecewise linear diameter of the impacting body that approximates the piecewise constant diameter obtained by use of the 1D recursive algorithm.
暂无评论