This paper presents a new basis, the WSB basis, which unifies the Bemstein basis, Wang-Ball basis and Said-Ball basis, and therefore the Bézier curve, Wang-Ball curve and Said-Ball curve are the special cases of ...
详细信息
This paper presents a new basis, the WSB basis, which unifies the Bemstein basis, Wang-Ball basis and Said-Ball basis, and therefore the Bézier curve, Wang-Ball curve and Said-Ball curve are the special cases of the WSB curve based on the WSB basis In addition, the relative degree elevation formula, recursive algorithm and conversion formula between the WSB basis and the Bern- stein basis are given.
The key point of robot dynamics is optimal design and control. The efficiency of robot dynamics has been the goal of researchers in recent years. Screws are used to describe dynamic problems in this paper, and an O(N)...
详细信息
The key point of robot dynamics is optimal design and control. The efficiency of robot dynamics has been the goal of researchers in recent years. Screws are used to describe dynamic problems in this paper, and an O(N) recursive robot forward dynamic algorithm is given on this. It can be easily extended to tree topology, closed loop and spatial robot systems. And three classic methods of robot dynamics are compared for easy of use. The results show that dynamics described with screws are helpful in high efficient dynamics modelling. The dynamical expressions based on screws are concise and clear. It's efficiency is high of O(N) and is linear to the degree of freedom. With the improvement of computation efficiency, it will make the real-time dynamics control become possible.
Identifying dynamic characteristics for structures under ambient condition is a very important task for the design verification, model updating, health monitoring, and damage detection of these structures. Among many ...
详细信息
Identifying dynamic characteristics for structures under ambient condition is a very important task for the design verification, model updating, health monitoring, and damage detection of these structures. Among many techniques developed for this purpose, the stochastic subspace identification (SSI) techniques are a robust time-domain method that can simultaneously process large numbers of inputs and outputs. They can potentially extract the most information from the measurement. The SSI method assumes that both the excitation and the measurement noise are stationary white-noise processes and can lead to some errors when this assumption is not met. In this paper, a recursive SSI method using an instrumental variable (IV) technique is proposed for online step-by-step tracking of time-varying modal parameters for a structure under nonwhite but finitely correlated excitation and measurement noise. The IV technique is used to resolve possible estimation bias attributable to the violation of white noise assumption for the SSI method. A bi-iteration subspace tracker is also adopted to make the technique efficient and suitable for online application. The proposed technique is demonstrated on a single-degree-of-freedom structure and the ASCE benchmark frame structure. Results show that the technique can track the time-varying characteristics of structures under nonwhite but finitely correlated excitation and measurement noise. DOI: 10.1061/(ASCE) EM.1943-7889.0000370. (C) 2012 American Society of Civil Engineers.
The function-valued Pade-type approximant(FPTA) was defined in the inner product *** this work,we choose coefficients in the Neumann power series to make the inner product with both sides of a function-valued system o...
详细信息
The function-valued Pade-type approximant(FPTA) was defined in the inner product *** this work,we choose coefficients in the Neumann power series to make the inner product with both sides of a function-valued system of equations to yield a scalar *** we express an FPTA in the determinant *** avoid the direct computation of the determinants,we expand the Sylvester theorem to the function-valued case called the Sylvester-type algorithm (FPTAVSA).The numerical experimentation for a typical integral equation illustrates that the method of FPTAVSA is simpler and more effective for obtaining the characteristic values and the characteristic function than all previous methods.
The key point of robot dynamics is optimal design and *** efficiency of robot dynamics has been the goal of researchers in recent *** are used to describe dynamic problems in this paper,and an O(N) recursive robot for...
详细信息
ISBN:
(纸本)9781627483766
The key point of robot dynamics is optimal design and *** efficiency of robot dynamics has been the goal of researchers in recent *** are used to describe dynamic problems in this paper,and an O(N) recursive robot forward dynamic algorithm is given on *** can be easily extended to tree topology,closed loop and spatial robot *** three classic methods of robot dynamics are compared for easy of *** results show that dynamics described with screws are helpful in high efficient dynamics *** dynamical expressions based on screws are concise and ***'s efficiency is high of O(N) and is linear to the degree of *** the improvement of computation efficiency,it will make the real-time dynamics control become possible.
This paper presents a recursive algorithm for constrained two-dimensional guillotine cutting problems of rectangular items. The algorithm divides a stock plate into a sequence of small rectangular blocks. For the curr...
详细信息
This paper presents a recursive algorithm for constrained two-dimensional guillotine cutting problems of rectangular items. The algorithm divides a stock plate into a sequence of small rectangular blocks. For the current block considered, it selects an item, puts it at the left-bottom corner of the block, and determines the direction of the dividing cut that divides the unoccupied region of the block into two smaller blocks for further consideration. The dividing cut is either along the upper edge or along the right edge of the selected item. The upper bound obtained from the unconstrained solution is used to shorten the searching space. The computational results on benchmark problems indicate that the algorithm can improve the solutions, and is faster than other algorithms.
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...
详细信息
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.
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...
详细信息
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.
This paper explores the problems of generalized center conditions and integrability of resonant infinity for a complex polynomial differential system. The method is based on converting resonant infinity into an elemen...
详细信息
This paper explores the problems of generalized center conditions and integrability of resonant infinity for a complex polynomial differential system. The method is based on converting resonant infinity into an elementary singular point by a homeomorphic transformation. The calculation of generalized singular point quantities is an effective way of finding necessary conditions for integrable systems. A new recursive algorithm for computing generalized singular point quantities at the origin of the transformed system is derived. At the same time, a necessary and sufficient condition for resonant infinity to be a generalized complex center is presented. As an application of the new recursive algorithm, the generalized center conditions for resonant infinity for a class of cubic systems are discussed. To the best of our knowledge, this is the first time that the generalized center problem has been considered for p : -q resonant infinity. (C) 2011 Elsevier Ltd. All rights reserved.
We consider a simple Poisson cluster model for the payment numbers and the corresponding total payments for insurance claims arriving in a given year. Due to the Poisson structure one can give reasonably explicit expr...
详细信息
We consider a simple Poisson cluster model for the payment numbers and the corresponding total payments for insurance claims arriving in a given year. Due to the Poisson structure one can give reasonably explicit expressions for the prediction of the payment numbers and total payments in future periods given the past observations of the payment numbers. One can also derive reasonably explicit expressions for the corresponding prediction errors. In the (a, b) class of Panjer's claim size distributions, these expressions can be evaluated by simple recursive algorithms. We study the conditions under which the predictions are asymptotically linear as the number of past payments becomes large. We also demonstrate that, in other regimes, the prediction may be far from linear. For example, a staircase-like pattern may arise as well. We illustrate how the theory works on real-life data, also in comparison with the chain ladder method.
暂无评论