登录
首页 » matlab » PROJETO_MAQUINA_INDUCAO

PROJETO_MAQUINA_INDUCAO

于 2014-09-24 发布 文件大小:3KB
0 241
下载积分: 1 下载次数: 1

代码说明:

  Induction machine project

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

发表评论

0 个回复

  • difg
    双馈异步电机的仿真模型,能用的,可以自己修改参数,清晰明了。(Simulation model of doubly fed asynchronous motor)
    2018-05-28 10:57:52下载
    积分:1
  • radix4
    This zip file describes about Basic radix 2fft,radix 4fft and shows the basic difference between above mentioned fft with radix 16 fft
    2010-09-23 12:30:50下载
    积分:1
  • 81404593juxingchuang
    说明:  matlab 滤波器设计的源程序 福建的历史卡机弗兰克斯敬爱疯了撒 (matlab filter design of the source of Fujian)
    2008-11-10 14:27:27下载
    积分:1
  • fuyuan
    用MATLAB实现图像复原,共列举了四种方法实现了图像复原(Image Restoration Using MATLAB to achieve a total of four methods listed to achieve the image restoration)
    2009-05-08 15:29:40下载
    积分:1
  • XPathFactory
    Factory class for creating an XPath. Implementors of XPath derivatives will need to make a derived class of this. @xsl.usage advanced.
    2013-12-02 15:26:28下载
    积分:1
  • Robust-adaptive-control
    it is about Adaptive robust control. The area of adaptive control has grown to be one of the richest in terms of algorithms, design techniques, analytical tools, and modications.
    2012-12-11 20:10:09下载
    积分:1
  • Pattern-Recognition
    this rar file contains matlab files for pattern recognition where the patterns are six different shapes taken videos and that matlab gives the pattern
    2016-06-23 00:28:53下载
    积分:1
  • GCNN
    神经网络,基于广义同余神经网络的非线性系统辨识仿真(failed to translate)
    2013-05-08 23:18:11下载
    积分:1
  • kao
    MAtlab file for Digital communication
    2009-09-10 14:12:23下载
    积分: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
  • 696516资源总数
  • 106914会员总数
  • 0今日下载