MAT-LAB-FILE

直方图的仿真，直方图的仿真，直方图的仿真，直方图的仿真，(Histogram of the simulation, the simulation histograms, the histogram of the simulation, the simulation histograms,)

数值计算中平方根算法的源程序，采用matlab写的，对数值计算有很大的帮助作用。(Square root algorithm for the numerical calculation of the source, using matlab to write on the numerical calculation of great help.)

infinite HMM Refer to Beal s Paper Applying Gibbs Sampling in inference the number of states of HMM is changeable in this algorithm, based on Dirichlet Proce(infinite HMMRefer to Beal s PaperApplying Gibbs Sampling in inferencethe number of states of HMM is changeable in this algorithm, based on Dirichlet Proce)

说明：  压缩包里面包含三个程序，分别是Nyquist图和bode图仿真，已知传递函数，求脉冲和阶跃响应，另一个自己研究一下就可以知道的(Compressed packet which contains three procedures, namely Nyquist diagram and bode diagram simulation, known transfer function, and impulse and step response, and the other to look at their own will be able to know)

说明：  On Maximum-Likelihood Detection and the Search for the Closest Lattice Point

This program apply iterpolation on a speech file.

短时傅立叶变换应用示例，展示了如何实现三个点频信号在时域上的分离。(Short time fourier transform application example, showing how to set apart three different signals with different frequencies in time domain.)

ARMA有理谱估计的阶数估计，用于估计用ARMA过程估计功率谱时要用几阶比较合适。(ARMA spectrum order estimation. It is used to compute the order of ARMA process that suited for signal estimation. )

现有的几个网络拓扑随机发生器，其实很难生成理想的网络拓扑结构，其主要原因在于很难控制节点的疏密和间距。我们提出来的这个改进算法，在随机抛撒节点的时候使用了K均值聚类，由本算法作为网络拓扑发生器，网络节点分布均匀且疏密得当，边的分布也比较均衡(The few existing random network topology generator, is in fact very difficult to generate the desired network topology, the main reason it is difficult to control the node density and spacing. We put forward the improved algorithm, throw in random nodes when using the K-means clustering, by the algorithm as a network topology generator, network nodes and spacing evenly distributed properly, the edge of a more balanced distribution of)

这是用MATLAB做的三维立体图。。。。。。。。(This is done using MATLAB three-dimensional map. . . . . . . .)