(Hardback)ISBN-10: 0-19-927952-7
Publication date: 4 May 2006
240 pages, 216mm x 138mm
Description
Fascinating exploration of time and our different understandings
of it
Creates a fertile dialogue between metaphysics, philosophy of
physics, and philosophy of language
Sattig presents his own original metaphysical worldview
Thomas Sattig's book develops a comprehensive framework for doing
philosophy of time. He brings together a variety of different
perspectives, linking our ordinary conception of time with the
physicist's conception, and linking questions about time
addressed in metaphysics with questions addressed in the
philosophy of language. Within this framework, Sattig explores
the temporal dimension of the material world in relation to the
temporal dimension of our ordinary discourse about the world.
The discussion is centred around the dispute between three-dimensionalists
and four-dimensionalists about whether the temporal profile of
ordinary objects mirrors their spatial profile. Are ordinary
objects extended in time in the same way in which they are
extended in space? Do they have temporal as well as spatial
parts? Four-dimensionalists say 'yes', three-dimensionalists say
'no'. Sattig develops an original three-dimensionalist picture of
the material world, and argues that this picture is preferable to
its four-dimensionalists rivals if ordinary thought and talk are
taken seriously. Among the issues that Sattig discusses are the
metaphysics of persistence, change, composition, location,
coincidence, and relativity; the ontology of past, present, and
future; and the semantics of predication, tense, temporal
modifiers, and sortal terms.
Readership: Scholars and students of philosophy, particularly in
metaphysics and philosophy of language
Contents
1 Temporal Supervenience
2 Three-Dimensionalism and Four-Dimensionalism
3 Temporal Predication and Supervenience Failure
4 Four-Dimensionalist Supervenience
5 Three-Dimensionalist Supervenience
Authors, editors, and contributors
Thomas Sattig, Tulane University, New Orleans
(Hardback)
ISBN-10: 0-19-927824-5
Publication date: 15 June 2006
480 pages, 234mm x 156mm
Description
Groundbreaking work on the foundations of physics
Brilliant new perspective on the basic constituents of the
universe
Interweaves physics, history, philosophy, and logic
Both authors are internationally renowned for their research in
this field
Comprehensive treatment of a wide range of views
Can quantum particles be regarded as individuals, just like
books, tables and people? According to the 'received' view -
articulated by several physicists in the immediate aftermath of
the quantum revolution - quantum physics itself tells us they
cannot: quantum particles, unlike their classical counterparts,
must be regarded as 'non-individuals' in some sense. However,
recent work has indicated that this is not the whole story and
that the theory is also consistent with the position that such
particles can be taken to be individuals, albeit at a
metaphysical price. Drawing on philosophical accounts of identity
and individuality, as well as the histories of both classical and
quantum physics, the authors explore these two alternative
metaphysical packages. In particular, they argue that if quantum
particles are regarded as individuals, then Leibniz's famous
Principle of the Identity of Indiscernibles is in fact violated.
Recent discussions of this conclusion are analysed in detail and,
again, the costs involved in saving the Principle are carefully
considered. Taking the alternative package, the authors deploy
recent work in non-standard logic and set theory to indicate how
we can make sense of the idea that objects can be non-individuals.
The concluding chapter suggests how these results might then be
extended to quantum field theory. Identity in Physics brings
together a range of work in this area and further develops the
authors' own contributions to the debate. Uniquely, as the title
indicates, it situates this work in the appropriate formal,
historical, and philosophical contexts.
Readership: Scholars and students of philosophy of physics;
physicists
Contents
1 Introduction
2 Individuality in Classical Physics
3 Quantum Statistics and Non-Individuality
4 Individuality and Non-Individuality in Quantum Mechanics
5 Names, Nomological Objects, and Quasets
6 A Problem for Present Day Mathematics
7 The Mathematics of Non-Individuality
8 Non-Reflexive Quantum Logics
9 The Logic of Quanta
Authors, editors, and contributors
Steven French, University of Leeds and Decio Krause, Federal
University of Santa Catarina, Brazil
(Hardback)
ISBN-10: 0-19-856665-4
Publication date: 17 August 2006
320 pages, 234mm x 156mm
Series: Numerical Mathematics and Scientific Computation
Description
Approaches the subject in a structured mathematical manner
Contains examples of applications to industry
Well regarded author team
This comprehensive text focuses on mathematical and numerical
techniques for the simulation of magnetohydrodynamic phenomena,
with an emphasis laid on the magnetohydrodynamics of liquid
metals, and on a prototypical industrial application. Aimed at
research mathematicians, engineers, and physicists, as well as
those working in industry, and starting from a good understanding
of the physics at play, the approach is a highly mathematical
one, based on the rigorous analysis of the equations at hand, and
a solid numerical analysis to found the simulations. At each
stage of the exposition, examples of numerical simulations are
provided, first on academic test cases to illustrate the
approach, next on benchmarks well documented in the professional
literature, and finally, whenever possible, on real industrial
cases.
Readership: Research mathematicians, engineers and physicists, as
well as those working in industry
Contents
Preface
1 The magnetohydrodynamics equations
2 Mathematical analysis of one-fluid problems
3 Numerical approximations of one-fluid problems
4 Mathematical analysis of two-fluid problems
5 Numerical simulation of two-fluid problem
6 MHD models for one industrial application
References
Index
Authors, editors, and contributors
Claude Le Bris, Ecole Nationale des Ponts et Chaussees, France,
Jean-Frederic Gerbeau, Institut National de Recherche en
Informatique et en Automatique, France, and Tony Lelievre, Ecole
Nationale des Ponts et Chaussees, France
ISBN: 0-13-079603-4
Copyright: 2005
Format: Cloth; 848 pp
--------------------------------------------------------------------------------
Description
--------------------------------------------------------------------------------
For courses in undergraduate Combinatorics for juniors or seniors.
This carefully crafted text emphasizes applications and problem
solving. It is divided into 4 parts. Part I introduces basic
tools of combinatorics, Part II discusses advanced tools, Part
III covers the existence problem, and Part IV deals with
combinatorial optimization.
--------------------------------------------------------------------------------
Table Of Contents
--------------------------------------------------------------------------------
1. What Is Combinatorics?
2. Basic Counting Rules.
3. Introduction to Graph Theory.
4. Generating Functions and Their Applications.
5. Recurrence Relations.
6. The Principle of Inclusion and Exclusion.
7. The Polya Theory of Counting.
8. Experimental Design.
9. Coding Theory.
10. Existence Problems in Graph Theory.
11. Matching and Covering.
12. Optimization Problems for Graphs and Networks.
--------------------------------------------------------------------------------
New To This Edition
--------------------------------------------------------------------------------
Many new detailed applications are covered?Including material on
the mathematics of SARS, list colorings, expanding discussion of
scheduling legislative committees, material on DNA sequence
alignment, cryptography, mathematical chemistry, data mining,
computational molecular biology, and psychophysical scaling.
Helps students to see the practical applications of combinatorics
to multiple disciplines.
Section dealing with stable marriages and their many modern
applications?Including the assignment of interns to hospitals,
dynamic labor markets, and strategic behavior.
A useful application.
Expanded coverage of graph theory.
Enriches the study of combinatorics.
ISBN: 0-13-186239-1
Copyright: 2006
Format: Cloth; 592 pp
--------------------------------------------------------------------------------
Description
--------------------------------------------------------------------------------
With its lively, conversational tone and practical focus, this
new edition mixes applied and theoretical aspects for a solid
introduction to cryptography and security, including the latest
significant advancements in the field.
--------------------------------------------------------------------------------
Table Of Contents
--------------------------------------------------------------------------------
1 Overview
Secure Communications. Cryptographic Applications
2 Classical Cryptosystems.
Shift Ciphers. Affine Ciphers. The Vigen`ere Cipher. Substitution
Ciphers. Sherlock Holmes. The Playfair and ADFGX Ciphers. Block
Ciphers. Binary Numbers and ASCII. One-Time Pads. Pseudo-random
Bit Generation. LFSR Sequences. Enigma. Exercises. Computer
Problems.
3 Basic Number Theory.
Basic Notions. Solving ax + by = d. Congruences. The Chinese
Remainder Theorem. Modular Exponentiation. Fermat and Euler.
Primitive Roots. Inverting Matrices Mod n. Square Roots Mod n.
Legendre and Jacobi Symbols. Finite Fields. Continued Fractions.
Exercises. Computer Problems.
4 The Data Encryption Standard
Introduction. A Simplified DES-Type Algorithm. Differential
Cryptanalysis. DES. Modes of Operation. Breaking DES. Meet-in-the-Middle
Attacks. Password Security. Exercises.
5 AES: Rijndael
The Basic Algorithm. The Layers. Decryption. Design
Considerations.
6 The RSA Algorithm
The RSA Algorithm. Attacks on RSA. Primality Testing. Factoring.
The RSA Challenge. An Application to Treaty Verification. The
Public Key Concept. Exercises. Computer Problems
7 Discrete Logarithms
Discrete Logarithms. Computing Discrete Logs. Bit Commitment
Diffie-Hellman Key Exchange. ElGamal Public Key Cryptosystems.
Exercises. Computer Problems.
8 Hash Functions
Hash Functions. A Simple Hash Example. The Secure Hash Algorithm.
Birthday Attacks. Multicollisions. The Random Oracle Model. Using
Hash Functions to Encrypt.
9 Digital Signatures
RSA Signatures. The ElGamal Signature Scheme. Hashing and Signing.
Birthday Attacks on Signatures. The Digital Signature Algorithm.
Exercises. Computer Problems.
10 Security Protocols
Intruders-in-the-Middle and Impostors. Key Distribution. Kerberos
Public Key Infrastructures (PKI). X.509 Certificates. Pretty Good
Privacy. SSL and TLS. Secure Electronic Transaction. Exercises.
11 Digital Cash
Digital Cash. Exercises.
12 Secret Sharing Schemes
Secret Splitting. Threshold Schemes. Exercises. Computer Problems.
13 Games
Flipping Coins over the Telephone. Poker over the Telephone.
Exercises.
14 Zero-Knowledge Techniques
The Basic Setup. The Feige-Fiat-Shamir Identification Scheme.
Exercises.
15 Information Theory
Probability Review. Entropy. Huffman Codes. Perfect Secrecy. The
Entropy of English. Exercises.
16 Elliptic Curves
The Addition Law. Elliptic Curves Mod n. Factoring with Elliptic
Curves. Elliptic Curves in Characteristic 2. Elliptic Curve
Cryptosystems. Identity-Based Encryption. Exercises. Computer
Problems.
17 Lattice Methods
Lattices. Lattice Reduction. An Attack on RSA. NTRU. Exercises
18 Error Correcting Codes
Introduction. Error Correcting Codes. Bounds on General Codes.
Linear Codes. Hamming Codes. Golay Codes. Cyclic Codes. BCH Codes.
Reed-Solomon Codes. The McEliece Cryptosystem. Other Topics.
Exercises. Computer Problems.
19 Quantum Techniques in Cryptography
A Quantum Experiment. Quantum Key Distribution. Shorfs
Algorithm. 4 Exercises.
Mathematica Examples
Maple Examples
MATLAB Examples
Further Reading
Bibliography
Index
--------------------------------------------------------------------------------
New To This Edition
--------------------------------------------------------------------------------
New problems in Chs. 3 and 6 ? Offers instructors an expanded
problem set.
Sections on Legendre and Jacobi symbols and Continued
Fractions in Ch. 3 ? Allows instructors to cover more advanced
material (such as an attack on RSA) in later chapters.
More modes of operation in Ch. 4 ? Completes the discussion
of block ciphers.
Additional attacks on RSA ? Makes students aware of the
strengths and shortcomings of this popular scheme.
New material on hash functions ? Expands the coverage of
these important cryptographic primitives, including recent
advancements relevant to the security profession.
Updated discussion of multicollisions ? Keeps students up-to-date
on events that will have a significant impact on security systems
over the next few years.