RW

Casio CTK-750 midi clips for game/multimedia programing

从其他网站下载的经典蚁群算法，对初学者非常有用，请看看。(downloaded from other websites of the classic ant algorithm, very useful for beginners, please look at.)

完整的惯性领域解算数学模型及解算算法，可以进行理论仿真及实验数据验证。(Complete inertial field solver solver algorithms and mathematical models can be theoretical simulation and experimental data validation.)

MatLab 7, Creating Graphical User Interfaces

使用matlab进行边缘提取，更加深刻的理解canny算法应用(Using matlab to edge extraction, a more profound understanding of the application of canny algorithm)

基于结构光的三维信息获取，包括基于平面擦除法的三维扫描和基于结构光的三维扫描(Based on the three-dimensional structure of the optical information acquisition, including three-dimensional scan plane and three-dimensional scanning of the erasing method based on structured light)

Hybrid DS-FH communication systems

DC-DC和DC-AC仿真，matlab实现(DC-DC and DC-AC simulation, matlab implementation)

使用MATLAB编程“支持向量机聚类”与 “支持向量机回归”(Support vector machine clustering and support vector machine regression)

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