The availability of cheaper, faster, and more reliable electronic components has stimulated important advances in computing and communication technologies. Theoretical and algorithmic approaches that address key issues in sensor networks, ad hoc wireless networks, and peer-to-peer networks play a central role in the development of emerging network
Parallel and distributed computation has been gaining a great lot of attention in the last decades. During this period, the advances attained in computing and communication technologies, and the reduction in the costs of those technolo gies, played a central role in the rapid growth of the interest in the use of parallel and distributed computation in a number of areas of engineering and sciences. Many actual applications have been successfully implemented in various plat forms varying from pure shared-memory to totally distributed models, passing through hybrid approaches such as distributed-shared memory architectures. Parallel and distributed computation differs from dassical sequential compu tation in some of the following major aspects: the number of processing units, independent local dock for each unit, the number of memory units, and the programming model. For representing this diversity, and depending on what level we are looking at the problem, researchers have proposed some models to abstract the main characteristics or parameters (physical components or logical mechanisms) of parallel computers. The problem of establishing a suitable model is to find a reasonable trade-off among simplicity, power of expression and universality. Then, be able to study and analyze more precisely the behavior of parallel applications.
Increasingly, modern medicine relies on so called traditional or ancient medical knowledge. Holistic practices such as adhering to proper diet, observing rules for appropriate behavior, and administering medical preparations are coupled with the latest technology and methods to treat the whole patient. In light of this trend, there is much to be gained from understanding of one of the oldest medical systems still in existence. Tibetan Medicinal Plants provides you a detailed analysis of how Tibetan plants are used in this centuries old system. The book opens with a summary of Tibetan medicine and covers the various habitats in which the plants are found. The main part of this volume encompasses 60 monographs listed by the Tibetan plant name. Each monograph consists of several chapters addressing different topics related either to the Tibetan or the Western approach. Most of the monographs contain a description of the macroscopic and microscopic characteristics of the used plant parts, and anatomical features of 76 plants are provided. Each monograph presents an overview of the known chemical constituents and pharmacological properties of each plant and describes their use in Tibetan medicine. In contrast to other publications on Tibetan medicine, where translations of the Tibetan terms are given in other languages, this book treats the Tibetan word as a technical term, keeps the Tibetan term and explains its meaning, lessening confusion by reducing the number of translations. Traditional Tibetan medicine has been in existence for centuries. Curative practices existed in the prebuddistic era, and the art of healing developed more than 2500 years ago. Tibetan Medicinal Plants provides a comprehensive overview of all plant types, thus making it easier to grasp the Tibetan concept. It gives you a comprehensive look at this centuries old science.
This book, written by an international team of prominent authors, gathers the latest developments in mobile technologies for the acquisition, management, analysis and sharing of Volunteered Geographic Information (VGI) in the context of Earth observation. It is divided into three parts, the first of which presents case studies on the implementation of VGI for Earth observation, discusses the characteristics of volunteers’ engagement in relation with their expertise and motivation, analyzes the tasks they are called upon to perform, and examines the available tools for developing VGI. In turn, the second part introduces readers to essential methods, techniques and algorithms used to develop mobile information systems based on VGI for distinct Earth observation tasks, while the last part focuses on the drawbacks and limitations of VGI with regard to the above-mentioned tasks and proposes innovative methods and techniques to help overcome them. Given its breadth of coverage, the book offers a comprehensive, practice-oriented reference guide for researchers and practitioners in the field of geo-information management.
Handbook of Approximation Algorithms and Metaheuristics, Second Edition reflects the tremendous growth in the field, over the past two decades. Through contributions from leading experts, this handbook provides a comprehensive introduction to the underlying theory and methodologies, as well as the various applications of approximation algorithms and metaheuristics. Volume 1 of this two-volume set deals primarily with methodologies and traditional applications. It includes restriction, relaxation, local ratio, approximation schemes, randomization, tabu search, evolutionary computation, local search, neural networks, and other metaheuristics. It also explores multi-objective optimization, reoptimization, sensitivity analysis, and stability. Traditional applications covered include: bin packing, multi-dimensional packing, Steiner trees, traveling salesperson, scheduling, and related problems. Volume 2 focuses on the contemporary and emerging applications of methodologies to problems in combinatorial optimization, computational geometry and graphs problems, as well as in large-scale and emerging application areas. It includes approximation algorithms and heuristics for clustering, networks (sensor and wireless), communication, bioinformatics search, streams, virtual communities, and more. About the Editor Teofilo F. Gonzalez is a professor emeritus of computer science at the University of California, Santa Barbara. He completed his Ph.D. in 1975 from the University of Minnesota. He taught at the University of Oklahoma, the Pennsylvania State University, and the University of Texas at Dallas, before joining the UCSB computer science faculty in 1984. He spent sabbatical leaves at the Monterrey Institute of Technology and Higher Education and Utrecht University. He is known for his highly cited pioneering research in the hardness of approximation; for his sublinear and best possible approximation algorithm for k-tMM clustering; for introducing the open-shop scheduling problem as well as algorithms for its solution that have found applications in numerous research areas; as well as for his research on problems in the areas of job scheduling, graph algorithms, computational geometry, message communication, wire routing, etc.
This book constitutes the refereed proceedings of the 6th International Conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking, NEW2AN 2006, held in St. Petersburg, Russia in May/June 2006. The 49 revised full papers presented together with 2 keynote talks were carefully reviewed and selected from a total of 137 submissions. The papers are organized in topical sections on teletraffic, traffic characterization and modeling, 3G/UMTS, sensor networks, WLAN, QoS, MANETs, lower layer techniques, PAN technologies, and TCP.
