tongbuhundun

Coding for COA_High Precision_high convergence ***Cuckoo Optimization Algorithm*** * Matlab Toolbox Ver. 1.0.1 * programmed by: "Ramin Rajabioun, 2011" This code minimizes your cost function, so don t change any part of your code.

FAST ICA，fast independent component analysis，用于分解独立的component(FAST ICA, fast independent component analysis, independent component used to decompose)

this file introduces practical simulations about MIMO OFDM systems. ....................... ........... ..... . . . . . . . . . . . . . . . . . . . . . . . . . .

线性矩阵不等式的完整程序，对初学者来说是不错的资料，快下载吧。(LMI complete program for beginners is good information, fast to download it.)

神经网络实现线损预测，具有很好的可扩展性，适合初学者进行学习(The power of neural network prediction, has good scalability, suitable for beginners to learn the topic)

负向选择算法的一个例子,它的基本思想就是通过采集正常数据集合生成检测器集，然后将待测数据与抗体集合中全部元素进行匹配计算，如与任一元素的匹配达到一定阈值，即判断该数据异常。(An example of negative selection algorithm. The basic idea is to collect the normal data set generated by the detector set, and then tested the data collection with the antibody to match all the elements of calculation, if any element of the match reaches a certain threshold, that determine the data exception.)

Hand Gesture Recognition NOTES: 1) For the details of the algorithm investigate the following images: -AlgorithmOverall.jpg -MKRoDAlgorithm.jpg 2) The prototype is implemented on MATLAB 7.0 and revised in MATLAB 7.10.0 3) The backgrounds of input images have to be purely ‘black’ and the details of the content(palms, fingers) must be clear for accurate recognition of the ASL. 4) A reduced ASL dataset is used. The dataset contains the following ASL gestures: "b,c,h,i,o,l,y". ---------------------------------------------------------------- Use execHGR.m inside the Project folder in order to execute the program. I hope you will enjoy it.

LTE下行链路级仿真程序，内附链路信道模型使用说明和用户使用手册(LTE downlink level simulation program)

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.)

自己毕设的一部分，vblast2x1、2x2和 alamouti 2x1 2x2的误码率作图比较。(vblast2x1, 2x2 and alamouti 2x1 2x2 BER plotted comparison.)