-
toolbox_sparsity
这是一个Matlab实现的图像Sparcy变换的程序，有助于了解多尺度变换。(This is a Matlab implementation of the image Sparcy transformation process, help to understand multi-scale transformation.)
- 2010-05-31 12:08:27下载
- 积分：1
-
Farmland-small-map
农田多标记小图，可以用以极化SAR分解和半监督极化SAR分类。(Farmland multi-label small map, can be used to polarimetric SAR polarimetric SAR decomposition and semi-supervised classification)
- 2014-08-22 17:01:13下载
- 积分：1
-
C--Turbo--DSP
Turbo 码作为一种性能优越的信道码, 其应用逐步推广到深空通信、卫星通信和移动通信, 并被推荐为第三代移动通信的信道编码方案之一。本设计实现了通用的Turbo 码的编译码(Turbo codes as a superior performance of channel code, its application gradually extended to deep space communications, satellite communications and mobile communications, and was recommended as one of the channel coding scheme third generation mobile communications. The design and implementation of the encoding and decoding of Turbo codes common)
- 2014-11-23 09:00:22下载
- 积分：1
-
BP-Load-forecasting
基于BP神经网络的短期负荷预测，神经网络用于负荷预测的基本方法。(Short-term load forecasting based on BP neural network, the neural network for load forecasting method.)
- 2012-12-10 20:19:36下载
- 积分：1
-
p1
说明： 简单的移动通信系统，在awgn+瑞利衰落条件下，给出同SNR时系统性能(Simple mobile communication system)
- 2013-06-18 22:17:07下载
- 积分：1
-
Induction-motor
The main objective of this simulation is to obtain induction motor equivalent circuit parameters by simulating four
induction motor tests
- 2015-03-31 02:27:13下载
- 积分：1
-
lit
program to code some properities in chaos
- 2014-04-30 14:24:16下载
- 积分：1
-
adaptive-bilateral-filter
说明： 自适应双线性变换的matlab实现，可用于滤波去噪等图像处理(matlab code of adaptive-bilateral-filter)
- 2020-02-20 19:39:51下载
- 积分：1
-
gamulf
genetic algorithm matlab programs for reference
- 2010-04-12 02:19:52下载
- 积分：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）
