Tsan-sheng Hsu

Dr. Tsan-sheng Hsu


Research Focus & Metrics

Academic Career Length

37Years (1990-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2010 in ICGA Journal: The Journal of the Computer Games Community
Verified
Journal Article
Closed access
PDF file
BCBo-Nian Chen
Bo-Nian Chen
BSBing-Jie Shen
Bing-Jie Shen
THTsan-sheng Hsu
Tsan-sheng Hsu
Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan. email: f92025@csie.ntu.edu.tw . Department of Radiation Oncology, Far Eastern Memorial Hospital, Taipei, Taiwan. email: dale@iis.sinica.edu.tw . C

4 November 2010 in PLOS ONE
Verified
Journal Article
Open access
PDF file
MTMeng-Tsung Tsai
Meng-Tsung Tsai
TCTsurng-Chen Chern
Tsurng-Chen Chern
JCJen-Hsiang Chuang
Jen-Hsiang Chuang
CHChih-Wen Hsueh
Chih-Wen Hsueh
HKHsu-Sung Kuo
Hsu-Sung Kuo
THTsan-sheng Hsu
Tsan-sheng Hsu
Early data from the 2009 H1N1 pandemic (H1N1pdm) suggest that previous studies over-estimated the within-country rate of spatial spread of pandemic influenza. As large spatially resolved data sets are constructed, the need for efficient simulation code with which to investigate the spatial patterns of the pandemic becomes clear. Here, we present a significant improvement to the efficiency of an individual-based stochastic disease simulation framework commonly used in multiple previous studies. We quantify the efficiency of the revised algorithm and present an alternative parameterization of the model in terms of the basic reproductive number. We apply the model to the population of Taiwan and demonstrate how the location of the initial seed can influence spatial incidence profiles and the overall spread of the epidemic. Differences in incidence are driven by the relative connectivity of alternate seed locations. The ability to perform efficient simulation allows us to run a batch of simulations and take account of their average in real time. The averaged data are stable and can be used to differentiate spreading patterns that are not readily seen by only conducting a few runs.

17 April 2009 in IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews)
Verified
Journal Article
Closed access
IWI-Cheng Wang
I-Cheng Wang
CSChih-Hao Shen
Chih-Hao Shen
JZJustin Zhan
Justin Zhan
THTsan-sheng Hsu
Tsan-sheng Hsu
Churn-Jung LiauChurn-Jung Liau
Churn-Jung Liau
DWDa-Wei Wang
Da-Wei Wang
There is a fair amount of research about privacy, but few empirical studies about its cost have been conducted. In the area of secure multiparty computation, the scalar product has long been reckoned as one of the most promising alternatives to classic logic gates. The reason for this is that the scalar product is not only complete, which is as good as logic gates, but also much more efficient than logic gates. As a result, we set out to study the computation and communication resources needed for some of the most well-known and frequently referenced secure scalar product protocols, including the composite residuosity, the invertible matrix, the polynomial sharing, and the commodity-based approaches. In addition to the implementation details of these approaches, we analyze and compare their execution time, computation time, and memory and random number consumption. Moreover, Fairplay, the benchmark approach that implements Yao's circuit evaluation protocol, is also included in our experiments in order to demonstrate the potential for the scalar products to replace logic gates.

1 June 2000 in Algorithmica
Verified
Journal Article
Closed access
PDF file
CTC. Y. Tang
C. Y. Tang
MKM.-T. Ko
M.-T. Ko
CHC.-W. Ho
C.-W. Ho
THTsan-sheng Hsu
Tsan-sheng Hsu
SPS.-L. Peng
S.-L. Peng

9 May 2003 in International Journal of Medical Informatics
Verified
Journal Article
Closed access
YCYu-Cheng Chiang
Yu-Cheng Chiang
THTsan-sheng Hsu
Tsan-sheng Hsu
SKSun Kuo
Sun Kuo
CLChurn-Jung Liau
Churn-Jung Liau
DWDa-Wei Wang
Da-Wei Wang