Tetsuo Asano

Takao Asano

Satoru Miyano

Yoshihide Igarashi

Hiroshi Nagamochi

Subhash Suri

Today the cemented joint prosthesis operation is one of the most frequent procedures in orthopaedic surgery. During the past 30 years the individual steps of such an operation have been carefully validated and thus allow for a reproducible and standardized operation, including a reliable prognosis for the maintenance of the joint. This manual is a practical guide to a complication preventing cementing technique, cement fixation, maintenance of the bone and diamond technique. Clear drawings and diagrams guide the reader through the pre-operative, peri-operative and post-operative steps. The manual covers all possible complications and gives clear instructions, so as to prevent complications but also to cope with them if they occur. Finally, it covers all forensic criteria to be considered.

7th International Symposium, ISAAC '96, Osaka, Japan, December 16 - 18, 1996, Proceedings

Algorithms and Computation

Hiroshi Imai

D.T. Lee

Shin-ichi Nakano

Takeshi Tokuyama

The abstracts and papers in this volume were presented at the Fifth Annual International Computing and Combinatorics Conference (COCOON ’99), which was held in Tokyo, Japan from July 26 to 28, 1999. The topics cover most aspects of theoretical computer science and combinatorics pertaining to computing. In response to the call for papers, 88 high-quality extended abstracts were submitted internationally, of which 46 were selected for presentation by the p- gram committee. Every submitted paper was reviewed by at least three program committee members. Many of these papers represent reports on continuing - search, and it is expected that most of them will appear in a more polished and complete form in scienti c journals. In addition to the regular papers, this v- ume contains abstracts of two invited plenary talks by Prabhakar Raghavan and Seinosuke Toda. The conference also included a special talk by Kurt Mehlhorn on LEDA (Library of E cient Data types and Algorithms). The Hao Wang Award (inaugurated at COCOON ’97) is given to honor the paper judged by the program committee to have the greatest scienti c merit. The recipients of the Hao Wang Award 1999 were Hiroshi Nagamochi and Tos- hide Ibaraki for their paper \An Approximation for Finding a Smallest 2-Edge- Connected Subgraph Containing a Speci ed Spanning Tree".

5th Annual International Conference, COCOON'99, Tokyo, Japan, July 26-28, 1999, Proceedings

Computing and Combinatorics

This book constitutes the refereed proceedings of the First International Workshop on Machine Learning and Data Mining in Pattern Recognition, MLDM'99, held in Leipzig, Germany in September 1999. The 15 revised full papers presented together with two invited contributions were carefully reviewed. The papers are organized in sections on neural networks applied to image processing and recognition, learning in image pre-processing and segmentation, image retrieval, classification and image interpretation, symbolic learning and neural networks in document processing, and data mining.

Takao Asano

Books

Your next favorite book is out there