The Blue Edge

The author returns to the bountiful Sea of Cortez he knew decades ago, and finds it empty.

The Edgar Award–winning debut of the bestselling Max Freeman mystery series: A tormented ex-cop’s mission to solve a grisly murder and earn redemption for his dark past After a shootout during a convenience store holdup led to the accidental death of a twelve-year-old, Max Freeman left behind the Philadelphia police department for a life in exile in the Florida Everglades. Since then, he has lived in seclusion, haunted by guilt, with the humid night and the nocturnal predators of the swamp as his only company. But everything changes when Freeman discovers a young girl’s body floating in the muddy waters and becomes the prime suspect for her murder. To prove his innocence, Freeman must uncover the real murderer—and confront his own tortured soul—before it’s too late. This ebook contains an illustrated biography of the author featuring never-before-seen photos.

The study of combinatorial block designs is a vibrant area of combinatorial mathematics with connections to finite geometries, graph theory, coding theory and statistics. The practice of ordering combinatorial objects can trace its roots to bell ringing which originated in 17th century England, but only emerged as a significant modern research area with the work of F. Gray and N. de Bruijn. These two fascinating areas of mathematics are brought together for the first time in this book. It presents new terminology and concepts which unify existing and recent results from a wide variety of sources. In order to provide a complete introduction and survey, the book begins with background material on combinatorial block designs and combinatorial orderings, including Gray codes -- the most common and well-studied combinatorial ordering concept -- and universal cycles. The central chapter discusses how ordering concepts can be applied to block designs, with definitions from existing (configuration orderings) and new (Gray codes and universal cycles for designs) research. Two chapters are devoted to a survey of results in the field, including illustrative proofs and examples. The book concludes with a discussion of connections to a broad range of applications in computer science, engineering and statistics. This book will appeal to both graduate students and researchers. Each chapter contains worked examples and proofs, complete reference lists, exercises and a list of conjectures and open problems. Practitioners will also find the book appealing for its accessible, self-contained introduction to the mathematics behind the applications.

This book constitutes the refereed proceedings of the 13th Annual European Symposium on Algorithms, ESA 2005, held in Palma de Mallorca, Spain, in September 2005 in the context of the combined conference ALGO 2005. The 75 revised full papers presented together with abstracts of 3 invited lectures were carefully reviewed and selected from 244 submissions. The papers address all current issues in algorithmics reaching from design and mathematical issues over real-world applications in various fields up to engineering and analysis of algorithms.

The European Workshop on White Dwarfs was initiated by Prof. V. Weidemann, with the first meeting organized in Kiel (FRG) in 1974. Almost every two years, an increasing number of astronomers met to share their results and projects in the subsequent workshops: Frascati (1976), Tel Aviv (1978), Paris (1981), Kiel (1984), Frascati (1986). In the mean time, two major IAU colloquia (No. 53 in Rochester, NY, 1979; and No. 114 in Hanover, NH, 1988) emphasized the importance of these stars for our understanding of stellar evolution. The informal organization of the white dwarf community has been the starting point for large cooperative projects of which the Hubble Space Telescope "White Dwarf Consortium" and the "Whole Earth Telescope" are the most spectacular examples. But many other successful collaborations have also been born during the very exciting discussions conducted in the last 16 years on the occasion of our regular meetings. The 7th European Workshop on White Dwarfs took place the year of the seventieth birthday of Prof. Evry Schatzman, whose pioneering work has been the inspiration for many of the new ideas in the white dwarf community. The Scientific Organizing Committee has agreed to dedicate the workshop to him on this occasion. We are pleased to publish as an introduction to the workshop, the text of the talk delivered by Prof. Schatzman at the workshop's banquet.

Annotation Constituting the refereed proceedings of the 12th Algorithms and Data Structures Symposium held in New York in August 2011, this text presents original research on the theory and application of algorithms and data structures in all areas, including combinatorics, computational geometry and databases.

Electrical, communication, transportation, computer, and neural networks are special kinds of nets. Designing these networks demands sophisticated mathematical models for their analysis. This book is the first to present a unified, comprehensive, and up-to-date treatment of net theory. It brings together elements of abstract graph theory and circuit analysis to network problems. Contents: Graphs and NetworksThe Shortest Directed Path ProblemMaximum Flows in NetworksMinimum Trees and Communication NetsFeasibility Theorems and Their ApplicationsApplications of Flow Theorems to Subgraph ProblemsSignal-Flow GraphsOther Net Applications Readership: Graduate students in electrical and electronic engineering.

Crossing Numbers of Graphs is the first book devoted to the crossing number, an increasingly popular object of study with surprising connections. The field has matured into a large body of work, which includes identifiable core results and techniques. The book presents a wide variety of ideas and techniques in topological graph theory, discrete geometry, and computer science. The first part of the text deals with traditional crossing number, crossing number values, crossing lemma, related parameters, computational complexity, and algorithms. The second part includes the rich history of alternative crossing numbers, the rectilinear crossing number, the pair crossing number, and the independent odd crossing number.It also includes applications of the crossing number outside topological graph theory. Aimed at graduate students and professionals in both mathematics and computer science The first book of its kind devoted to the topic Authored by a noted authority in crossing numbers