登录
首页 » matlab » 2014911LMD

2014911LMD

于 2014-09-11 发布 文件大小:1KB
0 169
下载积分: 1 下载次数: 40

代码说明:

  局部均值分解算法,适用于从事机械信号处理研究人员,对LMD方法的初步认识(Local mean decomposition algorithms for signal processing researchers in mechanical preliminary understanding of the LMD method)

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

发表评论

0 个回复

  • gsyc
    金融爱好者必备装备,股市价格预测的MATLAB程序源码(Financial enthusiasts necessary equipment, MATLAB program for the stock price forecasting)
    2012-03-31 07:04:34下载
    积分:1
  • GraRegulEjeLibr
    Plot the voltage regulation based on real power
    2011-11-26 23:21:22下载
    积分:1
  • sy1
    数值微分精度及步长的关系,截断误差和舍入误差,体会误差对结果的影响,用算法1 和算法2 分别得到的结果进行比较,由Taylor公式可得到两种算法的截断误差(Accuracy of numerical differentiation and the relationship between step length, truncation error and rounding error, the error on the results of experience with algorithm 1 and algorithm 2 respectively, to compare the results obtained by the Taylor formula for the truncation error of two algorithms available)
    2010-06-14 19:56:18下载
    积分:1
  • seisemic_zhejihecheng
    地球物理地震数据处理,专用于卷积合成卷积(Geophysical seismic data processing, convolution)
    2013-12-30 07:11:36下载
    积分:1
  • tsp
    基于MATLAB的TSP问题求解,有详细的程序解释和代码(MATLAB-based problem solving TSP, a detailed explanation of the program and code)
    2013-12-31 14:49:05下载
    积分:1
  • Motion-Planning-Algorithms-master
    说明:  A*算法机器人路径规划,利用matlab仿真实现。(A* algorithm robot path planning, and MATLAB simulation is used to realize.)
    2021-04-20 15:40:50下载
    积分:1
  • HSV_Face_Detection
    使用matlab实现的基于肤色的HSV颜色模型下的人脸检测(Matlab achieved using the HSV color based on the color model of face detection)
    2009-04-30 10:23:48下载
    积分:1
  • maxcost
    “基于Floyd最短路算法的Ford和Fulkerson迭加算法”的最小费用最大流算法,其基本思路为:把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条自V1至Vn的最短路;再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流量增至最大可能值;而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新确定,如此多次迭代,最终得到最小费用最大流。 (" Floyd shortest path algorithm based on the Ford and Fulkerson algorithm superposition" of the minimum cost maximum flow algorithm, the basic idea is: the flow of each arc on the unit cost as a length, with Floyd for the most short-circuit method to determine a from V1 to Vn of the most short-circuit then this can be expanded as the shortest way, by solving the maximum flow of traffic on the way to its maximum possible value and this increased the flow of the shortest path, on which the arcs of the unit to re-determine the cost of traffic, so several iterations, finally get the minimum cost maximum flow.)
    2010-12-22 17:27:32下载
    积分:1
  • cardoso code
    cardoso 的ICA编码,可以用在人脸识别上面(Cardoso ICA coding, can be used in the above Face Recognition)
    2005-06-29 10:37:37下载
    积分:1
  • fluxweaking
    弱磁控制算法总结,描述了一些主要的弱磁算法(Flux-weakening control algorithm summary description of some of the major weakening algorithm)
    2011-10-30 12:05:47下载
    积分:1
  • 696518资源总数
  • 105717会员总数
  • 10今日下载