An unsatisfactory property of particle filters is that they may become inefficient when the observation noise is low. In this paper we consider a simple-to-implement particle filter, called ‘LIS-based particle filter’, whose aim is to overcome the above mentioned weakness. LIS-based particle filters sample the particles in a two-stage process that uses information of the most recent observation, too. Experiments with the standard bearings-only tracking problem indicate that the proposed new particle filter method is indeed a viable alternative to other methods.
標(biāo)簽： unsatisfactory inefficient property particle
上傳時(shí)間： 2014-01-11
上傳用戶(hù)：大三三
Rao-Blackwellised Particle Filters (RBPFs) are a class of Particle Filters (PFs) that exploit conditional dependencies between parts of the state to estimate. By doing so, RBPFs can improve the estimation quality while also reducing the overall computational load in comparison to original PFs. However, the computational complexity is still too high for many real-time applications. In this paper, we propose a modified RBPF that requires a single Kalman Filter (KF) iteration per input sample. Comparative experiments show that while good convergence can still be obtained, computational efficiency is always drastically increased, making this algorithm an option to consider for real-time implementations.
標(biāo)簽： Particle Filters Rao-Blackwellised exploit
上傳時(shí)間： 2016-01-02
上傳用戶(hù)：refent
This forced me to write about more interesting and comprehensive sorting methods, the result of which is this one. Through this writing I have tried to give in-depth coverage of the entire sort algorithm I hope Peter wouldn t mind reading it. This article assumes that you really don t know about the iterations, looping, and so forth hence, it explains these in detail first.
標(biāo)簽： comprehensive interesting methods sorting
上傳時(shí)間： 2016-01-10
上傳用戶(hù)：athjac
We have a group of N items (represented by integers from 1 to N), and we know that there is some total order defined for these items. You may assume that no two elements will be equal (for all a, b: a<b or b<a). However, it is expensive to compare two items. Your task is to make a number of comparisons, and then output the sorted order. The cost of determining if a < b is given by the bth integer of element a of costs (space delimited), which is the same as the ath integer of element b. Naturally, you will be judged on the total cost of the comparisons you make before outputting the sorted order. If your order is incorrect, you will receive a 0. Otherwise, your score will be opt/cost, where opt is the best cost anyone has achieved and cost is the total cost of the comparisons you make (so your score for a test case will be between 0 and 1). Your score for the problem will simply be the sum of your scores for the individual test cases.
標(biāo)簽： represented integers group items
上傳時(shí)間： 2016-01-17
上傳用戶(hù)：jeffery
網(wǎng)絡(luò)日志!當(dāng)前免費(fèi)FTP服務(wù)到處都有,我的這個(gè)APPLET用意是:利用起這些免費(fèi)空間,在自己的網(wǎng)站上實(shí)現(xiàn)日志,相當(dāng)于把數(shù)據(jù)庫(kù)建在這些免費(fèi)的FTP空間上,該代碼已經(jīng)在本地FTP服務(wù)器上測(cè)試通過(guò),在測(cè)試外網(wǎng)FTP服務(wù)器失敗,只要查一查BUG就可以啟用的,我當(dāng)時(shí)想法是統(tǒng)籌應(yīng)用各方的FTP空間,并在自己有限的穩(wěn)定空間上保存鏈接資料,從而保證空間的免費(fèi)和穩(wěn)定,原理有點(diǎn)象花生殼這個(gè)程序,希望同志們實(shí)現(xiàn)我的想法!別忘了SHARE哦,WE SHARE SO WE FREE!
標(biāo)簽： FTP APPLET 日志 測(cè)試
上傳時(shí)間： 2014-12-03
上傳用戶(hù)：陽(yáng)光少年2016
This directory contains the Genetic Algorithm Optimization Toolbox for Matlab To use this, if you are local to NCSU and have AFS access to this directory, simply extend the matlab path using the following command. You can also place this command in a file called startup.m. Everytime you start Matlab in the directory containing this file, the path will always be extended.
標(biāo)簽： Optimization Algorithm directory contains
上傳時(shí)間： 2014-01-18
上傳用戶(hù)：songnanhua
The Linux Enterprise Cluster explains how to take a number of inexpensive computers with limited resources, place them on a normal computer network, and install free software so that the computers act together like one powerful server. This makes it possible to build a very inexpensive and reliable business system for a small business or a large corporation. The book includes information on how to build a high-availability server pair using the Heartbeat package, how to use the Linux Virtual Server load balancing software, how to configure a reliable printing system in a Linux cluster environment, and how to build a job scheduling system in Linux with no single point of failure. The book also includes information on high availability techniques that can be used with or without a cluster, making it helpful for System Administrators even if they are not building a cluster. Anyone interested in deploying Linux in an environment where low cost computer reliability is important will find this book useful.
標(biāo)簽： inexpensive Enterprise computers explains
上傳時(shí)間： 2014-11-29
上傳用戶(hù)：zhangliming420
Welcome to the Wrox Press C++ tutorial "I hope you ll enjoy reading this tutorial with your portable, your work, or your home PC. It s a perfect companion to the Introduction to Visual C++ 6.0 Standard Edition manual and is a proven aid to understanding the C++ language. The material in this tutorial is adapted from my book Beginning Visual C++ 6.0, to provide you with a thorough grounding in pure C++. I ve been careful to address the new standards in C++ laid out by the ANSI and ISO committees and I encourage you to adopt these conventions so that your programs are maintainable for years to come.
標(biāo)簽： tutorial Welcome reading portabl
上傳時(shí)間： 2016-01-26
上傳用戶(hù)：wsf950131
This the second tutorial of the Writing Device Drivers series. There seems to be a lot of interest in the topic, so this article will pick up where the first left off. The main focus of these articles will be to build up little by little the knowledge needed to write device drivers. In this article, we will be building on the same example source code used in part one. In this article, we will expand on that code to include Read functionality, Handle Input/Ouput Controls also known as IOCTLs, and learn a bit more about IRPs.
標(biāo)簽： the interest tutorial Drivers
上傳時(shí)間： 2016-01-28
上傳用戶(hù)：lmeeworm
OpenSVM was developped under Visual C++ 6.0 SP6, You can open the workspace file(*.dsw) in the opensvm-src folder. The folder include the svm.h and svm.cpp which in the libsvm (Copyright (c) 2000-2007 Chih-Chung Chang and Chih-Jen Lin All rights reserved) in the opensvm-src\libsvm. However, the files svm.h and svm.cpp codes were copied/merged into stdafx.h and stdafx.cpp in order to support the development, and OpenSVM still use other codes of libsvm. So you can see the libsvm package in the source package. You can open and build it with Visual C++ 6.0. Note: the problems must be in LIBSVM format. OpenSVM project page: http://sourceforge.net/projects/opensvm If you had any question, please mail to: cloudbyron@gmail.com
標(biāo)簽： developped the workspace OpenSVM
上傳時(shí)間： 2016-01-30
上傳用戶(hù)：asdfasdfd
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
