Hilbert

计算提取线路工程的纵断面，C#开发源代码(Calculate and extract vertical section of line project, C# develop source code.)

说明：  paper for tesla turbine construction

ntop官方文档及安装配置文件，其中ntop是基于sniffer的一种网络监控工具.-ntop official documentation and installation configuration files, ntop which is based on a network sniffers monitoring tools.

一个采用VC+DX8.0编程的2D游戏, 有一定的可玩性. 游戏主题: 屠宰场. 同时, 对于学习DX和VC也有一定的帮助 -using VC DX8.0 a 2D game programming, a certain degree of fun. The game theme : the slaughterhouse. Meanwhile, the study also DX and VC can help

这是我老师上课要我们编写的java小程序，希望能够获得几个积分，谢谢站长。-This is my teacher wants us to prepare the java applet, will want to have a few points I would like to thank head.

DDS in our camera design

统计Visual C++源代码数量的小工具-statistics Visual C source code for a small number of tools

这是关于七参数转换的代码，他的转换精度高，另外附有原始数据(Seven parameter transformation)

说明：  旅行商问题(TravelingSalesmanProblem，TSP)是一个经典的组合优化问题。经典的TSP可以描述为：一个商品推销员要去若干个城市推销商品，该推销员从一个城市出发，需要经过所有城市后，回到出发地。应如何选择行进路线，以使总的行程最短。从图论的角度来看，该问题实质是在一个带权完全无向图中，找一个权值最小的Hamilton回路。由于该问题的可行解是所有顶点的全排列，随着顶点数的增加，会产生组合爆炸，它是一个NP完全问题。(Traveling Salesman Problem (TSP) is a classic combinatorial optimization problem. The classic TSP can be described as: a merchandiser sells goods to several cities. The salesman starts from a city and needs to go through all the cities and return to the starting point. How to choose the route of travel so that the total journey is the shortest. From the point of view of graph theory, the essence of the problem is to find a Hamilton loop with the smallest weight in a completely undirected graph with weights. Since the feasible solution to this problem is the full permutation of all vertices, as the number of vertices increases, a combinatorial explosion occurs, which is an NP-complete problem.)

好用的w25q64驱动.用过你就知道了!(Nice w25q64 drive used you know!)