張舜傑

 

  姓名 張舜傑
職稱 助理教授
最高學歷 國立臺灣科技大學資訊管理博士
專長領域 人工智慧、資訊安全、科技政策布局研析
校內分機 84180
研究室 S504
授課科目 商業大數據(企管三甲)、品牌行銷管理研討(企管碩士班)、電子商務創業研討(企管碩專班)
Office Hour  星期三,0910-1300
電子郵件 scc@mail.shu.edu.tw

 

  • 學歷國立臺灣科技大學資訊管理博士
  • 經歷
致理科技大學 休閒遊憩管理系 助理教授
財團法人資訊工業策進會 資安科技研究所 正工程師
國防部資通電軍 惡意程式情資掌握與逆向工程 講師
泰國暹羅大學國際學院 客座助理教授
世新大學資訊管理學系 兼任講師
美商達維飛碼 測試工程師
  • 榮譽

 Symposium on Enterprise Architecture and Information Technology, (SEAIT2016), Excellence Award Paper.

國立臺灣科技大學斐陶斐榮譽會員

世新大學斐陶斐榮譽會員

 

  • 研究成果與專業表現

專業表現

資策會創新前瞻研究計畫5G射頻子計畫審查委員

The 23rd IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2018), Session Chair.

專利

發明專利(中華民國), 檢測系統及檢測方法, 發明I656453 號.

發明專利(美國), DETECTION SYSTEM AND DETECTION METHOD, US10,318,731B2

研究成果

Journal Paper

[J1] The NP-completeness of the Connected p-Median Problem on Bipartite Graphs and Split Graphs, Chiang Mai Journal of Science, vol. 40(1), 83-88. (SCI), 2013.

[J2] The Connected p-Median Problem on Block Graphs, Optimization Letters, vol. 10(6), 1191-1201 (SCI), 2016.

[J3] The Outer-connected Domination Number of Sierpinski-like Graphs, Theory of Computing Systems, vol. 58(2), 345-356 (SCI), 2016.

[J4] The 2-rainbow domination of Sierpinski graphs and extended Sierpinski graphs, Theory of Computing Systems, vol. 61(3), 893-906 (SCI), 2017.

[J5] Amortized Efficiency of Generating, Ranking and Unranking Left-Child Sequences in Lexicographic Order, Discrete Applied Mathematics, vol. 268, 223-236(SCI), 2019.

Conference Paper

[C1] The Connected p-Median Problem on Graphs with Forbidden Vertices, in Proceedings of The 27th Workshop on Combinatorial Mathematics and Computation Theory, 2010.

[C2] Practical Variations of the p-Center Problem on Graphs, The 2011 International Computer Science and Engineering Conference (ICSEC) 2011.

[C3] The weighted independent domination problem on series-parallel graphs, International Computer Symposium (ICS) 2014.

[C4] The 2-rainbow domination of Sierpinski graphs and extended Sierpinski graphs, The 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG^2) 2015.

[C5] Ranking Left-weight Sequences of Binary Trees in Gray-code Order, The 19th INTERNATIONAL COMPUTER SCIENCE AND ENGINEERING CONFERENCE (ICSEC) 2015.

[C6] Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order, The 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA’16) 2016.

[C7] Intelligence Itinerary Planning and Novel Tourism Business, Symposium on Enterprise Architecture and Information Technology, (SEAIT), 2016.

[C8] Memory Forensics Using Virtual Machine Introspection for Malware Analysis, IEEE Conference on Dependable and Secure Computing (DSC) 2017.

[C9] ANTSdroid:Using RasMMA algorithm to generate Malware Behavior Characteristics of Android Malware Family, IEEE 23rd Pacific Rim International Symposium on Dependable Computing (PRDC) 2018.

[C10] A Scalable and Accurate Feature Representation Method for Identifying Malicious Mobile Applications, The 34th ACM Symposium on Applied Computing (SAC) 2019.

其他

AI 辨識科技應用趨勢與資安策略布局研析, 行政院科技會報

新興科技資安發展趨勢與資安拓銷市場策略研析, 行政院科技會報