You may have to register before you can download all our books and magazines, click the sign up button below to create a free account.
Based on a graduate course at the Technische Universität, Berlin, these lectures present a wealth of material on the modern theory of convex polytopes. The straightforward exposition features many illustrations, and complete proofs for most theorems. With only linear algebra as a prerequisite, it takes the reader quickly from the basics to topics of recent research. The lectures introduce basic facts about polytopes, with an emphasis on methods that yield the results, discuss important examples and elegant constructions, and show the excitement of current work in the field. They will provide interesting and enjoyable reading for researchers as well as students.
The papers showcase the breadth of discrete geometry through many new methods and results in a variety of topics. Also included are survey articles on some important areas of active research. This volume is aimed at researchers in discrete and convex geometry and researchers who work with abstract polytopes or string C C-groups. It is also aimed at early career mathematicians, including graduate students and postdoctoral fellows, to give them a glimpse of the variety and beauty of these research areas. Topics covered in this volume include: the combinatorics, geometry, and symmetries of convex polytopes; tilings; discrete point sets; the combinatorics of Eulerian posets and interval posets; symmetries of surfaces and maps on surfaces; self-dual polytopes; string C C-groups; hypertopes; and graph coloring.
Presenting the state of the art, the Handbook of Enumerative Combinatorics brings together the work of today's most prominent researchers. The contributors survey the methods of combinatorial enumeration along with the most frequent applications of these methods.This important new work is edited by Miklos Bona of the University of Florida where he
The fledgling field of DNA computers began in 1994 when Leonard Adleman surprised the scientific community by using DNA molecules, protein enzymes, and chemicals to solve an instance of a hard computational problem. This volume presents results from the second annual meeting on DNA computers held at Princeton only one and one-half years after Adleman's discovery. By drawing on the analogy between DNA computing and cutting-edge fields of biology (such as directed evolution), this volume highlights some of the exciting progress in the field and builds a strong foundation for the theory of molecular computation.
A chronicle written only by someone for whom the present important. Goethe, Maximen und Reflexionen The second volume of our company's history differs from the first in several ways. With a great appreciation of history, Heinz Sarkowski has impressively reconstructed the company cor- spondence, which is fortunately almost completely preserved, and made it speak. * There is an inexhaustible amount of c- respondence pertaining to the period I have taken it upon myself to cover, and working through it properly not only would have required many years, but also would have detracted from the immediacy of the account. Thus, I decided to proceed from personal experience, to describe what has happene...
Threats to networks rather than from them are the concern of the ten papers. Theoretical and practical computer scientists examine such issues as network security, preventing and detecting attacks, modeling threats, risk management, threats to individual privacy, and methods of analyzing security. They include full implementation and development strategies using applications from the real-world, at least to the extent that the Internet, Web, Java, and so on are part of the real world. Suitable for a graduate seminar on computer security. No index. Annotation copyrighted by Book News, Inc., Portland, OR.
In these papers associated with the workshop of December 2003, contributors describe their work in fountain codes for lossless data compression, an application of coding theory to universal lossless source coding performance bounds, expander graphs and codes, multilevel expander codes, low parity check lattices, sparse factor graph representations of Reed-Solomon and related codes. Interpolation multiplicity assignment algorithms for algebraic soft- decision decoding of Reed-Solomon codes, the capacity of two- dimensional weight-constrained memories, networks of two-way channels, and a new approach to the design of digital communication systems. Annotation :2005 Book News, Inc., Portland, OR (booknews.com).
Twenty-four articles from the November 1996 workshop investigate the reconstruction of trees or ranking hierarchies from dissimilarity or entity-to-character data, the use of hierarchies for modeling evolution and other processes, and the combining of gene trees. Included are mathematical treatments of hierarchies in the frameworks of set systems, linear subspaces, graph objects, and tree metrics in their analyses. Such current applications as learning robots, intron evolution, and the development of language are addressed. Annotation copyrighted by Book News, Inc., Portland, OR.
Computer-Aided Design and Manufacturing (CAD/CAM) is concerned with all aspects of the process of designing, prototyping, manufacturing, inspecting, and maintaining complex geometric objects under computer control. As such, there is a natural synergy between this field and Computational Geometry (CG), which involves the design, analysis, implementation, and testing of efficient algorithms and data representation techniques for geometric entities such as points, polygons, polyhedra, curves, and surfaces. The DIMACS Center (Piscataway, NJ) sponsored a workshop to further promote the interaction between these two fields. Attendees from academia, research laboratories, and industry took part in the invited talks, contributed presentations, and informal discussions. This volume is an outgrowth of that meeting.