-
Matlab中的MFDFA工具箱 Fraclab
Matlab中的MFDFA工具箱，非线性时序分析，预测，H指数，维度。(Muti-fractal Detrended Fluctuation Analysis (MFDFA) Toolbox in Matlab)
- 2010-09-16 18:46:22下载
- 积分：1
-
weina
维纳滤波，能滤除干扰噪声，提取有用信号。但是当输入信号的统计特性偏离设计条件，它就不再是最佳的了，这在实际应用中受到了限制。
(Wiener filter, to filter out interference noise, extract the useful signal. However, when the statistical characteristics of the input signal deviates from the design conditions, it is no longer optimal, which has been limited in practical application.)
- 2013-11-25 19:49:44下载
- 积分：1
-
coreFormatIn
核心数据处理 核心数据处理 核心数据处理 核心数据处理 核心数据处理 核心数据处理 核心数据处理(Core data-processing core data processing core data-processing core data processing core data-processing core data processing core data-processing)
- 2007-12-16 07:57:35下载
- 积分：1
-
LDPC-code-simulation-experiment
LDPC编码仿真信号输入 LDPC编码仿真源代码 LDPC编码仿真信号输出 (LDPC code simulation signal input LDPC code simulation source LDPC code simulation signal output)
- 2011-04-28 14:54:59下载
- 积分：1
-
ksjj
编写一个MATLAB函数，实现快速卷积算法，给出一个实例。用一个N点离散傅立叶变换同时计算两个N点实序列的离散傅立叶变换。(The preparation of a MATLAB function, fast convolution algorithm, given a case in point. With a N-point discrete Fourier transform at the same time calculation of the two N-point real sequence of discrete Fourier transform.)
- 2009-05-27 13:51:04下载
- 积分：1
-
WienerTing2013.m
Wiener filter with multiple parameters
- 2014-01-29 05:15:54下载
- 积分：1
-
DETREND
近红外光谱平滑去噪算法，由于光谱仪得到的光谱信号中既有有用的信息，同时也叠加着随机误差，即噪声，而这种方法能取到很好的去噪作用。(Nir denoising smoothing algorithm, as a result of the spectrometer for spectrum signal in both the useful information, and superposition of the random error, the noise, and this method can get very good denoising effect.
)
- 2013-10-03 23:38:07下载
- 积分：1
-
cross_sections
使用matlab计算多种气体的碰撞截面。(Calculate cross-section )
- 2009-06-25 21:53:39下载
- 积分：1
-
matlab_image_search
matlab做的图像检索文档。里面3组图片可以试一试。(Matlab to do image retrieval. In 3group of pictures can try.)
- 2012-04-18 21:10:21下载
- 积分：1
-
最大二分配法
如果G的边集E(G)中有个子集M，满足M中的任何两条边 都不邻接，则M就是图G的一个匹配。包含边数最多的匹配 称为最大匹配，最大匹配所包含的边数称为最大匹配数。当 G是二分图时，问题就比较特殊了，这就是我们要解决 的问题——最大二分匹配。(If there is a subset M in the edge set E (G) of G, if any two edges in M are not adjacent, then M is a match of graph G. The match with the largest number of edges is called the maximum matching, and the number of edges contained in the maximum matching is called the maximum matching number. When G is a two point graph, the problem is very special. This is the problem we want to solve -- the biggest two points matching.)
- 2021-01-20 10:38:41下载
- 积分：1
