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

A recursive Method for Vector Generation in Non-increasing Order of Its Likelihood for All Binary Vectors and Its Application for Linear Block Code Decodings

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2012年第4期E95A卷 801-810页

作者： Kusaka, Takuya Yokoyama, Ryuhei Fujiwara, Toru Okayama Univ Grad Sch Nat Sci & Technol Okayama 7008530 Japan Osaka Univ Grad Sch Informat Sci & Technol Suita Osaka 5650871 Japan

A recursive and efficient method for generating binary vectors in non-increasing order of their likelihood for a set of all binary vectors is proposed. Numerical results on experiments show the effectiveness of this m... 详细信息

关键词： binary vector recursive algorithm MLD soft-decision enumeration

来源：评论

学校读者我要写书评

暂无评论

Online Kernel Principal Component Analysis: A Reduced-Order Model

引用

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 2012年第9期34卷 1814-1826页

作者： Honeine, Paul Univ Technol Troyes Inst Charles Delaunay Lab Modelisat & Surete Syst CNRSUMR 6279 F-10010 Troyes France

Kernel principal component analysis (kernel-PCA) is an elegant nonlinear extension of one of the most used data analysis and dimensionality reduction techniques, the principal component analysis. In this paper, we propose an online algorithm for kernel-PCA. To this end, we examine a kernel-based version of Oja's rule, initially put forward to extract a linear principal axe. As with most kernel-based machines, the model order equals the number of available observations. To provide an online scheme, we propose to control the model order. We discuss theoretical results, such as an upper bound on the error of approximating the principal functions with the reduced-order model. We derive a recursive algorithm to discover the first principal axis, and extend it to multiple axes. Experimental results demonstrate the effectiveness of the proposed approach, both on synthetic data set and on images of handwritten digits, with comparison to classical kernel-PCA and iterative kernel-PCA.

关键词： Principal component analysis online algorithm machine learning reproducing kernel Oja's rule recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

On-line principal component analysis with application to process modeling

引用

NEUROCOMPUTING 2012年 82卷 167-178页

作者： Tang, Jian Yu, Wen Chai, Tianyou Zhao, Lijie Northeastern Univ State Key Lab Synthet Automat Proc Ind Shenyang 110004 Peoples R China IPN CINVESTAV Dept Automat Control Mexico City 07360 DF Mexico Northeastern Univ Ctr Automat Res Shenyang 110004 Peoples R China Shenyang Inst Chem Technol Coll Informat Engn Shenyang 110142 Peoples R China

Principal component analysis (PCA) has been widely applied in process monitoring and modeling. The time-varying property of industrial processes requires the adaptive ability of the PCA. This paper introduces a novel PCA algorithm, named on-line PCA (OLPCA). It updates the PCA model according to the process status. The approximate linear dependence (ALD) condition is used to check each new sample. A recursive algorithm is proposed to reconstruct the PCA model with selected samples. Three types of experiments, a synthetic data, a benchmark problem, and a ball mill load experimental data, are used to illustrate our modeling method. The results show that the proposed OLPCA is computationally faster, and the modeling accuracy is higher than conventional moving window PCA (MWPCA) and recursive PCA (RPCA) for time-varying process modeling. (c) 2011 Elsevier By. All rights reserved.

关键词： Principal component analysis recursive algorithm On-line modeling Process modeling

来源：评论

学校读者我要写书评

暂无评论

Space curve fitting method based on fiber-optic curvature gages

引用

OPTICS AND LASER TECHNOLOGY 2012年第1期44卷 290-294页

作者： Di, Haiting NE Forestry Univ Coll Engn & Technol Harbin 150040 Peoples R China

A novel fiber-optic curvature gage, which can measure curvature directly, has been developed in recent years. In order to measure the bending and torsional deformation of space curve shape, an array of looped fiber-optic curvature gages are arranged on two symmetrical surfaces of a flexible layer to form a gage layer system. A calibration method of the gage layer system is proposed. Based on the bending curvature and twist values of space curve structure provided by gage layer system, a moving coordinate system is established by curve tangent and curvature vectors through a differential geometry method. The osculating plane is determined by twist angle in the moving coordinate system. The calculation of curve bending and analysis of the moving coordinate system transformation can be carried out in osculating plane. Then, the space curve is divided into many easily analyzed plane curves. recursive algorithm is used to obtain the position information of space curve points and the space curve fitting can be realized. The correlative formulas are deduced and the algorithm is validated by a simulation example. (C) 2011 Elsevier Ltd. All rights reserved.

关键词： Space curve fitting Fiber-optic curvature gage recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

Dynamic modeling of nonholonomic wheeled mobile manipulators with elastic joints using recursive Gibbs-Appell formulation

引用

SCIENTIA IRANICA 2012年第4期19卷 1092-1104页

作者： Korayem, M. H. Shafei, A. M. Shafei, H. R. Iran Univ Sci & Technol Dept Mech Engn Ctr Excellence Expt Solid Mech & Dynam Tehran Iran

This paper focuses on the study of dynamic modeling of nonholonomic wheeled mobile robotic manipulators, which consist of a serial manipulator with elastic joints and an autonomous wheeled mobile platform. To avoid computing the Lagrange multipliers associated with the nonholonomic constraints, the approach of Gibbs-Appell (G-A) formulation in recursive form is adopted. For modeling the system completely and precisely, dynamic interactions between the manipulator and the mobile platform, as well as both nonholonomic constraints associated with the no-slipping and the no-skidding conditions, are included. Based on developed formulation, an algorithm is proposed that recursively and systematically derives the equation of motion. In this algorithm, in order to improve the computational complexity, all mathematical operations are done by only 3 x 3 and 3 x 1 matrices. Also, all dynamic expressions of a link are expressed in the same link local coordinate system. Finally, two computational simulations for mobile manipulators with rigid and elastic joints are presented to indicate the capability of this algorithm in generating the equation of motion of mobile robotic manipulators with high degree of freedom. (C) 2012 Sharif University of Technology. Production and hosting by Elsevier B.V. All rights reserved.

关键词： Mobile manipulator Nonholonomic constraint recursive algorithm Gibbs-Appell methodology Computational complexity

来源：评论

学校读者我要写书评

暂无评论

A simple recursive algorithm for simultaneous magnitude and frequency estimation

引用

IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT 2008年第6期57卷 1207-1214页

作者： Kusljevic, Miodrag D. Termoelektro Enel AD Belgrade 11060 Serbia

A new approach in the design of digital algorithms for simultaneous local system magnitude and frequency estimation of a signal with time-varying frequency is presented. The algorithm is derived using the maximum likelihood method. The pure sinusoidal voltage model was assumed. The investigation has been simplified because the total similarity to the state of the problem of de offset and frequency estimation has been noticed. Finite impulse response (FIR) digital filters are used to minimize the noise effect and to eliminate the presence of harmonic effects. The algorithm showed a very high level of robustness, as well as high measurement accuracy over a wide range of frequency changes. The algorithm convergence provided fast response and adaptability. This technique provides accurate estimates in about 25 ms and requires modest computations. The theoretical bases of the technique are described. To demonstrate the performance of the developed algorithm, computer-simulated data records are processed. The proposed algorithm has been tested in a laboratory to establish its feasibility in a real-time environment.

关键词： computer relaying frequency measurement magnitude measurement maximum likelihood method (MLM) parameter estimation recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

New recursive algorithm for matrix inversion

引用

Journal of Systems Engineering and Electronics 2008年第2期19卷 381-384页

作者： Cao Jianshu Wang Xuegang Coll. of Electronic Engineering Univ. of Electronic Science and Technology of China Chengdu 610054 P. R. China

To reduce the computational complexity of matrix inversion, which is the majority of processing in many practical applications, two numerically efficient recursive algorithms （called algorithms I and II, respectively） are presented. algorithm I is used to calculate the inverse of such a matrix, whose leading principal minors are all nonzero. algorithm II, whereby, the inverse of an arbitrary nonsingular matrix can be evaluated is derived via improving the algorithm I. The implementation, for algorithm II or I, involves matrix-vector multiplications and vector outer products. These operations are computationally fast and highly parallelizable. MATLAB simulations show that both recursive algorithms are valid.

关键词： recursive algorithm matrix inversion matrix-vector product leading principal minor （LPM）.

来源：评论

学校读者我要写书评

暂无评论

A recursive algorithm for the rectangular guillotine strip packing problem

引用

ENGINEERING OPTIMIZATION 2008年第4期40卷 347-360页

作者： Cui, Y. Gu, T. Zhong, Y. Guangxi Normal Univ Dept Comp Sci Guilin 541004 Peoples R China Guilin Univ Elect Technol Dept Comp Sci Guilin 541004 Peoples R China

This article presents a recursive heuristic algorithm to generate cutting patterns for the rectangular guillotine strip packing problem in which a set of rectangular items must be cut from the strip such that the consumed strip length is minimized. The strip is placed with its length along the horizontal direction, and is divided into several segments with vertical cuts. The length of a segment is determined by the item placed at the bottom. Orthogonal cuts divide the segments into blocks and finished items. 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. Rotation of the items by 90 is allowed. Both lower and upper bounds are used to prune unpromising branches. The computational results indicate that the algorithm performs better than several recently published algorithms.

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

来源：评论

学校读者我要写书评

暂无评论

Adapted multivariate Pade approximation

引用

APPLIED NUMERICAL MATHEMATICS 2012年第9期62卷 1061-1076页

作者： Allouche, Hassane Mint El Agheb, Ebby Ghanou, Noura Fac Sci Dept Math & Comp Sci Meknes Morocco

To generalize the concept of Pade approximation for functions to more than one variable, several definitions have been introduced. We distinguish two types of definitions, the homogeneous multivariate Pade approximation and the general multivariate Pade approximation. Both definitions have advantages and disadvantages. In this work we present a new definition, of the multivariate Pade approximation, adapted to one class of functions. This definition is designed to avoid disadvantages of both definitions. The idea is that special cases deserve special treatment, which will enable approximants to show the character of function to approach and thus reduce the error of approximation and the computation cost. The main result obtained as consequence of this definition is some convergence results of multivariate Stieltjes series and a generalization of the Montessus De Ballore theorem for this class of multivariate functions. (c) 2011 IMACS. Published by Elsevier B.V. All rights reserved.

关键词： Homogeneous multivariate Pade approximation General multivariate Pade approximation Bloc structure of Pade table recursive algorithm Montessus theorem Stieltjes series Pseudo-multivariate function

来源：评论

学校读者我要写书评

暂无评论

A Novel Spatial-Temporal Multi-Scale Method for Detection and Analysis of Infrared Multiple Moving Objects

A Novel Spatial-Temporal Multi-Scale Method for Detection an...

引用

21st International Conference on Pattern Recognition (ICPR)

作者： Zhang, Tianzu Li, Hao Chen, Jianchong Huazhong Univ Sci & Technol Inst Pattern Recognit & Artificial Intelligence Wuhan 430074 Peoples R China

ISBN: (纸本)9784990644109;9781467322164

In this paper, a novel spatial-temporal multi-scale method (STMSM) is proposed to solve the problem of detecting multiple moving objects on complex background. Moving objects have multi-scale features both in spatial and temporal domain. The motion salience sub-spaces determine the moving features including position, size and trajectory of each moving object, then the problem of detecting moving objects can be transformed into searching optimal sub-spaces with different scales. This paper proposes a recursive algorithm for estimating motion salience in 3D space and an optimal determinant criterion. These can detect multiple objects at different spatial-temporal scales and extract their features on complex background. The experimental results show this method is effective in detecting multiple moving objects.

关键词： Moving object detection recursive algorithm Spatial-temporal multi-scale motion salience

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：