This book introduces oriented version of metrics and cuts and their multidimensional analogues, as well as partial metrics and weighted metrics. It is a follow-up of Geometry of Cuts and Metrics by Deza and Laurent which presents rich theory of classical binary and symmetric objects — metrics and cuts.Many research publications on this subject are devoted to different special aspects of the theory of generalized metrics. However, they are disconnected one from other, often written in different mathematical language, consider the same objects from different points of view without analysis of possible connections, etc. In this book we will construct full theory of main classes of finite generalized metrics and their polyhedral aspects.

The Handbook of Geometric Constraint Systems Principles is an entry point to the currently used principal mathematical and computational tools and techniques of the geometric constraint system (GCS). It functions as a single source containing the core principles and results, accessible to both beginners and experts. The handbook provides a guide for students learning basic concepts, as well as experts looking to pinpoint specific results or approaches in the broad landscape. As such, the editors created this handbook to serve as a useful tool for navigating the varied concepts, approaches and results found in GCS research. Key Features: A comprehensive reference handbook authored by top researchers Includes fundamentals and techniques from multiple perspectives that span several research communities Provides recent results and a graded program of open problems and conjectures Can be used for senior undergraduate or graduate topics course introduction to the area Detailed list of figures and tables About the Editors: Meera Sitharam is currently an Associate Professor at the University of Florida’s Department of Computer & Information Science and Engineering. She received her Ph.D. at the University of Wisconsin, Madison. Audrey St. John is an Associate Professor of Computer Science at Mount Holyoke College, who received her Ph. D. from UMass Amherst. Jessica Sidman is a Professor of Mathematics on the John S. Kennedy Foundation at Mount Holyoke College. She received her Ph.D. from the University of Michigan.

Physics and mathematics have always been closely intertwined, with developments in one field frequently inspiring the other. Currently, there are many unsolved problems in physics which will likely require innovations in mathematical physics. Mathematical physics is concerned with problems in statistical mechanics, atomic and molecular physics, quantum field theory, and, in general, with the mathematical foundations of theoretical physics. mechanics (both nonrelativistic and relativistic), atomic and molecular physics, the existence and properties of the phases of model ferromagnets, the stability of matter, the theory of symmetry and symmetry breaking in quantum field theory (both in general and in concrete models), and mathematical developments in functional analysis and algebra to which such subjects lead. This book presents leading-edge research in this fast-moving field. Structure of the Kalb-Ramond Gauge Symmetry and Spinor Representations; Group Theoretical Interpretation of CPT-Theorem; Cross Recurrence Plots and Their Applications; Analytical Solutions of the Radiative Transfer Equation in One-dimensional Spherical Geometry With Central Symmetry; Hyperspherical Functions and Harmonic Analysis on the Lorentz Group; The Next Stage: Quantum Game Theory; Index.

Cuts and metrics are well-known objects that arise - independently, but with many deep and fascinating connections - in diverse fields: in graph theory, combinatorial optimization, geometry of numbers, combinatorial matrix theory, statistical physics, VLSI design etc. This book presents a wealth of results, from different mathematical disciplines, in a unified comprehensive manner, and establishes new and old links, which cannot be found elsewhere. It provides a unique and invaluable source for researchers and graduate students. From the Reviews: "This book is definitely a milestone in the literature of integer programming and combinatorial optimization. It draws from the Interdisciplinarity of these fields [...]. With knowledge about the relevant terms, one can enjoy special subsections without being entirely familiar with the rest of the chapter. This makes it not only an interesting research book but even a dictionary. [...] The longer one works with it, the more beautiful it becomes." Optima 56, 1997.

This book comes out of need and urgency (expressed especially in areas of Information Retrieval with respect to Image, Audio, Internet and Biology) to have a working tool to compare data. The book will provide powerful resource for all researchers using Mathematics as well as for mathematicians themselves. In the time when over-specialization and terminology fences isolate researchers, this Dictionary try to be "centripedal" and "oikoumeni", providing some access and altitude of vision but without taking the route of scientific vulgarisation. This attempted balance is the main philosophy of this Dictionary which defined its structure and style. Key features: - Unicity: it is the first book treating the basic notion of Distance in whole generality. - Interdisciplinarity: this Dictionary is larger in scope than majority of thematic dictionaries. - Encyclopedicity: while an Encyclopedia of Distances seems now too difficult to produce, this book (by its scope, short introductions and organization) provides the main material for it and for future tutorials on some parts of this material. - Applicability: the distances, as well as distance-related notions and paradigms, are provided in ready-to-use fashion. - Worthiness: the need and urgency for such dictionary was great in several huge areas, esp. Information Retrieval, Image Analysis, Speech Recognition and Biology. - Accessibility: the definitions are easy to locate by subject or, in Index, by alphabetic order; the introductions and definitions are reader-friendly and maximally independent one from another; still the text is structured, in the 3D HTML style, by hyperlink-like boldfaced references to similar definitions. * Covers a large range of subjects in pure and applied mathematics * Designed to be easily applied--the distances and distance-related notions and paradigms are ready to use * Helps users quickly locate definitions by subject or in alphabetical order; stand-alone entries include references to other entries and sources for further investigation

Running to almost 400 pages, and featuring more than 40 papers, this work on combinatorial optimization and applications will be seen as an important addition to the literature. It constitutes the refereed proceedings of the first International Conference on Combinatorial Optimization and Applications, COCOA 2007, held in Xi'an, China in August of that year. The 29 revised full papers presented together with 8 invited papers and 2 invited presentations were carefully reviewed and selected from 114 submissions and cover both theoretical issues and practical applications.

The Handbook of Discrete and Computational Geometry is intended as a reference book fully accessible to nonspecialists as well as specialists, covering all major aspects of both fields. The book offers the most important results and methods in discrete and computational geometry to those who use them in their work, both in the academic world—as researchers in mathematics and computer science—and in the professional world—as practitioners in fields as diverse as operations research, molecular biology, and robotics. Discrete geometry has contributed significantly to the growth of discrete mathematics in recent years. This has been fueled partly by the advent of powerful computers and by the recent explosion of activity in the relatively young field of computational geometry. This synthesis between discrete and computational geometry lies at the heart of this Handbook. A growing list of application fields includes combinatorial optimization, computer-aided design, computer graphics, crystallography, data analysis, error-correcting codes, geographic information systems, motion planning, operations research, pattern recognition, robotics, solid modeling, and tomography.

Classical computer science textbooks tell us that some problems are 'hard'. Yet many areas, from machine learning and computer vision to theorem proving and software verification, have defined their own set of tools for effectively solving complex problems. Tractability provides an overview of these different techniques, and of the fundamental concepts and properties used to tame intractability. This book will help you understand what to do when facing a hard computational problem. Can the problem be modelled by convex, or submodular functions? Will the instances arising in practice be of low treewidth, or exhibit another specific graph structure that makes them easy? Is it acceptable to use scalable, but approximate algorithms? A wide range of approaches is presented through self-contained chapters written by authoritative researchers on each topic. As a reference on a core problem in computer science, this book will appeal to theoreticians and practitioners alike.

High-throughput sequencing and functional genomics technologies have given us the human genome sequence as well as those of other experimentally, medically, and agriculturally important species, thus enabling large-scale genotyping and gene expression profiling of human populations. Databases containing large numbers of sequences, polymorphisms, structures, metabolic pathways, and gene expression profiles of normal and diseased tissues are rapidly being generated for human and model organisms. Bioinformatics is therefore gaining importance in the annotation of genomic sequences; the understanding of the interplay among and between genes and proteins; the analysis of the genetic variability of species; the identification of pharmacological targets; and the inference of evolutionary origins, mechanisms, and relationships. This proceedings volume contains an up-to-date exchange of knowledge, ideas, and solutions to conceptual and practical issues of bioinformatics by researchers, professionals, and industry practitioners at the 6th Asia-Pacific Bioinformatics Conference held in Kyoto, Japan, in January 2008.

ICM 2010 proceedings comprises a four-volume set containing articles based on plenary lectures and invited section lectures, the Abel and Noether lectures, as well as contributions based on lectures delivered by the recipients of the Fields Medal, the Nevanlinna, and Chern Prizes. The first volume will also contain the speeches at the opening and closing ceremonies and other highlights of the Congress.