This monograph describes global propagation of regular nonlinear hyperbolic waves described by first-order quasilinear hyperbolic systems in one dimension. The exposition is clear, concise, and unfolds systematically beginning with introductory material and leading to the original research of the authors. Topics are motivated with a number of physical examples from the areas of elastic materials, one-dimensional gas dynamics, and waves. Aimed at researchers and graduate students in partial differential equations and related topics, this book will stimulate further research and help readers further understand important aspects and recent progress of regular nonlinear hyperbolic waves.

The statistical analysis of discrete multivariate data has received a great deal of attention in the statistics literature over the past two decades. The develop ment ofappropriate models is the common theme of books such as Cox (1970), Haberman (1974, 1978, 1979), Bishop et al. (1975), Gokhale and Kullback (1978), Upton (1978), Fienberg (1980), Plackett (1981), Agresti (1984), Goodman (1984), and Freeman (1987). The objective of our book differs from those listed above. Rather than concentrating on model building, our intention is to describe and assess the goodness-of-fit statistics used in the model verification part of the inference process. Those books that emphasize model development tend to assume that the model can be tested with one of the traditional goodness-of-fit tests 2 2 (e.g., Pearson's X or the loglikelihood ratio G ) using a chi-squared critical value. However, it is well known that this can give a poor approximation in many circumstances. This book provides the reader with a unified analysis of the traditional goodness-of-fit tests, describing their behavior and relative merits as well as introducing some new test statistics. The power-divergence family of statistics (Cressie and Read, 1984) is used to link the traditional test statistics through a single real-valued parameter, and provides a way to consolidate and extend the current fragmented literature. As a by-product of our analysis, a new 2 2 statistic emerges "between" Pearson's X and the loglikelihood ratio G that has some valuable properties."

This monograph develops a framework for modeling and solving utility maximization problems in nonconvex wireless systems. The first part develops a model for utility optimization in wireless systems. The model is general enough to encompass a wide array of system configurations and performance objectives. Based on the general model, a set of methods for solving utility maximization problems is developed in the second part of the book. The development is based on a careful examination of the properties that are required for the application of each method. This part focuses on problems whose initial formulation does not allow for a solution by standard methods and discusses alternative approaches. The last part presents two case studies to demonstrate the application of the proposed framework. In both cases, utility maximization in multi-antenna broadcast channels is investigated.

At the heart of the topology of global optimization lies Morse Theory: The study of the behaviour of lower level sets of functions as the level varies. Roughly speaking, the topology of lower level sets only may change when passing a level which corresponds to a stationary point (or Karush-Kuhn Tucker point). We study elements of Morse Theory, both in the unconstrained and constrained case. Special attention is paid to the degree of differentiabil ity of the functions under consideration. The reader will become motivated to discuss the possible shapes and forms of functions that may possibly arise within a given problem framework. In a separate chapter we show how certain ideas may be carried over to nonsmooth items, such as problems of Chebyshev approximation type. We made this choice in order to show that a good under standing of regular smooth problems may lead to a straightforward treatment of "just" continuous problems by means of suitable perturbation techniques, taking a priori nonsmoothness into account. Moreover, we make a focal point analysis in order to emphasize the difference between inner product norms and, for example, the maximum norm. Then, specific tools from algebraic topol ogy, in particular homology theory, are treated in some detail. However, this development is carried out only as far as it is needed to understand the relation between critical points of a function on a manifold with structured boundary. Then, we pay attention to three important subjects in nonlinear optimization."

The technique of randomization has been employed to solve numerous prob lems of computing both sequentially and in parallel. Examples of randomized algorithms that are asymptotically better than their deterministic counterparts in solving various fundamental problems abound. Randomized algorithms have the advantages of simplicity and better performance both in theory and often is a collection of articles written by renowned experts in practice. This book in the area of randomized parallel computing. A brief introduction to randomized algorithms In the analysis of algorithms, at least three different measures of performance can be used: the best case, the worst case, and the average case. Often, the average case run time of an algorithm is much smaller than the worst case. 2 For instance, the worst case run time of Hoare's quicksort is O(n ), whereas its average case run time is only O(nlogn). The average case analysis is conducted with an assumption on the input space. The assumption made to arrive at the O(n logn) average run time for quicksort is that each input permutation is equally likely. Clearly, any average case analysis is only as good as how valid the assumption made on the input space is. Randomized algorithms achieve superior performances without making any assumptions on the inputs by making coin flips within the algorithm. Any analysis done of randomized algorithms will be valid for all possible inputs.

The use of the internet for commerce has spawned a variety of auctions, marketplaces, and exchanges for trading everything from bandwidth to books. Mechanisms for bidding agents, dynamic pricing, and combinatorial bids are being implemented in support of internet-based auctions, giving rise to new versions of optimization and resource allocation models. This volume, a collection of papers from an IMA "Hot Topics" workshop in internet auctions, includes descriptions of real and proposed auctions, complete with mathematical model formulations, theoretical results, solution approaches, and computational studies. This volume also provides a mathematical programming perspective on open questions in auction theory, and provides a glimpse of the growing area of dynamic pricing.

Unique in that it focuses on formulation and case studies rather than solutions procedures covering applications for pure, generalized and integer networks, equivalent formulations plus successful techniques of network models. Every chapter contains a simple model which is expanded to handle more complicated developments, a synopsis of existing applications, one or more case studies, at least 20 exercises and invaluable references.
An Instructor's Manual presenting detailed solutions to all the problems in the book is available upon request from the Wiley editorial department.

Decision makers in managerial and public organizations often encounter de cision problems under conflict or competition, because they select strategies independently or by mutual agreement and therefore their payoffs are then affected by the strategies of the other decision makers. Their interests do not always coincide and are at times even completely opposed. Competition or partial cooperation among decision makers should be considered as an essen tial part of the problem when we deal with the decision making problems in organizations which consist of decision makers with conflicting interests. Game theory has been dealing with such problems and its techniques have been used as powerful analytical tools in the resolution process of the decision problems. The publication of the great work by J. von Neumann and O. Morgen stern in 1944 attracted attention of many people and laid the foundation of game theory. We can see remarkable advances in the field of game theory for analysis of economic situations and a number of books in the field have been published in recent years. The aim of game theory is to specify the behavior of each player so as to optimize the interests of the player. It then recommends a set of solutions as strategies so that the actions chosen by each decision maker (player) lead to an outcome most profitable for himself or her self."

This volume is devoted to the most recent discoveries in mathematics and statistics. It also serves as a platform for knowledge and information exchange between experts from industrial and academic sectors. The book covers a wide range of topics, including mathematical analyses, probability, statistics, algebra, geometry, mathematical physics, wave propagation, stochastic processes, ordinary and partial differential equations, boundary value problems, linear operators, cybernetics and number and functional theory. It is a valuable resource for pure and applied mathematicians, statisticians, engineers and scientists.

This superb explication of a complex subject presents the current state of the art of the mathematical theory of symmetric functionals on random matrices. It emphasizes its connection with the statistical non-parametric estimation theory. The book provides a detailed description of the approach of symmetric function decompositions to the asymptotic theory of symmetric functionals, including the classical theory of U-statistics. It also presents applications of the theory.

This volume constitutes a comprehensive self-contained course on source encoding. This is a rapidly developing field and the purpose of this book is to present the theory from its beginnings to the latest developments, some of which appear in book form for the first time. The major differences between this volume and previously published works is that here information retrieval is incorporated into source coding instead of discussing it separately. Second, this volume places an emphasis on the trade-off between complexity and the quality of coding; i.e. what is the price of achieving a maximum degree of data compression? Third, special attention is paid to universal families which contain a good compressing map for every source in a set. The volume presents a new algorithm for retrieval, which is optimal with respect to both program length and running time, and algorithms for hashing and adaptive on-line compressing. All the main tools of source coding and data compression such as Shannon, Ziv--Lempel, Gilbert--Moore codes, Kolmogorov complexity epsilon-entropy, lexicographic and digital search, are discussed. Moreover, data compression methods are described for developing short programs for partially specified Boolean functions, short formulas for threshold functions, identification keys, stochastic algorithms for finding the occurrence of a word in a text, and T-independent sets. For researchers and graduate students of information theory and theoretical computer science. The book will also serve as a useful reference for communication engineers and database designers.

Most interesting and difficult problems in equilibrium statistical mechanics concern models which exhibit phase transitions. For graduate students and more experienced researchers this book provides an invaluable reference source of approximate and exact solutions for a comprehensive range of such models. Part I contains background material on classical thermodynamics and statistical mechanics, together with a classification and survey of lattice models. The geometry of phase transitions is described and scaling theory is used to introduce critical exponents and scaling laws. An introduction is given to finite-size scaling, conformal invariance and Schramm-Loewner evolution. Part II contains accounts of classical mean-field methods. The parallels between Landau expansions and catastrophe theory are discussed and Ginzburg--Landau theory is introduced. The extension of mean-field theory to higher-orders is explored using the Kikuchi--Hijmans--De Boer hierarchy of approximations. In Part III the use of algebraic, transformation and decoration methods to obtain exact system information is considered. This is followed by an account of the use of transfer matrices for the location of incipient phase transitions in one-dimensionally infinite models and for exact solutions for two-dimensionally infinite systems. The latter is applied to a general analysis of eight-vertex models yielding as special cases the two-dimensional Ising model and the six-vertex model. The treatment of exact results ends with a discussion of dimer models. In Part IV series methods and real-space renormalization group transformations are discussed. The use of the De Neef-Enting finite-lattice method is described in detail and applied to the derivation of series for a number of model systems, in particular for the Potts model. The use of Pad\'e, differential and algebraic approximants to locate and analyze second- and first-order transitions is described. The realization of the ideas of scaling theory by the renormalization group is presented together with treatments of various approximation schemes including phenomenological renormalization. Part V of the book contains a collection of mathematical appendices intended to minimise the need to refer to other mathematical sources.

By far the best-selling introduction to statistics for students in the behavioral and social sciences, this text continues to offer straightforward instruction, accuracy, built-in learning aids, and real-world examples. The goal of STATISTICS FOR THE BEHAVIORAL SCIENCES, International Edition is to not only teach the methods of statistics, but also to convey the basic principles of objectivity and logic that are essential for science and valuable in everyday life. Authors Frederick Gravetter and Larry Wallnau help students understand statistical procedures through a conceptual context that explains why the procedures were developed and when they should be used. Students have numerous opportunities to practice statistical techniques through Learning Checks, examples, step-by-step Demonstrations, and problems. A strong ancillary package includes PowerLecture (TM), which contains lecture slides, JoinIn (TM) Student Response System content, and a computerized test bank; Enhanced WebAssign, a complete and easy-to-use homework management system; WebTutor (TM); an Instructor's Manual/TestBank, plus other online and print resources.

The International Symposia on Distributed Autonomous Robotic Systems (DARS) started at Riken, Japan in 1992. Since then, the DARS symposia have been held every two years: in 1994 and 1996 in Japan (Riken, Wako), in 1998 in Germany (Karlsruhe), in 2000 in the USA (Knoxville, TN), in 2002 in Japan (Fukuoka), in 2004 in France (Toulouse), and in 2006 in the USA (Minneapolis, MN). The 9th DARS symposium, which was held during November 17-19 in T- kuba, Japan, hosted 84 participants from 13 countries. The 48 papers presented there were selected through rigorous peer review with a 50% acceptance ratio. Along with three invited talks, they addressed the spreading research fields of DARS, which are classifiable along two streams: theoretical and standard studies of DARS, and interdisciplinary studies using DARS concepts. The former stream includes multi-robot cooperation (task assignment methodology among multiple robots, multi-robot localization, etc.), swarm intelligence, and modular robots. The latter includes distributed sensing, mobiligence, ambient intelligence, and mul- agent systems interaction with human beings. This book not only offers readers the latest research results related to DARS from theoretical studies to application-oriented ones; it also describes the present trends of this field. With the diversity and depth revealed herein, we expect that DARS technologies will flourish soon.

Density functional theory (DFT) has become the standard workhorse for quantum mechanical simulations as it offers a good compromise between accuracy and computational cost.
However, there are many important systems for which DFT performs very poorly, most notably strongly-correlated materials, resulting in a significant recent growth in interest in 'beyond DFT' methods. The widely used DFT+U technique, in particular, involves the addition of explicit Coulomb repulsion terms to reproduce the physics of spatially-localised electronic subspaces.
The magnitude of these corrective terms, measured by the famous Hubbard U parameter, has received much attention but less so for the projections used to delineate these subspaces.
The dependence on the choice of these projections is studied in detail here and a method to overcome this ambiguity in DFT+U, by self-consistently determining the projections, is introduced.
The author shows how nonorthogonal representations for electronic states may be used to construct these projections and, furthermore, how DFT+U may be implemented with a linearly increasing cost with respect to system size.
The use of nonorthogonal functions in the context of electronic structure calculations is extensively discussed and clarified, with new interpretations and results, and, on this topic, this work may serve as a reference for future workers in the field."

In recent years there has been a resurgence of interest in the study of delay differential equations motivated largely by new applications in physics, biology, ecology, and physiology. The aim of this monograph is to present a reasonably self-contained account of the advances in the oscillation theory of this class of equations. Throughout, the main topics of study are shown in action, with applications to such diverse problems as insect population estimations, logistic equations in ecology, the survival of red blood cells in animals, integro-differential equations, and the motion of the tips of growing plants. The authors begin by reviewing the basic theory of delay differential equations, including the fundamental results of existence and uniqueness of solutions and the theory of the Laplace and z-transforms. Little prior knowledge of the subject is required other than a firm grounding in the main techniques of differential equation theory. As a result, this book provides an invaluable reference to the recent work both for mathematicians and for all those whose research includes the study of this fascinating class of differential equations.

This book is aimed at researchers, industry professionals and students interested in the broad ranges of disciplines related to condition monitoring of machinery working in non-stationary conditions. Each chapter, accepted after a rigorous peer-review process, reports on a selected, original piece of work presented and discussed at the International Conference on Condition Monitoring of Machinery in Non-stationary Operations, CMMNO'2018, held on June 20 - 22, 2018, in Santander, Spain. The book describes both theoretical developments and a number of industrial case studies, which cover different topics, such as: noise and vibrations in machinery, conditioning monitoring in non-stationary operations, vibro-acoustic diagnosis of machinery, signal processing, application of pattern recognition and data mining, monitoring and diagnostic systems, faults detection, dynamics of structures and machinery, and mechatronic machinery diagnostics.

Drawing examplesfrom mathematics, physics, chemistry, biology, engineering, economics, medicine, politics, and sports, this book illustrates how nonlinear dynamics plays a vital role in our world. Examples cover a wide range from the spread and possible control of communicable diseases, to the lack of predictability in long-range weather forecasting, to competition between political groups and nations.

After an introductorychapter that explores what it means to be nonlinear, the book covers the mathematical conceptssuch as limit cycles, fractals, chaos, bifurcations, and solitons, that will be applied throughout the book. Numerous computer simulations and exercises allow students to explore topics in greater depth using the Maple computer algebra system. The mathematical level of the text assumes prior exposure to ordinary differential equations and familiarity with the wave and diffusion equations.No prior knowledge of Maple is assumed.

The book may be used at the undergraduate or graduate level to prepare science and engineering students for problems in the "real world," or for self-study by practicing scientists and engineers."

The Dynamics program and handbook allows the reader to explore nonlinear dynamics and chaos by the use of illustrated graphics. It is suitable for research and educational needs. This new edition allows the program = to run 3 times faster on the processes that are time consuming. Other major changes include: 1. There will be an add-your-own equation facility. This means it = will be unnecessary to have a compiler. PD and Lyanpunov exponents and Newton method for finding periodic orbits can all be carried out numerically without adding specific code for partial derivatives. 2. The program will support color postscript. 3. New menu system in which the user is prompted by options when a command is chosen. This means that the program is much easier to learn and to remember in comparison to current version. 4. Mouse support is added. 5. The program will be able to use the expanded memory available on modern PC's. This means pictures will be higher resolution. There are also many minor chan ce much of the source code will be available on the web, although some of ges such as zoom facility and help facility.=20 6. Due to limited spa it willr emain on the disk so that the unix users still have to purchase the book. This will allow minor upgrades for Unix users.

In this book the author presents the dynamical systems in infinite dimension, especially those generated by dissipative partial differential equations. This book attempts a systematic study of infinite dimensional dynamical systems generated by dissipative evolution partial differential equations arising in mechanics and physics and in other areas of sciences and technology. This second edition has been updated and extended.

V-INVEX FUNCTIONS AND VECTOR OPTIMIZATION summarizes and synthesizes an aspect of research work that has been done in the area of Generalized Convexity over the past several decades. Specifically, the book focuses on V-invex functions in vector optimization that have grown out of the work of Jeyakumar and Mond in the 1990?s. V-invex functions are areas in which there has been much interest because it allows researchers and practitioners to address and provide better solutions to problems that are nonlinear, multi-objective, fractional, and continuous in nature. Hence, V-invex functions have permitted work on a whole new class of vector optimization applications. There has been considerable work on vector optimization by some highly distinguished researchers including Kuhn, Tucker, Geoffrion, Mangasarian, Von Neuman, Schaiible, Ziemba, etc. The authors have integrated this related research into their book and demonstrate the wide context from which the area has grown and continues to grow. The result is a well-synthesized, accessible, and usable treatment for students, researchers, and practitioners in the areas of OR, optimization, applied mathematics, engineering, and their work relating to a wide range of problems which include financial institutions, logistics, transportation, traffic management, etc.

The book aims at surveying results in the application of fuzzy sets and fuzzy logic to economics and engineering. New results include fuzzy non-linear regression, fully fuzzified linear programming, fuzzy multi-period control, fuzzy network analysis, each using an evolutionary algorithm; fuzzy queuing decision analysis using possibility theory; fuzzy differential equations; fuzzy difference equations; fuzzy partial differential equations; fuzzy eigenvalues based on an evolutionary algorithm; fuzzy hierarchical analysis using an evolutionary algorithm; fuzzy integral equations. Other important topics covered are fuzzy input-output analysis; fuzzy mathematics of finance; fuzzy PERT (project evaluation and review technique). No previous knowledge of fuzzy sets is needed. The mathematical background is assumed to be elementary calculus.

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 book, part of the seriesContributions in Mathematical and Computational Sciences, reviews recent developments in the theory of vertex operator algebras (VOAs) and their applications to mathematics and physics.

The mathematical theory of VOAs originated from the famous monstrous moonshine conjectures of J.H. Conway and S.P. Norton, which predicted a deep relationship between the characters of the largest simple finite sporadic group, the Monster and the theory of modular forms inspired by the observations of J. MacKay and J. Thompson.

The contributions are based on lectures delivered at the 2011 conference on Conformal Field Theory, Automorphic Forms and Related Topics, organized by the editors as part of a special program offered at Heidelberg University that summer under the sponsorship of the Mathematics Center Heidelberg (MATCH)."