-
21-25
《matlab编程百例》光盘代码21-25("Matlab programming hundred cases" CD-ROM code 21-25)
- 2007-07-10 14:25:00下载
- 积分：1
-
Maxiflowminicut
最大流和最小截算法，在这个函数的编制中存在一个细节，当任取一个已标号未检查的点的时候，我取的最靠前的点。如果加进随机选取的语句，每次运行程序可能会出现不同的最大流结果。(Maximum flow and minimum cut algorithms, in this function exists in the preparation of a detail, if any label does not take a check point has been, I get the most front point. If the statement is added to randomly selected for each run the program may come up with different results of maximum flow.)
- 2010-03-07 21:26:27下载
- 积分：1
-
Image-Expand-Program
matlab中图像展开说明，适用于matlab中，很好的程序(matlab in image deployment instructions for matlab in a very good program)
- 2013-08-07 20:13:39下载
- 积分：1
-
tulun
数学建模中常用的图论程序，经整理，有注释(Commonly used mathematical modeling of graph theory program, collated, annotated)
- 2013-05-19 22:19:46下载
- 积分：1
-
LSDA
Locality Sensitive Discriminant Analysis
- 2012-06-19 21:35:30下载
- 积分：1
-
Power-spectrum-estimation
信号时正弦波加正态零均值白噪声，信噪比10db，信号频率2kHZ，采样频率100kHZ，数据长度N=256。
(1). 用周期图法进行谱估计。(Sine wave signal plus zero-mean normal white noise, SNR 10db, frequency 2kHZ, sampling frequency 100kHZ, data length N = 256.
(1) with the periodogram spectral estimation.)
- 2012-01-12 10:26:36下载
- 积分：1
-
Users
测试程序，希望一起学习，呵呵。我这个是下载资源的
- 2009-12-23 16:20:21下载
- 积分：1
-
Yan_Yi_4PAM
仿真4-PAM（脉冲幅度调制）载波调制信号在AWGN（加性高斯白噪声AWGN(Additive White Gaussian Noise)）信道下的误码率和误比特率性能，并与理论值相比较。(Simulation 4-PAM (pulse amplitude modulation) modulation signal in AWGN (additive white Gaussian noise AWGN (Additive White Gaussian Noise)) under the channel bit error rate and bit error rate performance, and compared with the theoretical value.)
- 2014-11-05 15:26:53下载
- 积分：1
-
matlab
MATLAB 嵌入式代码说明文档，希望能帮助大家(MATLAB 嵌入式代码说明文档)
- 2015-01-24 20:30:01下载
- 积分：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
