-
powell-optimization
Powell s Optimization technique used for image processing.
- 2013-07-12 21:06:12下载
- 积分:1
-
seizmo-master
说明: 可用于地震数据处理的工具箱,利用matlab语言编写。(The toolbox can be used for seismic data processing, which is written in MATLAB.)
- 2020-06-08 12:55:54下载
- 积分:1
-
job-shop2
说明: Matlab 车间动态调度 PSO微粒群算法程序(优化目标为平均流动时间)(Matlab Workshop Particle Swarm Optimization PSO dynamic scheduling program (average flow time optimization objectives))
- 2010-05-04 15:32:37下载
- 积分:1
-
wolfpowell
wolf-powell算法,运行在MATLAB环境中,用于搜索步长的计算(wolf powell algorithm)
- 2013-11-17 20:46:59下载
- 积分:1
-
ppbGauss
本程序介绍了一种PPB滤波算法来去除图像中的加性高斯噪声,09年才提出来的新算法非常的高效,去噪效果相当好(This procedure describes a filtering algorithm to remove the image PPB in additive Gaussian noise, 09 years to put forward a new algorithm is very efficient, very good denoising effect)
- 2010-11-12 14:48:00下载
- 积分:1
-
music
说明: 由于阵列处理中常常需要对接收信号进行分析,MUSIC算法是其中最为经典的(As the array processing is often necessary to analyze the received signal, MUSIC algorithm is one of the most classic)
- 2010-04-27 10:11:28下载
- 积分:1
-
aiai
在用 DFT 计算连续信号时可能出现频谱混叠现象、泄露、栅栏效应(signal aliasing)
- 2011-09-02 22:49:53下载
- 积分:1
-
64 fft_ifft
FFT and IFFT 64 point radix-4
- 2017-07-13 13:15:08下载
- 积分:1
-
RGLS
RGLS算法 系统辨识 实验的源程序代码 用于气动伺服实验(RGLS algorithm systems identification of the source code for the pneumatic servo test)
- 2010-05-19 10:23:40下载
- 积分: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