科学研究

台湾清华大学葉維彰教授学术报告通知

来源:科学研究 阅读次数:167 发布时间: 2017-05-04

报告题目A Novel Algorithm for finding all New Minimal Paths in Modified Network Problems

报  告 人維彰(Wei-Chang Yeh

主  持 人左明健教授(国家“千人计划”入选者)

报告时间201758日(星期一) 14:30-16:00

报告地点主楼C1-213


报告内容摘要

It is common to expand or reinforce networks by adding new paths, and such new networks are called modified networks. To evaluate modified networks, the reliability, in which minimal paths (MPs) play an important role, is a significant index. The existing related methods all have duplicate MP/sub-path issues and take exponential time to locate and remove duplicate MPs/sub-paths. A novel algorithm is proposed to solve this MP problem without relocating all MPs. Based on the proposed novel prime shortest path (PSP) approach, the proposed algorithm is able to self-detect and avoid any duplication in polynomial time, which is a considerable improvement to existing algorithms.


报告人简介

維彰(Wei-Chang Yeh)博士现为台湾清华大学工业工程及工程管理学院杰出教授Distinguished Professor),国际知名期刊IEEE Transactions on Reliability副主编Soft Computing with Applications主编,并担任多个协会和学术组织的高级会员(如Senior Member of the Institute of Electrical and Electronics Engineers, IEEE)。5在国际知名期刊(如Reliability Engineering andSystem SafetyIEEE Transactions on Neural Networks and Learning Systems)发表SCI收录期刊论文40余篇,国际会议论文40余篇,获得授权发明专利15余项(其中美国授权发明专利2)。论文总计被引用2388次,现H因子为26Google Scholar统计);主持重要项目5项。由于叶教授在工业工程等领域的杰出贡献,被多个国际会议邀请做大会特邀报告(Keynote Speaker),并荣获民国103年度台湾科技部杰出研究奖、民国104年度中国工业工程学会工业工程奖章等荣誉。

                    欢迎广大师生积极参与!