登录
首页 » matlab » ballbeam

ballbeam

于 2009-12-12 发布 文件大小:1KB
0 229
下载积分: 1 下载次数: 17

代码说明:

   ball and beam system

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

发表评论

0 个回复

  • HWTCoding
    CODING THE HAAR WAVELET TRANSFORM....
    2010-08-08 04:26:06下载
    积分:1
  • Embed_PVD
    This is code for Embedding in PVD
    2012-06-25 21:43:05下载
    积分:1
  • Causal-IIR
    Non-Causal IIR Filter Part 1: Setting up the Input signal to the Wiener Filter Part 2: Seperating the negative lags and positive lags... The one at 0 index is clustered together in the positive part highqq
    2013-07-27 21:57:34下载
    积分:1
  • Universal_Modualtion
    Universal Modulation shows a GUI with Analog and Digital Modulation techniques
    2013-04-25 14:27:25下载
    积分:1
  • QPSO
    量子粒子群的matlab程序,有测试函数(qpso matlab)
    2014-01-08 10:25:30下载
    积分:1
  • matlab
    MATLAB二分法程序, !!!!(MATLAB二分法程序)
    2010-10-22 15:16:05下载
    积分:1
  • pso_implement
    For PSO implimentation.
    2012-04-06 18:25:57下载
    积分:1
  • 8
    bp网的程序,设计一个神经网络字符分类器对英文字母进行分类。输入向量含有16个分量,输出向量分别用设置的T向量,还不完善,有待改进(bp network program, character design a neural network classifier to classify the English alphabet. Input vector contains 16 components, respectively T vector output vector set, not perfect, needs improvement)
    2021-04-08 21:59:00下载
    积分:1
  • Matlab_zuixiaofeiyong
    最小费用最大流算法通用Matlab函数 基于Floyd最短路算法的Ford和Fulkerson迭加算法   基本思路:把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条   自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流   量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新   确定,如此多次迭代,最终得到最小费用最大流.(Minimum cost maximum flow algorithm general Matlab functions The basic idea of ​ ​ the shortest path algorithm of Ford and Fulkerson superposition algorithm based on Floyd: the cost of unit flow on the arc as a certain length of Floyd and the shortest path method to determine the one percent self-V1 to the Vn the most short-circuit and then the this Article is the most short-circuit as a can be the expansion Lu, to use solving the method of the the the problem of the maximum flow will its on the stream the amount of increased to the maximum possible values while the the the the flow of of this Article of the shortest on the road increase, the costs of the unit of flow on each arc sure, so many iterations, the final minimum cost maximum flow.)
    2012-07-27 14:55:22下载
    积分:1
  • DCTG2
    这个程序使用第二代curvelet进行稀疏表示,(This program uses the second generation curvelet sparse representation,)
    2015-01-18 21:20:17下载
    积分:1
  • 696516资源总数
  • 106913会员总数
  • 8今日下载