-
examples6-2
结构分析的有限元法与matlab程序设计6-1(Structural analysis of the finite element method and matlab programming 6-1)
- 2011-06-09 16:28:16下载
- 积分：1
-
PCA
一个最简单的主成分分析的源代码，希望对朋友们有所价值(A simple principal component analysis of the source code, I hope my friends have value)
- 2011-06-30 17:48:25下载
- 积分：1
-
comtest
自己写的串口中断程序
带有详细注释
适合新手 个人推荐 (Serial interrupt program to write notes with detailed personal recommendation for novice)
- 2020-10-10 11:07:34下载
- 积分：1
-
20130115
功率谱估计，包括窗口效应的功率谱估计的matlab程序及PPT、及各种估计方法的介绍(Power spectrum estimation, including window effect of power spectrum estimation of matlab and PPT, and the introduction of various estimation methods
)
- 2013-01-05 10:28:07下载
- 积分：1
-
Untitled
图像色彩变换, 彩色图像，伪彩色图像之间的转换(the translation of image color )
- 2011-10-23 09:47:15下载
- 积分：1
-
VCMatlab
采用VC2005 与Matcom混合编成 实现数据的读取和数据显示 对于学习VC和matlab的研究人员有一定参考价值(Compiled with VC2005 mixed Matcom using data read and data for the study, researchers VC and matlab has some reference value)
- 2011-07-16 22:25:53下载
- 积分：1
-
waveletkernel
这是一个小波核函数工具包，可根据需要的核函数公式构建自己所需的核，可用于核学习方法。(The wavelet kernel function is a toolkit, can according to need to build your kernel function formula for nuclear, and can be used to study method.)
- 2017-02-21 20:52:18下载
- 积分：1
-
dieucheBPSKAWGN
bpsk in Rayleigh fading
- 2009-04-19 14:59:55下载
- 积分：1
-
Mag_Color_Snake
Mag_Color_Snake模型源码。很好的程序。需要的可以看一看。(Mag_Color_Snake model source code. Very good program. Need to look at.)
- 2010-11-07 09:10:01下载
- 积分：1
-
maxcost
“基于Floyd最短路算法的Ford和Fulkerson迭加算法”的最小费用最大流算法，其基本思路为：把各条弧上单位流量的费用看成某种长度，用Floyd求最短路的方法确定一条自V1至Vn的最短路；再将这条最短路作为可扩充路，用求解最大流问题的方法将其上的流量增至最大可能值；而这条最短路上的流量增加后，其上各条弧的单位流量的费用要重新确定，如此多次迭代，最终得到最小费用最大流。
(" Floyd shortest path algorithm based on the Ford and Fulkerson algorithm superposition" of the minimum cost maximum flow algorithm, the basic idea is: the flow of each arc on the unit cost as a length, with Floyd for the most short-circuit method to determine a from V1 to Vn of the most short-circuit then this can be expanded as the shortest way, by solving the maximum flow of traffic on the way to its maximum possible value and this increased the flow of the shortest path, on which the arcs of the unit to re-determine the cost of traffic, so several iterations, finally get the minimum cost maximum flow.)
- 2010-12-22 17:27:32下载
- 积分：1
