计算机科学外文翻译
- 格式:doc
- 大小:345.00 KB
- 文档页数:11
(本科毕业论文)外文文献及译文题目:Robots Make Computer Science Personal专业名称机械设计制造及其自动化学生姓名陈慧斌指导教师邓修瑾毕业时间2014.6外文文献原文:Robots Make Computer Science Personal They also make it more hands-on, real, practical, and immediate ,inspiring a newgeneration of scientists' deep interest in the field.Computer science has lost its appeal, and robots can help find it. Even as computing has in vadedevery aspect of our lives, CS as a field of study is often seen as disconnected from these same lives. So to reestablish the connection,the Institute for Personal Robots in Education (IPRE, ) is developing a personal robot, software,and curricula to help teach introductory CS courses. Imbued with the proper pedagogical philosophy and training, it can help make CS mor- epersonal.Who is to blame for the current lack of interest ? Well, me, for one. But CS education has long been a "student repellent," along with what might be viewed as asocial industry practices and unfortunate Hollywood stereotypes. Though there are islands of hope (such as Carnegie Mellon University and the Georgia Institute of Technology), overall, fewer students are enrolling in CS courses, staying with them,or moving into industry because w e have was hed them out of the classroom and the pipeline.Then again, maybe the lack of interest simply reflects the state of the U.S. economy. But if you look at the numbers over the past 20 years, at least some invariants can't be explained away by economic booms and busts. Women and minorities have always been underrepresented in computing; their numbers in the U.S.peaked almost 25 y ears ago. Meanwhile, from 1998 to 2004 the enrollment of women in CS fell 80%, from about 1.5% to about 0.25%, according to the Higher Education Research Institute at the University of California,Los Angeles (/heri/heri.html) [4]. This trend is related to CS's reputation for being impersonal to all types of students, as reflected in the falling enrollment figures across the board, also according to the Higher Education Research Institute. Foll owing recent research in CS gender issues, we no w know much mor e about the weaknesses in CS education [2], most notably that students' personal values are often at odds with the environment in CS classrooms. For example, long solitary hours in the laboratory obsessing over minute details is exactly the opposite of what many students are looking for. If CS educators would confront this reality and develop the pedagogical principles needed to fix it, w e could at least hope that the gr owing crisis in the CS pipeline might be ameliorated.Toward this end, my colleagues and I at IPRE have embarked on a multiyear project to create new introductory CS courses and textbooks designed to be accessible and inspiring to all students. The curricula are centered around a small personal robot (about the size of a paperback book) tentatively named "Gyro" being developed at the Georgia Institute of Technology (see the figure here). Our visions that each student would pur chase one for about$150 retail at their college bookstores, using them throughout their CS explorations. IPRE was initiated through a $1 million grant from Microsoft Research, announced in July 2006.At first glance, using robots may sound like a strange way to attract into CS those students who have traditionally been intimidated, excluded, or weeded-out of the field. One could imagine that robots would only exacerbate the problem rather than help alleviate it. However, CS is fundamentally about problem solving, and the example problems assigned to students in the classroom can profoundly influence ho w they perceive CS relevance and useful-ness. For example, an instructor who illustrates the topic of parsing with a com -piler example has lost an opportunity to connect CS with the rest of the everyday world. Exclusively using such incestuous examples is the equivalent of "computer science for the computer scientist." We must provide motivation that is instantly appreciated and understood by all.Having an artifact—in this case a robot—provides intrinsic motivation to both the instructor and the student to explore the science and engineering behind it. Students continue for reasons (such as fun, curiosity, and to show off to family and friends) that are very different from those traditionally identified. Consider a student who writes a program that produces the output "5" then later disco vers the correct output is "4." The instructor would likely attempt to motivate this student's innate interest in the art and science of debugging. However , the goal of producing the correct answer motivates only some students, while others see it only as a way to "please the instructor." Now consider an assignment that requires students to write a pro-gram to create a dancing robot. The notion of "correct answers" is thrown out the window. In addition, the instructor doesn't have to artificially motivate debugging because the students generate their own motivation. They initiate the debugging conversation, eager to understand and fix a program not because it is perceived by the instructor as "wrong" but because the robot doesn't do what they want it to do. Projects like "robot dancing" represent a more natural learning environment, focusing on the creative not the merely correct.Our embrace of the personal robot in the class-room is built on the shoulders of creative giants,including:Karel. In the form of an ASCII character or toy-like robot only a few pixels tall, it moves through at grid world picking up and dropping off beepers[3];Alice. Controlling beautifully rendered characters(such as chickens, snowmen, and ovens), it allows students to create animated stories(); andLego Mindstor ms. These build-it-yourself robots are packaged as a kit ().Our vision of a personal robot in the classroom adds to the conversation. It will emerge from its box, perhaps in the form of an egg or small creature rolling around on its own wheels, immediately usable by students for writing simple control programs or for instant messaging other robots and using the IMs to allow them to coordinate their robots' behaviors. They will operate in the real-world environment of walls andgravity, a place quite different from Karel's beeper-tagged grid world. In addition, the software, called Myro, we are developing for controlling robot movements, reactions, and environmental sensing can be used in real robotics research projects. (Myro is implemented in Iron-Python and C# running on .NET and Mono, the open sour ce- implementation of .NET .) It will help students progress fr om introductory coursework to more advanced concepts (such as data structures and object-oriented programming). It will be able to control a variety of simulated, educational, and commercial robots, including Mobile 's Pioneer, 's Roomba, and Lego Mindstorms. It will enhance students' understanding of what it means for software to perform within and despite the constraints and opportunities of the physical world, helping bring a sense of authenticity to the class-room, for which there is no substitute.Guided by the philosophical principle of "pedagogical scalability," IPRE looks for tools that are simple to understand and use immediately yet provide strong . One such tool is the language Python, which is intuitive, powerful, and easy to learn () [1]. We have been exploring its use in CS education for several years. We now hope to develop and identify a library beyond Myro, Gyro, and Python of pedagogically scalable hardware, software, and course ware tools for teaching CS.Robots are no silver bullet for overcoming the current difficulty attracting and keeping students. But they can be used in combination with other ideas to create a mor e meaningful, accessible, interesting, intellectually challenging medium for teaching. We hope that they, along with personal open-ended assignments and a scalable pedagogical framework, will help attract, inspire, prepare, and keep a large and diverse group of students. Our aim is for them to find CS more satisfying, as well as a great place to refine their computational thinking, creativity , and career ambitions.We begin testing these ideas in the classroom in the spring of 2007 at both Bryn Mawr College and the Georgia Institute of Technology, then explore the possibilities over the following three years. If all goes well, perhaps these personal robots will help CS regain the universal appeal it once had.译文:机器人技术使计算机科学更加贴近大众机器人技术同时也使计算机科学更加实用、真切,更富于操作性和动作的迅捷。
计算学科综述作者: PETER J. DENNING (CHAIRMAN), DOUGLAS E. COMER, DAVID GRIES, MICHAEL C. MULDER, ALLEN TUCKER, A. JOE TURNER, and PAUL R. YOUNG1 引言美国计算机协会(ACM)已成立42 年了,但一场老问题的争论仍在继续。
计算机科学是科学还是工程学科?或者只是一门技术、一个计算商品的研制者和销售者?学科的智力本质是什么?它将持续兴旺下去或者在我们的下一代衰落下去?计算机科学和工程目前的核心课程是否反映了这一领域?怎样把理论和实验室的工作集成在计算课程中?各核心课程培养计算方面的能力吗?我们建议一种面向技术的学科描述,其基础是数学和工程。
例如,我们把算法当作最基本的研究对象,而程序设计和硬件设计则当作正要的研究活动。
认为"计算机科学等于程序设计"的观点在我们的许多课程里是很占上风的。
导引性的课程是程序设计,程序设计技术安排在各核心课程中,而科学则在选修课中。
这外观点阻止了重新组织各课程的进展,使心怀大志的最好的学生远离我们而去。
它拒绝了一条统一的途径,以便把实验的和理论的计算机科学集成为课程的有机组成部分。
今天,本领域已经足够成熟,使我们能用新的水到渠成的方式来描述它的知识本质。
这在计算机科学与工程博士单位评审部的领导者们1984 年7 月在犹他州召开的会议上进行了讨论。
这一讨论及其他类似的讨论推动ACM 和IEEE 计算机学会组成攻关组去开创新途径。
1985 年春,ACM 总裁Adele Goldberg 和ACM 教育委员会主席Robert Aiken 在IEEE计算机学会热心合作之下,任命了这个计算机科学核心攻关组。
同时,计算机学会在ACM 的热心合作下,组成了计算机实验工作攻关组。
我们希望,本报告所反映的核心攻关组的工作能产生比预定更多的效益。
有了对本学科的核心的共同的认识,就能理顺利协调这两个学会发展行各分支学科和课题的进程。
科技英语词汇大全了解科技领域的专业英语词汇科技英语词汇大全:了解科技领域的专业英语词汇科技在当今社会中起到了至关重要的作用,而掌握科技领域的专业英语词汇成为了越来越多人的需求。
本文将介绍一些常见的科技英语词汇,帮助读者在科技领域中更好地沟通和学习。
一、计算机和信息技术词汇1. Computer(计算机)- 一种能够完成数据处理和存储的机器。
2. Software(软件)- 与计算机硬件相对应,指的是一系列指令的集合,用于指导计算机进行特定任务。
3. Hardware(硬件)- 计算机的实际物理组件,如主机、显示器、键盘、鼠标等。
4. Internet(互联网)- 全球电子通信网络,将全球各地的计算机互相连接。
5. Network(网络)- 多台计算机通过通信设备相互连接形成的系统。
6. Database(数据库)- 结构化数据的集合,用来储存和组织大量数据。
7. Programming(编程)- 设计和创建计算机程序的过程。
二、人工智能和机器学习词汇1. Artificial Intelligence(人工智能)- 计算机模拟人类智能的一种技术。
2. Machine Learning(机器学习)- 计算机通过大量数据和算法,从中学习和提取模式,不断优化性能。
3. Deep Learning(深度学习)- 机器学习的一种特殊形式,在模拟人脑神经网络方面更为强大。
4. Neural Network(神经网络)- 一种模拟神经系统的计算模型,用于模拟人脑的学习和处理能力。
5. Natural Language Processing(自然语言处理)- 计算机通过算法和模型处理和理解人类语言。
6. Big Data(大数据)- 用来描述无法通过传统处理方法处理的大量数据量。
7. Algorithm(算法)- 在计算过程中为解决特定问题而设计的一系列步骤。
三、通信技术词汇1. Telecommunication(电信)- 通过传输信号进行远程通信的技术。
本科毕业论文外文翻译外文译文题目(中文):具体数学:汉诺塔问题学院: 计算机科学与技术专业: 计算机科学与技术学号:学生姓名:指导教师:日期: 二○一二年六月1 Recurrent ProblemsTHIS CHAPTER EXPLORES three sample problems that give a feel for what’s to c ome. They have two traits in common: They’ve all been investigated repeatedly by mathe maticians; and their solutions all use the idea of recurrence, in which the solution to eac h problem depends on the solutions to smaller instances of the same problem.1.1 THE TOWER OF HANOILet’s look first at a neat little puzzle called the Tower of Hanoi,invented by the Fr ench mathematician Edouard Lucas in 1883. We are given a tower of eight disks, initiall y stacked in decreasing size on one of three pegs:The objective is to transfer the entire tower to one of the other pegs, movingonly one disk at a time and never moving a larger one onto a smaller.Lucas furnished his toy with a romantic legend about a much larger Tower of Brah ma, which supposedly has 64 disks of pure gold resting on three diamond needles. At th e beginning of time, he said, God placed these golden disks on the first needle and orda ined that a group of priests should transfer them to the third, according to the rules abov e. The priests reportedly work day and night at their task. When they finish, the Tower will crumble and the world will end.It's not immediately obvious that the puzzle has a solution, but a little thought (or h aving seen the problem before) convinces us that it does. Now the question arises:What' s the best we can do?That is,how many moves are necessary and suff i cient to perfor m the task?The best way to tackle a question like this is to generalize it a bit. The Tower of Brahma has 64 disks and the Tower of Hanoi has 8;let's consider what happens if ther e are TL disks.One advantage of this generalization is that we can scale the problem down even m ore. In fact, we'll see repeatedly in this book that it's advantageous to LOOK AT SMAL L CASES first. It's easy to see how to transfer a tower that contains only one or two di sks. And a small amount of experimentation shows how to transfer a tower of three.The next step in solving the problem is to introduce appropriate notation:NAME ANO CONQUER. Let's say that T n is the minimum number of moves that will t ransfer n disks from one peg to another under Lucas's rules. Then T1is obviously 1 , an d T2= 3.We can also get another piece of data for free, by considering the smallest case of all:Clearly T0= 0,because no moves at all are needed to transfer a tower of n = 0 disks! Smart mathematicians are not ashamed to think small,because general patterns are easier to perceive when the extreme cases are well understood(even when they are trivial).But now let's change our perspective and try to think big;how can we transfer a la rge tower? Experiments with three disks show that the winning idea is to transfer the top two disks to the middle peg, then move the third, then bring the other two onto it. Thi s gives us a clue for transferring n disks in general:We first transfer the n−1 smallest t o a different peg (requiring T n-1moves), then move the largest (requiring one move), and finally transfer the n−1 smallest back onto the largest (req uiring another T n-1moves). Th us we can transfer n disks (for n > 0)in at most 2T n-1+1 moves:T n≤2T n—1+1,for n > 0.This formula uses '≤' instead of '=' because our construction proves only that 2T n—1+1 mo ves suffice; we haven't shown that 2T n—1+1 moves are necessary. A clever person might be able to think of a shortcut.But is there a better way? Actually no. At some point we must move the largest d isk. When we do, the n−1 smallest must be on a single peg, and it has taken at least T moves to put them there. We might move the largest disk more than once, if we're n n−1ot too alert. But after moving the largest disk for the last time, we must trans fr the n−1 smallest disks (which must again be on a single peg)back onto the largest;this too re quires T n−1moves. HenceT n≥ 2T n—1+1,for n > 0.These two inequalities, together with the trivial solution for n = 0, yieldT0=0;T n=2T n—1+1 , for n > 0. (1.1)(Notice that these formulas are consistent with the known values T1= 1 and T2= 3. Our experience with small cases has not only helped us to discover a general formula, it has also provided a convenient way to check that we haven't made a foolish error. Such che cks will be especially valuable when we get into more complicated maneuvers in later ch apters.)A set of equalities like (1.1) is called a recurrence (a. k. a. recurrence relation or r ecursion relation). It gives a boundary value and an equation for the general value in ter ms of earlier ones. Sometimes we refer to the general equation alone as a recurrence, alt hough technically it needs a boundary value to be complete.The recurrence allows us to compute T n for any n we like. But nobody really like to co m pute fro m a recurrence,when n is large;it takes too long. The recurrence only gives indirect, "local" information. A solution to the recurrence would make us much h appier. That is, we'd like a nice, neat, "closed form" for Tn that lets us compute it quic kly,even for large n. With a closed form, we can understand what T n really is.So how do we solve a recurrence? One way is to guess the correct solution,then to prove that our guess is correct. And our best hope for guessing the solution is t o look (again) at small cases. So we compute, successively,T3= 2×3+1= 7; T4= 2×7+1= 15; T5= 2×15+1= 31; T6= 2×31+1= 63.Aha! It certainly looks as ifTn = 2n−1,for n≥0. (1.2)At least this works for n≤6.Mathematical induction is a general way to prove that some statement aboutthe integer n is true for all n≥n0. First we prove the statement when n has its smallest v alue,no; this is called the basis. Then we prove the statement for n > n0,assuming that it has already been proved for all values between n0and n−1, inclusive; this is called th e induction. Such a proof gives infinitely many results with only a finite amount of wo rk.Recurrences are ideally set up for mathematical induction. In our case, for exampl e,(1.2) follows easily from (1.1):The basis is trivial,since T0 = 20−1= 0.And the indu ction follows for n > 0 if we assume that (1.2) holds when n is replaced by n−1:T n= 2T n+1= 2(2n−1−1)+1=2n−1.Hence (1.2) holds for n as well. Good! Our quest for T n has ended successfully.Of course the priests' task hasn't ended;they're still dutifully moving disks,and wil l be for a while, because for n = 64 there are 264−1 moves (about 18 quintillion). Even at the impossible rate of one move per microsecond, they will need more than 5000 cent uries to transfer the Tower of Brahma. Lucas's original puzzle is a bit more practical, It requires 28−1 = 255 moves, which takes about four minutes for the quick of hand.The Tower of Hanoi recurrence is typical of many that arise in applications of all kinds. In finding a closed-form expression for some quantity of interest like T n we go t hrough three stages:1 Look at small cases. This gives us insight into the problem and helps us in stages2 and 3.2 Find and prove a mathematical expression for the quantity of interest.For the Tower of Hanoi, this is the recurrence (1.1) that allows us, given the inc lination,to compute T n for any n.3 Find and prove a closed form for our mathematical expression.For the Tower of Hanoi, this is the recurrence solution (1.2).The third stage is the one we will concentrate on throughout this book. In fact, we'll fre quently skip stages I and 2 entirely, because a mathematical expression will be given tous as a starting point. But even then, we'll be getting into subproblems whose solutions will take us through all three stages.Our analysis of the Tower of Hanoi led to the correct answer, but it r equired an“i nductive leap”;we relied on a lucky guess about the answer. One of the main objectives of this book is to explain how a person can solve recurrences without being clairvoyant. For example, we'll see that recurrence (1.1) can be simplified by adding 1 to both sides of the equations:T0+ 1= 1;T n + 1= 2T n-1+ 2, for n >0.Now if we let U n= T n+1,we haveU0 =1;U n= 2U n-1,for n > 0. (1.3)It doesn't take genius to discover that the solution to this recurrence is just U n= 2n;he nce T n= 2n −1. Even a computer could discover this.Concrete MathematicsR. L. Graham, D. E. Knuth, O. Patashnik《Concrete Mathematics》,1.1 ,The Tower Of HanoiR. L. Graham, D. E. Knuth, O. PatashnikSixth printing, Printed in the United States of America1989 by Addison-Wesley Publishing Company,Reference 1-4 pages具体数学R.L.格雷厄姆,D.E.克努特,O.帕塔希尼克《具体数学》,1.1,汉诺塔R.L.格雷厄姆,D.E.克努特,O.帕塔希尼克第一版第六次印刷于美国,韦斯利出版公司,1989年,引用1-4页1 递归问题本章将通过对三个样本问题的分析来探讨递归的思想。
计算机专业课程名称英文翻译(计算机科学与技术(教师教育)专业的课程名称和英文名称)4 中国现代史纲要 Outline of Moderm Chinese History5 大学英语 College English6 大学体育 College PE7 心理学 Psychology8 教育学 Pedagogy9 现代教育技术 Modern Technology10 教师口语 Teachers' Oral Skill11 形势与政策 Current Situation and Policy12 大学生就业与指导 Career Guidance13 学科教学法 Course Teaching Methodology14 生理与心理健康教育 Health and Physiology Education15 环境与可持续发展 Environment and Sustainable Development16 文献检索 Literature Retrieval17 大学体育 College PE18 大学语文 College Chinese19 高等数学 Higher Mathematics20 计算机导论 Introduction to ComputerScience21 程序设计基础 Programming Foundations22 程序设计基础实验 Experimentationof ProgrammingFoundations23 线性代数 Linear Algebra24 大学物理 College Physics25 大学物理实验 Experimentation of CollegePhysics26 电路与电子技术 Circuits and Electronics27 电工与电子技术实验 Experimentation of Circuits andElectronics28 数字逻辑电路 Digital Logic Circuit29 数字逻辑电路 Experimentation of DigitalLogic Circuit30 离散数学 Discrete Mathematics31 数据结构 Data Structures32 数据结构实验 Experimentation of DataStructures33 计算机组成与系统结构 Computer Organization and Architecture34 操作系统 Operating System35 操作系统实验 Experimentation of Operating System36 计算机网络 Computer Network37 计算机网络实验 Experimentation of Computer Network38 面向对象程序设计 Object-Oriented Programming39 面向对象程序设计实验 Experimentation of Object-Oriented Programming40 汇编语言程序设计 Assembly Language41 汇编语言程序设计实验 Experimentation of Assembly Language42 概率与数理统计 Probability and Statistics43 JAVA语言 Java Language45 JAVA语言实验 Experimentation of Java Language46 数据库原理 Databases Principles47 数据库原理实验 Experimentation of Databases Pninciples48 专业英语 Discipline English49 人工智能导论 Introduction to Artificial Intelligence50 算法设计与分析 Design and Analysis Of Algorithms51 微机系统与接口 Microcomputer System and Interface52 编译原理 Compiling Principles53 编译原理实验 Experimentation of Compiling54 数学建模 Mathematics Modeling55 软件工程 Software Engineering计算机专业课程名称英文翻译下(2)(计算机科学与技术(教师教育)专业的课程名称和英文名称)56 软件工程实验 Experimentation of Software Engineering57 嵌入式系统 Embedded System58 嵌入式系统实验 Experimentation of Embedded System59 多媒体技术 Multimedia Technology60 Experimentation of Multimedia Technology61 信息系统分析与设计 Object-Oriented Analysis and Design62 UNIX操作系统分析 UNIX System Analysis63 UNIX/Linux操作系统分析Experimentation of UNIX/Linux SystemAnalysis64 单片机原理 Principles of Single-ChipComputer65 信息安全与保密概论Introduction to Security andm Cryptography66 Web应用技术 Applications of Web67 高级数据库应用技术Advanced Application of Database Technology68 组网技术 Technology ofBuildingNetwork69 组网技术实验 Technology of Building Network70 计算机图形学 Computer Graphics71 嵌入式接口技术 Embedded Interface72 嵌入式接口技术实验Experimentation ofEmbedded Interface73 数字图像处理 Digital Images Processing74 数字图像处理实验 Digital Images Processing75 网络应用软件开发 Network Application Development76 XML原理与应用 XML Principle and Application77 XML原理与应用实验 ExperimentationofXML Principle andApplication78 计算机系统维护 Maintenance of Computer System79 计算机系统维护实验 Experimentation ofComputer Maintenance80 网络管理技术 Network Management Technology81 网络管理技术实验Experimentation of NetworkManagement82 数据仓库与数据挖掘 Data Storage and Data Digging83 项目管理 Project Management84 软件开发实例 Cases of Sotiware Development85 企业资源规划( ERP) Enterprise Resource Planning86 新技术 New Technology87 科研创作指导Supervision in Science ResearchCreation88 电子商务概论 Introduction of ElectronicBusiness89 计算机辅助教学 Computer Aided Teaching另:计算机导论 Introduction to ComputerScience程序设计基础 Foundations ofProgramming电路与电子技术 Circuits and Electronics数字逻辑电路 Digital Logic Circuit离散数学 Discrete Mathematics数据结构 Data Structures计算机组成与系统结构 Computer Organization and Architecture操作系统 Operating System计算机网络 Computer Network面向对象程序设计 Object-Oriented Progjamming数据库原理 Databases Principles。
计算机外⽂翻译(完整)毕业设计(论⽂)外⽂资料翻译专业:计算机科学与技术姓名:王成明学号:06120186外⽂出处:The History of the Internet附件: 1.外⽂原⽂ 2.外⽂资料翻译译⽂;附件1:外⽂原⽂The History of the InternetThe Beginning - ARPAnetThe Internet started as a project by the US government. The object of the project was to create a means of communications between long distance points, in the event of a nation wide emergency or, more specifically, nuclear war. The project was called ARPAnet, and it is what the Internet started as. Funded specifically for military communication, the engineers responsible for ARPANet had no idea of the possibilities of an "Internet."By definition, an 'Internet' is four or more computers connected by a network.ARPAnet achieved its network by using a protocol called TCP/IP. The basics around this protocol was that if information sent over a network failed to get through on one route, it would find another route to work with, as well as establishing a means for one computer to "talk" to another computer, regardless of whether it was a PC or a Macintosh.By the 80's ARPAnet, just years away from becoming the more well known Internet, had 200 computers. The Defense Department, satisfied with ARPAnets results, decided to fully adopt it into service, and connected many military computers and resources into the network. ARPAnet then had 562 computers on its network. By the year 1984, it had over 1000 computers on its network.In 1986 ARPAnet (supposedly) shut down, but only the organization shut down, and the existing networks still existed between the more than 1000 computers. It shut down due to a failied link up with NSF, who wanted to connect its 5 countywide super computers into ARPAnet.With the funding of NSF, new high speed lines were successfully installed at line speeds of 56k (a normal modem nowadays) through telephone lines in 1988. By that time, there were 28,174 computers on the (by then decided) Internet. In 1989 there were 80,000 computers on it. By 1989, there were290,000.Another network was built to support the incredible number of people joining. It was constructed in 1992.Today - The InternetToday, the Internet has become one of the most important technological advancements in the history of humanity. Everyone wants to get 'on line' to experience the wealth of information of the Internet. Millions of people now use the Internet, and it's predicted that by the year 2003 every single person on the planet will have Internet access. The Internet has truly become a way of life in our time and era, and is evolving so quickly its hard to determine where it will go next, as computer and network technology improve every day.HOW IT WORKS:It's a standard thing. People using the Internet. Shopping, playing games,conversing in virtual Internet environments.The Internet is not a 'thing' itself. The Internet cannot just "crash." It functions the same way as the telephone system, only there is no Internet company that runs the Internet.The Internet is a collection of millioins of computers that are all connected to each other, or have the means to connect to each other. The Internet is just like an office network, only it has millions of computers connected to it.The main thing about how the Internet works is communication. How does a computer in Houston know how to access data on a computer in Tokyo to view a webpage?Internet communication, communication among computers connected to the Internet, is based on a language. This language is called TCP/IP. TCP/IP establishes a language for a computer to access and transmit data over the Internet system.But TCP/IP assumes that there is a physical connecetion between onecomputer and another. This is not usually the case. There would have to be a network wire that went to every computer connected to the Internet, but that would make the Internet impossible to access.The physical connection that is requireed is established by way of modems,phonelines, and other modem cable connections (like cable modems or DSL). Modems on computers read and transmit data over established lines,which could be phonelines or data lines. The actual hard core connections are established among computers called routers.A router is a computer that serves as a traffic controller for information.To explain this better, let's look at how a standard computer might viewa webpage.1. The user's computer dials into an Internet Service Provider (ISP). The ISP might in turn be connected to another ISP, or a straight connection into the Internet backbone.2. The user launches a web browser like Netscape or Internet Explorer and types in an internet location to go to.3. Here's where the tricky part comes in. First, the computer sends data about it's data request to a router. A router is a very high speed powerful computer running special software. The collection of routers in the world make what is called a "backbone," on which all the data on the Internet is transferred. The backbone presently operates at a speed of several gigabytes per-second. Such a speed compared to a normal modem is like comparing the heat of the sun to the heat of an ice-cube.Routers handle data that is going back and forth. A router puts small chunks of data into packages called packets, which function similarly to envelopes. So, when the request for the webpage goes through, it uses TCP/IP protocols to tell the router what to do with the data, where it's going, and overall where the user wants to go.4. The router sends these packets to other routers, eventually leadingto the target computer. It's like whisper down the lane (only the information remains intact).5. When the information reaches the target web server, the webserver then begins to send the web page back. A webserver is the computer where the webpage is stored that is running a program that handles requests for the webpage and sends the webpage to whoever wants to see it.6. The webpage is put in packets, sent through routers, and arrive at the users computer where the user can view the webpage once it is assembled.The packets which contain the data also contain special information that lets routers and other computers know how to reassemble the data in the right order.With millions of web pages, and millions of users, using the Internet is not always easy for a beginning user, especially for someone who is not entirely comfortale with using computers. Below you can find tips tricks and help on how to use main services of the Internet.Before you access webpages, you must have a web browser to actually be able to view the webpages. Most Internet Access Providers provide you with a web browser in the software they usually give to customers; you. The fact that you are viewing this page means that you have a web browser. The top two use browsers are Netscape Communicator and Microsoft Internet Explorer. Netscape can be found at /doc/bedc387343323968011c9268.html and MSIE can be found at /doc/bedc387343323968011c9268.html /ie.The fact that you're reading this right now means that you have a web browser.Next you must be familiar with actually using webpages. A webpage is a collection of hyperlinks, images, text, forms, menus, and multimedia. To "navigate" a webpage, simply click the links it provides or follow it's own instructions (like if it has a form you need to use, it will probably instruct you how to use it). Basically, everything about a webpage is made to be self-explanetory. That is the nature of a webpage, to be easily navigatable."Oh no! a 404 error! 'Cannot find web page?'" is a common remark made by new web-users.Sometimes websites have errors. But an error on a website is not the user's fault, of course.A 404 error means that the page you tried to go to does not exist. This could be because the site is still being constructed and the page hasn't been created yet, or because the site author made a typo in the page. There's nothing much to do about a 404 error except for e-mailing the site administrator (of the page you wanted to go to) an telling him/her about the error.A Javascript error is the result of a programming error in the Javascript code of a website. Not all websites utilize Javascript, but many do. Javascript is different from Java, and most browsers now support Javascript. If you are using an old version of a web browser (Netscape 3.0 for example), you might get Javascript errors because sites utilize Javascript versions that your browser does not support. So, you can try getting a newer version of your web browser.E-mail stands for Electronic Mail, and that's what it is. E-mail enables people to send letters, and even files and pictures to each other.To use e-mail, you must have an e-mail client, which is just like a personal post office, since it retrieves and stores e-mail. Secondly, you must have an e-mail account. Most Internet Service Providers provide free e-mail account(s) for free. Some services offer free e-mail, like Hotmail, and Geocities.After configuring your e-mail client with your POP3 and SMTP server address (your e-mail provider will give you that information), you are ready to receive mail.An attachment is a file sent in a letter. If someone sends you an attachment and you don't know who it is, don't run the file, ever. It could be a virus or some other kind of nasty programs. You can't get a virus justby reading e-mail, you'll have to physically execute some form of program for a virus to strike.A signature is a feature of many e-mail programs. A signature is added to the end of every e-mail you send out. You can put a text graphic, your business information, anything you want.Imagine that a computer on the Internet is an island in the sea. The sea is filled with millions of islands. This is the Internet. Imagine an island communicates with other island by sending ships to other islands and receiving ships. The island has ports to accept and send out ships.A computer on the Internet has access nodes called ports. A port is just a symbolic object that allows the computer to operate on a network (or the Internet). This method is similar to the island/ocean symbolism above.Telnet refers to accessing ports on a server directly with a text connection. Almost every kind of Internet function, like accessing web pages,"chatting," and e-mailing is done over a Telnet connection.Telnetting requires a Telnet client. A telnet program comes with the Windows system, so Windows users can access telnet by typing in "telnet" (without the "'s) in the run dialog. Linux has it built into the command line; telnet. A popular telnet program for Macintosh is NCSA telnet.Any server software (web page daemon, chat daemon) can be accessed via telnet, although they are not usually meant to be accessed in such a manner. For instance, it is possible to connect directly to a mail server and check your mail by interfacing with the e-mail server software, but it's easier to use an e-mail client (of course).There are millions of WebPages that come from all over the world, yet how will you know what the address of a page you want is?Search engines save the day. A search engine is a very large website that allows you to search it's own database of websites. For instance, if you wanted to find a website on dogs, you'd search for "dog" or "dogs" or "dog information." Here are a few search-engines.1. Altavista (/doc/bedc387343323968011c9268.html ) - Web spider & Indexed2. Yahoo (/doc/bedc387343323968011c9268.html ) - Web spider & Indexed Collection3. Excite (/doc/bedc387343323968011c9268.html ) - Web spider & Indexed4. Lycos (/doc/bedc387343323968011c9268.html ) - Web spider & Indexed5. Metasearch (/doc/bedc387343323968011c9268.html ) - Multiple searchA web spider is a program used by search engines that goes from page to page, following any link it can possibly find. This means that a search engine can literally map out as much of the Internet as it's own time and speed allows for.An indexed collection uses hand-added links. For instance, on Yahoo's site. You can click on Computers & the Internet. Then you can click on Hardware. Then you can click on Modems, etc., and along the way through sections, there are sites available which relate to what section you're in.Metasearch searches many search engines at the same time, finding the top choices from about 10 search engines, making searching a lot more effective.Once you are able to use search engines, you can effectively find the pages you want.With the arrival of networking and multi user systems, security has always been on the mind of system developers and system operators. Since the dawn of AT&T and its phone network, hackers have been known by many, hackers who find ways all the time of breaking into systems. It used to not be that big of a problem, since networking was limited to big corporate companies or government computers who could afford the necessary computer security.The biggest problem now-a-days is personal information. Why should you be careful while making purchases via a website? Let's look at how the internet works, quickly.The user is transferring credit card information to a webpage. Looks safe, right? Not necessarily. As the user submits the information, it is being streamed through a series of computers that make up the Internet backbone.The information is in little chunks, in packages called packets. Here's the problem: While the information is being transferred through this big backbone, what is preventing a "hacker" from intercepting this data stream at one of the backbone points?Big-brother is not watching you if you access a web site, but users should be aware of potential threats while transmitting private information. There are methods of enforcing security, like password protection, an most importantly, encryption.Encryption means scrambling data into a code that can only be unscrambled on the "other end." Browser's like Netscape Communicator and Internet Explorer feature encryption support for making on-line transfers. Some encryptions work better than others. The most advanced encryption system is called DES (Data Encryption Standard), and it was adopted by the US Defense Department because it was deemed so difficult to 'crack' that they considered it a security risk if it would fall into another countries hands.A DES uses a single key of information to unlock an entire document. The problem is, there are 75 trillion possible keys to use, so it is a highly difficult system to break. One document was cracked and decoded, but it was a combined effort of14,000 computers networked over the Internet that took a while to do it, so most hackers don't have that many resources available.附件2:外⽂资料翻译译⽂Internet的历史起源——ARPAnetInternet是被美国政府作为⼀项⼯程进⾏开发的。
计算机科学英语词汇大全掌握计算机科学领域的专业术语和常见缩略词在计算机科学领域,掌握专业术语和常见缩略词是非常重要的,这有助于更好地理解和沟通。
本文将为您整理一份计算机科学英语词汇大全,以便您学习和掌握这些专业术语。
以下是常见的计算机科学英语词汇及其解释:1. Algorithm(算法): A set of predefined rules or instructions used to solve a specific problem or perform a specific task in a computer program.2. Binary(二进制): A numbering system that consists of only two digits, 0 and 1. It is widely used in computer systems as the fundamental language for representing data and performing calculations.3. Compiler(编译器): A software tool that translates high-level programming languages into machine language or assembly language, which can be directly executed by a computer.4. Database(数据库): A structured collection of data that is organized and stored in a computer system. It allows users to easily retrieve, update, and manage data efficiently.5. Encryption(加密): The process of converting data into a form that is unreadable by unauthorized users. Encryption is used to ensure the security and privacy of sensitive information.6. Firewall(防火墙): A network security device that monitors and controls incoming and outgoing network traffic based on predeterminedsecurity rules. It acts as a barrier between a trusted internal network and untrusted external networks.7. HTML (Hypertext Markup Language)(超文本标记语言): The standard markup language used for creating and structuring web pages. It defines the structure and layout of the content on a webpage.8. GUI (Graphical User Interface)(图形用户界面): A visual interface that allows users to interact with a computer or software using graphical elements, such as windows, icons, buttons, and menus.9. Kernel(内核): The core component of an operating system that manages system resources and provides low-level services to other software applications.10. Machine Learning(机器学习): A branch of artificial intelligence that enables computer systems to learn and improve from experience without being explicitly programmed. It focuses on the development of algorithms that can analyze and interpret data to make predictions or decisions.11. Network(网络): A collection of interconnected devices, such as computers, servers, routers, and switches, that allows for the exchange of data and resources.12. Object-Oriented Programming(面向对象编程): A programming paradigm that organizes software design around objects, rather than logic and procedures. It emphasizes the reusability, modularity, and extensibility of code.13. Protocol(协议): A set of rules and standards that govern the communication between devices on a network. Protocols ensure that data is transmitted and received correctly.14. Query(查询): A request for specific information or data from a database using a query language, such as SQL (Structured Query Language).15. RAM (Random Access Memory)(随机存取存储器): A type of computer memory that stores data that is being actively used by a computer program. It allows for faster access to data compared to other types of storage.16. Software Development(软件开发): The process of designing, coding, testing, and maintaining software applications and systems. It involves various stages, such as requirements analysis, design, implementation, and deployment.17. TCP/IP (Transmission Control Protocol/Internet Protocol)(传输控制协议/互联网协议): A set of networking protocols that allows computers to communicate and exchange data over the internet. It provides a reliable and standardized method for transmitting data packets.18. Virtual Reality(虚拟现实): A computer-generated simulation of a three-dimensional environment that can be interacted with and explored by a user. It typically involves the use of specialized hardware, such as headsets and motion controllers.19. Web Development(网站开发): The process of creating and maintaining websites and web applications. It includes tasks such as webdesign, web content development, client-side scripting, and server-side scripting.20. XML (eXtensible Markup Language)(可扩展标记语言): A markup language that is designed to store and transport data. It is widely used for representing and exchanging structured data over the internet.这些是计算机科学中的一些常见英语词汇和术语。
计算机专业英语翻译参考1.(P1) Computer science deals with the theoreticalfoundations of information and computation, together with practical techniques for the implementation and application of these foundations, such as programming language theory, computational complexity theory, computer graphics and human-computer interaction.计算机科学涉及信息和计算的理论基础,以及这些基础的实施和应用的实际技术,如编程语言理论,计算复杂性理论,计算机图形学和人机交互。
2.(P17) The most important piece of graphics hardware isthe graphics card, which is the piece of equipment that renders out all images and sends them to a display.There are two types of graphics cards: integrated and dedicated. An integrated graphics card, usually by Intel for use in their computers, is bound to the motherboard and shares RAM (Random Access Memory) with the CPU, reducing the total amount of RAM available. This is undesirable for running programs and applications that use a large amount of video memory. A dedicated graphics card has its own RAM and Processor for generating its images, and does not slow down the computer. Dedicated graphics cards also have higher performance than integrated graphicscards. It is possible to have both dedicated and integrated graphics card, however once a dedicated graphics card is installed, the integrated card will no longer function until the dedicated card is removed.最重要的一块图形硬件是显卡,是一件呈现出所有的图像,并将它们发送到一个显示器的设备。
英文参考文献及翻译Linux - Operating system of cybertimes Though for a lot of people , regard Linux as the main operating system to make up huge work station group, finish special effects of " Titanic " make , already can be regarded as and show talent fully. But for Linux, this only numerous news one of. Recently, the manufacturers concerned have announced that support the news of Linux to increase day by day, users' enthusiasm to Linux runs high unprecedentedly too. Then, Linux only have operating system not free more than on earth on 7 year this piece what glamour, get the favors of such numerous important software and hardware manufacturers as the masses of users and Orac le , Informix , HP , Sybase , Corel , Intel , Netscape , Dell ,etc. , OK?1.The background of Linux and characteristicLinux is a kind of " free (Free ) software ": What is called free,mean users can obtain the procedure and source code freely , and can use them freely , including revise or copy etc.. It is a result of cybertimes, numerous technical staff finish its research and development together through Inte rnet, countless user is it test and except fault , can add user expansion function that oneself make conveniently to participate in. As the most outstanding one in free software, Linux has characteristic of the following:(1)Totally follow POSLX standard, expand the network operatingsystem of supporting all AT&T and BSD Unix characteristic. Because of inheritting Unix outstanding design philosophy , and there are clean , stalwart , high-efficient and steady kernels, their all key codes are finished by Li nus Torvalds and other outstanding programmers, without any Unix code of AT&T or Berkeley, so Linu x is not Unix, but Linux and Unix are totally compatible.(2)Real many tasks, multi-user's system, the built-in networksupports, can be with such seamless links as NetWare , Windows NT , OS/2 ,Unix ,etc.. Network in various kinds of Unix it tests to be fastest in comparing and assess efficiency. Support such many kinds of files systems as FAT16 , FAT32 , NTFS , Ex t2FS , ISO9600 ,etc. at the same time .(3) Can operate it in many kinds of hardwares platform , including such processors as Alpha , SunSparc , PowerPC , MIPS ,etc., to various kinds of new-type peripheral hardwares, can from distribute on global numerous programmer there getting support rapidly too.(4) To that the hardware requires lower, can obtain very good performance on more low-grade machine , what deserves particular mention is Linux outstanding stability , permitted " year " count often its running times.2.Main application of Linux At present,Now, the application of Linux mainly includes:(1) Internet/Intranet: This is one that Linux was used most at present, it can offer and include Web server , all such Inter net services as Ftp server , Gopher server , SMTP/POP3 mail server , Proxy/Cache server , DNS server ,etc.. Linux kernel supports IPalias , PPP and IPtunneling, these functions can be used for setting up fictitious host computer , fictitious service , VPN (fictitious special-purpose network ) ,etc.. Operating Apache Web server on Linux mainly, the occupation rate of market in 1998 is 49%, far exceeds the sum of such several big companies as Microsoft , Netscape ,etc..(2) Because Linux has outstanding networking ability , it can be usedin calculating distributedly large-scaly, for instance cartoon making , scientific caculation , database and file server ,etc..(3) As realization that is can under low platform fullness of Unix that operate , apply at all levels teaching and research work of universities and colleges extensively, if Mexico government announce middle and primary schools in the whole country dispose Linux and offer Internet service for student already.(4) Tabletop and handling official business appliedly. Application number of people of in this respect at present not so good as Windows of Microsoft far also, reason its lie in Lin ux quantity , desk-top of application software not so good as Windows application far not merely, because the characteristic of the freedom software makes it not almost have advertisement thatsupport (though the function of Star Office is not second to MS Office at the same time, but there are actually few people knowing).3.Can Linux become a kind of major operating system?In the face of the pressure of coming from users that is strengthened day by day, more and more commercial companies transplant its application to Linux platform, comparatively important incident was as follows, in 1998 ①Compaq and HP determine to put forward user of requirement truss up Linux at their servers , IBM and Dell promise to offer customized Linux system to user too. ②Lotus announce, Notes the next edition include one special-purpose edition in Linux. ③Corel Company transplants its famous WordPerfect to on Linux, and free issue. Corel also plans to move the other figure pattern process products to Linux platform completely.④Main database producer: Sybase , Informix , Oracle , CA , IBM have already been transplanted one's own database products to on Linux, or has finished Beta edition, among them Oracle and Informix also offer technical support to their products.4.The gratifying one is, some farsighted domestic corporations have begun to try hard to change this kind of current situation already. Stone Co. not long ago is it invest a huge sum of money to claim , regard Linux as platform develop a Internet/Intranet solution, regard this as the core and launch Stone's system integration business , plan to set up nationwide Linux technical support organization at the same time , take the lead to promote the freedom software application and development in China. In addition domestic computer Company , person who win of China , devoted to Linux relevant software and hardware application of system popularize too. Is it to intensification that Linux know , will have more and more enterprises accede to the ranks that Linux will be used with domestic every enterprise to believe, more software will be planted in Linux platform. Meanwhile, the domestic university should regard Linux as the original version and upgrade already existing Unix content of courses , start with analysing the source code and revising the kernel and train a large number of senior Linux talents, improve our country's own operating system. Having only really grasped the operating system, the software industry of our country could be got rid of and aped sedulously at present, the passive state led by the nose by others, create conditions for revitalizing the software industry of our country fundamentally.中文翻译Linux—网络时代的操作系统虽然对许多人来说,以Linux作为主要的操作系统组成庞大的工作站群,完成了《泰坦尼克号》的特技制作,已经算是出尽了风头。
毕业设计(论文)外文文献翻译文献、资料中文题目:深入浅出JavaScript文献、资料英文题目:文献、资料来源:文献、资料发表(出版)日期:院(部):专业:计算机科学与技术班级:姓名:学号:指导教师:翻译日期: 2017.02.14毕业设计(论文)外文资料翻译题目:Beginning JavaScript with DOM Scripting and Ajax学院:信息工程学院系计算机专业:计算机科学与技术班级:学号:姓名:指导教师:起讫日期:外文资料翻译译文深入浅出JavaScript1.1 JavaScript产生的原因在Web发展的初期,主要有HTML和公共管理接口(GUI)。
HTML定义了大部分的文本文档并且只是用户代理(通常为网页浏览器)如何显示。
比如,标签<p></p>之间的文字就会成为一个段落,在这个段落中可以使用标签<h1></h1>来定义最主要的页面标题。
注意大多数开始标签,都会有相应的以</开头的结束标签。
HTML有一个缺点,即他的状态是固定不变的。
如果想改变一些东西或者使用用户输入的数据,就需要向服务器提出一个往返的请求。
使用动态技术(如ColdFusion、ASP、、PHP或JSP)就可以从表单或者参数中将信息发送到服务器然后通过服务器完成计算、测试、数据库查找等。
与这些技术相关联的应用程序服务器则会产生一个HTML文档来显示结果,然后把处理的结果一HTML文档的形式返回到浏览器以供用户查看。
这样做的问题在于无论何时网页只要有变化,以上整个过程都需要再重复执行一遍(并且重新加载网页)。
这样会显得比较笨重缓慢,没有网络这个新媒介对我们承诺的那么美好。
现在,人们已经普遍拥有了快速的因特网连接。
但是显示一个页面仍然意味着重新加载,这是一个时常失败的缓慢过程(遇到过Error 404没有?)。
我们需要更加灵活的东西——要允许Web开发人员快速地对用户给予反馈并且不用从服务器重新加载页面就能改变HTML。
Binomial heapIn computer science, a binomial heap is a heap similar to a binary heap but also supports quick merging of two heaps. This is achieved by using a special tree structure. It is important as an implementation of the mergeable heap abstract data type(also called meldable heap), which is a priority queue supporting merge operation.Binomial treeA binomial heap is implemented as a collection of binomial trees (compare with a binary heap, which has a shape of a single binary tree). A binomial tree is defined recursively:∙ A binomial tree of order 0 is a single node∙ A binomial tree of order k has a root node whose children are roots of binomial trees of orders k−1, k−2, ..., 2, 1, 0 (in this order).Binomial trees of order 0 to 3: Each tree has a root node with subtrees of all lower ordered binomial trees, which have been highlighted. For example, the order 3 binomial tree is connected to an order 2, 1, and 0 (highlighted as blue, green and red respectively) binomial tree.A binomial tree of order k has 2k nodes, height k.Because of its unique structure, a binomial tree of order k can be constructed from two trees of order k−1 trivially by attaching one of them as the leftmost child of root of theother one. This feature is central to the merge operation of a binomial heap, which is its major advantage over other conventional heaps.The name comes from the shape: a binomial tree of order has nodes at depth.Structure of a binomial heapA binomial heap is implemented as a set of binomial trees that satisfy the binomial heap properties:∙Each binomial tree in a heap obeys the minimum-heap property: the key of a node is greater than or equal to the key of its parent.∙There can only be either one or zero binomial trees for each order, including zero order.The first property ensures that the root of each binomial tree contains the smallest key in the tree, which applies to the entire heap.The second property implies that a binomial heap with n nodes consists of at mostlog n + 1 binomial trees. In fact, the number and orders of these trees are uniquely determined by the number of nodes n: each binomial tree corresponds to one digit in the binary representation of number n. For example number 13 is 1101 in binary,, and thus a binomial heap with 13 nodes will consist of three binomial trees of orders 3, 2, and 0 (see figure below).Example of a binomial heap containing 13 nodes with distinct keys.The heap consists of three binomial trees with orders 0, 2, and 3.ImplementationBecause no operation requires random access to the root nodes of the binomial trees, the roots of the binomial trees can be stored in a linked list, ordered by increasing order of the tree.MergeAs mentioned above, the simplest and most important operation is the merging of two binomial trees of the same order within two binomial heaps. Due to the structure of binomial trees, they can be merged trivially. As their root node is the smallest element within the tree, by comparing the two keys, the smaller of them is the minimum key, and becomes the new root node. Then the other tree become a subtree of the combined tree. This operation is basic to the complete merging of two binomial heaps.function mergeTree(p, q)if p.root.key <= q.root.keyreturn p.addSubTree(q)elsereturn q.addSubTree(p)To merge two binomial trees of the same order, first compare the root key. Since 7>3, the black tree on the left(with root node 7) is attached to the grey tree on theright(with root node 3) as a subtree. The result is a tree of order 3.The operation of merging two heaps is perhaps the most interesting and can be used as a subroutine in most other operations. The lists of roots of both heaps are traversed simultaneously, similarly as in the merge algorithmIf only one of the heaps contains a tree of order j, this tree is moved to the merged heap. If both heaps contain a tree of order j, the two trees are merged to one tree of order j+1 so that the minimum-heap property is satisfied. Note that it may later be necessary to merge this tree with some other tree of order j+1 present in one of the heaps. In the course of the algorithm, we need to examine at most three trees of any order (two from the two heaps we merge and one composed of two smaller trees).Because each binomial tree in a binomial heap corresponds to a bit in the binary representation of its size, there is an analogy between the merging of two heaps and the binary addition of the sizes of the two heaps, from right-to-left. Whenever a carry occurs during addition, this corresponds to a merging of two binomial trees during the merge.Each tree has order at most log n and therefore the running time is O(log n).function merge(p, q)while not( p.end() and q.end() )tree = mergeTree(p.currentTree(), q.currentTree())if not heap.currentTree().empty()tree = mergeTree(tree, heap.currentTree())heap.addTree(tree)elseheap.addTree(tree)heap.next() p.next() q.next()This shows the merger of two binomial heaps. This is accomplished by merging two binomial trees of the same order one by one. If the resulting merged tree has the same order as one binomial tree in one of the two heaps, then those two are merged again. InsertInserting a new element to a heap can be done by simply creating a new heap containing only this element and then merging it with the original heap. Due to themerge, insert takes O(log n) time, however it has an amortized time of O(1) (i.e. constant).Find minimumTo find the minimum element of the heap, find the minimum among the roots of the binomial trees. This can again be done easily in O(log n) time, as there are just O(log n) trees and hence roots to examine.By using a pointer to the binomial tree that contains the minimum element, the time for this operation can be reduced to O(1). The pointer must be updated when performing any operation other than Find minimum. This can be done in O(log n) without raising the running time of any operation.Delete minimumTo delete the minimum element from the heap, first find this element, remove it from its binomial tree, and obtain a list of its subtrees. Then transform this list of subtrees into a separate binomial heap by reordering them from smallest to largest order. Then merge this heap with the original heap. Since each tree has at most log n children, creating this new heap is O(log n). Merging heaps is O(log n), so the entire delete minimum operation is O(log n).function deleteMin(heap)min = heap.trees().first()for each current in heap.trees()if current.root < min then min = currentfor each tree in min.subTrees()tmp.addTree(tree)heap.removeTree(min)merge(heap, tmp)Decrease keyAfter decreasing the key of an element, it may become smaller than the key of its parent, violating the minimum-heap property. If this is the case, exchange the element with its parent, and possibly also with its grandparent, and so on, until theminimum-heap property is no longer violated. Each binomial tree has height at most log n, so this takes O(log n) time.DeleteTo delete an element from the heap, decrease its key to negative infinity (that is, some value lower than any element in the heap) and then delete the minimum in the heap.PerformanceAll of the following operations work in O(log n) time on a binomial heap with n elements:∙Insert a new element to the heap∙Find the element with minimum key∙Delete the element with minimum key from the heap∙Decrease key of a given element∙Delete given element from the heap∙Merge two given heaps to one heapFinding the element with minimum key can also be done in O(1) by using an additional pointer to the minimum.二项堆在计算机科学中,二项堆是一个二叉堆类似的堆结构,但是支持两个二项堆快速合并。