With a natural emphasis on his scientific contributions, this limited edition set documents all aspects of Bohr's life and work. Each of the twelve volumes is introduced and edited by a physicist or scholar with particular knowledge of the subject in question and as a bonus a supplementary index volume has now been prepared for the whole set. All volumes are illustrated with rare photos, and Bohr's publications are supplemented with carefully selected manuscripts and correspondence documenting the background for his work and his milieu. The Niels Bohr Collected Works constitute a unique resource for collectors and anyone interested in the history of science, and adds up to a fascinating story of the political dedication and social responsibility of one of the major scientists of the twentieth century.
Collectors and Scientists (or those interested in (history of science)) with background or interest in: Theoretical, Atomic, Nuclear and Philosophy (of)Physics/Science.
Vol. 1: Early Work (1905 - 1911) Vol. 2: Work on Atomic Physics (1912 - 1917) Vol. 3: The Correspondence Principle (1918 - 1923) Vol. 4: The Periodic System (1920 - 1923) Vol. 5: The Emergence of Quantum Mechanics (Mainly 1924-1926) Vol. 6: Foundations of Quantum Physics I (1926 - 1932) Vol. 7: Foundations of Quantum Physics II (1933-1958) Vol. 8: The Penetration of Charged Particles Through Matter (1912 - 1954) Vol. 9: Nuclear Physics (1929-1952) Vol. 10: Complementarity Beyond Physics (1928-1962) Vol. 11: The Political Arena (1934-1961) Vol. 12: Popularization and People (1911-1962) **NEW**Vol. 13: Cumulative Subject Index
Bibliographic & ordering Information
Hardbound, ISBN-13: 978-0-444-53286-2, 8504 pages, publication date: JUN-200
Mathematica by Example, 4e is designed to introduce the Mathematica programming language to a wide audience. This is the ideal text for all scientific students, researchers, and programmers wishing to learn or deepen their understanding of Mathematica. The program is used to help professionals, researchers, scientists, students and instructors solve complex problems in a variety of fields, including biology, physics, and engineering.
Focuses on the beginning Mathematica user including instructors, students, professionals, engineers, physical scientists. Appeals to a wide range of readers- applications to a variety of fields, especially biology, physics, and engineering Step by step instructions for all mathematica implementations Covers all the basics needed to get up and running with Mathematica Fully compatible with Mathematica 6 (newest release June 2007)
Preface 1 Getting Started (Introduction to Mathematica) 2 Mathematical Operations on Numbers Expressions and Functions (Numerical Calculations and Built-In Functions; Expressions and Functions Graphing Functions, Expressions, and Equations, Exact and Approximate Solutions of Equations) 3 Calculus (Computing Limits, Differential Calculus, Implicit Differentiation, Integral Calculus, Series, Multi-Variable Calculus) 4 Introduction to Lists and Tables (Defining Lists, Operations on Lists, Other Applications) 5 Nested Lists: Matrices and Vectors (Nested Lists: Introduction to Matrices, Vectors, and Matrix Operations, Linear Systems of Equations, Selected Topics from Linear Algebra, Maxima and Minima Using Linear Programming, Vector Calculus)6 Applications Related to Ordinary and Partial Differential Equations (First-Order Ordinary Differential Equations, Higher-Order Ordinary Differential Equations, Using the Laplace Transform to Solve Ordinary Differential Equations, Systems of Ordinary Differential Equations, Some Partial Differential Equations)
Bibliographic & ordering Information
Paperback, ISBN-13: 978-0-12-374318-3, 576 pages, publication date: SEP-2008
Description
Markov processes are used to model systems with limited memory. They are used in many areas including communications systems, transportation networks, image segmentation and analysis, biological systems and DNA sequence analysis, random atomic motion and diffusion in physics, social mobility, population studies, epidemiology, animal and insect migration, queueing systems, resource management, dams, financial engineering, actuarial science, and decision systems. This book, which is written for upper level undergraduate and graduate students, and researchers, presents a unified presentation of Markov processes. In addition to traditional topics such as Markovian queueing system, the book discusses such topics as continuous-time random walk,correlated random walk, Brownian motion, diffusion processes, hidden Markov models, Markov random fields, Markov point processes and Markov chain Monte Carlo. Continuous-time random walk is currently used in econophysics to model the financial market, which has traditionally been modelled as a Brownian motion. Correlated random walk is popularly used in ecological studies to model animal and insect movement. Hidden Markov models are used in speech analysis and DNA sequence analysis while Markov random fields and Markov point processes are used in image analysis. Thus, the book is designed to have a very broad appeal.
This applications-oriented textbook presents both the theory and applications of the different aspects of Markov processes for advanced undergraduate and graduate students in engineering, science and business for whom mathematics is a problem solving tool.
Basic Concepts Introduction to Markov Processes Discrete-Time Markov Chains Continuous-Time Markov Chains Markovian Queueing Systems Markov Renewal Processes Random Walk, Brownian Motion and Diffusion Processes Hidden Markov Models Markov Random Fields Markov Point Processes Markov Chain Monte Carlo References
Bibliographic & ordering Information
Hardbound, ISBN-13: 978-0-12-374451-7, 496 pages, publication date: SEP-2008
Hardback (ISBN-13: 9780883857533)
640 exercises
Page extent: 240 pages
Size: 228 x 152 mm
Combining the features of a textbook with those of a problem workbook, this text for mathematics, computer science and engineering students presents a natural, friendly way to learn some of the essential ideas of graph theory. The material is explained using 360 strategically placed problems with connecting text, which is then supplemented by 280 additional homework problems. This problem-oriented format encourages active involvement by the reader while always giving clear direction. This approach is especially valuable with the presentation of proofs, which become more frequent and elaborate as the book progresses. Arguments are arranged in digestible chunks and always appear together with concrete examples to help remind the reader of the bigger picture. Topics include spanning tree algorithms, Euler paths, Hamilton paths and cycles, independence and covering, connections and obstructions, and vertex and edge colourings.
* Introduces graph theory using 360 explanatory exercises, with a further
280 homework problems to help students master the concepts * Topics include
Hallfs Theorem, the Konig-Egervary Theorem, matrices and Latin squares
* Ideal for undergraduates in mathematics, computer science and engineering
Preface; A. Basic Concepts; B. Isomorphic graphs; C. Bipartite graphs; D. Trees and forests; E. Spanning tree algorithms; F. Euler paths; G. Hamilton paths and cycles; H. Planar graphs; I. Independence and covering; J. Connections and obstructions; K. Vertex coloring; L. Edge coloring; M. Matching theory for bipartite graphs; N. Applications of matching theory; O. Cycle-Free digraphs; Answers to selected problems.
Hardback (ISBN-13: 9780521865722)
12 tables 241 exercises
Page extent: 264 pages
Size: 228 x 152 mm
Intended for graduate students and advanced undergraduates in computer science, A Second Course in Formal Languages and Automata Theory treats topics in the theory of computation not usually covered in a first course. After a review of basic concepts, the book covers combinatorics on words, regular languages, context-free languages, parsing and recognition, Turing machines, and other language classes. Many topics often absent from other textbooks, such as repetitions in words, state complexity, the interchange lemma, 2DPDAs, and the incompressibility method, are covered here. The author places particular emphasis on the resources needed to represent certain languages. The book also includes a diverse collection of more than 200 exercises, suggestions for term projects, and research problems that remain open.
Cover many topics, such as repititions in words, state complexity, the interchange lemma, 2DPDAfs and the compressibility method, not covered in other textbooks. Includes 200 exercises. Each chapter offers suggestions for term projects and research problems in the area.
1. Review of formal languages and automata theory; 2. Combinatorics on words; 3. Finite automata and regular languages; 4. Context-free grammars and languages; 5. Parsing and recognition; 6. Turing machines; 7. Other language classes.