-
4
说明: matlab中的关于解方程方面的例子和程序(matlab on solving equations in terms of examples and procedures)
- 2010-10-14 18:47:08下载
- 积分:1
-
applySkiSlope
this is matlab code useful to remove noise
- 2012-05-21 18:39:14下载
- 积分:1
-
TUXIANG-FENGE
针对传统教学中出现的问题,分析在通信原理教学和实验中采用Matlab软件的可行性,提出在通信原理的课堂教学和实验教学中采用Matlab软件,不但能提高教学的有效性,而且可以加深学生对理论知识的理解和感性认识。 更多还原
(The traditional teaching of the problems, analyze the feasibility of using Matlab software teaching in communication theory and experiment, the proposed use of Matlab software in the classroom and laboratory teaching communication theory, not only can improve the effectiveness of teaching and students can deepen the understanding of theoretical knowledge and perceptions. More Restore)
- 2013-12-16 09:49:35下载
- 积分:1
-
me
说明: matlab的源码工具箱,一些函数的M文件(matlab source toolbox, some functions of the M-file)
- 2014-01-24 00:39:51下载
- 积分:1
-
HHT-Matlab
希尔伯特黄变化的3次matlab编程程序,适合于研究HHT的人(Hilbert-Huang change 3 times Matlab programming, suitable for the study of HHT)
- 2013-04-25 13:31:22下载
- 积分:1
-
用于多目标跟踪数据关联的函数 NNCJPDA_confirmed
这个函数用于多目标跟踪数据关联,结合了最近邻数据关联个CJPDA数据关联算法,每个目标分配最多一个量测(This function is used for multi-target tracking data association, combined with nearest neighbor data association a CJPDA data association algorithm, each target allocation up to a measurement)
- 2020-07-04 00:00:02下载
- 积分:1
-
fuzzy-cluster
fuzzy的入门程序,有数据和注释,简单易学(fuzzy clustering)
- 2009-04-11 23:39:00下载
- 积分:1
-
filter
filtering an given image in matlab
- 2011-08-25 19:16:25下载
- 积分:1
-
Matlab_zuixiaofeiyong
最小费用最大流算法通用Matlab函数
基于Floyd最短路算法的Ford和Fulkerson迭加算法 基本思路:把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条 自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流 量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新 确定,如此多次迭代,最终得到最小费用最大流.(Minimum cost maximum flow algorithm general Matlab functions The basic idea of the shortest path algorithm of Ford and Fulkerson superposition algorithm based on Floyd: the cost of unit flow on the arc as a certain length of Floyd and the shortest path method to determine the one percent self-V1 to the Vn the most short-circuit and then the this Article is the most short-circuit as a can be the expansion Lu, to use solving the method of the the the problem of the maximum flow will its on the stream the amount of increased to the maximum possible values while the the the the flow of of this Article of the shortest on the road increase, the costs of the unit of flow on each arc sure, so many iterations, the final minimum cost maximum flow.)
- 2012-07-27 14:55:22下载
- 积分:1
-
stripmapSAR
条带SAR成像程序,基础程序,但是很重要,可惜学习下!(Band SAR imaging procedures)
- 2013-10-13 20:54:30下载
- 积分:1