配對問題是一個非常有實用性的問題,例如現階段的聯考分發制度,便是一種配對的問題,而目前是要人到特定地點繳交志願卡,相當的不方便;此外，現階段的網路普及,許多工作都是藉由網路來達到便利性,例如:網路報稅、電子公文等,這些工作電子化後,提高了工作效率也增加了個人的便利性.
因此，本研究將繳交志願卡和網路結合在一起,並考慮網路安全，建構出一個安全的網路志願分發系統，使得志願卡的繳交流程獲得簡化。

Match problem is a very practical problem. For example, distribution system of united examination today is a kind of match problem. However, it is very inconvenient to hand over preference card now. Person must leave for designate place to hand over preference card. Besides, Internet is in widespread use now. A lot of work has accomplished and achieved conveniently by the use of Internet, such as Internet filing tax, electronic document and so on. After the work electronic-based, the work efficiency and personal convenience will be increased.
Therefore, this study is constructing a system, which combines handing over preference card with Internet and considering that the security of Internet. This can simplify the procedure of handing over preference card.

1 序論 1
1.1 動機...............................1
1.2 目的...............................3
1.3 論文架構...........................3
2 相關研究 4
2.1 相關名詞解釋.......................4
2.2 配對問題之研究.....................5
3 學生志願分發系統的設計與實作 11
3.1 系統設計..........................11
3.1.1 系統架構....................11
3.1.2 系統具備功能................12
3.2 系統實作..........................12
3.2.1 使用之演算法................12
3.2.2 系統實作介紹................15
3.2.3 另一種實作方式..............19
3.2.4 實作結果與討論..............20
4 結論 26
4.1 結論..............................26
4.2 未來展望..........................27
參考文獻................................29

[1] 王智弘. 黃宗立. 網際網路上安全的工程競標通訊協定, 國立成功大學資訊工程 系, 1997.
[2] 賴溪松. 韓亮. 張真誠. 現代密碼學及其應用. 松崗電腦圖書資料股份有限公司.

[3] David Gale and Lloyd Shapley. College admission and the stablity of
marriage. Am. Math. Monthly, 69:9-15, 1962.

[4] David Gale and Marilda Sotomayor. Some remarks on the stable match-
ing problem. Discrete Applied Mathematics, 11:223-232, 1985.

[5] Dan Gus6eld. Three fast algorithm for four problem in stable marriage.
SIAM J. Comput, 16(1):111-128, February 1987.

[6] Dan Gusfield and Robert W. Irving. The Stable Marriage Problem:
Structure and Algorithms. The MIT Press, 1989.

[7] Tetsuo Hattori, Toshinori Yamasaki, and Michio Kumano. New fast iter-
ation algorithm for the solution of generalized stable marriage problem.
IEEE International Conference on, 6:1051-1056, Oct 1999.

[8] Robert W. Irving, Paul Leather, and Dan Gusfield. An efficient algo-
rithm for the "optimal" stable marriage. Jounal of the ACM, 34(3):532-
543, July 1987.
[9] Ruth Martinez, Alejandro Neme Jordi Masso, and Jorge Oviedo. Single
agent and the set of many-to-one stable matchings. Jounal of Economic
Theory, 91:91-105, March 2000.

[10] D.G. McVitie and L.B. Wilson. The stable marriage problem. Commu-
nication of the ACM, 14(7):486-490, 1971.

[11] D.G. McVitie and L.B. Wilson. Three procedure for the stables marriage
problem. Communication of the ACM, 14(7):491-492, July 1971.

[12] Morikazu Nakamura, Kenji Onaga, Seiki Kyan, and Manual Silva. Ge-
netic algorithm for sex-fair stable marriage problem. IEEE International
Symposium on, 1:509-512, May 1995.

[13] Mohammada Peyravian and Nevenkoa Zunic. Met,hods for protecting
password transmission. Computers and Security, 19(5):466-469, July
2000.

[14] Alvin E. Roth and Marilda A. Oliveira Sotomayor. Two-side Matching:A
Study in Game-Theoretic Modeling and Analysis. New York:Cambridge
Univ. Press, 1989.

[15] Tayfun Sonme. Strategy-proofness in many-to-one matching roblems.
Economic Design, 1:365-380, April 1996.

[16] William Stallings. Croytography and Network Security.?眳p資訊股份有限公司. 巫昆品. 曾志光 譯.

[17] S.S. Tseng and R.C.T Lee. A parallel algorithm to solve the stable
marria,ge problem. BIT, 24:308-316, Jan 1984.