Birthday_gift

calculate parameters of motion blur

说明：  遗传算法的matlab编码文件,适合新手(code of gads for matlab)

多用户MIMO预编码技术的对比，bd预编码，zf预编码，mmse预编码等，对学习多用户mimo系统很有帮助。(Multi-user MIMO precoding technology comparison, bd precoding, zf precoding, mmse precoding, etc., to learn multi-user mimo system is very helpful.)

以齿轮系统动力学和非线性动力学理论为基础,针对齿轮系统时变啮合刚度和齿侧间隙耦合作用的具体特点,建立了齿轮系统非线性模型,并用数值积分和数值仿真方法对其在某些参数域中进行了非线性振动研究(Based on the dynamics of a gear system and the theory of nonlinear dynamics, co nsidering characteristics of coupling action of the time-varying mesh stiffness and the gear backlash, a model of the nonlinear gear system is developed. The nonlinear vibration is studied by using numerical integration method and numerical simulation in some parameter fields.)

Automatic generation control implementation in matlab

说明：  寻找三次样条多项式需要求解大量的线性方程。实际上，给定N个断点，就要寻找N-1个三次多项式，每个多项式有4个未知系数。这样，所求解的方程组包含有4*(N-1)个未知数。把每个三次多项式列成特殊形式，并且运用各种约束，通过求解N个具有N个未知系数的方程组，就能确定三次多项式。 (find cubic spline solving polynomial need a lot of linear equations. In fact, given N breakpoints, it is necessary to look for N-1 cubic polynomial, each with four polynomial coefficients unknown. Thus, by solving the equations contain 4* (N-1) unknown. Each cubic polynomial Timing special form, and use of various constraints, by solving N with N unknown coefficient equations, we can identify three polynomial.)

matlab环境下进行编程的书籍。为基础知识的部分。(matlab environment for programming books)

matlab 用于人口模型的研究 涉及到阻滞增长模型 (matlab renkou)

Lecture of programiring for C language part 6

分形的练习一 ①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)