遗传算法工具箱,可以直接调用该工具箱对各种神经网络进行优化处理，方便快捷...

写入文本可以保存在本地硬盘上，再可以从刚保存的文件中打开文件-into the text could be stored in the local hard disk and then just keep it from the paper open files

UCOS一种只支持优先级抢占型调度的操作系统。它不支持同一个优先级有2个及以上的任务同时运作。 本文修改的UCOS支持不同优先级调度的同时，支持同一个优先级有2个以上的任务以时间片轮转方式进行调度。 这个就是UCOS和修改的UCOS的区别。-UCOS only support a priority-based scheduling of the operating system to seize. It does not support the same priority level 2 and above have the task of operating at the same time. This article uCOS modified to support different priority scheduling at the same time, support the same priority level has two more tasks to the time slice approach to scheduling rotation. This is uCOS uCOS and modified difference.

Python cookbook，学习Python的好资料-Python cookbook, learn Python a good information ~ ~

java数据库驱动 对于数据库连接有作用-java

将USB端口设备虚拟为网卡设备的软件，还可以-The USB port equipment for the virtual network adapter software, you can

芯片pl-2303的USB转232的驱动安装程序。-chip pl-2303 to 232 USB driver installation procedures.

这是我的第一个小学期程序设计的程序，个人通信录，是在VC++环境下开发的，虽然比较简单，但是体现了VC的实用性和可视性。-This is my first one primary phase of the program design process, personal communication, for the VC environment is under development, Although it is quite simple, but reflects the VC practicality and visibility.

很好的双像后方交会，解压后是一个文本文档，内有代码-Well as resection of the double, after extracting a text document with a code

DirectX开发人员使用,3DMax导出X文件插件,解压后考入插件目录-development of the use of DirectX, MAX plug-derived X documents, unpacked admitted plugin directory

单循环赛中选手胜负序列求解问题 名称：单循环赛中选手胜负序列求解问题 内容：有n个选手 P 1 ,P 2 ,P 3 ,… ,P n 参加了的单循环赛，每对选手之间非胜即负。现要求求出一个选手序列 P 1 ,P 2 ,P 3 ,… ,P n , 使其满足 P i 胜 P i+ 1 (i=1,… ,n-1) 。 -Single round robin tournament players winning sequence to solve the problem name: the outcome of single round-robin tournament players to solve the problem sequence elements: There are n-player P 1, P 2, P 3, ..., P n participated in a single round-robin between each pair of players Non-win or negative. Players are now required to find a sequence of P 1 " , P 2" , P 3 " , ..., P n" , to meet the P i " W P i+ 1" (i = 1, ..., n-1).