Page 73 - profile2014.indd

研究員
徐讚昇 Tsan-sheng Hsu

Research Fellow
Ph.D., Computer Sciences, University of Texas at Austin
Tel: +886-2-2788-3799 ext. 1701 Fax: +886-2-2782-4814
Email: tshsu@iis.sinica.edu.tw
http://www.iis.sinica.edu.tw/~tshsu

Research Description ● Research Fellow, Institute of
Information Science, Academia
My current work concerns graph theory and its applications, the design, analysis, implementa- Sinica (June 2003-)
tion and performance evaluation of algorithms, and data-intensive computing. ● Director, Computing Center, Aca-
demia Sinica (February 2008-Au-
Graph theory and its applications: gust 2010)
Graphs model many important applications and are also tools to solve many other theoretical ● Deputy Director, Institute of
problems. We often start with probing fundamental theoretical problems such as the structures Information Science, Academia
of graphs with certain properties. With these properties, we then usually design e cient algo- Sinica (August 2002-June 2004)

rithms and solve applications. One important problem we are interested right now is e cient

epidemic simulation. ● Associate Research Fellow,
Institute of Information Science,
Design, analysis, implementation and performance evaluation of algorithms: Academia Sinica (March 1997-
June 2003)
Algorithm is one of the cores of computer sciences. We are interested in all aspects of researches
in algorithms which include nding new algorithms for interesting problems and designing ef- ● Assistant Research Fellow,

cient implementations to solve real-world applications. We are interested in both sequential, Institute of Information Science,

Academia Sinica (October 1993-
parallel and distributed algorithms. March1997)
Data-intensive computing:
With the rapid development of computer and communication technology, it has become much
easier to access or store massive amounts of data electronically. We are interested in the research problems concerning e cient computation of

massive data which include data privacy, issues in large scale social networks and classical computer games. In data privacy, we are developing

formal models and practical systems for privacy protection. We also wish to nd e cient algorithms for secure multi-party computation. In large

scale social network, we wish to study various issues which include e cient simulation and dynamic processing of social networks. In classical

computer games, we study memory-e cient algorithms for constructing and veri cation of huge endgame databases, and better search algo-

rithms for games using insights from domain knowledge. It is worth while noting that our researches in massive data often bene ts from results

obtained from our studies in graph theory and algorithm.
Publications
1. Pei-Chi Huang, Hsin-Wen Wei, Wan-Chen Lu, Wei-Kuan Shih 6. Bo-Nian Chen, Pangfeng Liu, Shun-Chin Hsu and Tsan-sheng
and Tsan-sheng Hsu, “Smallest Bipartite Bridge-connectivity Hsu, “Aggregating Consistent Endgame Knowledge in Chi-
Augmentation,” Algorithmica, volume 54, number 3, pages nese Chess”, Knowledge-Based Systems, volume 34, pages
353-378, 2009. 34--42, October 2012.
2. I-Cheng Wang, Chih-Hao Shen, Justin Zhan, Tsan-sheng Hsu, 7. Tseng-Yi Chen, Hsiu-Lien Yeh, Hsin-Wen Wei, Mei-ju Sun,
Churn-Jung Liau and Da-Wei Wang, “Towards Empirical As- Tsan-sheng Hsu and Wei-Kuan Shih, “An Effective Monitor-
pects of Secure Scalar Product,” IEEE Transactions on Sys- ing Framework and User Interface Design,” to appear in Soft-
tems, Man, and Cybernetics Part C: Applications and Reviews, ware: Practice and Experience.
pages 440-447, 2009.
8. T.-s. Hsu, C.-J. Liau, and D.-W. Wang, “A Logical Framework
3. Yen-Chiu Chen, Hsin-Wen Wei, Pei-Chi Huang, Wei-Kuan for Privacy-Preserving Social Network Publication,” to appear
Shih and Tsan-sheng Hsu, “The Bridge-connectivity Augmen- in Journal of Applied Logic.
tation with a General Partition Constraint,” Theoretical Com- 9. Chih-Hsuan Hsu, Cho-Chin Lin and Tsan-sheng Hsu, “Adapt-
puter Science, volume 411, pages 2878--2889, 2010.
able Scheduling Algorithm for Grids with Resource Redeploy-
4. Bo-Nian Chen, Bing-Jie Shen and Tsan-sheng Hsu, “Chi- ment Capability,” to appear in Journal of Grid Computing.
nese Dark Chess,” International Computer Game Association
10. Jr-Chang Chen, Ting-Yu Lin, Bo-Nian Chen, and Tsan-sheng
(ICGA) Journal, volume 33, number 2, pages 93-106, 2010.
Hsu, “Equivalence Classes in Chinese Dark Chess End-
5. M.-T. Tsai, T.-C. Chern, J.-H. Chung, C.-W. Hsueh, H.-S. Kuo, games,” to appear in IEEE Transactions on Computational
C.-J. Liau, S. Riley, B.-J. Shen, D.-W. Wang, C.-h. Shen and Intelligence and AI in Games.
Tsan-sheng Hsu, “Efficient Simulation of the Spatial Trans-

mission Dynamics of Influenza”, PLoS ONE , 5(11):e13292,

2010.

73