-
shuzishibie
用VC++，Matlab完成的图像分割与数字识别(With VC++, Matlab to complete the image segmentation and digital identification)
- 2008-02-16 19:13:55下载
- 积分：1
-
Antenna-Array
说明： 针对不同阵列天线进行方向图的绘制，可根据个人需要自行设置参数，从而得到显示结果！(Direction for different antenna array mapping, according to their own individual needs to set parameters to be displayed!)
- 2011-03-31 23:26:58下载
- 积分：1
-
Mahalanob
用于计算马氏距离，并可以用于优选近红外光谱的校正集和预测集(used in the calculation of the Mahalanobis distance, and can be used for optimization of near-infrared spectroscopy calibration set and the prediction)
- 2007-05-11 21:16:11下载
- 积分：1
-
Alizadeh_Sadough_IST_2010
Power Minimization in Uni-directional Relay
Networks with Cognitive Radio Capabilities
- 2012-11-21 12:00:16下载
- 积分：1
-
imagine_use
图像处理的相关程序，自己找了很多实验素材，均已调试通过(Image processing procedures, their own experiments to find a lot of material, have been debugging through)
- 2014-11-14 10:19:15下载
- 积分：1
-
Development-of-wind-turbine-control-algorithms..
development of wind turbine control algorithms
- 2012-10-14 22:11:29下载
- 积分：1
-
int-problem
各种求积分（数值，区域比较复杂的）的源程序 虽然比较简单 但程序中包含了许多求积分经常会遇到的问题 是自己总结的(Various quadrature (numerical region is more complicated) source is a relatively simple program contains many quadrature often encounter problems is summarized)
- 2012-02-09 19:51:19下载
- 积分：1
-
bearingcodes2
bearing faults matlab code
- 2014-02-13 11:58:26下载
- 积分：1
-
rls
自适应rls的算法仿真，最后图包括学习曲线，误差权矢量(Rls adaptive algorithm simulation, the final plan, including the learning curve, the error weight vector)
- 2009-06-11 19:33:39下载
- 积分：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
