-
LiWenbin
卡尔曼滤波程序的滤波程序分手那疯了数据分类开始的杰弗里斯(kalman filter)
- 2009-04-18 08:59:10下载
- 积分:1
-
buchang
采用matlab编写的关于当 L=64时,为求得在均匀量化时的最优步长(Prepared by the use of matlab when L = 64 when, in order to achieve the optimal uniform quantization step size at the time of)
- 2009-07-01 16:24:48下载
- 积分:1
-
gen
Generate mesh for finite element
- 2010-08-28 00:07:06下载
- 积分:1
-
2
说明: 介绍了一种纯相位液晶空间光调制器进行波前实时变换的方法(Describes a pure phase liquid crystal spatial light modulator for wave-front method of real-time transformation)
- 2011-03-12 20:01:33下载
- 积分:1
-
ldl_eig
ldl分解,科教版 数值分析于科学计算 北京工业大学研究生精品课程(LDL decomposition, science and education in scientific computing version numerical analysis Beijing university graduate course
)
- 2012-03-26 18:43:55下载
- 积分:1
-
garada
STK软件平台对garada卫星系统的仿真,可见性,覆盖面积和经历时间分析(simulink of satellite system by STK )
- 2013-09-03 10:35:42下载
- 积分:1
-
Fisher-de-Matlab
应用Firsher线性判别器在matlab环境中实现模式识别的分类,简单直接,望采纳(Pattern recognition classification application Firsher linear discriminant in the Matlab environment is simple and direct, looking to adopt)
- 2013-05-08 20:22:11下载
- 积分:1
-
AntColonyAlgorithmforSolvingQoSRoutingProblem
在状态转移规则的基础上,局部更新规则和全局更新的蚁群算法的规则,我们提出一个IM证明蚂蚁的最低成本的服务质量蚁群算法(QoS)的路径用于解决网络路由问题与延迟以及背包约束中进行模拟。约52.33%蚂蚁找到成功的QoS路由。并收敛到最佳。(based on the state transition rule,the local updating rule and the global updating rule of ant colony algorithm ,we propose an im proved ant colony algorithm of the least cost quality of service(QoS)unicast routing.The algorithm is used for solving the routing problem with delay.delay jitter.bandwidth,and packet lOSS constrained. In the simulation,about 52.33 ants find the Successful QoS routing .and converge to the best. It is proved that the algorithm is efficient and effective.)
- 2010-10-06 10:13:17下载
- 积分:1
-
wavelet
说明: 常用小波程序,使用matlab程序编写。(Process-matlab wavelet used to prepare)
- 2010-03-17 22:26:34下载
- 积分:1
-
an139
systemview仿真程序,使用systemview,包括所有模块和说明文档(Systemview simulation, the use of Systemview. including all modules and documentation)
- 2007-05-21 14:27:05下载
- 积分:1