Page 75 - untitled

஢ၲก

Hsu, Wen-Lian ਿ ͉ ༟ ࣘ Research Description
Research Description
ਿ ͉ ༟ ࣘ

ᔖcc၈j޼ӺࡰResearch Fellow (1989--) In graph algorithms, we have done extensive knowledge-based algorithm to improve the accuracy
and groundbreaking work on two fundamental of protein secondary structure prediction problem
௰৷ኪዝj Ph.D., Operations Research, classes of special graphs - planar graphs and inter- to 82%. We have successfully integrated biological
Cornell University (1980) val graphs and their related graphs (such as circular knowledge and machine learning techniques into
arc graphs and circle graphs). We introduced a new many structure prediction problems
ཥcc༑j+886-2-2788-3799 ext. 1804 data structure [2], PC-tree, which greatly simpli-
In natural language processing we have de-
fies the recognition of these two classes. PC-trees
ෂccॆj+886-2-2782-4814 signed a Chinese input system - GOING, which
algorithms can unify the test of the consecutive
automatically translates a phonetic (or Pinyin) se-
ཥɿڦᇌjhsu@iis.sinica.edu.tw ones property and the circular ones property [10]. Research Fellows
Furthermore, PC-tree is a natural representation for quence into characters with accuracy close to 96%,
ၣccࠫjhttp://www.iis.sinica.edu.tw/IASL/hsu/eindex.html planar graph embedding. Our new planarity test is widely used in Taiwan. It received the Distin-
guished Chinese Information Product Award€ʕ
based on PC-trees is simple, elegant and yields a
˖௫̈༟ৃପۜᆤin 1993. Since 1999, in PC
linear time algorithm for finding maximal planar
޼Ӻᔊʧ subgraphs. Home alone, it has been downloaded close to one
޼Ӻᔊʧ
million times. Another achievement is the develop-
• Wen-Lian Hsu received a B.S. from the Depart- In DNA sequence analysis, we have produced ment of a knowledge inference kernel, InfoMap, for
Research Fellows
m Ңٙ޼Ӻ˴ࠅމࠇၑ͛يኪɪٙஐͣሯҏΐe an error-tolerant algorithm for the physical mapping the semantic analysis of natural language, which can
ment of Mathematics, National Taiwan University
in 1973. He received an M.S. and a Ph.D. in opera- ഐ࿴ěঐʱؓd͛ي˖ᘠઞਖdІ್ႧԊଣ༆i and the clone assembly problem, which can accom- be applied to a wide variety of application systems
tions research from Cornell University in 1978 and ̤̮dɰऒᓳྡሞစၑجfҎૐঐഐΥစၑج˸ʿ
1980, respectively. From 1979 to 1980, he worked modate four types of errors: false positives, false in natural language processing, biological knowl-
as a research associate in the Center for Operations ႧԊҏΐʱؓɪٙ຾᜕࿁ஐͣሯҏΐٙจ່Ϟהഹ negatives, chimeric clones and non-unique probes. edge base, automation of pipeline experiment, and
Research and Econometrics (CORE) at Universite ኈf We have also used an iterative relaxation technique e-learning. In 2005, we won the first place among
Catholique de Louvain, Belgium. In 1980, he joined to develop an error-tolerant algorithm for the back- 9 teams in the first Chinese Question Answering
Northwestern University as an assistant professor ίྡሞစၑجɪdҢࡁ೯࢝̈ɓࡈ༟ࣘഐ࿴ bone assignment problem in NMR protein struc- contest in NTCIR held in Tokyo, Japan. In 2006,
and was promoted to tenured associate professor in ˜PC-tree™dঐ੄ɽඎᔊʷ፫Ⴉ̻ࠦྡձਜගྡٙ
1986. He joined the Institute of Information Science ture determination. Finally, we have developed a we won the first place among 13 teams for the city
as a research fellow in 1989. ѢᗭܓfPC-tree̙˸ܘІ್ήڌ༺̻ࠦྡdԨ̙˸ U corpus in SIGSAN Chinese Word Segmentation
୕Υஹᚃɓၾᐑًɓٙ፫ᗆfҢࡁл͜PC-treeהண Contest.
• Right after joining IIS in 1989, he initiated the proj- ࠇ̈Ը̻ٙࠦྡ፫Ⴉجd฽މᔊఊeٜᝈdԨᔟ˸
ect ``intelligent Chinese phonetic input system'' (in Selected Publications
Selected Publications
cooperation with K. J, Chen), aimed at resolving a ೯࢝̈ɓࡈœ฽ɽ̻ࠦྡٙᇞ׌စၑجf
major bottleneck in the computerization of Chinese
language -- the input method. A software resulted ίਿΪҏΐɪdҢࡁ೯࢝̈ɓࢁ࢙፹စၑجd 1. W. L. Hsu, "Maximum weight clique algorithms for circle graphs and 14. W. L. Hsu and R. McConnell, “PC-trees and circular-ones arrange-
from this project, І್፩ɝج(GOING), achieved ίྼ᜕Ⴌࢨʔ൴ཀ15%ٙઋرɨdঐ੄л͜clone ၾ circular-arc graphs," SIAM J. Computing 14, (1985), 224-231. ments” Theoretical Computer Science 296(1), (2003), 99-116.
an accuracy close to 96% and has since revolution- cloneʘගٙࠠᛌᗫڷࠇၑ̈዆ݬDNAҏΐʕ΢ࡈ 2. W. L. Hsu, "Decomposition of perfect graphs," J. Combin. Theory 43, 15. W. F. Lu and W. L. Hsu. “A Test for the Consecutive Ones Property on
ized the phonetic input for Chinese. Later, he moved (1987), 70-94. Noisy Data - Application to Physical Mapping and Sequence Assem-
into the research of Intelligent Agent on the Internet, cloneٙɽߧЗໄfϤ̮dҢࡁл͜ˀᔧᕦύجணࠇ 3. W. L. Hsu, "Recognizing planar perfect graphs," J. Assoc. Comput. bly,” Journal of Computational Biology 10(5), (2004), 709-735.
and produced the Math. Problem Solving Agent in ̈ɓࢁNMRஐͣሯഐ࿴৶฀࿁Ꮠ࢙ٙ፹စၑجf Machin. 34 (1987), 255-288. 16. K. P. Wu, H. N. Lin, J. M. Chang, T. Y. Sung, and W. L. Hsu, “HY-
1997, and a Chinese natural language Q & A system, ίஐͣሯɚܓ٤ගഐ࿴ཫ಻ɪdҢࡁɰлٝ͜ᗆࢫ 4. W. L. Hsu, "The coloring and maximum independent set problems on PROSP: A Hybrid Protein Secondary Structure Prediction Algorithm
@skbots, in 1999. He is currently working on DNA ٙҦ̷dਗ਼๟ᆽܓ౤؁Ց82%˸ɪfҢࡁί஢εഐ planar perfect graphs," J. Assoc. Comput. machin., (1988), 535-563. - a Knowledge-Based Approach,” Nucleic Acids Research 32(17),
and protein sequence analysis, proteomic knowledge 5. C. Gabor, W. L. Hsu and K. Supowit, "Recognizing circle graphs in 5059-5065, (2004).
base and biological literature mining systems. ࿴ཫ಻ਪᕚɪϓ̌ήഐΥə͛يٝᗆၾዚኜኪ୦Ҧ polynomial time," J. Assoc. Comput. machin., (1989), 435-473. 17. Chun-Hung Lu, Shih-Hung Wu, LiongYu Tu, Wen-Lian Hsu, “On-
2
̷dਗ਼๟ᆽܓપΣอٙ৷ࢤf 6. W. K. Shih, W. L. Hsu and T. C. Chen, "An O(n logn) algorithm for tological Support in Modeling Learners‘ Problem Solving Process,”
• Dr. Hsu has published in various top-notch journals the Hamiltonian cycle problem on circular-arc graphs," SIAM J. Com- Journal of Educational Technology & Society 8(4), 64-74, (2005).
in discrete mathematics, operations research and ίІ್ႧԊ˙ࠦdҢࡁʃଡ଼ה೯࢝ٙءࠪІਗ put 21, (1992), 1026-1046. 18. Hsin-Nan Lin, Kuen-Pin Wu, Jia-Ming Chang, Ting-Yi Sung and
computer science. He has been invited to deliver 7. W. L. Hsu, "Chinese parsing in a phoneme-to-character conversion Wen-Lian Hsu, "GANA – A Genetic Algorithm for NMR Backbone
lectures at many international conferences. He ᔷ਷οٙழ᜗œІ್፩ɝجd͍ᆽଟટڐ96%d system based on semantic pattern matching," International Journal Resonance Assignment," Nucleic Acids Research 33(14), 4593-4601,
received the Outstanding Research Award from the ಀᐏ੻1993ϋ௫̈ʕ˖༟ৃପۜᆤfІ್፩ɝجҷ on Computer Processing of Chinese and Oriental Languages 40, (2005).
National Science Council in 1991, 1994 and 1996 ᜊə਷ɛႩމءࠪ፩ɝ୆ᖟᗭኪٙᝈׂd౷ཁա (1995), 227-236. 19. Hsin-Nan Lin, Jia-Ming Chang, Kuen-Pin Wu, Ting-Yi Sung and Wen-
and was elected as an outstanding research fellow Ցɽ଺ٙฌ͜fί2000ϋ3˜10໮પ̈ၣ༩е൬ɨ 8. W. L. Hsu, "O (mn) algorithms for the recognition and isomorphism Lian Hsu, "A knowledge-based hybrid method for protein secondary
by the NSC in 1999. He was the recipient of the fi rst problems on circular-arc graphs," SIAM J. Comput 24, (1995), structure prediction based on local prediction confi dence," Bioinfor-
œҽ਷ཻ߈ͩᆤ for his contribution in natu- ༱dίɓ඄ʘʫϞՇຬεɛίPC Homeၣ१ɨ༱d 411-439. matics 21, 3227-3233, (2005).
ral language processing systems. He has been the ৷֢הϞɨ༱ழ᜗ٙୋɚΤdͦۃᐼɨ༱ϣᅰʊટ 9. W. L. Hsu and J. P. Spinrad, "Independent sets in circular-arc graphs," J. 20. Tzong-Han Tsai, Shih-Hung Wu, Wen-Chi Chou, Yu-Chun Lin, Ding
conference chairs of ISAAC'91 and COCOON'98 ڐɓϵຬfҢࡁ̤ɓධࠠࠅٙϓ؈݊d೯࢝̈ɓࢁ Algorithms 19, (1995), 145-160. He, Ting-Yi Sung, Wen-Lian Hsu, “Various Criteria in the Evaluation
and has been involved in the editorship of the fol- œІ್ႧԊႧจʱؓٙˏᏗ˸ʿ޴ᗫٙœ౽ᅆۨ 10. W. K. Shih and W. L. Hsu, "A new planarity test," Theoretical Com- of Biomedical Named Entity Recognition,” to appear in BMC Bioin-
lowing journals: Journal of Information Science puter Science 223, (1999), 179-191. formatics.
(1995-2001), International Journal of the Founda- ٝᗆڌ༺ӻ୕(InfoMap)d̙˸ቇ͜׵஢εᏐ͜ 11. W. L. Hsu and T. H. Ma, "Substitution decomposition on chordal 21. Kuen-Pin Wu, Jia-Ming Chang, Jun-Bo Chen, Chi-Fon Chang,
tion of Computer Science (1993-2002), Information ӻ୕ٙٝᗆ၍ଣfί2005ϋ˚͉؇ԯᑘБٙୋɓ graphs and its application," SIAM J. Comput. 28, (1999), 1004-1020. Wen-Jin Wu, Tai-Huang Huang, Ting-Yi Sung and Wen-Lian Hsu,
Processing Letters (2001-), International Journal of ֣œʕ˖ਪഈӻ୕ˢᒄdҢࡁྼ᜕܃ᐏ੻9ඟʕ 12. W. L. Hsu, "A simple test for the consecutive ones property", J. Algo- “RIBRA-an Error-Tolerant Algorithm for the NMR Backbone Assign-
Bioinformatics Research and Applications (2004-). ୋɓΤfҢࡁ͍ίਗ਼வࢁӻ୕Ꮠ͜Ց͛ي༟ৃٙ˖ rithms 42, 1-16, (2002). ment Problem,” to appear in Journal of Computational Biology; also,
He was the president of the Artifi cial Intelligence 13. J. L. Tsai and W. L. Hsu, “Applying an NVEF Word-Pair Identifi er to in Proceedings of RECOMB’05.
Society in Taiwan (2001-2002). In 2006, he was ᘠઞਖٙ޼ӺɪfϤ̮d2006ϋҢࡁਞ̋SIGHAN the Chinese Syllable-to-Word Conversion Problem,” in Proceedings of
elected an IEEE Fellow. ʕ˖ᓙ൚ˢᒄdίCity UႧࣘࢫɪᐏ੻13ඟʕୋɓ COLING’02, Taipei, (2002).
Τf

64 65