.:: 回首頁 | 陽明交通大學 | 意見回饋 | 網站地圖 | 手機板 | English  ::.
國立陽明交通大學 回陽明交通大學 回本系應數首頁
最新消息 系所介紹 師資人員 學術研究 招生入學 修業規章 學生專區 系友會 FAQ

  • 師資
  • 參訪人員
  • 博士後人員
  • 行政技術人員

  • 相關學術網站
  • 陽明交通大學

陳秋媛(Chiuyuan Chen)特聘教授

聯絡方式
  • Email: cychen@nycu.edu.tw
  • 電話: 03-571-2121 或校內分機 31767
  • 傳真: 03-572-4679
  • 地址: 300 新竹市大學路1001號 陽明交通大學 應用數學系
  • 相關網站:    
近兩學期教授課程
  • 111 學年度第一學期:
    • 導師時間
    • 計算機概論(一)

  • 111 學年度第二學期:
    • 計算機概論(二)
    • 導師時間
履歷
  • 學歷
    • 國立交通大學資訊工程 博士 (指導教授:張瑞川博士)
    • 國立交通大學應用數學系 碩士 (指導教授:徐力行博士)(組合數學組第一屆)
    • 國立交通大學資訊科學 學士 (資訊科學系第一屆)
  • 學術專長暨研究領域
    • 圖論 (Graph Theory)
    • 演算法 (The Design and Analysis of Computer Algorithms)
    • 連接網路及無線網路 (Interconnection Networks, Wireless Networks)
  • 學術經歷與榮譽
      • 國立交通大學應用數學系副教授
      • 國立交通大學應用數學系系主任(2009-2013)
      • 國立交通大學傑出教學獎3次
      • 交通大學應用數學系薪傳教學獎
      • 國立交通大學績優導師

  • 近五年研究計劃
      • 圖論在無線可再充電式感測網路之充電板佈署問題之應用 (MOST 110-2115-M-A49-006 -)
      • 圖論中最短漢彌爾頓圈問題及其在無線可再充電式感測網路充電迴路排程問題之應用(MOST 109-2115-M-009-010 -)
      • 最長路徑問題及其在無線感測網路邊界覆蓋之應用上(MOST 108-2115-M-009-013 -)
      • 行動伺服器之連續服務問題與控制集之相互轉換問題之研究(107-2115-M-009-014-)
      • 圖的放寬二步著色及其在以樹為基礎的無線感測網路之資料收集上的應用(106-2115-M-009-007-)

  • 指導研究生
      • 曾淑美(81畢)
        碩士論文: On covering polygons with rectangles
        (與張鎮華教授共同指導)
      • 黃季豐(81畢)
        碩士論文: On partitioning orthogonal polygons into convex quadrilaterals
      • 余琍琳(82畢)
        碩士論文: Characterizing grid intersection graphs
      • 張伯綸(82畢)
        碩士論文: On partitioning simple polygons into uniformly monotone parts
      • 藍彭聖(82畢)
        碩士論文: The feedback vertex set problem for various digraphs
      • 林修懿(82畢)
        碩士論文: Planar visibility graphs
      • 張勤振(83畢)
        C.Y. Chen, C.C. Chang, and G.J. Chang (1997), "Proper interval graphs and the guard problem," Discrete Mathematics, Vol. 170, pp. 223-230.
      • 吳凱平(84畢)
        C.Y. Chen and K.P. Wu (2001), “Disproving a conjecture on planar visibility graphs,” Theoretical Computer Science, Vol. 255, pp. 659-665.
      • 陳亞萍(84畢)
        G.J. Chang, C.Y. Chen, and Y.P. Chen (2004), “Vertex and tree arboricity of graphs,” Journal of Combinatorial Optimization, Vol. 8, pp. 295-306.
      • 徐素琪(85畢)
        碩士論文: Covering simple polygons by rectangles
      • 賴佳宏(85畢)
        碩士論文: Covering convex polygons by rectangles
      • 王治平(89畢)
        碩士論文: Double-loop networks with minimum diameter
      • 張欣心(90畢)
        碩士論文: Some experimental results on double-loop networks
      • 石舜仁(91畢)
        C.Y. Chen, F.K. Hwang, J.S. Lee, and S.J. Shih (2003), “The existence of hyper-L triple loop networks,” Discrete Mathematics, Vol. 268, pp. 287-291.
      • 陳沅百(91畢)
        碩士論文: A fault-tolerant two terminals routing algorithm of double-loop networks
        陳沅百獲組合數學新苗論文獎
      • 陳麗玲(91畢)
        碩士論文: The case study of concept learning on graph theory of a junior student
        (與陳明璋教授共同指導)
      • 洪志欣(92畢)
        R.C. Chan, C.Y. Chen, and Z.X. Hong (2002), “A simple algorithm to find the steps of double-loop networks,” Discrete Applied Mathematics, Vol. 121, pp. 61-72.
        C.Y. Chen, C.S. Hung, and W.S. Tang (2006), “On the existence of hyper-L triple-loop networks,” Discrete Mathematics, Vol. 306, pp. 1132-1138.
      • 陳建瑋(93畢)
        碩士論文: The study of chordal ring networks
      • 唐文祥(93畢)
        C.Y. Chen, C.S. Hung, and W.S. Tang (2006), “On the existence of hyper-L triple-loop networks,” Discrete Mathematics, Vol. 306, pp. 1132-1138.
        C.Y. Chen, J.K. Lan, and W.S. Tang (2006), “An efficient algorithm to find a double-loop network that realizes a given L-shape,” Theoretical Computer Science, Vol. 359, pp. 69-76.
        唐文祥獲組合數學新苗論文獎
      • 劉維展(94畢)
        V.W. Liu, C.Y. Chen, and R.B. Chen (2007), “Optimal all-to-all personalized exchange in d-nary banyan multistage interconnection networks,” Journal of Combinatorial Optimization, Vol. 14, pp. 131-142.
        劉維展獲組合數學新苗論文獎、台灣作業研究學會論文獎第三名
        J.K. Lan, V.W. Liu, and C.Y. Chen* (2009), “Improved upper and lower bounds on the optimization of mixed chordal ring networks,” Information Processing Letters, Vol. 109, pp. 757-762.
      • 藍國元(94畢)
        C.Y. Chen, F.K. Hwang, and J.K. Lan (2005), “Equivalence of buddy networks with arbitrary number of stages,” Networks, Vol. 46, pp. 171-176.
        C.Y. Chen, J.K. Lan, and W.S. Tang (2006), “An efficient algorithm to find a double-loop network that realizes a given L-shape,” Theoretical Computer Science, Vol. 359, pp. 69-76.
        J.S. Lee, J.K. Lan, and C.Y. Chen (2006), “On degenerate double-loop L-shapes,” Journal of Interconnection Networks, Vol. 7, No. 2, pp. 195-215.
      • 蔡宜諴(94畢)
        碩士論文: A study on line-based duplication and its applications
        (與陳明璋教授共同指導)
      • 胡世謙(95畢)
        K.S. Hu, S.S. Yeoh, C.Y. Chen, and L.H. Hsu (2007), “Node-pancyclicity and edge-pancyclicity of hypercube variants,” Information Processing Letters, Vol. 102, pp. 1-7.
      • 羅經凱(95畢)
        C.Y. Chen and J.K. Luo (2006), “An efficient tag-based routing algorithm for the backward network of a bidirectional general shuffle-exchange network,” IEEE Communications Letters, Vol. 10, No. 4, pp. 296-298.
      • 洪秋美(96畢)
        碩士論文: The study of hypercubes and their variants
      • 陳柏澍(96畢)
        V.W. Liu, C.Y. Chen, and R.B. Chen (2007), “Optimal all-to-all personalized exchange in d-nary banyan multistage interconnection networks,” Journal of Combinatorial Optimization, Vol. 14, pp. 131-142.
        陳柏澍獲組合數學新苗論文獎
      • 林威雄(97畢)
        碩士論文: The performance analysis of three routing algorithms of general shuffle-exchange networks
      • 邱鈺傑(97畢)
        J.K. Lan, W.Y. Chou, and C.Y. Chen (2009), “Efficient routing algorithms for generalized shuffle-exchange networks,” Discrete Mathematics, Algorithms and Applications, Vol. 1, No. 2, pp. 267-281.
        W.Y. Chou and C.Y. Chen (2010), “All-to-all personalized exchange in generalized shuffle-exchange networks,” Theoretical Computer Science, Vol. 411, pp. 1669-1684.
        邱鈺傑獲組合數學新苗論文獎
      • 黃志文(97畢)
        碩士論文: On the crosstalk-free rearrangeability of combined optical multistage interconnection networks
      • 陳子鴻(97畢)
        碩士論文: Routing permutations in the baseline network and in the omega network
      • 黃信菖(98畢)
        碩士論文: The diameter-edge-invariant property of chordal ring networks
      • 蔡松育(98畢)
        碩士論文: The rigidity property and the unique localization problem of sensor networks
      • 劉宜君(98畢)
        Y.J. Liu, J.K. Lan, W.Y. Chou, and C.Y. Chen (2011), “Constructing independent spanning trees for locally twisted cubes,” Theoretical Computer Science, Vol. 412, pp. 2237-2252.
        劉宜君獲組合數學新苗論文獎
      • 劉士慶(98畢)
        碩士論文: On the diameter of chordal ring networ
      • 曾慧棻(98畢)
        碩士論文: On the all-to-all personalized exchange problem in chordal ring networks
      • 藍國元(99畢)
        J.K. Lan, W.Y. Chou, and C.Y. Chen (2009), Efficient routing algorithms for generalized shuffle-exchange networks, Discrete Mathematics, Algorithms and Applications, Vol. 1, No. 2, pp. 267-281.
        J.K. Lan, V.W. Liu, and C.Y. Chen (2009), Improved upper and lower bounds on the optimization of mixed chordal ring networks, Information Processing Letters, Vol. 109, pp. 757-762.
        Y.J. Liu, J.K. Lan, W.Y. Chou, and C.Y. Chen (2011), “Constructing independent spanning trees for locally twisted cubes,” Theoretical Computer Science, Vol. 412, pp. 2237-2252.
        博士論文: On distance-related problems of mixed chordal ring networks
        藍國元獲組合數學新苗論文獎
      • 黃思綸(99畢)
        碩士論文: A polynomial-time approximation algorithm for the constrained connected dominating set problem in wireless networks
        黃思綸獲組合數學新苗論文獎
      • 吳思賢(99畢)
        碩士論文: A polynomial-time approximation scheme for the minimum-weighted independent dominating set problem in wireless networks
        (論文內容曾於第五屆無線、隨意及感測網路研討會發表)
      • 羅健峰(99畢)
        碩士論文: Using a connected dominating set as the virtual backbone of a wireless network
      • 蔡詩妤(100畢)
        碩士論文: An efficient self-stabilizing algorithm for the minimal dominating set problem under a distributed scheduler
      • 何恭毅(100畢)
        碩士論文: On the imperfection ratio of unit disk graphs
      • 袁智龍(101畢)
        碩士論文: On the study of position-based routing algorithms for wireless ad hoc networks
      • 王奕倫(101畢)
        碩士論文: Signed star domination and signed star domatic numbers of complete bipartite graphs and an improved algorithm for network planarization
      • 呂竺晏(101畢)
        碩士論文: The comparison of void handling techniques in wireless sensor networks
      • 林紹鈞(102畢)
        碩士論文: New adaptive localization algorithms that achieve better coverage for wireless sensor networks
      • 趙彥丞(102畢)
        碩士論文: A distance-two coloring with applications to wireless sensor and actor networks
        趙彥丞獲組合數學新苗論文獎
      • 吳惠閔(103畢) 碩士論文: A new binary training protocol for wireless heterogeneous sensor and actor networks
      • 邱鈺傑(103畢)
        Y.J. Liu, J.K. Lan, W.Y. Chou, and C.Y. Chen (2011), “Constructing independent spanning trees for locally twisted cubes,” Theoretical Computer Science, Vol. 412, pp. 2237-2252.
        W.Y. Chiu, C.Y. Chen, S.-Y. Tsai (2014), “A 4n-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon,” Information Processing Letters, 114, 515-518.
        博士論文: Self-stabilizing minimal dominating set algorithms of distributed systems and the signed star domination number of Cayley graphs
      • 姚欣豪(104畢)
        碩士論文: A new distributed, collaborative, conflict-friendly localization algorithm for wireless sensor networks
        姚欣豪獲組合數學新苗論文獎
      • 彭元璟(104畢)
        碩士論文:Hole detection and healing in mobile wireless sensor networks
        彭元璟獲組合數學新苗論文獎
      • 羅世明(105畢)
        S.M. Lo, W.H. Lin, C.Y. Chen, and Y.C. Tseng, Optimal coloring for data collection in tree-based wireless sensor networks, to appear in Theoretical Computer Science.
      • 張馨勻(105畢)
        碩士論文:Fault-tolerance and minimum cost placement of bistatic radar sensors for belt barrier coverage
        張馨勻獲組合數學新苗論文獎
      • 林彥廷(105畢)
        碩士論文:New strategies for hole detection and hole healing in wireless sensor networks
      • 蔡奇珉(106畢)
        碩士論文: A study of digital teaching material design based on cognitive process: an example of trees in data structure course
        (與陳明璋教授共同指導)
      • 褚冠廷(107畢、清華大學)
        K.T. Chu, W.H. Lin, and C.Y. Chen, Mutual transferability for (F,B,R)-domination on strongly chordal graphs and cactus graphs, to appear in Discrete Applied Mathematics.
        褚冠廷獲組合數學新苗論文獎
      • 劉芝帆(107畢)
        碩士論文: New hole-detection and hole-healing algorithms for wireless sensor networks
        劉芝帆獲組合數學新苗論文獎
      • 許家安(108畢)
        碩士論文: On Optimizing Signaling Efficiency of Semi-Persistent Scheduling for VoLTE Retransmissions
        (與曾煜棋教授共同指導)
      •  廖鴻志(108畢)
        碩士論文: Improve learning effect for autonomous driving by using inception series network and turning determination
        (與劉晉良教授共同指導)
      • 陳佑寧(108畢)
        Y.-N. Chen, W.-H. Lin, C.Y. Chen (2020), An effective sensor deployment scheme that ensures multilevel coverage of wireless sensor networks with uncertain properties, Sensors, 20, 1831; doi:10.3390/s20071831.
        陳佑寧獲組合數學新苗論文獎
      • 李晟瑋(108畢)
        碩士論文: An accurate car position method using the mapping decision feedback neural network
        (與曾煜棋教授共同指導)
      • 蕭維志(108畢)
        碩士論文: Hole-healing algorithms for wireless sensor networks that admit obstacles
      • 陳佳興(109畢)
        碩士論文: Multi-vehicle on-demand charging scheduling schemes for wireless rechargeable sensor networks
      • 鄧智元(109畢)
        碩士論文: An intrusion detection system for Internet of Things based on LSTM networks
      • 陳昭瑋(109畢、清華大學) (與鄭志豪教授共同指導)
        碩士論文:Barrier coverage problems in wireless sensor networks
      • 戴嘉辰(110畢)
        碩士論文: Corrected barrier coverage algorithms in wireless sensor networks under probabilistic sensing model
        戴嘉辰獲組合數學新苗論文獎
      • 蔡仲翔(110畢)
        C.-A. Hsu, C.H. Tsai, F. Y. Li*, C.Y. Chen, and Y.-C. Tseng (2021), Receiver-initiated data collection in wake-up radio enabled mIoT networks: Achieving collision-free transmissions by hashing and partitioning, IEEE Transactions on Green Communications and Networking, Vol. 5, No. 2, 868-883.
      • 碩士論文: On-demand charging scheme for target k-coverage in wireless rechargeable sensor networks
      • 吳潤觀(110畢)
        碩士論文: A 3-hop topology with TSCH scheduling in small and dense WSNs or in-vehicles WSNs
      • 沈垚廷(碩二)
      • 陳佳吟(碩二)
研究趣向

  • 圖論在連接網路及無線網路上的應用

著作選集

    (A)   Refereed Papers:

      1. L.H. Hsu, C.Y. Chen, and E.Y. Jean (1987), "A class of additive multiplicative graph functions," Discrete Mathematics, Vol. 65, pp. 53-63.
      2. C.Y. Chen and R.C. Chang (1990), "On the minimality of polygon triangulation," Bit, Vol. 30, pp. 570-582.
      3. C.Y. Chen, C.C. Chang, and G.J. Chang (1997), "Proper interval graphs and the guard problem," Discrete Mathematics, Vol. 170, pp. 223-230.
      4. C.Y. Chen and F.K. Hwang (2000), “Equivalent L-shapes of double-loop networks for the degenerate case,” Journal of Interconnection Networks, Vol. 1, pp. 47-60.
      5. C.Y. Chen and F.K. Hwang (2000), “Equivalent nondegenerate L-shapes of double-loop networks,” Networks, Vol. 36, pp. 118-125.
      6. C.Y. Chen and F.K. Hwang (2000), “The minimum distance diagram of double-loop networks,” IEEE Transactions on Computers, Vol. 49, pp. 977-979.
      7. F.K. Hwang, M.M. Liao and C.Y. Chen (2000), “Supermodularity in various partition problems,” (SCI) Journal of Global Optimization, Vol. 18, pp. 275-282.
      8. C.Y. Chen and K.P. Wu (2001), “Disproving a conjecture on planar visibility graphs,” Theoretical Computer Science, Vol. 255, pp. 659-665.
      9. C.Y. Chen (2002), “A necessary condition for a graph to be the visibility graph of a simple polygon,” Theoretical Computer Science, Vol. 276, pp. 417-424.
      10. R.C. Chan, C.Y. Chen, and Z.X. Hong (2002), “A simple algorithm to find the steps of double-loop networks,” Discrete Applied Mathematics, Vol. 121, pp. 61-72.
      11. C.Y. Chen (2003), “Any maximal planar graph with only one separating triangle is Hamiltonian,” Journal of Combinatorial Optimization, Vol. 7, pp. 79-86.
      12. C.Y. Chen, F.K. Hwang, J.S. Lee, and S.J. Shih (2003), “The existence of hyper-L triple loop networks,” Discrete Mathematics, Vol. 268, pp. 287-291.
      13. G.J. Chang, C.Y. Chen, and Y.P. Chen (2004), “Vertex and tree arboricity of graphs,” Journal of Combinatorial Optimization, Vol. 8, pp. 295-306.
      14. C.Y. Chen, F.K. Hwang, and J.K. Lan (2005), “Equivalence of buddy networks with arbitrary number of stages,” Networks, Vol. 46, pp. 171-176.
      15. C.Y. Chen, C.S. Hung, and W.S. Tang (2006), “On the existence of hyper-L triple-loop networks,” Discrete Mathematics, Vol. 306, pp. 1132-1138.
      16. C.Y. Chen and J.K. Luo (2006), “An efficient tag-based routing algorithm for the backward network of a bidirectional general shuffle-exchange network,” IEEE Communications Letters, Vol. 10, No. 4, pp. 296-298.
      17. J.S. Lee, J.K. Lan, and C.Y. Chen (2006), “On degenerate double-loop L-shapes,” Journal of Interconnection Networks, Vol. 7, No. 2, pp. 195-215.
      18. C.Y. Chen, J.K. Lan, and W.S. Tang (2006), “An efficient algorithm to find a double-loop network that realizes a given L-shape,” Theoretical Computer Science, Vol. 359, pp. 69-76.
      19. V.W. Liu, C.Y. Chen, and R.B. Chen (2007), “Optimal all-to-all personalized exchange in d-nary banyan multistage interconnection networks,” Journal of Combinatorial Optimization, Vol. 14, pp. 131-142.
      20. K.S. Hu, S.S. Yeoh, C.Y. Chen, and L.H. Hsu (2007), “Node-pancyclicity and edge-pancyclicity of hypercube variants,” Information Processing Letters, Vol. 102, pp. 1-7.
      21. J.K. Lan, V.W. Liu, and C.Y. Chen (2009), Improved upper and lower bounds on the optimization of mixed chordal ring networks, Information Processing Letters, Vol. 109, pp. 757-762.
      22. J.K. Lan, W.Y. Chou, and C.Y. Chen (2009), “Efficient routing algorithms for generalized shuffle-exchange networks,” Discrete Mathematics, Algorithms and Applications, Vol. 1, No. 2, pp. 267-281.
      23. W.Y. Chou and C.Y. Chen (2010), “All-to-all personalized exchange in generalized shuffle-exchange networks,” Theoretical Computer Science, Vol. 411, pp. 1669-1684.
      24. Y.J. Liu, J.K. Lan, W.Y. Chou, and C.Y. Chen (2011), “Constructing independent spanning trees for locally twisted cubes,” Theoretical Computer Science, Vol. 412, pp. 2237-2252.
      25. W.Y. Chiu, C.Y. Chen, S.-Y. Tsai (2014), “A 4n-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon,” Information Processing Letters, 114, 515-518.
      26. S.M. Lo, W.H. Lin, C.Y. Chen, and Y.C. Tseng (2017), “Optimal coloring for data collection in tree-based wireless sensor networks,” Theoretical Computer Science, 700, 23-36.
      27. K.-T. Chu, W.-H. Lin, and C.Y. Chen (2019), Mutual transferability for (F,B,R)-domination on strongly chordal graphs and cactus graphs, Discrete Applied Mathematics, 259, 41-52.
      28. Y.-N. Chen, W.-H. Lin, C.Y. Chen (2020), “An effective sensor deployment scheme that ensures multilevel coverage of wireless sensor networks with uncertain properties,” Sensors, 20, 1831; doi:10.3390/s20071831.
      29. C.-A. Hsu, C.H. Tsai, F. Y. Li, C.Y. Chen, and Y.-C. Tseng (2021), “Receiver-initiated data collection in wake-up radio enabled mIoT networks: Achieving collision-free transmissions by hashing and partitioning,” IEEE Transactions on Green Communications and Networking, Vol. 5, No. 2, 868-883.

返回go back





  •         
  •         
  •         
  •         
  •         
  •         
  •         
  •         
  •         
  •    
  • English Version|
  • 意見回饋|
  • Go Top
  •         
  •         
  •         
  •         
  •         
  •         
  •         
  •         
  •         

本網站著作權屬於國立陽明交通大學 應用數學系  © 2023

地址: 300 新竹市大學路1001號 科學一館2樓

系辦電話 (03)5722088 傳真 (03) 5724679 電子郵件:lcchang@math.nctu.edu.tw

本系網站資訊開放宣告

本系個人資料保護暨資訊安全宣言

最後更新:2018-03-15 05:36:51 PM (CST)