mallat_multihole

500个零件4台车床加工，用动态规划逆序方法求需要的最短时间(dynamic programming backward)

"Space-Time Codes and MIMO Systems"是Mohinder Jankiraman 所著的经典之作，这里给出全书的matlabe源码。 电子版书籍另外给出。 ("Space-Time Codes and MIMO Systems" is Mohi nder Jankiraman author of classic works, here is the book matlabe source. Electronic version of books is another.)

非期望产出的SBM模型，计算带有非期望产出的效率模型(undesirable-sbm model)

watermarking watermarking

说明：  这是黑龙江大学自控理论杨易朋同学在最优估计课程当中用matlab编写的递推增广最小二乘算法!(This is the theory of Heilongjiang University, Yang Yi-controlled peer students in courses optimal estimate prepared by using Matlab recursive least squares algorithm to broaden!)

matlab与数字信号处理的相关代码，内附有详细的讲解课件(matlab and digital signal processing related code, containing a detailed explanation of courseware)

此乃用MATLAB进行PFC（功率因数校正）的simulink模型，对PFC的建模，非线性分析和参数设定具有重要作用！(This is to use MATLAB to PFC (Power Factor Correction) in simulink model of PFC modeling, nonlinear analysis, and parameter setting plays an important role!)

bess pscad baterry pscad

Induction motor - simulink

分形的练习一 ①Koch曲线 用复数的方法来迭代Koch曲线 clear i 防止i被重新赋值 A=[0 1] 初始A是连接（0，0）与（1，0）的线段 t=exp(i*pi/3) n=2 n是迭代次数 for j=0:n A=A/3 a=ones(1,2*4^j) A=[A (t*A+a/3) (A/t+(1/2+sqrt(3)/6*i)*a) A+2/3*a] end plot(real(A),imag(A)) axis([0 1 -0.1 0.8]) ②Sierpinski三角形 A=[0 1 0.5 0 0 1] 初始化A n=3 迭代次数 for i=1:n A=A/2 b=zeros(1,3^i) c=ones(1,3^i)/2 A=[A A+[c b] A+[c/2 c]] end for i=1:3^n patch(A(1,3*i-2:3*i),A(2,3*i-2:3*i), b ) patch填充函数 end (Fractal Exercise One The ① Koch curve Plural iteration Koch curve clear i to prevent i is reassigned A = [0 1] initial A is a connection (0,0) and (1,0) of the segments t = exp (i* pi/3) n = 2 n is the number of iterations for j = 0: n A = A/3 a = ones (1,2* 4 ^ j) A = [A (t* A+ a/3) (A/t+ (1/2+ sqrt (3)/6* i)* a) A+2/3* a] end plot (real (A), imag (A)) axis ([0 1-0.1 0.8])   ② Sierpinski triangle A = [0 1 0.5 0 0 1] initialized A n = 3 the number of iterations. for i = 1: n A = A/2 b = zeros (1,3 ^ i) c = ones (1,3 ^ i)/2 A = [A A+ [c b] A+ [c/2 c]] end for i = 1:3 ^ n patch (A (1,3* i-2: 3* i), A (2,3* i-2: 3* i), b ) patch filled function end)