本书讲述了JavaScript和DOM的基础知识，但重点放在DOM编程技术背后的思路和原则：预留退路、循序渐进和以用户为中心等，这些概念对于任何前端Web开发工作都非常重要。本书将这些概念贯穿在书中的所有代码示例中，使你看到用来创建图片库页面的脚本、用来创建动画效果的脚本和用来丰富页面元素呈现效果的脚本，最后结合所讲述的内容创建了一个实际的网站。 本书适合Web设计师和开发人员阅读。

Prentice Hall's most important C programming title in years. A companion volume to Kernighan & Ritchie's C PROGRAMMING LANGUAGE. A collection of reusable functions (code for building data structures, code for performing math functions and scientific calculations, etc.) which will save C programmers time and money especially when working on large programming projects. The C Library is part of the ANSI (American National Standard Institute) for the C Language. This new book contains the complete code for the library. It covers elements of the library with which even the most experienced C programmers are not familiar such as internationalization (the ability to write programs that can adapt to different cultural locales, for example, using the C library, programmers can write software that manipulates large character sets such as Kanji). Structured like the Standard C Library, it contains 15 headers declaring or defining all of the names in the library. A separate chapter covers each header, including excerpts from relevant portions of the C Standard showing all codes needed to implement each portion of the library and explaining why it is necessary. The book teaches readers the concepts and design issues associated with library building. Using this book, programemrs will be less likely to re-code something that already exists in a given program. Plauger is one of the world's leading experts on C and the C Library.

Finally, after a wait of more than thirty-five years, the first part of Volume 4 is at last ready for publication. Check out the boxed set that brings together Volumes 1 - 4A in one elegant case, and offers the purchaser a $50 discount off the price of buying the four volumes individually. The Art of Computer Programming, Volumes 1-4A Boxed Set, 3/e ISBN: 0321751043 Art of Computer Programming, Volume 4, Fascicle 4,The: Generating All Trees--History of Combinatorial Generation: Generating All Trees--History of Combinatorial Generation This multivolume work on the analysis of algorithms has long been recognized as the definitive description of classical computer science.The three complete volumes published to date already comprise a unique and invaluable resource in programming theory and practice. Countless readers have spoken about the profound personal influence of Knuth's writings. Scientists have marveled at the beauty and elegance of his analysis, while practicing programmers have successfully applied his “cookbook” solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books. To begin the fourth and later volumes of the set, and to update parts of the existing three, Knuth has created a series of small books called fascicles, which will be published at regular intervals. Each fascicle will encompass a section or more of wholly new or revised material. Ultimately, the content of these fascicles will be rolled up into the comprehensive, final versions of each volume, and the enormous undertaking that began in 1962 will be complete. Volume 4, Fascicle 4 This latest fascicle covers the generation of all trees, a basic topic that has surprisingly rich ties to the first three volumes of The Art of Computer Programming. In thoroughly discussing this well-known subject, while providing 124 new exercises, Knuth continues to build a firm foundation for programming. To that same end, this fascicle also covers the history of combinatorial generation. Spanning many centuries, across many parts of the world, Knuth tells a fascinating story of interest and relevance to every artful programmer, much of it never before told. The story even includes a touch of suspense: two problems that no one has yet been able to solve.

Finally, after a wait of more than thirty-five years, the first part of Volume 4 is at last ready for publication. Check out the boxed set that brings together Volumes 1 - 4A in one elegant case, and offers the purchaser a $50 discount off the price of buying the four volumes individually. The Art of Computer Programming, Volumes 1-4A Boxed Set, 3/e ISBN: 0321751043 Art of Computer Programming, Volume 4, Fascicle 3, The: Generating All Combinations and Partitions: Generating All Combinations and Partitions This multivolume work on the analysis of algorithms has long been recognized as the definitive description of classical computer science.The three complete volumes published to date already comprise a unique and invaluable resource in programming theory and practice. Countless readers have spoken about the profound personal influence of Knuth's writings. Scientists have marveled at the beauty and elegance of his analysis, while practicing programmers have successfully applied his "cookbook" solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books. To begin the fourth and later volumes of the set, and to update parts of the existing three, Knuth has created a series of small books called fascicles, which will be published at regular intervals. Each fascicle will encompass a section or more of wholly new or revised material. Ultimately, the content of these fascicles will be rolled up into the comprehensive, final versions of each volume, and the enormous undertaking that began in 1962 will be complete. Volume 4, Fascicle 3 This fascicle continues Knuth's authoritative chapter on combinatorial algorithms, ultimately to be included in Volume 4 of The Art of Computer Programming. The previous fascicle from Volume 4, which covered the generation of all tuples and permutations, is now complemented by techniques for generating all combinations and partitions. In Knuth's thorough discussion of these two topics, readers will find much that is new, as well as surprisingly rich ties to material in Volumes 1 through 3 and to other aspects of computer science and mathematics. As usual, this fascicle includes a bounty of creative exercises, as well as intriguing challenges posed by yet-unsolved questions.

《Oracle9i&10g编程艺术:深入数据库体系结构》是讲述Oracle数据库公证的权威指南，凝聚了世界顶尖的Oracle专家Thomas Kyte数十年的宝贵经验和大量真的知灼见。书中深入地分析了Oracle数据库体系结构，包括文件、内存结构以及构成Oracle数据库和实例的度层进程，然后讨论了一些重要的数据库主题，如锁定、并发控制、事务、重做和撤销，还解释了这些内重要性。最后，分析了数据库中的物理结构，如表、索引和数据类型，并介绍通过哪些技术能最优地使用这些物理结构。无论你是程序员还是DBA，要创建和管理稳定、高质量的Oracle系统，归根结底都需要理解Oracle数据库的体系结构。

《C++编程规范:101条规则准则与最佳实践》中，两位知名的C++专家将全球C++界20年的集体智慧和经验凝结成一套编程规范。这些规范可以作为每一个开发团队制定实际开发规范的基础，更是每一位C++程序员应该遵循的行事准则。书中对每一条 规范都给出了精确的描述，并辅以实例说明；从类型定义到错误处理，都给出了最佳的C++实践。即使使用C++多年的程序员也会从《C++编程规范:101条规则准则与最佳实践》中受益匪浅。《C++编程规范:101条规则准则与最佳实践》适合于各层次C++程序员使用，也可作为高等院校C++课程的教学参考书。

Tired of reading HTML books that only make sense after you're an expert? Then it's about time you picked up "Head First HTML with CSS & XHTML" and really learned HTML. You want to learn HTML so you can finally create those Web pages you've always wanted, so you can communicate more effectively with friends, family, fans and fanatic customers. You also want to do it right so you can actually maintain and expand your Web pages over time, and so your Web pages work in all the browsers and mobile devices out there. Oh, and if you've never heard of CSS, that's okay - we won't tell anyone you're still partying like it's 1999 - but if you're going to create Web pages in the 21st century then you'll want to know and understand CSS. Learn the real secrets of creating Web pages, and why everything your boss told you about HTML tables is probably wrong (and what to do instead). Most importantly, hold your own with your co-worker (and impress cocktail party guests) when he casually mentions how his HTML is now strict, and his CSS is in an external style sheet. With "Head First HTML with CSS & XHTML", you'll avoid the embarrassment of thinking Web-safe colors still matter, and the foolishness of slipping a font tag into your pages. Best of all, you'll learn HTML and CSS in a way that won't put you to sleep. If you've read a "Head First" book, you know what to expect: a visually-rich format designed for the way your brain works. Using the latest research in neurobiology, cognitive science, and learning theory, this book will load HTML, CSS, and XHTML into your brain in a way that sticks. So what are you waiting for? Leave those other dusty books behind and come join us in Webville. Your tour is about to begin.

软件“风格”所要讨论的主题是如何在开销与功能之间、优雅与可维护性之间、灵活。性与过分灵活之间寻找完美的平街点。在本书中，著名的C++大师Herb Sutter给出了40个编程问题。其目的是为了使读者不仅“知其然”，更要“知其所以然”，并帮助读者在软件开发中进行正确的决策。本书是围绕实际问题及其解决方案展开论述的，对一些至关重要的C++细节和相互关系提出了新的见解，为当今的关键C++编程技术(如泛型编程、STL、异常安全等)提供了新的策略。 　　本书中，C++大师Herb sutter通过40个编程问题，使读者不仅“知其然”，更要“知其所以然”，帮助程序设计人员在软件中寻找恰到好处的折中，即讨论如何在开销与功能之间、优雅与可维护性之间、灵活性与过分灵活之间寻找完美的平衡点。本书是围绕实际问题及其解决方案展开论述的，对一些至关重要的C++细节和相互关系提出了新的见解，为当今关键的C++编程技术(如泛型编程、STL、异常安全等)提供了新的策略。本书的目标是让读者在设计、架构和编码过程中保持良好的风格，从而使编写的C++软件更健壮、更高效。本书适合中高级C++程序员阅读。

Even C experts come across problems that require days ofdebugging to fix. This book helps to prevent such problems byshowing how C programmers get themselves into trouble. Each ofthe book's many examples has trapped a professional programmer. In addition to its examples, C Traps and Pitfalls offers adviceon: *avoiding off-by-one errors *understanding and constructing function declarations *understanding the subtle relationship between pointers andarrays Distilled from the author's experience over a decade ofprogramming in C, this book is an ideal resource for anyone,novice or expert, who has ever written a C program. 0201179288B04062001

If you are new to C++ programming, C++ Primer Plus, Fifth Edition is a friendly and easy-to-use self-study guide. You will cover the latest and most useful language enhancements, the Standard Template Library and ways to streamline object-oriented programming with C++. This guide also illustrates how to handle input and output, make programs perform repetitive tasks, manipulate data, hide information, use functions and build flexible, easily modifiable programs. With the help of this book, you will: * Learn C++ programming from the ground up. * Learn through real-world, hands-on examples. * Experiment with concepts, including classes, inheritance, templates and exceptions. * Reinforce knowledge gained through end-of-chapter review questions and practice programming exercises. C++ Primer Plus, Fifth Edition makes learning and using important object-oriented programming concepts understandable. Choose this classic to learn the fundamentals and more of C++ programming.

For use as a core text supplement in any course covering common LISP such as Artificial Intelligence or Concepts of Programming Languages. Teaching students new and more powerful ways of thinking about programs, this text contains a tutorial-full of examples-that explains all the essential concepts of Lisp programming, plus an up- to-date summary of ANSI Common Lisp, listing every operator in the language. Informative and fun, it gives students everything they need to start writing programs in Lisp both efficiently and effectively, and highlights such innovative Lisp features as automatic memory management, manifest typing, closures, and more.

Want to learn how to program in C++ immediately? Want to start writing better, more powerful C++ programs today? Accelerated C++'s uniquely modern approach will help you learn faster and more fluently than you ever believed possible. Based on the authors' intensive summer C++ courses at Stanford University, Accelerated C++ covers virtually every concept that most professional C++ programmers will ever use -- but it turns the "traditional" C++ curriculum upside down, starting with the high-level C++ data structures and algorithms that let you write robust programs immediately. Once you're getting results, Accelerated C++ takes you "under the hood," introducing complex language features such as memory management in context, and explaining exactly how and when to use them. From start to finish, the book concentrates on solving problems, rather than learning language and library features for their own sake. The result: You'll be writing real-world programs in no time -- and outstanding code faster than you ever imagined.

《C++编程思想(第2卷)(实用编程技术)》介绍C++实用的编程技术和最佳的实践方法，深入探究了异常处理方法和异常安全设计；介绍C++的字符串、输入输出流、STL算法、容器和模板的现代用法，包括模板元编程；解释多重继承问题的难点，展示RTTI的实际使用，描述了典型的设计模式及其实现，特别介绍被认为是标准C++下一版特征之一的多线程处理编程技术，并提供了最新的研究成果。《C++编程思想》(第2卷)适合作为高等院校计算机及相关专业的本科生、研究生的教材，也可供从事软件开发的研究人员和科技工作者参考。 海报：

Masters of Doom is the amazing true story of the Lennon and McCartney of video games: John Carmack and John Romero. Together, they ruled big business. They transformed popular culture. And they provoked a national controversy. More than anything, they lived a unique and rollicking American Dream, escaping the broken homes of their youth to produce the most notoriously successful game franchises in history— Doom and Quake — until the games they made tore them apart. This is a story of friendship and betrayal, commerce and artistry—a powerful and compassionate account of what it's like to be young, driven, and wildly creative.

这是一本里程碑式的书，是一本每位软件开发经理都应该读的书。 本书讨论了如何成长为一名优秀的软件开发经理，即他要懂得“协调管理”。为了领导得力，经理们必须行动一致。换而言之，这些经理不仅需要对优秀软件工作的概念有所理解，而且还必须身体力行这些原则，在实践中这一点更为重要。 本书语言力求通俗易懂，管理技巧实用，堪称是现代管理理论和软件工程领域结合的经典之作。

本书是一本全面系统地讲述计算机自然语言处理的优秀教材。本书英文版出版之后好评如潮，国外许多著名大学纷纷把本书选为自然语言处理和计算语言学课程的主要教材，该书被誉为该领域教材的“黄金标准”。本书包含的内容十分丰富，分为四个部分，共21章，深入细致地探讨了计算机处理自然语言的词汇、句法、语义、语用等各个方面的问题，介绍了自然语言处理的各种现代技术。从层次的角度看，本书的论述是按照自然语言的不同层面逐步展开的，首先论述单词的自动形态分析，接着论述自动句法分析，然后论述各种语言单位的自动语义分析，最后论述连贯文本的自动分析、对话与会话的智能代理以及自然语言生成。从技术的角度看，本书介绍了正则表达式、有限状态自动机、文本-语音转换、发音与拼写的概率模型、词类自动标注、N元语法、隐马尔可夫模型、上下文无关语法、特征与合一、词汇化剖析与概率剖析、一阶谓词演算、词义排歧、修辞结构理论、机器翻译等非常广泛的内容。本书具有“覆盖全面、注重实用、强调评测、语料为本”四大特色。在本书的配套网站上，还提供了相关的资源和工具，便于读者在实践中进一步提高。 ------- 目录 第1章 导论 1.1 语音与语言处理中的知识 1.2 歧义 1.3 模型和算法 1.4 语言. 思维和理解 1.5 学科现状与近期发展 1.6 语音和语言处理简史 1.6.1 基础研究：20世纪40年代和20世纪50年代 1.6.2 两个阵营：1957年至1970年 1.6.3 四个范型：1970年至1983年 1.6.4 经验主义和有限状态模型的复苏：1983年至1993年 1.6.5 不同领域的合流：1994年至1999年 1.6.6 多重发现 1.6.7 心理学的简要注记 1.7 小结 1.8 文献和历史说明 第一部分 词汇的计算机处理 第2章 正则表达式与自动机 2.1 正则表达式 2.1.1 基本正则表达式模式 2.1.2 析取. 组合与优先关系 2.1.3 一个简单的例子 2.1.4 一个比较复杂的例子 2.1.5 高级算符 2.1.6 正则表达式中的替换. 存储器与ELIZA 2.2 有限状态自动机 2.2.1 用FSA来识别羊的语言 2.2.2 形式语言 2.2.3 另外的例子 2.2.4 非确定FSA 2.2.5 使用NFSA接收符号串 2.2.6 识别就是搜索 2.2.7 确定自动机与非确定自动机的关系 2.3 正则语言与FSA 2.4 小结 2.5 文献和历史说明 第3章 形态学与有限状态转录机 3.1 英语形态学概观 3.1.1 屈折形态学 3.1.2 派生形态学 3.2 有限状态形态剖析 3.2.1 词表和形态顺序规则 3.2.2 用有限状态转录机进行形态剖析 3.2.3 正词法规则和有限状态转录机 3.3 把FST词表与规则相结合 3.4 与词表无关的FST：PORTER词干处理器 3.5 人是怎样进行形态处理的 3.6 小结 3.7 文献和历史说明 第4章 计算音系学与文本-语音转换 4.1 言语语音与语音标音法 4.1.1 发音器官 4.1.2 辅音：发音部位 4.1.3 辅音：发音方法 4.1.4 元音 4.1.5 音节 4.2 音位和音位规则 4.3 音位规则和转录机 4.4 计算音系学中的一些高级问题 4.4.1 元音和谐 4.4.2 模板式形态学 4.4.3 优选理论 4.5 音位规则的机器学习 4.6 TTS中从文本映射到语音 4.6.1 发音词典 4.6.2 词典之外的查找：文本分析 4.6.3 基于有限状态转录机（FST）的发音词典 4.7 文本-语音转换中的韵律 4.7.1 韵律的音系学性质 4.7.2 韵律的语音和声学性质 4.7.3 语音合成中的韵律 4.8 人处理音位和形态的过程 4.9 小结 4.10 文献和历史说明 第5章 发音与拼写的概率模型 5.1 关于拼写错误 5.2 拼写错误模式 5.3 非词错误的检查 5.4 概率模型 5.5 把贝叶斯方法应用于拼写 5.6 最小编辑距离 5.7 英语的发音变异 5.8 发音问题研究中的贝叶斯方法 5.8.1 发音变异的决策树模型 5.9 加权自动机 5.9.1 从加权自动机计算似然度：向前算法 5.9.2 解码：Viterbi算法 5.9.3 加权自动机和切分 5.9.4 用切分来进行词表的自动归纳 5.10 人类发音研究 5.11 小结 5.12 文献和历史说明 第6章 N元语法 6.1 语料库中单词数目的计算 6.2 简单的（非平滑的）N元语法 6.2.1 N元语法及其对训练语料库的敏感性 6.3 平滑 6.3.1 加1平滑 6.3.2 Witten-Bell打折法 6.3.3 Good-Turing打折法 6.4 回退 6.4.1 回退与打折相结合 6.5 删除插值法 6.6 拼写和发音的N元语法 6.6.1 上下文有关的错拼更正 6.6.2 发音模型的N元语法 6.7 熵 6.7.1 用于比较模型的交叉熵 6.7.2 英语的熵 6.8 小结 6.9 文献和历史说明 第7章 HMM与语音识别 7.1 语音识别的总体结构 7.2 隐马尔可夫模型概述 7.3 再谈Viterbi算法 7.4 先进的解码方法 7.4.1 A*解码算法 7.5 语音的声学处理 7.5.1 声波 7.5.2 怎样解释波形 7.5.3 声谱 7.5.4 特征抽取 7.6 声学概率的计算 7.7 语音识别系统的训练 7.8 用于语音合成的波形生成 7.8.1 音高和音延的修正 7.8.2 单元选择 7.9 人的语音识别 7.10 小结 7.11 文献和历史说明 第二部分 句法的计算机处理 第8章 词的分类与词类标注 8.1 大多数英语词的分类 8.2 英语的标记集 8.3 词类标注 8.4 基于规则的词类标注 8.5 随机词类标注 8.5.1 说明问题的一个例子 8.5.2 实际的HMM标注算法 8.6 基于转换的标注 8.6.1 怎样应用TBL规则 8.6.2 怎样学习TBL规则 8.7 其他问题 8.7.1 多重标记和多项词 8.7.2 未知词 8.7.3 基于类的N元语法 8.8 小结 8.9 文献和历史说明 第9章 英语的上下文无关语法 9.1 组成性 9.2 上下文无关规则和树 9.3 句子级的结构 9.4 名词短语 9.4.1 在中心名词前的成分 9.4.2 名词后的成分 9.5 并列关系 9.6 一致关系 9.7 动词短语和次范畴化 9.8 助动词 9.9 口语的句法 9.9.1 不流畅现象 9.10 语法等价与范式 9.11 有限状态语法和上下文无关语法 9.12 语法和人的语言处理 9.13 小结 9.14 文献和历史说明 第10章 基于上下文无关语法的剖析 10.1 剖析就是搜索 10.1.1 自顶向下剖析 10.1.2 自底向上剖析 10.1.3 自顶向下剖析与自底向上剖析的对比 10.2 基本的自顶向下剖析 10.2.1 增加自底向上过滤 10.3 基本的自顶向下剖析的问题 10.3.1 左递归 10.3.2 歧义 10.3.3 子树的重复剖析 10.4 Earley算法 10.4.1 预测 10.4.2 扫描 10.4.3 完成 10.4.4 示例 10.4.5 从线图中检索剖析树 10.5 有限状态剖析方法 10.6 小结 10.7 文献和历史说明 第11章 特征与合一 11.1 特征结构 11.2 特征结构的合一 11.3 语法中的特征结构 11.3.1 一致关系 11.3.2 中心语特征 11.3.3 次范畴化 11.3.4 其他词类的次范畴化 11.3.5 长距离依存关系 11.4 合一的实现 11.4.1 合一的数据结构 11.4.2 合一算法 11.5 带有合一约束的剖析 11.5.1 把合一结合到Earley剖析器中 11.5.2 复制的必要性 11.5.3 合一剖析 11.6 类型与继承 11.6.1 类型的扩充 11.6.2 合一的其他扩充 11.7 小结 11.8 文献和历史说明 第12章 词汇化剖析与概率剖析 12.1 概率上下文无关语法 12.1.1 PCFG的概率CYK剖析 12.1.2 PCFG概率的学习 12.2 PCFG的问题 12.3 概率词汇化的CFG 12.4 依存语法 12.4.1 范畴语法 12.5 人的剖析 12.6 小结 12.7 文献和历史说明 第13章 语言的复杂性 13.1 Chomsky层级 13.2 怎么判断一种语言不是正则的 13.2.1 抽吸引理 13.2.2 英语和其他自然语言是正则语言吗 13.3 自然语言是上下文无关的吗 13.4 计算复杂性和人的语言处理 13.5 小结 13.6 文献和历史说明 第三部分 语义的计算机处理 第14章 意义的表示法 14.1 意义表示的计算要求 14.1.1 可能性验证 14.1.2 无歧义表示 14.1.3 规范形式 14.1.4 推论与变元 14.1.5 表达能力 14.2 语言的意义结构 14.2.1 谓词论元结构 14.3 一阶谓词演算 14.3.1 FOPC基础 14.3.2 FOPC的语义 14.3.3 变量和逻辑量词 14.3.4 推论 14.4 某些与语言学相关的概念 14.4.1 范畴 14.4.2 事件 14.4.3 时间表示 14.4.4 体 14.4.5 信念表示 14.4.6 缺陷 14.5 有关的表示方法 14.6 意义的其他表示方法 14.6.1 作为行动的意义 14.6.2 作为真值的意义 14.7 小结 14.8 文献和历史说明 第15章 语义分析 15.1 句法驱动的语义分析 15.1.1 给上下文无关语法规则扩充语义 15.1.2 量词辖域和复杂项的转译 15.2 给英语片断附加语义分析 15.2.1 句子 15.2.2 名词短语 15.2.3 动词短语 15.2.4 介词短语 15.3 把语义分析结合到Earley剖析中 15.4 惯用语和组成性 15.5 鲁棒的语义分析 15.5.1 语义语法 15.5.2 信息抽取 15.6 小结 15.7 文献和历史说明 第16章 词汇语义学 16.1 词位及其涵义之间的关系 16.1.1 同形关系 16.1.2 多义关系 16.1.3 同义关系 16.1.4 上下位关系 16.2 WORDNET：词汇关系信息库 16.3 词的内在结构 16.3.1 题元角色 16.3.2 选择限制 16.3.3 基元分解 16.3.4 语义场 16.4 语言的创造性与词典 16.4.1 隐喻 16.4.2 换喻 16.4.3 隐喻和换喻的计算方法 16.5 小结 16.6 文献和历史说明 第17章 词义排歧与信息检索 17.1 基于选择限制的排歧 17.1.1 选择限制的局限性 17.2 鲁棒的词义排歧 17.2.1 机器学习方法 17.2.2 基于词典的方法 17.3 信息检索 17.3.1 向量空间模型 17.3.2 检索词加权 17.3.3 检索词的选择和创造 17.3.4 同形关系. 多义关系和同义关系 17.3.5 改进用户的查询条件 17.4 信息检索的其他任务 17.5 小结 17.6 文献和历史说明 第四部分 语用的计算机处理 第18章 话语 18.1 所指判定 18.1.1 所指现象 18.1.2 同指的句法和语义约束 18.1.3 代词解释中的优先关系 18.1.4 代词判定算法 18.2 文本的连贯 18.2.1 现象 18.2.2 基于推理的判定算法 18.3 话语结构 18.4 所指和连贯的心理语言学研究 18.5 小结 18.6 文献和历史说明 第19章 对话与会话智能代理 19.1 什么使对话出现差别 19.1.1 话轮和话段 19.1.2 对话的共同基础 19.1.3 会话隐涵 19.2 对话行为 19.3 对话行为的自动解释 19.3.1 对话行为的计划推理解释 19.3.2 对话行为的基于提示的解释 19.3.3 要点 19.4 对话结构与连贯性 19.5 会话智能代理中的对话管理 19.6 小结 19.7 文献和历史说明 第20章 自然语言生成 20.1 语言生成导引 20.2 生成的体系结构 20.3 表层实现 20.3.1 系统语法 20.3.2 功能合一语法 20.3.3 要点 20.4 话语规划 20.4.1 文本说明图 20.4.2 修辞关系 20.4.3 小结 20.5 其他问题 20.5.1 微规划 20.5.2 词汇选择 20.5.3 生成系统评价 20.5.4 语音生成 20.6 小结 20.7 文献和历史说明 第21章 机器翻译 21.1 语言的相似性和差异性 21.2 转换模型 21.2.1 句法转换 21.2.2 词汇转换 21.3 中间语的思想：使用意义 21.4 直接转换 21.5 使用统计技术 21.5.1 流畅性的量化 21.5.2 忠实性的量化 21.5.3 输出的搜索 21.6 可用性与系统开发 21.7 小结 21.8 文献和历史说明 附录A 正则表达式的算符 附录B PORTER STEMMING算法 附录C 标记集C5和C7 附录D HMM模型的训练：向前-向后算法 参考文献 术语表

This book introduces the mathematics that supports advanced computer programming and the analysis of algorithms. The primary aim of its well-known authors is to provide a solid and relevant base of mathematical skills - the skills needed to solve complex problems, to evaluate horrendous sums, and to discover subtle patterns in data. It is an indispensable text and reference not only for computer scientists - the authors themselves rely heavily on it! - but for serious users of mathematics in virtually every discipline. Concrete Mathematics is a blending of CONtinuous and disCRETE mathematics. "More concretely," the authors explain, "it is the controlled manipulation of mathematical formulas, using a collection of techniques for solving problems." The subject matter is primarily an expansion of the Mathematical Preliminaries section in Knuth's classic Art of Computer Programming, but the style of presentation is more leisurely, and individual topics are covered more deeply. Several new topics have been added, and the most significant ideas have been traced to their historical roots. The book includes more than 500 exercises, divided into six categories.Complete answers are provided for all exercises, except research problems, making the book particularly valuable for self-study. Major topics include: *Sums *Recurrences *Integer functions *Elementary number theory *Binomial coefficients *Generating functions *Discrete probability *Asymptotic methods This second edition includes important new material about mechanical summation. In response to the widespread use of the first edition as a reference book, the bibliography and index have also been expanded, and additional nontrivial improvements can be found on almost every page. Readers will appreciate the informal style of Concrete Mathematics. Particularly enjoyable are the marginal graffiti contributed by students who have taken courses based on this material. The authors want to convey not only the importance of the techniques presented, but some of the fun in learning and using them. 0201558025B04062001

《3D 游戏编程大师技巧》是游戏编程畅销书作者André LaMothe的扛鼎之作，从游戏编程和软件引擎的角度深入探讨了3D图形学的各个重要主题。全书共分5部分，包括16章的内容。第1～3章简要地介绍了Windows和DirectX编程，创建了一个Windows应用程序模板，让读者能够将精力放在游戏逻辑和图形实现中，而不用考虑Windows和DirectX方面的琐事；第4～5章简要地介绍了一些数学知识并实现了一个数学库，供以后编写演示程序时使用；第6章概述了3D图形学，让读者对《3D 游戏编程大师技巧(附光盘)》将介绍的内容有大致的了解；第7～11章分别介绍了光照、明暗处理、仿射纹理映射、3D裁剪和深度缓存等内容；第12～14章讨论了高级3D渲染技术，包括透视修正纹理映射、Alpha混合、1/z缓存、纹理滤波、空间划分和可见性算法、阴影、光照映射等；第15～16章讨论了动画、运动碰撞检测和优化技术。 《3D 游戏编程大师技巧》适合于有一定编程经验并想从事游戏编程工作或对3D图形学感兴趣的人员阅读。

本书是关于ML程序设计的经典教材，详细介绍如何使用 ML语言进行程序设计，并讲解函数式程序设计的基本原理。 　　书中含有大量例子，涵盖了排序、矩阵运算、多项式运算等方面。大型的例子包括一个一般性的自顶向下语法分析器、一个一演算归约程序和一个定理证明机。书中也讲述了关于数组、队列、优生队列等高效的函数式实现，并且有一章专门讨论函数式程序的形式论证。本书的代码均可以从作者网站（http://www.cl.cam.ac.uk/users/lcp/）得到。 　　本书详细讲解如何使用ML语言进行程序设计，并介绍函数式程序设计的基本原理。书中特别讲述了为ML的修订版所设计的新标准库的主要特性，并且给出大量例子，涵盖排序、矩阵运算、多项式运算等方面。大型的例子包括一个一般性的自顶向下语法分析器、一个l-演算归约程序和一个定理证明机。书中也讲述了关于数组、队列、优先队列等高效的函数式实现，并且有一章专门讨论函数式程序的形式论证。 　　本书可作为高等院校计算机专业相关课程的教材，也适合广大程序设计人员参考。

“c++程序员可以分成两类，读过effective c++的和没读过的。”世界顶级c++大师scott meyers这部成名之作，与这句话一道在全球无数读者间广为传颂。几乎所有c++书籍推荐名单上﹐《effective c++:改善程序与设计的55个具体做法:第3版》都会位列三甲。作者高超的技术把握力、独特的视角﹑诙谐轻松的写作风格﹑独具匠心的内容组织﹐都受到极大的推崇和仿效。 对于国外技术图书，选择翻译版还是影印版，常让人陷入两难。本评注版力邀国内资深专家执笔，在英文原著基础上增加中文点评与注释，旨在融合二者之长，既保留经典的原创文字与味道，又以先行者的学研心得与实践感悟，对读者阅读与学习加以点拨、指明捷径。 经过评注的版本，更值得反复阅读与体会。希望这《effective c++:改善程序与设计的55个具体做法:第3版》能够帮助您跨越c++的重重险阻，领略高处才有的壮美风光，做一个成功而快乐的c++程序员。