登录
首页 » matlab » hurst

hurst

于 2013-03-30 发布 文件大小:95KB
0 238
下载积分: 1 下载次数: 36

代码说明:

  包含计算移动平均hurst指数 这是在时变hurst指数的基础上写的(This code is designed to compute the moving average Hurst. )

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

发表评论

0 个回复

  • matlab-sor
    matlab-sor实现matlab上的sor迭代法(Matlab- sor achieve the Matlab sor iterative method)
    2021-02-25 23:59:38下载
    积分:1
  • diretor
    图像的方向图处理,通过各类算法实现方向图的获取。(The direction of image processing, algorithm through various access patterns.)
    2009-04-14 14:18:32下载
    积分:1
  • chaosa1
    参考变分不等式的混沌搜索算法 赵 晖,高自友(北京交通大学交通运输学院,北京100044)(Reference variational inequality chaos search algorithm ZHAO Hui, GAO Zi-you (Beijing Jiaotong University, Transportation Institute, Beijing 100044))
    2009-11-19 13:56:54下载
    积分:1
  • fdtdPwave
    一维波动方程计算的程序,有限差分法,很有用的程序(Program of one-dimensional wave equation, finite difference method fdtd)
    2012-05-27 21:45:26下载
    积分:1
  • shallow-water-equation
    浅水波方程的源代码,是基于matlab开发的很好(shallow water equation,based on matlab ,ti is very good)
    2020-12-30 11:19:02下载
    积分:1
  • inverse21
    inverse dynamic of robot.nt to upload source code, you can
    2013-07-28 17:24:36下载
    积分:1
  • step12
    运用支持向量机以及模糊聚类方法对景点的大米图进行图像分割(We use the support vector machine and fuzzy clustering method to the attractions of the rice figure image segmentation)
    2014-12-08 21:14:27下载
    积分:1
  • chanshenghengtiaowen
    可以用本程序产生散斑竖条纹,简单实用,便于操作。(This program can be used to produce speckle vertical stripes, simple, practical, easy to operate.)
    2014-03-22 11:45:57下载
    积分:1
  • Fast-Automatic-T-emplate-Matching--
    Fast Automatic T emplate Matching for Spike Sorting
    2014-02-20 10:11:15下载
    积分:1
  • GraphTheoryAlgorithmMATLAB
    说明:  图论算法及其MATLAB 程序代码 1.求赋权图G = (V, E , F )中任意两点间的最短路的Warshall-Floyd 算法、Kruskal 避圈法 2.求二部图G 的最大匹配的算法(匈牙利算法)、利用可行点标记求最佳匹配的算法 3.从一个可行流f 开始, 求最大流的Ford--Fulkerson 标号算法 6.(Graph Theory Algorithm and MATLAB program code 1. Seeking weighted graph G = (V, E, F) in the shortest path between any two points of the Warshall-Floyd algorithm, Kruskal avoid the circle method 2. Seeking the maximum bipartite graph G matching algorithm (the Hungarian algorithm), using feasible point mark seeking the best match algorithm 3. a feasible flow f from the beginning, find the maximum flow of the Ford- Fulkerson Labeling Algorithm 6.)
    2010-03-28 15:39:29下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载