fuzzyPID

matlab代码，不利用模糊工具箱的情况下编写的模糊神经网络程序。(Matlab code, not fuzzy neural network program prepared in case of fuzzy toolbox.)

We have discussed and analyzed the case of no noise uncertainty. Now, considering the case with uncertainty in the noise model [20], the distributional uncertainty of noise can be represented

simulink 简明教程，课件，PDF格式，包括六个章节，详细的叙述了如何用simulink进行仿真建模(simulink concise tutorials, courseware, PDF format, including six chapters, a detailed description of how to use simulink simulation modeling)

matlab23 matlab 6.5 辅助优化计算与设计(matlab23 matlab 6.5 Optimization of the calculation and design of auxiliary)

cofdm simulation graphs(5) 摘自９４年名家论文(cofdm simulation graphs (5) from the famous 94 theses)

boost 非线性分叉仿真 完整出图 效果明显(boost non-linear simulation complete bifurcation diagram showing the effect of significantly)

DFT进行频谱分析时的三种现象 1、混叠：对连续信号采样，要求连续信号是带限的，采样频率要足够高。Fs应满足Nyquist采样定理才不产生混叠。 采样前加低通滤波器防混叠 2、频谱泄漏：DFT对时域信号进行了截断（相当于采样信号乘了一个窗函数），时域的乘积相当于频域卷积，改变了原信号频谱。 改用其他窗函数（非矩形）改善泄漏。 3、栅栏现象：DFT 只给出了频谱在采样点上的取值，采样点间的频谱内容丢失。(DFT spectrum analysis of a three phenomena, aliasing : continuous signal sampling, requiring continuous signal is band-limited, the sampling frequency should be high enough. Fs meet the Nyquist Sampling Theorem would not have aliasing. Sampling former low-pass filter plus anti-aliasing 2, spectrum leakage : DFT right time domain signal a disconnect (equivalent to a sampling signal by a window function). time domain is equivalent to the product of frequency-domain convolution, changes in the spectrum of the original signal. Window functions to switch to other (non-rectangular) to improve leakage. 3, fenced phenomenon : DFT spectrum is given only at the sampling point value, sampling points of the spectrum as lost.)

数字信号发生器，可以产生各种常用波形，如三角函数，正弦函数，白噪声等。是基于matlab的虚拟仪器。(Digital signal generator, can produce a variety of commonly used waveforms, such as trigonometric functions, the sine function, white noise or the like. Virtual instrument based on matlab.)

Test Target Class Source Code for Andriod.

RT（快速扩展随机树）是一种基于采样的算法求解路径规划问题。RRT提供可行的解如果时间RRT趋于无穷大。 RRT *是一个基于采样的算法为解决运动规划问题，这是一个概率最优变异性。RRT *收敛到最优解的渐近。 RRT * FN是一个基于采样的算法基于RRT *。RRT * FN内在渐近收敛到最优解，然而RRT * FN实现使用更少的内存(RRT (Rapidly-Exploring Random Tree) is a sampling-based algorithm for solving path planning problem. RRT provides feasable solution if time of RRT tends to infinity. RRT* is a sampling-based algorithm for solving motion planning problem, which is an probabilistically optimal variant of RRT. RRT* converges to the optimal solution asymptotically. RRT*FN is a sampling-based algorithm based on RRT*. RRT*FN inherents asymptotical convergence to the optimal solution, however RRT*FN implements it using less memory.)