Bücher veröffentlicht von Springer New York

This book presents a self-contained introduction to the theory of minisum hyperspheres. This specialized research area within the larger field of geometric optimization is full of interesting and open problems.This work provides an overview of the history of minisum hyperspheres as well as describes the best techniques for developing and solving minisum hypersphere problems. Various related areas of geometric and nonlinear optimization are also discussed.As the first publication devoted to this area of research, this work will be of great interest to graduate-level researchers studying minisum hypersphere problems as well as mathematicians interested geometric optimization.

This book, which is based on Polya's method of problem solving, aids students in their transition from calculus (or precalculus) to higher-level mathematics. The book begins by providing a great deal of guidance on how to approach definitions, examples, and theorems in mathematics and ends with suggested projects for independent study. Students will follow Polya's four step approach: analyzing the problem, devising a plan to solve the problem, carrying out that plan, and then determining the implication of the result. In addition to the Polya approach to proofs, this book places special emphasis on reading proofs carefully and writing them well. The authors have included a wide variety of problems, examples, illustrations and exercises, some with hints and solutions, designed specifically to improve the student's ability to read and write proofs. Historical connections are made throughout the text, and students are encouraged to use the rather extensive bibliography to begin making connections of their own. While standard texts in this area prepare students for future courses in algebra, this book also includes chapters on sequences, convergence, and metric spaces for those wanting to bridge the gap between the standard course in calculus and one in analysis.

This brief proposes that the keys to internet cross-layer optimization are the development of non-standard implicit primal-dual solvers for underlying optimization problems, and design of jointly optimal network protocols as decomposition of such solvers. Relying on this novel design-space oriented approach, the author develops joint TCP congestion control and wireless-link scheduling schemes for wireless applications over Internet with centralized and distributed (multi-hop) wireless links. Different from the existing solutions, the proposed schemes can be asynchronously implemented without message passing among network nodes; thus they are readily deployed with current infrastructure. Moreover, global convergence/stability of the proposed schemes to optimal equilibrium is established using the Lyapunov method in the network fluid model. Simulation results are provided to evaluate the proposed schemes in practical networks.

This text introduces upper division undergraduate/beginning graduate students in mathematics, finance, or economics, to the core topics of a beginning course in finance/financial engineering. Particular emphasis is placed on exploiting the power of the Monte Carlo method to illustrate and explore financial principles. Monte Carlo is the uniquely appropriate tool for modeling the random factors that drive financial markets and simulating their implications.The Monte Carlo method is introduced early and it is used in conjunction with the geometric Brownian motion model (GBM) to illustrate and analyze the topics covered in the remainder of the text. Placing focus on Monte Carlo methods allows for students to travel a short road from theory to practical applications. Coverage includes investment science, mean-variance portfolio theory, option pricing principles, exotic options, option trading strategies, jump diffusion and exponential Levy alternative models, and the Kelly criterion for maximizing investment growth.Novel features:inclusion of both portfolio theory and contingent claim analysis in a single textpricing methodology for exotic optionsexpectation analysis of option trading strategiespricing models that transcend the Black-Scholes frameworkoptimizing investment allocationsconcepts thoroughly explored through numerous simulation exercisesnumerous worked examples and illustrationsThe mathematical background required is a year and one-half course in calculus, matrix algebra covering solutions of linear systems, and a knowledge of probability including expectation, densities and the normal distribution. A refresher for these topics is presented in the Appendices. The programming background needed is how to code branching, loops and subroutines in some mathematical or general purpose language. The mathematical background required is a year and one-half course in calculus, matrix algebra covering solutions of linear systems, and a knowledge of probability including expectation, densities and the normal distribution. A refresher for these topics is presented in the Appendices. The programming background needed is how to code branching, loops and subroutines in some mathematical or general purpose language. Also by the author: (with F. Mendivil) Explorations in Monte Carlo, (c)2009, ISBN: 978-0-387-87836-2; (with J. Herod) Mathematical Biology: An Introduction with Maple and Matlab, Second edition, (c)2009, ISBN: 978-0-387-70983-3.

Modeling and Simulation have become endeavors central to all disciplines of science and engineering. They are used in the analysis of physical systems where they help us gain a better understanding of the functioning of our physical world. They are also important to the design of new engineering systems where they enable us to predict the behavior of a system before it is ever actually built. Modeling and simulation are the only techniques available that allow us to analyze arbitrarily non-linear systems accurately and under varying experimental conditions. Continuous System Modeling introduces the student to an important subclass of these techniques. They deal with the analysis of systems described through a set of ordinary or partial differential equations or through a set of difference equations. This volume introduces concepts of modeling physical systems through a set of differential and/or difference equations. The purpose is twofold: it enhances the scientific understanding of our physical world by codifying (organizing) knowledge about this world, and it supports engineering design by allowing us to assess the consequences of a particular design alternative before it is actually built. This text has a flavor of the mathematical discipline of dynamical systems, and is strongly oriented towards Newtonian physical science.

Genetic algorithms provide a powerful range of methods for solving complex engineering search and optimization algorithms. Their power can also lead to difficulty for new researchers and students who wish to apply such evolution-based methods. "e;Applied Evolutionary Algorithms in Java"e; offers a practical, hands-on guide to applying such algorithms to engineering and scientific problems. The concepts are illustrated through clear examples, ranging from simple to more complex problems domains; all based on real-world industrial problems. Examples are taken from image processing, fuzzy-logic control systems, mobile robots, and telecommunication network optimization problems. The Java-based toolkit provides an easy-to-use and essential visual interface, with integrated graphing and analysis tools. Topics and features: *inclusion of a complete Java toolkit for exploring evolutionary algorithms *strong use of visualization techniques, to increase understanding *coverage of all major evolutionary algorithms in common usage *broad range of industrially based example applications *includes examples and an appendix based on fuzzy logic This book is intended for students, researchers, and professionals interested in using evolutionary algorithms in their work. No mathematics beyond basic algebra and Cartesian graphs methods are required, as the aim is to encourage applying the Java toolkit to develop the power of these techniques.

With the first edition out of print, we decided to arrange for republi- cation of Denumerrible Markov Ohains with additional bibliographic material. The new edition contains a section Additional Notes that indicates some of the developments in Markov chain theory over the last ten years. As in the first edition and for the same reasons, we have resisted the temptation to follow the theory in directions that deal with uncountable state spaces or continuous time. A section entitled Additional References complements the Additional Notes. J. W. Pitman pointed out an error in Theorem 9-53 of the first edition, which we have corrected. More detail about the correction appears in the Additional Notes. Aside from this change, we have left intact the text of the first eleven chapters. The second edition contains a twelfth chapter, written by David Griffeath, on Markov random fields. We are grateful to Ted Cox for his help in preparing this material. Notes for the chapter appear in the section Additional Notes. J.G.K., J.L.S., A.W.K.

This book presents some of the basic topological ideas used in studying differentiable manifolds and maps. Mathematical prerequisites have been kept to a minimum; the standard course in analysis and general topology is adequate preparation. An appendix briefly summarizes some of the back- ground material. In order to emphasize the geometrical and intuitive aspects of differen- tial topology, I have avoided the use of algebraic topology, except in a few isolated places that can easily be skipped. For the same reason I make no use of differential forms or tensors. In my view, advanced algebraic techniques like homology theory are better understood after one has seen several examples of how the raw material of geometry and analysis is distilled down to numerical invariants, such as those developed in this book: the degree of a map, the Euler number of a vector bundle, the genus of a surface, the cobordism class of a manifold, and so forth. With these as motivating examples, the use of homology and homotopy theory in topology should seem quite natural. There are hundreds of exercises, ranging in difficulty from the routine to the unsolved. While these provide examples and further developments of the theory, they are only rarely relied on in the proofs of theorems.

This textbook gives a detailed and comprehensive presentation of linear algebra based on an axiomatic treatment of linear spaces. For this fourth edition some new material has been added to the text, for instance, the intrinsic treatment of the classical adjoint of a linear transformation in Chapter IV, as well as the discussion of quaternions and the classifica- tion of associative division algebras in Chapter VII. Chapters XII and XIII have been substantially rewritten for the sake of clarity, but the contents remain basically the same as before. Finally, a number of problems covering new topics-e.g. complex structures, Caylay numbers and symplectic spaces - have been added. I should like to thank Mr. M. L. Johnson who made many useful suggestions for the problems in the third edition. I am also grateful to my colleague S. Halperin who assisted in the revision of Chapters XII and XIII and to Mr. F. Gomez who helped to prepare the subject index. Finally, I have to express my deep gratitude to my colleague J. R. Van- stone who worked closely with me in the preparation of all the revisions and additions and who generously helped with the proof reading.

The author's aim in this textbook is to provide students with a clear understanding of the relationship between the principles of object-oriented programming and software engineering. Professor Zeigler takes an approach based on state representation to formal specification. Consequently, this book is unique through its - emphasis on formulating primitives from which all other functionality can be built; - integral use of a semi-formal behaviour specification language based on state transition concepts; -differentiation between behaviour and implementation; -a reusable heterogeneous container class library; -ability to show the elegance and power of ensemble methods with non-trivial examples. As a result, students studying software engineering will find this a distinctive and valuable approach to programming and systems engineering.

Concurrent computing is gaining ground in interest as it becomes increasingly feasible to implement distributed computing across networks of workstations. This book, by one of the subject's leading figures, provides a comprehensive survey of the subject beginning with proposotional logic and concluding with concurrent programming. It is based on graduate courses taught at Cornell University and is designed to be used as a graduate text. There are exercises at the end of each chapter to extend and illustrate the main themes covered. Professor Schneier emphasizes the use of formal methods and assertional reasoning using notation and paradigms drawn from programming to drive the exposition. As a result, all those interested in studying concurrent computing will find this to be an invaluable approach to the subject.

The aim of the present book is to address practical aspects of nonlinear vibration analysis. It presents cases rarely discussed in the existing literature on vibration - such as rotor dynamics, and torsional vibration of engines - which are problems of considerable interest for engineering researchers and practical engineers. The book can be used not only as a reference but also as material for graduate students at Engineering departments, as it contains problems and solutions for each chapter.

Mechanical Engineering, an engineering discipline borne of the needs of the in- dustrial revolution, is once again asked to do its substantial share in the call for industrial renewal. The general call is urgent as we face profound issues of pro- ductivity and competitiveness that require engineering solutions, among others. The Mechanical Engineering Series features graduate texts and research mono- graphs intended to address the need for information in contemporary areas ofme- chanical engineering. The series is conceived as a comprehensive one that covers a broad range of concentrations important to mechanical engineering graduate education and re- search. We are fortunate to have a distinguished roster ofconsulting editors on the advisory board, each an expert in one ofthe areas ofconcentration. The names of the consulting editors are listed on the next page of this volume. The areas of concentration are applied mechanics, biomechanics, computational mechanics, dynamic systems and control, energetics, mechanics ofmaterials, processing, ther- mal science, and tribology. Frederick A. Leckie,the series editor for applied mechanics, and I are pleased to presentthis volume in the Series: Nonlinear Computational Structural Mechan- ics: New Approaches and Non-Incremental Methods of Calculation, by Pierre Ladeveze. The selection of this volume underscores again the interest of the Me- chanical Engineering series to provide our readers with topical monographs as well as graduate texts in a wide variety of fields.

In its most general form bifurcation theory is a theory of asymptotic solutions of nonlinear equations. By asymptotic solutions we mean, for example, steady solutions, time-periodic solutions, and quasi-periodic solutions. The purpose of this book is to teach the theory of bifurcation of asymptotic solutions of evolution problems governed by nonlinear differential equations. We have written this book for the broadest audience of potentially interested learners: engineers, biologists, chemists, physicists, mathematicians, economists, and others whose work involves understanding asymptotic solutions of nonlinear differential equations. To accomplish our aims, we have thought it necessary to make the analysis: (1) general enough to apply to the huge variety of applications which arise in science and technology; and (2) simple enough so that it can be understood by persons whose mathe- matical training does not extend beyond the classical methods of analysis which were popular in the nineteenth century. Of course, it is not possible to achieve generality and simplicity in a perfect union but, in fact, the general theory is simpler than the detailed theory required for particular applications. The general theory abstracts from the detailed problems only the essential features and provides the student with the skeleton on which detailed structures of the applications must rest. lt is generally believed that the mathematical theory of bifurcation requires some functional analysis and some ofthe methods of topology and dynamics.

This book presents the first part of a planned two-volume series devoted to a systematic exposition of some recent developments in the theory of discrete-time Markov control processes (MCPs). Interest is mainly confined to MCPs with Borel state and control (or action) spaces, and possibly unbounded costs and noncompact control constraint sets. MCPs are a class of stochastic control problems, also known as Markov decision processes, controlled Markov processes, or stochastic dynamic pro- grams; sometimes, particularly when the state space is a countable set, they are also called Markov decision (or controlled Markov) chains. Regardless of the name used, MCPs appear in many fields, for example, engineering, economics, operations research, statistics, renewable and nonrenewable re- source management, (control of) epidemics, etc. However, most of the lit- erature (say, at least 90%) is concentrated on MCPs for which (a) the state space is a countable set, and/or (b) the costs-per-stage are bounded, and/or (c) the control constraint sets are compact. But curiously enough, the most widely used control model in engineering and economics--namely the LQ (Linear system/Quadratic cost) model-satisfies none of these conditions. Moreover, when dealing with "e;partially observable"e; systems) a standard approach is to transform them into equivalent "e;completely observable"e; sys- tems in a larger state space (in fact, a space of probability measures), which is uncountable even if the original state process is finite-valued.

A good part of matrix theory is functional analytic in spirit. This statement can be turned around. There are many problems in operator theory, where most of the complexities and subtleties are present in the finite-dimensional case. My purpose in writing this book is to present a systematic treatment of methods that are useful in the study of such problems. This book is intended for use as a text for upper division and gradu- ate courses. Courses based on parts of the material have been given by me at the Indian Statistical Institute and at the University of Toronto (in collaboration with Chandler Davis). The book should also be useful as a reference for research workers in linear algebra, operator theory, mathe- matical physics and numerical analysis. A possible subtitle of this book could be Matrix Inequalities. A reader who works through the book should expect to become proficient in the art of deriving such inequalities. Other authors have compared this art to that of cutting diamonds. One first has to acquire hard tools and then learn how to use them delicately. The reader is expected to be very thoroughly familiar with basic lin- ear algebra. The standard texts Finite-Dimensional Vector Spaces by P.R.

This graduate-level text presents the fundamental physics of solid-state lasers, including the basis of laser action and the optical and electronic properties of laser materials. Some knowledge of quantum mechanics and solid-state physics is assumed, but the discussion is as self-contained as possible, making the book an excellent reference as well as useful for independent study. After an overview of the topic, the book is divided into two parts. The first begins with a review of the quantum mechanics and solid-state physics, spectroscopy, and crystal field theory; it then treats the quantum theory of radiation, the emission and absorption of radiation, and nonlinear optics; it concludes with discussions of lattice vibrations and ion-ion interactions and of their effects on optical properties and laser action. The second part treats specific solid-state laser materials, the protypical ruby and Nd-YAG systems being treated in greatest detail; it concludes with a discussion of novel and non-standard materials.

In writing this book, our goal was to produce a text suitable for a first course in mathematical logic more attuned than the traditional textbooks to the re- cent dramatic growth in the applications oflogic to computer science. Thus, our choice oftopics has been heavily influenced by such applications. Of course, we cover the basic traditional topics: syntax, semantics, soundnes5, completeness and compactness as well as a few more advanced results such as the theorems of Skolem-Lowenheim and Herbrand. Much ofour book, however, deals with other less traditional topics. Resolution theorem proving plays a major role in our treatment of logic especially in its application to Logic Programming and PRO- LOG. We deal extensively with the mathematical foundations ofall three ofthese subjects. In addition, we include two chapters on nonclassical logics - modal and intuitionistic - that are becoming increasingly important in computer sci- ence. We develop the basic material on the syntax and semantics (via Kripke frames) for each of these logics. In both cases, our approach to formal proofs, soundness and completeness uses modifications of the same tableau method in- troduced for classical logic. We indicate how it can easily be adapted to various other special types of modal logics. A number of more advanced topics (includ- ing nonmonotonic logic) are also briefly introduced both in the nonclassical logic chapters and in the material on Logic Programming and PROLOG.

It is known that the Chapman-Jouguet theory of detonation is based on the assumption of an instantaneous and complete transformation of explosives into detonation products in the wave front. Therefore, one should not expect from the theory any interpretations of the detonation limits, such as shock initiation of det- onation and kinetic instability and propagation (failure diameter). The Zeldovich-Von Neuman-Doring (ZND) theory of detonation appeared, in fact, as a response to the need for a theory capable of interpreting such limits, and the ZND detonation theory gave qualitative interpretations to the detonation limits. These interpretations were based essentially on the theoretical notion that the mechanism of explosives transformation at detonation is a combustion of a layer of finite thickness of shock-compressed explosive behind the wave shock front with the velocity of the front. However, some experimental findings turned out to be inconsistent with the the- ory. A very small change of homogeneous (liquid) explosives detonation velocity with explosive charge diameter near the rather sizable failure diameter is one of the findings. The elucidation of the nature of this finding has led to the discovery of a new phenomenon. This phenomenon has come to be known as the breakdown (BD) of the explosive self-ignition behind the front of shock waves under the effect of rarefaction waves.

A basic issue in computer science is the complexity of problems. Computational complexity measures how much time or memory is needed as a function of the input problem size. Descriptive complexity is concerned with problems which may be described in first-order logic. By virtue of the close relationship between logic and relational databses, it turns out that this subject has important applications to databases such as analysing the queries computable in polynomial time, analysing the parallel time needed to compute a query, and the analysis of nondeterministic classes. This book is written as a graduate text and so aims to provide a reasonably self-contained introduction to this subject. The author has provided numerous examples and exercises to further illustrate the ideas presented.