channel-model

用于存储数据,可存储1组数据.具体的大家可以侃侃2408的数据手册.(Used to store data, can store a set of data. Concrete that we can ably 2408 data sheet.)

For the use of image processing filtering using satellite images is very important that the code how to describe.

Through neural networks, ant colony algorithm, genetic algorithm, such as intelligent optimization methods to solve TSP problems

it s a viterbi coding model , including awgn and so on..

adaptive filtering Algorithm FTRLS to noise cancellation

本程序为零序电流小波变换求首波头极性及模值大小原理:故障线路的波头极性与非故障线路相反。(This procedure is zero sequence current first wave wavelet transform modulus of the first polarity and the size principle: the first wave of fault lines fault lines and non-polar opposite.)

pid自适应控制器学习和程序大家学习，很好用的(迭代)

This is a JPEG encoding & decoding program of still image. It does not use level shifting. Discrete Cosine transform (DCT) is performed both by classical & Chen s Flowgraph methods. Predefined JPEG quantization array & zigzag order are used here. RUN - LEVEL coding is used instead of Huffman coding. Compression ratio is compared for each DCT method. Effect of coarse and fine quantization is also examined. The execution time of 2 DCT methods is also checked. In addition, most energatic DCT coefficients are also applied to examine the effect in MatLab 7.4.0 R2007a. Input is 9 gray scale pictures & output is 9*9=81 pictures to compare. Blocking effect is obvious. (This is a JPEG encoding & decoding program of still image. It does not use level shifting. Discrete Cosine transform (DCT) is performed both by classical & Chen s Flowgraph methods. Predefined JPEG quantization array & zigzag order are used here. RUN - LEVEL coding is used instead of Huffman coding. Compression ratio is compared for each DCT method. Effect of coarse and fine quantization is also examined. The execution time of 2 DCT methods is also checked. In addition, most energatic DCT coefficients are also applied to examine the effect in MatLab 7.4.0 R2007a. Input is 9 gray scale pictures & output is 9*9=81 pictures to compare. Blocking effect is obvious. )

[X,Y,Z] = k_clique(k,A) Inputs: k - clique size A - adjacency matrix Outputs: X - detected communities Y - all cliques (i.e. complete subgraphs that are not parts of larger complete subgraphs) Z - k-clique matrix(k-clique algorithm as defined in the paper Uncovering the overlapping community structure of complex networks in nature and society - G. Palla, I. Derényi, I. Farkas, and T. Vicsek- Nature 435, 814–818 (2005))

压缩感知的典型程序仿真，稀疏基为小波基，重构算法为OMP算法。(Perception of typical compression process simulation, sparse basis for the wavelet, reconstruction algorithm for the OMP algorithm.)