-
Matlab_LMS3
自适应线性预测编码问题，利用白噪声序列生成信号序列，进而进行LMS迭代，计算滤波器权系数的轨迹曲线和衰减曲线(Adaptive linear predictive coding problem, the use of white noise sequence to generate signal sequence, and then LMS iteration to calculate the filter weights of the trajectory curve and the attenuation curve)
- 2008-04-25 10:22:33下载
- 积分：1
-
MLFMA-applications-moving-target
MLFMA在运动目标多普勒回波数值仿真中的应用(MLFMA applications moving target Doppler echo numerical simulation)
- 2014-10-20 12:33:07下载
- 积分：1
-
MOEA-NSGA-II
genetic algorithm program for power system
- 2011-05-29 03:41:08下载
- 积分：1
-
mlclass-ex1-005
Octave 3.2. Linear regression, cost function, minimun search.
- 2014-12-27 17:05:24下载
- 积分：1
-
dijkstra
求解图中起点到任意一个点的最小距离 输出len 和 meth分别记录长度 和 父亲点(Solving the graph point of origin to any point of a minimum distance of the output record length len, and meth and father respectively, point)
- 2010-02-07 11:29:59下载
- 积分：1
-
picc
说明： 做过的一些关于A/D转换，can总线，USB等等，希望可以帮得了大家，具体说明，程序里面都有注解，谢谢(Done about A/D conversion, can bus, USB, etc. I hope you can help got the specific instructions and procedures which have a comment, thank you)
- 2010-03-29 16:37:14下载
- 积分：1
-
localization
RSS to find location
- 2011-11-28 18:50:14下载
- 积分：1
-
GraphBetweennessCentrality
求复杂网络中的度的介数，输入网络的邻接矩阵，对分析社交网络的拓扑性质很重要(Find the degree of complexity of the network betweenness, enter the network adjacency matrix for analyzing social networks are important topological properties)
- 2013-11-08 14:31:58下载
- 积分：1
-
Intelligent-Control-2013-down
intelligent control notes
- 2013-10-10 22:58:03下载
- 积分：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
