An effective reliability programme is an essential component of every product's design, testing and efficient production. From the failure analysis of a microelectronic device to software fault tolerance and from the accelerated life testing of mechanical components to hardware verification, a common underlying philosophy of reliability applies. Defining both fundamental and applied work across the entire systems reliability arena, this state-of-the-art reference presents methodologies for quality, maintainability and dependability. Featuring: Contributions from 60 leading reliability experts in academia and industry giving comprehensive and authoritative coverage. A distinguished international Editorial Board ensuring clarity and precision throughout. Extensive references to the theoretical foundations, recent research and future directions described in each chapter. Comprehensive subject index providing maximum utility to the reader. Applications and examples across all branches of engineering including IT, power, automotive and aerospace sectors. The handbook's cross-disciplinary scope will ensure that it serves as an indispensable tool for researchers in industrial, electrical, electronics, computer, civil, mechanical and systems engineering. It will also aid professional engineers to find creative reliability solutions and management to evaluate systems reliability and to improve processes. For student research projects it will be the ideal starting point whether addressing basic questions in communications and electronics or learning advanced applications in micro-electro-mechanical systems (MEMS), manufacturing and high-assurance engineering systems.

The field of global optimization has been developing at a rapid pace. There is a journal devoted to the topic, as well as many publications and notable books discussing various aspects of global optimization. This book is intended to complement these other publications with a focus on stochastic methods for global optimization. Stochastic methods, such as simulated annealing and genetic algo rithms, are gaining in popularity among practitioners and engineers be they are relatively easy to program on a computer and may be cause applied to a broad class of global optimization problems. However, the theoretical performance of these stochastic methods is not well under stood. In this book, an attempt is made to describe the theoretical prop erties of several stochastic adaptive search methods. Such a theoretical understanding may allow us to better predict algorithm performance and ultimately design new and improved algorithms. This book consolidates a collection of papers on the analysis and de velopment of stochastic adaptive search. The first chapter introduces random search algorithms. Chapters 2-5 describe the theoretical anal ysis of a progression of algorithms. A main result is that the expected number of iterations for pure adaptive search is linear in dimension for a class of Lipschitz global optimization problems. Chapter 6 discusses algorithms, based on the Hit-and-Run sampling method, that have been developed to approximate the ideal performance of pure random search. The final chapter discusses several applications in engineering that use stochastic adaptive search methods."

These days, the nature of services and the volume of demand in the telecommu nication industry is changing radically, with the replacement of analog transmis sion and traditional copper cables by digital technology and fiber optic transmis sion equipment. Moreover, we see an increasing competition among providers of telecommunication services, and the development of a broad range of new services for users, combining voice, data, graphics and video. Telecommunication network planning has thus become an important problem area for developing and applying optimization models. Telephone companies have initiated extensive modeling and planning efforts to expand and upgrade their transmission facilities, which are, for most national telecommunication networks, divided in three main levels (see Balakrishnan et al. [5]), namely, l. the long-distance or backbone network that typically connects city pairs through gateway nodes; 2. the inter-office or switching center network within each city, that interconnects switching centers in different subdivisions (clusters of customers) and provides access to the gateway(s) node(s); 1 2 DESIGN OF SURVNABLE NETWORKS WITH BOUNDED RINGS 3. the local access network that connects individual subscribers belonging to a cluster to the corresponding switching center. These three levels differ in several ways including their design criteria. Ideally, the design of a telecommunication network should simultaneously account for these three levels. However, to simplify the planning task, the overall planning problem is decomposed by considering each level separately.

Nonconvexity and nonsmoothness arise in a large class of engineering applica tions. In many cases of practical importance the possibilities offered by opti mization with its algorithms and heuristics can substantially improve the per formance and the range of applicability of classical computational mechanics algorithms. For a class of problems this approach is the only one that really works. The present book presents in a comprehensive way the application of opti mization algorithms and heuristics in smooth and nonsmooth mechanics. The necessity of this approach is presented to the reader through simple, represen tative examples. As things become more complex, the necessary material from convex and nonconvex optimization and from mechanics are introduced in a self-contained way. Unilateral contact and friction problems, adhesive contact and delamination problems, nonconvex elastoplasticity, fractal friction laws, frames with semi rigid connections, are among the applications which are treated in details here. Working algorithms are given for each application and are demonstrated by means of representative examples. The interested reader will find helpful references to up-to-date scientific and technical literature so that to be able to work on research or engineering topics which are not directly covered here."

This volume contains a selection of contributions that were presented at the Modeling and Optimization: Theory and Applications Conference (MOPTA) held at Lehigh University in Bethlehem, Pennsylvania, USA on August 18-20, 2010. The conference brought together a diverse group of researchers and practitioners, working on both theoretical and practical aspects of continuous or discrete optimization. Topics presented included algorithms for solving convex, network, mixed-integer, nonlinear, and global optimization problems, and addressed the application of optimization techniques in finance, logistics, health, and other important fields. The contributions contained in this volume represent a sample of these topics and applications and illustrate the broad diversity of ideas discussed at the meeting.

Everything should be made as simple as possible, but not simpler. (Albert Einstein, Readers Digest, 1977) The modern practice of creating technical systems and technological processes of high effi.ciency besides the employment of new principles, new materials, new physical effects and other new solutions ( which is very traditional and plays the key role in the selection of the general structure of the object to be designed) also includes the choice of the best combination for the set of parameters (geometrical sizes, electrical and strength characteristics, etc.) concretizing this general structure, because the Variation of these parameters ( with the structure or linkage being already set defined) can essentially affect the objective performance indexes. The mathematical tools for choosing these best combinations are exactly what is this book about. With the advent of computers and the computer-aided design the pro bations of the selected variants are usually performed not for the real examples ( this may require some very expensive building of sample op tions and of the special installations to test them ), but by the analysis of the corresponding mathematical models. The sophistication of the mathematical models for the objects to be designed, which is the natu ral consequence of the raising complexity of these objects, greatly com plicates the objective performance analysis. Today, the main (and very often the only) available instrument for such an analysis is computer aided simulation of an object's behavior, based on numerical experiments with its mathematical model.

Inverse and crack identification problems are of paramount importance for health monitoring and quality control purposes arising in critical applications in civil, aeronautical, nuclear, and general mechanical engineering. Mathematical modeling and the numerical study of these problems require high competence in computational mechanics and applied optimization. This is the first monograph which provides the reader with all the necessary information. Delicate computational mechanics modeling, including nonsmooth unilateral contact effects, is done using boundary element techniques, which have a certain advantage for the construction of parametrized mechanical models. Both elastostatic and harmonic or transient dynamic problems are considered. The inverse problems are formulated as output error minimization problems and they are theoretically studied as a bilevel optimization problem, also known as a mathematical problem with equilibrium constraints. Beyond classical numerical optimization, soft computing tools (neural networks and genetic algorithms) and filter algorithms are used for the numerical solution. The book provides all the required material for the mathematical and numerical modeling of crack identification testing procedures in statics and dynamics and includes several thoroughly discussed applications, for example, the impact-echo nondestructive evaluation technique. Audience: The book will be of interest to structural and mechanical engineers involved in nondestructive testing and quality control projects as well as to research engineers and applied mathematicians who study and solve related inverse problems. People working on applied optimization and soft computing will find interesting problems to apply to their methods and all necessary material to continue research in this field.

Motivation Stochastic Linear Programming with recourse represents one of the more widely applicable models for incorporating uncertainty within in which the SLP optimization models. There are several arenas model is appropriate, and such models have found applications in air line yield management, capacity planning, electric power generation planning, financial planning, logistics, telecommunications network planning, and many more. In some of these applications, modelers represent uncertainty in terms of only a few seenarios and formulate a large scale linear program which is then solved using LP software. However, there are many applications, such as the telecommunications planning problem discussed in this book, where a handful of seenarios do not capture variability well enough to provide a reasonable model of the actual decision-making problem. Problems of this type easily exceed the capabilities of LP software by several orders of magnitude. Their solution requires the use of algorithmic methods that exploit the structure of the SLP model in a manner that will accommodate large scale applications."

This book includes a self-contained theory of inequality problems and their applications to unilateral mechanics. Fundamental theoretical results and related methods of analysis are discussed on various examples and applications in mechanics. The work can be seen as a book of applied nonlinear analysis entirely devoted to the study of inequality problems, i.e. variational inequalities and hemivariational inequalities in mathematical models and their corresponding applications to unilateral mechanics. It contains a systematic investigation of the interplay between theoretical results and concrete problems in mechanics. It is the first textbook including a comprehensive and systematic study of both elliptic, parabolic and hyperbolic inequality models, dynamical unilateral systems and unilateral eigenvalues problems. The book is self-contained and it offers, for the first time, the possibility to learn about inequality models and to acquire the essence of the theory in a relatively short time.

Since the volume may be of interest to a broad variety of people, it is arranged in parts that require different levels of mathematical background. Part I is written in a simple form and can be assessed by any computer-literate person interested in the application of visualization methods in decision making. This part will be of interest to specialists and students in various fields related to decision making including environmental studies, management, business, engineering, etc. In Part II computational methods are introduced in a relatively simple form. This part will be of interest to specialists and students in the field of applied optimization, operations research and computer science. Part III is written for specialists and students in applied mathematics interested in the theoretical basis of modern optimization. Due to this structure, the parts can be read independently. For example, students interested in environmental applications could restrict themselves to Part I and the Epilogue. In contrast, those who are interested in computational methods can skip Part I and read Part II only. Finally, specialists, who are interested in the theory of approximation of multi-dimensional convex sets or in estimation of disturbances of polyhedral sets, can read the corresponding chapters of Part III.

Optimal Control and Optimization of Stochastic Supply Chain Systems examines its subject the context of the presence of a variety of uncertainties. Numerous examples with intuitive illustrations and tables are provided, to demonstrate the structural characteristics of the optimal control policies in various stochastic supply chains and to show how to make use of these characteristics to construct easy-to-operate sub-optimal policies. In Part I, a general introduction to stochastic supply chain systems is provided. Analytical models for various stochastic supply chain systems are formulated and analysed in Part II. In Part III the structural knowledge of the optimal control policies obtained in Part II is utilized to construct easy-to-operate sub-optimal control policies for various stochastic supply chain systems accordingly. Finally, Part IV discusses the optimisation of threshold-type control policies and their robustness. A key feature of the book is its tying together of the complex analytical models produced by the requirements of operational practice, and the simple solutions needed for implementation. The analytical models and theoretical analysis propounded in this monograph will be of benefit to academic researchers and graduate students looking at logistics and supply chain management from standpoints in operations research or industrial, manufacturing, or control engineering. The practical tools and solutions and the qualitative insights into the ideas underlying functional supply chain systems will be of similar use to readers from more industrially-based backgrounds.

There are many methods of stable controller design for nonlinear systems. In seeking to go beyond the minimum requirement of stability, Adaptive Dynamic Programming in Discrete Time approaches the challenging topic of optimal control for nonlinear systems using the tools of adaptive dynamic programming (ADP). The range of systems treated is extensive; affine, switched, singularly perturbed and time-delay nonlinear systems are discussed as are the uses of neural networks and techniques of value and policy iteration. The text features three main aspects of ADP in which the methods proposed for stabilization and for tracking and games benefit from the incorporation of optimal control methods: * infinite-horizon control for which the difficulty of solving partial differential Hamilton-Jacobi-Bellman equations directly is overcome, and proof provided that the iterative value function updating sequence converges to the infimum of all the value functions obtained by admissible control law sequences; * finite-horizon control, implemented in discrete-time nonlinear systems showing the reader how to obtain suboptimal control solutions within a fixed number of control steps and with results more easily applied in real systems than those usually gained from infinite-horizon control; * nonlinear games for which a pair of mixed optimal policies are derived for solving games both when the saddle point does not exist, and, when it does, avoiding the existence conditions of the saddle point. Non-zero-sum games are studied in the context of a single network scheme in which policies are obtained guaranteeing system stability and minimizing the individual performance function yielding a Nash equilibrium. In order to make the coverage suitable for the student as well as for the expert reader, Adaptive Dynamic Programming in Discrete Time: * establishes the fundamental theory involved clearly with each chapter devoted to a clearly identifiable control paradigm; * demonstrates convergence proofs of the ADP algorithms to deepen understanding of the derivation of stability and convergence with the iterative computational methods used; and * shows how ADP methods can be put to use both in simulation and in real applications. This text will be of considerable interest to researchers interested in optimal control and its applications in operations research, applied mathematics computational intelligence and engineering. Graduate students working in control and operations research will also find the ideas presented here to be a source of powerful methods for furthering their study.

This volume presents a selection of survey and research articles based on invited lectures and contributed talks presented at the Workshop on Fluid Dynamics in Porous Media that was held in Coimbra, Portugal, in September 12-14, 2011. The contributions are devoted to mathematical modeling, numerical simulation and their applications, providing the readers a state-of-the-art overview on the latest findings and new challenges on the topic. The book includes research work of worldwide recognized leaders in their respective fields and presents advances in both theory and applications, making it appealing to a vast range of audience, in particular mathematicians, engineers and physicists.

Complex Social Networks is a newly emerging (hot) topic with applications in a variety of domains, such as communication networks, engineering networks, social networks, and biological networks. In the last decade, there has been an explosive growth of research on complex real-world networks, a theme that is becoming pervasive in many disciplines, ranging from mathematics and computer science to the social and biological sciences. Optimization of complex communication networks requires a deep understanding of the interplay between the dynamics of the physical network and the information dynamics within the network. Although there are a few books addressing social networks or complex networks, none of them has specially focused on the optimization perspective of studying these networks. This book provides the basic theory of complex networks with several new mathematical approaches and optimization techniques to design and analyze dynamic complex networks. A wide range of applications and optimization problems derived from research areas such as cellular and molecular chemistry, operations research, brain physiology, epidemiology, and ecology.

Contemporary design in engineering and industry relies heavily on computer simulation and efficient algorithms to reduce the cost and to maximize the performance and sustainability as well as profits and energy efficiency. Solving an optimization problem correctly and efficiently requires not only the right choice of optimization algorithms and simulation methods, but also the proper implementation and insight into the problem of interest. This book consists of ten self-contained, detailed case studies of real-world optimization problems, selected from a wide range of applications and contributed from worldwide experts who are working in these exciting areas.

Optimization topics and applications include gas and water supply networks, oil field production optimization, microwave engineering, aerodynamic shape design, environmental emergence modelling, structural engineering, waveform design for radar and communication systems, parameter estimation in laser experiment and measurement, engineering materials and network scheduling. These case studies have been solved using a wide range of optimization techniques, including particle swarm optimization, genetic algorithms, artificial bee colony, harmony search, adaptive error control, derivative-free pattern search, surrogate-based optimization, variable-fidelity modelling, as well as various other methods and approaches. This book is a practical guide to help graduates and researchers to carry out optimization for real-world applications. More advanced readers will also find it a helpful reference and aide memoire.

"

This book serves as an introductory text to optimization theory in normed spaces and covers all areas of nonlinear optimization. It presents fundamentals with particular emphasis on the application to problems in the calculus of variations, approximation and optimal control theory. The reader is expected to have a basic knowledge of linear functional analysis.

Shimon Even's Graph Algorithms, published in 1979, was a seminal introductory book on algorithms read by everyone engaged in the field. This thoroughly revised second edition, with a foreword by Richard M. Karp and notes by Andrew V. Goldberg, continues the exceptional presentation from the first edition and explains algorithms in a formal but simple language with a direct and intuitive presentation. The book begins by covering basic material, including graphs and shortest paths, trees, depth-first-search and breadth-first search. The main part of the book is devoted to network flows and applications of network flows, and it ends with chapters on planar graphs and testing graph planarity.

This research monograph summarizes a line of research that maps certain classical problems of discrete mathematics and operations research - such as the Hamiltonian Cycle and the Travelling Salesman Problems - into convex domains where continuum analysis can be carried out. Arguably, the inherent difficulty of these, now classical, problems stems precisely from the discrete nature of domains in which these problems are posed. The convexification of domains underpinning these results is achieved by assigning probabilistic interpretation to key elements of the original deterministic problems. In particular, the approaches summarized here build on a technique that embeds Hamiltonian Cycle and Travelling Salesman Problems in a structured singularly perturbed Markov decision process. The unifying idea is to interpret subgraphs traced out by deterministic policies (including Hamiltonian cycles, if any) as extreme points of a convex polyhedron in a space filled with randomized policies. The above innovative approach has now evolved to the point where there are many, both theoretical and algorithmic, results that exploit the nexus between graph theoretic structures and both probabilistic and algebraic entities of related Markov chains. The latter include moments of first return times, limiting frequencies of visits to nodes, or the spectra of certain matrices traditionally associated with the analysis of Markov chains. However, these results and algorithms are dispersed over many research papers appearing in journals catering to disparate audiences. As a result, the published manuscripts are often written in a very terse manner and use disparate notation, thereby making it difficult for new researchers to make use of the many reported advances. Hence the main purpose of this book is to present a concise and yet easily accessible synthesis of the majority of the theoretical and algorithmic results obtained so far. In addition, the book discusses numerous open questions and problems that arise from this body of work and which are yet to be fully solved. The approach casts the Hamiltonian Cycle Problem in a mathematical framework that permits analytical concepts and techniques, not used hitherto in this context, to be brought to bear to further clarify both the underlying difficulty of NP-completeness of this problem and the relative exceptionality of truly difficult instances. Finally, the material is arranged in such a manner that the introductory chapters require very little mathematical background and discuss instances of graphs with interesting structures that motivated a lot of the research in this topic. More difficult results are introduced later and are illustrated with numerous examples.

The contributions appearing in this volume are a snapshot of the different topics that were discussed during the Second Conference "Mathematics and Image Processing" held at the University of Orleans in 2010. They mainly concern, image reconstruction, texture extraction and image classification and involve a variety of different methods and applications. Therefore it was impossible to split the papers into generic groups which is why they are presented in alphabetic order. However they mainly concern: texture analysis (5 papers) with different techniques (variational analysis, wavelet and morphological component analysis, fractional Brownian fields), geometrical methods (2 papers ) for restoration and invariant feature detection, classification (with multifractal analysis), neurosciences imaging and analysis of Multi-Valued Images.

Nonconvex Optimization is a multi-disciplinary research field that deals with the characterization and computation of local/global minima/maxima of nonlinear, nonconvex, nonsmooth, discrete and continuous functions. Nonconvex optimization problems are frequently encountered in modeling real world systems for a very broad range of applications including engineering, mathematical economics, management science, financial engineering, and social science. This contributed volume consists of selected contributions from the Advanced Training Programme on Nonconvex Optimization and Its Applications held at Banaras Hindu University in March 2009. It aims to bring together new concepts, theoretical developments, and applications from these researchers. Both theoretical and applied articles are contained in this volume which adds to the state of the art research in this field. Topics in Nonconvex Optimization is suitable for advanced graduate students and researchers in this area.

Monte Carlo methods are among the most used and useful computational tools available today, providing efficient and practical algorithims to solve a wide range of scientific and engineering problems. Applications covered in this book include optimization, finance, statistical mechanics, birth and death processes, and gambling systems. Explorations in Monte Carlo Methods provides a hands-on approach to learning this subject. Each new idea is carefully motivated by a realistic problem, thus leading from questions to theory via examples and numerical simulations. Programming exercises are integrated throughout the text as the primary vehicle for learning the material. Each chapter ends with a large collection of problems illustrating and directing the material. This book is suitable as a textbook for students of engineering and the sciences, as well as mathematics.

This textbook is a second edition of Evolutionary Algorithms for Solving Multi-Objective Problems, significantly expanded and adapted for the classroom. The various features of multi-objective evolutionary algorithms are presented here in an innovative and student-friendly fashion, incorporating state-of-the-art research. The book disseminates the application of evolutionary algorithm techniques to a variety of practical problems. It contains exhaustive appendices, index and bibliography and links to a complete set of teaching tutorials, exercises and solutions.

A long long time ago, echoing philosophical and aesthetic principles that existed since antiquity, William of Ockham enounced the principle of parsimony, better known today as Ockham's razor: "Entities should not be multiplied without neces sity. " This principle enabled scientists to select the "best" physical laws and theories to explain the workings of the Universe and continued to guide scienti?c research, leadingtobeautifulresultsliketheminimaldescriptionlength approachtostatistical inference and the related Kolmogorov complexity approach to pattern recognition. However, notions of complexity and description length are subjective concepts anddependonthelanguage"spoken"whenpresentingideasandresults. The?eldof sparse representations, that recently underwent a Big Bang like expansion, explic itly deals with the Yin Yang interplay between the parsimony of descriptions and the "language" or "dictionary" used in them, and it became an extremely exciting area of investigation. It already yielded a rich crop of mathematically pleasing, deep and beautiful results that quickly translated into a wealth of practical engineering applications. You are holding in your hands the ?rst guide book to Sparseland, and I am sure you'll ?nd in it both familiar and new landscapes to see and admire, as well as ex cellent pointers that will help you ?nd further valuable treasures. Enjoy the journey to Sparseland! Haifa, Israel, December 2009 Alfred M. Bruckstein vii Preface This book was originally written to serve as the material for an advanced one semester (fourteen 2 hour lectures) graduate course for engineering students at the Technion, Israel.

This book Algebraic Modeling Systems - Modeling and Solving Real World Optimization Problems - deals with the aspects of modeling and solving real-world optimization problems in a unique combination. It treats systematically the major algebraic modeling languages (AMLs) and modeling systems (AMLs) used to solve mathematical optimization problems. AMLs helped significantly to increase the usage of mathematical optimization in industry. Therefore it is logical consequence that the GOR (Gesellschaft fur Operations Research) Working Group Mathematical Optimization in Real Life had a second meeting devoted to AMLs, which, after 7 years, followed the original 71st Meeting of the GOR (Gesellschaft fur Operations Research) Working Group Mathematical Optimization in Real Life which was held under the title Modeling Languages in Mathematical Optimization during April 23-25, 2003 in the German Physics Society Conference Building in Bad Honnef, Germany. While the first meeting resulted in the book Modeling Languages in Mathematical Optimization, this book is an offspring of the 86th Meeting of the GOR working group which was again held in Bad Honnef under the title Modeling Languages in Mathematical Optimization."

Advances in the field of signal processing, nonlinear dynamics, statistics, and optimization theory, combined with marked improvement in instrumenta tion and development of computers systems, have made it possible to apply the power of mathematics to the task of understanding the human brain. This verita ble revolution already has resulted in widespread availability of high resolution neuroimaging devices in clinical as well as research settings. Breakthroughs in functional imaging are not far behind. Mathematical tech niques developed for the study of complex nonlinear systems and chaos already are being used to explore the complex nonlinear dynamics of human brain phys iology. Global optimization is being applied to data mining expeditions in an effort to find knowledge in the vast amount of information being generated by neuroimaging and neurophysiological investigations. These breakthroughs in the ability to obtain, store and analyze large datasets offer, for the first time, exciting opportunities to explore the mechanisms underlying normal brain func tion as well as the affects of diseases such as epilepsy, sleep disorders, movement disorders, and cognitive disorders that affect millions of people every year. Ap plication of these powerful tools to the study of the human brain requires, by necessity, collaboration among scientists, engineers, neurobiologists and clini cians. Each discipline brings to the table unique knowledge, unique approaches to problem solving, and a unique language.