Elastography: A Quantitative Method for Imaging the Elasticity of Biological Tissues

Mixed-variable symplectic integrators exhibit no long-term accumulation of energy error, beyond that owing to round-off, and they are substantially faster than conventional N-body algorithms. This makes them the integrator of choice for many problems in Solar system astronomy. However, in their original formulation, they become inaccurate whenever two bodies approach one another closely. This occurs because the potential energy term for the pair undergoing the encounter becomes comparable to the terms representing the unperturbed motion in the Hamiltonian. The problem can be overcome using a hybrid method, in which the close encounter term is integrated using a conventional integrator, whilst the remaining terms are solved symplectically. In addition, using a simple separable potential technique, the hybrid scheme can be made symplectic even though it incorporates a non-symplectic component.

/pdf/a-hybrid-symplectic-integrator-that-permits-close-encounters-12lydozdfn.pdf

A hybrid symplectic integrator that permits close encounters between massive bodies

Constraint programming is a powerful paradigm for solving combinatorial search problems that draws on a wide range of techniques from artificial intelligence, computer science, databases, programming languages, and operations research. Constraint programming is currently applied with success to many domains, such as scheduling, planning, vehicle routing, configuration, networks, and bioinformatics.

The aim of this handbook is to capture the full breadth and depth of the constraint programming field and to be encyclopedic in its scope and coverage. While there are several excellent books on constraint programming, such books necessarily focus on the main notions and techniques and cannot cover also extensions, applications, and languages. The handbook gives a reasonably complete coverage of all these lines of work, based on constraint programming, so that a reader can have a rather precise idea of the whole field and its potential. Of course each line of work is dealt with in a survey-like style, where some details may be neglected in favor of coverage. However, the extensive bibliography of each chapter will help the interested readers to find suitable sources for the missing details. Each chapter of the handbook is intended to be a self-contained survey of a topic, and is written by one or more authors who are leading researchers in the area.

The intended audience of the handbook is researchers, graduate students, higher-year undergraduates and practitioners who wish to learn about the state-of-the-art in constraint programming. No prior knowledge about the field is necessary to be able to read the chapters and gather useful knowledge. Researchers from other fields should find in this handbook an effective way to learn about constraint programming and to possibly use some of the constraint programming concepts and techniques in their work, thus providing a means for a fruitful cross-fertilization among different research areas.

The handbook is organized in two parts. The first part covers the basic foundations of constraint programming, including the history, the notion of constraint propagation, basic search methods, global constraints, tractability and computational complexity, and important issues in modeling a problem as a constraint problem. The second part covers constraint languages and solver, several useful extensions to the basic framework (such as interval constraints, structured domains, and distributed CSPs), and successful application areas for constraint programming.

- Covers the whole field of constraint programming
- Survey-style chapters
- Five chapters on applications

Table of Contents

Foreword (Ugo Montanari) 
Part I : Foundations
Chapter 1. Introduction (Francesca Rossi, Peter van Beek, Toby Walsh) 
Chapter 2. Constraint Satisfaction: An Emerging Paradigm (Eugene C. Freuder, Alan K. Mackworth) 
Chapter 3. Constraint Propagation (Christian Bessiere) 
Chapter 4. Backtracking Search Algorithms (Peter van Beek) 
Chapter 5. Local Search Methods (Holger H. Hoos, Edward Tsang) 
Chapter 6. Global Constraints (Willem-Jan van Hoeve, Irit Katriel)
Chapter 7. Tractable Structures for CSPs (Rina Dechter)
Chapter 8. The Complexity of Constraint Languages
(David Cohen, Peter Jeavons) 
Chapter 9. Soft Constraints (Pedro Meseguer, Francesca Rossi, Thomas Schiex) 
Chapter 10. Symmetry in Constraint Programming
(Ian P. Gent, Karen E. Petrie, Jean-Francois Puget)
Chapter 11. Modelling (Barbara M. Smith) 
Part II : Extensions, Languages, and Applications

Chapter 12. Constraint Logic Programming (Kim Marriott, Peter J. Stuckey, Mark Wallace) 
Chapter 13. Constraints in Procedural and Concurrent Languages (Thom Fruehwirth, Laurent Michel, Christian Schulte)
Chapter 14. Finite Domain Constraint Programming Systems (Christian Schulte, Mats Carlsson) 
Chapter 15. Operations Research Methods in Constraint Programming (John Hooker) 
Chapter 16. Continuous and Interval Constraints(Frederic Benhamou, Laurent Granvilliers) 
Chapter 17. Constraints over Structured Domains
(Carmen Gervet) 
Chapter 18. Randomness and Structure (Carla Gomes, Toby Walsh)
Chapter 19. Temporal CSPs (Manolis Koubarakis)
Chapter 20. Distributed Constraint Programming
(Boi Faltings) 
Chapter 21. Uncertainty and Change (Kenneth N. Brown, Ian Miguel)
Chapter 22. Constraint-Based Scheduling and Planning
(Philippe Baptiste, Philippe Laborie, Claude Le Pape, Wim Nuijten)
Chapter 23. Vehicle Routing (Philip Kilby, Paul Shaw) 
Chapter 24. Configuration (Ulrich Junker)
Chapter 25. Constraint Applications in Networks
(Helmut Simonis)
Chapter 26. Bioinformatics and Constraints (Rolf Backofen, David Gilbert)

/pdf/handbook-of-constraint-programming-53srutguo2.pdf

Handbook of Constraint Programming

Neural networks and principal component analysis: learning from examples without local minima

Rapid solution of integral equations of classical potential theory

This well written book is enlarged by the following topics:
$B$-splines and their computation, elimination methods for
large sparse systems of linear equations, Lanczos algorithm for
eigenvalue problems, implicit shift techniques for the $LR$ and
$QR$ algorithm, implicit differential equations, differential
algebraic systems, new methods for stiff differential
equations, preconditioning techniques and convergence rate of
the conjugate gradient algorithm and multigrid methods for
boundary value problems. Cf. also the reviews of the German
original editions.

Introduction to Numerical Analysis

Numerical treatment of ordinary differential equations by extrapolation methods

Fehlerabschätzungen und Extrapolation mit rationalen Funktionen bei Verfahren vom Richardson-Typus

This paper is a continuation of [2, 3]. It contains anALGOL program for the incomplete elliptic integral of the third kind based on a theory described in [4]. This program replaces the inadequate one based on the Gauβ-transformation which was published in [2]. In addition, anAlgol program for a general complete elliptic integral is presented.

Roland Bulirsch

Papers

Introduction to Numerical Analysis

Numerical treatment of ordinary differential equations by extrapolation methods

Fehlerabschätzungen und Extrapolation mit rationalen Funktionen bei Verfahren vom Richardson-Typus

Numerical calculation of elliptic integrals and elliptic functions

Bemerkungen zur Romberg-Integration