應(yīng)yl7703永利官網(wǎng)徐守軍教授邀請(qǐng)，南京師范大學(xué)數(shù)學(xué)科學(xué)學(xué)院及數(shù)學(xué)研究所張曉巖教授將于2018年06月18日至21日訪問我校并作學(xué)術(shù)報(bào)告。
報(bào) 告1：Approximation Algorithm for Max Hypergraph Cut
時(shí) 間：06月19日下午16:00
地 點(diǎn)：齊云樓911 報(bào)告廳
摘 要：In this talk, we consider the design of randomized approximation algorithm for the Max Hypergraph Cut problem. This kind of problem generalizes some classical graph partition problems including Max Cut, Max Hypergraph Cut and Max Hypergraph Bisection, etc. We introduce a randomized approximation algorithm based on semidefinite prgramming relaxation which can improve the previous performance ratios of some classical problems.
報(bào) 告2：Belief Propagation and Chinese Postman Problems
時(shí) 間：06月20日上午10:30
地 點(diǎn)：齊云樓911 報(bào)告廳
摘 要：Belief Propagation (BP), a distributed, message-passing algorithm in machine Learning, has been widely used in different disciplines including information theory, artificial intelligence, statistics and combinatorial optimization problems in graphical models such as Bayesian networks and Markov random fields. Despite BP has a great success in many application fields and many progress about BP has been made, the rigorous analysis about the correctness and convergence of BP are known in only a few cases for arbitrary graph. With the goal of identifying the broadest class of optimization problems solvable using the simple BP algorithm directly, we will investigate the correctness and convergence of BP for determining the optimal solutions of the Chinese Postman problems in both undirected and directed graphs.
歡迎廣大師生參加！
報(bào)告人簡介
張曉巖, 2006年獲得南開大學(xué)博士學(xué)位、2014年獲得荷蘭Twente大學(xué)博士學(xué)位，南京師范大學(xué)數(shù)學(xué)科學(xué)學(xué)院及數(shù)學(xué)研究所教授，博士生導(dǎo)師，南京師范大學(xué)“百名青年領(lǐng)軍人才”、“青藍(lán)工程”優(yōu)秀中青年學(xué)術(shù)帶頭人，江蘇省六大人才高峰高層次人才，江蘇省運(yùn)籌學(xué)監(jiān)事會(huì)監(jiān)事，中國運(yùn)籌學(xué)圖論與組合分會(huì)青年理事，荷蘭在華學(xué)者協(xié)會(huì)會(huì)員，德國波恩大學(xué)離散數(shù)學(xué)研究所及英國倫敦大學(xué)皇家洛倫威學(xué)院訪問教授。主要從事圖上組合優(yōu)化及理論計(jì)算機(jī)科學(xué)的研究工作，發(fā)表在《SIAM J. COMPUTING》、《SIAM J. SCIENTIFIC COMPUTING》、《SIAM J. DISCRETE MATH》及《J. GTAPH THEORY》等國際著名SCI學(xué)術(shù)期刊，主持多項(xiàng)國家自然科學(xué)基金及省部級(jí)課題并著有英文學(xué)術(shù)論著兩部。
應(yīng)用數(shù)學(xué)與復(fù)雜系統(tǒng)省級(jí)重點(diǎn)實(shí)驗(yàn)室
yl7703永利官網(wǎng)
萃英學(xué)院
2018年06月15日
