D2P

可以实现对混合喜好的主分量分析，这是在盲信号处理中队信号的迁出里非常有用(likePCA)

aco-ga for feature selection

Wireless Sensor Network is the network of power-limited sensing devices called sensors. Wireless sensor network is differ other networks in terms of optimization of amount of energy because when these sensors sense and transmit data to other sensors present in the network, considerable amount of energy is dissipated. Various routing algorithms are proposed to limit the powers used by the wireless sensors. Hierarchical routing protocols with the concept of clustering like LEACH and and DEEC are already best known for maintaining energy efficiency. In this submission, we will compare these two protocols.

SVC PSR 光谱数据的读入，光谱平滑，光谱重采样，文件批处理；(these files afford a convenience way to read SVCPSR, resample spectral and smooth the spectral.)

关于粒子滤波（PF）的matlab程序，说明了粒子滤波的基本算法。(About particle filter (PF) of matlab program shows the basic particle filter algorithm.)

说明：  modèle de la machine asynchrone avec un onduleur de tension

damp_motion2资料的详细功能、包含内容说明(damp_motion2 information, including the content description)

用最大距离法对K均值的初始聚类中心进行确定(max distance algorithm)

) Compression using huffman code -with a number of bits k per code word -provide huffman table Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree. () Compression using huffman code -with a number of bits k per code word -provide huffman table Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree. )

fortran的matlab代码,可以将fortran仿真结果可视化(fortran matlab code, you can visualize simulation results fortran)