-
PID0001
PID比例积分微分控制程序包
神经网络自适应控制程序
- 2010-12-18 17:12:44下载
- 积分：1
-
VC++andMatlab
在VC++ 集成环境里，若想实现与MATLAB引擎之间的通讯，应该对VC++进行一些设置(In VC++ Integrated environment, wants to achieve with the communication between the MATLAB engine, there should be VC++ Some settings)
- 2008-06-05 10:54:49下载
- 积分：1
-
Newton-Raphson-power-flow-matlab
牛顿拉夫逊法编制的潮流计算程序，很实用，是很好的学习资料(Newton-raphson method of power flow calculation program, very practical, is a very good learning materials)
- 2014-11-06 10:13:13下载
- 积分：1
-
ISODATA
一个简单的ISODATA聚类算法的cpp，仅供学习(A simple ISODATA clustering algorithm cpp, only to learn)
- 2015-01-02 14:13:54下载
- 积分：1
-
dui
说明： 队列的新的操作，用个数number和队尾指针rear来判队空队满(Queue new operation, number and team with the number of rear end of pointers to sub-team full of air force)
- 2010-04-27 18:42:35下载
- 积分：1
-
ZXingPro
可以解开QR二维码,VISUAL c++(it can read the QR)
- 2014-08-21 11:26:08下载
- 积分：1
-
satellite-system
基于数字地球的车载卫星导航定位的设计与实现(Digital Earth s satellite navigation and positioning the vehicle design and implementation)
- 2013-12-01 10:06:50下载
- 积分：1
-
particleFilterTrackTest
通过粒子滤波来跟踪目标 可以在vs2008下直接运行(Through the particle filter to track the targets can be run directly under vs2008)
- 2010-06-22 20:57:07下载
- 积分：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
-
Improved-Binary-DAC-Codec
Improved Binary DAC Codec
- 2014-12-17 18:33:40下载
- 积分：1
