An analysis of two heuristic strategies for the development of mechanistic models, illustrated with historical examples from the life sciences.
In Discovering Complexity, William Bechtel and Robert Richardson examine two heuristics that guided the development of mechanistic models in the life sciences: decomposition and localization. Drawing on historical cases from disciplines including cell biology, cognitive neuroscience, and genetics, they identify a number of "choice points" that life scientists confront in developing mechanistic explanations and show how different choices result in divergent explanatory models. Describing decomposition as the attempt to differentiate functional and structural components of a system and localization as the assignment of responsibility for specific functions to specific structures, Bechtel and Richardson examine the usefulness of these heuristics as well as their fallibility -- the sometimes false assumption underlying them that nature is significantly decomposable and hierarchically organized.
When Discovering Complexity was originally published in 1993, few philosophers of science perceived the centrality of seeking mechanisms to explain phenomena in biology, relying instead on the model of nomological explanation advanced by the logical positivists (a model Bechtel and Richardson found to be utterly inapplicable to the examples from the life sciences in their study). Since then, mechanism and mechanistic explanation have become widely discussed. In a substantive new introduction to this MIT Press edition of their book, Bechtel and Richardson examine both philosophical and scientific developments in research on mechanistic models since 1993.
Andreas B?rmann develops novel approaches for the solution of network design problems as they arise in various contexts of applied optimization. At the example of an optimal expansion of the German railway network until 2030, the author derives a tailor-made decomposition technique for multi-period network design problems. Next, he develops a general framework for the solution of network design problems via aggregation of the underlying graph structure. This approach is shown to save much computation time as compared to standard techniques. Finally, the author devises a modelling framework for the approximation of the robust counterpart under ellipsoidal uncertainty, an often-studied case in the literature. Each of these three approaches opens up a fascinating branch of research which promises a better theoretical understanding of the problem and an increasing range of solvable application settings at the same time.
Автор: Yunqing Huang; Ralf Kornhuber; Olof Widlund; Jinch Название: Domain Decomposition Methods in Science and Engineering XIX ISBN: 3642265693 ISBN-13(EAN): 9783642265693 Издательство: Springer Рейтинг: Цена: 24456.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: These are the proceedings of the 19th international conference on domain decomposition methods in science and engineering.
Автор: El?as Cueto; David Gonz?lez; Ic?ar Alfaro Название: Proper Generalized Decompositions ISBN: 331929993X ISBN-13(EAN): 9783319299938 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book is intended to help researchers overcome the entrance barrier to Proper Generalized Decomposition (PGD), by providing a valuable tool to begin the programming task.
Автор: Michel Bercovier; Martin Gander; Ralf Kornhuber; O Название: Domain Decomposition Methods in Science and Engineering XVIII ISBN: 364226025X ISBN-13(EAN): 9783642260254 Издательство: Springer Рейтинг: Цена: 25155.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: th This volume contains a selection of 41 refereed papers presented at the 18 International Conference of Domain Decomposition Methods hosted by the School of ComputerScience and Engineering(CSE) of the Hebrew Universityof Jerusalem, Israel, January 12-17, 2008.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
