{"id":76,"date":"2017-10-02T11:43:27","date_gmt":"2017-10-02T11:43:27","guid":{"rendered":"http:\/\/140.114.54.13\/test_aact2\/en\/?page_id=76"},"modified":"2021-03-04T19:30:06","modified_gmt":"2021-03-04T11:30:06","slug":"the-best-phd-master-dissertations","status":"publish","type":"page","link":"http:\/\/www.aact.org.tw\/en\/index.php\/awards\/the-best-phd-master-dissertations\/","title":{"rendered":"The Best Ph.D.\/Master Dissertations"},"content":{"rendered":"
2020 Best Master Thesis Award<\/strong><\/h5>\n\n\n\n\n\n\n
\u7279\u512a \u9673\u5b78\u5e73 Leader Election in Population Protocols (\u7fa4\u9ad4\u5354\u8b70\u4e2d\u7684\u9818\u5c0e\u8005\u9078\u8209) \u53f0\u5927\u96fb\u6a5f\u6240
\n(\u6307\u5c0e\u6559\u6388\uff1a\u9673\u548c\u9e9f)<\/td>\n<\/tr>\n
\u512a\u7b49 \u5433\u4f2f\u63da Selling User Data to No-Regret Advertisers: Dynamic Multi-Item Auctions \u4ea4\u5927\u8cc7\u7ba1\u6240
\n(\u6307\u5c0e\u6559\u6388\uff1a\u9673\u67cf\u5b89)<\/td>\n<\/tr>\n
\u512a\u7b49 \u8cf4\u51a0\u6f90 Online Scheduling: Investigating the Car-sharing Problem from Theoretical Perspective (\u5373\u6642\u6392\u7a0b\uff1a\u5f9e\u6f14\u7b97\u6cd5\u89d2\u5ea6\u63a2\u8a0e\u5373\u6642\u6c7d\u8eca\u5171\u4eab\u554f\u984c) \u6e05\u83ef\u5927\u5b78\u5de5\u696d\u5de5\u7a0b\u8207\u5de5\u7a0b\u7ba1\u7406\u5b78\u7cfb
\n(\u6307\u5c0e\u6559\u6388\uff1a\u5ed6\u5d07\u78a9)<\/td>\n<\/tr>\n
\u512a\u7b49 \u67ef\u8056\u5f65 The General Max-min Fair Allocation Problem(\u63a2\u8a0e\u8cc7\u6e90\u5206\u914d\u4e4b\u6700\u5927\u5316\u6700\u5c0f\u516c\u5e73\u6027\u554f\u984c) \u6e05\u83ef\u5927\u5b78\u5de5\u696d\u5de5\u7a0b\u8207\u5de5\u7a0b\u7ba1\u7406\u5b78\u7cfb
\n(\u6307\u5c0e\u6559\u6388\uff1a\u5ed6\u5d07\u78a9)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

 <\/p>\n

2019 & 2020 The Best PhD.\/Master Dissertation Award Application and Form<\/p>\n

2018 & 2019 The Best Master Thesis<\/strong><\/h5>\n\n\n\n\n
\u7279\u512a \u9673\u5f65\u5ef7, A Dichotomy Result for Cyclic-Order Traversing Games, \u570b\u7acb\u4ea4\u901a\u5927\u5b78\u8cc7\u8a0a\u79d1\u5b78\u8207\u5de5\u7a0b\u7814\u7a76\u6240
\n(\u6307\u5c0e\u6559\u6388\uff1a\u8521\u932b\u921e)<\/td>\n<\/tr>\n
\u512a\u7b49 \u6d2a\u6069\u5e73, Approximation Algorithm for Vertex Cover with Multiple Covering
\nConstraints, \u570b\u7acb\u81fa\u7063\u5927\u5b78\u96fb\u6a5f\u8cc7\u8a0a\u5b78\u9662\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb
\n(\u6307\u5c0e\u6559\u6388\uff1a\u9ad8\u5b5f\u99ff)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n
2017 & 2018 The Best Master Thesis<\/strong><\/h5>\n\n\n\n\n\n\n
\u7279\u512a \u6797\u5fc5\u7965, Fast Algorithms for the Concatenated Longest Common Subsequence Problem with Linear-space S-table, \u570b\u7acb\u4e2d\u5c71\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb
\n(\u6307\u5c0e\u6559\u6388\uff1a\u694a\u660c\u5f6a)<\/td>\n<\/tr>\n
\u512a\u7b49 \u856d\u5bb6\u582f, Tight Approximation for Partial Vertex Cover with Hard Capacities, \u570b\u7acb\u53f0\u7063\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb
\n(\u6307\u5c0e\u6559\u6388\uff1a\u674e\u5fb7\u8ca1)<\/td>\n<\/tr>\n
\u512a\u7b49 \u9ad8\u58eb\u821c, Constructing Independent Spanning Trees on Star Networks and Bubble-Sort Network, \u53f0\u5317\u5546\u696d\u5927\u5b78\u8cc7\u8a0a\u8207\u6c7a\u7b56\u79d1\u5b78\u7814\u7a76\u6240
\n(\u6307\u5c0e\u6559\u6388\uff1a\u5f35\u8087\u660e)<\/td>\n<\/tr>\n
\u4f73\u4f5c \u8cf4\u6069\u5b8f, Power-constrained Image Contrast Enhancement through Sparse Representation by Joint Mixed-norm Regularization, \u5143\u667a\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb
\n(\u6307\u5c0e\u6559\u6388\uff1a\u9673\u67cf\u8c6a)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n
2016 The Best Ph.D. Dissertation<\/strong><\/h5>\n\n\n\n\n\n
\u7279\u512a \u9673\u7acb\u8ed2, Parameterized Algorithms for Cluster-Graph Modification Problems, \u570b\u7acb\u4e2d\u6b63\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb
\n(\u6307\u5c0e\u6559\u6388\uff1a\u5433\u90a6\u4e00\u3001\u5f35\u8cbf\u7fd4)<\/td>\n<\/tr>\n
\u512a\u7b49 \u8449\u6cf0\u9e9f, A Study of Precise Fault Diagnosis Algorithms for Hypercube-Like Networks Based on the Comparison Diagnosis Model, \u570b\u7acb\u6210\u529f\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb
\n(\u6307\u5c0e\u6559\u6388\uff1a\u8b1d\u5b6b\u6e90)<\/td>\n<\/tr>\n
\u4f73\u4f5c \u9b4f\u5609\u6210, A Study of (t,k)-Diagnosis Algorithms for Regular and Irregular Networks,\u570b\u7acb\u6210\u529f\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb
\n(\u6307\u5c0e\u6559\u6388\uff1a\u8b1d\u5b6b\u6e90)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

 <\/p>\n

2016 The Best Master Thesis<\/strong><\/h5>\n\n\n\n\n\n\n\n
\u7279\u512a \u9673\u4ee5\u6a02, Opinion Formation Games in Social Networks, \u570b\u7acb\u4ea4\u901a\u5927\u5b78\u8cc7\u8a0a\u7ba1\u7406\u8207\u8ca1\u52d9\u91d1\u878d\u5b78\u7cfb
\n(\u6307\u5c0e\u6559\u6388\uff1a\u9673\u67cf\u5b89)<\/td>\n<\/tr>\n
\u512a\u7b49 \u8a79\u7687\u5ef7, The Definitions and Computation fo Two Dimensional Largest Common Substructure Problem,s, \u570b\u7acb\u4e2d\u5c71\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb
\n(\u6307\u5c0e\u6559\u6388\uff1a\u694a\u660c\u5f6a)<\/td>\n<\/tr>\n
\u512a\u7b49 \u9678\u96e8\u65b0, Marker Equilibria and Games: An Algorithmic Approach, \u570b\u7acb\u4ea4\u901a\u5927\u5b78\u8cc7\u8a0a\u7ba1\u7406\u8207\u8ca1\u52d9\u91d1\u878d\u5b78\u7cfb
\n(\u6307\u5c0e\u6559\u6388\uff1a\u9673\u67cf\u5b89)<\/td>\n<\/tr>\n
\u4f73\u4f5c \u962e\u9a30\u9035, Minimum Manhattan Distance Approach to Multiple Criteria Decision Making in Multiobjective Optimization Problems, \u5143\u667a\u5927\u5b78\u96fb\u6a5f\u5de5\u7a0b\u5b78\u7cfb
\n(\u6307\u5c0e\u6559\u6388\uff1a\u90b1\u5049\u80b2)<\/td>\n<\/tr>\n
\u4f73\u4f5c \u6797\u7bb4\u8afa, Efficient Survivable Mapping Design for Logical Topology in IP-over-WDM Optical Networks against Node Failure, \u570b\u7acb\u6210\u529f\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb
\n(\u6307\u5c0e\u6559\u6388\uff1a\u8b1d\u5b6b\u6e90)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

 <\/p>\n

2015 The Best Ph.D. Dissertation<\/strong><\/h5>\n\n\n\n
Ching-Hao Liu (\u67f3\u9752\u6d69), Algorithms on Graph Optimization and Unfolding Problems (\u5716\u5f62\u6700\u4f73\u5316\u8207\u5e7e\u4f55\u5c55\u958b\u554f\u984c\u4e4b\u8a08\u7b97\u65b9\u6cd5\u7814\u7a76), \u6e05\u83ef\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u535a\u58eb
\n(\u6307\u5c0e\u6559\u6388\uff1a\u6f58\u96d9\u6d2a)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

 <\/p>\n

2015 The Best Master Thesis<\/strong><\/h5>\n\n\n\n\n\n
Chun-Yi Wu (\u5433\u4fca\u6bc5), Computing the Probability of Specific Random Sector Graphs with Applications in Wireless Networks with Directional Antennas (\u8a08\u7b97\u96a8\u6a5f\u6247\u5716\u6a5f\u7387\u53ca\u61c9\u7528\u65bc\u6307\u5411\u6027\u5929\u7dda\u7db2\u8def), \u4e2d\u83ef\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u78a9\u58eb
\n(\u6307\u5c0e\u6559\u6388\uff1a\u4fde\u5f81\u6b66)<\/td>\n<\/tr>\n
Xiang-Rui Chen (\u9673\u7965\u777f), A Study on the Connectivity and Super Connectivity of Locally Exchanged Twisted Cubes (\u5728\u5c40\u90e8\u4ea4\u63db\u96d9\u626d\u8d85\u7acb\u65b9\u9ad4\u4e0a\u63a2\u8a0e\u9023\u901a\u5ea6\u8207\u8d85\u7d1a\u9023\u901a\u5ea6), \u570b\u7acb\u53f0\u5317\u5546\u696d\u5927\u5b78\u8cc7\u8a0a\u8207\u6c7a\u7b56\u79d1\u5b78\u7814\u7a76\u6240\u78a9\u58eb
\n(\u6307\u5c0e\u6559\u6388\uff1a\u5f35\u8087\u660e)<\/td>\n<\/tr>\n
Yi-Jun Chang (\u5f35\u4ee5\u6f64), Contact Representations of Graphs (\u5716\u7684\u63a5\u89f8\u8868\u793a\u6cd5), \u53f0\u7063\u5927\u5b78\u96fb\u6a5f\u5de5\u7a0b\u78a9\u58eb
\n(\u6307\u5c0e\u6559\u6388\uff1a\u984f\u55e3\u921e)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

 <\/p>\n

2014 The Best Ph.D. Dissertation<\/strong><\/h5>\n\n\n\n\n\n\n
\u9673\u4fca\u5b89(\u6210\u529f\u5927\u5b78) (t, k)-Diagnosis of Multiprocessor Systems<\/td>\n<\/tr>\n
\u6234\u90a6\u7098(\u53f0\u7063\u5927\u5b78) Geometric Computing for Industrial Design, Manufacturing and Management<\/td>\n<\/tr>\n
\u5442\u5609\u7dad(\u6e05\u83ef\u5927\u5b78) Efficient Exact and Approximate String Matching Algorithms<\/td>\n<\/tr>\n
\u6b50\u5bb6\u6b23(\u6e05\u83ef\u5927\u5b78) On the Bit-Parallel Approaches to String Matching Problem<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n
2014 The Best Master Thesis<\/strong><\/h5>\n\n\n\n\n
\u90ed\u5955\u6d66(\u4e2d\u5c71\u5927\u5b78) Efficient Algorithms for the Flexible Longest Common Subsequence Problem<\/td>\n<\/tr>\n
\u5f35\u7389\u8f1d(\u5317\u5546\u5927) Constructing Independent Spanning Trees on Locally Twisted Cubes in Parallel<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n","protected":false},"excerpt":{"rendered":"

2020 Best Master Thesis Award \u7279\u512a \u9673\u5b78\u5e73 Leader Election in Population Protocols (\u7fa4\u9ad4\u5354\u8b70\u4e2d\u7684\u9818\u5c0e\u8005\u9078\u8209) \u53f0\u5927\u96fb\u6a5f\u6240 (\u6307\u5c0e\u6559\u6388\uff1a\u9673\u548c\u9e9f) \u512a\u7b49 \u5433\u4f2f\u63da Selling User Data to No-Regret Advertisers: Dynamic Multi-Item Auctions \u4ea4\u5927\u8cc7\u7ba1\u6240 (\u6307\u5c0e\u6559\u6388\uff1a\u9673\u67cf\u5b89) \u512a\u7b49 \u8cf4\u51a0\u6f90 Online Scheduling: Investigating the Car-sharing Problem from Theoretical Perspective (\u5373\u6642\u6392\u7a0b\uff1a\u5f9e\u6f14\u7b97\u6cd5\u89d2\u5ea6\u63a2\u8a0e\u5373\u6642\u6c7d\u8eca\u5171\u4eab\u554f\u984c) \u6e05\u83ef\u5927\u5b78\u5de5\u696d\u5de5\u7a0b\u8207\u5de5\u7a0b\u7ba1\u7406\u5b78\u7cfb (\u6307\u5c0e\u6559\u6388\uff1a\u5ed6\u5d07\u78a9) \u512a\u7b49 \u67ef\u8056\u5f65 The General Max-min Fair Allocation Problem(\u63a2\u8a0e\u8cc7\u6e90\u5206\u914d\u4e4b\u6700\u5927\u5316\u6700\u5c0f\u516c\u5e73\u6027\u554f\u984c) \u6e05\u83ef\u5927\u5b78\u5de5\u696d\u5de5\u7a0b\u8207\u5de5\u7a0b\u7ba1\u7406\u5b78\u7cfb (\u6307\u5c0e\u6559\u6388\uff1a\u5ed6\u5d07\u78a9)   2019 & […]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":68,"menu_order":1,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"http:\/\/www.aact.org.tw\/en\/index.php\/wp-json\/wp\/v2\/pages\/76"}],"collection":[{"href":"http:\/\/www.aact.org.tw\/en\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"http:\/\/www.aact.org.tw\/en\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"http:\/\/www.aact.org.tw\/en\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/www.aact.org.tw\/en\/index.php\/wp-json\/wp\/v2\/comments?post=76"}],"version-history":[{"count":25,"href":"http:\/\/www.aact.org.tw\/en\/index.php\/wp-json\/wp\/v2\/pages\/76\/revisions"}],"predecessor-version":[{"id":265,"href":"http:\/\/www.aact.org.tw\/en\/index.php\/wp-json\/wp\/v2\/pages\/76\/revisions\/265"}],"up":[{"embeddable":true,"href":"http:\/\/www.aact.org.tw\/en\/index.php\/wp-json\/wp\/v2\/pages\/68"}],"wp:attachment":[{"href":"http:\/\/www.aact.org.tw\/en\/index.php\/wp-json\/wp\/v2\/media?parent=76"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}