西安邮电软件专业英语新教材

Content 第一课 数学化的计算科学的前景 2 （Lesson 1 towards a Mathematical Science of Computation） 第二课 超大规模计算 6 （Lesson 2 Extreme Scale Computing ） 第三课 GPU用于通用计算 10 （Lesson 3 Utilisation of the GPU architecture for HPC） 第五课 云计算简介 17 （Lesson 5 Introduction to Cloud Computing） 第六课 物联网 25 （Lesson 6 The Internet of Things： Global Trends 2025） 第十课 数据仓库概论 31 （Lesson 10 Data Warehouse Overview） 第十一课 面向智能体的软件工程 37 （Lesson 11 Agent-Oriented Software Engineering） 第十二课 为什么软件不应当有所有者？ 51 （Lesson 12 Why Software Should Not Have Owners） 第十三课 关于4G 59 （Lesson 13 About 4G） 第十四课 2020年的因特网 63 （Lesson 14 What The Internet Might Look Like In 2020） 第十五课 搜索引擎的工作原理 69 （Lesson 15 How Do Search Engines Work） 第十六课 嵌入式系统 73 （Lesson 16 Embedded systems: A primer） 第二十一课 现代人工智能简介 77 （Lesson 21 Introduction to Artificial Intelligence） 第二十三课 生物信息学简介 83 （Lesson 23 Introduction to Bioinformatics） 1

Lesson 1 towards a Mathematical Science of Computation J. McCarthy, Stanford University 1 Introduction In this paper I shall discuss the prospects for a mathematical science of computation[1]. In a mathematical science, it is possible to deduce from the basic assumptions, the important properties of the entities treated by the science. Thus, from Newton's law of gravitation and his laws of motion, one can deduce that the planetary orbits obey Kepler's laws. What are the entities with which the science of computation deals? What kinds of facts about these entities would we like to derive? What are the basic assumptions from which we should start? What important results have already been obtained? How can the mathematical science help in the solution of practical problems? I would like to propose some partial answers to these questions. These partial answers suggest some problems for future work. First I shall give some very sketchy general answers to the questions. Then I shall present some recent results on three specific questions. Finally, I shall try to draw some conclusions about practical applications and problems for future work. 在本文中，我将讨论的数学科学的计算前景[ 1 ]。在数学科学中，可以从基本假设中推断出科学的重要性质。因此，从牛顿万有引力定律和他的运动定律，我们可以推断行星轨道服从开普勒定律。 计算交易科学的实体是什么？ 我们希望从中得出什么样的事实？ 从中我们应该开始的基本假设是什么？ 已经取得了哪些重要成果？ 数学科学如何帮助解决实际问题？ 我想提出一些对这些问题的部分答案。这些部分的回答为今后的工作提出了一些问题。我先给出一些问题非常粗略的答案。然后，我会提出一些最近的结果在三个具体问题。最后，我将尝试得出一些结论，对未来工作的实际应用和问题。 2 What Are The Entities With Which Computer Science Deals? These are problems, procedures, data spaces, programs representing procedures in particular programming languages, and computers. A problem is defined by the criterion which determines whether a proposed solution is accepted. One can understand a problem completely without having any method of solution. Procedures are usually built up from elementary procedures. What these elementary procedures may be, and how more complex procedures are constructed from them, is one of the first topics in computer science. This subject is not hard to understand since there is a precise notion of a computable function to guide us, and computability relative to a given collection of initial functions is easy to define. Procedures operate on members of certain data spaces and produce members of other data spaces, using in general still other data spaces as intermediates. A number of operations are known for constructing new data spaces from simpler ones, but there is as yet no general theory of representable data spaces comparable to the theory of computable functions. Programs are symbolic expressions representing procedures. The same procedure may be represented by different programs in different programming languages. We shall discuss the problem of defining a programming language semantically by stating what procedures the programs represent. As for the syntax of programming 2

languages, the rules which allow us to determine whether an expression belongs to the language have been formalized, but the parts of the syntax which relate closely to the semantics have not been so well studied. The problem of translating procedures from one programming language to another has been much studied, and we shall try to give a definition of the correctness of the translation. Computers are finite automata. From our point of view, a computer is defined by the effect of executing a program with given input on the state of its memory and on its outputs. Computer science must study the various ways elements of data spaces are represented in the memory of the computer and how procedures are represented by computer programs. From this point of view, most of the current work on automata theory is beside the point. 2计算机科学交易的实体是什么？ 这些都是问题，程序，数据空间，程序在特定的编程语言，和计算机程序。 一个问题被定义的标准，它决定是否接受建议的解决方案。一个人完全可以完全理解一个问题，而不需要任何解决方法。程序通常是由基本程序建立的。这些基本程序可能是什么，以及如何构造出更复杂的程序，是计算机科学中的第一个主题之一。这个题目是不难理解的因为有一个精确的概念，一个可计算函数来指导我们，和可计算性相对于一个给定集合的初始功能易于定义。 程序对某些数据空间的成员进行操作，并产生其他数据空间的成员，在一般的其他数据空间中使用。一系列的操作被称为从简单的构造新的数据空间，但目前还没有通用的理论表示的数据空间与可计算函数理论。 程序是表示程序的符号表达式。相同的程序可以用不同的编程语言来表示。我们将讨论在语义上定义一个编程语言的问题，说明程序的代表性。至于程序设计语言的语法，允许我们判断一个表达式是否属于语言的规则已经正式化，但与语义关系的语法的部分不那么好研究。从一种编程语言到另一种编程语言的翻译问题进行了大量的研究，并试图给出一个定义的正确性的翻译。 计算机是有限自动机。从我们的观点来看，一台计算机被定义的效果，执行一个程序与给定的输入的状态，它的内存和它的输出。计算机科学必须研究数据空间的各种方式，在计算机的存储器中表示，以及如何用计算机程序来表示程序。从这个角度来看，目前的工作在自动机理论的最重要的点。 3 What Kinds of Facts About Problems, Procedures, data Spaces, Programs, And Computers Would We Like to Derive? Primarily, we would like to be able to prove that given procedures solve given problems. However, proving this may involve proving a whole host of other kinds of statement such as: 1. Two procedures are equivalent, i.e. compute the same function. 2. A number of computable functions satisfy a certain relationship, such as an algebraic identity or a formula of the functional calculus. 3. A certain procedure terminates for certain initial data, or for all initial data. 4. A certain translation procedure correctly translates procedures between one programming language and another. 5. One procedure is more efficient than another equivalent procedure in the sense of taking fewer steps or requiring less memory. 6. A certain transformation of programs preserves the function expressed but increases the efficiency. 7. A certain class of problems is unsolvable by any procedure, or requires procedures of a certain type for its solution. 3问题，程序，数据空间，程序和计算机的各种事实，我们希望得到什么？ 首先，我们希望能够证明给定的程序解决给定的问题。然而，证明这可能涉及证明一个整体的其他类型的陈述，如： 1。双程序是等价的，即计算相同的函数。 2。许多可计算函数满足一定的关系，如代数恒等式或函数演算的公式。 3。某些程序终止某些初始数据，或为所有初始数据。