读文件STL。帮助进口固体进入程序

实现vc下不同进程之间的通讯：Copyrecv接收进程，Copysend发送进程-achieve vc different process of communication between : Copyrecv receiving process, this process Copysend

应用背景CChart is a powerful plotting tool for 2D data visulization in C++ interface, with interaction for mouse and keyboard. Please read the file "DocumentUserguide.chm" for detailed infomation. 关键技术This is fully redistrubution version, with many demonstration projects, including Win32API, MFC and WTL samples. If any problems, please contact author by email: baita00@yahoo.com.cn The author assumes no responsibility for the use or reliability of his software.

使用c++操作sql sever2000设计学生管理系统 本系统管理员用户名为：tsoft，密码为：111。配置ODBC运行本实例需要配置用户DSN，在ODBC数据源管理器中配置用户DSN连接指定的SQL Server数据库。 附加SQL Server 2000数据库（1）将database文件夹中的两个文件拷贝到SQL Server 2000安装路径下的Data文件夹中。（2）打开SQL Server 2000中的“企业管理器”，然后展开本地服务器，在“数据库”数据项上单击鼠标右键，在弹出的快捷菜单中选择“所有任务”/“附加数据库”菜单项。（3）将弹出“附加数据库”对话框，在该对话框中单击“”按钮，选择所要附加数据库的.mdf文件，单击“确定”按钮，即可完成数据库的附加操作。

WinCe CF2.0 MessageWin使用源代码C# C#开发WinCE自定义消息传递机制代码-WinCe CF2.0 MessageWin use source code C# C# Development WinCE custom code messaging mechanism

请认真阅读您的文件包然后写出其具体功能(至少要20个字)。尽量不要让站长把时间都花费在为您修正说明上。压缩包解压时不能有密码。系统会自动删除debug和release目录，所以请不要将文件放在这两个目录下

jsp的安装环境配置，适合初学者 CHM格式的 希望大家喜欢-The environment of the jsp installing and setup, CHM file format.

windows main class function 实例2-windows main class function Example 2

一个速度很快的语音聊天室程序，运行环境是asp+access，可用于开发自己的语音聊天室-A fast chat programe.It needs asp+access. It can be used to exploite chat room yourself.

程序源代码 遗传算法是基于达尔文进化论的一种智能优化算法,一种可用于复杂系统优化的具有鲁棒性的搜索算法，适用于解决传统方法难以解决的复杂的、非线性问题，可广泛应用于组合优化、离散优化、工程优化等领域。旅行商问题是一种NP难的组合优化问题，具有重要的理论研究价值和实际应用背景。然而，传统遗传算法中存在有不足，需要提出新的改进的遗传算法，并应用于旅行商问题的求解。-Genetic algorithm source code is based on Darwin" s theory of evolution of 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 used 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.