{"id":144,"date":"2017-09-27T07:55:34","date_gmt":"2017-09-27T07:55:34","guid":{"rendered":"http:\/\/140.114.54.13\/test_aact2\/?page_id=144"},"modified":"2026-04-16T07:50:31","modified_gmt":"2026-04-15T23:50:31","slug":"best_dissertations","status":"publish","type":"page","link":"http:\/\/www.aact.org.tw\/index.php\/awards\/best_dissertations\/","title":{"rendered":"\u6700\u4f73\u535a\u58eb\u78a9\u58eb\u8ad6\u6587\u734e"},"content":{"rendered":"
2025\u6700\u4f73\u78a9\u58eb\u8ad6\u6587\u596c<\/strong><\/h5>\n\n\n\n
[\u91d1\u734e]<\/strong><\/p>\n

\u9673\u6631\u5b8f \u4e09\u5c64\u96fb\u8def\u4e0b\u754c\u4e4b\u7814\u7a76\uff1a\u4ee5\u591a\u6578\u6c7a\u51fd\u6578\u70ba\u4f8b \u570b\u7acb\u967d\u660e\u4ea4\u901a\u5927\u5b78\u6578\u64da\u79d1\u5b78\u8207\u2f2f\u7a0b\u7814\u7a76\u6240 (\u6307\u5c0e\u6559\u6388\uff1a\u8521\u932b\u921e\u6559\u6388)<\/p>\n

[\u9280\u734e]<\/strong><\/p>\n

\u9673\u5f65\u5b87 \u6578\u503c\u8cc7\u6599\u58d3\u7e2e\u554f\u984c \u570b\u7acb\u4e2d\u5c71\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb (\u6307\u5c0e\u6559\u6388\uff1a\u694a\u660c\u5f6a\u6559\u6388)<\/p>\n

[\u9285\u734e]<\/strong><\/p>\n

\u5468\u667a\u6db5 \u5e36\u6709\u65b9\u5411\u6027\u7d04\u675f\u7684GPS \u8ecc\u8de1\u7684\u6700\u4f73\u6295\u5f71 \u570b\u7acb\u6210\u529f\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb (\u6307\u5c0e\u6559\u6388\uff1a\u8b1d\u5b6b\u6e90\u6559\u6388)<\/p>\n

[\u4f73\u4f5c]<\/strong><\/p>\n

\u5ed6\u5c55\u9038 \u57fa\u65bc\u689d\u4ef6\u9ad8\u65af\u7db2\u8def\u5206\u985e\u5668\u7684\u7d50\u69cb\u611f\u77e5\u7a69\u5065\u53cd\u4e8b\u5be6\u89e3\u91cb \u570b\u7acb\u967d\u660e\u4ea4\u901a\u5927\u5b78\u8cc7\u8a0a\u7ba1\u7406\u7814\u7a76\u6240 (\u6307\u5c0e\u6559\u6388\uff1a\u9673\u67cf\u5b89\u6559\u6388\u3001\u4fde\u5728\u5143\u6559\u6388)<\/p>\n

\u694a\u777f\u8b19 \u8d85\u7d1a\u652f\u914d\u96c6\u5408\u554f\u984c\u4e4b\u7814\u7a76 \u81fa\u5317\u5e02\u7acb\u5927\u5b78\u8cc7\u8a0a\u79d1\u5b78\u7cfb (\u6307\u5c0e\u6559\u6388\uff1a\u9673\u5f65\u5b8f\u6559\u6388)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

2024\u6700\u4f73\u78a9\u58eb\u8ad6\u6587\u596c<\/strong><\/h5>\n\n\n\n
[\u91d1\u734e]<\/strong><\/p>\n

\u674e\u6021\u8431 \u8868\u9762\u5316\u5b78\u53cd\u61c9\u7db2\u8def\u7684\u6a21\u64ec\u80fd\u529b \u570b\u7acb\u81fa\u7063\u5927\u5b78\u96fb\u6a5f\u5de5\u7a0b\u5b78\u7cfb (\u6307\u5c0e\u6559\u6388\uff1a\u9673\u548c\u9e9f\u6559\u6388)<\/p>\n

[\u9280\u734e]<\/strong><\/p>\n

\u9673\u51a0\u660a \u5728\u647a\u758a\u5f0f\u8d85\u7acb\u65b9\u9ad4\u4e2d\u5efa\u69cb\u4e09\u68f5\u5b8c\u5168\u7368\u7acb\u751f\u6210\u6a39 \u570b\u7acb\u6210\u529f\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb (\u6307\u5c0e\u6559\u6388\uff1a\u8b1d\u5b6b\u6e90\u6559\u6388)<\/p>\n

[\u9285\u734e]<\/strong><\/p>\n

\u5ed6\u739f\u96ef \u8fd1\u4e4e\u4fdd\u5e8f\u5339\u914d\u554f\u984c \u570b\u7acb\u4e2d\u5c71\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb (\u6307\u5c0e\u6559\u6388\uff1a\u694a\u660c\u5f6a\u6559\u6388)<\/p>\n

[\u4f73\u4f5c]<\/strong><\/p>\n

\u8a31\u73ee\u8431 \u591a\u6a5f\u5668\u4eba\u5728\u6a39\u7d50\u69cb\u4e0a\u6700\u5c0f\u5316\u6700\u5927\u5ef6\u9072\u5de1\u908f\u8abf\u5ea6 \u570b\u7acb\u4e2d\u592e\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb (\u6307\u5c0e\u6559\u6388\uff1a\u694a\u6667\u742e\u6559\u6388)<\/p>\n

\u738b\u5ee3\u548c \u7d50\u5408\u9810\u6e2c\u4e4b\u7dda\u4e0a\u6d88\u9632\u54e1\u554f\u984c\u65bc\u6a39\u72c0\u7d50\u69cb \u570b\u7acb\u967d\u660e\u4ea4\u901a\u5927\u5b78\u8cc7\u8a0a\u7ba1\u7406\u7814\u7a76\u6240 (\u6307\u5c0e\u6559\u6388\uff1a\u9673\u67cf\u5b89\u6559\u6388\u3001\u5289\u5411\u7444\u6559\u6388)<\/p>\n

\u7a0b\u81f3\u69ae \u89e3\u78bcPC1\u7684\u529b\u91cf\uff1a\u4e00\u7a2e\u5feb\u901f\u6e96\u78ba\u4e26\u57fa\u65bc\u5171\u8b8a\u7570\u7684Hi-C\u8cc7\u6599A_B\u67d3\u8272\u9ad4\u5340\u5ba4\u8fa8\u5225\u65b9\u6cd5 \u570b\u7acb\u653f\u6cbb\u5927\u5b78\u8cc7\u8a0a\u79d1\u5b78\u7cfb (\u6307\u5c0e\u6559\u6388\uff1a\u5f35\u5bb6\u9298\u6559\u6388)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

2023\u6700\u4f73\u78a9\u58eb\u8ad6\u6587\u596c<\/strong><\/h5>\n\n\n\n
\u76e4\u7fbd\u5022 \u57fa\u65bc\u5f37\u512a\u52e2\u7b56\u7565\u5f71\u97ff\u50b3\u64ad\u7684\u6df7\u5408\u7dda\u6027\u95a5\u503c SIS \u6a21\u578b \u570b\u7acb\u81fa\u5317\u5546\u696d\u5927\u5b78\u8cc7\u8a0a\u8207\u6c7a\u7b56\u79d1\u5b78\u7814\u7a76\u6240 (\u6307\u5c0e\u6559\u6388\uff1a\u5f35\u8087\u660e\u6559\u6388)<\/p>\n

\u8521\u5b5f\u4fee \u5728\u2206\u03b2\u5ea6\u91cf\u5716\u4e0a\u661f\u72c0p-\u4e2d\u7e7c\u7ad9\u5b9a\u4f4d\u554f\u984c\u7684\u6539\u826f\u8fd1\u4f3c\u6f14\u7b97\u6cd5\u5206\u6790 \u570b\u7acb\u6210\u529f\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb (\u6307\u5c0e\u6559\u6388\uff1a\u8b1d\u5b6b\u6e90\u6559\u6388\u3001\u6d2a\u7dbe\u73e0\u6559\u6388)<\/p>\n

\u5442\u5b97\u9716 \u6700\u9577\u5171\u540c\u8fd1\u4e4e\u6ce2\u52d5\u5b50\u5e8f\u5217\u554f\u984c \u570b\u7acb\u4e2d\u5c71\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb (\u6307\u5c0e\u6559\u6388\uff1a\u694a\u660c\u5f6a\u6559\u6388)<\/p>\n

\u9673\u51a0\u5ef7 \u6700\u591a\u8207\u6700\u9577\u905e\u589e\u5340\u9593\u5b50\u5e8f\u5217\u554f\u984c \u570b\u7acb\u4e2d\u5c71\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb (\u6307\u5c0e\u6559\u6388\uff1a\u694a\u660c\u5f6a\u6559\u6388)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

2022\u6700\u4f73\u535a\u58eb\u8ad6\u6587\u734e<\/strong><\/h5>\n\n\n\n
\u512a\u7b49, \u5289\u7e55\u699c, Antimagic Graphs with Arbitrary Real Number Labels, \u570b\u7acb\u653f\u6cbb\u5927\u5b78.
\n(\u6307\u5c0e\u6559\u6388\uff1a\u5f35\u5b9c\u6b66\u6559\u6388)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n
2022\u6700\u4f73\u78a9\u58eb\u8ad6\u6587\u734e<\/strong><\/h5>\n\n\n\n
\u7279\u512a, \u5433\u5b97\u9054, Dependent k-Set Packing on Polynomoids, \u570b\u7acb\u967d\u660e\u4ea4\u901a\u5927\u5b78.
\n(\u6307\u5c0e\u6559\u6388\uff1a\u8521\u932b\u921e\u6559\u6388\u3001\u8521\u5b5f\u5b97\u6559\u6388)\u512a\u7b49, \u8521\u5143\u4fee, A Fast Search Method for Similar Protein Sequences, \u570b\u7acb\u4e2d\u5c71\u5927\u5b78.
\n(\u6307\u5c0e\u6559\u6388\uff1a\u694a\u660c\u5f6a\u6559\u6388)<\/p>\n

\u512a\u7b49, \u6731\u53ef\u6b23, Algorithms for the Constrained Longest Common Subsequence Problems with t-length and at Least t-length Substrings, \u570b\u7acb\u4e2d\u5c71\u5927\u5b78
\n(\u6307\u5c0e\u6559\u6388\uff1a\u694a\u660c\u5f6a\u6559\u6388)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

<\/p>\n

2021\u6700\u4f73\u535a\u58eb\u8ad6\u6587\u596c<\/strong><\/h5>\n\n\n\n
\u512a\u7b49\uff0c\u9ec3\u7686\u5bcc \uff0c\u5728\u4ea4\u66ff\u7fa4\u7d44\u7db2\u8def\u8207(n,k)-\u661f\u5716\u4e0a\u4ee5\u905e\u8ff4\u8207\u5e73\u884c\u65b9\u6cd5\u5efa\u69cb\u7368\u7acb\u751f\u6210\u6a39\uff0c\u570b\u7acb\u6210\u529f\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb<\/p>\n

(\u6307\u5c0e\u6559\u6388\uff1a\u8b1d\u5b6b\u6e90\u6559\u6388)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

2021\u6700\u4f73\u78a9\u58eb\u8ad6\u6587\u596c<\/strong><\/h5>\n\n\n\n
\u4f73\u4f5c \u9ec3\u97cb\u9716 \u6709\u95dc\u7279\u5b9a\u5716\u7684(\u8d85)\u5f37\u5f69\u8679\u9023\u901a\u6578\u63a2\u8a0e \u570b\u7acb\u5609\u7fa9\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb(\u6307\u5c0e\u6559\u6388\uff1a\u8cf4\u6cf3\u4f36\u6559\u6388)<\/p>\n

\u4f73\u4f5c \u59da\u51f1\u52db Constructing Independent Spanning Trees on Generalized Recursive Circulant Graph \u570b\u7acb\u6210\u529f\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb(\u6307\u5c0e\u6559\u6388\uff1a\u8b1d\u5b6b\u6e90\u6559\u6388)<\/p>\n

\u4f73\u4f5c \u4f55\u5efa\u6587 \u7279\u5b9a\u51f1\u840a\u5716\u7684\u5f69\u8679\u8457\u8272 \u570b\u7acb\u5609\u7fa9\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb(\u6307\u5c0e\u6559\u6388\uff1a\u8cf4\u6cf3\u4f36\u6559\u6388)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

<\/h5>\n
2020 \u6700\u4f73\u78a9\u58eb\u8ad6\u6587\u734e<\/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
2018 & 2019 \u6700\u4f73\u78a9\u58eb\u8ad6\u6587\u734e<\/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 \u6700\u4f73\u78a9\u58eb\u8ad6\u6587\u734e<\/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 \u6700\u4f73\u535a\u58eb\u8ad6\u6587\u734e<\/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
2016 \u6700\u4f73\u78a9\u58eb\u8ad6\u6587\u734e<\/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
2015 \u6700\u4f73\u535a\u58eb\u8ad6\u6587\u734e<\/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
2015 \u6700\u4f73\u78a9\u58eb\u8ad6\u6587\u734e<\/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
2014 \u6700\u4f73\u535a\u58eb\u8ad6\u6587\u734e<\/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 \u6700\u4f73\u78a9\u58eb\u8ad6\u6587\u734e<\/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":"

2025\u6700\u4f73\u78a9\u58eb\u8ad6\u6587\u596c [\u91d1\u734e] \u9673\u6631\u5b8f \u4e09\u5c64\u96fb\u8def\u4e0b\u754c\u4e4b\u7814\u7a76\uff1a\u4ee5\u591a\u6578\u6c7a\u51fd\u6578\u70ba\u4f8b \u570b\u7acb\u967d\u660e\u4ea4\u901a\u5927\u5b78\u6578\u64da\u79d1\u5b78\u8207\u2f2f\u7a0b\u7814\u7a76\u6240 (\u6307\u5c0e\u6559\u6388\uff1a\u8521\u932b\u921e\u6559\u6388) [\u9280\u734e] \u9673\u5f65\u5b87 \u6578\u503c\u8cc7\u6599\u58d3\u7e2e\u554f\u984c \u570b\u7acb\u4e2d\u5c71\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb (\u6307\u5c0e\u6559\u6388\uff1a\u694a\u660c\u5f6a\u6559\u6388) [\u9285\u734e] \u5468\u667a\u6db5 \u5e36\u6709\u65b9\u5411\u6027\u7d04\u675f\u7684GPS \u8ecc\u8de1\u7684\u6700\u4f73\u6295\u5f71 \u570b\u7acb\u6210\u529f\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb (\u6307\u5c0e\u6559\u6388\uff1a\u8b1d\u5b6b\u6e90\u6559\u6388) [\u4f73\u4f5c] \u5ed6\u5c55\u9038 \u57fa\u65bc\u689d\u4ef6\u9ad8\u65af\u7db2\u8def\u5206\u985e\u5668\u7684\u7d50\u69cb\u611f\u77e5\u7a69\u5065\u53cd\u4e8b\u5be6\u89e3\u91cb \u570b\u7acb\u967d\u660e\u4ea4\u901a\u5927\u5b78\u8cc7\u8a0a\u7ba1\u7406\u7814\u7a76\u6240 (\u6307\u5c0e\u6559\u6388\uff1a\u9673\u67cf\u5b89\u6559\u6388\u3001\u4fde\u5728\u5143\u6559\u6388) \u694a\u777f\u8b19 \u8d85\u7d1a\u652f\u914d\u96c6\u5408\u554f\u984c\u4e4b\u7814\u7a76 \u81fa\u5317\u5e02\u7acb\u5927\u5b78\u8cc7\u8a0a\u79d1\u5b78\u7cfb (\u6307\u5c0e\u6559\u6388\uff1a\u9673\u5f65\u5b8f\u6559\u6388) 2024\u6700\u4f73\u78a9\u58eb\u8ad6\u6587\u596c [\u91d1\u734e] \u674e\u6021\u8431 \u8868\u9762\u5316\u5b78\u53cd\u61c9\u7db2\u8def\u7684\u6a21\u64ec\u80fd\u529b \u570b\u7acb\u81fa\u7063\u5927\u5b78\u96fb\u6a5f\u5de5\u7a0b\u5b78\u7cfb (\u6307\u5c0e\u6559\u6388\uff1a\u9673\u548c\u9e9f\u6559\u6388) [\u9280\u734e] \u9673\u51a0\u660a \u5728\u647a\u758a\u5f0f\u8d85\u7acb\u65b9\u9ad4\u4e2d\u5efa\u69cb\u4e09\u68f5\u5b8c\u5168\u7368\u7acb\u751f\u6210\u6a39 \u570b\u7acb\u6210\u529f\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb (\u6307\u5c0e\u6559\u6388\uff1a\u8b1d\u5b6b\u6e90\u6559\u6388) [\u9285\u734e] \u5ed6\u739f\u96ef \u8fd1\u4e4e\u4fdd\u5e8f\u5339\u914d\u554f\u984c \u570b\u7acb\u4e2d\u5c71\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb (\u6307\u5c0e\u6559\u6388\uff1a\u694a\u660c\u5f6a\u6559\u6388) [\u4f73\u4f5c] \u8a31\u73ee\u8431 \u591a\u6a5f\u5668\u4eba\u5728\u6a39\u7d50\u69cb\u4e0a\u6700\u5c0f\u5316\u6700\u5927\u5ef6\u9072\u5de1\u908f\u8abf\u5ea6 \u570b\u7acb\u4e2d\u592e\u5927\u5b78\u8cc7\u8a0a\u5de5\u7a0b\u5b78\u7cfb (\u6307\u5c0e\u6559\u6388\uff1a\u694a\u6667\u742e\u6559\u6388) \u738b\u5ee3\u548c \u7d50\u5408\u9810\u6e2c\u4e4b\u7dda\u4e0a\u6d88\u9632\u54e1\u554f\u984c\u65bc\u6a39\u72c0\u7d50\u69cb \u570b\u7acb\u967d\u660e\u4ea4\u901a\u5927\u5b78\u8cc7\u8a0a\u7ba1\u7406\u7814\u7a76\u6240 (\u6307\u5c0e\u6559\u6388\uff1a\u9673\u67cf\u5b89\u6559\u6388\u3001\u5289\u5411\u7444\u6559\u6388) \u7a0b\u81f3\u69ae \u89e3\u78bcPC1\u7684\u529b\u91cf\uff1a\u4e00\u7a2e\u5feb\u901f\u6e96\u78ba\u4e26\u57fa\u65bc\u5171\u8b8a\u7570\u7684Hi-C\u8cc7\u6599A_B\u67d3\u8272\u9ad4\u5340\u5ba4\u8fa8\u5225\u65b9\u6cd5 \u570b\u7acb\u653f\u6cbb\u5927\u5b78\u8cc7\u8a0a\u79d1\u5b78\u7cfb (\u6307\u5c0e\u6559\u6388\uff1a\u5f35\u5bb6\u9298\u6559\u6388) […]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":25,"menu_order":1,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"http:\/\/www.aact.org.tw\/index.php\/wp-json\/wp\/v2\/pages\/144"}],"collection":[{"href":"http:\/\/www.aact.org.tw\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"http:\/\/www.aact.org.tw\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"http:\/\/www.aact.org.tw\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/www.aact.org.tw\/index.php\/wp-json\/wp\/v2\/comments?post=144"}],"version-history":[{"count":39,"href":"http:\/\/www.aact.org.tw\/index.php\/wp-json\/wp\/v2\/pages\/144\/revisions"}],"predecessor-version":[{"id":1791,"href":"http:\/\/www.aact.org.tw\/index.php\/wp-json\/wp\/v2\/pages\/144\/revisions\/1791"}],"up":[{"embeddable":true,"href":"http:\/\/www.aact.org.tw\/index.php\/wp-json\/wp\/v2\/pages\/25"}],"wp:attachment":[{"href":"http:\/\/www.aact.org.tw\/index.php\/wp-json\/wp\/v2\/media?parent=144"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}