摘要(英) |
The practice of course election is a routine affair in college. Academic administrative personnel must complete course election data processing based on regulations and course election fairness in the schedule of school. But the academic administrative personnel always suffer from great pressure of ensuring the correctness and immediateness of mass course election data. Therefore, the traditional line-up course election mode faces great trials.
To ease the pressure, the academic administrative personnel request computer center to help them, and the approach of course election is going to be replaced by the computer network gradually. But most training school is changing their education system to college style, the course election flexibility is changing and there are many education systems to coexist in schools, so the practice of course election faces some problems. With these background factors, we hope to take network-like course election as the prerequisite, and explore the possible causes of course election problems and design a satisfying course election system. By the evaluation of the practice of the new system, we address the conclusions and suggestions as the future research directions.
At first, with the problem of course election fairness, we discuss the mode of First-Come-First-Served and the mode of Wishes-Distribution in our study; with the problem of system performance, we explain the reason to adopt the multi-tier architecture and explain the importance of resource pooling mechanism. Then, in the phase of system analysis and design, we explain the process of choosing system development methodology. Next we proceed the problem definition and goal definition, and the feasibility study fallowing. Finally we represent the critical data structure definition by Warnier-Orr Diagram, and represent the data model by Entity-Relationship Diagram, and represent system functions by Hierarchy Diagram.
Besides we discussed the phase of system analysis and design above, we discuss the phase of system development and implementation. In this phase, we explain the system architecture, show the discussed affairs of a coordination committee, and show the problems of the wishes distribution fairness and data output. Then, by the evaluation, we get the effects of fairness complains decreasing, problem-handling quality raising, and find the problem of relative course arrangement, network management force, system test, process establishment, information security.
At last, by the results of practice, we address the conclusions with network performance, program’s inner configuration, the mode of course election, information personnel, and address the suggestions of automation enhancing, system integration, wishes distribution algorithm improving. |
參考文獻 |
參考文獻
[1] 王行一(2001),「最佳化排課系統之建立」,技術學刊,16(4),頁 587-593。
[2] 王妙雲(1995),「系統分析與設計—方法‧工具論」,台灣台北,碁峰。
[3] 包冬意、賴永進、吳智暉(1993),「大專院校排課自動化之研究」,大葉學報,2(1),頁 135-144。
[4] 沈文祥(1991),「學校體育課興趣選項電腦化作業」,國民體育季刊,20(2),頁 18-28。
[5] 邱孟佑、廖鴻圖(1997),「植基於Intranet上之電腦輔助排課系統」,德明學報,12,頁 1-13。
[6] 姚銀河、黃明官(1997),「系統分析與設計」,台灣台北,高立。
[7] 洪杏林(1982),「網際網路在教務選課系統之應用」,資訊與教育,71,頁 40-51。
[8] 唐學明(1996),「軍事學校電腦排課問題之探討」,復興崗學報,59,頁 129-155。
[9] 徐淑惠(1991),「臺灣大學體育課興趣選項電腦化作業」,國民體育季刊,20(2),頁 56-64。
[10] 陳恩航(2000),「空專選課系統在分散式多層架構下之探討」,國立臺北商專學報,54,頁 53-86。
[11] 黃坤錦(1999),「美國大學的通識教育—美國心靈的攀登」,台灣台北,師大書苑。
[12] 楊建民、姜明英、陳俊男(1991),「體育選課資訊系統模式之研究」,國民體育季刊,20(2),頁 4-17。
[13] 賴聯福、潘建一、劉佳灝、李允中(2001),「應用人工智慧與資料庫方法於排課系統之自動化」,電腦學刊,13(3),頁 1-8。
[14] Ahlbeck, L. (1997), “Improving Performance of the Data Access Components When Running with Internet Information Server 4.0,” MSDN
[15] Boillot, M. H., et al. (1985), “Essentials of Flowcharting,” 4th ed. Dubuque, IA: Wm. C. Brown.
[16] Chen, P. (1976), “The Entity-Relationship Model-Towards a Unified View of Data,” ACM Transactions on Database Systems, 1(1):9-36.
[17] Coleridge, R. (1999), “An Introduction to the Duwamish Books Sample,” MSDN
[18] Davis, W. S. (1983), “System Analysis And Design: A Structured Approach,” Boston, MA: Addison-Wesley.
[19] Dickinson, B. (1989), “Developing Quality Systems: A Methodology Using Structured Techniques,” New York, NY: McGraw-Hill.
[20] Gane, C., and Sarson, T. (1979), “Structured Systems Analysis: Tools And Techniques,” Englewood Cliffs, NJ: Prentice-Hall.
[21] Gause, D. C., and Weinberg, G. (1990), “Are Your Lights On? How to Figure Out What the Problem REALLY Is,” New Your, NY: Dorset House.
[22] Higgins, D. A. (1979), “Program Design and Construction,” Englewood Cliffs, NJ: Prentice-Hall.
[23] Ince, D., and Andrews, D. (1990), “The System Life Cycle,” London, UK: Butterworths.
[24] Katzan, H. J. (1976), “Systems Design And Documentation: An Introduction To The HIPO Method,” New York, NY: Van Nostrand Reinhold.
[25] Microsoft Corporation (1998), “Microsoft Component Services: A Technology Overview,” MSDN
[26] Microsoft Corporation (2000), “COM+ Application Overview,” MSDN
[27] Microsoft Corporation (1999), “COM+ Technical Series: Object Pooling,” MSDN
[28] Orr, K. T. (1981), “Structured Requirements Definition,” Topeka, KS: Ken Orr and Associates.
[29] Orr, K. T. (1977), “Structured Systems Development,” New York, NY: Yourdon.
[30] Warnier, J. D. (1976), “The Logical Construction of Programs,” New York, NY: Van Nostrand Reinhold.
[31] Warnier, J. D. (1978), “Program Modification,” London, UK: Martinus Nijhoff.
[32] Waymire, R., and Sawtell, R. (2000), “Teach Yourself Microsoft SQL Server 2000 in 21 Days,” Indianapolis, IN: Sams.
[33] Yourdon, E., and Constantine, L. L. (1979), “Structured Design,” Englewood Cliffs, NJ: Prentice-Hall. |