-
fuzzypid1
一个用simulink做的模糊PID自适应系统,通过三个模糊FIS:dkp,dki,dkd来分别控制Kp,Ki,Kd,以达到PID参数可自动调整的目的。(A simulink do with self-adaptive fuzzy PID system, through three fuzzy FIS: dkp, dki, dkd to control the Kp, Ki, Kd, in order to achieve automatic adjustment of PID parameters can be objective.)
- 2009-04-12 19:08:03下载
- 积分:1
-
jishi
计时器=================(Timer =================)
- 2009-12-27 21:41:10下载
- 积分:1
-
program-for-dt-cwt-transform
i need the matlab coding for image fusion using different types of techniques . so, i need the particular coding your file. i need different types pf transform like IHS,PCA, DCT, and brovey transform.
- 2014-10-14 15:15:59下载
- 积分:1
-
thresh_tool
in this image thresholding is done.image thresholding is getting by using seed polints concept
- 2010-01-08 20:09:51下载
- 积分:1
-
new-ALOHA
说明: 改进防碰撞纯ALOHA的matlab仿真算法(Improved anti-collision algorithm for pure ALOHA the matlab simulation)
- 2011-03-20 11:40:11下载
- 积分:1
-
SubjectParser
Subject Parser extends Header Parser Source Code for Andriod.
- 2014-01-13 12:12:38下载
- 积分:1
-
M
图像处理综合实例的SIMULINK实现例程(SIMULINK image processing example implementation routines
)
- 2013-11-30 10:45:52下载
- 积分:1
-
Matlab-Basic-Tutorial
MATLAB的入门书籍,编写思路清晰,内容偏基础,适合刚入门的同学学习。书的页码不多,在很少的时间内就可以完成。(MATLAB study books for begineers, which writing with clear ideas, content-based bias for students just getting started learning. Book have little pages and easy to complete.)
- 2012-01-17 17:57:15下载
- 积分:1
-
m_youxuandui
以r=6 1 103F为基础,抽取出其他m序列,在生成的m序列集中,寻找出m序列优选对,确定优选对数量,并画出它们自相关和互相关函数图形;(Based on the r = 6 1 103 f, extract other m sequence, concentrated in the generated m sequence, selection to find the m sequence, determine the optimum number of, and draw them autocorrelation and cross-correlation function graph
)
- 2013-05-22 09:55:09下载
- 积分:1
-
Minimum-Cost-Flow
最小费用最大流问题是经济学和管理学中的一类典型问题。在一个网络中每段路径都有“容量”和“费用”两个限制的条件下,此类问题的研究试图寻找出:流量从A到B,如何选择路径、分配经过路径的流量,可以达到所用的费用最小的要求。(Minimum cost maximum flow problem is economics and management in a class of typical problems. Each path in a network has the " capacity" and " costs" two limiting conditions, such problems of trying to find out: Flow from A to B, how to choose the path, the path of the flow through the distribution can be achieved The use of the minimum cost requirements.)
- 2013-08-23 23:10:20下载
- 积分:1