Accelerated C++

泛洪协议的场景测试协议 选择一个包含50个节点的1200*1200正方形区域的场景，每个节点随机选择自己的运动方向和运动速度，最大运动速度为40m/s，平均速度为20m/s，场景持续400s。-Flooding protocol testing protocol scenes select a node that contains 50 of the 1200* 1200 square regional scenes, each node randomly choose its own direction and velocity of movement, the biggest sports at 40m/s, average speed of 20m/s , the scene continued to 400s.

该程序首先将车间生产零件按照优先级别、刀具组别、夹具组别等进行分类，进而对不同数控机床的多种零件进行加工计算，合理安排加工调度计划，同时考虑操作工系数、设备负荷等。

可以查到自己的ip,能控制关机和开机，得到计算机的属性等-Can be found in your own ip, can control the shutdown and startup, get the computer" s properties, etc.

串行接受AD转换数值并显示成图象-Serial Numerical AD converter to accept and display the images

爱视网影视收费系统-love as network television system

用基于变治法的堆排序算法对任意一组给定的数据进行排序 设计与实现堆排序算法； 2）待排序的数据可以手工输入(通常规模比较小，10个数据左右），用以检测程序的正确性；也可以计算机随机生成（通常规模比较大，1500－3000个数据左右），用以检验(用计数法)堆排序算法的时间效率。-Variable-based treatment of the heap sorting algorithm to a set of arbitrary data set to sort the design and implementation of heap sort algorithm 2) to be sort of data can be entered manually (usually relatively small size of about 10 Data), to detect the correctness of the procedure also can be randomly generated computer (usually relatively large-scale data ,1500-3000 or so), to test (with counting) time sorting algorithm reactor efficiency.

IndiFTPD is a standalone (single executable) FTP server designed for situations when a user wants to quickly start up a server without going through an installation. -IndiFTPD is a standalone (single executable) FTP server designed for situations when a user wants to quickly start up a server without going through an installation.

访问量突破160万的程序员网络励志故事，开博五个月为CSDN十大明星博客，程序员版的《奋斗》。 　　这本小说并没有太多技术方面的内容，讲述的是作者本人作为一名程序员，从学习编程开始，到第一份工作250元工资，再到后来自主创业的成长经历，也许有些内容在你身上都会找到影子。 -1.6 million visits a breakthrough network programmers stories, the Bo Ten CSDN five stars for the blog, programmer of the " struggle." This novel technology is not too much content, the author described himself as a programmer learning programming from the beginning to the first 250 per wage work, and then later experienced the growth of their own businesses, perhaps some of the content who will find in your shadow.

一凸8 边形P 的顶点顺时针为{v1，v2，… ，v8}，任意两顶点间的线段的权重由矩阵D 给出。 若vi 与vj 是P 上不相邻的两个顶点，则线段vivj 称为P 的一条弦。求P 的一个弦的集合T， 使得T 中所有的弦恰好将P 分割成互不重迭的三角形，且各三角形的权重之和为最小（一 个三角形的权重是其各边的权重之和）。-A convex 8-gon P, vertex clockwise of (v1, v2, ..., v8), any two vertices of the segment between the weight given by the matrix D. If vi and vj is the P is not adjacent to two vertices, then the line segment vivj known as P, a string. Seeking P, a set of strings T, makes the T all the strings just to P divided into non-overlapping triangles, and the weight of each triangle and for the minimum (the weight of a triangle is its weight of each side and) .

获取系统信息 运行System.exe后，在弹出的窗体中，单击不同按钮完成不同功能。-After geting system infomation and running System.exe,you can finish different functions by click different buttons in pop-up form.