Dupuytren Disease and Related Diseases - The Cutting Edge
Dupuytren Disease and Related Diseases - The Cutting Edge

Author: Paul M. N. Werker

Publisher: Springer

Published: 2016-09-07

Total Pages: 418

ISBN-13: 3319321994

DOWNLOAD EBOOK

In this book, leading international experts showcase the latest advances in research into Dupuytren disease and its clinical management. The coverage spans all relevant specialties, including cell biology, biomechanics, genomics, surgery, pharmacotherapy, and radiotherapy. The opening sections address epidemiology, cellular and extracellular events, and genetics. Treatment by means of collagenase injection, percutaneous needle fasciotomy, and other surgical and minimally invasive approaches is then extensively discussed. Comparative studies of different approaches are reviewed, and aspects of patient assessment, examined. The prevention and treatment of disease recurrences are also addressed. Further sections consider related conditions, other treatment options, and future pathways for research. This book should be read by all who treat or conduct research into Dupuytren disease. It is based on presentations delivered at the 2015 International Conference on Dupuytren Disease, held in Groningen, the Netherlands, which was designed to promote a coordinated global response to the disease involving patients, scientists, and clinicians.

Abstract Domains in Constraint Programming
Abstract Domains in Constraint Programming

Author: Marie Pelleau

Publisher: Elsevier

Published: 2015-05-20

Total Pages: 177

ISBN-13: 0081004648

DOWNLOAD EBOOK

Constraint Programming aims at solving hard combinatorial problems, with a computation time increasing in practice exponentially. The methods are today efficient enough to solve large industrial problems, in a generic framework. However, solvers are dedicated to a single variable type: integer or real. Solving mixed problems relies on ad hoc transformations. In another field, Abstract Interpretation offers tools to prove program properties, by studying an abstraction of their concrete semantics, that is, the set of possible values of the variables during an execution. Various representations for these abstractions have been proposed. They are called abstract domains. Abstract domains can mix any type of variables, and even represent relations between the variables. In this work, we define abstract domains for Constraint Programming, so as to build a generic solving method, dealing with both integer and real variables. We also study the octagons abstract domain, already defined in Abstract Interpretation. Guiding the search by the octagonal relations, we obtain good results on a continuous benchmark. We also define our solving method using Abstract Interpretation techniques, in order to include existing abstract domains. Our solver, AbSolute, is able to solve mixed problems and use relational domains. - Exploits the over-approximation methods to integrate AI tools in the methods of CP - Exploits the relationships captured to solve continuous problems more effectively - Learn from the developers of a solver capable of handling practically all abstract domains