登录
首页 » matlab » association_NNSF

association_NNSF

于 2010-09-09 发布 文件大小:3KB
0 196
下载积分: 1 下载次数: 99

代码说明:

  matlab实现的目标跟踪数据关联程序,可以用于目标跟踪领域。(matlab implementation of target tracking data association procedure can be used for target tracking.)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • WAVELAB850
    功能强大、包含多种算法的小波分析工具箱,须在matlab下安装(A powerful, multi-algorithm of wavelet analysis toolbox, to be installed in the matlab)
    2009-09-17 21:09:40下载
    积分:1
  • analysis
    说明:  几个关于matlab数值分析的源程序,跟大家交流学习一下!(Several numerical analysis on the matlab source, learn about the exchange with you!)
    2011-03-13 13:59:46下载
    积分:1
  • watermarking
    一种基于matlab的数字水印的算法实现,该算法可以进行仿真(Matlab-based digital watermarking algorithm, the algorithm can simulate the)
    2009-12-28 15:07:38下载
    积分:1
  • PWM
    直流电源通过PWM发生器经由单相逆变器输出交流,示波器测量输出电压电流波形(DC power supply by single phase inverter AC output through the PWM generator, output voltage and current waveform by scope)
    2014-08-22 15:17:46下载
    积分:1
  • least-squares-support-vector-machine
    基于最小二乘支持向量机算法的三维荧光光谱技术的应用(Based on least squares support vector machine algorithm for three-dimensional application of fluorescence spectroscopy)
    2011-11-27 16:24:21下载
    积分:1
  • matlab
    MATLAB 的一写小总结,传上来供大家方便。欢迎下载。(MATLAB Writing a small summary of the 1, Chuan-up for the convenience of everyone. Welcome to download.)
    2009-03-14 09:52:50下载
    积分:1
  • MATLABprogramdesignbook
    matlab的电子教程,帮助大家学习matlab(matlab electronic tutorials to help everyone learn matlab)
    2008-05-21 21:15:00下载
    积分:1
  • danchunxingfa
    单纯形法,求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是:线性规划问题的可行域是 n维向量空间Rn中的多面凸集,其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是:先找出一个基本可行解,对它进行鉴别,看是否是最优解;若不是,则按照一定法则转换到另一改进的基本可行解,再鉴别;若仍不是,则再转换,按此重复进行。因基本可行解的个数有限,故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。 (Simplex method, for solving linear programming problems common method. Simplex is the American mathematician GB Danzig in 1947 first put forward. Its theory is based on: linear programming problem feasible region is n-dimensional vector space Rn convex set in the multi-faceted, and its optimal value must be if the vertices of a convex set to achieve. Feasible solution corresponding to the vertex is called a basic feasible solution. The basic idea of the simplex method is: first find a basic feasible solution, to identify it and see whether it is the optimal solution If not, switch to another according to certain rules to improve the basic feasible solution, and then identify if still No, the re-conversion, click here to repeat. Due to the limited number of basic feasible solution, it will be converted by the finite optimal solution can be reached. If the problem can also be the optimal solution method has been applied without discrimination. )
    2011-01-17 21:01:44下载
    积分:1
  • code6
    《matlab gui设计学习手册》 第二版 2012新版 第六章源码(《matlab gui设计学习手册》 第二版 2012新版 第六章源码 matlab gui the second edition)
    2012-06-23 13:13:31下载
    积分:1
  • DRSHE
    Dynamic Range Separate HE
    2013-08-21 09:52:22下载
    积分:1
  • 696516资源总数
  • 106642会员总数
  • 12今日下载