中国计算机学会青年计算机科技论坛上海分论坛

CCF Young Computer Scientists & Engineers Forum Shanghai Branch

CCF YOCSEF 上海

于2010年9月28日星期二下午14:00-16:00在

南昌路47号科学会堂1201室

举行报告会，敬请光临

报告会主题

海外归国青年学者系列学术报告会

海外归国青年学者系列学术报告会旨在，促进上海各高校、研究部门的青年学者的学术交流，寻找合作契机，共同进步！其形式是邀请优秀的海外归国青年学者介绍最新研究成果，在和谐愉快的交流中，增进彼此的了解，结识更多的合作伙伴，以期有助于上海地区科研的发展。

该系列的第一次活动将于2010年9月28日在科学会堂举行。届时上海交通大学计算机科学与工程系的朱其立博士和陈翌佳博士将应邀做学术报告会。

程  序

13:30      签到

14:00      报告会开始 

特邀讲者：朱其立 博士，上海交通大学

演讲题目：Incremental Learning of Log Formats

特邀讲者：陈翌佳  博士，上海交通大学

演讲题目：Logic, Graphs and Parameterized Complexity

执行主席：董笑菊 上海交通大学，CCF YOCSEF上海AC委员

执行主席：薛广涛 上海交通大学，CCF YOCSEF上海荣誉委员

执行主席：戚正伟 上海交通大学，CCF YOCSEF学术委员会委员

特邀讲者：朱其立

Kenny Q. Zhu is an Associate Professor and Distinguished Research Fellow at Department of Computer Science and Engineering at Shanghai Jiao Tong University. He graduated with B.Eng (Hons) in Electrical Engineering in 1999 and PhD in Computer Science in 2005 from National University of Singapore. He was a postdoctoral researcher and lecturer from 2007 to 2009 in the programming language group at Princeton University. Prior to that , he was a software design engineer in the Windows Live Identity group of Microsoft in Redmond, WA. Kenny's main research interests are programming languages especially declarative languages, data processing and most recently, knowledge discovery. He has published in POPL, ICLP, SIGMOD, ICDE, ECML and other well known venues.

报告摘要：System logs come in a large and evolving variety of formats, many of which are semi-structured and/or non-standard. As a consequence, off-the-shelf tools for processing such logs often do not exist, forcing analysts to develop their own tools, which is costly and time-consuming. In this talk, we present an incremental algorithm that automatically infers the format of system log files. From the resulting format descriptions, we can generate a suite of data processing tools automatically. The system can handle large-scale data sources whose formats evolve over time. Furthermore, it allows analysts to modify inferred descriptions as desired and incorporates those changes in future revisions.

特邀讲者：陈翌佳

Yijia Chen is an associate professor of Shanghai Jiaotong University. He got his ph.d. in computer science from the same university, and a second ph.d. in mathematics from University of

Freiburg. He had also worked in University of Paris-Sud, France Telecom R&D, and Humboldt-University in Berlin as PostDoc. His main research interests are logic in computer science, computational complexity, and graph theory. His research appeared in LICS, ICALP, CSL, CiE, IWPEC, CCC, Theoretical Computer Science, Journal of Symbolic Logic, Journal of Logic and Computation, SIAM Journal on Computing, The Journal of Symbolic Logic, , etc.

报告摘要：Parameterized complexity provides a framework for refined analysis of those two-dimensional problems whose one part of the input is relatively small. For example, in themodel-checking problems, the length of the specifications is typically far smaller than the size of hardware or software systems; and in the clique problem, the size of the clique we are looking for is often much smaller than the size of the give graph.

In this talk, I will survey some results that parameterized complexity gives a satisfying picture of the complexity of certain problems, while classical complexity might not.

注：车可以停在南昌路57号，停车费10元，自理。