three_all

学习C++的好手 适合当代本科大学生提高编程水平-Learning C++ The best suited to contemporary programming improve the level of undergraduate college students

机械优化设计进退法的程序，已经测试，绝对好用。(Mechanical advance and retreat method optimization procedure has been tested, absolutely easy to use.)

外汇智能交易系统----智能EA 自动交易，自动下单，自动平仓(Forex Expert Advisors---- Smart EA automated trading, automated order entry, automatic open)

h1940 machine audio map.

XML文件编辑器 可以为初学者提供研究参考(It is a XML editor and might be helpful to beginners.)

cab文件压缩、解压 (Compression and UnCompresson of Cab file)

operation and sizing of energy storage for wind energy plants

说明：  本文先介绍了个人防火墙开发的研究现状、VC++6.0和MFC程序的一些技术特点，然后对基于包过滤个人防火墙的开发进行了详细的介绍和描述。通过本文可以清楚地看到一个普通个人防火墙的开发过程。本防火墙中，用户可以自行设定过滤规则，以达到对不同源和不同目标的IP地址、端口和协议的过滤。允许用户将当前规则保存为*.rul的文件格式，供下次使用时直接导入。 本防火墙由以下几个模块组成：过滤规则添加模块，过滤规则显示模块，过滤规则存储模块，文件储存模块，安装卸载规则模块，IP封包过滤驱动功能模块。用户只需要通过主界面菜单和按钮就可以灵活地操作防火墙，有效地保护Windows系统的安全。(This article first introduced the personal firewall development research present situation, VC++6.0 and MFC procedure some technical characteristics, then based on the packet filter personal firewall development carried on the detailed introduction and description.Through this article you can clearly see a common personal firewall development process.In this firewall, users can set their own filtering rules to achieve the filtering of IP addresses, ports and protocols for different sources and different targets.Allows the user to save the current rule as a *.rul file format for import next time. This firewall consists of the following modules: filter rules add module, filter rules display module, filter rules storage module, file storage module, installation and unloading rules module, IP packet filter driver function module.Users only need to through the main interface menu and buttons can be flexible operation of the firewall, effectively protect the security of the Windows system.)

晨曦讨论群组服务器,包括服务端和客户端- Dawn discussion group group server, including service end and customer end

有不同重量的物品n件，求从这n件物品中任取一部分物品放入背包，使选中的物品的总重量不超过指定的限制重量，但选中物品的价值之合为最大。即任意给定物品个数及它们的重量和价值，在最大的限制重量一定的情况下，为了使价值最大，选出最优解。(There are different weights of items n pieces from n items in order to obtain any portion of the goods into the backpack, so that the total weight of the selected items does not exceed the specified weight limit, but the combined value of selected items as the greatest. That any given number of items and their weight and value limits the maximum weight of certain circumstances, in order to value the most, select the optimal solution.)