-
Matlabdetail
MATLAB详细应用手册。包括基本功能、工具箱、函数编写。(Application of MATLAB detailed manual. Including the basic functions of the toolbox, function preparation.)
- 2007-12-27 14:54:39下载
- 积分:1
-
cwnd_point
通过HWND获得CWND指针的小例子,可以编译通过(HWND pointer obtained through the CWND small example, you can compile)
- 2010-03-08 13:28:36下载
- 积分:1
-
LOG-op
LOG算子,实现边沿检测,内附readme(LOG operator, to achieve edge detection, included readme)
- 2011-06-14 20:05:44下载
- 积分:1
-
2012-4-28P18-21-28
qpsk的仿真和应用很好用自己运行可以运行(qpsk simulation and application)
- 2012-05-22 17:19:34下载
- 积分:1
-
five_level_diode_clamped_pwm
five level diode clamped inverter
- 2013-04-01 16:52:12下载
- 积分:1
-
Numerical-Techniques-in-EM
电磁场中的数值方法,本书包含所有的电磁场方面使用的数值方法,且有丰富的代码(FORTAN 和 C++),本书是英文版的(Electromagnetic field numerical methods, the book contains all of the numerical methods used in electric fields, and there is a wealth of code (FORTAN and C++), the book is in English)
- 2014-02-06 03:18:48下载
- 积分:1
-
Graphpartitioningtechnology
图形图像分割技术进展,仅仅可以用于学习交流(Graph partitioning technology)
- 2009-03-30 12:16:10下载
- 积分:1
-
tongjifx333
此程序为统计分析中常见的统计量的matlab程序,有详细注释.(the progroms is very good)
- 2013-07-31 11:18:07下载
- 积分:1
-
findpeaks
该源代码用于对传感器接收的时域信号提取幅值峰值的分析,应用于无损检测领域。(The source code for the sensor receives the peak amplitude domain signal extraction analysis, applied to the field of non-destructive testing.)
- 2014-09-01 11:22:57下载
- 积分: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