html template used for web design

模拟内存工作方式的算法-way memory simulation algorithm

算数表达式求值程序，这个是我自己编的，很好用，应该处理有限的字符，最后要以“＃”号结束符。-count expression evaluates procedures, this is my own series, useful, should address the limited character, Finally to "#" endings.

用C++实现的贪吃蛇游戏程序，对游戏的设计思路有比较详细的讲解。-no

Document for BACnetIP Virtual Link Layer

windows所有窗口检测程序，可以检测出所有进程的窗口和对应的进程名和路径-windows all window test procedures can be detected in all the processes window and the corresponding process name and path

存贮内存数据到文件里-The example of storing memory data to file

gis方面的源代码。一个下gis软件框架，提供大家学习， 1. APIByName.zip,3KB 2. 01UseAPI.rar,17KB 3. 03CWinThread.rar,11KB 4. 03CThreadLocal.rar,5KB 5. 05OutputDebugString.rar,10KB 6. 06CreateExample.rar,8KB 7. 04Win32AppDemo.rar,11KB -gis aspects of the source code. Gis software under a framework provided by U.S. study, 1. APIByName.zip, 3KB 2. 01UseAPI.rar, 17KB 3. 03CWinThread.rar, 11KB 4. 03CThreadLocal.rar, 5KB 5. 05OutputDebugString.rar, 10KB 6. 06CreateExample.rar , 8KB 7. 04Win32AppDemo.rar, 11KB

用C++编写的计数器CGI程序，功能强大，运行速度快速可靠，计数器也可以隐藏，该CGI程序运行于WinNT/Intel平台。-Counter written by VC++, high speed when runing.

25 闪烁的标题栏-25 flashing title bar

参考文章 遗传算法是基于达尔文进化论的一种智能优化算法,一种可用于复杂系统优化的具有鲁棒性的搜索算法，适用于解决传统方法难以解决的复杂的、非线性问题，可广泛应用于组合优化、离散优化、工程优化等领域。旅行商问题是一种NP难的组合优化问题，具有重要的理论研究价值和实际应用背景。然而，传统遗传算法中存在有不足，需要提出新的改进的遗传算法，并应用于旅行商问题的求解。-Genetic Algorithm article reference Darwin" s theory of evolution is based on an intelligent optimization algorithm, a complex system can be used to optimize the robustness of the search algorithm, the application of traditional methods to solve difficult and complex, nonlinear problems, can be widely applied in combinatorial optimization, discrete optimization, engineering, optimization and other fields. Traveling Salesman Problem is a NP hard combinatorial optimization problem, has important theoretical value and practical application of research background. However, the traditional genetic algorithm, there is less than the need to introduce new improved genetic algorithm, and applied for solving the traveling salesman problem.