exa070904_remezord_2

一个用simulink做的模糊PID自适应系统，FIS等都比较简单，适合初学者。通过与PID的比较曲线可以看出此系统更加优越。(A simulink do with self-adaptive fuzzy PID system, FIS are relatively simple, suitable for beginners. Comparison with the PID system curve can be seen even more superior.)

基于TMS320C32的自适应滤波程序,已调试通过.可以和低通滤波做比较 观察其优点 开发环境(adaptive filtering procedures, has been through testing. Can low-pass filter and compared the observed advantages development environment )

说明：  自己做的基于Matlab/Simulink 的系统仿真技术与应用一书的配套实验(Make their own based on Matlab/Simulink for System Simulation Technology and Application of a book supporting the experimental)

simulation file for dq model for skill improvment and matlab

Essential MATLAB for Engineers and Scientists

信号分离，可以分离振动信号的噪声，达到测得信号更接近原始信号(Signal separation, can be separated from the noise of the vibration signal to reach the measured signals closer to the original signal)

能量采集开放仿真程序！能量采集开放仿真程序！能量采集开放仿真程序！能量采集开放仿真程序！能量采集开放仿真程序！(Energy harvesting Energy harvesting)

关于HTK-3.3的使用说明及相应的更新说明,内容全面易懂！！(HTK-3.3 on the instructions for use and the corresponding update instructions, comprehensive and understandable! !)

说明：  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)

粒子群优化算法 包含3个文件 AsyLnCPSO PSO SelPSO(Particle Swarm Optimization)