simd-viterbi-2.0.1

Shell sort is a very interesting modification of the sorting algorithm simple inserts.

matlab+dct+数字水印，这实在linux系统下运行的程序。(matlab+ dct+ digital watermarking, which is running under linux system procedures.)

说明：  反演程序 地球物理的很有用反演程序 地球物理的很有用(inversion code)

Matlab的行优先算法，可以方便的判断对如机场、火车站、公交车的就座问题进行分析(Matlab line priority algorithm, it will be convenient for the judge, such as airports, railway stations, bus seat to undertake an analysis of)

说明：  模拟蚂蚁和食蚁兽的生存规律。在20X20的网格世界里，每个生物每次可向四个方向移动（但不会移除网格边缘），食蚁兽会吃掉在他目标处的蚂蚁(The goal for this programming project is to create a simple 2D predator-prey simulation. In this simulation the prey are ants and the predators are doodlebugs. These critters live in a world composed of a 20x20 grid of cells. Only one critter may occupy a cell at a time. The grid is enclosed, so a critter is not allowed to move off the edges of the world. Time is simulated in time steps. Each critter performs some action every time step.)

SNAMP代码，供大家学习研究设计使用，希望对你有帮助(SNAMP code for them to learn from research design to use, want to help you)

matlab演化博弈模型及程序，对研究生来说是很有用处的(matlab evolutionary game model and procedures, it is useful to graduate)

说明：   有一个长度为整数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.)

robot forex fab turbo . good trading option

QuadraticQuaassemble 的源程序 matlab有限元分析源程序 (QuadraticQuaassemble source matlab source Finite Element Analysis)