登录
首页 » matlab » 2

2

于 2013-01-15 发布 文件大小:612KB
0 250
下载积分: 1 下载次数: 1

代码说明:

说明:  针对故障诊断,本程序为多工况故障诊断,利用gmm对TE过程实现了故障检测,效果很好(According to the fault diagnosis, the program for fault diagnosis of the condition, TE process to realize fault detection using GMM, the effect is very good)

文件列表:

1.zip,626670,2013-01-15
新建 文本文档.txt,0,2013-01-15

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

发表评论

0 个回复

  • MATLAB-program-filtering-SAR
    说明:  SAR滤波MATLAB程序 从国外参考资料上下载的(SAR filtering MATLAB program downloaded from the Foreign References)
    2011-03-22 18:04:28下载
    积分:1
  • LabVIEW(1)
    this code about fuzzy controller
    2013-08-15 00:21:14下载
    积分:1
  • NodeAdmittanceMatrix
    该程序是IEEE118节点系统的节点导纳矩阵求取程序,输入相应的已知参数便可得到。(The program is a nodal admittance matrix IEEE118 bus system to strike the program, enter the corresponding known parameters can be obtained.)
    2014-12-02 15:57:36下载
    积分:1
  • mutual_tau
    mutual information 求时间延迟(mutual information tau)
    2010-09-02 10:28:01下载
    积分:1
  • lc
    说明:  基于matlab的分段卷积计算,循环卷积,线性关机(convolution firm一 rm1=ifft(conj(Xak1).*Xbk1) rm1=[rm1(N+2:2*N)rm1(1)
    2009-12-27 20:40:45下载
    积分:1
  • comb-filter-for-music-effect-
    音效反馈梳装滤波器的matlab程序,可配合使用实现混响效果(comb filter for music effect )
    2011-06-08 20:48:54下载
    积分:1
  • Q4
    说明:  Simulation of Alamouti’s Scheme over Rayleigh fading channel. Assume perfect channel state information at the receiver. Plot BER performance (use gray mapping) and compare it to MRC with 2RX antennas. Compare the performance with MRC.
    2011-10-14 17:03:39下载
    积分:1
  • indicators
    matlab 交易技术指标源代码, 包含常用的各种指标RSI, MACD etc(matlab source code for trading technical indicators)
    2013-06-26 14:44:28下载
    积分:1
  • Begin
    Small scale HPP optimization
    2013-07-11 21:56:24下载
    积分:1
  • knn1
    K最邻近密度估计技术是一种分类方法,不是聚类方法。 不是最优方法,实践中比较流行。 通俗但不一定易懂的规则是: 1.计算待分类数据和不同类中每一个数据的距离(欧氏或马氏)。 2.选出最小的前K数据个距离,这里用到选择排序法。 3.对比这前K个距离,找出K个数据中包含最多的是那个类的数据,即为待分类数据所在的类。(K nearest neighbor density estimation is a classification method, not a clustering method. It is not the best method, but it is popular in practice. Popular but not necessarily understandable rule is: 1. calculate the distance between the data to be classified and the data in each other (Euclidean or Markov). 2. select the minimum distance from the previous K data, where the choice sorting method is used. 3. compare the previous K distances to find out which K data contains the most data of that class, that is, the class to which the data to be classified is located.)
    2017-08-09 21:06:38下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载