-
boqingwen
对二阶rc等效电池模型运用matlab进行最小二乘法在线系统辨识的程序(Equivalent second-order rc battery model using least squares method matlab online system identification procedures
)
- 2020-09-12 16:28:01下载
- 积分：1
-
matlabvc
matlab和ivsualc++联合编程相关(matlab and ivsualc++ related to joint programming)
- 2010-05-24 13:32:41下载
- 积分：1
-
csma
MAC层CSMA协议，是在OPNET中使用的(MAC layer，CSMA protocols)
- 2009-09-17 11:12:25下载
- 积分：1
-
svm
支持向量机原理与仿真
(Support vector machine theory level simulation)
- 2014-01-05 16:19:37下载
- 积分：1
-
MfengjiiA
MATLAB风力发电机模型。。小电机模型，可以进行相关修改
(MATLAB wind turbine model. . Small motor model can modify the)
- 2012-07-19 19:50:10下载
- 积分：1
-
dlan
一个DLAN的例子，非常的有意思，希望能够有帮助(An example of a DLAN, very interesting, hope to be able to help)
- 2015-03-27 13:13:34下载
- 积分：1
-
yxyt0004
用c++编的matlabI型样条程序,都是老师布置的数值分析作业!希望和大家交流.谢谢网站提供这个平台!(use c-series matlabI kind of procedure, Layout of the teachers are numerical analysis operations. We hope and exchanges. Thank you for providing this platform!)
- 2006-10-15 20:04:14下载
- 积分：1
-
Wavelet_OMP
压缩传感算法，可以通过此算法恢复图像实现超分辨成像，多尺度小波变换(Compression sensing algorithm, through which the image can be restored to achieve super-resolution imaging, multi-scale wavelet transform)
- 2017-06-10 14:35:30下载
- 积分：1
-
OpenTLD-master
TLD跟踪算法源代码下载（纯C++版本），OpenTLD-master，某大牛重新编写的C++版本TLD跟踪算法，脱离MATLAB。(C++ impleletion of TLD)
- 2014-01-16 21:18:38下载
- 积分：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
