lab3_sampling_zia

MVDR聚焦波束形成,进场条件下利波束形成用MVDR算法实现聚焦，得到空间普(MVDR beam_forming)

matlab code for acrobat

puma260机器人的变换矩阵计算及其工作区域绘制。(puma260 robot transformation matrix calculation and the work area to draw.)

IV曲线中效率计算方法IV曲线中效率计算方法IV曲线中效率计算方法(IV curve in the efficiency calculationIV curve in the efficiency calculationIV curve in the efficiency calculationIV curve in the efficiency calculation)

带交叉因子的粒子群MATLAB算法程序，可实现带约束变量的微粒群算法(With cross-factor PSO algorithm MATLAB procedures, can be constrained variable particle swarm optimization)

function dg=gplus(x,y,z,x1,x2,y1,y2,z1,z2,p) G=6.67e-11 t222=myfun(x,y,z,x2,y2,z2) t122=myfun(x,y,z,x1,y2,z2) t212=myfun(x,y,z,x2,y1,z2) t221=myfun(x,y,z,x2,y2,z1) t211=myfun(x,y,z,x2,y1,z1) t121=myfun(x,y,z,x1,y2,z1) t112=myfun(x,y,z,x1,y1,z2) t111=myfun(x,y,z,x1,y1,z1) dg=-G*p*1e6*(t222-t122-t212-t221+t211+t121+t112-t111) 转化为g.u. function y=myfun(x,y,z,xi,eta,zeta) R=sqrt((xi-x).^2+(eta-y).^2+(zeta-z).^2) temp1=(xi-x).*log((eta-y)+R) temp2=(eta-y).*log((xi-x)+R) temp3=(zeta-z).*atan((zeta-z).*R/((xi-x).*(eta-y))) 书中所给公式 temp3=-(zeta-z).*atan((xi-x).*(eta-y)./(zeta-z)./R) 上式变换 y=temp1+temp2+temp3 (function dg = gplus (x, y, z, x1, x2, y1, y2, z1, z2, p) G = 6.67e-11 t222 = myfun (x, y, z, x2, y2, z2) t122 = myfun (x, y, z, x1, y2, z2) t212 = myfun (x, y, z, x2, y1, z2) t221 = myfun (x, y, z, x2, y2, z1) t211 = myfun (x, y, z, x2, y1, z1) t121 = myfun (x, y, z, x1, y2, z1) t112 = myfun (x, y, z, x1, y1, z2) t111 = myfun (x, y, z, x1, y1, z1) dg =-G* p* 1e6* (t222-t122-t212-t221+t211+t121+t112-t111) converted the Gu function y = myfun, (x y, z, xi, eta, zeta) R = sqrt ((xi-x). ^ 2+ (eta-y). ^ 2+ (zeta-z). ^ 2) temp1 = (xi-x).* log ((eta-y)+R) temp2 = (eta-y).* log ((xi-x)+R) temp3 = (zeta-z).* atan ((zeta-z).* R/( (xi-x).* (eta-y))) book given formula Temp3 =- (Zeta-z)* ATAN ((Xi-X)* (ETA-y)/(Zeta- Z)/R) the above formula transform Y = temp1+temp2+temp3 )

说明：  Genetic Algorithm Code for Matlab

Calendar Data Source Code for Andriod.

求出语音mel倒谱系数的matlab代码，返回mfc(function mfc=mfcc(x) )

A forward Euler method has been implemented and a simple differential equation solved to compare the performance of the Euler method with Runge-Kutta method.