V_Antenna

说明：  像素聚类区域成长法－－ 顾名思义，此方法从一个种子像素开始，通过如平均灰度，组织纹理及色彩等性质的判断，将具有类似性质的像素逐一纳入所考虑的区域中，使此区域由种子逐渐成长成一个性质相似的图像区块。(pixel clustering method regional growth-- the name implies, this method from a seed pixels, through such as average gray, the color and texture organizations such as the nature of judgment, with similar to the nature of each pixel into consideration the region, so this area has gradually grown from seed into a nature similar to the image block.)

rick子波发生器 仿真模块,需要的人可以(rick- wave generator simulation module, in need can try)

DHM PROGRAM which is used to calculate direct and inverse geometric model,direct and inverse kinematic model anddirect and inverse dynamic model of a serial robot with any dergee of freedem

matlab编写的课设作业，是一个weins游戏程序，在程序中执行wiemmd算法，包括扫雷，纸牌，qwiqwo等游戏的编写流程都很清晰. (matlab write class-based work, is a oadpq game program executiondobBfbl algorithm in the program, including mine clearance, playing cards and other games of the preparation process is very clear. )

基于SIMULINK，风电仿真所用到的模型，希望有帮助(SIMULINK, wind power simulation model used, it is helpful)

一个EKF的简单应用,实现了用EKF算法对三维非线性系统进行仿真。(A simple application of EKF,I used the EKF algorithm to simulate a three-dimensional nonlinear system.)

LMS算法函数 实现LMS算法定义，方便之后调用(least mean square algorithm)

短时傅里叶变换的Matlab程序代码，短时傅里叶变换时最经典的时频分析方法(Matlab code short time Fourier transform, short-time Fourier transform of the most classic time-frequency analysis)

大名鼎鼎赫蒙.西金的经典著作《自适应信号处理》（第4版）对应的仿真实验程序和课后习题详细解答。适合研究生学习或工程技术人员参考！(Famous Hmong. Xijir classic " Adaptive Signal Processing" (4th edition) the corresponding simulation procedures and after-school exercise in detail. Suitable post-graduate study or engineering and technical personnel reference!)

Prueba1 FletcherReeves Hernández Santiago José Maestría en Ciencias de la Computación Septiembre / 2011 1. Comenzar con un punto arbitrario 2. Calcular Gradiente de Fi 3. Si el Gradiente Fi es igual a 0(converge), termina 4. Si el Gradiente Fi es !=0 continuar 5. Encontrar dirección de búsqueda Si= -GradienteFi= - Gradiente F(Xi) 6. Determinar la Longitud Optima del incremento lamda(i) en dirección Si X(i+1)=X(i)+lamda(i)*S(i)= X(i)-lamda(i)*Gradiente F(Xi) 7. Hacer i=2 8. Obtener Gradiente Fi 9. Calcular Si= -GradFi + ( [abs(GradFi)^2]/[abs(GradF(i-1))^2] )*S(i-1) 10. Determinar la Longitud Optima del incremento lamda(i) en dirección Si X(i+1)=X(i)+lamda(i)*S(i)= X(i)-lamda(i)*Gradiente F(Xi) 7. Verificar Optimalidad de X(i+1) Si es optimo, detener Si no es optimo hacer i=i+1 e ir al paso 8