本程序实现了聚类分析的功能，文件中附带了一农业生态经济系统各区域单元的有关数据，保存data文件中，并利用该程序对该数据进行了实验与分析，结果数据也包含在res...

Source code for Basilsik

实现波形曲线图的显示，制作为控件，可直接引用。

这是一个用VC写的鼠标钩子函数的实例。能监测键盘和鼠标。-This is a VC write mouse hook function examples. Monitor keyboard and mouse.

MFC背单词程序-MFC word back procedures

试验内容： 跳水比赛中运动员每完成一个跳水动作，都有J名裁判员为其打分，但每次总成绩中都要去掉一个最高分和一个最低分。每个运动员需要完成C个动作，每次动作结束都要按当前总成绩为全部运动员重新排序，结果在运动员出场比赛时显示出来。设总共有N个运动员参加比赛，其编号为1，2，… N。 编一个程序实现这一功能。 要求： 1、 建立一个*head为头结点的单链表 2、 以动作C为主循环，对每个动作输入每个运动员所有裁判打分。输入每个 运动员的所有打分后，立即对单链表按sum域(累计分)从小到大重新排序 3、 在每个动作之后，输出该单链表的所有结点-Note: Experimentation: When sportsman who taking part in diving game had finished each movement,there were J referees marking for sportsman,and each time the highest and lowest marks always were taken out. Each sportsman must finish C movements,no sooner did actions had be performed than current sum grades should be sorted and the final results should be displayed before athlete comes out. Supposing there are N athletes attending the game,the NO is 1,2,...N.Write an program to implement this fuction. Requires: 1 Create a single chain naming the name of headnode*head. 2 The movement C is main loop,Each sportsman s grades marked by all judges should be put in the each movement.After finished this,the

涉及vc(win32)编程的各个方面。 达内权哥讲课内容-Involved in vc (win32) in all aspects of programming. Costa Rica up to the right to lecture the content within

wince下用evc写的一个操做注册标的程序-using AES Nicholson wrote a subject took the registration procedures

语义web服务测试集，要注册在apache下，才能调用服务-Semantic web services test set, it is necessary to register in the apache can be called Service

生成多个ICO图形-generate multiple graphics ICO

参考文章 遗传算法是基于达尔文进化论的一种智能优化算法,一种可用于复杂系统优化的具有鲁棒性的搜索算法，适用于解决传统方法难以解决的复杂的、非线性问题，可广泛应用于组合优化、离散优化、工程优化等领域。旅行商问题是一种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.