登录
首页 » matlab » mianyi

mianyi

于 2009-11-30 发布 文件大小:2KB
0 165
下载积分: 1 下载次数: 141

代码说明:

  免疫算法中的克隆选择算法,运用该算法能够进行故障诊断。运行之后效果较好。(Immune algorithm in the clone selection algorithm, using the algorithm capable of fault diagnosis. Running after the effect is good.)

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

发表评论

0 个回复

  • CS
    说明:  关于SAR条带模式的CS算法,关于SAR条带模式的CS算法(a very good CS imaging algorithm)
    2010-11-14 00:44:22下载
    积分:1
  • MATLAB_suanfa
    matlab算法大全,有多种实用的算法资料(matlab algorithm Daquan, a variety of practical algorithm for data)
    2012-06-13 11:19:05下载
    积分:1
  • IIR
    IIR数字滤波器的设计 上学的时候一直不知道如何用C语言来编写IIR滤波器,终于找到了,上传给大家 希望能帮到大家。(IIR digital filter design when the school did not know how to use C language to write IIR filters, and finally found it, upload to hope to help you.)
    2013-12-02 14:46:26下载
    积分:1
  • YUV2AVI
    converts uncompressed .yuv files into .avi files
    2009-12-20 07:55:13下载
    积分:1
  • fuzzyPID
    某工业系统可等效为二阶环节带延迟...且执行机构具有0.07的死区和0.7的饱和区。采样时间T=0.01;系统的输入r(t)=1.5 要求1)设计一模糊控制器,使系统输出尽快跟随系统输入;2)模糊控制与PID控制的性能进行比较;3)系统有无延迟性能进行比较(An industrial system can be equivalent to second-order part of the implementing agencies with a delay ... and the dead with a .07 and 0.7 saturation. Sampling time T = 0.01 the system input r (t) = 1.5 requirement 1) design a fuzzy controller, the system output as soon as possible to follow the system input 2) fuzzy control and PID control performance comparison 3) whether the delay in the system performance comparison)
    2010-01-22 19:15:37下载
    积分:1
  • danchunxingfa
    单纯形法,求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是:线性规划问题的可行域是 n维向量空间Rn中的多面凸集,其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是:先找出一个基本可行解,对它进行鉴别,看是否是最优解;若不是,则按照一定法则转换到另一改进的基本可行解,再鉴别;若仍不是,则再转换,按此重复进行。因基本可行解的个数有限,故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。 (Simplex method, for solving linear programming problems common method. Simplex is the American mathematician GB Danzig in 1947 first put forward. Its theory is based on: linear programming problem feasible region is n-dimensional vector space Rn convex set in the multi-faceted, and its optimal value must be if the vertices of a convex set to achieve. Feasible solution corresponding to the vertex is called a basic feasible solution. The basic idea of the simplex method is: first find a basic feasible solution, to identify it and see whether it is the optimal solution If not, switch to another according to certain rules to improve the basic feasible solution, and then identify if still No, the re-conversion, click here to repeat. Due to the limited number of basic feasible solution, it will be converted by the finite optimal solution can be reached. If the problem can also be the optimal solution method has been applied without discrimination. )
    2011-01-17 21:01:44下载
    积分:1
  • CG
    说明:  利用共轭梯度法求线性方程组的Matlab算例(Using conjugate gradient method for solving linear equations Matlab examples)
    2015-03-31 11:05:02下载
    积分:1
  • shengquanxi
    近场声全息仿真程序 二个点声源的近场声全息技术(Nah emulator two point source of near-field acoustic holography)
    2015-04-08 13:43:15下载
    积分:1
  • RLS
    运行结果良好的三个RLS算法,供大家参考使用(good operating results in three RLS algorithm, for reference use)
    2005-08-01 15:51:29下载
    积分:1
  • FCPVgridconnected
    Grid connected Photovoltaic - Fuel Celle hybrid system power plant
    2014-01-05 23:00:54下载
    积分:1
  • 696518资源总数
  • 105595会员总数
  • 1今日下载