登记软件的源代码，算法很简单，只是起到一个功能…

水波纹的模拟。工具：Opengl＋glut(ripple simulation. Tools : Opengl+ glut)

借助于已有数据挖掘算法，实现决策树算法，对酒的品质进行划分。(By means of the existing data mining algorithms, decision tree algorithm, to be divided on the quality of the wine.)

Matlab环境下用于数据挖掘的决策树算法源代码，CART算法(Matlab environment for data mining decision tree algorithm source code, CART algorithm)

自实现提示窗口,可以实现与XP风格的提示窗口类库,基于MFC,()

说明：  matlab创建路面谱，可用于Adams/car做随即路面不平度仿真分析(Creating Pavement Spectrum)

WTL工程项目，根据不同的控件更改鼠标的形状(According to the different control change the mouse shape-WTL)

说明：  RTD2313E RTD2550 RTD2556 RTD2556T RTD2556QR VGA+HDMI+DP转EDP显示器方案设计(Rtd2313e rtd2550 rtd2556 rtd2556t rtd2556qr VGA + HDMI + DP to EDP display scheme design)

实现自绘按钮  必须用位图资源的方式设置各个状态的按钮图像

K-均值聚类算法的编程实现。包括逐点聚类和批处理聚类。K－均值聚类的的时间复杂度是n*k*m，其中n为样本数，k为类别数，m为样本维数。这个时间复杂度是相当客观的。因为如果用每秒10亿次的计算机对50个样本采用穷举法分两类，寻找最优，列举一遍约66.7天，分成3类，则要约3500万年。针对算法局部最优的缺点，本人正在编制模拟退火程序进行改进。希望及早奉给大家，倾听高手教诲。(K-means clustering algorithm programming. Point by point, including clustering and clustering batch. K-means clustering of the time complexity of n* k* m, n samples, several types of k, m sample dimension. The time complexity is a very objective. Because if we use one billion times per second the computer using 50 samples of two exhaustive method to find the optimal set out again about 66.7 days, divided into three categories, offering 3,500 years. Local optimal algorithm against the shortcomings, I was prepared simulated annealing process improvements. Early Feng hope for everyone, listen to the master teachings.)

这是一款具有登入和注册的贪吃蛇，而且有特效果实，增加了游戏的趣味性(This is a login and registration Snake)