-
xianshi
使用matlab编写的有关于显示图片并且能旋转的相关内容(Written about the use of matlab display pictures and can rotate related content)
- 2015-04-21 11:13:55下载
- 积分：1
-
321
该代码源于《matlab图像处理宝典》，其中包含部分图像处理的关键代码(The code from " matlab image processing book," which contains a key part of the image processing code)
- 2013-05-25 18:41:47下载
- 积分：1
-
mutandcross
crossover and mutaion for binary genetic algorithm
- 2012-03-27 20:30:26下载
- 积分：1
-
chunzhihou
各种使用simulink纯滞后系统仿真实例(Various simulation simulink delay system)
- 2013-08-26 08:24:39下载
- 积分：1
-
Learning-Function-Matlab
Cac ham XLA trong Matlab
- 2011-11-23 01:42:57下载
- 积分：1
-
testWatermarking
simple function to test watermarking
- 2009-04-16 23:39:21下载
- 积分：1
-
The-simulation-design
和MATLAB的其他组件相比，Simulink的一个突出特点就是它完全支持图形用户界面，这样就极大地方便了用户的操作方法。在MATLAB2009中，可以直接在Simulink环境中运行时的工具包很多，包括通信、控制、信号、电力等各个领域，所涉及的内容也比较广泛和专业。(And MATLAB other components, compared to a prominent characteristics of Simulink is it fully supports the graphical user interface, this great show where the user operation methods. In MATLAB2009, can be directly in Simulink environment operation toolkit many, including the communication, control, signal, electric power and other areas, involved the content is more extensive and professional.)
- 2012-04-17 17:10:36下载
- 积分：1
-
regression-
计量经济学的统计回归相关工具包，包括最优化、VAR-CVAR(toolboxes related in statistics and regression, including optimization and VAR-CVAR model)
- 2011-06-10 00:20:29下载
- 积分：1
-
11
说明： 主要都是 MATLAB RBF网络算法，可以直接使用(There are thirteen chapters in this paper. They are mainly intelligent algorithms of MATLAB, which can be used directly.)
- 2019-08-17 15:04:26下载
- 积分：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
