您现在的位置是:首页>通知公告 >详细内容


来源:作者:发布时间:2017年07月28日 浏览次数: [字体: ]

题目一:Circular-shift Linear Network Coding

内容简介:We study a class of linear network coding (LNC) schemes, called \emph{circular-shift} LNC, whose encoding operations at intermediate nodes consist of only circular-shifts and bit-wise addition (XOR). Departing from existing literature, we systematically formulate circular-shift LNC as a special type of vector LNC, where the local encoding kernels of an $L$-dimensional circular-shift linear code of degree $\delta$ are summation of at most $\delta$ cyclic-permutation matrices of size $L$. Under this framework, an intrinsic connection between scalar LNC and circular-shift LNC is established. In consequence, for some block lengths $L$, an $(L-1, L)$-fractional circular-shift linear solution of arbitrary degree $\delta$ can be efficiently constructed on a multicast network. With different $\delta$, the constructed solution has an interesting encoding-decoding complexity tradeoff, and when $\delta = (L-1)/2$, it requires fewer binary operations for both encoding and decoding processes compared with scalar LNC. While the constructed $(L-1, L)$-fractional solution has one-bit redundancy per edge transmission, we show that this is inevitable, and that circular-shift LNC is insufficient to achieve the exact capacity of multicast networks.

报告人:北京科技大学计算机与通信工程学院  孙奇福  副教授


时  间:2017年7月30日(周日)上午9:00始


题目二:Alphabet Size Reduction for Secure Network Coding: A Graph Theoretic Approach

内容简介:We consider a communication network where there exist wiretappers who can access a subset of channels, called a wiretap set, which is chosen from a given collection of wiretap sets. The collection of wiretap sets can be arbitrary. Secure network coding is applied to prevent the source information from being leaked to the wiretappers. In secure network coding, the required alphabet size is an open problem not only of theoretical interest but also of practical importance, because it is closely related to the implementation of such coding schemes in terms of computational complexity and storage requirement. We develop a systematic graph-theoretic approach for improving Cai and Yeung's lower bound on the required alphabet size for the existence of secure network codes. The new lower bound thus obtained, which depends only on the network topology and the collection of wiretap sets, can be significantly smaller than Cai and Yeung's lower bound. A polynomial-time algorithm is devised for efficient computation of the new lower bound.

Toward developing our lower bound and the efficient algorithm for computing this bound, we have introduced/discussed various graph-theoretic concepts. Although in this paper these concepts are applied solely in the context of secure network coding, they appear to be of fundamental interest in graph theory and we expect that they will find applications in graph theory and beyond.

报告人:南开大学数学科学学院  光炫  副教授

报告人简介:光炫博士,南开大学数学科学学院副教授,硕士生导师。2012 年毕 业于南开大学陈省身数学研究所,获博士学位。在美国南加州大学通信科学研究所与香港中文大学网络编码研究所从事博士后研究。研究方向为信息论、编码理论与密码学;目前的研究兴趣为网络信息论、网络编码理论、网络函数计算理论。光炫博士在国内外期刊和会议上共发表学术论文 30 余篇,其中包括信息论领域的顶级杂志 IEEE Trans. Inf. Theory;出版学术专著一部,由德国 Springer 出版社出版发行。2016 年获得“香江学者”奖;2015年入选天津市“131 创新人才计划”第三梯队人选;2014 年获得天津市优秀博士学位论文奖;2014 年入选天津市“三年千人”人才计划;2013 年获得第二十届信息论年会最佳报告奖;获得 2011 年 IEEE 国际信息论与信息安全会议杰出论文奖。

时  间:2017年7月30日(周日)上午9:30始


题目三:Unified Analytical Volume Distribution of the Typical Cell of Poisson-Delaunay Triangulations and Its Application in Small Cell Networks

内容简介:As a long-standing open problem in the field of stochastic geometry, the probability density function (PDF) and cumulative distribution function (CDF) of the volume of the typical cell, for Poisson-Delaunay tessellations in $d$-dimensional Euclidean space $\mathbb{R}^{d}$, are analytically reported in this talk. As an illustrative application, the void cell effect of small cell networks in the forthcoming 5G wireless communications, which was generally overlooked in the open literature due to extreme difficulty of mathematical tractability, is analytically investigated.

报告人:中山大学数据电子与信息工程学院  夏明华  教授

报告人简介:夏明华于2007年6月在中山大学获得通信与信息系统专业博士学位,从2015年1月起,受“百人计划”引进人才项目资助,在中山大学电子与信息工程学院任教授、博士生导师,目前担任移动通信国家工程研究中心中山大学分中心主任。从2007至2009年,夏博士在韩国电子通信研究院北京研发中心先后担任工程师和高级工程师,主要参与3GPP LTE移动通信系统的标准化工作。从2010至2014年,他先后在香港大学,沙特国王阿卜杜拉科技大学和加拿大国立科学研究院从事博士后研究工作。他的研究领域包括大规模多天线技术、小蜂窝网络、网络功能虚拟化,以及无线能量传输/能量收集技术及系统开发。更多信息请参考:http://seit.sysu.edu.cn/teacher/86

时  间:2017年7月30日(周日)上午10:00始


题目四:Computation Offloading for Mobile Edge Computing

内容简介:Mobile edge computing is a new paradigm to leverage a multitude of collaborative end-user devices and/or near-user infrastructure to carry out a substantial amount of communication and computation tasks. Along this line, in this talk I will present our recent studies on three different applications: (1) a distributed multi-user computation offloading algorithm for mobile-edge cloud computing in a multi-channel wireless environment; (2) a novel self-organized mobile crowd-sourcing framework to exploit user workers at the mobile network edge for fulfilling quick and high-quality mobile tasks in real-time; (3) a socially-driven prefeteching mechanism that adopts the mobile-inference and edge-training architecture for reducing user’s mobile multimedia access delay. These results demonstrate the profound benefits enabled by mobile edge computing.

报告人:中山大学数据科学与计算机学院  陈旭  教授

报告人简介:陈旭教授2012年于香港中文大学信息工程系获得博士学位,2012年到2014年在美国亚利桑那州立大学网络信息实验室从事博士后研究,2014年到2016年,获世界著名的洪堡基金会资助成为“洪堡学者”,在德国哥廷根大学从事科研工作。2016年9月作为“百人计划”青年杰出人才加入中山大学数据科学与计算机学院,任教授、博导,并入选第十三批国家中组部“千人计划”青年项目。迄今在IEEE Journal on Selected Areas in Communications、IEEE/ACM Transactions on Networking、IEEE Transactions on Mobile Computing、 IEEE INFOCOM、IEEE ICDCS、ACM MOBIHOC、ACM MM等国际著名会议与权威期刊发表论文60余篇,ESI高被引论文3篇。以第一作者身份获得CCFA类国际会议IEEE INFOCOM的最佳论文亚军奖、IEEE ICC最佳论文奖以及IEEE ISI的最佳论文荣誉提名奖。获邀担任国SCI期刊IEEE Access Journal, EURASIP Journal on Wireless Communications and Networking副编辑,Springer Handbook of Cognitive Radio领域编辑, 以及国际期刊International Journal of Big Data Intelligence专刊编委。同时担任2017年度 IEEE WCNC无线网络分会主席,2015年度国际会议ISVC专区主席, 以及2014年度国际会议NetCoop大会宣传主席,并多次出任包括国际著名会议ACM MOBIHOC,IEEE INFOOCM, IEEE旗舰会议GLOBECOM、ICC、WCNC等大会技术程序委员会成员。

时  间:2017年7月30日(周日)上午10:30始


地  点:南海楼338室









[打印文章] [添加收藏]