Part of Tsinghua University Texts, "Statistical Properties of Deterministic Systems" discusses the fundamental theory and computational methods of the statistical properties of deterministic discrete dynamical systems. After introducing some basic results from ergodic theory, two problems related to the dynamical system are studied: first the existence of absolute continuous invariant measures, and then their computation. They correspond to the functional analysis and numerical analysis of the Frobenius-Perron operator associated with the dynamical system.

The nature of the physical Universe has been increasingly better understood in recent years, and cosmological concepts have undergone a rapid evolution (see, e.g., [11], [2],or [5]).

This is the second part of a two volume anthology comprising a selection of 49 articles that illustrate the depth, breadth and scope of Nigel Kalton’s research. Each article is accompanied by comments from an expert on the respective topic, which serves to situate the article in its proper context, to successfully link past, present and hopefully future developments of the theory and to help readers grasp the extent of Kalton’s accomplishments. Kalton’s work represents a bridge to the mathematics of tomorrow, and this book will help readers to cross it.

This is the second part of a two volume anthology comprising a selection of 49 articles that illustrate the depth, breadth and scope of Nigel Kalton’s research. Each article is accompanied by comments from an expert on the respective topic, which serves to situate the article in its proper context, to successfully link past, present and hopefully future developments of the theory and to help readers grasp the extent of Kalton’s accomplishments. Kalton’s work represents a bridge to the mathematics of tomorrow, and this book will help readers to cross it.

The book introduces new techniques that imply rigorous lower bounds on the com­ plexity of some number-theoretic and cryptographic problems. It also establishes certain attractive pseudorandom properties of various cryptographic primitives. These methods and techniques are based on bounds of character sums and num­ bers of solutions of some polynomial equations over finite fields and residue rings. Other number theoretic techniques such as sieve methods and lattice reduction algorithms are used as well. The book also contains a number of open problems and proposals for further research. The emphasis is on obtaining unconditional rigorously proved statements. The bright side of this approach is that the results do not depend on any assumptions or conjectures. On the downside, the results are much weaker than those which are widely believed to be true. We obtain several lower bounds, exponential in terms of logp, on the degrees and orders of o polynomials; o algebraic functions; o Boolean functions; o linear recurrence sequences; coinciding with values of the discrete logarithm modulo a prime p at sufficiently many points (the number of points can be as small as pI/2+O:). These functions are considered over the residue ring modulo p and over the residue ring modulo an arbitrary divisor d of p - 1. The case of d = 2 is of special interest since it corresponds to the representation of the rightmost bit of the discrete logarithm and defines whether the argument is a quadratic residue.

This monograph concerns the development, analysis, and application of the theory of pseudo-rigid bodies. It collects together our work on that subject over the last five years. While some results have appeared else­ where, much of the work is new. Our objective in writing this mono­ graph has been to present a new theory of the deformation of bodies, one that has not only a firm theoretical basis, but also the simplicity to serve as an effective tool in practical problems. Consequently, the main body of the treatise is a multifaceted development of the theory, from foundations to explicit solutions to linearizations to methods of approximation. The fact that this variety of aspects, each examined in considerable detail, can be collected together in a single, unified treat­ ment gives this theory an elegance that we feel sets it apart from many others. While our goal has always been to give a complete treatment of the theory as it now stands, the work here is not meant to be definitive. Theories are not entities that appear suddenly one day and thereafter stand as given. Rather, they must mature and grow with time and experience. Our development is more correctly a beginning, tempting others to explore, appraise, and modify its features so as to produce something better.

The Encyclopedia of Algorithms will provide a comprehensive set of solutions to important algorithmic problems for students and researchers interested in quickly locating useful information. The first edition of the reference will focus on high-impact solutions from the most recent decade; later editions will widen the scope of the work.

For some fields such as econometrics (Shore, 1980), oil prospecting (Claerbout, 1976), speech recognition (Levinson and Lieberman, 1981), satellite monitoring (Lavergnat et al., 1980), epilepsy diagnosis (Gersch and Tharp, 1977), and plasma physics (Bloomfield, 1976), there is a need to obtain an estimate of the spectral density (when it exists) in order to gain at least a crude understanding of the frequency content of time series data. An outstanding tutorial on the classical problem of spectral density estimation is given by Kay and Marple (1981). For an excellent collection of fundamental papers dealing with modern spec­ tral density estimation as well as an extensive bibliography on other fields of application, see Childers (1978). To devise a high-performance sample spectral density estimator, one must develop a rational basis for its construction, provide a feasible algorithm, and demonstrate its performance with respect to prescribed criteria. An algorithm is certainly feasible if it can be implemented on a computer, possesses computational efficiency (as measured by compu­ tational complexity analysis), and exhibits numerical stability. An estimator shows high performance if it is insensitive to violations of its underlying assumptions (i.e., robust), consistently shows excellent frequency resolutipn under realistic sample sizes and signal-to-noise power ratios, possesses a demonstrable numerical rate of convergence to the true population spectral density, and/or enjoys demonstrable asymp­ totic statistical properties such as consistency and efficiency.

This is the second part of a two volume anthology comprising a selection of 49 articles that illustrate the depth, breadth and scope of Nigel Kalton’s research. Each article is accompanied by comments from an expert on the respective topic, which serves to situate the article in its proper context, to successfully link past, present and hopefully future developments of the theory and to help readers grasp the extent of Kalton’s accomplishments. Kalton’s work represents a bridge to the mathematics of tomorrow, and this book will help readers to cross it.

This IMA Volume in Mathematics and its Applications ALGORITHMS FOR PARALLEL PROCESSING is based on the proceedings of a workshop that was an integral part of the 1996-97 IMA program on "MATHEMATICS IN HIGH-PERFORMANCE COMPUTING. " The workshop brought together algorithm developers from theory, combinatorics, and scientific computing. The topics ranged over models, linear algebra, sorting, randomization, and graph algorithms and their analysis. We thank Michael T. Heath of University of lllinois at Urbana (Com­ puter Science), Abhiram Ranade of the Indian Institute of Technology (Computer Science and Engineering), and Robert S. Schreiber of Hewlett­ Packard Laboratories for their excellent work in organizing the workshop and editing the proceedings. We also take this opportunity to thank the National Science Founda­ tion (NSF) and the Army Research Office (ARO), whose financial support made the workshop possible. A vner Friedman Robert Gulliver v PREFACE The Workshop on Algorithms for Parallel Processing was held at the IMA September 16 - 20, 1996; it was the first workshop of the IMA year dedicated to the mathematics of high performance computing. The work­ shop organizers were Abhiram Ranade of The Indian Institute of Tech­ nology, Bombay, Michael Heath of the University of Illinois, and Robert Schreiber of Hewlett Packard Laboratories. Our idea was to bring together researchers who do innovative, exciting, parallel algorithms research on a wide range of topics, and by sharing insights, problems, tools, and methods to learn something of value from one another.

This is the second part of a two volume anthology comprising a selection of 49 articles that illustrate the depth, breadth and scope of Nigel Kalton’s research. Each article is accompanied by comments from an expert on the respective topic, which serves to situate the article in its proper context, to successfully link past, present and hopefully future developments of the theory and to help readers grasp the extent of Kalton’s accomplishments. Kalton’s work represents a bridge to the mathematics of tomorrow, and this book will help readers to cross it.

This second edition of Probability With Statistical Applications offers a practical introduction to probability for undergraduates at all levels with different backgrounds and views towards applications. Calculus is a prerequisite for understanding the basic concepts, however the book is written with a sensitivity to students’ common difficulties with calculus that does not obscure the thorough treatment of the probability content. The first six chapters of this text neatly and concisely cover the material traditionally required by most undergraduate programs for a first course in probability.

This is the second part of a two volume anthology comprising a selection of 49 articles that illustrate the depth, breadth and scope of Nigel Kalton’s research. Each article is accompanied by comments from an expert on the respective topic, which serves to situate the article in its proper context, to successfully link past, present and hopefully future developments of the theory and to help readers grasp the extent of Kalton’s accomplishments. Kalton’s work represents a bridge to the mathematics of tomorrow, and this book will help readers to cross it.

This is the second part of a two volume anthology comprising a selection of 49 articles that illustrate the depth, breadth and scope of Nigel Kalton’s research. Each article is accompanied by comments from an expert on the respective topic, which serves to situate the article in its proper context, to successfully link past, present and hopefully future developments of the theory and to help readers grasp the extent of Kalton’s accomplishments. Kalton’s work represents a bridge to the mathematics of tomorrow, and this book will help readers to cross it.