2017-03-032025-07-302017-03-032017-03-03https://ir.ntus.edu.tw/handle/987654321/70156　　網路選課機制提供了不限區域、便捷與即時的選課處理服務，也是目前大學校院所普及提供的服務。然而，在課程資源有限的情況下，將造成資源搶奪的現象。資源搶奪過程中，可能因多人同時查詢相同資源導致資訊的誤判，因而違背了資源限制的規則，特別是在臨界值關鍵交易的處理上，造成交易的失誤。因此，如何以一個公平且有效的網路選課機制來解決上述問題，則成為重要的議題。在這個研究中，我們將提出一個簡單、彈性、易擴充且穩健的網路選課環境架構，並結合一個能有效地處理因資源限制臨界值以及因多人網路查詢而造成交易失誤的演算法，以發展出正確且符合資源限制條件的網路選課機制。 　　Online course selection system has been a popular service in the colleges because it provides convenient and timely course selection services but with no regional constraint. However, limited course resource causes the phenomenon of course grabbing. In the process of resource grabbing, queries from different users to the same resources at the same time may lead to information misjudgment that may violate the rules of resources usage constraint. Particularly, in the case of key transactions processing for critical values, they may result in the occurrence of transaction processing errors. Therefore, how to design a fair and effective online course selection mechanism to solve these problems would be an important issue. In this study, we will thus present a simple, flexible, easily extensible, and robust network environment architecture providing an effective mechanism as well as an efficient algorithm for online course selection.847702 bytesapplication/pdf網路選課;盲抽號演算法;臨界值關鍵交易;校務資訊系統;校務行政電腦化Online course selection;Blind-draw algorithm;Critical threshold transaction;School information system;Computerization of school administrationreport