0.IE.hook

自己写的模拟监控CPU和内存的小程序，可以指定检查某个进程(Write analog monitor CPU and memory applet, you can specify a process check)

弯管机PLC程序，可以参考学习，结合自己使用的实际情况改设置就可使用。(The bending machine PLC program, you can refer to learning, combined with the actual situation of their use changed settings can be used.)

ELM的C语言版本，黄广斌教授的研究成果(The C version of ELM, which is proposed by Prof. Guangbin Huang.)

自然语言处理，曼宁，一本非常好的自然语言处理的学习书籍(Natural Language Processing)

基于MFC对话框的图片浏览器，可使用滚轮对图片进行缩放，使用鼠标对图片进行拖拽，能关联主要图片格式(MFC dialog-based image browser, you can use the scroll wheel to zoom the picture, use the mouse to drag and drop the picture，and it can be associated with the main image formats)

有关继承函数,初学者可以作为非常不错的例子，了解语法结构(inherit )

扩展卡尔曼滤波（EKF）仿真演示，以一个空中水平抛射出物体为例子，采用EKF对其进行目标跟踪。(Extended Kalman filter (EKF) simulation demo, to a level of air projectile objects as an example, EKF target tracking.)

Wiener filter with multiple parameters

假设要在足够多的会场里安排一批活动，并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。（这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点，不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数，相应于要找的最小会场数。） 对于给定的k 个待安排的活动，编程计算使用最少会场的时间表。 (Suppose you want to arrange a number of activities in the hall more than enough, and want to use as little as possible venue. Design an effective greedy algorithm arrangements. (This problem is actually well-known graph coloring problem. If each activity as a vertex map, with the side connected between incompatible activities. Makes coloring adjacent vertices with minimum number of different colors, corresponding to looking The minimum number of venue.) K to be arranged for a given activity, calculated using a minimum of venue programming schedule.)

matlab 最优化工具箱，解决非线性多目标问题的首选(matlab optimization-toolbox)