JPEGCompression

本文从矢量量化的角度对图像进行处理，程序经过验证，正确(From the perspective of vector quantization image processing, the program verified the correct)

说明：  基于agent图的脆性仿真程序，研究对象是船舶电力系统(Agent-based simulation program brittle graphs, study the ship power system)

matlab demystified - this helps with matlab

mdio配置BCM5461，实现PHY初始化及通信相关寄存器的配置(mdio configure PHY)

模板匹配的一般实现算法和快速模板匹配的算法，简单的小程序。(The general template matching algorithm and fast template matching algorithm, simple little program.)

以matlab实作histgram equalizatuin(To implement histgram equalizatuin matlab)

采用matlab软件实现的灰色预测法。包括GM（1,1）模型和GM（1，n）模型。(The gray prediction method matlab software. Including GM (1,1) model and GM (1, n) model.)

对录音信号集 中的某一语音，利用BATLAB设计一美尔例谱算法，并实现。 取信号集 中的一个语音信号：“xxxxxx”，将它作为输入的语音信号来为设计一个美尔倒谱算法，在该算法中，主要设计了以下环节： 1.读入一个语音信号；2.对这个信号归一化；3.对归一化的信号进行加窗处理（这里的矩形窗长度必须为257，重帧长64）；4.进行预加重处理，即通过一个高通滤波器： ；5进行512点的FFT；6.分别取模平方得到功率谱；7.在设计的mel滤波器组中，我采用了25个带通滤波器；8.将得到的功率谱信号通过mel滤波器组，得到相应的25个功率值；9.对这些功率值取自然对数；10.对这些值取离散作弦变换；11.将得到的值去掉直流分量，取其它值作为MFCC参数。 (Concentrated on recording a voice signal, using BATLAB designed Mayer cases spectral algorithm, and implementation. Get a voice signal signal focus: "xxxxxx", will it as input for the design of a voice signal to Mel Cepstrum algorithm in the algorithm, the main design of the following links: 1. Read a speech signal 2. On the signal normalized 3. Of the normalized windowed signal processing (here, rectangular window length must be 257, re-frame size 64) 4. For Pre-emphasis processing through a high-pass filter: 5 for 512 points of FFT 6. modulo square were obtained spectrum 7. in the design of mel filter banks, I use a 25 band-pass filter 8 . will be the power spectrum signal by mel filter bank, corresponding to the 25 power values 9. on the power to take the natural logarithm value 10. to take these values as strings of discrete transform 11. will be of value to out DC component, to take other values as MFCC parameters.)

说明：  design active queue management for router

基于遗传算法的TSP算法，寻找最短的遍历N个城市的路径(TSP algorithm based on genetic algorithm to find the shortest path traversal N cities)