-
DSP8
说明： 数字信号处理的一些MATLAB源程序，均已经通过编译、仿真，请放心下载使用。(digital signal processing some of MATLAB source, we have already passed compiler, simulation, Please be assured download for use.)
- 2006-04-17 21:37:12下载
- 积分：1
-
xinsanwei01_xiyinzi
混沌系统的吸引子，很简单，初步学习可以看看(Attractor of the chaotic system is very simple, the initial learning can take a look at)
- 2013-01-08 21:26:41下载
- 积分：1
-
star
It is A* Search in AI
- 2010-05-16 00:25:19下载
- 积分：1
-
chap8
适合大家的学习滑模变算法，刘金琨老师书上的例子。(Sliding Mode algorithm suitable for all learning, Liu Jinkun teacher book example.)
- 2013-04-16 15:26:14下载
- 积分：1
-
hunxiangshijian
输入一个脉冲响应文件，可以测得房间混响时间T20 T30(Enter a pulse response file, can measure the room reverberation time T20 T30)
- 2015-09-11 10:53:34下载
- 积分：1
-
sort
sort(分类)用法
sort命令选项很长，下面仅介绍各种选项。
sort命令的一般格式为：(sort (Category) use sort command options is very long, only to introduce the following options. The general format of sort order:)
- 2010-07-28 16:27:01下载
- 积分：1
-
s_f_h
香农编码,费诺编码,哈夫曼编码通用程序及它们的码字长度,平均码长,各自的编码效率计算.(Shannon coding, fee Connaught coding, Huffman coding common procedures and their code length, the average code length, the coding efficiency of their calculation.)
- 2021-03-27 14:39:12下载
- 积分：1
-
SimpleImageRotation
说明： 简单的图像旋转软件，可以嵌套到其它图形图像处理程序中(Simple image rotation software, graphics can be nested into other image processing program)
- 2009-07-27 16:46:06下载
- 积分：1
-
watermark
water mark
needs other m-file
- 2012-05-02 17:38:16下载
- 积分：1
-
0-1programming
0-1整数规划有很广泛的应用背景，比如指派问题，背包问题等等，实际上TSP问题也是一个0-1问题，当然这些问题都是NP问题，对于规模较大的问题用穷举法是没有办法在可接受的时间内求得最优解的，本程序只不过是一个练习，得意之处是用递归法把所有解都排列出来。另：胡运权所著的《运筹学基础及应用（第三版）》第97页的例3，我用本程序求解得到的结果是：最优解是x*=(1,0, 0, 0, 0)，最优值是f(x*)=8，但书求得最优解是x*=(1,0, 1, 0, 0)，最优值是f(x*)=4，是不是书中写错了，请大家验证。以下是源程序，大家可以任意使用无版权问题，另外，如果大家有大规模的0-1规划的问题也希望提供给我，谢谢。变量个数至少是3个(0-1 Integer Programming is a very broad background, such as assignment, bags and so on. actually TSP is a 0-1, of course, these problems are NP, for larger problem with the law is not exhaustive approach in an acceptable time frame to obtain the optimal solution. this procedure is only one practice, farewell tour is the method used recursive all of the solutions to show. Another : Hu Yun-author of "operational research, and application base (third edition)" Article 97 of the three cases, I use this procedure to solve the result is : is the optimal solution x = (1,0, 0, 0, 0), the optimal values of f (x*) = 8, but the book is to find the optimum solution x = (1,0, 1, 0, 0), the optimal values of f (x*) = 4, the book is not a mistake, please certification. Following is the source)
- 2006-07-01 10:33:18下载
- 积分：1
