《计算机程序设计艺术》系列是公认的计算机科学领域经典之作，深入阐述了程序设计理论，对计算机领域的发展有着极为深远的影响。本书是该系列的第 1 卷，讲解基本算法，其中包含了其他各卷都需用到的基本内容。本卷从基本概念开始，然后讲述信息结构，并辅以大量的习题及答案。

本书使用向量的概念对国内高校工科“线性代数”的课程内容进行了较全面的几何分析。从向量的几何意义开始，分别讲述了向量组、向量空间、行列式、矩阵、线性方程组和二次型的几何意义或几何解释，其中不乏重要概念的物理意义的解释。这本书就像一串项梁，把上百个概念和定理的几何意义串在一起敬献给读者朋友。
本书文字多为作者原创，比如叉积的物理意义，克莱姆法则、雅可比矩阵、相似/合同矩阵、转置矩阵/对偶、矩阵乘积的行列式等系列概念的几何意义等，应用方面如使用矩阵分析的方法分析电子振荡器的工作原理等。
本书图文并茂，思路清晰、语言流畅，概念及定理解释得合理、自然，同时具有通俗性、科普性，由于本书是直接根据线性代数课程的要求进行解释的，除了适合初学者和自学者使用之外，特别适合正在学习或复习线性代数的大学生作为深入思考的辅导书籍使用。

全球科技巨头纷纷拥抱深度学习，自动驾驶、AI医疗、语音识别、图像识别、智能翻译以及震惊世界的AlphaGo，背后都是深度学习在发挥神奇的作用。深度学习是人工智能从概念到繁荣得以实现的主流技术。经过深度学习训练的计算机，不再被动按照指令运转，而是像自然进化的生命那样，开始自主地从经验中学习。
本书作者特伦斯·谢诺夫斯基是全球人工智能十大科学家之一、深度学习先驱及奠基者，亲历了深度学习在20世纪70年代到90年代的寒冬。但他和一众开拓者，利用大数据和不断增强的计算能力，终于在神经网络算法上取得重大突破，实现了人工智能井喷式的发展。
作为深度学习领域的通识作品，本书以恢弘的笔触，通过3个部分全景展现了深度学习的发展、演变与应用，首次以亲历者视角回溯了深度学习浪潮在过去60年间的发展脉络与人工智能的螺旋上升，并前瞻性地预测了智能时代的商业图景。

"Simulation," writes Gary Flake in his preface, "becomes a form of experimentation in a universe of theories. The primary purpose of this book is to celebrate this fact."In this book, Gary William Flake develops in depth the simple idea that recurrent rules can produce rich and complicated behaviors. Distinguishing "agents" (e.g., molecules, cells, animals, and species) from their interactions (e.g., chemical reactions, immune system responses, sexual reproduction, and evolution), Flake argues that it is the computational properties of interactions that account for much of what we think of as "beautiful" and "interesting." From this basic thesis, Flake explores what he considers to be today's four most interesting computational topics: fractals, chaos, complex systems, and adaptation.Each of the book's parts can be read independently, enabling even the casual reader to understand and work with the basic equations and programs. Yet the parts are bound together by the theme of the computer as a laboratory and a metaphor for understanding the universe. The inspired reader will experiment further with the ideas presented to create fractal landscapes, chaotic systems, artificial life forms, genetic algorithms, and artificial neural networks.

《信息技术和电气工程学科国际知名教材中译本系列:凸优化》内容非常丰富。理论部分由4章构成，不仅涵盖了凸优化的所有基本概念和主要结果，还详细介绍了几类基本的凸优化问题以及将特殊的优化问题表述为凸优化问题的变换方法，这些内容对灵活运用凸优化知识解决实际问题非常有用。应用部分由3章构成，分别介绍凸优化在解决逼近与拟合、统计估计和几何关系分析这三类实际问题中的应用。算法部分也由3章构成，依次介绍求解无约束凸优化模型、等式约束凸优化模型以及包含不等式约束的凸优化模型的经典数值方法，以及如何利用凸优化理论分析这些方法的收敛性质。通过阅读《信息技术和电气工程学科国际知名教材中译本系列:凸优化》，能够对凸优化理论和方法建立完整的认识。

Now available in paperback, this successful radical approach to complex analysis replaces the standard calculational arguments with new geometric ones. With several hundred diagrams, and far fewer prerequisites than usual, this is the first visual intuitive introduction to complex analysis. Although designed for use by undergraduates in mathematics and science, the novelty of the approach will also interest professional mathematicians.

This book chronicles my six years of working towards a Ph.D. in Computer Science at Stanford University from 2006 to 2012. A diverse variety of people can benefit from reading it, including:
undergraduates who might be interested in pursuing a Ph.D.,
current Ph.D. students who are seeking guidance or inspiration,
professors who want to better understand Ph.D. students,
employers who hire and manage people with Ph.D. degrees,
professionals working in any creative or competitive field where self-driven initiative is crucial,
and educated adults (or precocious kids) who are curious about how academic research is produced.

本书是最权威的计算机体系结构著作，是久负盛名的经典作品。书中系统地介绍了计算机系统的设计基础、指令集系统结构、流水线和指令集并行技术、层次化存储系统与存储设备、互连网络以及多处理器系统等重要内容。在这个最新版中，作者增加了当前炙手可热的云计算和手机客户端技术等相关内容，探讨了在手机、平板电脑、笔记本电脑和其他移动计算设备上云计算的软硬件实现方式。

图论导引，ISBN：9787115161536，作者：（美）沙特朗、张萍

《选举几何学》内容简介：“绝对公平的选举是不可能实现的!”当美国经济学家K.J.Arrow在1952年向世界发表这一定理时，人们才开始真正认识决策和民主。自此，选举学正式成为一种独立完整的理论。《选举几何学》从介绍Arrow定理及其简化版的证明入手，进而讨论后Arrow时代选举理论的面貌，即D.G.Saari（他创建了初等几何学方法）和G.Chichilnisky（她创建了拓扑方法）对选举理论所作的重要贡献。阅读《选举几何学》可以了解社会发展中令人意想不到的真实轨迹，更重要的是，学会如何应用最为恰当的选择方法，让智慧指导生活决策。《选举几何学》可供管理人员、决策人员等社会各界人士阅读，也可供高等院校及科研机构的数理社会学研究人员、相关专业师生参考和使用。

《通信之道——从微积分到5G》按照读者的思维顺序讲述了从微积分到5G 所涉及的基础知识和关键技术。《通信之道——从微积分到5G》共20 章，具有以下特点：
（1）跨度极大，内容翔实：涉及数学、信号处理、通信原理、通信前沿技术等多个学科领域，知识密度极高，并且是最精华的部分。
（2） 降低难度，提升高度：《通信之道——从微积分到5G》叙述符合读者的思维发展规律，并逐级提高，前后呼应，语言风趣幽默，节奏平稳；作者站高望远，直击本质，学术境界超越经典。
（3）启发互动，培养创新：在多个环节上对读者提出挑战，启发读者思考，并给出作者的思考过程，培养读者的创新思维。
《通信之道——从微积分到5G》可作为通信和信号处理相关专业的本科生及研究生的教辅书，也可作为从业技术人员的参考资料。

《交互式计算机图形学:基于OpenGL着色器的自顶向下方法(第6版)》采用自顶向下的方法并辅以面向编程的方式，基于现代可编程GPU的着色器编程，使用C++语言、OpenGL着色语言（GLSL）并结合OpenGL系统地介绍了现代计算机图形学的核心概念、原理和方法。《交互式计算机图形学:基于OpenGL着色器的自顶向下方法(第6版)》是作者多年来教学与科研工作的总结，涵盖了基于OpenGL着色器的交互式图形编程、三维可编程绘制流水线、变换与观察、光照与明暗绘制、曲线曲面建模等基本的计算机图形学内容以及离散技术、层级建模、过程建模、光线跟踪、并行绘制和体绘制等高级内容，并为读者进一步深入学习和研究，在每章后面提供了相关的建议阅读资料。《交互式计算机图形学:基于OpenGL着色器的自顶向下方法(第6版)》第六版进一步反映了计算机图形学的最新发展现状，面向图形应用开发并辅以大量的示例和完整的源代码，是一本“基础性与先进性、理论性与应用性、科学性与通俗性”相结合的内容全面而又系统的国外经典计算机图形学教材。

本书以初等函数为重点，介绍了微积分相关的内容，包括微分、积分、无穷级数、傅里叶展开和勒贝格积分等9章内容. 作者采用讲义式的叙述方式，把数学看成有生命的东西，让读者有一种别样的新鲜感.
本书是一本经典的微积分教材，原版被日本各大学普遍采用，适合数学专业及其他各理工科专业高年级本科生和低年级研究生用作教材或参考书.

本书赢得了全球程序员的广泛赞誉，即使是最晦涩的概念，在Bruce Eckel的文字亲和力和小而直接的编程示例面前也会化解于无形。从Java的基础语法到最高级特性（深入的面向对象概念、多线程、自动项目构建、单元测试和调试等），本书都能逐步指导你轻松掌握。
从本书获得的各项大奖以及来自世界各地的读者评论中，不难看出这是一本经典之作。本书的作者拥有多年教学经验，对C、C++以及Java语言都有独到、深入的见解，以通俗易懂及小而直接的示例解释了一个个晦涩抽象的概念。本书共22章，包括操作符、控制执行流程、访问权限控制、复用类、多态、接口、通过异常处理错误、字符串、泛型、数组、容器深入研究、Java I/O系统、枚举类型、并发以及图形化用户界面等内容。这些丰富的内容，包含了Java语言基础语法以及高级特性，适合各个层次的Java程序员阅读，同时也是高等院校讲授面向对象程序设计语言以及Java语言的绝佳教材和参考书。
第4版特点：
适合初学者与专业人员的经典的面向对象叙述方式，为更新的Java SE5/6增加了新的示例和章节。
 测验框架显示程序输出。

A Turing Award-winning computer scientist and statistician shows how understanding causality has revolutionized science and will revolutionize artificial intelligence
"Correlation is not causation." This mantra, chanted by scientists for more than a century, has led to a virtual prohibition on causal talk. Today, that taboo is dead. The causal revolution, instigated by Judea Pearl and his colleagues, has cut through a century of confusion and established causality--the study of cause and effect--on a firm scientific basis. His work explains how we can know easy things, like whether it was rain or a sprinkler that made a sidewalk wet; and how to answer hard questions, like whether a drug cured an illness. Pearl's work enables us to know not just whether one thing causes another: it lets us explore the world that is and the worlds that could have been. It shows us the essence of human thought and key to artificial intelligence. Anyone who wants to understand either needs The Book of Why.

《高等院校统计学专业规划教材•贝叶斯统计》共六章，可分二部分。前三章围绕先验分布介绍贝叶斯推断方法。后三章围绕损失函数介绍贝叶斯决策方法。阅读这些内容仅需要概率统计基本知识就够了。《高等院校统计学专业规划教材•贝叶斯统计》力图用生动有趣的例子来说明贝叶斯统计的基本思想和基本方法，尽量使读者对贝叶斯统计产生兴趣，引发读者使用贝叶方法去认识和解决实际问题的愿望。进而去丰富和发展贝叶斯统计。假如学生的兴趣被钓出来，愿望被引出来，那么讲授这一门课的目的也基本达到了。

Genetic algorithms are founded upon the principle of evolution, i.e., survival of the fittest. Hence evolution programming techniques, based on genetic algorithms, are applicable to many hard optimization problems, such as optimization of functions with linear and nonlinear constraints, the traveling salesman problem, and problems of scheduling, partitioning, and control. The importance of these techniques is still growing, since evolution programs are parallel in nature, and parallelism is one of the most promising directions in computer science.
The book is self-contained and the only prerequisite is basic undergraduate mathematics. This third edition has been substantially revised and extended by three new chapters and by additional appendices containing working material to cover recent developments and a change in the perception of evolutionary computation.

'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.