著作 
名稱  R.M. Owens, M.J. Irwin, R.S. Bajvoa, T.P. Kelliher, Mohan Vishwanth, W.L. Yang, “The Design and Implementation of the Arithmetic Cube II, A VLSI Signal Processing System,” IEEE Transactions on VLSI Systems, Vol. 1, No. 4, December 1993, pp. 491502. (SCI) 
年度  1993 
類別  期刊論文 
摘要  
關鍵字  
名稱  W.L. Yang, R.M. Owens, M.J. Irwin, 1995, “Lower bound study on the interconnect complexity of the decomposed finite state machine,” IEE Proceedings Computers and Digital Techniques, vol. 142, No.5, September 1995, pp.332336. (SCI) 
年度  1995 
類別  期刊論文 
摘要  
關鍵字  
名稱  W.L. Yang, R.M. Owens, M.J. Irwin, 1995, “Lower bound study on the interconnect complexity of the decomposed finite state machine,” IEE Proceedings Computers and Digital Techniques, vol. 142, No.5, September 1995, pp.332336. (SCI) 
年度  1995 
類別  期刊論文 
摘要  
關鍵字  
名稱  WenLin Yang, “GraphBased Method for Computing Interconnect Complexity,” 國立屏東商專學報, vol. V, May 1997, pp. 189201. 
年度  1997 
類別  期刊論文 
摘要  
關鍵字  
名稱  WenLin Yang, “Implementing a CAE tool on the WorldWide Web,” 國立屏東商專學報, vol. VI, May 1998, pp. 153168. 
年度  1998 
類別  期刊論文 
摘要  
關鍵字  
名稱  WenLin Yang, “A distributed processing architecture for a remote simulation system in a multiuser environment,” Computers in Industry, Vol.40, Elsevier Science, 1999, pp. 1522. (SCI) (國科會計畫：NSC872213E251005) 
年度  1999 
類別  期刊論文 
摘要  
關鍵字  
名稱  楊文霖, “全球資訊網在樹脂轉注成型製程的數值模擬上之應用研究,”工程科技通訊, 第四十二期, 1999年12月, pp. 3637. 
年度  1999 
類別  期刊論文 
摘要  
關鍵字  
名稱  WenLin Yang, “A distributed processing architecture for a remote simulation system in a multiuser environment,” Computers in Industry, Vol.40, Elsevier Science, 1999, pp. 1522.(SCI) 
年度  1999 
類別  期刊論文 
摘要  
關鍵字  
名稱  WenLin Yang, “The Application of Distributed Genetic Algorithms on a Heating Process Design Problem,” 國立屏東商業技術學院學報, 第二期, 2000年, pp. 1322. 
年度  2000 
類別  期刊論文 
摘要  
關鍵字  
名稱  楊文霖,“隨選視訊網路上多條影音串流分配問題之研究,”國立屏東商業技術學院學報, 第三期, 2001年, pp. 253270. 
年度  2001 
類別  期刊論文 
摘要  
關鍵字  
名稱  WenLin Yang, “Exact and Heuristic Algorithms for MultiConstrained Path Selection Problem,” Lecture Notes in Computer Science, Vol. 2532, SpringerVerlag, 2002, pp. 952~959. (SCI) 
年度  2002 
類別  期刊論文 
摘要  
關鍵字  
名稱  WenLin Yang, “A tabusearch based algorithm for the multicaststreams distribution problem,” Computer Networks, Vol. 39(6), Elsevier Science, 2002, pp. 729747. (SCI) (國科會計畫：NSC902213E251002). 
年度  2002 
類別  期刊論文 
摘要  
關鍵字  
名稱  WenBin Young and WenLin Yang, “The Effect of Solder Bump Pitch on the Underfill Flow,” IEEE Transactions on Advanced Packing, Vol. 25, No. 4, November, 2002, pp. 537 ~ 542. (SCI) 
年度  2002 
類別  期刊論文 
摘要  
關鍵字  
名稱  WenBin Young and WenLin Yang, “Underfill Viscous Flow Between Parallel Plates and Solder Bumps,” IEEE Transactions on Components and Packing Technologies, Vol.25, No. 4, December 2002, pp. 695~700. (SCI) 
年度  2002 
類別  期刊論文 
摘要  
關鍵字  
名稱  楊文霖, 羅綜民, 謝淑音, 張秀玉, 張成龍, “網路服務應用系統KTV歡唱服務,” 樹德科技大學學報, 第四卷, 第二期, 2002年8月, pp. 265~275. 
年度  2002 
類別  期刊論文 
摘要  
關鍵字  
名稱  WenLin Yang, “A tabusearch based algorithm for the group multicast routing problem,” 國立屏東商業技術學院學報, 第四期, 2002年, pp. 43~53. 
年度  2002 
類別  期刊論文 
摘要  
關鍵字  
名稱  WenLin Yang, “Exact and Heuristic Algorithms for MultiConstrained Path Selection Problem,” Lecture Notes in Computer Science, Vol. 2532, SpringerVerlag, 2002, pp. 952~959.(SCI) 
年度  2002 
類別  期刊論文 
摘要  
關鍵字  
名稱  WenLin Yang, “A tabusearch based algorithm for the multicaststreams distribution problem,” Computer Networks, Vol. 39(6), Elsevier Science, 2002, pp. 729747.
(SCI) 
年度  2002 
類別  期刊論文 
摘要  
關鍵字  
名稱  WenBin Young and WenLin Yang, “The Effect of Solder Bump Pitch on the Underfill Flow,” IEEE Transactions on Advanced Packaging, Vol. 25, No. 4, November, 2002, pp. 537 ~ 542.(SCI) 
年度  2002 
類別  期刊論文 
摘要  
關鍵字  
名稱  WenBin Young and WenLin Yang, “Underfill Viscous Flow Between Parallel Plates and Solder Bumps,” IEEE Transactions on Components and Packaging Technologies, Vol.25, No. 4, December 2002, pp. 695~700.(SCI) 
年度  2002 
類別  期刊論文 
摘要  
關鍵字  
名稱  WenLin Yang, “A Heuristic Algorithm for the Multiconstrained Multicast Tree,” Lecture Notes in Computer Science, Vol. 2839, SpringerVerlag, 2003, pp. 78~89. (SCI) 
年度  2003 
類別  期刊論文 
摘要  
關鍵字  
名稱  WenLin Yang, “A Heuristic Algorithm for the Multiconstrained Multicast Tree,” Lecture Notes in Computer Science, Vol. 2839, SpringerVerlag, 2003, pp. 78~89. (SCI) 
年度  2003 
類別  期刊論文 
摘要  
關鍵字  
名稱  楊文霖, “以Tabusearch近似演算法處理多址傳播影音串流的最佳傳送問題,” 網際網路技術學刊 (Journal of Internet Technology), Vol. 4, No. 1, 2003, pp. 9 ~ 18. 
年度  2003 
類別  期刊論文 
摘要  
關鍵字  
名稱  WenLin Yang, “Optimal and Heuristic Algorithms for QualityofService Routing with Multiple Constraints,” Performance Evaluation, Vol. 57(3), Elsevier Science, 2004, pp. 261278. (SCI) (國科會計畫：NSC912213E251001). 
年度  2004 
類別  期刊論文 
摘要  
關鍵字  
名稱  WenLin Yang, “Optimal and Heuristic Algorithms for QualityofService Routing with Multiple Constraints,” Performance Evaluation, Vol. 57(3), Elsevier Science, 2004, pp. 261278. (SCI) 
年度  2004 
類別  期刊論文 
摘要  
關鍵字  
名稱  WenLin Yang, “A Comparison of Two Optimal Approaches for the MCOP Problem,” Journal of Computer and Network Applications, Vol. 27(3), Elsevier Science, 2004, pp. 151162. (SCI) 
年度  2004 
類別  期刊論文 
摘要  
關鍵字  
名稱  WenBin Young and WenLin Yang, “Underfill of FlipChip: The Effect of Contact Angle and Solder Bump Arrangement,” IEEE Transactions on Advanced Packaging, Vol. 29, No. 3, August, 2006, pp. 647 ~ 653. (SCI) 
年度  2006 
類別  期刊論文 
摘要  
關鍵字  
名稱  WenLin Yang and LungJen Wang, “The investigation of delayconstrained
multicasting with minimumenergy consumption in static ad hoc wireless networks,”
International Journal of Ad Hoc and Ubiquitous Computing, Vol. 4, No. 3/4, 2009, pp. 237~250. (SCIE)(國科會計畫：NSC942213E251003) 
年度  2009 
類別  期刊論文 
摘要  
關鍵字  
名稱  WenLin Yang, ChiChou Kao and ChengHuang Tung, “Heuristic Algorithms for
constructing interferencefree and delayconstrained multicast trees for wireless mesh
networks,” KSII Transactions on Internet and Information Systems, vol.5, no.2, pp. 269286,2011. (SCIE) 
年度  2011 
類別  期刊論文 
摘要  In this paper, we study a problem that is concerning how to construct a delayconstrained
multicast tree on a wireless mesh network (WMN) such that the number of serviced clients is
maximized. In order to support highquality and concurrent interferencefree transmission
streams, multiple radios are implemented in each mesh node in the WMNs. Instead of only
orthogonal channels used for the multicast in the previous works, both orthogonal and partially
overlapping channels are considered in this study. As a result, the number of links successfully
allocated channels can be expected to be much larger than that of the approaches in which only
orthogonal channels are considered. The number of serviced subscribers is then increased
dramatically. Hence, the goal of this study is to find interferencefree and delayconstrained
multicast trees that can lead to the maximal number of serviced subscribers. This problem is
referred as the MRDCM problem. Two heuristics, loadbased greedy algorithm and
loadbased MCM algorithm, are developed for constructing multicast trees. Furthermore, two
loadbased channel assignment procedures are provided to allocate interferencefree channels
to the multicast trees. A set of experiments is designed to do performance, delay and efficiency
comparisons for the multicast trees generated by all the approximation algorithms proposed in
this study. 
關鍵字  
名稱  Channel Allocation Strategies for InterferenceFree Multicast in MultiChannel MultiRadio Wireless Mesh Networks 
年度  2012 
類別  期刊論文 
摘要  Given a video stream delivering system deployed on a multicast tree, which is embedded in a multichannel multiradio wireless mesh network, our problem is concerned about how to allocate interferencefree channels to tree links and maximize the number of serviced mesh clients at the same time. In this paper, we propose a channel allocation heuristic algorithm based on bestfirst search and backtracking techniques. The experimental results show that our BFB based CA algorithm outperforms previous methods such as DFS and BFS based CA methods. This superiority is due to the backtracking technique used in BFB approach. It allows previous channelallocated links to have feasibility to select the other eligible channels when no conflictfree channel can be found for the current link during the CA process. In addition to that, we also propose a tree refinement method to enhance the quality of channelallocated trees by adding uncovered destinations at the cost of deletion of some covered destinations. Our aim of this refinement is to increase the number of serviced mesh clients. According to our simulation results, it is proved to be an effective method for improving multicast trees produced by BFB, BFS and DFS CA algorithms. 
關鍵字  Channel Allocation, interference free, multicast, best first, backtracking, wireless mesh networks 
名稱  A crosslayer optimization for maximumrevenuebased multicast in multichannel multiradio wireless mesh networks 
年度  2013 
類別  期刊論文 
摘要  Given a video/audio streaming system installed on a multichannel multiradio wireless mesh network, we are interested in a problem concerning about how to construct a delayconstrained multicast tree to support concurrent interferencefree transmissions so that the number of serviced mesh clients is maximized. In this paper, we propose a heuristic approach called crosslayer and loadoriented (CLLO) algorithm for the problem. On the basis of the crosslayer design paradigm, our CLLO algorithm can consider application demands, multicast routing, and channel assignment jointly during the formation of a channelallocated multicast tree. The experimental results show that the proposed CLLO outperforms the layered approaches in terms of the number of serviced mesh clients and throughputs. This superiority is due to information from higher layers can be used to guide routing selection and channel allocation at the same time. As a result, the CLLO algorithm can explore more solution spaces than the traditional layered approaches. In addition to that, we also propose a channel adjusting procedure to enhance the quality of channelallocated multicast trees. According to our simulations, it is proved to be an effective method for improving the performance of the proposed CLLO algorithm. Copyright c 2013 John Wiley & Sons, Ltd.

關鍵字  wireless mesh networks;crosslayer;multichannel; multiradio; channel allocation; 
名稱  Constructing Resource Constrained Multicast Trees on WDM Networks with Limited LightSplitting 
年度  2015 
類別  期刊論文 
摘要  Traditionally, the optimization goal of multicast
routing in WDM optical networks is to minimize the number of
wavelengths and fibers used for the multicasting. In this paper,
we consider a problem concerned about how to multicast
several video streams simultaneously to a number of clients in a
given WDM network with sparse light spitting, where the
number of wavelengths on each link is given in advance. Our
goal is to construct a number of multicast trees for all required
streams so that the multiple constraints: bandwidth, delay and
multicast capability, are satisfied and the total number of clients
participating in all multicast sessions is also maximized. This
problem is referred as profitoriented and delayconstrained
group multicast routing ( 𝐏𝐃𝐆𝐑𝐌 ) problem. Two heuristic
algorithms are proposed in this paper for this NPhard problem.
A set of experimental results are also provided to compare the
performances of our heuristics with previous methods
published in literature. 
關鍵字  Group multicasting, light splitting, profit maximization, WDM networks 
名稱  Optimal and heuristic algorithms for constructing interferencefree multicast trees subject to delay and energy constraints on wireless mesh networks 
年度  2016 
類別  期刊論文 
摘要  Due to the great concerns of environmental protection and the high rising of prices in
oil, energy efficiency has become an important factor for designing network applications. In this
paper, we study an optimisation problem which is concerned about how to construct an Interferencefree
multicast tree subject to delay and energy constraints on a multichannel multiradio wireless
mesh network. Our objective is to maximise the number of mesh clients that can be included
in the multicast tree. This problem is referred as the EDMRM problem. To solve it, we first
propose an optimal algorithm on the basis of integer linear programming (ILP) for the EDMRM
problem. Since the ILPbased method is only feasible for smallscale networks, we also provide a
tabubased heuristic algorithm for solving practical networks that consist of a large number of nodes.
The experimental results show that our tabubased heuristic can outperform the other previously
proposed methods. 
關鍵字  wireless mesh networks; delay and energy constraints; tabu; ILP; integer linear programming; optimal algorithm; interferencefree multicast trees. 
名稱  Optimal and heuristic algorithms for alloptical group multicast in resourceconstrained WDM networks 
年度  2016 
類別  期刊論文 
摘要  Given a sparsesplitting wavelengthdivision multiplexing network with no wavelength converter, we study a group multicast problem that is how to transmit a number of multicast streams from the video server to multiple destinations simultaneously. To avoid the situation that the wavelengths are used up by the first few requests, one wavelength is available for each multicast request. Hence, some of destinations may not be included in the multicast trees because of the lack of wavelengths. Our goal is to construct a number of light trees with conflictfree wavelengths for multiple requests so that the number of served clients is maximized. This problem is named as the revenuemaximized and delayconstrained group multicast routing problem. We first determine a set of multicast trees with the maximum number of served clients, then followed by the wavelength assignment to allocate the minimum number of wavelengths to the resulting trees. In this study, we propose two Integer Linear Programming ILPbased algorithms for determining the optimal solutions for the lighttree construction problem and the wavelength assignment problem, respectively. For largescale networks, two heuristics are introduced to solve the lighttree construction problem approximately. A set of simulations are also provided for comparing performances of our algorithms against the other published methods. 
關鍵字  WDM networks; group multicast; sparse splitting; light tree; revenue maximized; wavelength assignment 
名稱  WenLin Yang and WanTing Hong, “A Joint Consideration of Channel Assignment and Multicast Routing in MCMR WMNs,” 2012 7th International ICST Conference on Communications and Networking in China (CHINACOM), Aug. 2012, Kunming, China. (IEL DL) 
年度  2012 
類別  研討會 
摘要  
關鍵字  
名稱  WenLin Yang and Peiheng Wang, “A tabubased algorithm for constructing multicast trees under energy and delay constraints, ”Proceedings of 10th IEEE Vehicular Technology Society Asia Pacific Wireless Communications Symposium (IEEE VTS APWCS 2013), Aug. 2223, 2013, Seoul, Korea. 
年度  2013 
類別  研討會 
摘要  
關鍵字  