DC14Sample

说明：  遗传算法，prufer编码解决最小生成树问题(GA)

信号与系统基础教程 MATLAB例题 (Signals and systems based on MATLAB Tutorial Example)

matlab中Gauss_Seidel迭代法的实现(matlab implementation of iterative methods in Gauss_Seidel)

说明：  希尔伯特黄变换，用EMD将信号分解成本征模态函数，对分解的IMF分量进行hilbert变换(Hilbert Huang transform (HHT), EMD is used to decompose the signal into the cost eigenmode function, and the decomposed IMF component is transformed by Hilbert transform)

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

列主元高斯消去法解线性方程组Ax=b, 顺序高斯消去法解线性方程组Ax=b。(Column pca gauss elimination solution system of linear equations Ax = b, sequential gaussian elimination solution system of linear equations Ax = b. )

matlab 简易播放器，可在matlab中播放音乐(matlab music)

The code for JPEG realisation with some mistakes caracteristics.

说明：  机器学习神经网络算法工具包，matlab实现(neutral network deep learning)

This is the matlab code of improved LEACH. It describe the raffinement of LEACH protocol