基于改进KM算法的毕业论文选题系统 毕业论文1.docVIP

高职毕业设计 题目 基于改进KM算法的毕业论文选题系统 学 院: 管理学院 专 业: 计算机信息管理 学 号: 200812387127 学生姓名: 陈智慧 指导教师: 张瑞军 日 期: 2009-6-10  摘要  Abstract Although by using of the Internet to Choose Topics of Undergraduates Theses can, to some extent, reduce the workload of people and improve the efficiency of Choosing result, but how to deal with student-subject matching problem, in order to make all the students are satisfied with the Distribution, become the key problem of the paper. Usually, we consider this problem as a bipartite graph matching problem, so we can use the Hungarian algorithm or KM algorithm to derive the maximum or optimal overall match. In fact, the traditional algorithms did not take each teacher can only with a limit number of student into account, so the traditional algorithms can not be directly used to solve the practical problem. In this paper, I will by modifying the traditional algorithms to meet the conditions given in the practical problem and improve the satisfaction of all the students. This paper gives the solution by following the technology way of analysing and describing the problem, referring to the available literature, analysing and designing the system and analysing the core algorithms. The most important characteristic of this article is both on technology and theory. Chapter 3 mainly introduces the designing of information system, and chapter 4 introduces a variety of technologies used in the implementation of the system in detail, which are widely used in development of enterprise. Chapter 2 and 4 are related to matching-algorithms. By the analysis of student-topic matching-problem in-depth, I abstract this problem into bipartite graph’s Maximum Matching and max-weight matching problem. Then mainly analyze the limitations of traditional topics’ distribution algorithms, and by modifying the traditional algorithms we get a kind of satisfactory solution. Key words: Choosing Topics of Undergraduates Theses; Struts 2.0; CSS+DIV; Bipartit