The Algorithmic Beauty of Seaweeds, Sponges and Corals, Jaap A. Kaandorp; Janet E. K?bler
Автор: Theodore J. Saclarides, Jonathan A. Myers, Keith Название: Common Surgical Diseases An Algorithmic Approach to Problem Solving ISBN: 1493915649 ISBN-13(EAN): 9781493915644 Издательство: Springer Рейтинг: Цена: 20962.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Written by leaders in the field, the third edition of Common Surgical Diseases: An Algorithmic Approach to Problem Solving, provides surgical residents and medical students with a current, concise and algorithmic approach to frequently encountered clinical challenges.
Описание: The papers gathered in this book were published over a period of more than twenty years in widely scattered journals. They led to the discovery of randomness in arithmetic which was presented in the recently published monograph on "Algorithmic Information Theory" by the author. There the strongest possible version of G del's incompleteness theorem, using an information-theoretic approach based on the size of computer programs, was discussed. The present book is intended as a companion volume to the monograph and it will serve as a stimulus for work on complexity, randomness and unpredictability, in physics and biology as well as in metamathematics.
The Square Root Phenomenon in Planar Graphs.- An Algorithm for Determining Whether a Pair of Polygons Is Reversible.- Disjoint Small Cycles in Graphs and Bipartite Graphs.- An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree.- Algorithms for Testing Length Four Permutations.- Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds.- Faster Exact Computation of rSPR Distance.- Arbitrated Quantum Signature Schemes: Attacks and Security.- Randomized Algorithms for Removable Online Knapsack Problems.- An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs.- FWLS: A Local Search for Graph Coloring.- A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids.- Monomial Testing and Applications.- The Optimal Rescue Path Set Problem in Undirected Graphs.- Expected Computations on Color Spanning Sets.- Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs.- Spanning Distribution Trees of Graphs.- A Cutting Plane Heuristic Algorithm for the Time Dependent Chinese Postman Problem.- Zero-Visibility Cops and Robber Game on a Graph.- On (k, l)-Graph Sandwich Problems.- Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints.- Two-Round Discrete Voronoi Game along a Line.- Inverse Maximum Flow Problems under the Combining Norms.- The Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs and Digraphs.- A Cost-Efficient Scheduling Algorithm for Traffic Grooming.- Strategies of Groups Evacuation from a Convex Region in the Plane.- Kernelization and Lower Bounds of the Signed Domination Problem.- On Edge-Independent Sets.- On the Complexity of Approximate Sum of Sorted List.- Large Hypertree Width for Sparse Random Hypergraphs.- On Perfect Absorbants in De Bruijn Digraphs.- Multi-Multiway Cut Problem on Graphs of Bounded Branch Width.- Bi-criteria Scheduling on Multiple Machines Subject to Machine Availability Constraints.- Zero-Sum Flow Numbers of Hexagonal Grids.- Pattern-Guided k-Anonymity.
Автор: Nemer Narchi; Lisa Leimar Price Название: Ethnobiology of Corals and Coral Reefs ISBN: 3319237624 ISBN-13(EAN): 9783319237626 Издательство: Springer Рейтинг: Цена: 19591.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book explores the ethnobiology of corals by examining the various ways in which humans, past and present, have exploited and taken care of coral and coralline habitats. Ethnobiology of Corals and Coral Reefs establishes an intimate bond between the audience and the wonder of corals and their importance to humankind.
Автор: B.Heinrich Matzat; Gert-Martin Greuel; Gerhard His Название: Algorithmic Algebra and Number Theory ISBN: 3540646701 ISBN-13(EAN): 9783540646709 Издательство: Springer Рейтинг: Цена: 15372.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This text gives an overview on algorithmic methods and results obtained during the period 1991-1997 mainly in algebraic geometry, and group and representation theory.
Автор: Daniel Robertz Название: Formal Algorithmic Elimination for PDEs ISBN: 3319114441 ISBN-13(EAN): 9783319114446 Издательство: Springer Рейтинг: Цена: 6288.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
Introduction.- Formal Methods for PDE Systems.- Differential Elimination for Analytic Functions.- Basic Principles and Supplementary Material.- References.- List of Algorithms.- List of Examples.- Index of Notation.- Index.
Автор: Terzidis Название: Algorithmic Architecture ISBN: 0750667257 ISBN-13(EAN): 9780750667258 Издательство: Taylor&Francis Рейтинг: Цена: 8573.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Why does the word design owe its origin to Latin and not Greek roots? Where do the limits of the human mind lie? This volume challenges the reader to tackle these complex questions and more. It presents many, various and often seemingly disparate points of view that lead to the establishment of one common theme; algorithmic architecture.
Автор: Przemyslaw Prusinkiewicz; J.S. Hanan; F.D. Fracchi Название: The Algorithmic Beauty of Plants ISBN: 0387946764 ISBN-13(EAN): 9780387946764 Издательство: Springer Рейтинг: Цена: 9781.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The beauty of plants has attracted the attention of mathematicians for Mathematics centuries. Conspicuous geometric features such as the bilateral sym- and beauty metry of leaves, the rotational symmetry of flowers, and the helical arrangements of scales in pine cones have been studied most exten- sively. This focus is reflected in a quotation from Weyl 159, page 3], "Beauty is bound up with symmetry. " This book explores two other factors that organize plant structures and therefore contribute to their beauty. The first is the elegance and relative simplicity of developmental algorithms, that is, the rules which describe plant development in time. The second is self-similarity, char- acterized by Mandelbrot 95, page 34] as follows: When each piece of a shape is geometrically similar to the whole, both the shape and the cascade that generate it are called self-similar. This corresponds with the biological phenomenon described by Herman, Lindenmayer and Rozenberg 61]: In many growth processes of living organisms, especially of plants, regularly repeated appearances of certain multicel- lular structures are readily noticeable. . . . In the case of a compound leaf, for instance, some of the lobes (or leaflets), which are parts of a leaf at an advanced stage, have the same shape as the whole leaf has at an earlier stage. Thus, self-similarity in plants is a result of developmental processes. Growth and By emphasizing the relationship between growth and form, this book form follows a long tradition in biology.
Автор: Leonard M. Adleman; Ming-Deh Huang Название: Algorithmic Number Theory ISBN: 3540586911 ISBN-13(EAN): 9783540586913 Издательство: Springer Рейтинг: Цена: 8384.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This volume contains the refereed proceedings of the 1st Algorithmic Number Theory Symposium, held at Cornell University, New York, USA in May 1994. The contributors address algorithmic, computational and complexity-theoretical aspects, and contribute to cryptology research.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
