Knowledge of the process noise covariance matrix is essential for the application of Kalman filtering. However, it is usually a difficult task to obtain an explicit expression of for large time varying systems. This paper looks at an adaptive Kalman filter method for dynamic harmonic state estimation and harmonic injection tracking.
標簽： application covariance Knowledge essential
上傳時間： 2014-01-19
上傳用戶：litianchu
Pre-designed and pre-verified hardware and software blocks can be combined on chips for many different applicationsVthey promise large productivity gains.
標簽： Pre-designed pre-verified and hardware
上傳時間： 2015-10-08
上傳用戶：凌云御清風
real property management,information management system developed by VB, using very conveniently.good real property management has such large information
標簽： management conveniently information developed
上傳時間： 2013-12-24
上傳用戶：朗朗乾坤
In 1960, R.E. Kalman published his famous paper describing a recursive solution to the discrete-data linear filtering problem. Since that time, due in large part to advances in digital computing, the Kalman filter has been the subject of extensive research and application, particularly in the area of autonomous or assisted navigation.
標簽： R.E. discrete-dat describing published
上傳時間： 2015-10-22
上傳用戶：2404
In 1960, R.E. Kalman published his famous paper describing a recursive solution to the discretedata linear filtering problem [Kalman60]. Since that time, due in large part to advances in digital computing, the Kalman filter has been the subject of extensive research and application, particularly in the area of autonomous or assisted navigation. A very “friendly” introduction to the general idea of the Kalman filter can be found in Chapter 1 of [Maybeck79], while a more complete introductory discussion can be found in [Sorenson70], which also contains some interesting historical narrative.
標簽： R.E. discretedata describing published
上傳時間： 2015-10-22
上傳用戶：a673761058
In this report we provide an overview of several closely related methods developed during the last few yers, to smooth, denoise, edit, compress, transmit, and animate very large polygonal models.
標簽： developed overview provide closely
上傳時間： 2013-12-16
上傳用戶：ippler8
This paper studies the problem of categorical data clustering, especially for transactional data characterized by high dimensionality and large volume. Starting from a heuristic method of increasing the height-to-width ratio of the cluster histogram, we develop a novel algorithm – CLOPE, which is very fast and scalable, while being quite effective. We demonstrate the performance of our algorithm on two real world
標簽： data transactional categorical clustering
上傳時間： 2015-10-24
上傳用戶：evil
C++ Template Metaprogramming sheds light on the most powerful idioms of today s C++, at long last delivering practical metaprogramming tools and techniques into the hands of the everyday programmer. A metaprogram is a program that generates or manipulates program code. Ever since generic programming was introduced to C++, programmers have discovered myriad "template tricks" for manipulating programs as they are compiled, effectively eliminating the barrier between program and metaprogram. While excitement among C++ experts about these capabilities has reached the community at large, their practical application remains out of reach for most programmers. This book explains what metaprogramming is and how it is best used. It provides the foundation you ll need to use the template metaprogramming effectively in your own work.
標簽： Metaprogramming Template powerful idioms
上傳時間： 2013-11-30
上傳用戶：aix008
Tracking a moving object through several frames, provided changes from frame to frame are on the order of +-(10 + "X Range") pixels in the X direction and +-(10 + "Y Range") in the Y direction is done automatically because of a relatively large area of exploration during the search for an optimal (new) position for a particular control point and a very strong force exerted by large values of the image gradient.
標簽： frame Tracking provided changes
上傳時間： 2015-11-17
上傳用戶：zgu489
The present paper deals with the problem of calculating mean delays in polling systems with either exhaustive or gated service. We develop a mean value analysis (MVA) to compute these delay figures. The merits of MVA are in its intrinsic simplicity and its intuitively appealing derivation. As a consequence, MVA may be applied, both in an exact and approximate manner, to a large variety of models.
標簽： with calculating present polling
上傳時間： 2014-11-17
上傳用戶：kelimu
