-
FAP-Turbo-v5.2-with-setting
robot forex fab turbo . good trading option
- 2015-05-31 20:48:18下载
- 积分：1
-
yanshitu
数模题目代码，一个简易的matlabUI动画演示程序(Modulus subject code, a simple animation demo program matlabUI)
- 2013-09-13 08:36:54下载
- 积分：1
-
SerialPort
利用串口或者蓝牙的通信方式将采集到的心电数据绘制成波形，并与matlab混合编程实现小波分析(Using serial or Bluetooth communication will be collected ECG data plotted waveform, and Hybrid Programming with matlab wavelet analysis)
- 2010-08-30 10:05:51下载
- 积分：1
-
matlab_for_mxArray
matlab中mxArray 的C#实现(the implement of mxArray in matlab with csharp)
- 2005-02-20 13:54:25下载
- 积分：1
-
fuzzy_pid
该段程序实现的是模糊PID控制。讲模糊控制技术和PID控制结合起来，不仅满足线性系统的需求，更适合于非线性系统。(This section of the program to achieve fuzzy PID control. Stresses combine fuzzy control and PID control, not only meet the demand of the linear system, more suitable for non-linear systems.)
- 2012-08-31 10:43:13下载
- 积分：1
-
ArduCopter
说明： 一字型编队，对多智能体协同处理可以下载讨论(Coordinated formation)
- 2021-04-06 15:34:13下载
- 积分：1
-
dcCalculate
Dynamic calculation formula, the string into the corresponding formula, dynamic compilation and calculate the results
- 2015-01-23 08:05:53下载
- 积分：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
-
djhsajdh
Gauss 消元法 — 不选主元 Gauss 消元法 — 列选主元. 插值法 lagrange .cpp
插值法 lagrange .cpp 二分法.txt
二分法和简单迭代法以及埃特金.txt
复化辛卜生公式.txt快速弦截法 gauss-seidel选代.txt牛顿迭代法.txt(Gauss elimination method- do not choose the principal component Gauss elimination method- principal component out how. Interpolation lagrange. Cpp interpolation lagrange. Cpp dichotomy. Txt dichotomy and a simple iterative method, and Aitken. Txt Fu Xin Bo' s formula of . txt fast chord intercept method gauss-seidel iteration. txt Newton iterative method. txt)
- 2010-01-06 17:11:35下载
- 积分：1
-
jiglib-0.84
smoothed particle hydrodynamics, metlab preliminary program
- 2010-07-08 21:38:37下载
- 积分：1
