％ [nearest_neighbours] = find_nearest_neighbours( database, desc, max_dist ) ％ Find the indices of the nearest neighbours of the given desriptors in the近邻点寻找算法，在非线性时间序列中很有用，是常用的算法
标签： find_nearest_neighbours nearest_neighbours database max_dist
上传时间： 2013-12-16
上传用户：CHENKAI
The main features of the considered identification problem are that there is no an a priori separation of the variables into inputs and outputs and the approximation criterion, called misfit, does not depend on the model representation. The misfit is defined as the minimum of the l2-norm between the given time series and a time series that is consistent with the approximate model. The misfit is equal to zero if and only if the model is exact and the smaller the misfit is (by definition) the more accurate the model is. The considered model class consists of all linear time-invariant systems of bounded complexity and the complexity is specified by the number of inputs and the smallest number of lags in a difference equation representation. We present a Matlab function for approximate identification based on misfit minimization. Although the problem formulation is representation independent, we use input/state/output representations of the system in order
标签： identification considered features separati
上传时间： 2016-09-20
上传用户：FreeSky
The toolbox solves a variety of approximate modeling problems for linear static models. The model can be parameterized in kernel, image, or input/output form and the approximation criterion, called misfit, is a weighted norm between the given data and data that is consistent with the model. There are three main classes of functions in the toolbox: transformation functions, misfit computation functions, and approximation functions. The approximation functions derive an approximate model from data, the misfit computation functions are used for validation and comparison of models, and the transformation functions are used for deriving one model representation from another. KEYWORDS: Total least squares, generalized total least squares, software implementation.
标签： approximate The modeling problems
上传时间： 2013-12-20
上传用户：15071087253
This brief introduce a kind of the framework construction to materialize the system. And an example was given with the discussion on the performence.
标签： construction materialize introduce framework
上传时间： 2013-12-26
上传用户：lhc9102
A few short years ago, the applications for video were somewhat confined—analog was used for broadcast and cable television, VCRs, set-top boxes, televisions and camcorders. Since then, there has been a tremendous and rapid conversion to digital video, mostly based on the MPEG-2 video compression standard. Today, in addition to the legacy DV, MPEG-1 and MPEG-2 audio and video com- pression standards, there are three new high- performance video compression standards. These new video codecs offer much higher video compression for a given level of video quality.
标签： applications for confined somewhat
上传时间： 2016-10-29
上传用户：bjgaofei
For solving the following problem: "There is No Free Lunch" Time Limit: 1 Second Memory Limit: 32768 KB One day, CYJJ found an interesting piece of commercial from newspaper: the Cyber-restaurant was offering a kind of "Lunch Special" which was said that one could "buy one get two for free". That is, if you buy one of the dishes on their menu, denoted by di with price pi , you may get the two neighboring dishes di-1 and di+1 for free! If you pick up d1, then you may get d2 and the last one dn for free, and if you choose the last one dn, you may get dn-1 and d1 for free. However, after investigation CYJJ realized that there was no free lunch at all. The price pi of the i-th dish was actually calculated by adding up twice the cost ci of the dish and half of the costs of the two "free" dishes. Now given all the prices on the menu, you are asked to help CYJJ find the cost of each of the dishes.
标签： Limit following solving problem
上传时间： 2014-01-12
上传用户：362279997
Problem B:Longest Ordered Subsequence A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 < i2 < ... < iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, e. g., (1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, e. g., (1, 3, 5, 8).
标签： Subsequence sequence Problem Longest
上传时间： 2016-12-08
上传用户：busterman
The application described in this document is for a product that is subject to continuous developments and improvements. All particulars of the product and its use contained in this document are given by ARM in good faith. However, all warranties implied or expressed, including but not limited to implied warranties of merchantability, or fitness for purpose, are excluded.
标签： application continuous developmen described
上传时间： 2016-12-16
上传用户：dave520l
Cfingerd is a free and secure finger daemon replacement for standard finger daemons such as GNU fingerd or MIT fingerd. It can enable/disable finger service to individual users, rather than to all users on a given host.
标签： finger replacement Cfingerd standard
上传时间： 2016-12-18
上传用户：1159797854
Implement a phone book system for employees of a company. Your program will output the following menu (1) Enter an employee and a phone pair to the system (2) Lookup an employee s phone number (3) Find out who is/are the person(s) of a given number (4) How many people are currently in the system (5) Delete an employee from the system (6) Output all employees name‐phone pair (7) How many phone numbers total in the current system (8) Quit When
标签： Implement employees following company
上传时间： 2013-12-17
上传用户：zhangliming420
