-
mutualinformationandpoincaresection
计算互信息和作庞卡来截面的C程序，很实用，计算速度超快／(Calculation of mutual information and for Ponca to the C-section procedure, it is useful to calculate the speed of ultra-fast /)
- 2008-03-27 22:36:26下载
- 积分：1
-
模仿Windows任务栏
说明： 一个rar包，主要是模式windows的任务栏的功能，(a rar packs, the main mode of windows is the task bar functions,)
- 2005-09-14 11:40:12下载
- 积分：1
-
LRS
进行时域分析的好程序，刚和师兄编的，仅供参考(Good time domain analysis procedures, and senior compiled just for reference only)
- 2011-10-04 09:54:20下载
- 积分：1
-
Matlab---xyc
改进的matlab取点求职的方法，很好用的，共享下(Improved access point matlab job search methods, the good, to share the)
- 2011-10-08 13:31:27下载
- 积分：1
-
xingyouxian
Matlab的行优先算法，可以方便的判断对如机场、火车站、公交车的就座问题进行分析(Matlab line priority algorithm, it will be convenient for the judge, such as airports, railway stations, bus seat to undertake an analysis of)
- 2007-11-25 15:45:11下载
- 积分：1
-
xbcseeg02
自己编写的基于要所感知的脑电信号预处理，代码效率良好，而且程序架构简单易行。(I have written EEG signal preprocessing based on the perceived good code efficiency, and procedural framework is simple.)
- 2012-06-27 16:23:41下载
- 积分：1
-
ownerDrawScrollBar
scrollbar重绘。很好的例子程序，可以用来学习一下。(scrollbar redrawn. Good example of a program that can be used to learn about.)
- 2014-11-11 14:30:39下载
- 积分：1
-
huffman
在matlab中实现哈夫曼压缩和解压缩。(Huffman compression and decompression in matlab.)
- 2013-12-04 16:01:36下载
- 积分：1
-
2
说明： 有一个长度为整数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 < = L < = 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 < = M < = 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 < = L < = 10000) and M (1 < = M < = 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.)
- 2015-03-22 23:35:47下载
- 积分：1
-
CART
matlab中cart决策树源代码，用于数据的分类和预测。(source code in matlab cart decision tree for data classification and prediction.)
- 2013-10-28 15:08:58下载
- 积分：1
