登录
首页 » matlab » PlantIdentification

PlantIdentification

于 2011-02-08 发布 文件大小:63KB
0 201
下载积分: 1 下载次数: 8

代码说明:

  Plant step response approximation using two- or three- parametrical models for system identification

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

发表评论

0 个回复

  • wavelettransform1
    对三维数据进行处理,得到图像的多尺度细节,进行分析处理(trea the three-dimensional data)
    2010-11-06 09:48:53下载
    积分:1
  • EMD
    EMD分解,可以有效的解决EMD分解问题,并嫩而过画出希尔伯特谱(EMD decomposition, can effectively solve the problem of EMD and tender and had drawn Hilbert spectrum)
    2013-07-15 14:56:30下载
    积分:1
  • matlab-lerning
    对MATLAB初学者具有很好的作用,而且容易理解和接受,很管用哦(MATLAB for beginners on the role of good and easy to understand and accept, it is workable oh)
    2011-06-01 19:47:55下载
    积分:1
  • Untitled2
    WAVE LET PID FOR aqm
    2015-02-28 07:05:09下载
    积分:1
  • jpeg
    jpeg图像压缩,好用的,matlab实现(jpeg image compression, easy to use, matlab implementation)
    2011-05-18 15:11:37下载
    积分:1
  • GA-hy
    遗传算法学习文档,是ppt课件资料,不错的课件!!(Study documents the genetic algorithm is ppt courseware information, good courseware! !)
    2011-06-05 09:23:13下载
    积分:1
  • QR_MATLAB
    QR 分解 (包括Householer, Givens, 经典Gram Schmidt, 修正的GS methods)(QR factorization including Householer, Givens, CGS, MGS)
    2012-10-06 16:05:06下载
    积分:1
  • CAD-sim-control-system-MATLAB
    《控制系统CAD与仿真-MATLAB语言及应用》(CAD and simulation of the control system--MATLAB language and its application.)
    2014-01-21 16:14:25下载
    积分:1
  • 0-1programming
    0-1整数规划有很广泛的应用背景,比如指派问题,背包问题等等,实际上TSP问题也是一个0-1问题,当然这些问题都是NP问题,对于规模较大的问题用穷举法是没有办法在可接受的时间内求得最优解的,本程序只不过是一个练习,得意之处是用递归法把所有解都排列出来。另:胡运权所著的《运筹学基础及应用(第三版)》第97页的例3,我用本程序求解得到的结果是:最优解是x*=(1,0, 0, 0, 0),最优值是f(x*)=8,但书求得最优解是x*=(1,0, 1, 0, 0),最优值是f(x*)=4,是不是书中写错了,请大家验证。以下是源程序,大家可以任意使用无版权问题,另外,如果大家有大规模的0-1规划的问题也希望提供给我,谢谢。变量个数至少是3个(0-1 Integer Programming is a very broad background, such as assignment, bags and so on. actually TSP is a 0-1, of course, these problems are NP, for larger problem with the law is not exhaustive approach in an acceptable time frame to obtain the optimal solution. this procedure is only one practice, farewell tour is the method used recursive all of the solutions to show. Another : Hu Yun-author of "operational research, and application base (third edition)" Article 97 of the three cases, I use this procedure to solve the result is : is the optimal solution x = (1,0, 0, 0, 0), the optimal values of f (x*) = 8, but the book is to find the optimum solution x = (1,0, 1, 0, 0), the optimal values of f (x*) = 4, the book is not a mistake, please certification. Following is the source)
    2006-07-01 10:33:18下载
    积分:1
  • MPSO
    particle swarm optimization
    2011-07-28 13:25:03下载
    积分:1
  • 696518资源总数
  • 105873会员总数
  • 12今日下载