VB UART write, VS2008, add the control can work

Base64编码与ASCII编码转换-base 64 and ascii encoding converting

在Windows窗口上滚动字幕-window on the Windows subtitles rolling

When starting with protocols that work at the upper layers of the network models, each set of data is wrapped inside the next lower layer protocol, similar to wrapping letters inside an envelope. The application creates the data, then the transport layer wraps that data inside its format, then the network layer wraps the data, and finally the link (Ethernet) layer encapsulates the data and transmits it. Each network layer either encapsulates the data stream with additional information, or manages data handling or come part of the connection

c语言课程设计，贪吃蛇游戏， -c language curriculum design, Snake game, c language curriculum design, Snake game,

Atheros USB WiFi Card 驱动程序-Atheros USB WiFi Card Driver

Bezier曲线的可执行程序，注：vc语言编写的；3次4个顶点-Bezier curves of the executable program, note: vc languages 3 4 vertex

能获得操作系统的版本号-access to the operating system version

对注册表的操作，对ini文件的操作，从对话框内读取文件内容的操作-The operation of the registry, ini file for the operation, from the dialog box to read the contents of the documents within the operation of

1算法思路  K-means算法  先随机选取K个对象作为初始的聚类中心。然后计算每个对象与各个种子聚类中心之间的距离，把每个对象分配给距离它最近的聚类中心。聚类中心以及分配给它们的对象就代表一个聚类。一旦全部对象都被分配了，每个聚类的聚类中心会根据聚类中现有的对象被重新计算。这个过程将不断重复直到满足某个终止条件。终止条件可以是以下任何一个：  1)没有（或最小数目）对象被重新分配给不同的聚类。  2)没有（或最小数目）聚类中心再发生变化。  3)误差平方和局部最小。  2算法步骤 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

该程序实现对一维数据轴上的最临近点的求解问题 采用方法：传统方法2:先排序，然后一次线性扫描，得到最近距离，时间复杂性O（nlogn）-the process of achieving a dimensional data axis near the point of the methodology used to solve the problem : The traditional two methods : first order, and then a linear scan, recently received distance, time complexity of O (nlogn)