登录
首页 » matlab » P

P

于 2011-06-06 发布 文件大小:1KB
0 94
下载积分: 1 下载次数: 1

代码说明:

说明:  未校正三容水箱液位控制系统仿真 基于Matlab的控制系统仿真处理(Uncorrected three-tank water level control simulation control system simulation based on Matlab treatment)

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

发表评论

0 个回复

  • Win32GUI
    windows gui wrapper for fb
    2013-12-12 15:44:33下载
    积分:1
  • Ekman风海流
    说明:  对埃克曼风海流进行数值模拟,观察不同风速下风海流的结构差异以及风海流结构随时间的差异。(The numerical simulation of Ekman wind current is carried out to observe the structure difference of wind current under different wind speed and the difference of wind current structure with time.)
    2021-04-14 15:18:55下载
    积分:1
  • mintree
    用matlab去实现基于dijkstra算法实现最小生成树(Using matlab to dijkstra algorithm based on minimum spanning tree)
    2009-05-30 12:18:53下载
    积分:1
  • experiment2
    说明:  AR过程的线性建模与功率谱估计 Yule-Walker法(自相关法) 协方差法;(2) Burg方法;(3) 修正协方差法 (The linear AR process modeling and Yule-Walker power spectrum estimation method (autocorrelation method) covariance method (2) Burg method (3) modified covariance method)
    2009-08-28 10:50:56下载
    积分:1
  • matlabguideshej
    matlab的gui设计程序,有关<信号与系统>课程的辅助教学设计(Matlab gui design procedures, the)
    2007-05-10 21:39:03下载
    积分:1
  • wavelet2_plot
    通过matlab实现的2维小波变换程序,代码书写规范标准,易于读懂,运行简单(Matlab achieved through a two-dimensional wavelet transform, code writing standards, easy to read, simple operation)
    2014-10-29 14:51:56下载
    积分:1
  • tracker_release
    (eccv12)Circulant structure tracking-by-detection[matlab]源代码((eccv12)Circulant structure tracking-by-detection[matlab])
    2013-11-06 14:22:21下载
    积分:1
  • 数字信号处理(第四版)(高西全)序集
    说明:  数字信号处理程序合集,高西全版本第四版书本的习题编程(Digital signal processing program collection, exercises programming of the fourth edition of the full version of Gao Xi)
    2020-12-01 14:39:26下载
    积分:1
  • Question1
    说明:  C++源代码,递归实现。原问题描述:鼓上蚤时迁到一个山洞里去盗宝,里面有n件宝贝,价值分别是a1,a2......an,并且满足ai大于a1+a2+....+a(i-1)的和。他身上有一个背包,能装的东西最大价值是K,他只能进洞一次,请问他最多能带出多少? 要求:输入K,n,a1,a2......an 输出:他能最多带出的宝物价值 (C++ Source code Recursive achieve. The original problem description: drum when flea盗宝going to move in a cave, there are n pieces of treasure, valued are a1, a2 ...... an, and to meet ai than a1+ A22B !....+ a (i-1) and. Him to have a backpack, things can hold the greatest value is K, he could only hole once, to ask him to bring out the maximum number of? Requirements: Enter K, n, a1, a2 ...... an output: he can bring out the maximum value of the treasures)
    2008-12-02 21:07:25下载
    积分:1
  • hw2
    A code on Kohonen NN that works with an arbitrary 3D data in a file with a name data.txt
    2010-05-07 00:39:00下载
    积分:1
  • 696524资源总数
  • 103939会员总数
  • 12今日下载