科技文献翻译.doc

科技文献翻译 Section A Computer Program (计算机程序)Section B Software Life Cycle (软件生命周期)学生姓名： 彭金辉 学号： 20032430217 专 业： 计算机科学与技术 院（系）： 信息工程学院 完成时间： 2007-5-20 2007 年 6月1日英文原文：Computer Program. IntroductionA computer program is a set of instructions that directs a computer to perform some processing function or combination functions. For the instructions to be carried out, a computer must execute a program, that is, that is the computer reads the program, and then follows the steps encoded in the program in a precise order until completion. A program can be executed many different times, with each execution yielding a potentially different result depending upon the options and data that the user gives the computer.Program fall into two major classes: application program and operating systems. An application program is one that carries out some function directly for a user, such as word processing or game playing. An operating system is a program that manages the computer and the various resources and devices connected to it, such as RAM(random access memory),hard drives, monitors, keyboards, printers, and modems, so that they may be used by other program. Examples of operating systems are DOS, Windows XP, OS/2, and UNIX. .Program Development Software designers create new program by using special applications programs, often called utility programs or development programs. A programmer uses another type of program called a text editor to write the new program in a special notation called programming language. With the text editor, the programmer creates a text file, which is an ordered list of instructions, also called program source file. The individual instructions that make up the source file are called source code. At this point, a special application program translates the source code into machine code language, or object code a format that the operating systems will recognize as a proper program and be able to execute.Three types of application programs translate from source code to object code: compilers, interpreters, and assemblers. The three operate differently and on different types of programming languages, but they serve the same purpose of translating from a programming language into machine language.A compiler translates text files written in a high-level programming language- such as FORTRAN, C, or Pascal from the source code to the object code all at once, This differs from the approach taken by interpreted language such as BASIC, in which a program in translated into object code statement by statement as each instruction is executed. The advantage to interpreted language is that they can begin executing the program immediately instead of having to waiting for all the source code to be compiled. Changes can also be made to the program fairly quickly without having waiting for it to be compiled again. The disadvantage of interpreted language is that they are slow to execute, since the entire program must translated one instruction at a time, each time program is run. On the other hand, compiled language are compiled only once and thus can be executed by the computer much more quickly than interpreted languages, For this reason, compiled languages are more common and almost always used in professional and scientific applications.Another type of translator is the assembler, which is used for programs or parts of programs written in assembly language. Assembly language is another programming language, but it is much more similar to machine language than other type of high-level language. In assembly language, a single statement can usually be translated into a single instruction of machine language. Today, assembly language is rarely used to written entire program, but is instead most often used when the programmer needs to directly control some aspect of the computers function.Programs are often written as a set of smaller pieces, with each piece representing some aspect of the overall application program. After each piece has been compiled separately, a program called linker combines all the translated pieces into a single executable program.Program seldom work correctly the first time, so a program called a debugger is often used to help problems called bugs. Debugger programs usually detect an event in the executing program and point the programmer back to the origin of the event in the program code.Recent programming systems, such as Java, use a combination of approaches to create and execute programs. A compiler takes a Java source program and translates it into an intermediate form. Such intermediate programs are then transferred over the Internet into computers where an interpreter program then executes the intermediate from as an application program. Program ElementsMost programs are built from just a few kings of steps that are repeated many times in different contexts and in different combinations throughout the program. The most common step performs some computation, and then proceeds to the next step in the program, in the order specified by the programmer.Programs often need to repeat a short series of steps many times, for instance in looking through a list of game scores and finding the highest score. Such repetitive sequences of code are called loops.One of the capabilities that make computers so useful is their ability to make conditional decisions and perform different instructions based on the values of data being processed. If-then-else statements implement this function by testing some piece of data and then selecting one of the two sequences of instructions on the basis of the result. One of the instructions in these alternatives may be goto statement that directs the computer to select its next instruction from a different part of the program. For example, a program might compare two numbers and branch to a different part of the program depending on the result of the comparison: If x is greater than y then goto instruction #10 else continuePrograms often use a specific sequence of steps more than once. Such a sequence of steps can be grouped together into subroutine, which can then be called, or accessed, as needed in different parts of the main program. Each time a subroutine is called, the computer remembers where it was in the program when the call was made, so that it can return there upon completion of the subroutine. Preceding each call, a program can specify that different data be used by the subroutine, allowing a very general piece of code to be written once and used in multiple ways.Most programs use several varieties of the subroutine. The most common of these are function, procedure, library routines, system routines, and device drivers. Functions are short subroutines that compute some value, such as computations of angles, which the computer cannot compute with a single basic instruction. Procedures perform a more complex function, such as sorting a set of name. Library routines are subroutines that are written for use by many different programs. System routines are similar to library routines but are actually found in operating system. They provider some service for the application programs, such as printing a line of text. Device drivers are system routines that are added to an operating system to allow the computer to communicate with a new device, such as a canner, modem, or printer. Device drivers often have features that can be executed directly as applications programs. This allows the user to directly control the device, which if useful if, for instance, a color printer needs to be realigned to attain the best printing quality after changing an ink cartridge.IV. Program FunctionModern computers usually store programs on some form of magnetic storage media that can be accessed randomly by the computer, such as the hard drive disk permanently located in the computer, or a portable floppy disk. Additional information on such disks, called directories, indicates the names of the various programs on the disk, when they were written to the disk, and where the program begins on the disk media. When a user directs the computer to execute a particular application program, the operating system looks through these directories, locates the program, and reads a copy into RAM. The operating system then directs the CPU (central processing unit) to start executing the instructions at the beginning of the program. Instructions at the beginning of the program prepare the computer to process information by locating free memory locations in RAM to hold working data, retrieving copies of the standard options and defaults the user has indicated from a disk, and drawing initial displays on the monitor.The application program requests a copy of any information the user enters by making a call to a system routine. The operating system converts any data so entered into a standard internal form. The application then uses this information to decide what to do nextfor example, perform some desired processing function such as reformatting a page of text, or obtain some additional information from another file on a disk. In either case, calls to other system routines are used to actually carry out the display of the results or the accessing of the file from the disk.When the application reaches completion or is prompted to quit, it makes further system calls to make sure that all data that needs to be saved has been written back to disk. It then makes a final system call to the operating system indicating that it is finished. The operating system then frees up the RAM and any devices that the application was using and awaits a command from the user to start another program.V. HistoryPeople have been storing sequences of instructions in the form of a program for several centuries. Music boxes of the 18th century and player pianos of the late 19th and early 20th centuries played musical programs stored as series of metal pins, or holes in paper, with each line (of pins or holes) representing when a note was to be played, and the pin or hole indicating what note was to be played at that time. More elaborate control of physical devices became common in the early 1800s with French inventor Joseph Marie Jacquards invention of the punch-card controlled weaving loom. In the process of weaving a particular pattern, various parts of the loom had to be mechanically positioned. To automate this process, Jacquard used a single paper card to represent each positioning of the loom, with holes in the card to indicate which loom actions should be done. An entire tapestry could be encoded onto a deck of such cards, with the same deck yielding the same tapestry design each time it was used. Programs of over 24,000 cards were developed and used.The worlds first programmable machine was designedalthough never fully builtby the English mathematician and inventor, Charles Babbage. This machine, called the Analytical Engine, used punch cards similar to those used in the Jacquard loom to select the specific arithmetic operation to apply at each step. Inserting a different set of cards changed the computations the machine performed. This machine had counterparts for almost everything found in modern computers, although it was mechanical rather than electrical. Construction of the Analytical Engine was never completed because the technology required to build it did not exist at the time.The first card deck programs for the Analytical Engine were developed by British mathematician Augusta Ada Byron, daughter of the poet Lord Byron1. For this reason she is recognized as the worlds first programmer. The modern concept of an internally stored computer program was first proposed by Hungarian-American mathematician John von Neumann in 1945. Von Neumanns idea was to use the computers memory to store the program as well as the data. In this way, programs can be viewed as data and can be processed like data by other programs. This idea greatly simplifies the role of program storage and execution in computers.VI.The FutureThe field of computer science has grown rapidly since the 1950s due to the increase in their use. Computer programs have undergone many changes during this time in response to user need and advances in technology. Newer ideas in computing such as parallel computing, distributed computing, and artificial intelligence, have radically altered the traditional concepts that once determined program form and function. Computer scientists working in the field of parallel computing, in which multiple CPUs cooperate on the same problem at the same time, have introduced a number of new program models. In parallel computing parts of a problem are worked on simultaneously by different processors, and this speeds up the solution of the problem. Many challenges face scientists and engineers who design programs for parallel processing computers, because of the extreme complexity of the systems and the difficulty involved in making them operate as effectively as possible.Another type of parallel computing called distributed computing uses CPUs from many interconnected computers to solve problems. Often the computers used to process information in a distributed computing application are connected over the Internet. Internet applications are becoming a particularly useful form of distributed computing, especially with programming languages such as Java. In such applications, a user logs on1 to a Web site and downloads a Java program onto their computer. When the Java program is run, it communicates with other programs at its home Web site, and may also communicate with other programs running on different computers or Web sites.Research into artificial intelligence (AI) has led to several other new styles of programming. Logic programs, for example, do not consist of individual instructions for the computer to follow blindly, but instead consist of sets of rules: if x happens then do y. A special program called an inference engine uses these rules to “reason” its way to a conclusion when presented with a new problem. Applications of logic programs include automatic monitoring of complex systems, and proving mathematical theorems.A radically different approach to computing in which there is no program in the conventional sense is called a neural network. A neural network is a group of highly interconnected simple processing elements, designed to mimic the brain. Instead of having a program direct the information processing in the way that a traditional computer does, a neural network processes information depending upon the way that its processing elements are connected. Programming a neural network is accomplished by presenting it with known patterns of input and output data and adjusting the relative importance of the i