You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This is a most unusual book. For several decades Xi Xi has been widely known for her award-winning poetry and fiction. This time, she has chosen to write about the teddy bears she began making in 2005, after treatment for cancer, in order to improve the mobility of her right hand. She made the bears herself from scratch, choosing some of her favourite characters from history and legend such as the Taoist philosopher Master Zhuang, the Mongol ruler Genghis Khan, and Beauty and the Beast. She also created exquisite items of clothing for them and wove a series of delightfully witty essays around them, giving her readers fascinating insights into Chinese culture, and into the ways in which Chinese clothing and fashion have evolved through the ages. This is a book for all who love literature and teddy bears.
A complete treatment of Aeneid XI, with a thorough introduction to key characters, context, and metre, and a detailed line-by-line commentary which will aid readers' understanding of Virgil's language and syntax. Indispensable for students and instructors reading this important book, which includes the funeral of Pallas and the death of Camilla.
These short, simple journeys into life in Hong Kong and Taiwan show bright patches of emotion in an otherwise bleak universe.
Comprehensive and thorough development of both probability and statistics for serious computer scientists; goal-oriented: "to present the mathematical analysis underlying probability results" Special emphases on simulation and discrete decision theory Mathematically-rich, but self-contained text, at a gentle pace Review of calculus and linear algebra in an appendix Mathematical interludes (in each chapter) which examine mathematical techniques in the context of probabilistic or statistical importance Numerous section exercises, summaries, historical notes, and Further Readings for reinforcement of content
A revealing biography of the man making China his own.
The papers in this volume were selected for presentation at the Eleventh Annual International Symposium on Algorithms and Computation (ISAAC 2000), held on 18{20 December, 2000 at the Institute of Information Science, Academia Sinica, Taipei, Taiwan. Previous meetings were held in Tokyo (1990), Taipei (1991), Nagoya (1992), Hong Kong (1993), Beijing (1994), Cairns (1995), Osaka (1996), Singapore (1997), Taejon (1998), and Chennai (1999). Submissions to the conference this year were conducted entirely electro- cally. Thanks to the excellent software developed by the Institute of Information Science, Academia Sinica, we were able to carry out virtually all communication via the World Wide Web....
This text describes a series of models, propositions, and algorithms developed in recent years on time-varying networks. References and discussions on relevant problems and studies that have appeared in the literature are integrated in the book. Its eight chapters consider problems including the shortest path problem, the minimum-spanning tree problem, the maximum flow problem, and many more. The time-varying traveling salesman problem and the Chinese postman problem are presented in a chapter together with the time-varying generalized problem. While these topics are examined within the framework of time-varying networks, each chapter is self-contained so that each can be read – and used – separately.
This book aims to develop algorithms of shape-preserving spline approximation for curves/surfaces with automatic choice of the tension parameters. The resulting curves/surfaces retain geometric properties of the initial data, such as positivity, monotonicity, convexity, linear and planar sections. The main tools used are generalized tension splines and B-splines. A difference method for constructing tension splines is also developed which permits one to avoid the computation of hyperbolic functions and provides other computational advantages. The algorithms of monotonizing parametrization described improve an adequate representation of the resulting shape-preserving curves/surfaces. Detailed descriptions of algorithms are given, with a strong emphasis on their computer implementation. These algorithms can be applied to solve many problems in computer-aided geometric design.
Numerical Methods for Roots of Polynomials - Part II along with Part I (9780444527295) covers most of the traditional methods for polynomial root-finding such as interpolation and methods due to Graeffe, Laguerre, and Jenkins and Traub. It includes many other methods and topics as well and has a chapter devoted to certain modern virtually optimal methods. Additionally, there are pointers to robust and efficient programs. This book is invaluable to anyone doing research in polynomial roots, or teaching a graduate course on that topic. - First comprehensive treatment of Root-Finding in several decades with a description of high-grade software and where it can be downloaded - Offers a long chapter on matrix methods and includes Parallel methods and errors where appropriate - Proves invaluable for research or graduate course
An anthology of Chinese fiction, poetry, and essays written during the twentieth and twenty-first centuries.