Intelligent Agent Systems LabInstitute of Information ScienceAcademia SinicaGOING

[中文版] [English Version]

 
Vita
Education
Experience
Research Interests
Awards
Publications
  Biological Computing
  Biological Literature Mining
  Natural Language
Processing, and e-Learning
  Algorithms
   
 
 


Wen-Lian Hsu

Professor, IEEE Fellow
Distinguished Research Fellow
Institute of Information Science,
Academia Sinica
Taipei, Taiwan, R. O. C.
Phone:886-2-27883799 ext.1804
Fax:886-2-27824814
E-mail:hsu@iis.sinica.edu.tw

Vita

Wen-Lian Hsu received a B.S. from the Department of Mathematics, National Taiwan University in 1973. He received an M.S. and a Ph.D. in operations research from Cornell University in 1978 and 1980, respectively. From 1979 to 1980, he worked as a research associate in the Center for Operations Research and Econometrics (CORE) at Universite Catholique de Louvain, Belgium. In 1980, he joined Northwestern University as an assistant professor and was promoted to tenured associate professor in 1986. He joined the Institute of Information Science as a research fellow in 1989.

Dr. Hsu's earlier research while in Northwestern University is focused on graph algorithms. His main contribution is on perfect graphs and special classes of intersection graphs. Most of his publications appear in JACM and SIAM J. Computing. Recently, he invented the PC-tree data structure to design very efficient algorithms in planar graphs and intersection graphs. In the meantime, he has applied similar techniques to tackle computational problems in Biology such as error-tolerant algorithms in DNA sequence analysis.

Right after joining the institute in 1989, he initiated the project ``intelligent Chinese phonetic input system'' (in cooperation with K. J, Chen), aiming at resolving a major bottleneck in the computerization of Chinese language -- the input method. A software resulted from this project, 自然輸入法(GOING), achieved a hit ratio close to 96% and was selected as one of the ten best Chinese computer products of Taiwan in 1993. This software has been widely used in Taiwan and the number of downloads in PC Home web station is close to 600,000. Later, he moved into the research of Intelligent Agent on the Internet, and produced the Math. Problem Solving Agent in 1997, and a Chinese natural language Q & A system, @skbots, in 1999. He is currently working on DNA sequence analysis, Genome knowledge base and intelligent knowledge management systems.

Dr. Hsu has published in various top-notch journals in discrete mathematics, operations research and computer science. He has been invited to deliver lectures in many international conferences. He has been the conference chairs of ISAAC'91 and COCOON'98, ITS’06 and has been involved in the editorship of the following journals: Managing Editor of Journal of Information Science (1995-2001), International Journal of Foundation of Computer Science (1993-2002), Information Processing Letters (2001-), and International Journal of Bioinformatics Research and Applications (2005-). He has been the president of the Artificial Intelligence Society in Taiwan (2001-2002).

 

Education
  • Ph.D. Cornell University, Operations Research, 1980(Advisor - George L. Nemhauser)

  • M.S.Cornell University, Operations Research, 1978

  • B.S.National Taiwan University, Mathematics, 1973


Experience

  • 2008-present Professor, Distinguished Research Fellow, Institute of Information Science, Academia Sinica.

  • 1989-2008 Professor, Research Fellow, Institute of Information Science, Academia Sinica.

  • 2001-present Professor (joint appointment), Department of Computer Science, National Tsing-Hua University.

  • 1997-1998 Acting Director, Institute of Information Science, Academia Sinica

  • 1996-1997 Visiting Professor, CSLI center, Stanford University.

  • 1986-1989 Associate Professor (with tenure), Department of IE/MS,Northwestern University.

  • 1980-1986 Assistant Professor, Department of IE/MS,Northwestern University.

  • 1979-1980 Postdoctoral Fellow, Center for Operations Research and Econometrics(CORE), Universite Catholique de Louvain.

  • 1977-1979 Research Assistant, Cornell University.

  • 1975-1977 Teaching Assistant, Cornell University


Research Interests

Our main research topic is natural language understanding. Nearly all of the following systems require certain understanding capability to achieve high precision rates: semantic search on the web, Chinese voice input and output, spelling checker and machine translation. Our Chinese input system--GOING, which automatically translates a chu-in sequence into characters with a hit ratio close to 96%, is widely used in Taiwan. It received the Distinguished Chinese Information Product Award(中文傑出資訊產品獎)in 1993. In PC Home software download area, GOING has been downloaded 600,000times. Within the top 10 download software, it is the only one developed domestically.

Our model for concept understanding can utilize heterogeneous knowledge representation systems. We have extended our model to that on Internet intelligent agents, especially on the database agents. These software agents will become indispensable in the semantic search engine and the electronic commerce on the Internet. Another direction we are moving into is the development of educational tutoring systems. We have successfully implemented a system that can understand and solve (and explain how so solve) the mathematics word problems of primary school (grade 3).

Our major achievement is the development of a knowledge representation kernel, InfoMap, for the semantic analysis of natural language, which can be applied to a wide variety of application systems. We are currently utilizing this kernel to develop an Intelligent Knowledge Management System over the World Wide Web. There are several technology transfer programs currently going on with private companies.

In DNA sequence analysis, we have been studying the physical mapping and the clone assembly problem. When the experimental error is within 15%, we have developed an error-tolerant algorithm for the clone assembly problem (as well as the physical mapping problem) that can determine the relative positions of each clone (respectively, each probe) given the clone overlapping relationships. By combining our knowledge management tools, InfoMap, and natural language agent, we are currently constructing a Question Answering system for genomic and proteomic knowledge. We shall further extend this system to help biologist to execute certain natural language scripts automatically in their dry labs. Finally, we shall utilize InfoMap to facilitate the accurate search of various relationships in biological literature.
 

Awards
  • Research Initiation Award of the National Science Foundation, 1981

  • Intelligent Chinese Input Software -- Top ten Most Distinguished Chinese computer products(十大傑出中文資訊產品獎)in Taiwan, 1993.

  • Outstanding Research Awards(國科會傑出研究獎) by the National Science Council (NSC) of Taiwan in 1991~1992

  • Outstanding Research Awards(國科會傑出研究獎)by NSC, 1994~1995

  • Outstanding Research Awards(國科會傑出研究獎)by NSC, 1996~1997.

  • K.T. Lee Stone Penetration Award(李國鼎穿石獎)in 1999

  • NSC Designated Research Fellow(國科會特約研究員獎)in 1999

  • NSC Appointed Outstanding Research Award(國科會傑出特約研究員獎)in 2005

  • Academia Sinica Investigator Award(中央研究院深耕計畫獎)in 2005

  • IEEE Fellow 2006

  • Teco-Award (東元獎)  in 2008

 

Publications

Biological Computing

Biological Literature Mining

 

Natural Language Processing, and e-Learning
 


Algorithms

  • Wen-Lian Hsu, “A Linear Time Algorithm for Finding a Maximal Planar Subgraph Based on PC-Trees,” Proceedings of COCOON’05, (2005).
  • W. L. Hsu and R. McConnell, "PQ Trees PC Trees and Planar Graphs," Handbook of Data Structures and Applications, Dinesh P Mehta and Sartaj Sahni ed., (2003).
  • W. L. Hsu, “An Efficient Implementation of the PC-Tree Algorithm of Shih & Hsu's Planarity Test,” Technical Report, Institute of Information Science, Academia Sinica,  (2003).
  • W. L. Hsu and R. McConnell, “PC-trees and circular-ones arrangementsTheoretical Computer Science 296(1), 99-116, (2003).
  • W. L. Hsu, “PC-Trees and Maximal Planar Subgraphs,” Keynote speech, ICS’02, Hualien, (2002).
  • W. L. Hsu, "A simple test for the consecutive ones property", Journal of Algorithms 43, 1-16, (2002).
  • W. L. Hsu, “PC-trees vs. PQ-trees,” invited talk, Workshop on Graph Structures and Algorithms, also, appeared in Lecture Notes in Computer Science 2108, 207-217, (2001).
  • W. L. Hsu and T. H. Ma, " Fast and simple algorithms for recognizing chordal comparability graphs and interval gragh," SIAM J. Comput. 28, 1004-1020, (1999).
  • W. K. Shih and W. L. Hsu, "A new planarity test," Theoretical Computer Science 223, 179-191, (1999).
  • W. L. Hsu, "Perfect graphs," Advances in the Theory of Computation and Computational Mathematics 1, 81-122, (1996).
  • W. L. Hsu,, "On-line recognition of interval graphs", Lecture Notes in Computer Science 1120, 27-38, (1996).
  • W. L. Hsu, "O(mn) algorithms for the recognition and isomorphism problems on circular-arc graphs," SIAM J. Comput24, 411-439, (1995).
  • W. L. Hsu, "Finding maximal planar subgraphs in linear time", Lecture Notes in Computer Science 1004, ISAAC ' 95, (1995).
  • W. L. Hsu and J. P. Spinrad, "Independent sets in circular-arc graphs," J. Algorithms 19, 145-160, (1995).
  • W. K. Shih and W. L. Hsu, " A simple test for planar graphs," Proceedings of the International Workshop on Discrete Math. and Algorithms, University of Hong Kong, 110-122, (1993).
  • K. H. Tsai and W. L. Hsu, "Fast algorithms for the minimum dominating set problem on permutation graphs," Algorithmica 9, (1993), 601-614.
  • W. L. Hsu, "A new test for interval graphs", Lecture Notes in Computer Science 657, 11-16, (1992).
  • W. K. Shih, W. L. Hsu and T. C. Chen, "An O(n2 logn ) algorithm for the Hamiltonian cycle problem on circular-arc graphs," SIAM J. Comput 21, 1026-1046, (1992).
  • W. L. Hsu and K. H. Tsai, "Linear time algorithms on circular-arc graphs," Information processing Letters 40, 123-129, (1991).
  • W. K. Shih and W. L. Hsu, "An approximation algorithm for coloring circular-arc graphs," SIAM conference on Discrete Mathematics, San Francisco, (1990).
  • W. K. Shih and W. L. Hsu, "An O(nlogn + mloglogn) algorithm for finding a maximum weight clique in circular-arc graphs," Infor. Process. Letters, 129-134, (1989).
  • W. K. Shih and W. L. Hsu, "An O(n1.5) algorithm for coloring proper circular-arc graphs," Discrete Applied Math 25, 321-323, (1989).
  • K. H. Tsai and W. L. Hsu, "A linear time algorithm for the maximum two track assignment problem," proc. 27th Allerton Conference on Communication, Control and Computing, 291-300, (1989).
  • C. Gabor, W. L. Hsu and K. Supowit, "Recognizing circle graphs in polynomial time," J. Assoc. Comput. Machin., 435-473, (1989).
  • W. L. Hsu, "The coloring and maximum independent set problems on planar perfect graphs," J. Assoc. Comput. Machin., 535-563, (1988).
  • W. L. Hsu, "Recognizing planar perfect graphs," J. Assoc. Comput. Machin. 34, 255-288, (1987).
  • W. L. Hsu, "Decomposition of perfect graphs," J. Combin. Theory (B) 43, 70-94, (1987).
  • W. L. Hsu, "Coloring planar perfect graphs by decomposition," Combinatorica 6 (4), 381-385, (1986).
  • W. L. Hsu, "Maximum weight clique algorithms for circle graphs and circular-arc graphs," SIAM J. Computing 14, 224-231, (1985).
  • W. L. Hsu, "Efficient algorithms for the maximum weight clique problem on circular-arc graphs and circle graphs," Progress in Graph Theory, J. A. Bondy and U. S. R. Murty ed., 335-345, (1984).
  • W. L. Hsu, "Berge's strong perfect graph conjecture on special graphs: A Survey," Annals of Discrete Math. 21, 107-117, (1984).
  • W. L. Hsu, "Approximation algorithms for the assembly line crew scheduling problem," Math. of Operations Research 9, 376-383, (1984).
  • W. L. Hsu and G. L. Nemhauser, "Algorithms for maximum weight cliques, minimum weighted clique covers and cardinality colorings of claw-free perfect graphs," Annals of Discrete Math. 21, 317-329, (1984).
  • Naamad, W. L. Hsu and D. T. Lee, "On the maximum empty rectangle problem," Discrete Applied Math. 8, 267-277, (1984).
  • W. L. Hsu, "On the general feasibility test of scheduling lot sizes for several products on one machine,' Management Science 29, 93-105, (1983).
  • W. L. Hsu, "The distance-domination numbers of trees," Operations Research Letters 1, (3), 96-100, (1982).
  • W. L. Hsu and G. L. Nemhauser, "A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs," (with G. L. Nemhauser), Discrete Math. 38, 65-71, (1982).
  • W. L. Hsu, Y. Ikura and G. L. Nemhauser, "A polynomial algorithm for maximum weighted vertex packing on graphs without long odd cycles," Math. Prog. 20, 225-232, (1981).
  • W. L. Hsu, "How to color claw-free perfect graphs," Annals of Discrete Math. 11, 189-197, (1981).
  • W. L. Hsu and G. L. Nemhauser, "Algorithm for minimum covering by cliques and maximum cliques in claw-free perfect graphs," Discrete Math. 37, 181-191, (1981).
  • W. L. Hsu and G. L. Nemhauser, "Easy and hard bottleneck location problems," Discrete Applied Math.   1, 209-215, (1979).

      

 


View My Stats