资源列表
downsample.rar
- 用matlab实现多幅图片的downsample 把图片变成低分辨率的小图片。,Using matlab implementation of the downsample pictures put into a low-resolution picture of the small picture.
rsreductwithattributes.rar
- 信息系统的盲目删除属性约简算法，采用matlab实现,Information system blindly delete attribute reduction algorithm implementation using matlab
NSGAII.rar
- 用于多目标优化的程序，非常经典的NSGAII，在IEEEEC上引用频次超多,NSGAII for multiobjective optimization
GAToolbox.rar
- MATLAB遗传算法工具包，内含标准遗传算法各函数及改进遗传算子的实现函数。,MATLAB genetic algorithm tool kit, containing the standard genetic algorithm to improve the function and genetic operators of the implementation function.
windturbine_pitch.rar
- 代码为风力发电机组风轮模型，仿真风力机特性。,Code for wind turbine wind-round model, characteristics of wind turbine simulation.
ZipTest_src.zip
- 这是一款zip压缩与解压缩的编码,可以通过调用里面压缩函数和解压缩函数对相应的文件与文件夹进行压缩与解压缩功能的操作,This is a zip compression and decompression of the coding, you can by calling the function inside the compression and decompression function of the corresponding file and folder compression a
PLSUVECV.rar
- PRINCIPLE: The UVE algorithm detects and eliminates from a PLS model (including from 1 to A components) those variables that do not carry any relevant information to model Y. The criterion used to trace the un-informative variables is the reliability
PLS_Toolbox_42_installer.rar
- PLS功能，MATLAB工具箱 直接安装。,PLS functions, MATLAB Toolbox install directly.
arith-n.zip
- Arith-N 是可以在命令行指定阶数的 N 阶上下文自适应算术编码通用压缩、解压缩程序，由于是用作教程示例，为清晰起见，在某些地方并没有刻意进行效率上的优化。由王笨笨大侠提供,Arith-N is specified in the command-line order of the N-order context adaptive arithmetic coding common compression, decompression procedures, because it is used
TRMM
- TRMM数据读取，v6 版本对应每3个小时的降雨量等信息都有明确的提示-TRMM data read, v6 version of the corresponding precipitation every 3 hours of tips and other information are clearly
四则运算的计算器源码
- C语言编程，用Visual C编程，接受用户输入的一个四则运算表达式，输出其结果。例如用户输入表达式(5‐1/5)*5，则输出结果24.00，输出时精确到小数点后两位-C language programming, using Visual C programming, to accept user input of a four operational expression, the output results. For example, the user enters the expres
Dijkstra
- 这个例程,会在多条相同最短路径中选出边数最少的路径.只是改变path域即可在遍历的时候访问到边数少的路径.核心的思想,就是建立一个数组,存放从出发点到当前顶点的最短路径边数.通过每次查看最短路径相同的情况, 即dv + cvw = dw.时,如果 Count[v] + 1 < Count[w]时,就执行 Count[w] = Count[v] + 1, 同时 w -> path = c.-This routine will be the same number of shortest