Applications Of Topology In Computer Science
Download Applications Of Topology In Computer Science PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Applications Of Topology In Computer Science book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Topology and Its Applications
Author: William F. Basener
language: en
Publisher: John Wiley & Sons
Release Date: 2006-11-03
Discover a unique and modern treatment of topology employing a cross-disciplinary approach Implemented recently to understand diverse topics, such as cell biology, superconductors, and robot motion, topology has been transformed from a theoretical field that highlights mathematical theory to a subject that plays a growing role in nearly all fields of scientific investigation. Moving from the concrete to the abstract, Topology and Its Applications displays both the beauty and utility of topology, first presenting the essentials of topology followed by its emerging role within the new frontiers in research. Filling a gap between the teaching of topology and its modern uses in real-world phenomena, Topology and Its Applications is organized around the mathematical theory of topology, a framework of rigorous theorems, and clear, elegant proofs. This book is the first of its kind to present applications in computer graphics, economics, dynamical systems, condensed matter physics, biology, robotics, chemistry, cosmology, material science, computational topology, and population modeling, as well as other areas of science and engineering. Many of these applications are presented in optional sections, allowing an instructor to customize the presentation. The author presents a diversity of topological areas, including point-set topology, geometric topology, differential topology, and algebraic/combinatorial topology. Topics within these areas include: Open sets Compactness Homotopy Surface classification Index theory on surfaces Manifolds and complexes Topological groups The fundamental group and homology Special "core intuition" segments throughout the book briefly explain the basic intuition essential to understanding several topics. A generous number of figures and examples, many of which come from applications such as liquid crystals, space probe data, and computer graphics, are all available from the publisher's Web site.
Topology with Applications
Author: Somashekhar A. Naimpally
language: en
Publisher: World Scientific
Release Date: 2013
The principal aim of this book is to introduce topology and its many applications viewed within a framework that includes a consideration of compactness, completeness, continuity, filters, function spaces, grills, clusters and bunches, hyperspace topologies, initial and final structures, metric spaces, metrization, nets, proximal continuity, proximity spaces, separation axioms, and uniform spaces.This book provides a complete framework for the study of topology with a variety of applications in science and engineering that include camouflage filters, classification, digital image processing, forgery detection, Hausdorff raster spaces, image analysis, microscopy, paleontology, pattern recognition, population dynamics, stem cell biology, topological psychology, and visual merchandising.It is the first complete presentation on topology with applications considered in the context of proximity spaces, and the nearness and remoteness of sets of objects. A novel feature throughout this book is the use of near and far, discovered by F Riesz over 100 years ago. In addition, it is the first time that this form of topology is presented in the context of a number of new applications.
Distributed Computing Through Combinatorial Topology
Distributed Computing Through Combinatorial Topology describes techniques for analyzing distributed algorithms based on award winning combinatorial topology research. The authors present a solid theoretical foundation relevant to many real systems reliant on parallelism with unpredictable delays, such as multicore microprocessors, wireless networks, distributed systems, and Internet protocols. Today, a new student or researcher must assemble a collection of scattered conference publications, which are typically terse and commonly use different notations and terminologies. This book provides a self-contained explanation of the mathematics to readers with computer science backgrounds, as well as explaining computer science concepts to readers with backgrounds in applied mathematics. The first section presents mathematical notions and models, including message passing and shared-memory systems, failures, and timing models. The next section presents core concepts in two chapters each: first, proving a simple result that lends itself to examples and pictures that will build up readers' intuition; then generalizing the concept to prove a more sophisticated result. The overall result weaves together and develops the basic concepts of the field, presenting them in a gradual and intuitively appealing way. The book's final section discusses advanced topics typically found in a graduate-level course for those who wish to explore further. - Named a 2013 Notable Computer Book for Computing Methodologies by Computing Reviews - Gathers knowledge otherwise spread across research and conference papers using consistent notations and a standard approach to facilitate understanding - Presents unique insights applicable to multiple computing fields, including multicore microprocessors, wireless networks, distributed systems, and Internet protocols - Synthesizes and distills material into a simple, unified presentation with examples, illustrations, and exercises