检索结果-内蒙古大学图书馆

International Conference on Advanced Research on Computer Education, Simulation and Modeling

作者： Wang, Min Li, Yunfei Weinan Teachers Univ Dept Comp Sci Weinan Shanxi Peoples R China

ISBN: (纸本)9783642217821

This paper introduces in detail the design and analysis of the algorithm of computing the number of descendant nodes of each node in the triple tree based on analyzing the special storage structures of triple tree. The recursive algorithm description in C is introduced subsequently after the design ideas, the implementation methods, and the concrete steps of the algorithm were given. Finally, the algorithm is evaluated from the two aspects of time complexity and space complexity.

关键词： Triple tree Descendant The triple tree preorder traversal recursive algorithm Time complexity Space complexity

来源：评论

学校读者我要写书评

暂无评论

Study on Degree of Engineering Changes Based on Product Family

Study on Degree of Engineering Changes Based on Product Fami...

引用

2nd International Conference on Manufacturing Science and Engineering

作者： Zeng, Fuhong Zhou, Lanhua Li, Zerong Panzhihua Univ Panzhihua 617000 Peoples R China

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.

关键词： Engineering Changes Bill of Material Change Propagation recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

The algorithm and realization for the optimization layout of irregular parts

The algorithm and realization for the optimization layout of...

引用

6th International Forum on Strategic Technology, IFOST 2011

作者： Guo, Wenlan Zhang, Tong Computer Science and Technology College Harbin Univ.Sci.Tech. Harbin China Tianyuan CNC Equipment Co. Ltd. Harbin Institute of Technology Harbin China

ISBN: (纸本)9781457703966

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 main idea of this algorithm is to continuously nest parts by a local optimal principle until the end of the layout which includes a recursive algorithm. The experimental results show that the algorithm not only calculates quickly, but also can get a more satisfied layout result. © 2011 IEEE.

关键词： algorithm design and analysis Industries Layout Production Shape Software Steel irregular part optimization layout irregular parts local optimal principle maintenance engineering optimisation prelayout method rectangular area recursive algorithm recursive functions scan line algorithm the layout the nested layout the scan algorithm

来源：评论

学校读者我要写书评

暂无评论

Modeling of Distributed RLC Interconnect and Transmission Line via Closed Forms and recursive algorithms

引用

IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS 2010年第1期18卷 119-130页

作者： Wang, Sheng-Guo Wang, Ben Univ N Carolina Coll Engn Charlotte NC 28223 USA IBM Corp Res Triangle Pk NC 27709 USA

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.

关键词： Closed form distributed RLC circuit interconnect modeling recursive algorithm transmission line

来源：评论

学校读者我要写书评

暂无评论

Constrained Hermite Interpolation for Mesh-Free Derivative Estimation Near and On Boundaries

引用

AIAA JOURNAL 2011年第10期49卷 2248-2257页

作者： McDonald, Robert A. Ramos, Alejandro Calif Polytech State Univ San Luis Obispo San Luis Obispo CA 93407 USA

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.

关键词： Taylor Series Pressure Coefficient Dirichlet Boundary Condition Compressible Flow Iterative Solution MATLAB Freestream Velocity Finite Difference Method recursive algorithm Unstructured Grid

来源：评论

学校读者我要写书评

暂无评论

Prediction of outstanding payments in a Poisson cluster model

引用

SCANDINAVIAN ACTUARIAL JOURNAL 2011年第3期 214-237页

作者： Jessen, Anders Hedegaard Mikosch, Thomas Samorodnitsky, Gennady Univ Copenhagen Dept Math DK-2100 Copenhagen Denmark Cornell Univ Sch Operat Res & Informat Engn Ithaca NY 14853 USA

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.

关键词： Poisson cluster model Prediction Claims reserving Chain ladder method Panjer distributions (a, b) class recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

A NEW recursive FORMULATION FOR FAST ESTIMATION OF TIME-VARYING UNKNOWN INPUT. APPLICATION FOR ESTIMATING A PARTICLE ACCELERATION

引用

INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL 2011年第7A期7卷 3779-3797页

作者： Sircoulomb, Vincent Hoblos, Ghaleb Chafouk, Houcine Ragot, Jose Inst Rech Syst Elect EMbarques EA 4353 F-76801 St Etienne France Inst Natl Polytech Lorraine CRAN CNRS UMR 7039 F-54516 Vandoeuvre Les Nancy France

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.

关键词： Unknown input estimation Kalman filtering Least squares recursive algorithm Integral effect Computation Tracking

来源：评论

学校读者我要写书评

暂无评论

Pricing Bidirectional hindsight Options in Binomial CEV Model

Pricing Bidirectional hindsight Options in Binomial CEV Mode...

引用

2011 International Conference on Economics and Finance Research（ICEFR2011）

作者： Bin Peng1 School of Business,Renmin University 100872 Beijing P.R.ChinaFei Peng2 2Electrical &Computer Engineering UBC,Vancouver,B.C.V6T 1Z4 Canada

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.

关键词： CEV mode binomia ltree recursive algorithm bidirectional hindsight options

来源：评论

学校读者我要写书评

暂无评论

The recursive Transformation algorithms between Forest and Binary Tree

The Recursive Transformation Algorithms between Forest and B...

引用

The Second International Conference on Theoretical and Mathematical Foundations of Computer Science（ICTMF 2011）

作者： Min Wang Computer Science Department Weinan Teachers University

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.

关键词： Tree Forest Binary tree recursive algorithm Time complexity Space complexity

来源：评论

学校读者我要写书评

暂无评论

Create multi-dimension linked lists on recursive algorithm and the application

引用

26th Chinese Control Conference

作者： Chen Guangyi He Zhaoyong Foshan Univ Automacat Dept Foshan 528200 Peoples R China South China Univ Technol Coll Automatizat Sci & Engn Guany Zhou 510640 Peoples R China

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.

关键词： multi-dimension linked lists crunodes recursive algorithm data structures data structures

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：