-
kalman
标准的卡曼滤波器实现，例子在文档里面有说明。(standard kalman fitler.hope to help you)
- 2013-03-13 09:53:26下载
- 积分：1
-
code
包含霍夫曼编码，算数编码，LZ编码以及GUI界面(Include Huffman coding, arithmetic coding, LZ coding and GUI interface)
- 2015-04-17 21:00:28下载
- 积分：1
-
MODE-MIX-HHT
提供了外文文献具体解释了HHT得缺陷之一，模态混叠现象。
通过matlab的仿真具体解释了HHT用于信号分析时出现模态混叠的临界点。(english papers to explain one of the limitations of HHT-MODE MIXING
simulation base on MATLAB provide graph to improve that limitation)
- 2011-08-10 19:21:10下载
- 积分：1
-
sinlssvm
利用模糊支持向量机对sinc函数进行仿真验证程序(Fuzzy support vector machine )
- 2010-12-13 12:55:26下载
- 积分：1
-
PANTELAJIN
说明： Poincare映射图像有不同的做法，一般是通过画出系统的Poincare映射图来看是否为混沌(Poincare map images are different approaches to the general through the draw system in terms of Poincare map for the chaotic)
- 2021-04-26 22:28:45下载
- 积分：1
-
TD-SCDMA_MIMO-OFDM
这是一个基于TD－SCDMA系统mimo－ofdm的系统级的仿真模型，希望对大家有用。(This is a based on TD-SCDMA system mimo- ofdm of system-level simulation model We hope that the right useful.)
- 2007-05-10 10:40:45下载
- 积分：1
-
optimal-state-estimation
用于matlab的最优状态估计工具，用于状态估计和参数估计(optimal state estimation for matlab)
- 2013-05-15 17:28:15下载
- 积分：1
-
MATLAB_program_graphics_design_documents
MATLAB程序图形设计文档MATLAB program graphics design documents(MATLAB program graphics design documents MATLAB program graphics design documents)
- 2010-08-02 10:32:59下载
- 积分：1
-
readWPH4s_T639_fuxin
用于将中央气象台的T639数据转换为Matlab格式的数据(transform the data from National Meteorological Center of CMA to matlab format)
- 2011-12-09 11:36:47下载
- 积分：1
-
分支定界法
说明： 分支定界法（branch and bound）是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划，还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法，选择不同的分支变量和子问题进行分支。
对于两个变量的整数规划问题，使用网格的方法有时更为简单。 [1]
通常，把全部可行解空间反复地分割为越来越小的子集，称为分支；并且对每个子集内的解集计算一个目标下界（对于最小值问题），这称为定界。在每次分枝后，凡是界限超出已知可行解集目标值的那些子集不再进一步分枝，这样，许多子集可不予考虑，这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems.
For integer programming problems with two variables, the grid method is sometimes simpler[ 1]
Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)
- 2021-04-26 12:21:14下载
- 积分：1
