登录
首页 » matlab » LInjie-PCA

LInjie-PCA

于 2014-11-29 发布 文件大小:2KB
0 176
下载积分: 1 下载次数: 136

代码说明:

  关于主成分分析方法中T^2统计量和SPE统计量的临界故障检测幅值计算的代码。(On principal component analysis method code T ^ 2 statistic and critical failure detection amplitude SPE statistic calculated.)

文件列表:

A_LinJie_PCA.m,7643,2014-07-17
Creatmat.m,133,2014-01-29
creat_mat.m,252,2014-01-29

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

发表评论

0 个回复

  • Introduction_to_Photonic_crystals_Transfer_matrix
    Introduction to photonic crystals. Very good textbook on photonic crystals. Includes Matlab codes for analysis of photonic crystals by Transfer Matrix Method (TMM)
    2009-06-15 23:44:37下载
    积分:1
  • MoM-for-microstrip
    codes for MOM of microstrip
    2013-11-04 05:49:50下载
    积分:1
  • 2
    说明:  MATLAB实现WiMAX物理层的平台搭建,并仿真实现QPSK,PSK调制(MATLAB WiMAX physical layer of the platform and the simulation realization of QPSK, PSK modulation)
    2013-12-16 10:52:36下载
    积分:1
  • 05ZHDMKZXT
    基于准滑动模态的滑模控制 准滑动模态系统仿真实例(Quasi-sliding mode based Sliding Mode Control Quasi-sliding mode system simulation example)
    2015-02-27 17:44:50下载
    积分:1
  • MMA
    说明:  88行SIMP拓扑优化方法程序,采用移动渐近线法MMA求解器(The code of the classical SIMP method implemented by the MMA solver.)
    2020-04-23 21:09:58下载
    积分:1
  • CPM
    数字通信程序。记录我针对数字通信(John.G Proakis)版本学习中编写的仿真程序。 和大家交流共同学习,其中的错误,希望大家指证! (Digital communication procedures. I look at digital communications records (John.G Proakis) version of the study prepared by simulation program. And to facilitate the exchange of learning, in which the error, hope that means the card!)
    2009-05-09 04:06:43下载
    积分:1
  • psntdfig
    coding for FVM-based numerical solution
    2010-12-16 20:21:51下载
    积分:1
  • manual_routing
    Path manually writing code, is to allow the ns2 manual routing is used, this is our experimental multichannel implementation, hoping to share.
    2014-01-03 10:59:38下载
    积分: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
  • RLC
    Matlab program that calculates the resonant freequency of a seria RLC circut.
    2009-03-22 22:14:20下载
    积分:1
  • 696518资源总数
  • 106155会员总数
  • 8今日下载