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

Adaptive Estimation of Difficult-to-Measure Process Variables

AUTOMATIKA 2013年第2期54卷 166-177页

作者： Sliskovic, Drazen Grbic, Ratko Hocenski, Zeljko Univ Osijek Fac Elect Engn HR-31000 Osijek Croatia

There exist many problems regarding process control in the process industry since some of the important variables cannot be measured online. This problem can be significantly solved by estimating these difficult-tomeasure process variables. In doing so, the estimator is in fact an appropriate mathematical model of the process which, based on information about easy-to-measure process variables, estimates the current value of the difficultto-measure variable. Since processes are usually time-varying, the precision of the estimation based on the process model which is built on old data is decreasing over time. To avoid estimator accuracy degradation, model parameters should be continuously updated in order to track process behavior. There are a couple of methods available for updating model parameters depending on the type of process model. In this paper, PLSR process model is chosen as the basis of the difficult-to-measure process variable estimator while its parameters are updated in several ways - by the moving window method, recursive NIPALS algorithm, recursive kernel algorithm and Just-in-Time learning algorithm. Properties of these adaptive methods are explored on a simulated example. Additionally, the methods are analyzed in terms of computational load and memory requirements.

关键词： Process variable estimation Adaptive estimator Moving window recursive algorithms JITL algorithm

来源：评论

学校读者我要写书评

暂无评论

recursive Implementations of the Schmidt-Kalman 'Consider' Filter

引用

JOURNAL OF THE ASTRONAUTICAL SCIENCES 2013年第3-4期60卷 672-685页

作者： Zanetti, Renato D'Souza, Christopher Charles Stark Draper Lab Vehicle Dynam & Controls 17629 El Camino RealSuite 470 Houston TX 77058 USA NASA Johnson Space Ctr Houston TX 77058 USA NASA GN & C Autonomous Flight Syst Branch Aerosci & Flight Mech Div Johnson Space Ctr EG6 Houston TX 77058 USA

One method to account for parameters errors in the Kalman filter is to 'consider' their effect in the so-called Schmidt-Kalman filter. This paper addresses issues that arise when implementing a consider Kalman filter as a real-time, recursive algorithm. A favorite implementation of the Kalman filter as an onboard navigation subsystem is the UDU formulation. A new way to implement a UDU Schmidt Kalman filter is proposed. The non-optimality of the recursive Schmidt-Kalman filter is also analyzed, and a modified algorithm is proposed to overcome this limitation.

关键词： recursive algorithms Filters recursive Kalman filters

来源：评论

学校读者我要写书评

暂无评论

recursive Identification for Hammerstein Systems with Bounded Noise

Recursive Identification for Hammerstein Systems with Bounde...

引用

IEEE Annual Conference on Decision and Control

作者： Mathieu Pouliquen Eric Pigeon Olivier Gehan Control Group GREYC CNRS UMR 6072 ENSICAEN 06 Bd du Marechal Juin 14050 Caen Cedex France

ISBN: (纸本)9781467357159

In this paper, we consider the identification of Hammerstein systems in presence of bounded disturbances. The proposed identification algorithm is a recursive algorithm. It ensures that the estimation error is bounded and allows a real-time separation of the nonlinear part and linear part. Furthermore, some stability and convergence results are demonstrated and a simulation example is given to illustrate the performance of the presented method.

关键词： Bounded recursive algorithms recursive Authentication IDENTIFICATION SYSTEMS Estimation error

来源：评论

学校读者我要写书评

暂无评论

ON DATA SPARSIFICATION AND A recursive ALGORITHM FOR ESTIMATING A KERNEL-BASED MEASURE OF INDEPENDENCE

ON DATA SPARSIFICATION AND A RECURSIVE ALGORITHM FOR ESTIMAT...

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Pierre-Olivier Amblard Jonathan H. Manton Dept. of Mathematics&Statistics The University of Melbourne Australia Control and Signal Processing Lab The University of Melbourne Australia

ISBN: (纸本)9781479903573

Technological improvements have led to situations where data sets are sufficiently rich that in the interests of processing speed it is desirable to throw away samples that provide little additional information. This is referred to here as data sparsification. The first contribution is a study of a recently proposed data sparsification scheme;ideas from vector quantisation are used to assess its performance. Informed by this study, a modification of the data sparsification algorithm is proposed and applied to the problem of estimating a kernel-based measure of independence of two datasets. (Given i.i.d. observations from two random variables, x and y, the underlying problem are to determine whether or not x and y are independent of each other.) The second contribution of this paper is to make recursive an existing algorithm for measuring independence and able to operate on both raw data and on sparsified data generated by the aforementioned data sparsification algorithm. Compared with the original algorithm, the recursive algorithm is significantly faster due to its lower memory and computational requirements.

关键词： sparse dictionary kernel quantisation independence Quantization recursive algorithms Dictionaries as Topic Seeds Kernel Vector quantization algorithms Dataset extra message

来源：评论

学校读者我要写书评

暂无评论

Modified two-dimensional Otsu image segmentation algorithm and fast realisation

引用

IET IMAGE PROCESSING 2012年第4期6卷 426-433页

作者： Chen, Q. Zhao, L. Lu, J. Kuang, G. Wang, N. Jiang, Y. Natl Univ Def Technol Sch Elect Sci & Technol Changsha 410073 Hunan Peoples R China

Traditional two-dimensional (2D) Otsu method supposes that the sum of probabilities of diagonal quadrants in 2D histogram is approximately one. This studies experiments and theory prove that the sum of probabilities of off-diagonal quadrants in 2D histogram is not always very small and this could not be neglected. Therefore the assumption mentioned above in 2D Otsu method is inadequately reasonable. In this study, an improved 2D Otsu segmentation method and recursive algorithm are proposed. By calculating probabilities of diagonal quadrants in 2D histogram separately, modified method is acquired. Experimental results show that proposed method can obtain better performance of segmentation than the traditional 2D Otsu method. The computation complexity of improved 2D Otsu method is equal to traditional 2D Otsu method.

关键词： recursive algorithms image segmentation algorithm Diagonal Quadrant histograms

来源：评论

学校读者我要写书评

暂无评论

CHEBYSHEV POLYNOMIAL APPROXIMATION FOR ACTIVATION SIGMOID FUNCTION

引用

NEURAL NETWORK WORLD 2012年第4期22卷 387-393页

作者： Vlcek, Miroslav Czech Tech Univ Fac Transportat Sci Dept Appl Math CR-16635 Prague Czech Republic

An alternative polynomial approximation for the activation sigmoid function is developed here. It can considerably simplify the input/output operations of a neural network. The recursive algorithm is found for Chebysh... 详细信息

关键词： Sigmoid function Chebyshev polynomials recursive algorithms

来源：评论

学校读者我要写书评

暂无评论

引用

8th IEEE International Conference on Electron Devices and Solid State Circuit (EDSSC)

作者： Rassameyoungtong, Jade Srinonchat, Jakkree Rajamangala Univ Technol Dept Elect & Telecommun Engn Thanyaburi 12110 Rathumtani Thailand

ISBN: (纸本)9781467356961;9781467356947

The kalman filter is a recursive predictive filter that is based on the use of state space techniques and recursive algorithms. The advantage of kalman filter is, it estimates the state of dynamic system which can be disturbed by some noise. Thus this article presents the correlated noise reducing model using a kalman filter for speech vector quantization. The Q and R covariance constant parameters are investigated to provide the optimal performance with minimum noise of speech vector quantization signal. The results show that this model provides the minimum error as 1.0023 and 0.3622 for measurement error covariance and estimatation error covariance respectively.

关键词： kamal filter noise reducition Speech processing covariance constant recursive algorithms

来源：评论

学校读者我要写书评

暂无评论

Accurate Emitter Positioning using an Adaptive Method with Lagrange Interpolation based on a simple MIMO System

Accurate Emitter Positioning using an Adaptive Method with L...

引用

IEEE Radar Conference (RADAR)

作者： Nordsjo, Anders Erik SAAB Radar Syst Anal Jarfalla Sweden

ISBN: (纸本)9781467306584

An adaptive recursive algorithm based on a simple two sensor system for accurate estimation of the incident angle of a radar reflecting object or alternatively an active emitter is proposed. The overall objective is to find a low complexity method, which provides high resolution estimates and which is capable of adapting to a time varying scenario. Time delay estimation is followed by calculation of the actual incident angle. The considered simple system, comprised of two sensors only, is less complex and requires less computational power than does an array based receiver with possibly several antenna elements. An adaptive Lagrange interpolator is incorporated in order to obtain time delay estimates with a high resolution, in fractions of a sample. The possible performance of the proposed scheme is compared to time-varying lower CRB's, which are also derived here.

关键词： Lagrange interpolation multiple input multiple output systems angle of incidence computational power recursive algorithms antenna element emitters Self tuning time varying Receivers

来源：评论

学校读者我要写书评

暂无评论

Applying Online Multiplayer Educational Games based on Generic Shells to Enhance Learning of recursive algorithms: Students' Preliminary Results 2

Applying Online Multiplayer Educational Games based on Gener...

引用

2nd European Conference on Games-Based Learning

作者： Rossiou, Eleni Papadakis, Spyros Univ Macedonia Thessaloniki Greece Hellen Open Univ Patras Greece

ISBN: (纸本)9781906638184

This paper provides a methodology for the implementation of an online multiplayer educational game during a virtual classroom. We investigate the students' preliminary results of applying a multiplayer Educational Game to enhance learning of recursive algorithms. The game was provided during synchronous tele-educational service complementary to f2f lecturing in the compulsory (first semester) course "algorithms with C" of the Department of Applied Informatics at the University of Macedonia, Greece. The Recursion game was embedded in one of a series of synchronous virtual classrooms, the Tutoring Tele-Meetings (TTMs) for complementing face-to-face classroom instruction in conventional higher education with methods and tools of Open and Distance Education. Virtual Classrooms were implemented on CENTRA Symposium platform, through the server of the Hellenic Open University. Educational games were created on the Online Educational Games Central (EGC) of TELUQ University of Quebec, Canada. Savie's online EGC was designed as a virtual meeting-place for those interested in using games for educational purposes. Teachers can choose between either using pre-defined available games. Teachers need to add the content based on pre-determined objectives to generate a new educational game adapted to their audience. Our goal using a synchronous educational game was to provide our students with the opportunity to our students to work together, to review, to ascertain misunderstandings and to integrate what they have learned about recursive algorithms. Thirty three (33) undergraduates of first semester "played" the web-based educational game "recursive algorithms", which was created based on the "Snakes and Ladders" shell. The usability of integrating an educational game based on EGC platform in virtual classrooms, the students' motivation and their perceptions and attitudes were investigated. In details, the way how students faced up the "game" educational approach and their results i

关键词： Educational game multiplayer recursive algorithms virtual classroom

来源：评论

学校读者我要写书评

暂无评论

Convergence analysis of a recursive prediction error method.

引用

IFAC Proceedings Volumes 2012年第16期45卷 1496-1501页

作者： Soma Tayamon Torbjörn Wigren Uppsala University Department of Information Technology Division of System and Control Uppsala Sweden

A convergence analysis is performed for a recursive prediction error algorithm discretised using the midpoint integration method. Several conditions are formulated such that the stability of an associated differential equation can be tied to the local and global convergence properties of the algorithm. This shows that convergence to the true parameters is possible. The theoretical analysis of this paper is complemented by numerical example.

关键词： Nonlinear systems system identification prediction error methods recursive algorithms convergence analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：