Welcome to our book review site go-pdf.online!
You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Discrete Mathematical Problems with Medical Applications
This volume presents selected papers from a three-day workshop held during the DIMACS special years on Mathematical Support for Molecular Biology. Participants from the world over attended, giving the workshop an important international component. The study of discrete mathematics and optimization with medical applications is emerging as an important new research area. Significant applications have been found in medical research, for example in radiosurgical treatment planning, virtual endoscopy, and more. This volume presents a substantive cross-section of active research topics ranging from medical imaging to human anatomy modeling, from gamma knife treatment planning to radiation therapy, and from epileptic seizures to DNA screening. This book is an up-to-date resource reflecting current research directions.
Constraint Programming and Large Scale Discrete Optimization
The proceedings of the September 1998 workshop deals with the application of constraint programming to problems of combinatorial optimization and industrial practice, covering general techniques, scheduling problems, and software methodology. The eight papers discuss using global constraints for local search, multithreaded constraint programming, employee scheduling, mission scheduling on orbiting satellites, sports scheduling, and the main results of the CHIC-2 project on large scale constraint optimization. No index. c. Book News Inc.
Set Theory
This volume presents the proceedings from the Mid-Atlantic Mathematical Logic Seminar (MAMLS) conference held in honor of Andras Hajnal at the DIMACS Center, Rutgers University (New Brunswick, NJ). Articles include both surveys and high-level research papers written by internationally recognized experts in the field of set theory. Many of the current active areas of set theory are represented in this volume. It includes research papers on combinatorial set theory, set theoretictopology, descriptive set theory, and set theoretic algebra. There are valuable surveys on combinatorial set theory, fragments of the proper forcing axiom, and the reflection properties of stationary sets. The book also includes an exposition of the ergodic theory of lattices in higher rank semisimpleLie groups-essential reading for anyone who wishes to understand much of the recent work on countable Borel equivalence relations.
Mobile Networks and Computing
Advances in the technologies of networking, wireless communications, and miniaturization of computers have lead to rapid development in mobile communication infrastructure and have engendered a new paradigm of computing. Users carrying portable devices can now move freely about while remaining connected to the network. This "portability" allows for access to information from anywhere and at any time. The flexibility has resulted in new levels of complexity not encountered previously in software and protocol design for wired networking. New challenges in designing software systems for mobile networks include location and mobility management, channel allocation, power conservation, and more. In this book, renowned researchers in the field address these aspects of mobile networking.
Advances in Network Information Theory
Information theory has recently attracted renewed attention because of key developments spawning challenging research problems." "The book is suitable for graduate students and research mathematicians interested in communications and network information theory."--Jacket.
Graphs, Morphisms, and Statistical Physics
The intersection of combinatorics and statistical physics has experienced great activity in recent years. This flurry of activity has been fertilized by an exchange not only of techniques, but also of objectives. Computer scientists interested in approximation algorithms have helped statistical physicists and discrete mathematicians overcome language problems. They have found a wealth of common ground in probabilistic combinatorics. Close connections between percolation and random graphs, graph morphisms and hard-constraint models, and slow mixing and phase transition have led to new results and perspectives. These connections can help in understanding typical behavior of combinatorial phenomena such as graph coloring and homomorphisms. Inspired by issues and intriguing new questions surrounding the interplay of combinatorics and statistical physics, a DIMACS/DIMATIA workshop was held at Rutgers University. These proceedings are the outgrowth of that meeting. This volume is intended for graduate students and research mathematicians interested in probabilistic graph theory and its applications.
Robust Communication Networks: Interconnection and Survivability
This volume contains the proceedings of a DIMACS Workshop on Robust Communication Networks held as part of the Special Year on Networks. Theoreticians and practitioners presented papers on the roles of architectural interconnection and survivability in the design, construction, operation, and application of robust communication networks. Due to the advent of VSLI and fiber optics technologies, it has become possible and feasible to design and construct large scale, high performance, high speed wireline and wireless communication networks that are also robust. This opens many challenging issues and problems for both the theory community and practitioners. Of particular interest is how these technological advances lead the way to new and challenging mathematical frontiers and set the direction for future research on and implementation of robust communication networks. The nine papers chosen for this volume represent the state of the art from a variety of perspectives.
DNA Based Computers V
This proceedings volume presents the talks from the Fifth Annual Meeting on DNA Based Computers held at MIT. The conference brought together researchers and theorists from many disciplines who shared research results in biomolecular computation. Two styles of DNA computing were explored at the conference: 1) DNA computing based on combinatorial search, where randomly created DNA strands are used to encode potential solutions to a problem, and constraints induced by the problem are used to identify DNA strands that are solution witnesses; and 2) DNA computing based on finite-state machines, where the state of a computation is encoded in DNA, which controls the biochemical steps that advance the DNA-based machine from state to state. Featured articles include discussions on the formula satisfiability problem, self-assembly and nanomachines, simulation and design of molecular systems, and new theoretical approaches.
Codes and Association Schemes
This volume presents papers related to the DIMACS workshop, "Codes and Association Schemes". The articles are devoted to the following topics: applications of association schemes and of the polynomial method to properties of codes, structural results for codes, structural results for association schemes, and properties of orthogonal polynomials and their applications in combinatorics. Papers on coding theory are related to classical topics, such as perfect codes, bounds on codes, codes and combinatorial arrays, weight enumerators, and spherical designs. Papers on orthogonal polynomials provide new results on zeros and symptotic properties of standard families of polynomials encountered in coding theory. The theme of association schemes is represented by new classification results and new classes of schemes related to posets. This volume collects up-to-date applications of the theory of association schemes to coding and presents new properties of both polynomial and general association schemes. It offers a solid representation of results in problems in areas of current interest.
