two files of Chinese characters use in DOS system

粒子群优化(Particle Swarm Optimization - PSO) 算法是一种新兴的有潜力的进化算法( Evolutionary Algorithm - EA) .PSO 算法,和遗传算法相似,它也是从随机解出发,通过迭代寻找最优解,它也是通过适应度来评价解的品质. 但是它比遗传算法规则更为简单,它没有遗传算法的“交叉”(Crossover) 和“变异”(Mutation) 操作. 它通过追随当前搜索到的最优值来寻找全局最优。-pso

c语言做的课程设计，通过实现二叉树来对书籍进行操作-c language to the curriculum design, through the realization of a binary tree to operate on the books

这是一个采用JAVA做的聊天系统，没有用数据库，直接进行聊天-This is a use of JAVA to do the chat system, did not use the database directly to chat

一个监控别人计算机的程序-a computer monitor procedures

本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序，使得所有的点是按x坐标从小到大排好序的（x坐标相同时y坐标小的排前），然后取下标小于n/2属于左边的点集PL，取下标大于n/2属于右边的点集PR，即用O(1)时间就可以将规模为n的问题分解为两个规模为n/2的、同类型的子问题。分割完毕之后就可以采用分治法，分别求出PL和PR中的最近点对，最终通过递归实现。-This algorithm uses divide and conquer to solve the problem closest point. Prior to use O (nlogn) time to sort the x coordinate so that all points are based on x coordinates from small to large sorted (x coordinates with the same y coordinates of the small, the top), and then remove the standard is less than n/2 the set of points belonging to the left PL, remove the standard is greater than n/2 set of points belonging to the right of PR, that is to use O (1) time can be the problem size n divided into two size n/2, the same type The sub-problems. Segmentation can be used after completion of sub-rule method, respectively, find the PL and PR in the last points and eventually through the recursion.

/*本人先后编了两次，第二次进行了改进。改进的思想主要是注意到棋盘上每一点的下一可到达点的个数 （下称为权值）不同，对于可到达点较少（权值小）的点应该先跳上去，这样后来跳的点可跳的方向就比 较多，回溯的现象就比较少，这样就可以大幅度提高速度*/-/* I have compiled twice, the second time for improvements. Improved thinking is that every point on the chessboard of the next point can be reached by the number (hereinafter referred to as the right value), For less accessible spots (small weights) should be the first point and jumped out of the way and then jump to the point of jumping on the direction of more, Looking back on the phenomenon of relatively small, we can significantly improve the speed* /

按照数据结构书编的程序,编译出来完事的,能运行的"逆置带头结点的动态单链表L"-book series of the process, get away from the compiler can run the "reverse home lead the dynamic node L-List"

易语言 access应用，源码为易语言源码-Yi language access applications, source code for easy language source code

通讯协议，视频、会议电视采用的主流通讯协议，目前在NGN中广泛应用-communications protocols, video, television meeting the mainstream communications protocols, in the widespread application of NGN

中国114网搜索系统 版　　本： 文件大小：580 KB 软件语言：简体中文 授权方式：免费版 相关链接：程序演示 开 发 商： 运行环境：ASP源码-Chinese search system 114 network version : File Size : 580 KB software languages : English license : free version Related Links : The process demonstrated developers : Operating environment : ASP source