这个时用vb 基于evb开发的pda和pc通信的小型系统

用户输入十个数据，能够计算他们的平均值，方差，均方根-10 user input data, to calculate their average, variance, root-mean-square

中国电信epon产品测试方案,2007年版-China Telecom epon Test Solutions

vb 编写的连杆机构 精确 计算及演示动画-vb prepared by the linkage and accurate calculation Animation

这是一个简单的停车场管理程序，实现了车辆入库、出库、登记、计费等功能。用C编写的-This is a simple car park management procedures, to achieve a vehicle storage, a library, registration, billing and other functions. Prepared with C

使用uilib库制作的浏览器，使用VS2012工程，界面简洁，可输入地址，回到主页，可隐藏界面，系统托盘显示，包含资源文件uilib使用VS2012编译通过，包含头文件，Debug库和dll文件，工程已配置好，直接编译即可

vc编程一百例。包括界面 ，按钮，控件，对话框，多媒体等等各方面的实例100个。-vc Programming 100 cases. Including interface, buttons, controls, dialog boxes, multimedia, etc. Examples of the 100.

vc写的智能滚动条代码，有一定的参考价值，有一定的参考价值-vc write smart scroll code, a certain reference value, a certain reference value

K r u s k a l算法每次选择n- 1条边，所使用的贪婪准则是：从剩下的 边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。注意到所选 取的边若产生环路则不可能形成一棵生成树。K r u s k a l算法分e 步，其中e 是网络中 边的数目。按耗费递增的顺序来考虑这e 条边，每次考虑一条边。当考虑某条边时，若将其 加入到已选边的集合中会出现环路，则将其抛弃，否则，将它选入。-K ruskal algorithm for each choice of n-1 edges, the greed of the criteria used are: from the left edge select does not produce a loop with the smallest cost edge has been selected to join the edge of the collection. Taking note of the selected edges have a loop if it can not form a spanning tree. K ruskal algorithm sub-e-step, in which e is the number of network edge. According to the order of incremental cost to consider this e edges, each taking a side. When considering a certain edge when, if its added to a collection of selected edge loop will appear, will be its discarded, otherwise, it selected.

OCR,C#实现用于验证码解析。GOOGLE维护的OCR项目Tessetact OCR软件是惠普公司在1985--1995年间开发的，它曾在拉斯维加斯大学组织的OCR软件竞赛中获前三名最佳软件排名。

aam模型，又称主动表现模型，即active appearence model。是研究人脸识别，表情识别，3D人脸建模等不可多得的好材料。-aam model, also known as the active performance of models, namely, active appearence model. Is to study the face recognition, face recognition, 3D face modeling and other rare good material.