Computer Technology and Computer Programming

This is an introduction to the field of efficient parallel algorithms and to the techniques for efficient parallelisation. It is self-contained and presumes no special knowledge of parallel computers or particular mathematics. The book emphasises designing algorithms within the timeless and abstracted context of a high-level programming language rather than within highly specific computer architectures. This is an approach which concentrates on the essence of algorithmic theory, determining and taking advantage of the inherently parallel nature of certain types of problem. The authors present regularly-used techniques and a range of algorithms which includes some of the more celebrated and well-known. Efficient Parallel Algorithms is targeted at non-specialists who are considering entering the field of parallel algorithms. It will be particularly useful for courses aimed at advanced undergraduate or new postgraduate students of computer science and mathematics.

This textbook is an introduction to the design and writing of computer programs. It leads the reader through all the stages of program construction from the original specifications through to the final program. The formal verification of intermediate versions of the program is studied in considerable detail. The authors show how, given the formal specification of a program, data structure and program structure diagrams are drawn and then converted into a procedural program in a program design language (PDL). They demonstrate the conversion of PDL into a variety of real programming languages including Pascal, FORTRAN, COBOL, and Assembler. The book also includes chapters on abstract data types, analysing existing programs, and a small case study. First-year undergraduates in computer science and graduates taking courses in computing will find this a comprehensive introduction to program construction.

This is the ideal companion text for mathematicians and physical scientists using mathematical software packages such as Maple. It provides a user-friendly introduction to computer-assisted algebra and demonstrates the use of this technology for deriving approximate solutions to integrals and differential equations. Over 1000 exercises are incorporated with Internet solutions.

Term rewriting systems developed out of mathematical logic and are an important part of theoretical computer science. They consist of sequences of discrete transformation steps where one term is replaced with another and have applications in many areas, from functional programming to automatic theorem proving and computer algebra. This 2003 book starts at an elementary level with the earlier chapters providing a foundation for the rest of the work. Much of the advanced material appeared here for the first time in book form. Subjects treated include orthogonality, termination, completion, lambda calculus, higher-order rewriting, infinitary rewriting and term graph rewriting. Many exercises are included with selected solutions provided on the web. A comprehensive bibliography makes this book ideal both for teaching and research. A chapter is included presenting applications of term rewriting systems, with many pointers to actual implementations.

What are the principles behind intelligent systems? How are they built? What are intelligent systems useful for? How do we choose the right tool for the job? These questions are answered by Michael Negnevitsky’s Artificial Intelligence: A Guide to Intelligent Systems.Unlike many books on computer intelligence, which use complex computer science terminology and are crowded with complex matrix algebra and differential equations, this text demonstrates that the ideas behind intelligent systems are simple and straightforward. This text assumes little or no programming experience as it tackles topics like expert systems, fuzzy systems, artificial neural networks, evolutionary computation, knowledge engineering, and data mining.TABLE OF CONTENTS1. Introduction to Intelligent Systems 1.1 Intelligent Machines, or What Machines Can Do 1.2 The History of Artificial Intelligence, or From the ‘Dark Ages’ to Knowledge-based Systems 1.3 Generative AI 1.4 Summary Questions fo

As personal computers have become more available, there has been a great deal of optimism for educational reform through wide computer use, both at school and in the home. Beyond Technology's Promise, first published in 1994, takes a hard look at the home computer scene. The research reported in the book focuses on whether families are using computers to help children learn academic skills and, if so, how well they are doing it. The three year, qualitative investigation provides contextual information crucial to our understanding of how computers are really being used. The authors draw the not so surprising conclusion that most children use computers to play games. They therefore propose directions that must be taken in order to facilitate the educational use of home computers or any other promising educational technology. In so doing, they examine such topics as parental leadership, the home-school computer connection, and the role of gender in home computing use.

As personal computers have become more available, there has been a great deal of optimism for educational reform through wide computer use, both at school and in the home. Beyond Technology's Promise, first published in 1994, takes a hard look at the home computer scene. The research reported in the book focuses on whether families are using computers to help children learn academic skills and, if so, how well they are doing it. The three year, qualitative investigation provides contextual information crucial to our understanding of how computers are really being used. The authors draw the not so surprising conclusion that most children use computers to play games. They therefore propose directions that must be taken in order to facilitate the educational use of home computers or any other promising educational technology. In so doing, they examine such topics as parental leadership, the home-school computer connection, and the role of gender in home computing use.

Domain theory is an established part of theoretical computer science, used in giving semantics to programming languages and logics. In mathematics and logic it has also proved to be useful in the study of algorithms. This book is devoted to providing a unified and self-contained treatment of the subject. The theory is presented in a mathematically precise manner which nevertheless is accessible to mathematicians and computer scientists alike. The authors begin with the basic theory including domain equations, various domain representations and universal domains. They then proceed to more specialized topics such as effective and power domains, models of lambda-calculus and so on. In particular, the connections with ultrametric spaces and the Kleene–Kreisel continuous functionals are made precise. Consequently the text will be useful as an introductory textbook (earlier versions have been class-tested in Uppsala, Gothenburg, Passau, Munich and Swansea), or as a general reference for prof

CBC and NSTA's Best STEM Books Pick for 2022Explore artificial intelligence—the programming that teaches computers to be brainy—in this “enjoyable, upbeat series” (Booklist).Did you know that you can teach a robot to play soccer? Or that you can ride in a car driven by a computer? Discover how AI learns and grows, as well as how it identifies objects by recognizing differences and similarities!Ignite your scientific mind with fun facts, activities, and experiments. Try this: Hum “Twinkle, Twinkle Little Star,” “Baa, Baa, Black Sheep,” and the ABCs. Do you notice any similarities? Soon you’ll be thinking just like an AI program!This STEM-driven series helps beginning scientists and engineers grasp big scientific ideas with:Intriguing info to fill and thrill your brain.Hands-on activities to jumpstart your imagination.Great photos to help you get the bigger picture.New ideas sure to change the way you see the world.From Starry Forest Books,STEAM & Me™uses science, technology, enginee

If you've ever spent hours renaming files or updating hundreds of spreadsheet cells, you know how tedious tasks like these can be. But what if you could have your computer do them for you? In this fully revised edition of the best-selling classic Automate the Boring Stuff with Python, you'll learn how to use Python to write programs that do in minutes what would take you hours to do by hand - no prior programming experience required. You'll learn the basics of coding in Python and explore the language's rich library of modules for performing specific tasks, like scraping data from websites, searching for text across multiple files, and merging, watermarking, or encrypting PDFs. The third edition includes: Expanded coverage of developer techniques, like creating command line programs; Updated examples and new projects; Additional chapters about working with SQLite databases, speech-recognition technology, video and audio editing, and text-to-speech capabilities; Simplified explanations

As computerisation in the medical environment has increased, so the advantages of storage and the computer analysis of data from various monitoring and measuring equipment has become well recognised. Most medical monitoring and measurement equipment now supports an RS-232 serial interface, allowing for direct computer access both in terms of data analysis and equipment control. This book describes the techniques used for interfacing a PC to a range of medical equipment used internationally in the areas of anaesthesia, intensive care, surgery, respiratory medicine and physiology. Part One addresses the serial interface, including the RS-232 standard, transmission of data and an introduction to serial-interface programming using Microsoft QuickBASIC. Part Two looks at electrical safety, the use of Kermit and data analysis. Part Three considers the practical aspects of interfacing a PC to a wide range of equipment, and includes example programs for collecting data and in some cases for co

Originally published in 1960, as the second edition of a 1957 original, this textbook is aimed at those without advanced mathematical training and provides a comprehensive introductory account of digital computers, what they are capable of doing and how they are made to do it. It begins with a discussion of programming - the preparation of instructions for the computer. This leads on to a consideration of systems of number storage, from the simple decimal system of desk calculating machines to the varieties of binary storage systems used in modern high-speed computers. The final chapter considers points, which arise in applying computers to engineering calculations, and gives details of some of the problems already solved in this way. Throughout the book the emphasis is on the applications of computers to routine work rather than to advanced research. This book will be of value to students of the history of computer science.

Fortran is one of the oldest high-level languages and remains the premier language for writing code for science and engineering applications. This book is for anyone who uses Fortran, from the novice learner to the advanced expert. It describes best practices for programmers, scientists, engineers, computer scientists and researchers who want to apply good style and incorporate rigorous usage in their own Fortran code or to establish guidelines for a team project. The presentation concentrates primarily on the characteristics of Fortran 2003, while also describing methods in Fortran 90/95 and valuable new features in Fortran 2008. The authors draw on more than a half century of experience writing production Fortran code to present clear succinct guidelines on formatting, naming, documenting, programming and packaging conventions and various programming paradigms such as parallel processing (including OpenMP, MPI and coarrays), OOP, generic programming and C language interoperability.

A First Course in Combinatorial Optimization is a text for a one-semester introductory graduate-level course for students of operations research, mathematics, and computer science. It is a self-contained treatment of the subject, requiring only some mathematical maturity. Topics include: linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Central to the exposition is the polyhedral viewpoint, which is the key principle underlying the successful integer-programming approach to combinatorial-optimization problems. Another key unifying topic is matroids. The author does not dwell on data structures and implementation details, preferring to focus on the key mathematical ideas that lead to useful models and algorithms. Problems and exercises are included throughout as well as references for further study.

A First Course in Combinatorial Optimization is a text for a one-semester introductory graduate-level course for students of operations research, mathematics, and computer science. It is a self-contained treatment of the subject, requiring only some mathematical maturity. Topics include: linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Central to the exposition is the polyhedral viewpoint, which is the key principle underlying the successful integer-programming approach to combinatorial-optimization problems. Another key unifying topic is matroids. The author does not dwell on data structures and implementation details, preferring to focus on the key mathematical ideas that lead to useful models and algorithms. Problems and exercises are included throughout as well as references for further study.

Is art created with computers really art? This book answers 'yes.' Computers can generate visual art with unique aesthetic effects based on innovations in computer technology and a Postmodern naturalization of technology wherein technology becomes something we live in as well as use. The present study establishes these claims by looking at digital art's historical emergence from the 1960s to the start of the present century. Paul Crowther, using a philosophical approach to art history, considers the first steps towards digital graphics, their development in terms of three-dimensional abstraction and figuration, and then the complexities of their interactive formats.

Information technology has become a constant presence in contemporary life, infiltrating community, business and state affairs. This book discusses the uses and problems of IT in both developing and advanced countries, focusing on the ways in which IT changes society without neglecting the problematic aspects of the Internet revolution such as computer crime and the lack of professionals with computer literacy, particularly from a developing country's perspective. It examines such issues as the characteristics of network economies, connectivity pricing, Internet access, regulation, changes in supply chains, IT gaps between supply and demand, productivity increases, and the digital divide. Emanuele Giovannetti, Mitsuhiro Kagami and Masatsugu Tsuji have gathered together a group of international experts in economics and trade who discuss the impact of this revolution globally, looking at countries or regions including the UK, EU, Central and Eastern Europe, USA, Japan, India, South Afric

Information technology has become a constant presence in contemporary life, infiltrating community, business and state affairs. This book discusses the uses and problems of IT in both developing and advanced countries, focusing on the ways in which IT changes society without neglecting the problematic aspects of the Internet revolution such as computer crime and the lack of professionals with computer literacy, particularly from a developing country's perspective. It examines such issues as the characteristics of network economies, connectivity pricing, Internet access, regulation, changes in supply chains, IT gaps between supply and demand, productivity increases, and the digital divide. Emanuele Giovannetti, Mitsuhiro Kagami and Masatsugu Tsuji have gathered together a group of international experts in economics and trade who discuss the impact of this revolution globally, looking at countries or regions including the UK, EU, Central and Eastern Europe, USA, Japan, India, South Afric

Using real-life applications, this graduate-level textbook introduces different mathematical methods of scientific computation to solve minimization problems using examples ranging from locating an aircraft, finding the best time to replace a computer, analyzing developments on the stock market, and constructing phylogenetic trees. The textbook focuses on several methods, including nonlinear least squares with confidence analysis, singular value decomposition, best basis, dynamic programming, linear programming, and various optimization procedures. Each chapter solves several realistic problems, introducing the modelling optimization techniques and simulation as required. This allows readers to see how the methods are put to use, making it easier to grasp the basic ideas. There are also worked examples, practical notes, and background materials to help the reader understand the topics covered. Interactive exercises are available at www.cambridge.org/9780521849890.

Text-to-Speech Synthesis provides a complete, end-to-end account of the process of generating speech by computer. Giving an in-depth explanation of all aspects of current speech synthesis technology, it assumes no specialised prior knowledge. Introductory chapters on linguistics, phonetics, signal processing and speech signals lay the foundation, with subsequent material explaining how this knowledge is put to use in building practical systems that generate speech. Including coverage of the very latest techniques such as unit selection, hidden Markov model synthesis, and statistical text analysis, explanations of the more traditional techniques such as format synthesis and synthesis by rule are also provided. Weaving together the various strands of this multidisciplinary field, the book is designed for graduate students in electrical engineering, computer science, and linguistics. It is also an ideal reference for practitioners in the fields of human communication interaction and telep

Discrete optimization problems are everywhere, from traditional operations research planning (scheduling, facility location and network design); to computer science databases; to advertising issues in viral marketing. Yet most such problems are NP-hard; unless P = NP, there are no efficient algorithms to find optimal solutions. This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. The book is organized around central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization. Each chapter in the first section is devoted to a single algorithmic technique applied to several different problems, with more sophisticated treatment in the second section. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithm courses

This collection of articles by well-known experts was originally published in 2000 and is intended for researchers in computer science, practitioners of formal methods, and computer programmers working in safety-critical applications or in the technology of component-based systems. The work brings together several elements of this area that were fast becoming the focus of much research and practice in computing. The introduction by Clemens Szyperski gives a snapshot of research in the field. About half the articles deal with theoretical frameworks, models, and systems of notation; the rest of the book concentrates on case studies by researchers who have built prototype systems and present findings on architectures verification. The emphasis is on advances in the technological infrastructure of component-based systems; how to design and specify reusable components; and how to reason about, verify, and validate systems from components. Thus the book shows how theory might move into pract

This collection of articles by well-known experts was originally published in 2000 and is intended for researchers in computer science, practitioners of formal methods, and computer programmers working in safety-critical applications or in the technology of component-based systems. The work brings together several elements of this area that were fast becoming the focus of much research and practice in computing. The introduction by Clemens Szyperski gives a snapshot of research in the field. About half the articles deal with theoretical frameworks, models, and systems of notation; the rest of the book concentrates on case studies by researchers who have built prototype systems and present findings on architectures verification. The emphasis is on advances in the technological infrastructure of component-based systems; how to design and specify reusable components; and how to reason about, verify, and validate systems from components. Thus the book shows how theory might move into pract

The Second International Congress of Applied Linguistics, held in Cambridge (8–12 September 1969), provided papers from all over the world to different subjects within the linguistic family. These are: linguistics applied to literary texts, computer analysis of texts, psychology of first and second language learning, speech research, technology of language learning, language teaching and test material and methodology, lexicography, theory of translation, contrastive linguistics, and sociolinguistics. This book is a fascinating and useful work of reference for all concerned with applied linguistics.

Human factors is one of the critical issues in Information Technology, as industry realizes the need to change from technology-oriented goals to meet the demands of computer users. Human factors can help to improve Informatics Usability for real people, and to reduce the huge people-costs of human machine interactions. This book has been developed from lectures given at an Advanced Study course, sponsored by the European Science and Technology Research Committee of the Commission of the European Communities (CREST), and by the Science and Engineering Research Council (SERC) of the UK. It has three objectives: 1. To review the knowledge and methods available from the field of human factors for improving the usability of informatics systems; 2. To describe recent theoretical and methodological developments in the area; 3. To stimulate increased application of this expertise.

Human factors is one of the critical issues in Information Technology, as industry realizes the need to change from technology-oriented goals to meet the demands of computer users. Human factors can help to improve Informatics Usability for real people, and to reduce the huge people-costs of human machine interactions. This book has been developed from lectures given at an Advanced Study course, sponsored by the European Science and Technology Research Committee of the Commission of the European Communities (CREST), and by the Science and Engineering Research Council (SERC) of the UK. It has three objectives: 1. To review the knowledge and methods available from the field of human factors for improving the usability of informatics systems; 2. To describe recent theoretical and methodological developments in the area; 3. To stimulate increased application of this expertise.

This is an up-to-date and integrated introduction to model theory, designed to be used for graduate courses (for students who are familiar with first-order logic), and as a reference for more experienced logicians and mathematicians. Model theory is concerned with the notions of definition, interpretation and structure in a very general setting, and is applied to a wide variety of other areas such as set theory, geometry, algebra (in particular group theory), and computer science (e.g. logic programming and specification). Professor Hodges emphasises definability and methods of construction, and introduces the reader to advanced topics such as stability. He also provides the reader with much historical information and a full bibliography, enhancing the book's use as a reference.

This is an up-to-date and integrated introduction to model theory, designed to be used for graduate courses (for students who are familiar with first-order logic), and as a reference for more experienced logicians and mathematicians. Model theory is concerned with the notions of definition, interpretation and structure in a very general setting, and is applied to a wide variety of other areas such as set theory, geometry, algebra (in particular group theory), and computer science (e.g. logic programming and specification). Professor Hodges emphasises definability and methods of construction, and introduces the reader to advanced topics such as stability. He also provides the reader with much historical information and a full bibliography, enhancing the book's use as a reference.

This book gives applications of the theory of process algebra, or Algebra of Communicating Processes (ACP), that is the study of concurrent or communicating processes studied using an algebraic framework. The approach is axiomatic; the authors consider structures that are some set of mostly equational axioms, which are equipped with several operators. Thus the term 'algebra' is used in the model-theoretic sense. The axiomatic approach enables one to organize the field of process theories. The theory is applied systematically to a number of situations, including systolic algorithms, semantics of an object-oriented language, and protocols. It will be welcomed by computer scientists working in parallel programming.

This is a textbook on graph theory, especially suitable for computer scientists but also suitable for mathematicians with an interest in computational complexity. Although it introduces most of the classical concepts of pure and applied graph theory (spanning trees, connectivity, genus, colourability, flows in networks, matchings and traversals) and covers many of the major classical theorems, the emphasis is on algorithms and thier complexity: which graph problems have known efficient solutions and which are intractable. For the intractable problems a number of efficient approximation algorithms are included with known performance bounds. Informal use is made of a PASCAL-like programming language to describe the algorithms. A number of exercises and outlines of solutions are included to extend and motivate the material of the text.

Written in a tutorial style, this comprehensive guide follows a structured approach explaining cloud techniques, models and platforms. Popular cloud services such as Amazon, Google and Microsoft Azure are explained in the text. The security risks and challenges of cloud computing are discussed in detail with useful examples. Emerging trends including mobile cloud computing and internet of things are discussed in the book for the benefit of the readers. Numerous review questions, multiple choice exercises and case studies facilitate enhanced understanding. This textbook is ideal for undergraduate and graduate students of computer science engineering, and information technology.

An illustrated guide to exploring the Universe in three dimensions.Astronomers have made remarkable discoveries about our Universe, despite their reliance on the flat projection, or 2D view, the sky has offered them. But now, drawing on the vast stores of data available from telescopes and observatories on the ground and in space, astronomers are using 3D technology to go beyond a flattened view of the cosmos. In Stars in Your Hand, Kimberly Arcand and Megan Watzke offer an illustrated guide to exploring the Universe in three dimensions, with easy-to-follow instructions for creating models of stars and constellations using a 3D printer and 3D computer imaging. Stars in Your Hand and 3D technology make learning about space an adventure. Intrigued by the stunning images from high-powered telescopes? Using this book, you can fly virtually through a 3D spacescape and hold models of cosmic objects in your hand. Arcand and Watzke outline advances in 3D technology, describe some amazing recen

This book is an up-to-date introduction to the quantum theory of measurement, a fast developing field of intense current interest to scientists and engineers for its potential high technology applications. It is also a subject of importance to students for its central role in the foundations of quantum mechanics. Although the main principles of the field were elaborated in the 1930s by Bohr, Schrödinger, Heisenberg, von Neumann and Mandelstam, it was not until the 1980s that technology became sufficiently advanced to allow its application in real experiments. Quantum measurement is now central to many ultra-high technology developments, such as squeezed light, single atom traps, and searches for gravitational radiation. It is also considered to have great promise for computer science and engineering, particularly for its applications in information processing and transfer. The book contains a pedagogical introduction to the relevant theory written at a level accessible to those with on

This book is an up-to-date introduction to the quantum theory of measurement, a fast developing field of intense current interest to scientists and engineers for its potential high technology applications. It is also a subject of importance to students for its central role in the foundations of quantum mechanics. Although the main principles of the field were elaborated in the 1930s by Bohr, Schrödinger, Heisenberg, von Neumann and Mandelstam, it was not until the 1980s that technology became sufficiently advanced to allow its application in real experiments. Quantum measurement is now central to many ultra-high technology developments, such as squeezed light, single atom traps, and searches for gravitational radiation. It is also considered to have great promise for computer science and engineering, particularly for its applications in information processing and transfer. The book contains a pedagogical introduction to the relevant theory written at a level accessible to those with on

A systematic program design method can help developers ensure the correctness and performance of programs while minimizing the development cost. This book describes a method that starts with a clear specification of a computation and derives an efficient implementation by step-wise program analysis and transformations. The method applies to problems specified in imperative, database, functional, logic and object-oriented programming languages with different data, control and module abstractions. Designed for courses or self-study, this book includes numerous exercises and examples that require minimal computer science background, making it accessible to novices. Experienced practitioners and researchers will appreciate the detailed examples in a wide range of application areas including hardware design, image processing, access control, query optimization and program analysis. The last section of the book points out directions for future studies.

A systematic program design method can help developers ensure the correctness and performance of programs while minimizing the development cost. This book describes a method that starts with a clear specification of a computation and derives an efficient implementation by step-wise program analysis and transformations. The method applies to problems specified in imperative, database, functional, logic and object-oriented programming languages with different data, control and module abstractions. Designed for courses or self-study, this book includes numerous exercises and examples that require minimal computer science background, making it accessible to novices. Experienced practitioners and researchers will appreciate the detailed examples in a wide range of application areas including hardware design, image processing, access control, query optimization and program analysis. The last section of the book points out directions for future studies.

The study of computational processes based on the laws of quantum mechanics has led to the discovery of new algorithms, cryptographic techniques, and communication primitives. This book explores quantum computation from the perspective of the branch of theoretical computer science known as semantics, as an alternative to the more well-known studies of algorithmics, complexity theory, and information theory. It collects chapters from leading researchers in the field, discussing the theory of quantum programming languages, logics and tools for reasoning about quantum systems, and novel approaches to the foundations of quantum mechanics. This book is suitable for graduate students and researchers in quantum information and computation, as well as those in semantics, who want to learn about a new field arising from the application of semantic techniques to quantum information and computation.

This book was first published in 1970. It addresses the increasing use of digital computers for equilibrium calculations in high temperature, high pressure processes, in rocketry and in explosives technology. It surveys the numerical techniques developed over the fifteen to twenty years preceding its publication. The authors derive the equations describing equilibria in different types of system and outline the effect of variation of the parameters of the system on the equilibrium composition. They discuss critically the available methods of solution of the chemical equilibrium problem, both in the minimization and non-linear equations form, and indicate the factors that should be taken into account in selecting the optimum method of solution for a particular problem and computer. The fundamental chemical and thermodynamic analytic material was selected so as to make the book fully accessible for students of chemical engineering, explosives and technology.

Python is today's fastest growing programming language. This engaging and refreshingly different guide breaks down the skills into clear step-by-step chunks and explains the theory using brief easy-to-understand language. Rather than bamboozling readers with pages of mind-numbing technical jargon, this book includes 150 practical challenges, putting the power in the reader's hands. Through creating programs to solve these challenges the reader will quickly progress from mastering the basics to confidently using subroutines, a graphical user interface, and linking to external text, csv and SQL files. This book is perfect for anyone who wants to learn how to program with Python. In particular, students starting out in computer science and teachers who want to improve their confidence in Python will find here a set of ready-made challenges for classroom use.

Reactive flows encompass a broad range of physical phenomena, interacting over many different time and space scales. Such flows occur in combustion, chemical lasers, the earth's oceans and atmosphere, and stars and interstellar space. Despite the obvious physical differences in these flows, there is a striking similarity in the forms of their descriptive equations. Thus, the considerations and procedures for constructing numerical models of these systems are also similar, and these similarities can be exploited. Moreover, using the latest technology, what were once difficult and expensive computations can now be done on desktop computers. This book takes account of the explosive growth in computer technology and the greatly increased capacity for solving complex reactive flow problems that have occurred since the first edition of Numerical Simulation of Reactive Flow was published in 1987. It presents algorithms useful for reactive flow simulations, describes trade-offs involved in the