الصفحة 4
الصفحة 4
Extreme Nonlinear Optics : An Introduction
Following the birth of the laser in 1960, the field of "nonlinear optics" rapidly emerged. Today, laser intensities and pulse durations are readily available, for which the concepts and approximations of traditional nonlinear optics no longer apply. In this regime of "extreme nonlinear optics," a large variety of novel and unusual effects arise, for example frequency doubling in inversion symmetric materials or high-harmonic generation in gases, which can lead to attosecond electromagnetic pulses or pulse trains. Other examples of "extreme nonlinear optics" cover diverse areas such as solid-state physics, atomic physics, relativistic free electrons in a vacuum and even the vacuum itself. This book starts with an introduction to the field based primarily on extensions of two famous textbook examples, namely the Lorentz oscillator model and the Drude model. Here the level of sophistication should be accessible to any undergraduate physics student. Many graphical illustrations and examples are given. The following chapters gradually guide the student towards the current "state of the art" and provide a comprehensive overview of the field. Every chapter is accompanied by exercises to deepen the reader's understanding of important topics, with detailed solutions at the end of the book.
Experimental Algorithms ; 7th International Workshop, WEA 2008 Provincetown, MA, USA, May 30-June 1, 2008 Proceedings
The Workshop on Experimental Algorithms, WEA, is intended to be an international forum for research on the experimental evaluation and engineering of algorithms, as well as in various aspects of computational optimization and its applications. The emphasis of the workshop is the use of experimental me- ods to guide the design, analysis, implementation, and evaluation of algorithms, heuristics, and optimization programs. WEA 2008 was held at the Provincetown Inn, Provincetown, MA, USA, on May 30 – June 1, 2008. This was the seventh workshop of the series.
Experimental Algorithms ; 6th International Workshop, WEA 2007, Rome, Italy, June 6-8, 2007, Proceedings
Fostering and disseminating high quality research results focused on the experimental analysis of algorithms the papers are devoted to the design, analysis, implementation, experimental evaluation, and engineering of efficient algorithms. Among the application areas addressed are most fields applying advanced algorithmic techniques, such as combinatorial optimization, approximation, graph theory, discrete mathematics, data mining, simulation, cryptography and security, scheduling, searching, sorting, string matching, coding, networking, etc.
Experimental Algorithms ; 5th International Workshop, WEA 2006, Cala Galdana, Menorca, Spain, May 24-27, 2006, Proceedings
This book constitutes the refereed proceedings of the 5th International Workshop on Experimental and Efficient Algorithms, WEA 2006, held in Cala Galdana, Menorca, Spain in May 2006. The 26 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 92 submissions. The book is devoted to the design, analysis, implementation, experimental evaluation, and engineering of efficient algorithms. Among the application areas addressed are most fields applying advanced algorithmic techniques.
Evolutionary Multi-Criterion Optimization ; 4th International Conference, EMO 2007, Matsushima, Japan, March 5-8, 2007, Proceedings
Multicriterion optimization refers to problems with two or more objectives (normally in conflict with each other) which must be simultaneously satisfied. Evolutionary algorithms have been used for solving multicriterion optimization problems for over two decades, gaining an increasing attention from industry. This book included four keynote speakers: Hirotaka Nakayama on aspiration level methods, Kay Chen Tan on large and computationally intensive real-world MO optimization problems, Carlos Fonseca on decision making, and Gary B. Lamont on design of large-scale network centric systems.
Evolutionary Multi-Criterion Optimization ; 3rd International Conference, EMO 2005, Guanajuato, Mexico, March 9-11, 2005, Proceedings
Constitutes the refereed proceedings of the Third International Conference on Evolutionary Multi-Criterion Optimization, EMO 2005, held in Guanajuato, Mexico, in March 2005.
Ernst Equation and Riemann Surfaces : Analytical and Numerical Methods
Exact solutions to Einstein`s equations have been useful for the understanding of general relativity in many respects. They have led to physical concepts as black holes and event horizons and helped to visualize interesting features of the theory. In addition they have been used to test the quality of various approximation methods and numerical codes. The most powerful solution generation methods are due to the theory of Integrable Systems. In the case of axisymmetric stationary spacetimes the Einstein equations are equivalent to the completely integrable Ernst equation. In this volume the solutions to the Ernst equation associated to Riemann surfaces are studied in detail and physical and mathematical aspects of this class are discussed both analytically and numerically.
Electron Scattering in Solid Matte r: A Theoretical and Computational Treatise
Addressing graduate students and researchers, this book gives a very detailed theoretical and computational description of multiple scattering in solid matter. Particular emphasis is placed on solids with reduced dimensions, on full potential approaches and on relativistic treatments. For the first time approaches such as the Screened Korringa-Kohn-Rostoker method that have emerged during the last 5 – 10 years are reviewed, considering all formal steps such as single-site scattering, structure constants and screening transformations, and also the numerical point of view. Furthermore, a very general approach is presented for solving the Poisson equation, needed within density functional theory in order to achieve self-consistency. Going beyond ordered matter and translationally invariant systems, special chapters are devoted to the Coherent Potential Approximation and to the Embedded Cluster Method, used, for example, for describing nanostructured matter in real space. In a final chapter, physical properties related to the (single-particle) Green’s function, such as magnetic anisotropies, interlayer exchange coupling, electric and magneto-optical transport and spin-waves, serve to illustrate the usefulness of the methods described.
Efficient Approximation and Online Algorithms : Recent Progress on Classical Combinatorial Optimization Problems and New Applications
This book provides a good opportunity for computer science practitioners and researchers to get in sync with current state-of-the-art and future trends in the field of combinatorial optimization and online algorithms. Recent advances in this area are presented focusing on the design of efficient approximation and on-line algorithms. One central idea in the book is to use a linear program relaxation of the problem, randomization and rounding techniques.
Effective Computational Geometry for Curves and Surfaces
Computational geometry emerged as a discipline in the seventies and has had considerable success in improving the asymptotic complexity of the solutions to basic geometric problems including constructions of data structures,convex hulls, triangulations, Voronoi diagrams and geometric arrangements as well as geometric optimisation. The goal of this book is to take into consideration the multidisciplinary nature of the problem and to provide solid mathematical and algorithmic foundations for effiective computational geometry fo rcurves and surfaces. This book covers two main approaches. In a first part, we discuss exact geometric algorithms for curves and s- faces. We revisit two prominent data structures of computational geometry, namely arrangements (Chap. 1) and Voronoi diagrams (Chap. 2) in order to understand how these structures, which are well-known for linear objects, behave when de?ned on curved objects.
Dynamic General Equilibrium Modelling : Computational Methods and Applications
Modern business cycle theory and growth theory uses stochastic dynamic general equilibrium models. Many mathematical tools are needed to solve these models. The book presents various methods for computing the dynamics of general equilibrium models. In part I, the representative-agent stochastic growth model is solved with the help of value function iteration, linear and linear quadratic approximation methods, parameterised expectations and projection methods. In order to apply these methods, fundamentals from numerical analysis are reviewed in detail. Part II discusses methods for solving heterogeneous-agent economies. In such economies, the distribution of the individual state variables is endogenous. This part of the book also serves as an introduction to the modern theory of distribution economics. Applications include the dynamics of the income distribution over the business cycle or the overlapping-generations model.
Duality for Nonconvex Approximation and Optimization
Most recently, many researchers have been studying more complicated classes of problems that still can be studied by means of convex analysis, so-called "anticonvex" and "convex-anticonvex" optimizaton problems.
Drug target selection and validation
Focuses on the computational aspects of early drug discovery, drug target identification, and validation. It revises current classical paradigms in target and phenotypic-based drug design with still ingrained approximations and concepts and discusses the research in the new network approach concept that include kinetic selectivity and metabolic analysis. Many often-overlooked approximations and concepts in drug discovery are fully covered. Drug Target Selection and Validation includes both introductory sections and research-based sections to be of use to both students and research scientists in drug discovery, design, kinetics and metabolic analysis. Pharmaceutical scientists, pharmaceutics, drug developers, pharmacologists, biomedical researchers in computer science, medicinal chemists, and precision medicine developers benefit from the information provided. The book concludes with a chapter on chemical and structural databases.
Domain Decomposition Methods for the Numerical Solution of Partial Differential Equations
Domain decomposition methods are divide and conquer methods for the parallel and computational solution of partial differential equations of elliptic or parabolic type. They include iterative algorithms for solving the discretized equations, techniques for non-matching grid discretizations and techniques for heterogeneous approximations. This book serves as an introduction to this subject, with emphasis on matrix formulations. The topics studied include Schwarz, substructuring, Lagrange multiplier and least squares-control hybrid formulations, multilevel methods, non-self adjoint problems, parabolic equations, saddle point problems (Stokes, porous media and optimal control), non-matching grid discretizations, heterogeneous models, fictitious domain methods, variational inequalities, maximum norm theory, eigenvalue problems, optimization problems and the Helmholtz scattering problem. Selected convergence theory is included.
Domain Decomposition Methods - Algorithms and Theory
This book offers a comprehensive presentation of some of the most successful and popular domain decomposition preconditioners for finite and spectral element approximations of partial differential equations. It places strong emphasis on both algorithmic and mathematical aspects. It covers in detail important methods such as FETI and balancing Neumann-Neumann methods and algorithms for spectral element methods.
Distributed computing and networking ; 8th International conference, ICDCN 2006, Guwahati, India, December 27-30, 2006, Proceedings
VI realm between distributed computing and networking, namely, Modeling Biological Networks, Network Security, Algorithmic Issues in Wireless Sensor Networks, and Optical Networking. This was made possible by the efforts of the Tutorial Chairs, Sr- har Iyer and Pinaki Mitra. The Organizing Committee worked hard to ensure that the participants enjoyed a comfortable stay and the technical meetings proceeded as smoothly as possible.
Distributed computing ; Vol. 4167 ; 20th International Symposium, DISC 2006, Stockholm, Sweden, September 18-20, 2006, Proceedings
DISC, the International Symposium on DIStributed Computing, is an annual forum for presentation of research on all facets of distributed computing, inc- ding the theory, design, analysis, implementation, and application of distributed systems and networks. The 20th anniversary edition of DISC was held on S- tember 18-20, 2006, in Stockholm, Sweden. There were 145 extended abstracts submitted to DISC this year, and this - lume contains the 35 contributions selected by the Program Committee and one invited paper among these 145 submissions.
Distributed Computing ; 22nd International Symposium, DISC 2008, Arcachon, France, September 22-24, 2008. Proceedings
This book constitutes the refereed proceedings of the 22nd International Symposium on Distributed Computing, DISC 2008, held in Arcachon, France, in September 2008.
Distributed Computing ; 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings
This book covers all current issues in distributed computing, including theory, design, analysis, implementation, and application of distributed systems and networks.
Discrete-Time Markov Chains : Two-Time-Scale Methods and Applications
The motivation stems from existing and emerging applications in optimization and control of complex hybrid Markovian systems in manufacturing, wireless communication, and financial engineering. Much effort in this book is devoted to designing system models arising from these applications, analyzing them via analytic and probabilistic techniques, and developing feasible computational algorithms so as to reduce the inherent complexity. This book presents results including asymptotic expansions of probability vectors, structural properties of occupation measures, exponential bounds, aggregation and decomposition and associated limit processes, and interface of discrete-time and continuous-time systems. One of the salient features is that it contains a diverse range of applications on filtering, estimation, control, optimization, and Markov decision processes, and financial engineering.
