ACO-Path-planning-

MATLAB常用算法程序集，功能比较齐全。(MATLAB commonly used algorithm for assembly, function relatively complete.)

用于MATLAB产生短时傅里叶变换的函数(USED TO GENERATE THE STFT NUM)

说明：  matlab代码，实现DCT变换matlab代码，实现DCT变换(matlab code, DCT transform matlab code, DCT transform)

sample visua basic hoc tap bao cao

must view while leaving any place from a company

说明：  学习C调用Mathematica内核函数的一个例子,包括计算和图形接口.(Learning C calling Mathematica kernel functions with examples, including computing and graphics interfaces.)

有趣的matlab程序，让大家感受matlab的魅力(Interestingly matlab program, so that we feel the charm of matlab)

制作按钮。在SDK平台下运行，任意制作按钮，非长好用的(Production button. Run in the platform SDK, arbitrary production button, non-long-to-use)

说明：   有一个长度为整数L(1<=L<=10000)的马路，可以想象成数轴上长度为L的一个线段，起点是坐标原点，在每个整数坐标点有一棵树，即在0,1,2，...，L共L+1个位置上有L+1棵树。 现在要移走一些树，移走的树的区间用一对数字表示，如 100 200表示移走从100到200之间（包括端点）所有的树。 可能有M(1<=M<=100)个区间，区间之间可能有重叠。现在要求移走所有区间的树之后剩下的树的个数。 输入： 两个整数L(1<=L<=10000)和M(1<=M<=100)。 接下来有M组整数，每组有一对数字。 输出： 可能有多组输入数据，对于每组输入数据，输出一个数，表示移走所有区间的树之后剩下的树的个数。(Has a length of integer L (1 &lt = L &lt = 10000) of the road, one can imagine a number line segment of length L, the starting point is the coordinate origin, each integer coordinate points in a tree, i.e. 0,1 , 2, ..., L total has L+1 L+1 positions on the tree. Now to remove some trees, tree removed by a range of digitally represented, such as 100 200 represents removed (inclusive) between 100 and 200 all the trees. There may be M (1 &lt = M &lt = 100) intervals, there may be overlap between the intervals. Now, after the number of trees require the removal of all remaining sections of the tree. Input: two integer L (1 &lt = L &lt = 10000) and M (1 &lt = M &lt = 100). Then there is an integer M groups, each with a pair of numbers. Output: there may be multiple sets of input data, for each set of input data, the output of a number indicating the number of the removal of all remaining sections of the tree after tree.)

用MATLAB程序实现演化博弈的均衡求解(Equilibrium solution for evolutionary game)