登录
首页 » matlab » gaojieqiyizhi

gaojieqiyizhi

于 2013-07-22 发布 文件大小:41KB
0 239
下载积分: 1 下载次数: 60

代码说明:

  通过比较奇异谱图和高阶奇异谱图得出结论:高阶奇异谱分析能够更好的二次确定嵌入维数。最后根据Takens嵌入定理进行相空间的重构。(By comparing the spectra of singular spectrum and higher-order singular conclusion: High singular spectrum analysis to better determine the embedding dimension of the secondary. Finally, according to Takens embedding theorem for phase space reconstruction.)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • 3971000DIPUM_toolbox_m-file_v1.1.3_part1
    Image Processing Toolbox
    2009-04-28 20:47:00下载
    积分:1
  • IPToolbox
    下的一个软件包,希望有用,是一个有关DS理论的(DST toolbox of Matlab)
    2012-12-30 18:46:20下载
    积分:1
  • somsh
    基于自组织型神经网络SOM的分类,自动选取不同神经元的个数。(Based on self-organizing neural network SOM classification, automatically selects the number of different neurons.)
    2014-09-22 21:12:37下载
    积分:1
  • RANDOM_SIGNAL_PROCESSING
    MATLAB在振动信号处理中的应用,书籍和源码 工程振动信号的预处理以及模态参数的识别程序(random signal processing in matlab)
    2010-01-23 09:37:31下载
    积分:1
  • test_cox
    matlab language testcox.dll
    2012-04-30 07:10:20下载
    积分:1
  • HOG
    shape feature extraction of Histogram of Gradient
    2011-11-29 15:28:51下载
    积分:1
  • ifreq
    原信号分解成IMF后,用此脚本来计算此IMF的瞬时频率(After the original signal into IMF, use this script to calculate the instantaneous frequency of the IMF)
    2013-12-18 18:27:11下载
    积分:1
  • Wave_Simulation_Program_Development_matlab_source_
    matlab程序开发波浪模拟源程序Wave Simulation Program Development matlab source code(Wave Simulation Program Development matlab source Wave Simulation Program Development matlab source code)
    2010-08-02 08:50:02下载
    积分:1
  • quzao
    matlab使用各种滤波函数实现图片的去噪处理(using the function denoising )
    2010-08-26 16:37:46下载
    积分:1
  • Floyd
    从任意一条单边路径开始。所有两点之间的距离是边的权,或者无穷大,如果两点之间没有边相连。   2,对于每一对顶点 u 和 v,看看是否存在一个顶点 w 使得从 u 到 w 再到 v 比己知的路径更短。如果是更新它。   3,不可思议的是,只要按排适当,就能得到结果。(A unilateral path from any start. All the distance between two points is the right side, or infinity, if there is no edge between two points connected. 2, for each pair of vertices u and v, to see if there is a vertex w from u to w and then to make than the known path v shorter. If you are updating it. 3, incredibly, just press the appropriate row, you can get results.)
    2011-09-02 23:33:33下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载