清华讲座预告_北大清华讲座一周预告_清华大学讲座-经管之家官网!

人大经济论坛-经管之家 收藏本站
您当前的位置> 大学>>

清华大学

>>

清华讲座预告_北大清华讲座一周预告_清华大学讲座

清华讲座预告_北大清华讲座一周预告_清华大学讲座

发布:土豆大土豆 | 分类:清华大学

关于本站

人大经济论坛-经管之家:分享大学、考研、论文、会计、留学、数据、经济学、金融学、管理学、统计学、博弈论、统计年鉴、行业分析包括等相关资源。
经管之家是国内活跃的在线教育咨询平台!

经管之家新媒体交易平台

提供"微信号、微博、抖音、快手、头条、小红书、百家号、企鹅号、UC号、一点资讯"等虚拟账号交易,真正实现买卖双方的共赢。【请点击这里访问】

提供微信号、微博、抖音、快手、头条、小红书、百家号、企鹅号、UC号、一点资讯等虚拟账号交易,真正实现买卖双方的共赢。【请点击这里访问】

清华讲座预告_北大清华讲座一周预告_清华大学讲座2015-04-2909:30TheoriginofMarcustheoryandofitsconsequencesasviewedbyachemist报告题目:TheoriginofMarcustheoryandofitsconsequencesasviewedbyachemist报告人: ...
坛友互助群


扫码加入各岗位、行业、专业交流群


清华讲座预告_北大清华讲座一周预告_清华大学讲座

2015-04-2909:30 The origin of Marcus theory and of its consequences as viewed by achemist

报告题目:

Theorigin of Marcus theory and of its consequences as viewed by a chemist

报告人:

ProfessorJean-Marie André教授

报告时间:

2015-04-2909:30

报告地点:

何添楼406室

主办单位:

化学系帅志刚课题组

简介:

报告摘要

It isstriking to note that the transition state theory has been applied extensivelyin quantum chemistry as soon as the computational facilities have enabled to doit while Marcus Electron Transfer (ET) theory has only been used systematicallyin the last decades.We believe thatthere are two basic reasons for that situation; first, the validity of Marcustheory has only been experimentally validated in the beginning of the80's.Secondly, the advent of organicmaterial science and, in particular, the development of OrganicElectroluminescent Diodes (OLED's) have given a strong impulse to quantumchemical calculations related to Electron and Energy Transfer in and betweenmolecules.It should be mentioned thatthe advanced information displayed by the Nobel committee concerning the NobelPrize in chemistry 2000 on conductive polymers of Heeger, MacDiarmid andShirakawa has a full section entitled "molecular electron-transfertheory" (1)

Wediscuss Marcus theory in its classical and semi-classical formulations.We pay attention to aspects that are notgenerally presented in the literature and that, in our opinion, are valuable tostate in the case of polymer chains.Weshow by a few examples selected in our work on conjugated polymers how Marcusformulation can be successfully applied to the elucidation of practicalproblems in conducting and semi-conducting systems and in electroluminescenteffects (2).

References

(1)see http://www.nobel.se/chemistry/laureates/2000/chemadv.pdf, p.11

(2)J.M. André, Computational quantum chemistry on polymer chains: Aspects of thelast half century, to be published in "Theory and Applications ofComputational Chemistry: The First 40 Years", A Volume of Technical andHistorical Perspectives, Clifford E. Dykstra, Gernot Frenking, Kwang S. Kim,and Gustavo Scuseria, Eds., Elsevier, In press (2005)

2015-04-2814:00 Optimal Binary Comparison Search Trees

报告题目:

OptimalBinary Comparison Search Trees

报告人:

MordecaiGOLIN

报告时间:

2015-04-2814:00

报告地点:

FIT1-222

主办单位:

交叉信息研究院

简介:

内容简介:Historically,constructing optimal (minimum average search time) binary search trees(BSTs) is one of the canonical examples ofdynamic programming.In 1971, Knuthdescribed how to solve this problem in O(n^2) time, with input specifying the probability of the differentsuccessful and unsuccessful searches.While the trees constructed were binary, the comparisons used wereternary. Successful searches terminated at internal nodes and unsuccessfulsearches at leaves.

Bycontrast, in binary comparison trees (BCSTs), internal nodes perform binary comparisons; the search branchesleft or right depending upon the comparison outcome and all searches terminateat leaves. Polynomial algorithms exist for solving the optimal BCST problemrestricted to successful searches.Huand Tucker gave an O(n log n) algorithm when all comparisons are the inequality“<”;Anderson et. al. developed anO(n^4)algorithm when both “<” and“=” comparisons are allowed.

Inthis talk we present the first polynomial time algorithms for solving theoptimal BCSTproblem when unsuccessfulsearches are included in the input and any set of comparisons are permitted.Our running times depend upon the comparisons allowed.If equality is not allowed, our algorithmruns in O(n log n) time; if equality is allowed, O(n^4). We also demonstrateO(n) time algorithms that yield almost optimal binary comparison trees, withtree cost within constant additive factor of optimal.

Thisis joint work with Marek Chrobak,IanMunro and Neal Young.

个人简介:Afterreceiving his doctorate from Princeton University in 1990, Dr Golin worked as aresearcher in the Projet Algorithmes of the Institut National de Recherche enInformatique et en Automatique (INRIA) in Rocquencourt, France before arrivingat HKUST in 1993. Since then, has also been a visiting researcher at theMax-Planck-Institut fur Informatik in Saarbrucken, Germany, INRIA-Sophia inFrance, AT&T Labs-Research, and DIMACS. In additionhe served as theHKUST Associate Vice-President for Postgraduate Studies from 2011-2014.

Moreinformation please see:

https://www.cse.ust.hk/faculty/golin/


扫码或添加微信号:坛友素质互助


「经管之家」APP:经管人学习、答疑、交友,就上经管之家!
免流量费下载资料----在经管之家app可以下载论坛上的所有资源,并且不额外收取下载高峰期的论坛币。
涵盖所有经管领域的优秀内容----覆盖经济、管理、金融投资、计量统计、数据分析、国贸、财会等专业的学习宝库,各类资料应有尽有。
来自五湖四海的经管达人----已经有上千万的经管人来到这里,你可以找到任何学科方向、有共同话题的朋友。
经管之家(原人大经济论坛),跨越高校的围墙,带你走进经管知识的新世界。
扫描下方二维码下载并注册APP
本文关键词:

本文论坛网址:https://bbs.pinggu.org/thread-3684856-1-1.html

人气文章

1.凡人大经济论坛-经管之家转载的文章,均出自其它媒体或其他官网介绍,目的在于传递更多的信息,并不代表本站赞同其观点和其真实性负责;
2.转载的文章仅代表原创作者观点,与本站无关。其原创性以及文中陈述文字和内容未经本站证实,本站对该文以及其中全部或者部分内容、文字的真实性、完整性、及时性,不作出任何保证或承若;
3.如本站转载稿涉及版权等问题,请作者及时联系本站,我们会及时处理。