电力高职排调课系统的模型研究
详细信息    本馆镜像全文|  推荐本文 |  |   获取CNKI官网全文
摘要
随着高等职业技术教育的快速发展,高职教学管理排调课工作方式发生了巨大转变。依托校园计算机网络,构建和完善教务排调课系统是高职院校教学管理改革、创新不可缺少的一项重要工程。
     论文针对高等职业教育的办学特色,说明改进高职教务管理系统的必要性,探讨高职教务排调课系统的发展思路。依据重庆电力高等专科学校具体教务管理模式,结合其教学管理的现状,采用面向对象的系统开发方法进行电力高职排调课系统的模型研究。旨在丰富高职排调课系统系统分析方法和数据模型,并借助先进的计算机及相关理论为教务排调课工作提供强有力的技术支持。
     论文首先分析排调课系统的电力高职特色,提出教务排调课系统功能架构,构建重庆电专排调课系统逻辑模型,完成系统总体的三层体系架构设计。然后以课表编排子系统为例,从需求分析、数据库设计和算法设计与实现等方面阐述了系统的实现,使排调课结果满足电力高职院校目前的教学需求,在提高教学运行管理工作效率和教学质量、合理配置教学资源方面发挥了系统特有的作用。
     论文主要阐述了以下几点:
     1、为适应电力高职教育的特殊需求,完善电力高职排调课系统逻辑模型。
     配合学校创新人才培养模式的改革,针对“订单式”的人才培养模式实施的“订单式”课程和校内专业实习,系统新增了课程预排、辅助排课和实践教学管理的功能,方便了不同时间段对课程的处理,解决了“订单式”培养方案在教学运行管理中的特殊需求;为保障教学资源的合理、有效配置,新增课表分析功能,科学分析课表编排质量,完善电力高职排调课系统逻辑模型。
     2、构建基于B/S模式和C/S模式相结合的三层体系架构。
     将B/S模式和C/S模式相结合的三层体系架构,通过中间件技术有效地解决了异构环境下的数据联系,实现了教学管理各部门间的信息共享、集中管理和分散操作,提高了排调课系统的稳定性和实效性。
     3、利用数据挖掘分类分析决策树算法,建立电力高职排调课系统数学模型。
     基于分类分析决策树算法,建立了一个挖掘体系。针对课表编排模块,分析影响高职学生学习效果的因素,为排课过程中完善排课约束条件、优化排课策略提供决策分析思路,构建资源合理匹配、教学效果最优排调课系统数学模型。
With the rapid development of Higher Vocational Education, the working style of higher vocational college teaching manage in course scheduling will carry out the change. Depend on the campus computer networks, it is absolutely necessarily to build a perfect educational administration system for course scheduling by the reformation of the college educational administration.
     To counter the higher vocational education with features, the thesis expound the necessity of improvement the system for the higher vocational teaching manage , study the development way of thinking of course scheduling system for higher vocational educational administration. According to the educational administration pattern and the situation of educational administration in a college, study on model of the course scheduling system for the vocational college’s educational administration by the ways of system development to face to the object. The aim lines up to enrich the system analysis method and the data models, provide the powerful support for the educational administration course scheduling work rely on the advanced calculator and related theories.
     This thesis firstly analyses the features of the course scheduling system for higher vocational college and founds the logic model of the system, and then functions of educational administration systems for the course scheduling and sets up the 3-tire structure of the whole system systemically.
     And then taking course scheduling sub-system as example, the needs analysis of the sub-system, the database design, algorithm and the development of the sub-system is introduced dentally, and provides a perfect course scheduling system for educational administration in a higher vocational college to scientific manage. The following is the main feature of this system:
     1、the system function is easy to expand and safeguard base on the special need of higher vocational education for electric power .
     Take vigorous action to cooperate the reform of the college training mode about creative personnel, aiming at the talented person trained mode for "the order type" enforce the course of " the order type" and the practices of the working on regular shifts, lately developed course scheduling beforehand, auxiliary course scheduling and practical teaching management, for convenience to course of processing during the period of difference, solved special needs of the trained plan for "the order type" in teaching circulate manage;In order to guarantee the teaching resources reasonable and install effectively, added the course analysis function, analyzed the quantity of the course scheduling scientifically, provided the management terrace of the forerunner in order to monitor the teaching of the college movement.
     2、The 3-Tire Structure of The Whole System Systemically Based on B/S and C/S
     The 3-Tire structure of the whole system systemically based on B/S and C/S, solved validly the data contact under the different structure through the middle of components for the techniques, carried out the teaching to manage the information share between each sectors, centralized management and the dispersion operations, raise the stability and efficiency of the system for course scheduling.
     3、Data Mining for Educational Administration System for Course Scheduling
     An intelligent mining system is created based on the decision tree algorithm. For course scheduling sub-system, the factor that affects the studying of higher vocational students is analyzed,which provide useful guide for decision-making in perfecting the principle and the strategy for course scheduling. Made up the course schedule without conflict for the resources reasonable to match, the study result is superior.
引文
[1] C.C.Gotlieb."The construction of class-teacher time-table" Proc IFIP Congr 62, 73-77,1963
    [2] S.Even. Ital AShamirA "On the complexity of timetable and multi-commodity flow problems".《SIAM J.Computing.》5.691-703.1976
    [3] U. Hman J.D."NP-complete scheduling problems".《J.comput.SystemSci.》10.384-393 .1975
    [4] S.Even. Y.Shiloach. NP-Completeness of Several Arrangement Problems,Report No.43, Dept. of Computer Science, Technion, Haifa, Israel, 1975
    [5] Tim B. Cooper, Jeffrey H. Kingston. The Complexity of Timetable Construction Problems. Proc. ICPTAT'95, Pp:183-295,1995
    [6] Fogel L. J. Artificial Intelligence through Simulated Evolution.I966,John Wiley and Sons Press Ltd.
    [7] Ibrahim. H. Osman. Heuristics for the Generalised Assignment Problem: Simulated Annealing and Tabu Search Approaches. OR Specktrum,1999,Vo1.17, No. 1, PP.211-255
    [8] Kirk Patrick S. Optimization by Simulated Annealing: Quantitative Studies. J Statis Phy, 1999, Vol. 34, No. 2, PP. 975-986
    [9] Jin-Kao Hao."Tabu Search for Frequency Assignment in Mobile Radio Networks".《Journal of Heuristics》.1998.04
    [10] Jin-Kao Hao. "Hybrid Evolutionary Algorithms for Graph coloring".《Journal of. Combinatorial Optimization》3,379-397.1999
    [11] Michel Vasquez."Upper Bounds for the SPOT S Daily Photograph Scheduling Problem".《Journal of Combinatorial Optimization》.2000.01
    [12] Hirsch M W.Convergent activation daynamics in continuous time networks. Neural Networks, 1989(2): 331-349
    [13] Yip P Yoh-han Pao. Combinatorial Optimization with Use of Guided Evolutionary Simulated Annealing. Neural Networks, 1995, Vol. 6, No. 2, PP. 290-295
    [14] Schmidt G,Strohlein T.Timetable Construction-An Annotated Bibliography. The Computer Journal, 1980, Vol. 23, No. 4, PP. 307-391
    [15] Bondy J. A. Graph Theory with Application. 1976, The Macmilan Press Ltd.
    [16] 清华大学计算机与信息管理中心,清华大学综合教务系统
    [17] 宣华,王映雪,陈怀楚. 清华大学综合教务系统在教务管理中的应用[J]计算机工程与应用,2002.(12)
    [18] 青果软件. KINGOSOFT 高校教务网络管理系统
    [19] 陶滔.多维冲突在排课算法中的应用[J] 《华东地质学院学报》2001,24(3).-256-259
    [20] 张健.基于图论的高校排课系统实现[J] 《重庆师范大学学报》2005,22(1).-35-38
    [21] 王健.自动排课系统的模型与实现[J] 《贵州大学学报》2004,21(2).-194-199
    [22] 杨威,喻国平. 基于 UML 的自动排课系统的需求分析[J] 《科技广场》2005.2
    [23] 高友智. 基于进化计算的智能排课系统开发[D],武汉科技大学硕士论文,不详
    [24] 高逦. 基于决策辅助支持与 J2EE 模式的综合教务管理系统的设计与实现[D],西北工业大学硕士论文,2005
    [25] 教育部编. 高等学校教学管理研究与实践[M].中国对外翻译出版公司,1999. 10
    [26] 赵国栋.信息时代的大学:美国高等教育信息化发展及其启示[J]《.现代教育技术》2003 (5)
    [27] 教育部编. 教育管理信息化标准[M].人民邮电出版社,2002. 12
    [28] 陈承欢,彭勇. 管理信息系统基础与开发技术[M]人民邮电出版社,2005 年
    [29] George M.Marakas.数据仓库、挖掘与可视化一核心概念[M].清华大学出版社,2004. 10
    [30] David Marco.元数据仓储的构建与管理[M].机械工业出版社,2004. 5
    [31] Jiawei Han.Micheline Kamber 著,范明,孟小峰译,数据挖掘概念与技术[M].机械工业出版社,2004. 2
    [32] 高洪深. 决策支持系统(DSS)理论、方法、案例[M].清华大学出版社,2000. 9
    [33] 张研. 基于 B/S 和 C/S 的多层网络环境下的综合教务管理系统设计[J]《五邑大学学报》2004,18 (1):41-45.
    [34] 彭财辉,程景云. 基于 UML 的工作流引擎建模的研究[J]《计算机辅助工程》2004 (9)
    [35] 教育部高等教育司编. 高职高专院校人才培养工作评估资料汇编[M].人民邮电出版社
    [36] 重庆电专高职高专人才培养方案改革课题组资料,2004 年
    [37] 教育部高等教育司编. 高职专业设置与课程开发导引[M].高等教育出版社,2004. 7
    [38] 教育部高等教育司编. 高职教育产学研结合操作指南[M].高等教育出版社,2004. 7
    [39] 高喜玛,张萍. 大学自动排课系统内核算法设计[J]. 南阳师范学院学报,2003,(12)
    [40] 陈谊.基于优先级自动排课算法PCSA的设计与实现方案[J].北京工商大学学报,2001,(12)
    [41] 郑晓芳,郭云,骆名群. 排课管理系统的设计[J] . 华东交通大学学报,2003,(2)
    [42] 钟嘉鸣. 智能排课系统及多约束条件下的资源分配模型[J]《教育信息》2002(4).-56-58

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700