报告题目：A Few New Results in Network Embedding and Network Reliability

报 告 人：Dajin Wang（王大进）教授 美国蒙特克莱尔州立大学

照    片:

邀 请 人：朱强

报告时间：2020年11月12日上午9：00-11：00

Zoom会议ID：9871796000 会议密码：Ww4sCX

报告人简介： Dajin Wang received the B.Eng. degree in computer engineering from Shanghai University of Science and Technology in 1982, and the Ph.D. degree in computer science from Stevens Institute of Technology in 1990. Since 1990 he has been with the Department of Computer Science at Montclair State University, Montclair, New Jersey, where he is currently a Professor of Computer Science. He received several university-level awards for his scholarly accomplishments. He has held visiting positions in other universities, and has consulted in industry. His main research interests include interconnection networks, fault tolerant computing, algorithmic robotics, parallel processing, and wireless ad hoc and sensor networks. He has published over one hundred papers in these areas. Many of his works appeared in premier journals including IEEE Trans. on Computers, IEEE Trans. on Parallel & Distributed Systems, IEEE Trans. on Systems, Man and Cybernetics, IEEE Trans. on Reliability, J. of Parallel and Distributed Computing, Networks, and Parallel Computing. He has served on the program committees of influential conferences. He served as an Associate Editor of IEEE Transactions on Parallel and Distributed Systems from 2010 to 2014.

报告摘要： In this talk I will introduce our works that were recently accepted to publish in IEEE Transactions. I will first talk about an algorithm that constructs completely independently spanning trees (CISTs) in the Augmented Cube. I will then give an introduction to a newly proposed metric for networks’ reliability, and an application of the new metric to the hypercube.