專利商品網


    快速搜尋        



洪西進

個人網站
資訊工程系(所)
 
學經歷:
  學歷:
清華大學博士

經歷:
2009~迄今 國立台灣科技大學 資工系教授
2006~2009 國立聯合大學 電機資訊學院院長
1996/02~2001/07 台灣科技大學電機工程系教授
1989/08~1996/01 台灣科技大學電機工程系副教授
1989/08~1996/01 AT&T PMTS
 
專業技術
  平行暨容錯處理、多媒體系統與音樂合成、網路安全、VLSI設計、行動通訊、醫療應用
   
專利介紹
  一種手勢辨識追蹤方法  
本論文主要是透過DSP(Digital Signal Process)系統處理訊號的方式來對手勢進行......
 

  一種手勢辨識追蹤方法及其系統  
本創作針對以往在手勢定位上所使用的方法不足之處進行改進,將使用膚色比對時易受到背景光源干擾的缺點及樣......
 

  一種加殼程式偵測系統及其方法  
『加殼』,是一種軟體壓縮加密技術,在軟體工程中很普遍被使用。軟體工程師用此技術保護其開發之軟體與壓縮......
 

  一種電子裝置控制系統與其方法  
本系統在嵌入式系統(ARM)上開發手勢辨識,如此一來任何只要裝有接收器的3C產品,使用者只需要遠距離......
 

研究成果與計畫
 

期刊論文

1. J. F. Lin, S. J. Horng and T. W. Kao , "Generalized rotate sort on mesh-connected computers with multiple broadcasting using fewer processors," International Journal of High Speed Computing , Vol.7 , No.4 , pp.515-530 (1995) .  

2. S. S. Lee, S. J. Horng, H. R. Tsai and T. W. Kao , "Optimal computing Hough transform on a reconfigurable array of processors with wider bus networks," Pattern Recognition , Vol.29 , No.4 , pp.603-613 (1995).  

3. S. J. Horng, "Prefix computation and some related applications on mesh-connected computers with hyperbus broadcasting," Journal of Computing and Information , pp.366-388 (1995) .  

4. S. S. Tsai, S. J. Horng, and T. W. Kao , "Parallel algorithm for template matching on a mesh-connected computer with hyperbus broadcasting," Journal of Computing and Information , pp.344-365 (1995) .  

5. T. W. Kao, and S. J. Horng , "Optimal algorithms for computing articulation points and some related problems on a circular-arc graph," Parallel Computing , Vol.21 , pp.953-969 (1995) .  

6. T. W. Kao, S. J. Horng, Y. L. Wang and H. R. Tsai , "Designing efficient parallel algorithms on CRAP," IEEE Trans. on Parallel and Distributed Systems , Vol.6 , No.5 , pp.554-560 (1995) .  

7. T. W. Kao, S. J. Horng, and Y. L. Wang , "An O(1) time algorithms for computing histogram and hough transform on a cross bridge reconfigurable array of processors," IEEE Trans. on Systems, Man, Cybernetics , Vol.25 , No.4 , pp.681-687 (1995) .  

8. T. W. Kao, S. J. Horng and Y. H. Guo , "Constant time algorithms for graph connectivity problems on reconfigurable meshes using fewer processors," International Journal of High Speed Computing , Vol.8 , No.4 , pp.371-385 (1996) .  

9. H. R. Tsai, S. J. Horng, S. S. Lee, S. S. Tsai and T. W. Kao , "Parallel sorting algorithms on a hyper-channel broadcast communication Model," International Journal of High Speed Computing , Vol.8 , No.4 , pp.307-318 (1996) .  

10. S. J. Horng, "Generalized mesh-connected computers with hyperbus broadcasting for a computer network," IEICE Transactions on Information and Systems , Vol.E79-D , No.8 , pp.1107-1115 (1996) .  

11. H. R. Tsai, S. J. Horng, S. S. Lee, S. S. Tsai and K. W. Kao , "A constant time parallel hierarchical clustering algorithm on processor arrays with a reconfigurable bus system," Journal of Computing and Information , Vol.2 , No.1 , pp.536-560 (1996) .  

12. Y. H. Lee, and S. J. Horng , "O(1)-time algorithms for computing the chessboard distance transformation and the medial axis transformation on RAP," Journal of Computing and Information , Vol.2 , No.1 , pp.561-585 (1996) .  

13. S. J. Horng, and F. S. Jiang , "Finding generalized fibonacci cubes in faulty hypercubes," Journal of Computing and Information , Vol.2 , No.1 , pp.358-381 (1996) .  

14. S. S. Tsai, S. J. Horng , "Efficient embedding hypercube on arrangement graphs," Journal of Information Science and Engineering , Vol.12 , No.4 , pp.585-592 (1996) .  

15. T. W. Kao, and S. J. Horng , "The power of list ranking on a reconfigurable array of processors with wider bus networks," The Australian Computer Journal , Vol.28 , No.4 , pp.138-148 (1996) .  

16. S. S. Lee, S. J. Horng and H. R. Tsai , "Building a quadtree and its applications on a reconfigurable mesh," Pattern Recognition , Vol.29 , No.9 , pp.1571-1579 (1996) .  

17. Y. H. Lee, S. J. Horng, T. W. Kao, F. S. Jiang,, Y. J. Chen , "Parallel computation of exact Euclidean distance transform," Parallel Computing , Vo.22 , pp.311-325 (1996) .  

18. Y. H. Lee, and S. J. Horng , "The equivalence of the chessboard distance transform and the medial axis transform," International Journal of Computer Mathematics , Vol. 65, 1997, pp. 165-177 (1997) .  

19. Y. J. Chen, and S. J. Horng , "Medial axis transform on mesh-connected computers with hyperbus broadcasting," Computing, Vol. 59, No. 2, pp. 95-114 (1997) .  

20. F. S. Jiang, S. J. Horng and T. W. Kao , "Embedding of generalized Fibonacci cubes in Hypercubes with faulty nodes," IEEE Transactions on Parallel and Distributed Systems , Vol.8 , No.7 , pp.727-737 (1997) .  

21. T. W. Kao, and S. J. Horng , "Computing dominators on interval graphs," to appear in Journal of Information Science and Engineering (1997) .  

22. Y. H. Lee, S. J. Horng and T. W. Kao , "Parallel computing Euclidean distance transform on the mesh of trees and hypercube computer," Computer Vision and Image Understanding. Vol. 68, No. 1, Oct., pp. 109-119 (1997) .  

23. H. R. Tsai, S. J. Horng, S. S. Lee, S. S. Tsai and T. W. Kao , "Parallel hierarchical clustering algorithms on processor arrays with a reconfigurable bus system," Pattern Recognition , Vol.30 , No.5 , pp.801-815 (1997) .  

24. S. S. Lee, S. J. Horng and H. R. Tsai , "Image processing on a reconfigurable array of processors with wider bus networks," Pattern Recognition , Vol.30 , No.9 , pp.1521-1532 (1997) .  

25. H. R. Tsai, S. J. Horng, S. S. Tsai, T. W. Kao and S. S. Lee , "Solving algebraic path problem and some related graph problems on a hyper-bus broadcast network," IEEE Transactions on Parallel and Distributed Systems Vol. 8, No. 12, Dec. , pp. 1226-1235 (1997).  

26. Y. J. Chen, S. J. Horng, T. W. Kao and H. R. Tsai , "Parallel algorithm for the medial axis transform of binary images," Australian Computer Journal Vol. 30. No. 1, Feb., pp. 12-19 (1997) .  

27. H. R. Tsai, S. J. Horng, S. S. Tsai, S. S. Lee, T. W. Kao , "Optimal speed-up parallel image template matching algorithms on processor arrays with a reconfigurable bus system," Computer Vision and Image Understanding Vol. 71, No. 3, Sep., pp. 393-412 (1998) .  

28. Y. J. Chen, S. J. Horng, T. W. Kao and H. R. Tsai, "Parallel algorithm for the medial axis transform of binary images, " The Australian Computer Journal, Vol. 30. No. 1, Feb., pp. 12-19 ( 1998).  

29. H. R. Tsai, S. J. Horng, S. S. Tsai, S. S. Lee, T. W. Kao and C. H. Chen, "Parallel string matching algorithms on processor arrays with a reconfigurable bus system, " International Journal of Parallel and Distributed Systems and Networks, Vol. 1, No. 2, pp. 73-84 (1998).  

30. W. J. Tsaur and S. J. Horng, "Establishing secure Ethernet LANs using intelligent switching hubs in internet environments, " The Computer Journal, Vol. 41, No. 2, pp. 125-133 (1998).  

31. W. J. Tsaur and S. J. Horng, "A New Generalized Software Complexity Metric for Distributed Programs, " Information and Software Technology, Vol. 40, No. 5-6, pp. 259-269 (1998).  

32. H. R. Tsai, S. J. Horng, S. S. Lee, S. S. Tsai and T. W. Kao, "Fundamental Data Movement Operations and Its Applications on a Hyper-Bus Broadcast Network," Parallel Computing, Vol. 25, pp. 137-157 (1999).  

33. H. R. Tsai, and S. J. Horng, "Optimal Parallel Clustering Algorithms on a Reconfigurable Array of Processors with Wider Bus Networks, " to appear in Image and Vision Computing, 1999.  

34. Y. H. Lee, and S. J. Horng, "Optimal Computing the Chessboard Distance Transform on Parallel Processing Systems, " Computer Vision and Image Understanding, Vol. 73, No. 3, March, pp. 374-390 (1999) .  

35. S. S. Lee, and S. J. Horng, "Entropy Thresholding and Its Parallel Algorithm on the Reconfigurable Array of Processors with Wider Bus Networks, " IEEE Transactions on Image Processing, Vol. 8, No. 9, Sep., pp. 1-14 (1999).  

36. W. J. Tsaur and S. J. Horng, Auditing causal relationships of group multicast communications in group oriented distributed systems, to appear in the Journal of Supercomputing(SCI), 2000.  

37. C. H. Wu, S. J. Horng and P. Z. Lee, A new computation of shape moments via quadtree decomposition, to appear in the Pattern Recognition, 2000.  

38. C. H. Wu, S. J. Horng and H. R. Tsai, Efficient parallel algorithms for hierarchical clustering on arrays with reconfigurable optical buses, Journal of Parallel and Distributed Computing, Vol. 60, Sept. 2000, pp. 1137-1153.  

39. C. H. Wu, S. J. Horng Y. W. Chen and W. Y. Lee, Designing scalable and efficient parallel clustering algorithms on arrays with reconfigurable optical buses, Image and Vision Computing, Vol. 18, Oct. 2000, pp. 1033-1043.  

40. C. H. Wu, S. J. Horng and Y. R. Wang, Computing shape?s moments via rectangular decomposition on arrays with reconfigurable optical buses, International Journal of Applied Mathematics, Vol. 3, No. 1, 2000, pp. 91-106.  

41. C. H. Wu and S. J. Horng, L_2 vector median filters on arrays with reconfigurable optical buses, IEEE Transactions on Parallel and Distributed Computing Systems (SCI), Vol. 12, No. 12, Dec. 2001, pp. 1281-1292. NSC-89-2213-E011-007  

42. C. H. Wu and S. J. Horng, Optimal parallel algorithms for computer vision problems, to appear in the Journal of Parallel and Distributed Computing, Vol. 62, No. 6, June 1, 2002, pp. 1021-1041. NSC-89-2213-E011-007  

43. S. J. Horng, H. Z. Tsai, Y. Pan and J. Seitzer Optimal algorithms for the channel-assignment problem on a reconfigurable array of processors with wider bus networks, to appear in IEEE Transactions on Parallel and Distributed Computing Systems (SCI) 2002, NSC-89-2213-E011-007  

44. Y. H. Lee, S. J. Horng and J. Seitzer, Parallel computation of the Euclidean distance transform on a three dimensional image array, IEEE Transactions on Parallel and Distributed Computing Systems (SCI), Vol. 14 No. 3, March. 2003, pp. 203-212. NSC-89-2213-E011-108/89-2213-E-267-002.  

45. Y. R. Wang, S. J. Horng, Y. H. Lee and P. Z. Lee, Parallel algorithms for higher-dimensional Euclidean distance transforms with applications, IEICE Transactions on Information and Systems (SCI), Vol. E-86D, No. 9, Sep. 2003, pp. 1586-1593. NSC-89-2213-E011-007.  

46. C. H. Wu and S. J. Horng, Fast and scalable selection algorithms with applications to median filtering, IEEE Trans. on Parallel and Distributed Computing Systems (SCI) Vol. 14, No. 9, Oct. 2003, pp. 983-992. NSC-91-2213-E011-115.  

47. Y. R. Wang and S. J. Horng, An O(1) time algorithm for the 3D Euclidean transform on the CRCW PRAM model, IEEE Trans. on Parallel and Distributed Computing Systems (SCI) Vol. 14, No. 10, Oct. 2003, pp. 973-982. NSC-89-2213-E011-007.  

48. Y. R. Wang, S. J. Horng, Parallel algorithms for arbitrary dimensional Euclidean distance transforms with applications on arrays with reconfigurable optical buses, IEEE Trans. on Systems, Man, Cybernetics Part B (SCI), Vol. 34, No.1, Feb. 2004, pp. 517-532. NSC-89-2213-E011-007.  

49. C. H. Wu and S. J. Horng, Run-length chain coding and scalable computation of shape’s moments using reconfigurable optical buses, IEEE Trans. on Systems, Man, Cybernetics Part B (SCI) Vol. 34, No. 2, April 2004, pp. 845-855. NSC-91-2213-E011-115.  

50. Y. R. Wang, S. J. Horng and C. H. Wu, Efficient algorithms for the all nearest neighbor and closest pair problems on the linear array with a reconfigurable pipelined bus system, IEEE Trans. on Parallel and Distributed Computing Systems, Vol. 16, No. 3, March 2005, pp. 193-206. NSC-91-2213-E011-115.  

會議論文

1. C. F. Lin, S. J. Horng, T. W. Kao , "Sorting on high dimensional mesh-connected computers with multiple broadcasting using fewer processors," Proceedings of the 11th Workshop on Combinatorial Mathematics and Computation Theory , pp.6-10 (1995).  

2. H. R. Tsai, S. J. Horng, S. S. Lee, S. S. Tsai, T. W. Kao , "Sorting algorithms on a hyper-channel broadcast communication model," Proceedings of the 11th Workshop on Combinatorial Mathematics and Computation Theory , pp.1-5 (1995) .  

3. S. J. Horng, "Prefix computation and some related applications on mesh-connected computers with hyperbus broadcasting," Proceedings of the 7th International Conference on Computing and Information , pp.344-365 , Canada (1995) .  

4. S. S. Tsai, S. J. Horng and T. W. Kao , "Parallel algorithm for template matching on a mesh-connected computer with hyperbus broadcasting," Proceedings of the 7th International Conference on Computing and Information , pp.366-388 , Canada (1995) .  

5. S. J. Horng, "Generalized mesh-connected computers with hyperbus broadcasting for a computers network," Proceedings of 1995 Workshop on High Performance Multiprocessor Systems , pp.111-130 (1995) .  

6. C. F. Lin, S. J. Horng and T. W. Kao , "Sorting on mesh-connected computers with multiple broadcasting using fewer processors," International conference on High Performance Computing , Taipei, Taiwan (1995) .  

7. S. S. Lee, S. J. Horng, H. R. Tsai and T. W. Kao , "A constant time algorithm for creating a quadtree on a reconfigurable mesh," International conference on High Performance Computing , Taipei, Taiwan (1995) .  

8. S. S. Lee, S. J. Horng, T. W. Kao and H. R. Tsai , "Hough transform on a reconfigurable array of processors with wider bus networks," International conference on High Performance Computing , pp.55-60 , New Delhi, India (1995) .  

9. S. S. Tsai, S. J. Horng, T. W. Kao, S. S. Lee and H. R. Tsai , "An efficient sorting algorithm on mesh-connected computers with multiple broadcasting," International conference on High Performance Computing , pp.437-442 , New Delhi, India (1995) .  

10. S. S. Lee, S. J. Horng, H. R. Tsai and Yu-Hua Lee , "Some image processing algorithms on a RAP with wider bus networks," International Parallel Processing Symposium , pp.708-715 , Honolulu, Hawaii (1996) .  

11. Y. H. Lee and S. J. Horng , "The Chessboard distance transform and the medial axis transform are interchangeable," International Parallel Processing Symposium , pp.424-428 , Honolulu, Hawaii (1996) .  

12. H. R. Tsai, S. J. Horng, S. S. Lee and T. W. Kao , "Optimal finding the all-pair shortest path algorithm for interval graphs on a reconfigurable array of processors with wider bus networks," International Conference on Parallel and Distributed Processing Techniques and Applications , pp.1374-1385 , USA (1996) .  

13. H. R. Tsai, S. J. Horng, S. S. Lee, S. S. Tsai and T. W. Kao , "Efficient parallel algorithms for the algebraic path problems on a hyper-bus broadcast network," International Conference on Parallel and Distributed Processing Techniques and Applications , pp.1386-1397 , California, USA (1996) .  

14. Y. H. Lee and S. J. Horng , "Fast parallel chessboard distance transform algorithms," International Conference on Parallel and Distributed Systems , pp.488-493 , Tokyo, Japan (1996) .  

15. H. R. Tsai, S. J. Horng, S. S. Tsai, S. S. Lee, T. W. Kao , "Parallel string matching algorithms on processor arrays with a reconfigurable bus system," IASTED International Conference on Parallel and Distributed Systems , pp.203-206 , Spain (1997) .  

16. Y. H. Lee and S. J. Horng , "Fast computing the chessboard distancetransform on parallel processing systems," IASTED International Conference on Parallel and Distributed Computing and Networks , pp.127-130 (1997) .  

17. W. J. Tsaur, S. J. Horng and C. H. Chen , "An authentication combined access control scheme using a geometric approach in distributed systems," Proceesings of the 12th ACM Symposium on Applied Computing , San Jose, CA, USA (1997) .  

18. W. J. Tsaur and S. J. Horng , "A new generalized distributed software complexity analysis and its applications," The 9th IASTED Internationl Conference on Parallel and Distributed Computing and Systems , pp. 41-46, Washington, D. C., USA (1997) .  

19. Z. M. Cheng, S. J. Horng, T. W. Kao and W. J. Tsaur , "A new interconnection topology - m-ary generalized Fibonacci cubes," The 9th IASTED Internationl Conference on Parallel and Distributed Computing and Systems , pp. 144-147, Washington, D. C., USA (1997) .  

20. W. J. Tsaur, S. J. Horng and T. W. Kao , "An efficient and authenticated group-oriented cryptoscheme based on a geometric method in internet environments," to appear in the 1997 IEEE International Conference on Parallel and Distributed Systems , pp. 640-647, Seoul, Korea (1997) .  

21. H. R. Tsai, S. J. Horng, S. S. Tsai, S. S. Lee, T. W. Kao and C. H. Chen, "Parallel clustering algorithms on a reconfigurable array of processors with wider bus networks," Proceedings of the 1997 IEEE International Conference on Parallel and Distributed Systems, pp. 630-637, Seoul, Korea, Dec. 10-13, (1997).  

22. W. J. Tsaur and S. J. Horng, "A scheme for auditing casual relationships in group oriented distributed systems, " Proceedings of the International Symposium on Software Engineering for Parallel and Distributed Systems, pp. 115-125, Kyoto, Japan, April 20-21, (1998).  

23. C. H. Wu, S. J. Horng and H. R. Tsai, "Template matching on arrays with reconfigurable optical buses, " Proc. Special Section on Parallel and Distributed Computing of Int. Symp. on Operations Research and Its Application, Kunming, pp. 127-141, China, June (1998).  

24. W. J. Tsaur and S. J. Horng, "An efficient switching method for enhancing transmission bandwidth on a LAN and its applications, " Proc. Int. Conf. On Computing and Information, Weinipeg, pp. 27-34, Canada, June (1998).  

25. C. H. Wu, R. C. Tsai, S. J. Horng and H. R. Tsai, "An efficient parallel algorithm for hierarchical clustering on arrays with reconfigurable optical buses," Proc. Int. Computer Symposium, pp. 14-21, Tainan, Taiwan, Dec. (1998).  

26. C. H. Wu, S. J. Horng, R. C. Tsai and H. T. Chang, "Parallel clustering algorithms based on the minimum spanning tree," Proc. of the 1st Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, pp. 133-140, Kyoto, Japan, March (1999).  

27. C.H. Wu, S. J. Horng, H. R. Tsai, S. S. Lee and S. Y. Lin, Scalable and efficient clustering algorithms on arrays with reconfigurable optical buses, Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems, MIT, USA, Nov. 1999, pp. 44-49.  

28. C.H. Wu, S. J. Horng, H. R. Tsai, S. S. Lee and Y. W. Chen, Optimal digital geometry algorithms on arrays with reconfigurable optical buses, Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems, MIT, USA, Nov.1999, pp. 479-485.  

29. C. H. Wu, S. J. Horng, P. Z. Lee, S. S. Lee and S. Y. Lin, A new computation of shape moments via quadtree decomposition, Proceedings of IPDPS 2000 Workshop on Advances in Parallel and Distributed Computational Models (Lecture Notes in Computer Science LNCS 1800), Cancun, Mexico, May 1-5, 2000, pp. 123-129.  

30. C. H. Wu, S. J. Horng, H. R. Tsai, J. F. Lin and T. L. Lin, An optimal parallel algorithm for computing moments on arrays with reconfigurable optical buses," Proceedings of IEEE InternationalParallel and Distributed Processing Symposium (IPDPS2000), Cancun, Mexico, May 1-5, 2000, pp. 741-746.  

31. C. H. Wu, S. J. Horng and Y. R. Wang, Parallel algorithm for computing shape?s moments on arrays with reconfigurable optical buses, to appear in the Proceedings of the 4th International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP2000), Hong Kong,Dec. 11-13, 2000.  

32. C. H. Wu, S. J. Horng, Y. R. Wang and L. G. Jeng, Parallel algorithms for vector median filtering, to appear in the Proceedings of the 4th International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP2000), Hong Kong, Dec. 11-13, 2000.  

33. Y. H. Lee, S. J. Horng, and J. Seitzer, Fast computation of the 3-D Euclidean distance transform on the EREW PRAM Model, Proceedings of the 2001 International Conference on Parallel Processing, Valencia, Spain, Sep. 3-7, 2001, pp.471-478.  

34. C. H. Wu, S. J. Horng, Y. W. Chen and C. K. Yu, Run-length chain coding and shape?s moment computations, Proceedings of the 2001 International Conference on Parallel Processing, Valencia, Spain, Sep. 3-7, 2001, pp.479-488.  

35. C. H. Wu, S.-J. Horng, Yi Pan Parallel algorithms for median filtering on arrays with reconfigurable optical buses, Workshop on Advances in Parallel and Distributed Computational Models (held with IEEE International Parallel and Distributed Processing Symposium (IPDPS2002)), Fort Lauderdale, Florida, USA, April 15-19, 2002.  

36. Y. R. Wang and S. J. Horng, An O(1) time parallel algorithm for the 3D Euclidean Distance Transform on the AROB, Proceedings of the 2002 International Conference on Parallel and Distributed Processing Techniques and Applications, Las Vegas, Nevada, USA, June 24-27, 2002.  

37. 郭奕宏,林琮烈,洪西進,許福龍,以灰色關聯分析為基礎的文件自動分類技術,第一屆數位典藏技術研討會,中央研究院,台灣,七月25、26,2002,p.25-30。  

38. Y.-R. Wang, S.-J. Horng, Y.-H. Lee and P.-Z. Lee, Parallel Algorithms for Higher-Dimensional Euclidean Distance Transforms with Applications, PDCAT, Kanazawa Japan, Sep. 4-6, 2002.  

39. Y. R. Wang, S. J. Horng, An O(1) time parallel algorithm for the 3D Euclidean distance transform on the CRCW PRAM model, IASTED NPDPA Oct. 2-4 ,2002, pp. 419-424.  

40. Y. R. Wang and S. J. Horng, An O(1) time parallel algorithm for the 3D Euclidean distance transform on the AROB, Proc. of the Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA), 2002, pp. 1120-1126.  

41. Y. H. Lee and S. J. Horng, Parallel computation of the 3-D Euclidean distance transform on the SIMD hypercube computer, Proc. of the 4th Int. Conf. on Parallel and Distributed Computing, Applications and Technologies(PDCAT03), Chengdu, China, Aug. 27-29, 2003, pp. 640-643.  

42. S. J. Horng, A fingerprint recognition system in SOC, Internet, Processing, Systems and Interdisciplanaries (IPSI-2003), Belgrade, Serbia, Oct. 4-11, 2003.  

43. Y. Y. Chen, S. J. Horng, H. C. Lai, An integrated fault-tolerant design framework for VLIW processors, 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (DFT’03), Boston, Massachusetts, Nov. 3-5, 2003, pp. 555-562.  

44. Y. R. Wang and S. J. Horng, Constant Time Algorithms for the 3-D All Nearest Neighbor Problem on the LARPBS, Proc. of the Fifth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT), Singapore, Dec. 8-10, 2004, pp. 243-247.  

45. Y. R. Wang, S. J. Horng and H. C. Chan, Fast All Nearest Neighbor Algorithms from Image Processing Perspective, IEEE Int’l Parallel and Distributed Processing Symposium (IPDPS 2005), Denver, Colorado, USA, Apr. 4-8, 2005 (EI).  

46. S. J. Horng, P. Fan, M. Y. Su and Z. Y. Wu, Detecting IIS attacks based on neural-network, DCS 2005, Yokohama, Japan, June 28-July 1, 2005.

其他論著

1. Horng, S.J. , "Efficient algorithms for computing dominators on SIMD hypercube multiprocessors," submitted for publication (1995).

2. Lin, S. J. Horng and T. W. Kao , "Efficient sorting algorithm on mesh-connected computers with multiple broadcasting," Technical report(1995) .

3. Lee, S. J. Horng, T. W. Kao, F. S. Jiang, Y. J. Chen, H. R. Tsai , "Parallel computation of exact euclidean distance transform," Technical report(1995) .

4. Lee, S. J. Horng, T. W. Kao, Y. J. Chen , "Parallel computing euclidean distance transform on mesh of tree and Hypercube," Technical report(1995).

5. Lee, S. J. Horng , "The equivalence of the chessboard distance transform and the medial axis transform," Technical report (1995) .

6. Tsaur and S. J. Horng , "A new and perfect group-oriented secret key sharing in distributed systems," Technical Report (1995).

7. Tsai, S. J. Horng , "Parallel sorting and template matching algorithms on enhanced mesh-connected computers," Master thesis (1995).

研究計畫

  • 具有多重匯流排的平行處理機之研究 85.08-86.07 國科會
  • 音樂合成法之研究 87.08-88.07 國科會
  • 即時虛擬語音和影像加密系統 88.08-89.07 國科會
  • 網路安全缺陷掃瞄技術研究(1/2)  89.08-90.07 國科會
  • 即時網路語音通信整合系統 89.12-90.05 迅速聯網
  • 網路安全缺陷掃瞄技術研究(2/2)  90.07-91.08 國科會
  • 我國跨世紀技職體系一貫課程90年度工作計畫(電機電子群)  90.07-91.01 教育部
  • 呼吸對心肺疾病患者心率變異度的效應 90.08-91.07 國科會
  • 海軍艦隊現代資訊科技運用之研析與規劃(II)-資訊安全與防護 91.01-91.12 國科會
  • 量測孕婦脈搏辨識嬰兒性別研究 國科會
  • 91年度學術研發成果管理與推廣計畫 91.01-91.12 國科會
  • 以圖文內容為基礎的網際網路資訊擷取系統 91.08-92.07 國科會
  • 平行入侵偵測系統 92.08-93.07 國科會
  • 電腦病毒區域聯防系統之研究 92.07-93.06 國防工業發展基金會
  • 設計醫療及運動器材訊號之SOC晶片 92.06-93.05 國科會
  • 以支向機技術研究電子郵件分類 93.08-94.07 國科會
  • 基於類神經網路來分辨心臟疾病之研究 93.05-94.04 國科會

 

 
 個人的研究方向簡介如下:

一.平行處理(Parallel Processing)
(1) 新式平行架構的建立:
探討新一代平行處理電腦的架構,考慮其通訊與計算等能力。
(2) 容錯式的平行架構:
數以千計的電腦連結在一起成為一個系統,當有處理單元壞掉時如何因應值得研究。
(3) 平行的演算法:
如新一代平行處理系統,研究如何寫程式。

二.多媒體系統(Multi-medium)
(1) CAI遊戲軟體:
把電腦輔助軟體遊戲化,增加動畫,音效的效果。
(2) 圍棋CAI:
利用電腦下圍棋,市面上已有,如何利用電腦教導下圍棋值得研究。
(3) 高速網路多媒體的製作:
研究如何解決同時有數以千計的使用的需求。
(4) 聲音信號處理(合成音樂)
研究如何以電腦上現有的資源,經由軟體的處理演奏出如音樂廳美妙的音樂。

三.可移動式計算
(1) 模式的建立:
當計算機可移動時,其分散的環境如何建立值得研究。
(2) 游走的協定:
研究使用者由一個區域轉至另一區域時如何有效的重建路徑。

四.超大型積體電路的設計(VLSI Design)
(1) 設計商品化晶片:
利用已存在的工具如CADANCE工具,設計商業性的晶片。

五.資訊安全(Information security)
(1)入侵偵測系統
建立入侵知識庫,探討新的入侵偵測方法。
(2)後門程式偵測
建立後門程式知識庫,探討新的後門程式偵測方法。
(3)病毒程式偵測
建立病毒程式知識庫,探討新的病毒程式偵測方法。
 



*如有異動,請以老師個人網站資料為準。
*老師本人如欲自行維護本頁面,請洽技轉中心索取帳號密碼。