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

IEEE International Workshop on Imaging Systems and Techniques

作者： Yang, Ming Zhong, Xiaoqing Yang, Wei Huo, Ju Harbin Inst Technol Control & Simulat Ctr Harbin 150006 Heilongjiang Pr Peoples R China

ISBN: (纸本)9781424434824

Aiming at solving the coupling and time-consuming problem in motion estimation from images, a recursive estimator comprised of two sequential Kalman filters is proposed. 3D motion of a rigid object can be decomposed into translation of a point fixed on the object, called rotation center, and rotation w.r.t. this point. The rotational parameters are proved to be separate with the others, which means the motion has the potential to be decoupled. Viewing the moving object as a dynamic system, called moving object system, motion estimating is formulated as a state estimation problem. Decoupling the moving object system into two sub-systems, then the dual-sequential-Kalman-filter can be designed to estimate the states of the moving object system, thus a high dimension filter is replaced with two reduced ones. As time cost in computing depends on the third power of the dimension of the estimator, the time-consuming problem is solved partly. The performance of dual-sequential-Kalman-filter is illustrated using both simulated and real image sequences, two important merits, accuracy and robustness, are presented with the experiment results.

关键词： computer vision motion estimation motion decoupling recursive algorithm motion from stereo images

来源：评论

学校读者我要写书评

暂无评论

Optimization multi -state series weighted k-out-of-n systems by ant colony algorithm

Optimization multi -state series weighted k-out-of-n systems...

引用

IEEE International Conference on Industrial Engineering and Engineering Management (IEEM 2009)

作者： Ebrahimipur, V. Shabani, A. Univ Tehran Dept Ind Engn Tehran Iran

ISBN: (纸本)9781424448692

In this paper a multi state series-weighted k-out-of-n system is presented. This system has S multi state weighted k-out-of-n subsystems that are seriely connected. A new approach is used for calculating reliability of the system. In this approach first we find reliability of each subsystem by recursive algorithm, and then the universal moment generating function (UMGF) is used to calculate reliability of the whole system. In the following reliability of the system is optimized. Multi-state system (MSS) reliability is defined as the ability to maintain a specified performance level. Objective function in the optimization model is maximizing the reliability of the system, constraint is cost and weight of the system and decision variables are the number and the versions of components for each subsystem. Since this problem is a combinatorial and Np-hard problem, ant colony algorithm is used for optimization

关键词： reliability multi state weighted k-out-of-n universal moment generating function (UMGF) recursive algorithm ant colony algorithm

来源：评论

学校读者我要写书评

暂无评论

GENERAL SOLUTION SCHEME TO SPATIAL COMPLEXITY OF recursive algorithm

GENERAL SOLUTION SCHEME TO SPATIAL COMPLEXITY OF RECURSIVE A...

引用

2006 International Conference on Machine Learning and Cybernetics(IEEE第五届机器学习与控制论坛)

作者： YONG SUN XUAN WANG School of Electronics and Information Engineering Shenzhen Polytechnic Shenzhen 518055 China Dept.of computer science Harbin Institute of Technology Shenzhen Graduate School Shenzhen 518055C

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.

关键词： recursive algorithm recursive tree Spatial complexity

来源：评论

学校读者我要写书评

暂无评论

A recursive algorithm for RMM and Its Application to Free Vibration of Multi-Span Continuous Rectangular Kirchhoff Plates

A Recursive Algorithm for RMM and Its Application to Free Vi...

引用

第二届全国压电和声波理论及器件技术研讨会

作者： Jun Zhu,Weiqiu Chen (Department of Civil Engineering,Zhejiang University,Hangzhou 310027,P.R.China)

A recursive algorithm based on the reverberation matrix method(RMM) is presented and used to exactly analyze the free vibration of multi-span continuous rectangular Kirchhoff plates with two opposite edges simply *** with the traditional RMM,this algorithm not only exhibits numerical stable in the high frequency range or/and for long span,also reduces the size for the data storage,especially for plates with many *** modifying the iterative formula,an improved recursive algorithm can be *** examples are given to demonstrate the effectiveness and efficiency of the proposed recursive *** method may be applied to calculate the dispersive characteristic of acoustic waves in laminated plate as well.

关键词： Free vibration Reverberation matrix method Continuous rectangular Kirchhoff plates recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

Computing A-optimal Designs for Weighted Polynomial Regression by Taylor Expansion

引用

Communications in Statistics: Theory & Methods 2009年第10期38卷 1622-1634页

作者： Fu-Chuen Chang fuchuen@*** Yang-Chan Su Department of Applied Mathematics National Sun Yat-sen University Taiwan ROC Trade-van Information Services CO. Taiwan ROC

This article is concerned with the problem of constructing A-optimal design for polynomial regression with analytic weight function on the interval [m - a, m + a], m, a > 0. It is shown that the structure of the optimal design depends on a and weight function only, as a close to 0. Moreover, if the weight function is an analytic function a, then a scaled version of optimal support points, and weights are analytic functions of a at a = 0. We make use of a Taylor expansion to provide a recursive procedure for calculating the A-optimal designs. Examples are presented to illustrate the procedures for computing the optimal designs. [ABSTRACT FROM AUTHOR]

关键词： A-Equivalence Theorem A-optimal design Implicit function theorem recursive algorithm Remez's exchange procedure Taylor expansion Weighted polynomial regression

来源：评论

学校读者我要写书评

暂无评论

A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem

引用

COMPUTERS & OPERATIONS RESEARCH 2008年第4期35卷 1281-1291页

作者： Cui, Yaodong Yang, Yuh Cheng, Xian Song, Peihua Guangxi Normal Univ Dept Comp Sci Guilin 541004 Peoples R China

A heuristic recursive algorithm for the two-dimensional rectangular strip packing problem is presented. It is based on a recursive structure combined with branch-and-bound techniques. Several lengths are tried to determine the minimal plate length to hold all the items. Initially the plate is taken as a block. For the current block considered, the algorithm selects an item, puts it at the bottom-left corner of the block, and divides the unoccupied region into two smaller blocks with an orthogonal cut. The dividing cut is vertical if the block width is equal to the plate width;otherwise it is horizontal. Both lower and upper bounds are used to prune unpromising branches. The computational results on a class of benchmark problems indicate that the algorithm performs better than several recently published algorithms. (C) 2006 Elsevier Ltd. All rights reserved.

关键词： strip packing cutting stock recursive algorithm branch and bound

来源：评论

学校读者我要写书评

暂无评论

Fast algorithms of Image Construction with a High Sampling Frequency

引用

OPTOELECTRONICS INSTRUMENTATION AND DATA PROCESSING 2009年第5期45卷 388-391页

作者： Ivanov, V. A. Kirichuk, V. S. Kosykh, V. P. Kulikov, V. A. Cherenkova, K. Yu. Russian Acad Sci Inst Automat & Electrometry Siberian Branch Pr Akad Koptyuga 1 Novosibirsk 630090 Russia

Some modifications of the algorithm of image construction with a high sampling frequency are proposed. These modifications multiply reduce the computational costs with an almost unchanged quality of the result. Software implementation of the proposed modifications of the algorithm allows the latter to be used in video surveillance systems for real-time formation of high-quality image fragments.

关键词： increase in the sampling frequency video sequence recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on the Order Picking Optimization Problem of the Automated Warehouse

Research on the Order Picking Optimization Problem of the Au...

引用

2009中国控制与决策会议

作者： Ma Shuhua~1,Hao Yanzhu~2 1.Northeastern University at Qinhuangdao,China,Oinhuangdao 066004 2.Northeastern University,Shenyang 110004,China

The increased use of automated storage and retrieval systems(AS/RS) is creating the need for computerized control algorithms to support the scheduling and picking *** research addresses an order picking problem in a multi-aisle automated warehouse,in which a stack crane performs storage and retrieval operations,and each item can be found in several storage *** objective is to propose algorithms that minimize the total time traveled by the stack crane to complete the retrieval process of *** traveling salesman problem(TSP) can calculate the shortest distance between cities,order picking problem of the automated warehouse and the TSP are *** this paper,we use recursive algorithm to solve order picking *** experiment proved that the order picking optimization of the stacker systems will be of great significance for the RS to improve its ***,the recursive algorithm has been applied to practice.

关键词： AS/RS TSP Stack Crane recursive algorithm Picking Optimization

来源：评论

学校读者我要写书评

暂无评论

A recursive algorithm for the reliability of a circular connected-(r, s)-out-of-(m, n):F lattice system

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2005年第1期49卷 21-34页

作者： Yamamoto, H Akiba, T Yamagata Coll Ind & Technol Dept Informat Management Engn Yamagata 9902473 Japan Tokyo Metropolitan Inst Technol Dept Prod Informat Syst Hino Tokyo 1910065 Japan

A circular connected-(r, s)-out-of-(m, n):F lattice system consists of m X n components arranged in a cylindrical grid. Each of m circles has n components, and this system fails if and only if there exists a grid of size r X s which all components are failed. A circular connected-(r, s)-out-of-(m, n):F lattice system might be used in reliability models for 'Feelers for measuring temperature on reaction chamber' and 'TFT Liquid Crystal Display system with 360 degrees wide area'. In this study, we proposed a new recursive algorithm for obtaining the reliability of a circular connected-(r, s)out-of-(m, n):F lattice system. We evaluated our proposed algorithms in terms of computing time and memory capacity. Furthermore, a numerical experiment comparing our proposed algorithm with Yamamoto and Miyakawa's algorithm [Yamamoto, H., & Miyakawa, M. (1996). Reliability of circular connected-(r, s)-out-of-(m, n):F lattice system. Journal of the Operations Research Society of Japan, 39(3), 389-406] showed that our proposed algorithm is more effective for systems with a large n. (c) 2005 Elsevier Ltd. All rights reserved.

关键词： circular connected-(r, s)-out-of-(m, n): F lattice system system reliability recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

Reliability bounds for multi-state k-out-of-n systems

引用

IEEE TRANSACTIONS ON RELIABILITY 2008年第1期57卷 53-58页

作者： Tian, Zhigang Yam, Richard C. M. Zuo, Ming J. Huang, Hong-Zhong Univ Alberta Dept Mech Engn Edmonton AB T6G 2G8 Canada City Univ Hong Kong Dept Manufacturing Engn & Engn Management Kowloon Hong Kong Peoples R China Univ Elect Sci & Technol China Sch Mechatron Engn Chengdu Peoples R China

algorithms have been available for exact performance evaluation of multi-state k-out-of-n systems. However, especially for complex systems with a large number of components, and a large number of possible states, obtaining "reliability bounds" would be an interesting, significant issue. Reliability bounds will give us a range of the system reliability in a much shorter computation time, which allow us to make decisions more efficiently. The systems under consideration are multi-state k-out-of-n systems with i.i.d. components. We will focus on the probability of the system in states below a certain state d, denoted by Q(sd). Based on the recursive algorithm proposed by Zuo & Tian [14] for performance evaluation of multi-state k-out-of-n Systems with i.i.d. components, a reliability bounding approach is developed in this paper. The upper, and lower bounds of Q(sd) are,calculated by reducing the length of the k vector when using the recursive algorithm. Using the bounding approach, we can obtain a good estimate of the exact Q(sd) value while significantly reducing the computation time. This approach is attractive, especially to complex systems with a large number of components, and a large number of possible states. A numerical example is used to illustrate the significance of the proposed bounding approach.

关键词： bound k-out-of-n systems multi-state recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：