ICP fit points in data to the points in model. Fit with respect to minimize the sum of square errors with the closest model points and data points. Ordinary usage: [R, T] = icp(model,data) INPUT: model - matrix with model points, data - matrix with data points, OUTPUT: R - rotation matrix and T - translation vector accordingly so newdata = R*data + T . newdata are transformed data points to fit model see help icp for more information
標簽： points the minimize respect
上傳時間： 2014-01-02
上傳用戶：gyq
％ because we do not truncate and shift the convolved input ％ sequence, the delay of the desired output sequence wrt ％ the convolved input sequence need only be the delay ％ introduced by the ideal weight vector centred at n=5
標簽： the convolved truncate sequence
上傳時間： 2015-12-27
上傳用戶：www240697738
celestia源代碼，Celestia, a real-time 3D space simulation featuring a database of over 100000 stars, nearly a hundred solar system, objects, and a complete catalog of extrasolar planets.
上傳時間： 2013-12-26
上傳用戶：縹緲
這是基于jsoncpp項目寫擴展功能，jsoncpp只支持簡單的系列化，我寫了JsonArchive.h類，并提供了測試源代碼tt.cpp。擴展了value，自動支持list、vector的系列化，支持2進制數據的系列化。這可是我花費了不少時間才搞定的。 包中不包含jsoncpp，請使用者自己下載。
上傳時間： 2014-09-06
上傳用戶：aa54
In this article, we present an overview of methods for sequential simulation from posterior distributions. These methods are of particular interest in Bayesian filtering for discrete time dynamic models that are typically nonlinear and non-Gaussian. A general importance sampling framework is developed that unifies many of the methods which have been proposed over the last few decades in several different scientific disciplines. Novel extensions to the existing methods are also proposed.We showin particular how to incorporate local linearisation methods similar to those which have previously been employed in the deterministic filtering literature these lead to very effective importance distributions. Furthermore we describe a method which uses Rao-Blackwellisation in order to take advantage of the analytic structure present in some important classes of state-space models. In a final section we develop algorithms for prediction, smoothing and evaluation of the likelihood in dynamic models.
標簽： sequential simulation posterior overview
上傳時間： 2015-12-31
上傳用戶：225588
To estimate the input-output mapping with inputs x ％ and outputs y generated by the following nonlinear, ％ nonstationary state space model: ％ x(t+1) = 0.5x(t) + [25x(t)]/[(1+x(t))^(2)] ％ + 8cos(1.2t) + process noise ％ y(t) = x(t)^(2) / 20 + 6 squareWave(0.05(t-1)) + 3 ％ + time varying measurement noise ％ using a multi-layer perceptron (MLP) and both the EKF and ％ the hybrid importance-samping resampling (SIR) algorithm.
標簽： input-output the generated following
上傳時間： 2014-01-05
上傳用戶：royzhangsz
Flirt is an SWF rendering library. Flirt contains a parser for reading SWF format files, a rasterizer for rendering the vector shaped into bitmaps, and an actionscript engine
標簽： Flirt SWF rendering contains
上傳時間： 2014-01-13
上傳用戶：璇珠官人
本手冊包含如下內容 J2ME Web Services RPC (JSR 172) J2ME Web Services XML (JSR 172) Java APIs for Bluetooth (JSR 82) Location API (JSR 179) MID Profile 2.0 (JSR-118) Mobile Media API 1.1 (JSR-135) Mobile 3D Graphics API (JSR184) PDA Pim 1.0 (JSR 75) PDA FileConnection (JSR 75) J2ME Web Services RPC (JSR 172) Scalable 2D Vector Graphics API (JSR-226) SIP API (JSR 180) Wireless Messaging API 1.0 (JSR 120) WTK2.2 相關文檔 Nokia UI API 1.1
上傳時間： 2016-01-08
上傳用戶：GavinNeko
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
對應論文寫的時空碼的仿真程序。為2天線，BPSK調制模式。自己寫的Space time code simulation提供給大家
上傳時間： 2014-01-27
上傳用戶：Shaikh
