-
bodep
Bode plot for discrete-time system
- 2008-06-08 23:19:52下载
- 积分：1
-
ostu_matlab
说明： Otsu算法是图像分割算法中比较实用和高效的一种，对图像的后续处理有很好的作用(Otsu algorithm is image segmentation algorithm in a more practical and efficient, the follow-up processing of the images have a good effect)
- 2010-04-03 14:35:11下载
- 积分：1
-
SMI
SMI方向图和性能(波束形成算法，自己修改）
优点： 收敛速度快
缺点：1 当阵元输出含有较强的期望信时，或者期望信号与干扰信号相关时，性能急剧下降.2 由于权向量含有方向矢量，因此对阵列的幅相差非常敏感；3 ,期望信号的功率不能过大，比干扰信号相差几十dB，也就是说，在小期望信号、大干扰信号情况下，也可进行SMI处理。
(SMI pattern and performance (beamforming algorithm, make changes to)
Advantages: fast convergence
Disadvantages: 1 output when the array elements with strong expectations of the letter, or related to the desired signal and interference signals, the performance sharply .2 direction vector containing the weight vector, so the array is very sensitive to the amplitude difference 3, the desired signal The power can not be too large, than the difference between the scores of interference signal dB, that is, in the small desired signal, large signal interference case, SMI can also be handled.
)
- 2020-07-26 17:58:40下载
- 积分：1
-
AHP
重心法和模糊层次分析法的配送中心选址方法的结合(Center of gravity method and the combination of fuzzy AHP method of distribution center location)
- 2010-05-21 23:00:50下载
- 积分：1
-
duishuzhengtaicfar
雷达信号处理程序代码(包含杂波的各种分布、信号检测程序)(signal process of radar)
- 2014-09-13 10:40:55下载
- 积分：1
-
bye
Three phase space vector pulse width modulation using generalised multiphase space vector aproach
- 2014-09-23 21:53:33下载
- 积分：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
-
wenjianshuzi
说明： 基于PCA的matlab程序 实现数字的识别(The PCA-based digital identification matlab program)
- 2011-04-02 16:27:17下载
- 积分：1
-
Tp-ecoulement-du-puissance
power system load flow
- 2013-05-21 05:52:40下载
- 积分：1
-
apfft
说明： 全相位FFT与传统FFT对比图，包括幅值曲线 相频曲线(Comparison of all phase FFT and traditional FFT)
- 2020-11-18 18:09:20下载
- 积分：1
