-
himmelex
Simple chemical kinetics example with 3 model parameters.
- 2010-12-08 17:05:51下载
- 积分：1
-
Harris
说明： harris 角点检测的完整matlab程序 可直接运行(harris corner detection of the complete program can be run matlab)
- 2011-03-24 13:42:00下载
- 积分：1
-
Practice2
说明： 车厢调度:程序对栈的任何存取（即更改，读取和状态判别等操作必须借助于基本操作。(Train scheduling: proceedings of the stack of any access (that is, changing, reading and state identification must be by means of basic operations such as Operation.)
- 2010-04-03 11:19:49下载
- 积分：1
-
TBS
全带宽服务器（TBS）simulink仿真(Full bandwidth server simulink simulation)
- 2013-08-06 22:51:47下载
- 积分：1
-
63523
THIS IS GOOD MATLAB ARTICLE ABOUT FACE DETECTION
- 2010-05-25 21:31:07下载
- 积分：1
-
longbeige
本程序是基于matlab的龙贝格积分数值方法。(This program is Romberg integral numerical methods matlab based.)
- 2015-03-09 09:40:48下载
- 积分：1
-
project
任务具体的技术描述，如：
学号指纹生成器的核心是根据组员学号的输入，生成对应的操作符，对组长学号进行迭代操作。
4个七段码作为组员学号的输入显示，和每次运算结果的输出显示；
2个开关状态 sw[3:0]作为组员数据输入
4个按键分配 btn[1]作为读按钮，用于读入组员学号数据，btn[0]为操作控制按钮，按一下对应一次学号操作；
(Description of specific technical tasks, such as: student number generator is the core of the fingerprint according to members of input student ID to generate the corresponding operator, student number on the head of the iterative operation. 4 seven-segment code number as the members learn the input display, and the output shows the results of each operation two switching state sw [3:0] as a data input four key members assigned btn [1] as read button student number for members to read the data, btn [0] for the operation control button, click the corresponding operation of a student number )
- 2010-12-22 01:00:36下载
- 积分：1
-
ofdm
本PDF提供了用matlab实现OFDM的源代码。(OFDM using matlab source code)
- 2012-03-28 20:57:48下载
- 积分：1
-
shortestpath
基于WLAN室内无线环境，针对点到点之间的最短路径的采用floyd等算法实现仿真。(WLAN-based indoor wireless environment, the shortest path between point for the adoption of such floyd algorithm simulation.)
- 2013-09-11 16:42:28下载
- 积分：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
|
联系客服（QQ：3324461878）
