Clojure Programming

Finally, after a wait of more than thirty-five years, the first part of Volume 4 is at last ready for publication. Check out the boxed set that brings together Volumes 1 - 4A in one elegant case, and

In real-world problems related to finance, business, and management, mathematicians and economists frequently encounter optimization problems. In this classic book, George Dantzig looks at a wealth of

Having given away the answer in the subtitle, Langdon (U. of Birmingham, England) explains the nuts and bolts of the automatic creation of program code that actually includes stored data, which previo

The job of the constraint programmer is to use mathematical constraints to model real world constraints and objects. In this book, Kim Marriott and Peter Stuckey provide the first comprehensive intro

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

Type theory is one of the most important tools in the design of higher-level programming languages, such as ML. This book introduces and teaches its techniques by focusing on one particularly neat system and studying it in detail. In this way, all the key ideas are covered without getting involved in the complications of more advanced systems, but concentrating rather on the principles that make the theory work in practice. This book takes a type-assignment approach to type theory, and the system considered is the simplest polymorphic one. The author covers all the basic ideas, including the system's relation to propositional logic, and gives a careful treatment of the type-checking algorithm which lies at the heart of every such system. Also featured are two other interesting algorithms that have been buried in inaccessible technical literature. The mathematical presentation is rigorous but clear, making the book at a level which can be used as an introduction to type theory for comp

Covers the latest research in areas such as theoretical foundations, constraints, concurrency and parallelism, deductive databases,language design and implementation, non-monotonic reasoning, and logi

The inventor of the C++ language explains the language, its standard library, and key design techniques, for both novice and experienced C++ programmers. C++ is presented independent of any particular

Provides a detailed introduction to writing 32-bit Windows applications using C++ and the Microsoft Foundation Class (MFC) library. The text describes the Windows architecture, shows how MFC works, co

Encompassing all the major topics students will encounter in courses on the subject, the authors teach both the underlying mathematical foundations and how these ideas are implemented in practice. The

Shows how to use the POSIX threads standard, discussing performance issues and how threads interact with the rest of the UNIX system, and comparing various types of threads. Subjects include basic des

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

Written by one of the foremost experts, Steve Heath, the processor technology specialist at Motorola (UK).* 200 pages packed with information for programmers * will complement the author's other Butt

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

This book gives a tutorial overview of Goedel, presents example programs, provides a formal definition of the syntax and semantics of the language, and covers background material on logic.Goedel is a

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

Numerical Mathematics is a unique textbook which presents rudimentary numerical mathematics in conjunction with computational laboratory assignments. No previous knowledge of calculus or linear algebra is presupposed, and thus the book is tailor-made for undergraduate students, as well as prospective mathematics teachers. The material in the book emphasises algorithmic aspects of mathematics, which are made viable through numerical assignments, in which the traditional 'chalk-and-talk' lecturer turns, in part, into a laboratory instructor. The book is not a numerical methods book, containing ready-made computational recipes. Rather, it guides the student to create the algorithm required for any given assignment - expressed in whichever programming language is used - on the basis of the underlying mathematics. The computational assignments cover iterative processes, area approximations, solution of linear systems, acceleration of series summation, interpolative approximations, and const

In this ground-breaking book, John Koza shows how this remarkable paradigm works and provides substantial empirical evidence that solutions to a great variety of problems from many different fields c

In this ground-breaking book, John Koza shows how this remarkable paradigm works and provides substantial empirical evidence that solutions to a great variety of problems from many different fields ca

This book presents an elementary introduction to the theoryof oriented matroids. The way oriented matroids are intro-duced emphasizes that they are the most general - and hencesimplest - structu

Covers the theory, applications, theoretical possibilities and implementation issues that represent the material in Prolog.

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 primary object of this manual is to build an understanding of the principles of computer operations and the use of computers in the laboratory. While the development of applications for computers has been rapid since their introduction, the principles of computer operation and their use in sensing and control have remained stable. Those are the primary subjects of this book, throughout which a gradual understanding of what goes on inside a computer is developed. The laboratory provides a vital experience in linking theory with physical reality, and all of the computer work is done in the context of doing experiments. The IBM-PC design is used as the basis for the book. The internal design of this machine is slightly more complicated than earlier personal computers, but it is still simple enough to be quickly learned. The computer can be directly controlled by proper programming, and offers considerably more power than earlier designs. The IBM design also has expansion slots which m

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.

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.

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