"Interesting and useful as all this will be for anyone interested in knowing more about Bayes, this is just part of the riches contained in this book ...Beyond doubt this book is a work of the highest quality in terms of the scholarship it displays, and should be regarded as a must for every mathematical library." --MAA ONLINE

N Is a Number: A Portrait of Paul Erdős is a 1993 documentary directed by George Paul Csicsery about the life of mathematician Paul Erdős.
Erdős himself appears in the film. As of 2007, using the official cast list in the credits, it gives Erdős a Bacon number (and thus Erdős-Bacon number) of 4. However, Sir Alec Guinness, identified by name by the narrator, appears in the film, getting an honorary doctorate with Erdős; his presence would give Erdős a Bacon number of 3. Since Frost/Nixon was released in late 2008, Erdős has a Bacon number of 3 through official credits.

'This book covers the dominant theoretical approaches to the approximate solution of hard combinatorial optimization and enumeration problems. It contains elegant combinatorial theory, useful and interesting algorithms, and deep results about the intrinsic complexity of combinatorial problems. Its clarity of exposition and excellent selection of exercises will make it accessible and appealing to all those with a taste for mathematics and algorithms' - Richard Karp, University Professor, University of California at Berkeley. Following the development of basic combinatorial optimization techniques in the 1960s and 1970s, a main open question was to develop a theory of approximation algorithms. In the 1990s, parallel developments in techniques for designing approximation algorithms as well as methods for proving hardness of approximation results have led to a beautiful theory. The need to solve truly large instances of computationally hard problems, such as those arising from the Internet or the human genome project, has also increased interest in this theory. The field is currently very active, with the toolbox of approximation algorithm design techniques getting always richer. It is a pleasure to recommend Vijay Vazirani's well-written and comprehensive book on this important and timely topic. "I am sure the reader will find it most useful both as an introduction to approximability as well as a reference to the many aspects of approximation algorithms' - Laszlo Lovasz, Senior Researcher, Microsoft Research.

Wiley-Interscience Series in Discrete Mathematics and Optimization Advisory Editors: Ronald L. Graham, Jan Karel Lenstra, and Robert E. Tarjan Discrete mathematics, the study of finite structures, is one of the fastest-growing areas in mathematics. The wide applicability of its evolving techniques points to the rapidity with which the field is moving from its beginnings to its maturity, and reflects the ever-increasing interaction between discrete mathematics and computer science. This Series provides broad coverage of discrete mathematics and optimization, ranging over such fields as combinatorics, graph theory, enumeration, and the analysis of algorithms. The Wiley-Interscience Series in Discrete Mathematics and Optimization will be a substantial part of the record of the extraordinary development of this field. A complete listing of the titles in the Series appears on the inside front cover of this book. "[Integer and Combinatorial Optimization] is a major contribution to the literature of discrete programming. This text should be required reading for anybody who intends to research this area or even just to keep abreast of developments." --Times Higher Education Supplement, London "An extensive but extremely well-written graduate text covering integer programming." --American Mathematical Monthly Recent titles in the Series include: Integer and Combinatorial Optimization George L. Nemhauser and Laurence A. Wolsey 1988 (0 471-82819-X) 763 pp. Introduction to the Theory of Error-Correcting Codes Second Edition Vera Pless For mathematicians, engineers, and computer scientists, here is an introduction to the theory of error-correcting codes, focusing on linear block codes. The book considers such codes as Hamming and Golay codes, correction of double errors, use of finite fields, cyclic codes, B.C.H. codes, weight distributions, and design of codes. In a second edition of the book, Pless offers thoroughly expanded coverage of nonbinary and cyclic codes. Some proofs have been simplified, and there are many more examples and problems. 1989 (0 471-61884-5) 224 pp.

This book is an introduction to the field of asymptotic statistics. The treatment is both practical and mathematically rigorous. In addition to most of the standard topics of an asymptotics course, including likelihood inference, M-estimation, the theory of asymptotic efficiency, U-statistics, and rank procedures, the book also presents recent research topics such as semiparametric models, the bootstrap, and empirical processes and their applications. The topics are organized from the central idea of approximation by limit experiments, which gives the book one of its unifying themes. This entails mainly the local approximation of the classical i.i.d. set up with smooth parameters by location experiments involving a single, normally distributed observation. Thus, even the standard subjects of asymptotic statistics are presented in a novel way. Suitable as a graduate or Master's level statistics text, this book will also give researchers an overview of research in asymptotic statistics.

这是有关“凸分析”的较早的名著，是对凸分析理论进行系统总结和论述的经典之作，也是学习凸分析理论的必读之书。以“凸分析”为内容的教材、论文、论著，甚至在凸分析教学中的许多概念、内容，或来源于此，或以此为范本。
本书对与凸分析相关的许多概念均进行了严格定义，重点突出了“凸性”，如“凸集”“凸函数”“凸锥”，以及为刻画凸性所需用到的“超平面”“凸集分离”“方向导数”“次梯度”“相对内部”“共轭”“对偶”等。对与“凸性”有关的“KuhnTucker优性”条件、“鞍点优性”条件均有详细的论述和证明。书中始终贯穿和应用了凸性是对线性推广的思想。本书是早出现“多值映射”“凸过程”“双重函数”的著作之一。
本书是基础数学、应用数学、计算数学、计算机科学甚至物理学等学科研究生的理想的凸分析教材，也是从事数学理论和应用研究的科技工作者的经典参考书。

《面向生态学数据的贝叶斯统计:层次模型、算法和R编程》内容简介：作为统计学的两大分支，频率论和贝叶斯统计创立的时间相差无几，但贝叶斯统计直到近10年才被逐步引进到生态学数据分析。《面向生态学数据的贝叶斯统计：层次模型、算法和R编程》涵盖方法引论与实验分析应用两部分，针对多个时空尺度，介绍了适合于生态学数据的统计推断方法和层次模型，涉及经典频率论和贝叶斯统计的模型、算法和具体编程。首先阐述了生态学数据的层次结构和时空变异性，以及频率论和贝叶斯统计。然后介绍贝叶斯推断的基础概念、分析框架和算法原理；并进一步针对生态学层次模型、时间序列及时空复合格局数据依次展开分析模拟。在应用操作部分，配合方法部分的各章内容介绍基于R的算法与编程实践。最后《面向生态学数据的贝叶斯统计：层次模型、算法和R编程》还附录了与生态学数据密切相关的频率论与贝叶斯统计的基础知识。
《面向生态学数据的贝叶斯统计：层次模型、算法和R编程》适用于生态学和环境科学专业的研究生和科研人员，可作为实验和观测数据分析的教材或参考书。具有一定概率论和贝叶斯统计基础及统计软件R应用编程技术的人员，对于理解和应用《面向生态学数据的贝叶斯统计：层次模型、算法和R编程》所涉及的相关方法是必要的。

中国统计出版社

《超弦理论(第1卷)》由世界图书出版公司北京公司和剑桥大学出版社合作出版。《超弦理论(第1卷)》任何部分之文字及图片，未经出版者书面许可，不得用任何方式抄袭、节录或翻印。

Recent years have brought a revival of work on string theory, which has been a source of fascination since its origins nearly twenty years ago.There seems to be a widely perceived need for a systematic, pedagogical exposition of the present state of knowledge about string theory. We hope that this book will help to meet this need. To give a comprehensive account of such a vast topic as string theory would scarcely be possible,even in two volumes with the length to which these have grown. Indeed,we have had to omit many important subjects, while treating others only sketchily. String field theory is omitted entirely (though the subject of chapter 11 is closely related to light-cone string field theory). Conformal field theory is not developed systematically, though much of the background material needed to understand recent papers on this subject is presented in chapter 3 and elsewhere.

概率图模型将概率论与图论相结合，是当前非常热门的一个机器学习研究方向。本书详细论述了有向图模型（又称贝叶斯网）和无向图模型（又称马尔可夫网）的表示、推理和学习问题，全面总结了人工智能这一前沿研究领域的最新进展。为了便于读者理解，书中包含了大量的定义、定理、证明、算法及其伪代码，穿插了大量的辅助材料，如示例（examples）、技巧专栏（skill boxes）、实例专栏（case study boxes）、概念专栏（concept boxes）等。另外，在第 2章介绍了概率论和图论的核心知识，在附录中介绍了信息论、算法复杂性、组合优化等补充材料，为学习和运用概率图模型提供了完备的基础。
本书可作为高等学校和科研单位从事人工智能、机器学习、模式识别、信号处理等方向的学生、教师和研究人员的教材和参考书。
== 序 言 ==
很高兴能够看到我们所著的《概率图模型》一书被翻译为中文出版。我们了解到这本书涵盖的课题已在中国引起了巨大的兴趣。已有众多中国读者写信向我们解释这本书对于他们的学习的重要性，并希望获得更易理解的版本。随着众多来自中国研究机构或国外研究机构的中国学者署名或共同署名的文章的发表，中国研究者已在概率图领域中扮演了非常重要的角色。这些文章对于概率图模型领域的发展起到了非常重要的作用。我们相信《概率图模型》中文版的出版将帮助许多中国读者学习并掌握这一重要课题的基础。同时，这也将进一步提高中国学者应用概率图模型思想的能力，并为这一领域的发展做出贡献。
本书的翻译工作由王飞跃研究员主导，并得到了王珏研究员及其众多助手和合作者的支持。这是一份历时 5年、具有里程碑意义的努力，我深深地感谢该团队所有为本书翻译做出贡献的人员。我尤其希望借此机会感谢王珏研究员——一位中国机器学习领域的开拓者。王珏研究员是此项翻译工作的十分重要的推动者。没有他的支持，没有他的众多杰出的机器学习领域的学生的帮助，可能这项工作到现在还没有结果。很遗憾王珏研究员于 2014年 12月死于癌症，终年 66岁，已不能看到他努力的结果。然而，他的思想活在他的学生们的工作中，与本书的出版同在。
Daphne Koller
（复杂系统管理与控制国家重点实验室王晓翻译）

《数论1:Fermat的梦想和类域论》起点低，但内容丰富，包括了现代数论的基本知识，如：椭圆曲线、p进数、代数数域、局部-整体方法等。该书的主要目标是证明数论的顶峰之一：类域论。在以往的数论书籍中，代数数论、椭圆曲线、类域论是分开的三《数论1:Fermat的梦想和类域论》，但《数论1:Fermat的梦想和类域论》在有限的篇幅内，将三者巧妙地融为一体，使读者能很快地达到数论的一个顶峰。开篇通过介绍Fermat的工作，给出了现代数论的一些定理的背景和意义。对于初学者难以掌握的类域论，专门有一章介绍类域论的背景和主要定理的意义。类域论的主要定理通过应用函数计算Brauer群而得到证明。《数论1:Fermat的梦想和类域论》的另一特点是先承认一些结论，然后推导出一些进一步的结果，而将它们的证明放在一起一个一个地进行。
《数论1:Fermat的梦想和类域论》的第零章通过介绍Fermat的工作和结果，从而窥见丰富的、深奥的数的世界。第一章以Fermat的工作为起点，介绍椭圆曲线的基本知识。第二章介绍p进数及二次曲线的Hasse原理。第三章介绍了涵数在整点的特殊值。这几章适合于仅知道群、环、域概念的低年级本科生。后面几章关于代数数论和类域论的内容适合于高年级本科生和研究生学习。

对统计学的学习来说，最主要的是掌握统计思想，理解相关的统计原理，能够根据实际情境提出解决问题的一个或几个合适方案，并懂得选择其中的最优。因此适合非统计专业学生的统计学理想教材，应该是能兼顾专业特点、深入浅出阐述统计学基本原理和方法，同时在轻快风趣的讲述中激发读者的学习兴趣，培养统计思维，并辅之例题分析，对使用中容易发生的错误加以提醒，切实提高学生应用统计方法分析解决实际问题的能力。《行为统计学基础》（第9版）正是这样一本非常出色的教材。本书写作风格轻松活泼，语言流畅易懂，数学深入浅出，读者在学习和阅读时不会感到枯燥乏味。
本书是心理和教育统计学方面的一本优秀的基础教材，对于在社会科学领域中的广大研究人员来说，也是一本不可多得的重要参考书

Most questions in social and biomedical sciences are causal in nature: what would happen to individuals, or to groups, if part of their environment were changed? In this groundbreaking text, two world-renowned experts present statistical methods for studying such questions. This book starts with the notion of potential outcomes, each corresponding to the outcome that would be realized if a subject were exposed to a particular treatment or regime. In this approach, causal effects are comparisons of such potential outcomes. The fundamental problem of causal inference is that we can only observe one of the potential outcomes for a particular subject. The authors discuss how randomized experiments allow us to assess causal effects and then turn to observational studies. They lay out the assumptions needed for causal inference and describe the leading analysis methods, including, matching, propensity-score methods, and instrumental variables. Many detailed applications are included, with special focus on practical aspects for the empirical researcher.

Bayesian nets are widely used in artificial intelligence as a calculus for causal reasoning, enabling machines to make predictions, perform diagnoses, take decisions and even to discover causal relationships. But many philosophers have criticised and ultimately rejected the central assumption on which such work is based - the Causal Markov Condition. So should Bayesian nets be abandoned? What explains their success in artificial intelligence? This book argues that the Causal Markov Condition holds as a default rule: it often holds but may need to be repealed in the face of counterexamples. Thus Bayesian nets are the right tool to use by default but naively applying them can lead to problems. The book develops a systematic account of causal reasoning and shows how Bayesian nets can be coherently employed to automate the reasoning processes of an artificial agent. The resulting framework for causal reasoning involves not only new algorithms but also new conceptual foundations. Probability and causality are treated as mental notions - part of an agent's belief state.Yet probability and causality are also objective - different agents with the same background knowledge ought to adopt the same or similar probabilistic and causal beliefs. This book, aimed at researchers and graduate students in computer science, mathematics and philosophy, provides a general introduction to these philosophical views as well as an exposition of the computational techniques that they motivate.

The principles of gauge symmetry and quantization are fundamental to modern understanding of the laws of electromagnetism, weak and strong subatomic forces and the theory of general relativity. Ideal for graduate students and researchers in theoretical and mathematical physics, this unique book provides a systematic introduction to Hamiltonian mechanics of systems with gauge symmetry. The book reveals how gauge symmetry may lead to a non-trivial geometry of the physical phase space and studies its effect on quantum dynamics by path integral methods. It also covers aspects of Hamiltonian path integral formalism in detail, along with a number of related topics such as the theory of canonical transformations on phase space supermanifolds, non-commutativity of canonical quantization and elimination of non-physical variables. The discussion is accompanied by numerous detailed examples of dynamical models with gauge symmetries, clearly illustrating the key concepts.

《逻辑、信息和互动》既有关于逻辑数学基础的探索，又有对逻辑应用领域的拓展，适合从事逻辑学研究的学生和教师阅读。也适合从事其他逻辑相关学科专业的学生和教师参阅。“逻辑之门”是当代世界著名的逻辑学家约翰，范本特姆经典著作的中文翻译。丛书收集了他的经典论文和主要专著，其涵盖的主题有：关于信息、进程和智能互动的模态逻辑，自然语言中范畴语法和量词语义的逻辑：逻辑与认识论、科学方法论和博弈论之间的相互影响，等等。丛书展现了现代逻辑作为数学、哲学、语言学、计算机科学、认知科学等学科之间媒介和催化剂的新视角。

本书是国际算法大师乌迪·曼博（Udi Manber）博士撰写的一本享有盛誉的著作。全书共分12章：第1章到第4章为介绍性内容，涉及数学归纳法、算法分析、数据结构等内容；第5章提出了与归纳证明进行类比的算法设计思想；第6章到第9章分别给出了4个领域的算法，如序列和集合的算法、图算法、几何算法、代数和数值算法；第10章涉及归约，也是第11章的序幕，而后者涉及NP完全问题；第12章则介绍了并行算法；最后是部分习题的答案及参考文献。本书的特色有二，旨在提高读者的问题求解能力，使读者能够理解算法设计的过程和思想：一是强调算法设计的创造性过程，注重算法设计背后的创造性思想，而不拘泥于某个具体算法的详细讨论；二是将算法设计类比于定理归纳证明，揭示了算法设计的基本思想和本质。
本书的组织结构清晰且易于理解，强调了创造性，具有浓郁特色，时至今日仍有其巨大的价值，并且适合作为计算机及相关专业算法和高级算法课程的教材。

本书是哥德尔的权威传记，全面描述了这位逻辑学家和哲学家的工作及生活细节。逻辑学家和科学史家道森对哥德尔的文献和保存下来的信件进行了深入研究。研究表明，哥德尔在数学基础方面的工作从根本上改变了我们对这个领域的看法，并在20世纪激发了许多研究方向。道森还探讨了哥德尔的个性与他的科学成就之间的关系，并阐释了哥德尔的成就对我们现代世界观的影响。