Kirjahaku

At the age of fifteen, shattered by the sudden death of his girlfriend Grace, Charles Bentchley flees his Connecticut home and takes to the road. He finds refuge with the Magnificent Rudy, a traveling magician who for the next seven years teaches Charles the tricks of his trade. But with Rudy's death Charles has no place to go but home. As he confronts his loss of Grace and his brother's role in it, he must come to grips not only with his brother's betrayal, but with his own mistakes and guilt, finding his way beyond loss and anger toward new love and redemption. In this lucid, concise, and beautiful penetration of character, D. K. Smith has written a synthesis of narrative and idea that never ceases to be a superior entertainment as well.

This is the story of Harry Bailey and his attempts to repair a life that has come undone. He has been living with his father since his mother walked out on them both six years before, and together they have sunk into a lonely routine. But their humdrum habits are suddenly disrupted when the elder Bailey begins dating a woman half his age. As Harry gets drawn back into the surprises of a rediscovered life, he grows increasingly preoccupied both with his father's happiness and with Mona, the woman responsible.

Since its first printing in 1976, Cementing has served as a valuable handbook for new and experienced engineers alike. This monograph presents a review of the technical literature on cementing, along with a discussion of basic principles and techniques. It is designed to provide basic knowledge to those who are not directly involved in cementing and a comprehensive review to those who are more familiar with the subject. This book is designed to provide information about a state-of-the-art treatment of the fundamental principles in a select field of technology.

Dr Smith here presents essential mathematical and computational ideas of network optimisation for senior undergraduate and postgraduate students in mathematics, computer science and operational research. He shows how algorithms can be used for finding optimal paths and flows, identifying trees in networks, and optimal matching. Later chapters discuss postman and salesperson tours, and demonstrate how many network problems are related to the ‘‘minimal-cost feasible-flow’’ problem. Techniques are presented both informally and with mathematical rigour and aspects of computation, especially of complexity, have been included. Numerous examples and diagrams illustrate the techniques and applications. The book also includes problem exercises with tutorial hints.