In order to get the total Degree of Engineering Changes for product family (EDCKBOM), which can help enterprise to select a scheme of Engineering Changes (EC) with a minor EDCKBOM and analyze the type of change propag...
详细信息
ISBN:
(纸本)9783037850398
In order to get the total Degree of Engineering Changes for product family (EDCKBOM), which can help enterprise to select a scheme of Engineering Changes (EC) with a minor EDCKBOM and analyze the type of change propagation for the CE in the product family, the Knowledge-body based on Bill of Material (KBOM) model was built for representing domain-specific knowledge, which was described as trial(GUS, CUS, GUR) and manifested as an AND/OR tree structure. Then, a complete solution system based on recursive algorithm was designed to compute the EDCKBOM. Finally, an example was given, and the approach was proved to be efficient and practical.
Pointing to the optimization layout problem of irregular parts on the rectangular area, this paper proposes a kind of the combined algorithm, which is based on the scan line algorithm and the pre-layout method. The ma...
详细信息
This paper presents the closed forms of the state-space models and the recursive algorithms of the transfer function models for fast and accurate modeling of the distributed RLC interconnect and transmission lines, wh...
详细信息
This paper presents the closed forms of the state-space models and the recursive algorithms of the transfer function models for fast and accurate modeling of the distributed RLC interconnect and transmission lines, which may be evenly or unevenly distributed. Considered models include the distributed RLC interconnect lines with or without external source and load connection. The effective closed forms and recursive algorithms do not involve any matrix inverse, LU matrix factorization, or matrix multiplication, thus reducing the computation complexity dramatically. Especially, the computation complexity of the closed forms for any evenly or unevenly distributed RLC interconnect line circuits is only O(1) or O(m), respectively, in sense of the scalar multiplication times, where m << N of the system order. The features of new recursive algorithms are two recursive s-polynomials and the low computation complexity. Examples illustrate the new methods in both time and frequency domains. Comparing with the PSpice, the new methods can dramatically reduce the runtime of the time responses and the Bode plots by 25% - 98.5% in the examples. The results can be applied to the RLC interconnect analysis and model reduction as a key to new approach.
A Taylor series least-squares approach to estimating derivatives on scattered data is extended to include derivative observation or specification. This approach allows improved estimation of derivatives near boundarie...
详细信息
A Taylor series least-squares approach to estimating derivatives on scattered data is extended to include derivative observation or specification. This approach allows improved estimation of derivatives near boundaries as compared with the standard ghost node approach. It also enables a unique method of estimating derivatives in a surface using only surface data.
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.
This paper proposes an extension of the recursive Input Estimation (RIE) for estimating time-varying unknown input. This extension is based on modifications of the Least Squares (LS) algorithm of the RIE, which increa...
详细信息
This paper proposes an extension of the recursive Input Estimation (RIE) for estimating time-varying unknown input. This extension is based on modifications of the Least Squares (LS) algorithm of the RIE, which increase its capability to track time varying unknown input. These modifications consist in inserting a forgetting factor into the LS algorithm and adding an integral effect. Moreover, alternative formulations are proposed, allowing the reduction of computation time in the case where the number of inputs to estimate is lower than the number of measurements. The different tools obtained are tested and compared on a three-dimensional tracking application.
Bidirectional hindsight options are a kind of exotic options. In the constant elasticity of variance (CEV) model, a combining binomial tree was built up to approximate the non- constant volatility that is a function o...
详细信息
Bidirectional hindsight options are a kind of exotic options. In the constant elasticity of variance (CEV) model, a combining binomial tree was built up to approximate the non- constant volatility that is a function of the underlying asset. On this basis, a simple and efficient recursive algorithm was developed to compute the risk-neutral probability of each different node for the underlying asset reaching maximum or minimum price and the total number of maxima (minima) in the binomial tree. With help of it, the computational problems can be effectively solved arising from the inherent complexities of different types of bidirectional hindsight options when the underlying asset evolves as the CEV model. Numerical results demonstrate the validity and the convergence of the binomial approach for the different parameter values set in CEV model.
Analyzed in detail the storage structures of tree, forest and binary tree, introduced the design ideas of the recursive algorithms about transformation between the forests and the corresponding binary trees, gave the ...
详细信息
Analyzed in detail the storage structures of tree, forest and binary tree, introduced the design ideas of the recursive algorithms about transformation between the forests and the corresponding binary trees, gave the descriptions of the recursive algorithms in C, and then analyzed the algorithms and evaluated them from the two aspects of time complexity and space complexity.
Multi-dimension linked lists is a new data structure,which has powerful function and well visiting performance. It can be applied in scientific computing analysis,image processing,database index and so on. With the de...
详细信息
ISBN:
(纸本)9787811240559
Multi-dimension linked lists is a new data structure,which has powerful function and well visiting performance. It can be applied in scientific computing analysis,image processing,database index and so on. With the development of computer science, multi-dimension linked lists may be applied in other rectangular coordinate system's spatial expression and multi-dimension linked lists recursive algorithm will give us very large significance. By the research of multi-dimension linked lists in this paper, it would be given out of the mathematical model and recursive algorithm of multi-dimension linked lists.
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.
暂无评论