您的瀏覽器不支援JavaScript功能，若網頁功能無法正常使用時，請開啟瀏覽器JavaScript狀態。 吳若禹老師
跳到主要內容區
:::

資訊分類清單

學年度行事曆(另開新視窗)
文書組公文及掛號郵件查詢(另開新視窗)

235931
:::
  1. 首頁
  2. 師資介紹
  3. 專任師資

吳若禹老師

Eric

職　　稱：教授
分　　機：6103
研 究  室：商科大樓(K棟) K211-5
電子郵件：eric@mail.lhu.edu.tw
專　　長：

  1. 可靠度分析
  2. 計算機概論
  3. 網路程式
  4. 演算法
  5. 管理數學 ,工程經濟
  6. 設施規劃

  • 學歷

  1. 台灣科技大學資管所博士
  2. 成功大學工業管理研究所碩士
  3. 東海大學工業工程學系學士
     

  • 現職

  1. 龍華科技大學工業管理系專任教授

  • 經歷

  1. 龍華科技大學工管系專任副教授
  2. 龍華技術學院工管系專任講師
  3. 實密科技有限公司儲運副理  
  4. 美商普強台灣分公司生產計劃師
  5. 英業達股份有限公司製程品管工程師

  • 科技部計畫

  1. 扇形圖生成樹詞典序列的列舉和排位/反排位演算法 (MOST 111-2221-E-262-004-)， 2022/08/01~2023/07/31
  2. (k,m)元樹之格雷碼定序與反定序研究 (MOST 110-2221-E-262-002-)，2021/08/01~2022/07/31
  3. 以項鍊字串的排位與反排位算法有效產生 de Bruijn 序列 (MOST 108-2115-M-262-001)， 2019/08/01～2020/07/31
  4. 格雷碼次序下二元樹左權重和左子序列之次序與反次序及無迴圈列舉演算法 (MOST 104-2221-E-262-005-)，2015/08/01~2016/07/31 
  5. 同時列舉數個二元樹序列之無迴圈演算法 (MOST 103-2221-E-262 -023 -)，2014/8/1~~2015/7/31
  6. 以格雷碼次序列舉k元樹的無迴圈演算法 (NSC 102-2221-E-262-013-)，2013/8/1~~2014/7/31
  7. 格雷碼次序不規則樹之次序及反次序演算法 (NSC 101-2221-E-262-020-)，2012/8/1~~2013/7/31
  8. 多種不同平衡括弧字串表示法之次序及反次序研究 (NSC 100-2221-E-262-019-)，2011/8/1~~2012/7/31
  9. 指定分枝度的不規則樹格雷碼圖之漢米爾敦研究 (NSC 99-2221-E-262-013-)，2010/8/1~~2011/7/31
  10. 指定分枝度不規則樹之次序及反次序 (NSC 98-2221-E-262-010-)，2009/8/1~~2010/7/31

  • 學術期刊論文

  1. Kung-Jui Pai, Ro-Yu Wu, Sheng-Lung Peng, Jou-Ming Chang, Three edge-disjoint Hamiltonian cycles in crossed cubes with applications to fault-tolerant data broadcasting. J. Supercomput. 79(4): 4126-4145 (2023)
  2. Yu-Hsuan Chang, Ro-Yu Wu, Ruay-Shiung Chang, Jou-Ming Chang, Improved algorithms for ranking and unranking (k, m)-ary trees in B-order. J. Comb. Optim. 44(3): 1495-1510 (2022)
  3. Yu-Hsuan Chang, Ro-Yu Wu, Cheng-Kuan Lin, Jou-Ming Chang, A loopless algorithm for generating (k, m)-ary trees in Gray code order. Optim. Lett. 15(4): 1133-1154 (2021)
  4. Kung-Jui Pai, Ruay-Shiung Chang, Ro-Yu Wu, Jou-Ming Chang, Three completely independent spanning trees of crossed cubes with application to secure-protection routing. Inf. Sci. 541: 516-530 (2020)
  5. Kung-Jui Pai, Jou-Ming Chang, Ro-Yu Wu, Shun-Chieh Chang: Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order. Discret. Appl. Math. 268: 223-236(2019)
  6. Shih-Shun Kao, Kung-Jui Pai, Sun-Yuan Hsieh, Ro-Yu Wu, Jou-Ming Chang、2019、Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks. J. Comb. Optim. 38(3): 972-986
  7. Kung-Jui Pai, Ruay-Shiung Chang, Ro-Yu Wu, Jou-Ming Chang、2019、A two-stages tree-searching algorithm for finding three completely independent spanning trees. Theoretical Computer Science, Vol. 784 pp. 65-74
  8. Jou-Ming Chang, Kung-Jui Pai, Ro-Yu Wu, Jinn-Shyong Yang、2019、The 4-component connectivity of alternating group networks Theoretical Computer Science, Vol.766 pp. 38-45
  9. Yu-Sheng  Huang, Sheng-Lung Peng, Ro-Yu Wu、2016、An Improved Algorithm for the node-to-set disjoint paths problem on bi-rotator graphs. Vol. 16, Nos. 3 & 4 pp. 1-18
  10. Kung-Jui Pai, Jou-Ming Chang, Jinn-Shyong Yang, Ro-Yu Wu、2016、Corrigendum to “Incidence coloring on hypercubes” [Theoret. Comput. Sci. 557 (2014) 59–65] , Vol. 651, pp. 87-88
  11. Jou-Ming Chang, Xiang-Rui Chen, Jinn-Shyong Yang, Ro-Yu Wu、 2016、Locally exchanged twisted cubes: Connectivity and super connectivity、Information Processing Letters, Vol. 116, pp. 460–466
  12. Ro-Yu Wu, Jou-Ming Chang, Sheng-Lung Peng, Chun-Liang Liu、2016、Gray-code Ranking and Unranking on Left-weight sequences of Binary Trees、IEICE TRANS. FUNDAMENTALS, Vol.E99-A,No.6
  13. Kung-Jui Pai, Jou-MingChang, Jinn-ShyongYang, Ro-Yu Wu、 2014、Incidence coloring on hypercubes、Theoretical Computer Science, Vol. 557, pp. 59-65
  14. Ro-Yu Wu, Jou-Ming Chang, Hung-Chang Chan, Kung-Jui Pai、 2014、A loopless algorithm for generating multiple binary tree sequences simultaneously、Theoretical Computer Science, Vol. 556, pp. 25-33
  15. Kung-Jui Pai, Jou-Ming Chang, Yue-Li Wang, Ro-Yu Wu、2014、Queue Layouts of Toroidal Grids、IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, Vol.E97-A, No.6, pp.1180-1186 
  16. Ro-Yu Wu, J. M. Chang, An-Hang Chen, Chun-Liang Liu、2013、Ranking and Unranking t-ary Trees in a Gray-code Order、The Computer Journal, Vol. 56, No. 11, pp. 1388-1395.
  17. Ro-Yu Wu, J. M. Chang, An-Hang Chen, Ming-Tat Ko、2013、Ranking and Unranking of Non-regular Trees in Gray-code Order、IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E96-A, No. 6, pp. 1059-1065
  18. Ro-Yu Wu, J. M. Chang, Kung-Jui Pai and Yue-Li Wang、2011、Amortized Efficiency of Generating Planar Paths in Convex Position、Theoretical Computer Science Vol. 412, pp. 4504-4512.
  19. Ro-Yu Wu, J. M. Chang, Chir-Ho Chang、2011、Ranking and Unranking of Non-regular Trees with a Prescribed Branching Sequence、Mathematical and Computer Modelling、Vol 53,Issues 5-6、pp.1331-1335
  20. Ro-Yu Wu, J. M. Chang, Y. L. Wang、2011、Ranking and Unranking of t-ary Trees Using RD-sequences、IEICE Transactions on Information and Systems、Vol.E94-D No.2、pp.226-232
  21. Ro-Yu Wu, Jou-Ming Chang, Yue-Li Wang、2010、Loopless Generation of Non-regular Trees with a Prescribed Branching Sequence、The computer Journal、 Vol.53, No.6、pp.661-666
  22. Jou-Ming Chang and Ro-Yu Wu、2009、On the Diameter of Geometric Path Graphs of Points in Convex Position、Information Processing Letters、109(8)、409-413
  23. Ro-Yu Wu, Jou-Ming Chang, Yue-Li Wang、2006、A Linear Time Algorithm for Binary Tree Sequences Transformation Using Left-arm and Right-arm Rotations、Theoretical Computer Science Vol. 355, pp. 303-314.
     
瀏覽數: