In this paper, we consider the problem of filtering in relational hidden Markov models. We present a compact representation for such models and an associated logical particle filtering algorithm. Each particle contains a logical formula that describes a set of states. The algorithm updates the formulae as new observations are received. Since a single particle tracks many states, this filter can be more accurate than a traditional particle filter in high dimensional state spaces, as we demonstrate in experiments.
标签： relational filtering consider problem
上传时间： 2016-01-02
上传用户：海陆空653
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.
标签： Particle Filters Rao-Blackwellised exploit
上传时间： 2016-01-02
上传用户：refent
This library provides a C++ interface to XML files. It uses libxml 2 to access the XML files, and in order to configure libxml++ you must have both libxml and pkg-config installed.
标签： files interface XML provides
上传时间： 2016-01-05
上传用户：firstbyte
radius协议源码÷The Radius Stack will connect to a Radius Server. This stack implementation is built upon the UdpStack which is available in the radius{version}/util directory. A minimal set of VSAs (Vendor Specific Attributes are supported by this stack). The Radius Stack should be used as a base class. In order to implement a larger set of VSAs, one will need to subclass from the Radius Stack and implement the functionality within the virtual function processVsa(). The Radius Stack supports mostly accounting messages. The authentcation messages will be supported in a future release. A test program has been provided in the radius directory. This program shows how to subclass from the RadiusStack and how to use the api.
标签： Radius implementation connect radius
上传时间： 2013-12-12
上传用户：坏天使kk
bulk endpoint endless source/sink firmware. EP2OUT will always accept a bulk OUT EP4OUT will always accept a bulk OUT EP6IN will always return a 512 byte packet. The packet contains an incrementing byte starting at 0x02. Since EP6 always returns a 512 byte packet, this endpoint should never be accessed except with a high-speed host controller. EP8IN will continuously return the packet most recently written to EP4OUT
标签： bulk will endpoint firmware
上传时间： 2016-01-14
上传用户：sk5201314
ARMask.The ARM has six operating modes: • User (unprivileged mode under which most tasks run) • FIQ (entered when a high priority (fast) interrupt is raised) • IRQ (entered when a low priority (normal) interrupt is raised) • Supervisor (entered on reset and when a Software Interrupt instruction is executed) • Abort (used to handle memory access violations) • Undef (used to handle undefined instructions) * ARM Architecture Version 4 adds a seventh mode: • System (privileged mode using the same registers as user mode)
标签： unprivileged operating ARMask modes
上传时间： 2013-12-24
上传用户：bcjtao
The TMS320C64x™ DSPs (including the TMS320DM642 device) are the highest-performance fixed-point DSP generation in the TMS320C6000™ DSP platform. The TMS320DM642 (DM642) device is based on the second-generation high-performance, advanced VelociTI™ very-long-instruction-word (VLIW) architecture (VelociTI.2™ ) developed by Texas Instruments (TI), making these DSPs an excellent choice for digital media applications. The C64x™ is a code-compatible member of the C6000™ DSP platform.
标签： highest-performance fixed-point TMS 320
上传时间： 2013-12-21
上传用户：watch100
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.
标签： represented integers group items
上传时间： 2016-01-17
上传用户：jeffery
This article describes a sniffer for Windows. WinSniff is an application for capturing packets on the network. It displays all the packets that are transmitted on the local network and gives detailed information about each header in the packet. In order to keep it simple, I am not dealing with application level protocols. If you are interested, you can add features to support various application level protocols such as SMTP, FTP, NETBIOS etc
标签： application describes capturing for
上传时间： 2016-01-22
上传用户：lijianyu172
You imagine? Right, there s more than one possibility, this time I ll give you tree. One for your private data, one for the common data in order to receive data from other applications like Excel, WinWord etc. and at last, I ll give you a handy-dandy class you can derive ANY MFC object from, to make it a drop target
标签： possibility imagine Right there
上传时间： 2013-12-21
上传用户：jichenxi0730
