Javascript Programming

A central problem in the design of programming systems is to provide methods for verifying that computer code performs to specification. This book presents a rigorous foundation for defining Boolean categories, in which the relationship between specification and behaviour can be explored. Boolean categories provide a rich interface between program constructs and techniques familiar from algebra, for instance matrix- or ideal-theoretic methods. The book's distinction is that the approach relies on only a single program construct (the first-order theory of categories), the others being derived mathematically from four axioms. Development of these axioms (which are obeyed by an abundance of program paradigms) yields Boolean algebras of 'predicates', loop-free constructs, and a calculus of partial and total correctness which is shown to be the standard one of Hoare, Dijkstra, Pratt, and Kozen. The book is based in part on courses taught by the author, and will appeal to graduate students a

Linear logic is a branch of proof theory which provides refined tools for the study of the computational aspects of proofs. These tools include a duality-based categorical semantics, an intrinsic graphical representation of proofs, the introduction of well-behaved non-commutative logical connectives, and the concepts of polarity and focalisation. These various aspects are illustrated here through introductory tutorials as well as more specialised contributions, with a particular emphasis on applications to computer science: denotational semantics, lambda-calculus, logic programming and concurrency theory. The volume is rounded-off by two invited contributions on new topics rooted in recent developments of linear logic. The book derives from a summer school that was the climax of the EU Training and Mobility of Researchers project 'Linear Logic in Computer Science'. It is an excellent introduction to some of the most active research topics in the area.

Recent years have seen the development of powerful tools for verifying hardware and software systems, as companies worldwide realise the need for improved means of validating their products. There is increasing demand for training in basic methods in formal reasoning so that students can gain proficiency in logic-based verification methods. The second edition of this successful textbook addresses both those requirements, by continuing to provide a clear introduction to formal reasoning which is both relevant to the needs of modern computer science and rigorous enough for practical application. Improvements to the first edition have been made throughout, with extra and expanded sections on SAT solvers, existential/universal second-order logic, micro-models, programming by contract and total correctness. The coverage of model-checking has been substantially updated. Further exercises have been added. Internet support for the book includes worked solutions for all exercises for teachers,

The essays in this collection cover the whole range of Irish drama from the late nineteenth-century melodramas which anticipated the rise of the Abbey Theatre to the contemporary Dublin of theatre festivals. A team of international experts from Ireland, the UK, the USA and Europe provide individual studies of internationally known playwrights of the period of the Literary Revival - Yeats, Synge, Lady Gregory, Shaw, Wilde, O'Casey - and contemporary playwrights Brian Friel, Tom Murphy, Frank McGuiness and Sebastian Barry, in addition to emerging playwrights such as Martin McDonagh and Marina Carr. Further to studies of individual playwrights the collection also includes examination of the relationship between the theatre and its political context as this is inflected through its ideology, staging and programming. With a full chronology and bibliography, this collection is an indispensable introduction to one of the world's most vibrant theatre cultures.

本書對Brain W. Kernighan和Dennis M. Ritchie所著的《The C Programming Language》（第2版）的所有練習題都進行了解答。K&R的原著是C語言方面的經典教材，而這本與之配套的習題解答將幫助您更加深入地理解 C語言并掌握良好的C語言編程技能。本書有關練習題都是用K&R原著中當時已經介紹過的語言結構來解答的，對每道練習題的答案要點都給予了清晰的解釋

This book discusses recent research in the theoretical foundations of several subjects of importance for the design of hardware, and for computer science in general. The physical technologies of very large scale integration (VLSI) are having major effects on the electronic industry. The potential diversity and complexity of digital systems have begun a revolution in the technologies of digital design, involving the application of concepts and methods to do with algorithms and programming. In return, the problems of VLSI design have led to new subjects becoming of importance in computer science. Topics covered in this volume include: models of VLSI complexity; complexity theory; systolic algorithm design; specification theory; verification theory; design by stepwise refinement and transformations. A thorough literature survey with an exhaustive bibliography is also included. The book has grown from a workshop held at the Centre for Theoretical Computer Science at Leeds University and or

In this wide-ranging inside view of the history and practice of conducting, analysis and advice comes directly from working conductors, including Sir Charles Mackerras on opera, Bramwell Tovey on being an Artistic Director, Martyn Brabbins on modern music, Leon Botstein on programming and Vance George on choral conducting, and from those who work closely with conductors: a leading violinist describes working as a soloist with Stokowski, Ormandy and Barbirolli, while Solti and Abbado's studio producer explains orchestral recording, and one of the world's most powerful managers tells all. The book includes advice on how to conduct different types of groups (choral, opera, symphony, early music) and provides a substantial history of conducting as a study of national traditions. It is an unusually honest book about a secretive industry and managers, artistic directors, soloists, players and conductors openly discuss their different perspectives for the first time.

This book describes the use of qualified types to provide a general framework for the combination of polymorphism and overloading. For example, qualified types can be viewed as a generalization of type classes in the functional language Haskell and the theorem prover Isabelle. These in turn are extensions of equality types in Standard ML. Other applications of qualified types include extensible records and subtyping. Using a general formulation of qualified types, the author extends the Damas/Milner type inference algorithm to support qualified types, which in turn specifies the set of all possible types for any term. In addition, he describes a new technique for establishing suitable coherence conditions that guarantee the same semantics for all possible translations of a given term. Practical issues that arise in concrete implementations are also discussed, concentrating in particular on the implementation of overloading in Haskell and Gofer, a small functional programming system dev

Mobile systems, whose components communicate and change their structure, now pervade the informational world and the wider world of which it is a part. The science of mobile systems is as yet immature, however. This book presents the pi-calculus, a theory of mobile systems. The pi-calculus provides a conceptual framework for understanding mobility, and mathematical tools for expressing systems and reasoning about their behaviours. The book serves both as a reference for the theory and as an extended demonstration of how to use pi-calculus to describe systems and analyse their properties. It covers the basic theory of pi-calculus, typed pi-calculi, higher-order processes, the relationship between pi-calculus and lambda-calculus, and applications of pi-calculus to object-oriented design and programming. The book is written at the graduate level, assuming no prior acquaintance with the subject, and is intended for computer scientists interested in mobile systems.

本書避免DSP程式設計之艱澀處，理論與程式設計並重，以加深讀者對其相互關係之了解。以TI為基礎，淺顯地解說數位信號處理之基礎，使讀者不但可愉快地學習數位信號處理，更能樂在其中。內容包含有：數位信號處理程式之基礎，FIR濾波器的DSP programming、IIR濾波器之DSP程式設計等。對於初次要嘗試數位信號處理的讀者，特別加強其知識，使能輕鬆學習DSP程式設計；適合對數位信號處理程式有興趣的人

最具權威的暢銷書作者理查．史帝文斯在本書中，將他對Unix的專業及寶貴的經驗貢獻給所有的讀者。作者介紹了200多個系統呼叫(System calls)與弁遄A並且提供精彩的範例，以期讀者能從他智慧的結晶中，吸取優於其他書籍的知識。本書以範例為基礎，由開發簡單的Shell程式為起點，一路以理論的講解及示範貫穿全書，不論您是Unix系統的程式設計人員，或是想進一步瞭解Unix系統的進階技術，都不能錯過

Numerical algorithms, modern programming techniques, and parallel computing are often taught serially across different courses and different textbooks. The need to integrate concepts and tools usually comes only in employment or in research - after the courses are concluded - forcing the student to synthesise what is perceived to be three independent subfields into one. This book provides a seamless approach to stimulate the student simultaneously through the eyes of multiple disciplines, leading to enhanced understanding of scientific computing as a whole. The book includes both basic as well as advanced topics and places equal emphasis on the discretization of partial differential equations and on solvers. Some of the advanced topics include wavelets, high-order methods, non-symmetric systems, and parallelization of sparse systems. The material covered is suited to students from engineering, computer science, physics and mathematics.

Information content and programming semantics are just two of the applications of the mathematical concepts of order, continuity and domains. The authors develop the mathematical foundations of partially ordered sets with completeness properties of various degrees, in particular directed complete ordered sets and complete lattices. Uniquely, they focus on partially ordered sets that have an extra order relation, modelling the notion that one element 'finitely approximates' another, something closely related to intrinsic topologies linking order and topology. Extensive use is made of topological ideas, both by defining useful topologies on the structures themselves and by developing close connections with numerous aspects of topology. The theory so developed not only has applications to computer science but also within mathematics to such areas as analysis, the spectral theory of algebras and the theory of computability. This authoritative, comprehensive account of the subject will be e

This book introduces a new, unique, and far-reaching industry technology, Business Service Orchestration (BSO). BSO encompasses the art of orchestrating the interactions between business services. These business services may represent internal business processes of organizations. Integration of many of these internal legacy, custom and COTS applications may, in turn, create these services. This book focuses on the importance of orchestration and how it enables IT professionals to develop and design highly effective and efficient business systems of the future. The book is divided into three major sections. Section I provides a detailed overview of business services and their orchestration and describes an in-depth architecture necessary to provide a web of business services, and orchestration of their interactions, including a methodology for modeling the BSO. Section II focuses on technologies necessary to orchestrate business services, ranging from component models to programming lan

This book explains the financial appraisal of capital budgeting projects. The coverage extends from the development of basic concepts, principles and techniques to the application of them in increasingly complex and real-world situations. Identification and estimation (including forecasting) of cash flows, project appraisal formulae, and the application of net present value (NPV), internal rate of return (IRR) and other project evaluation criteria are illustrated with a variety of calculation examples. Risk analysis is extensively covered by the use of risk adjusted discount rate, certainty equivalent, sensitivity, simulation and Monte Carlo analysis. The NPV and IRR models are further applied to forestry, property and international investments. Resource constraints are introduced to the capital budgeting decisions with a variety of worked examples using linear programming technique. All calculations are extensively supported by Excel workbooks on the Web, and each chapter is well revi

This book explains the financial appraisal of capital budgeting projects. The coverage extends from the development of basic concepts, principles and techniques to the application of them in increasingly complex and real-world situations. Identification and estimation (including forecasting) of cash flows, project appraisal formulae, and the application of net present value (NPV), internal rate of return (IRR) and other project evaluation criteria are illustrated with a variety of calculation examples. Risk analysis is extensively covered by the use of risk adjusted discount rate, certainty equivalent, sensitivity, simulation and Monte Carlo analysis. The NPV and IRR models are further applied to forestry, property and international investments. Resource constraints are introduced to the capital budgeting decisions with a variety of worked examples using linear programming technique. All calculations are extensively supported by Excel workbooks on the Web, and each chapter is well revi

The discrepancy method is the glue that binds randomness and complexity. It is the bridge between randomized computation and discrepancy theory, the area of mathematics concerned with irregularities in distributions. The discrepancy method has played a major role in complexity theory; in particular, it has caused a mini-revolution of sorts in computational geometry. This book tells the story of the discrepancy method in a few short independent vignettes. It is a varied tale which includes such topics as communication complexity, pseudo-randomness, rapidly mixing Markov chains, points on the sphere and modular forms, derandomization, convex hulls, Voronoi diagrams, linear programming and extensions, geometric sampling, VC-dimension theory, minimum spanning trees, linear circuit complexity, and multidimensional searching. The mathematical treatment is thorough and self-contained. In particular, background material in discrepancy theory is supplied as needed. Thus the book should appeal t

This was the first cross-over book into the history of science written by an historian of economics. It shows how 'history of technology' can be integrated with the history of economic ideas. The analysis combines Cold War history with the history of postwar economics in America and later elsewhere, revealing that the Pax Americana had much to do with abstruse and formal doctrines such as linear programming and game theory. It links the literature on 'cyborg' to economics, an element missing in literature to date. The treatment further calls into question the idea that economics has been immune to postmodern currents, arguing that neoclassical economics has participated in the deconstruction of the integral 'self'. Finally, it argues for an alliance of computational and institutional themes, and challenges the widespread impression that there is nothing else besides American neoclassical economic theory left standing after the demise of Marxism.

This was the first cross-over book into the history of science written by an historian of economics. It shows how 'history of technology' can be integrated with the history of economic ideas. The analysis combines Cold War history with the history of postwar economics in America and later elsewhere, revealing that the Pax Americana had much to do with abstruse and formal doctrines such as linear programming and game theory. It links the literature on 'cyborg' to economics, an element missing in literature to date. The treatment further calls into question the idea that economics has been immune to postmodern currents, arguing that neoclassical economics has participated in the deconstruction of the integral 'self'. Finally, it argues for an alliance of computational and institutional themes, and challenges the widespread impression that there is nothing else besides American neoclassical economic theory left standing after the demise of Marxism.

Hardcore JFC is a comprehensive guide to the functionality and practical use of the Java Foundations Classes (JFC), a component library designed for the Java programming language and operating environment. It presents intermediate and advanced techniques in exploiting the power and flexibility of JFC and the Swing component set. The book describes the inner workings of Swing and how its design principles can be used to add tremendous value to Java applications. The important features of JFC components are investigated thoroughly with a focus on the comprehension of fundamentals and the pragmatic application of advanced techniques. Included are concrete illustrations of how to enhance the JFC architecture: leveraging the 'Model/View/Controller' paradigm, customizing and developing new components and techniques for creating 'look and feel' user interface classes. Explanations of design and development techniques are introduced through effective, well-constructed and reusable example code

將 Java 與資料庫作一個強而有力的結合；如此一來，Java 便可在物件中處理多數資料庫所做不到的事。本書描述如何對關聯式資料庫建立一個可移植 OO-based 的 Java 標準介面，並且提供一個健全的模組，以撰寫易於維護的應用程式。書中 也介紹了 JDBC 套件，以及如何使用它們來發展三階應用程式（應用程式可分為：使用者介面、物件導向邏輯元件、和資料儲存）。為了那些第一次處理資料庫的設計師，

This introduction to the basic ideas of structural proof theory contains a thorough discussion and comparison of various types of formalization of first-order logic. Examples are given of several areas of application, namely: the metamathematics of pure first-order logic (intuitionistic as well as classical); the theory of logic programming; category theory; modal logic; linear logic; first-order arithmetic and second-order logic. In each case the aim is to illustrate the methods in relatively simple situations and then apply them elsewhere in much more complex settings. There are numerous exercises throughout the text. In general, the only prerequisite is a standard course in first-order logic, making the book ideal for graduate students and beginning researchers in mathematical logic, theoretical computer science and artificial intelligence. For the new edition, many sections have been rewritten to improve clarity, new sections have been added on cut elimination, and solutions to sel

The discrepancy method is the glue that binds randomness and complexity. It is the bridge between randomized computation and discrepancy theory, the area of mathematics concerned with irregularities in distributions. The discrepancy method has played a major role in complexity theory; in particular, it has caused a mini-revolution of sorts in computational geometry. This book tells the story of the discrepancy method in a few short independent vignettes. It is a varied tale which includes such topics as communication complexity, pseudo-randomness, rapidly mixing Markov chains, points on the sphere and modular forms, derandomization, convex hulls, Voronoi diagrams, linear programming and extensions, geometric sampling, VC-dimension theory, minimum spanning trees, linear circuit complexity, and multidimensional searching. The mathematical treatment is thorough and self-contained. In particular, background material in discrepancy theory is supplied as needed. Thus the book should appeal t

The pi-calculus differs from other models of communicating behaviour mainly in its treatment of mobility. The movement of a piece of data inside a computer program is treated exactly the same as the transfer of a message - or indeed an entire computer program - across the internet. One can also describe networks which reconfigure themselves. The calculus is very simple but powerful; its most prominent ingredient is the notion of a name. Its theory has two important ingredients: the concept of behavioural (or observational) equivalence, and the use of a new theory of types to classify patterns of interactive behaviour. The internet, and its communication protocols, fall within the scope of the theory just as much as computer programs, data structures, algorithms and programming languages. This book is the first textbook on the subject; it has been long-awaited by professionals and will be welcomed by them, and their students.

The pi-calculus differs from other models of communicating behaviour mainly in its treatment of mobility. The movement of a piece of data inside a computer program is treated exactly the same as the transfer of a message - or indeed an entire computer program - across the internet. One can also describe networks which reconfigure themselves. The calculus is very simple but powerful; its most prominent ingredient is the notion of a name. Its theory has two important ingredients: the concept of behavioural (or observational) equivalence, and the use of a new theory of types to classify patterns of interactive behaviour. The internet, and its communication protocols, fall within the scope of the theory just as much as computer programs, data structures, algorithms and programming languages. This book is the first textbook on the subject; it has been long-awaited by professionals and will be welcomed by them, and their students.

Engineers face numerous uncertainties in the design and development of products and processes. To deal with the uncertainties inherent in measured information, they make use of a variety of statistical techniques. This 1999 book presents single-variable statistical distributions that are useful in engineering design and analysis. It lists significant properties of these distributions and describes methods for estimating parameters and their standard errors, constructing confidence intervals, testing hypotheses, and plotting data. Figures are used extensively to clarify concepts. Methods are illustrated by numerous fully worked examples in the form of Mathcad documents that readers can use as templates for their own data, eliminating the need for programming. Intended as both a text and reference, the book assumes an elementary knowledge of calculus and probability. Graduate and advanced undergraduate students, as well as practising engineers and scientists, will be able to use this bo

All traditional implementation techniques for functional languages (mostly based on supercombinators, environments or continuations) fail to avoid useless repetition of work; they are not 'optimal' in their implementation of sharing, often causing a catastrophic, exponential explosion in reduction time. Optimal reduction is an innovative graph reduction technique for functional expressions, introduced by Lamping in 1990, that solves the sharing problem. This book, the first in the subject, is a comprehensive account by two of its leading exponents. Practical implementation aspects are fully covered as are the mathematical underpinnings of the subject. The relationship to the pioneering work of Lévy and to Girard's more recent Geometry of Interaction are explored; optimal reduction is thereby revealed as a prime example of how a beautiful mathematical theory can lead to practical benefit. The book is essentially self-contained, requiring no more than basic familiarity with functional la

在商業軟體充斥的市場中，免費軟體的實現已經不是一個概念，從作業系統到遊戲程式，免費軟體的散佈造福了無數的使用者；某些免費軟體的功能並不遜於同類的商業軟體， 甚至成為廠商模仿的對象。本書敘述的是其中最具代表性的自由軟體，它展現了相當完整的程式開發環境，甚至提供其它廠商缺乏的技術支援。 不論你是否使用 UNIX 作業系統，自由軟體基金會（Free Software Foundation）所開發的

Most object-oriented or functional languages are higher order languages, i.e. ones in which the means of manipulation (e.g. object or function) can itself be manipulated. This 1998 book contains a collection of original articles about recent developments in operational semantics for higher order programming languages by some of the leading researchers in the field. Operational techniques are important because they are closer to implementations and language definitions than more abstract mathematical techniques such as denotational semantics. One of the exciting developments reflected by the book is that mathematical structures and techniques used in denotational semantics (such as fixpoint induction) may be recovered from a purely operational starting point. The book surveys and introduces techniques such as contextual equivalence, applicative bisimulation, logical relations, improvement relations, explicit models of memory management, and labelling techniques for confluence properties

This book, first published in 1996, introduces students to optimization theory and its use in economics and allied disciplines. The first of its three parts examines the existence of solutions to optimization problems in Rn, and how these solutions may be identified. The second part explores how solutions to optimization problems change with changes in the underlying parameters, and the last part provides an extensive description of the fundamental principles of finite- and infinite-horizon dynamic programming. Each chapter contains a number of detailed examples explaining both the theory and its applications for first-year master's and graduate students. 'Cookbook' procedures are accompanied by a discussion of when such methods are guaranteed to be successful, and, equally importantly, when they could fail. Each result in the main body of the text is also accompanied by a complete proof. A preliminary chapter and three appendices are designed to keep the book mathematically self-conta

This book, first published in 1996, introduces students to optimization theory and its use in economics and allied disciplines. The first of its three parts examines the existence of solutions to optimization problems in Rn, and how these solutions may be identified. The second part explores how solutions to optimization problems change with changes in the underlying parameters, and the last part provides an extensive description of the fundamental principles of finite- and infinite-horizon dynamic programming. Each chapter contains a number of detailed examples explaining both the theory and its applications for first-year master's and graduate students. 'Cookbook' procedures are accompanied by a discussion of when such methods are guaranteed to be successful, and, equally importantly, when they could fail. Each result in the main body of the text is also accompanied by a complete proof. A preliminary chapter and three appendices are designed to keep the book mathematically self-conta

Numbers are part of our everyday experience and their properties have fascinated mankind since ancient times. Deciding whether a number is prime and if not, what its factors are, are both fundamental problems. In recent years analysis and solution of these problems have assumed commercial significance since large primes are an essential feature of secure methods of information transmission. The purely mathematical fascination that led to the development of methods for primality testing has been supplemented by the need to test within reasonable timescales, and computational methods have entered at all levels of number theory. In this book, Peter Giblin describes, in the context of an introduction to the theory of numbers, some of the more elementary methods for factorization and primality testing; that is, methods independent of a knowledge of other areas of mathematics. Indeed everything is developed from scratch so the mathematical prerequisites are minimal. An essential feature of t

Optimal control theory is a technique being used increasingly by academic economists to study problems involving optimal decisions in a multi-period framework. This textbook is designed to make the difficult subject of optimal control theory easily accessible to economists while at the same time maintaining rigour. Economic intuitions are emphasized, and examples and problem sets covering a wide range of applications in economics are provided to assist in the learning process. Theorems are clearly stated and their proofs are carefully explained. The development of the text is gradual and fully integrated, beginning with simple formulations and progressing to advanced topics such as control parameters, jumps in state variables, and bounded state space. For greater economy and elegance, optimal control theory is introduced directly, without recourse to the calculus of variations. The connection with the latter and with dynamic programming is explained in a separate chapter. A second purp

Optimal control theory is a technique being used increasingly by academic economists to study problems involving optimal decisions in a multi-period framework. This textbook is designed to make the difficult subject of optimal control theory easily accessible to economists while at the same time maintaining rigour. Economic intuitions are emphasized, and examples and problem sets covering a wide range of applications in economics are provided to assist in the learning process. Theorems are clearly stated and their proofs are carefully explained. The development of the text is gradual and fully integrated, beginning with simple formulations and progressing to advanced topics such as control parameters, jumps in state variables, and bounded state space. For greater economy and elegance, optimal control theory is introduced directly, without recourse to the calculus of variations. The connection with the latter and with dynamic programming is explained in a separate chapter. A second purp

The interaction between computer and mathematics is becoming more and more important at all levels as computers become more sophisticated. This book shows how simple programs can be used to do significant mathematics. The purpose of this book is to give those with some mathematical background a wealth of material with which to appreciate both the power of the microcomputer and its relevance to the study of mathematics. The authors cover topics such as number theory, approximate solutions, differential equations and iterative processes, with each chapter self-contained. Many exercises and projects are included giving ready made material for demonstrating mathematical ideas. Only a fundamental knowledge of mathematics is assumed and programming is restricted to 'basic BASIC' which will be understood by any microcomputer. The book may be used as a textbook for algorithmic mathematics at several levels, with all the topics covered appearing in any undergraduate mathematics course.

This book presents a coherent and systematic exposition of the mathematical theory of the problems of optimization and stability. Both of these are topics central to economic analysis since the latter is so much concerned with the optimizing behaviour of economic agents and the stability of the interaction processes to which this gives rise. The topics covered include convexity, mathematical programming, fixed point theorems, comparative static analysis and duality, the stability of dynamic systems, the calculus of variations and optimal control theory. The authors present a more detailed and wide-ranging discussion of these topics than is to be found in the few books which attempt a similar coverage. Although the text deals with fairly advanced material, the mathematical prerequisites are minimised by the inclusion of an integrated mathematical review designed to make the text self-contained and accessible to the reader with only an elementary knowledge of calculus and linear algebra.

In this book, Jon Conrad and Colin Clark develop the theory of resource economics. To begin, they provide an introduction to the required techniques of dynamic optimization. Throughout the book they build the reader's understanding with many fully-worked problems and numerical examples. The authors have written this text in the belief that the theory and concepts of resource are more quickly learned, more effectively made operational, and more truly understood if the reader is exposed to carefully explained numerical examples. By working through the problems at the end of each chapter, students will learn the techniques to be used in empirical studies of natural resource systems. The first chapter provides an introduction to optimization, including constrained optimization, dynamic allocation problems, dynamic programming, continuous time problems, and the maximum principle, and a discussion of various numerical and graphical techniques. The remaining chapters deal in depth with the ec

In this book, Jon Conrad and Colin Clark develop the theory of resource economics. To begin, they provide an introduction to the required techniques of dynamic optimization. Throughout the book they build the reader's understanding with many fully-worked problems and numerical examples. The authors have written this text in the belief that the theory and concepts of resource are more quickly learned, more effectively made operational, and more truly understood if the reader is exposed to carefully explained numerical examples. By working through the problems at the end of each chapter, students will learn the techniques to be used in empirical studies of natural resource systems. The first chapter provides an introduction to optimization, including constrained optimization, dynamic allocation problems, dynamic programming, continuous time problems, and the maximum principle, and a discussion of various numerical and graphical techniques. The remaining chapters deal in depth with the ec

In this short book, the authors discuss three types of problems from combinatorial geometry: Borsuk's partition problem, covering convex bodies by smaller homothetic bodies, and the illumination problem. They show how closely related these problems are to each other. The presentation is elementary, with no more than high-school mathematics and an interest in geometry required to follow the arguments. Most of the discussion is restricted to two- and three-dimensional Euclidean space, though sometimes more general results and problems are given. Thus even the mathematically unsophisticated reader can grasp some of the results of a branch of twentieth-century mathematics that has applications in such disciplines as mathematical programming, operations research and theoretical computer science. At the end of the book the authors have collected together a set of unsolved and partially solved problems that a sixth-form student should be able to understand and even attempt to solve.

To perform computer simulation successfully, two rather different sets of skills are required. One of these relates to programming: a simulation program should do what its author intends and do it efficiently. The other is concerned with the collection and analysis of data: statistical tools have to be used in order to obtain with a minimum of effort, accurate and reliable estimates for the desired performance measures. Dr Mitrani covers both of these aspects of the simulation method. The important topics of point and interval estimation, simulation efficiency and the analysis of simulation experiments are discussed in detail. This book, first published in 1982, will be useful to both undergraduate and postgraduate students taking courses on simulation in departments of computer science, operations research and statistics in universities and polytechnics. It will be of benefit also to practitioners in the field.