some procedures you have to see if I find a very long time the

This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster centers using the K-means algorithm. Output is directed to the screen.-This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster centers using the K-means algorithm. Output is directed to the screen.

一个实现柏森汉姆直线算法的小程序，不是自己编的，不过还能用-柏森汉姆a straight-line algorithm to achieve a small process, rather than own, but also with

获得本机ip地址，网络编程-to this machine ip address, Network Programming

演示直接强制关闭其他程序，类似于在任务管理器中关闭，例程是运行即关闭“spider.exe”然后退出，可根据需要修改。-Forced the closure of the direct demonstration of other procedures, similar to the Task Manager to close, that shut down routine is to run

comets : it is an powerpiont presentation describing about comets

应用背景此程序是简单网关的设计，可用于初学iocp的人员研究iocp用，逻辑比较简单，功能也较单一，文中函数都有详细注释，能够令新学者快速上手关键技术基于windows操作系统的网关源码，基于iocp架构，稳重从iocp的生成，到套接字和iocp的绑定，以及异步处理消息的投递，还有就是对于异步消息处理完毕之后的逻辑处理都有很详细的代码

详细阐述了线性矩阵不等式的方法，并用一个实际例子，用matlab实现了,对初学者非常有用.-Described in detail the method of linear matrix inequalities, and a practical example, using matlab realized, very useful for beginners.

用于S3C2410的480X640点阵LCD的winCE驱动（已测试）

Description: 对整型有序关键码序列进行折半查找，待排序序列以数组存储。如果找到待查记录，返回找到的位置下标，并删除该关键码记录；如果没找到待查记录，返回0，并将待查记录插入到适当位置，即该查找属于动态查找。输出查找过程中每一轮的low，mid，high 值，以及与给定值相比较的关键码值，并输出最后找到的位置，及变化后的数组。 注意：该数组为整型，数组中关键码存储位置为r[1]~r[n]，r[0]留作它用，且关键码个数大于4. Input Format: 第一行输入数组中记录个数n 第二行输入n个有序的整型关键码，以空格隔开 接下来输入三个待查关键码，每个关键码占一行 Output format: 对于每个关键码，分别输出： 找到给定值之前的每一轮的low，mid，high及相比较的待查找序列中的关键码，以空格隔开 接下来一行输出查找到的位置 接下来一行输出变化后的待查找序列 -Description: The key codes for integers ordered sequence of binary search until the sorting sequence to an array of storage. If you find a complete set of records, returns to find the location of the next standard, and delete the key code is recorded if not find a complete set of records, returns 0, and a complete set of records inserted into the appropriate location, that is, the search was part of search. Find out the process for each one of the low, mid, high value, as well as compared to the value given the key code value and output of the last to find the locat

医学影像文件DICOM格式转BMP格式源代码-DICOM medical imaging document format to BMP format source code