Donald R. Woods

"This is a delightful little paperback which presents a day-by-day transcription of a course taught jointly by Pólya and Tarjan at Stanford University. Woods, the teaching assistant for the class, did a very good job of merging class notes into an interesting mini-textbook; he also included the exercises, homework, and tests assigned in the class (a very helpful addition for other instructors in the field). The notes are very well illustrated throughout and Woods and the Birkhäuser publishers produced a very pleasant text. One can count on [Pólya and Tarjan] for new insights and a fresh outlook. Both instructors taught by presenting a succession of examples rather than by presenting a body of theory…[The book] is very well suited as supplementary material for any introductory class on combinatorics; as such, it is very highly recommended. Finally, for all of us who like the topic and delight in observing skilled professionals at work, this book is entertaining and, yes, instructive, reading." Mathematical Reviews (Review of the original hardcover edition) "The mathematical community welcomes this book as a final contribution to honour the teacher G. Pólya." Zentralblatt MATH (Review of the original hardcover edition)

An immense treasure trove containing hundreds of equipment symptoms, arranged so as to allow swift identification and elimination of the causes. These rules of thumb are the result of preserving and structuring the immense knowledge of experienced engineers collected and compiled by the author - an experienced engineer himself - into an invaluable book that helps younger engineers find their way from symptoms to causes. This sourcebook is unrivalled in its depth and breadth of coverage, listing five important aspects for each piece of equipment: * area of application * sizing guidelines * capital cost including difficult-to-find installation factors * principles of good practice, and * good approaches to troubleshooting. Extensive cross-referencing takes into account that some items of equipment are used for many different purposes, and covers not only the most familiar types, but special care has been taken to also include less common ones. Consistent terminology and SI units are used throughout the book, while a detailed index quickly and reliably directs readers, thus aiding engineers in their everyday work at chemical plants: from keywords to solutions in a matter of minutes.

Chemical production processes consist of many complex apparatuses involving both moving and static parts as well as interconnecting pipes, control mechanisms and electronics, mechanical and thermal stages, heat exchangers, waste and side product processing units, power ducts and many others. Bringing such a complicated unit online and ensuring its continued productivity requires substantial skill at anticipating, detecting and solving acute problems. This book is the professional's and student's entrance to the fascinating and important world of trouble shooting for chemical, pharmaceutical and other production processes.

In the winter of 1978, Professor George P61ya and I jointly taught Stanford University's introductory combinatorics course. This was a great opportunity for me, as I had known of Professor P61ya since having read his classic book, How to Solve It, as a teenager. Working with P6lya, who ·was over ninety years old at the time, was every bit as rewarding as I had hoped it would be. His creativity, intelligence, warmth and generosity of spirit, and wonderful gift for teaching continue to be an inspiration to me. Combinatorics is one of the branches of mathematics that play a crucial role in computer sCience, since digital computers manipulate discrete, finite objects. Combinatorics impinges on computing in two ways. First, the properties of graphs and other combinatorial objects lead directly to algorithms for solving graph-theoretic problems, which have widespread application in non-numerical as well as in numerical computing. Second, combinatorial methods provide many analytical tools that can be used for determining the worst-case and expected performance of computer algorithms. A knowledge of combinatorics will serve the computer scientist well. Combinatorics can be classified into three types: enumerative, eXistential, and constructive. Enumerative combinatorics deals with the counting of combinatorial objects. Existential combinatorics studies the existence or nonexistence of combinatorial configurations.