登录
首页 » matlab » 81404576emd

81404576emd

于 2010-08-11 发布 文件大小:4KB
0 166
下载积分: 1 下载次数: 28

代码说明:

  EMD分解,有效经验模式分解,有效经验模式分解,有效经验模式分解(EMD decomposition,EMD decomposition,EMD decomposition,EMD decomposition)

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

发表评论

0 个回复

  • myfile3
    前推回代法计算8节点配电网电流、电压和网损。(Caculating current,voltage and system losses of distribution network with 8 nodes using forward-backward sweep method.)
    2014-11-19 09:10:31下载
    积分:1
  • CHA-ZHI2
    分形插值曲面的MATLAB程序 这时pdf程序资料(MATLAB program of fractal interpolation of time pdf program information)
    2013-12-16 09:59:59下载
    积分:1
  • ex8
    说明:  用Matlab实现回归分析与检验,并建立其系统界面;对给定的试验数据进行回归分析并作检验(Regression analysis using Matlab implementation and testing, and establish the system interface on a given test data for testing the regression analysis and)
    2011-03-23 13:55:00下载
    积分:1
  • GNS3install
    Video about using GNS3 simulation for CCNA labs. This video introduce how to install GNS3 anh config it to run effectivelly. It also contains some example labs for tutorial purpose.
    2010-10-20 01:09:29下载
    积分:1
  • Finite_element_tri
    有限元数值计算的源程序,matlab实现的(FEM calculation of the source, the realization of Matlab)
    2007-01-13 22:29:26下载
    积分:1
  • BPSK
    介绍bpsk调制的一个比较完整的系统,系统内有误码率的处理,时域和频域之间的转换(introduce bpsk modulation)
    2013-09-13 10:43:19下载
    积分:1
  • SARMatlab
    sar成像matlab程序,针对目标电磁特性成像,效果较好(sar image matlab)
    2013-11-23 13:56:54下载
    积分:1
  • circularHough
    Circular Hough transform using OpenCV: C++ version of the popular (best accurate I think) Matlab function CircularHough_Grd.m of Tao-Peng. Note: the user should know how to use OpenCV first.
    2010-08-13 17:57:26下载
    积分: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
  • LMS
    说明:  用于计算最小均方误差的代码,包含了归一化的uniform函数(Used to calculate the minimum mean square error of the code, including the normalization of the uniform function)
    2010-04-04 17:49:45下载
    积分:1
  • 696516资源总数
  • 106554会员总数
  • 12今日下载