Simple-Clustering

改进的群体智能算法，简称PSO算法，包括C和matlab两种版本(Improved swarm intelligence algorithm, referred to as PSO algorithm, including two versions of C and matlab)

Bayes model averaging with selection of regressors - This program can be utilized for Bayesian Variable Selection using Gibbs Sampler(Bayes model averaging with selection of regressors- This program can be utilized for Bayesian Variable Selection using Gibbs Sampler)

说明：  介绍matlab画图的很好、很全面的ppt(matlab_plot)

运行可实现的lpc matlab编码源代码 (Operation can realize the LPC matlab source code)

pong game in python using simplegui

维纳滤波，有非常齐全的源代码、测试文件，针对不同的SNR均有比较，代码测试通过(Wiener filter ,including complete source file ,testing audio files,and comparing different SNRs.The project has passed through edition)

16QAM调制和解调，中间经过高频调制，采用均衡接收,信道为加性高斯白噪声(16QAM modulation and demodulation, then modulate the signal to the high frequence before translated onto the channel)

有限元6面体8节点等参元的单元刚度阵计算函数(failed to translate)

单纯形法，求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是：线性规划问题的可行域是 n维向量空间Rn中的多面凸集，其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是：先找出一个基本可行解，对它进行鉴别，看是否是最优解；若不是，则按照一定法则转换到另一改进的基本可行解,再鉴别；若仍不是，则再转换,按此重复进行。因基本可行解的个数有限，故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。 (Simplex method, for solving linear programming problems common method. Simplex is the American mathematician GB Danzig in 1947 first put forward. Its theory is based on: linear programming problem feasible region is n-dimensional vector space Rn convex set in the multi-faceted, and its optimal value must be if the vertices of a convex set to achieve. Feasible solution corresponding to the vertex is called a basic feasible solution. The basic idea of the simplex method is: first find a basic feasible solution, to identify it and see whether it is the optimal solution If not, switch to another according to certain rules to improve the basic feasible solution, and then identify if still No, the re-conversion, click here to repeat. Due to the limited number of basic feasible solution, it will be converted by the finite optimal solution can be reached. If the problem can also be the optimal solution method has been applied without discrimination. )

this kalman with decouple