发现发现

写一个程序来计算

kNN实现步骤 (1)计算已知类别数据集中的点与当前点之间的距离 (2)按照距离递增次序排序 (3)选取当前与当前距离最小的k个点 (4)确定k个点所在类别的出现的频率 (5)返回前k个点出现频率最高的类别作为当前点的预测分类

编程技巧（多媒体与系统篇）-programming skills (multimedia system with Part 1)

用Delphi编写的对任务栏进行编辑的小程序3-prepared by the task of editing the column for three small programs

这就是可以自动更改墙纸的VB源代码 我试了 感觉还不错 -This is the wallpaper can automatically change the VB source code I tried was also feeling good

这是一个用winsock实现聊天的程序-This is a realization of chatting with winsock procedures

Basic MP3 player. a basic mp3 player in Visual Basic 6

一个自写的小程序，通过两种不同的方式求一种背包问题的解法-A self-written a small program in two different ways to seek the solution of a knapsack problem

这个程序用labview模拟温度信号并且显示出来，程序简洁高效-This procedure using LabVIEW and analog temperature signal is displayed, the program simple and efficient

Delaunay三角网作为一种主要的DTM表尔法，具有权其广泛的用途。经过二十多年来的研究，它的生成算法巳趋于成熟。本文简要介绍了Delaunay三角网的定又及其特性，在简单回顾和评价了分割―归并法，逐点插入法，三角冈生长法等三类主沈算法的基础上，提出了一个融以上算法优点于一体，兼顾空间与时间性能的合成算法。经测试，一般情况下它的运算速度远快于逐点插入法，与分割―归并法相当，较好的情况下快于分割―归并法。-Delaunay Triangulation as a major DTM Fall table, with the right to its extensive use. After 20 years of study, which had been generating algorithm is maturing. This paper introduces a Delaunay Triangulation and another set of characteristics, in a brief review and evaluation of the divide-conquer method, point by point insertion method, the supraspinatus Growth Triangle law Shen three main algorithm on the basis of the above algorithm into an advantage in that balanced space and time performance of synthesis algorithm. After tests, under normal circumstances it"s computational speed much faster than the insertion point by point, and the divide-conquer method rather, a better situation faster than divide-conquer method.