學歷

M.S., National Chung Hsing University

研究專長

資料結構、影像處理、演算法

研究領域

Data Structure

學術著作

(1) 會議論文:
1. T. S. Tsui, Y. P. Chu and C. C. Lin, (1984): “Some improving of Trie Hashing and its Application”, ICS, R.O.C., pp. 902-907.
2. Y. P. Chu, T. S. Tsui and C. C. Lin, (1985): “Some Properties of Multi-ary Trie Hashing”, 5th ICMM’85, U.S.A., p. 80
3. Y. P. Chu, T. S. Tsui and C. C. Lin, (1985): “An Adaptive Algorithm to decide the Most Appropriate Packet Size”, IECON’85, IEEE, U.S.A.
4. Y. P. Chu, T. S. Tsui and C. C. Lin, (1985): “Analysis of Finding the Maximum Transported Information by Searching Table in Computer Networks”, NCS, R.O.C., pp 1170-1174.
5. Y. P. Chu, T. S. Tsui and C. C. Lin, (1991): “An Adaptive Method to Increase the Throughput in Computer Networks”, ISMM, U.S.A., pp 234-237.
6. T. S. Tsui, M. F. Ho and C. C. Lin, (1991): “A Method to Transform Raster to Vectors”, ISMM, U.S.A., pp 180-184.
7. T. S. Tsui, C. C. Lin and Jen-Yan Chen, (1992): “A Method for Finding the Curve Surface of Gravel Bed under Free-overfall Water Flow”, 1992 Workshop on Computer Application, R.O.C., p. 27.
8. Ta-Shan Tsui, 2002, A note on mc-DFA and their implementations, International Mathematics Conference and Annual Meeting of Mathematical Society of R.O.C., Taichung, Taiwan, R.O.C., p.63.


　 (2) 期刊論文：
1. Y. P. Chu, T. S. Tsui and C. C. Lin, (1984): “Some Mathematical Properties of Multi-ary Trie Hashing”, Journal of Science and Engineering, NCHU, R.O.C., 21, pp. 173-188.
2. Yi-Shiung Yeh, Shyr-Shen Yu and Ta-Shan Tsui, 2003, The Complete-Tree-Like-Matching mc-DFA and their Implementation, Journal of Interdisciplinary Mathematics, Vol.6, No.2, pp.159—181.
3. Ta-Shan Tsui, Shyr-Shen Yu and Yi-Shiung Yeh, 2003, A Note on mc-DFA and Its Minimization, Journal of Information & Optimization Sciences, Vol.24, No.3, pp.497—505. (EI)
4. Yi-Shiung Yeh and Ta-Shan Tsui, 2004, A Concurrent Multi-string matching from Multi-text Algorithm based on the Algorithm of Hamiltonian Path Problem and DNA Computation, Journal of Discrete Mathematical Sciences & Cryptography, Vol.7, No.1, pp.71-96.