الصفحة 49
الصفحة 49
Leray–Schauder Type Alternatives, Complementarity Problems and Variational Inequalities
Complementarity theory, a relatively new domain in applied mathematics, has deep connections with several aspects of fundamental mathematics and also has many applications in optimization, economics and engineering. The study of variational inequalities is another domain of applied mathematics with many applications to the study of certain problems with unilateral conditions. This book is the first to discuss complementarity theory and variational inequalities using Leray–Schauder type alternatives.
Leonhard Euler
Euler was not only by far the most productive mathematician in the history of mankind, but also one of the greatest scholars of all time. He attained, like only a few scholars, a degree of popularity and fame which may well be compared with that of Galilei, Newton, or Einstei .This book is based in part on unpublished sources and comes right out of the current research on Euler. It is entirely free of formulae as it has been written for a broad audience with interests in the history of culture and science.
Lectures on the Automorphism Groups of Kobayashi-Hyperbolic Manifolds
Presents a coherent exposition of recent results on complete characterization of Kobayashi-hyperbolic manifolds with high-dimensional groups of holomorphic automorphisms. These classification results can be viewed as complex-geometric analogues of those known for Riemannian manifolds with high-dimensional isotropy groups, that were extensively studied in the 1950s-70s. The common feature of the Kobayashi-hyperbolic and Riemannian cases is the properness of the actions of the holomorphic automorphism group and the isometry group on respective manifolds.
Lectures on Symplectic Geometry
Provides a fast introduction to symplectic geometry for graduate students with some knowledge of differential geometry, de Rham theory and classical Lie groups. This text addresses symplectomorphisms, local forms, contact manifolds, compatible almost complex structures, Kaehler manifolds, hamiltonian mechanics, moment maps, symplectic reduction and symplectic toric manifolds. It contains guided problems, called homework, designed to complement the exposition or extend the reader's understanding.
Lectures on Probability Theory and Statistics : Ecole d'Eté de Probabilités de Saint-Flour XXXIII - 2003
Contains two of the three lectures that were given at the 33rd Probability Summer School in Saint-Flour (July 6-23, 2003). Amir Dembo’s course is devoted to recent studies of the fractal nature of random sets, focusing on some fine properties of the sample path of random walk and Brownian motion. In particular, the cover time for Markov chains, the dimension of discrete limsup random fractals, the multi-scale truncated second moment and the Ciesielski-Taylor identities are explored. Tadahisa Funaki’s course reviews recent developments of the mathematical theory on stochastic interface models, mostly on the so-called nabla varphi interface model. The results are formulated as classical limit theorems in probability theory, and the text serves with good applications of basic probability techniques.
Lectures on Algebraic Geometry I : Sheaves, Cohomology of Sheaves, and Applications to Riemann Surfaces
This book and the following second volume is an introduction into modern algebraic geometry. In the first volume the methods of homological algebra, theory of sheaves, and sheaf cohomology are developed. These methods are indispensable for modern algebraic geometry, but they are also fundamental for other branches of mathematics and of great interest in their own.In the last chapter of volume I these concepts are applied to the theory of compact Riemann surfaces. In this chapter the author makes clear how influential the ideas of Abel, Riemann and Jacobi were and that many of the modern methods have been anticipated by them.
Lectures on Advances in Combinatorics
The main focus of these lectures is basis extremal problems and inequalities – two sides of the same coin. Additionally they prepare well for approaches and methods useful and applicable in a broader mathematical context. Highlights of the book include a solution to the famous 4m-conjecture of Erdös/Ko/Rado 1938, one of the oldest problems in combinatorial extremal theory, an answer to a question of Erdös (1962) in combinatorial number theory "What is the maximal cardinality of a set of numbers smaller than n with no k+1 of its members pair wise relatively prime?", and the discovery that the AD-inequality implies more general and sharper number theoretical inequalities than for instance Behrend's inequality.
Learning Theory ; Vol. 4005 ; 19th Annual Conference on Learning Theory, COLT 2006, Pittsburgh, PA, USA, June 22-25, 2006, Proceedings
Constitutes the refereed proceedings of the 19th Annual Conference on Learning Theory, COLT 2006, held in Pittsburgh, Pennsylvania, USA in June 2006. The 43 revised full papers presented together with 2 articles on open problems and 3 invited lectures were carefully reviewed and selected from a total of 102 submissions. The papers cover a wide range of topics including clustering, un- and semisupervised learning, statistical learning theory, regularized learning and kernel methods, query learning and teaching, inductive inference, learning algorithms and limitations on learning, online aggregation, online prediction and reinforcement learning.
Learning theory ; 20th Annual Conference on Learning theory, COLT 2007, San Diego, CA, USA, June 13-15, 2007, Proceedings
It covers unsupervised, semisupervised and active learning, statistical learning theory, inductive inference, regularized learning, kernel methods, SVM, online and reinforcement learning, learning algorithms and limitations on learning, dimensionality reduction, as well as open problems.
Learning and Intelligent Optimization ; 2nd International Conference, LION 2007 II, Trento, Italy, December 8-12, 2007. Selected Papers
The papers cover current issues of machine learning, artificial intelligence, mathematical programming and algorithms for hard optimization problems and are organized in topical sections on improving optimization through learning, variable neighborhood search, insect colony optimization, applications, new paradigms, cliques, stochastic optimization, combinatorial optimization, fitness and landscapes, and particle swarm optimization.
Le raisonnement bayésien : Modélisation et inférence = Bayesian reasoning : Modeling and inference
Describes in detail the practice of the Bayesian statistical approach using many examples chosen for their educational interest. The first part gives the general principles of statistical modeling making it possible to supervise but also to come to the aid of the imagination of the apprentice modeler. By examining examples of increasing difficulty, the reader forges the keys to building their own model. The second part presents the most useful calculation algorithms for estimating the unknowns of the model. Each inference method is presented and illustrated by numerous application cases.
Le choix bayésien: Principes et pratique
Covers the so-called Bayesian approach to statistical inference and in particular its decision-making aspects. The bases of this axiomatics (choice of the a priori, optimal decisions, tests and regions of confidence) are discussed in detail, as well as more recent openings of Bayesian analysis such as the choice of models, the use of numerical methods. Stochastic approximation (MCMC), the theory of noninformative laws (Berger-Bernardo axioms) and the relation to the classical theory of admissibility. Each chapter is completed by an extensive series of exercises of increasing difficulty and by bibliographical notes on the themes addressed. This book can be used in a Master's program in Applied Mathematics, Biometrics, Econometrics or any other program that uses quantitative information processing techniques. It only requires a basic course in probability theory and mathematical statistics as a preliminary.
Lattices and Ordered Sets
This book is intended to be a thorough introduction to the subject of ordered sets and lattices, with an emphasis on the latter. It can be used for a course at the graduate or advanced undergraduate level or for independent study. Prerequisites are kept to a minimum, but an introductory course in abstract algebra is highly recommended, since many of the examples are drawn from this area. The book has an excellent choice of topics, including a chapter on well ordering and ordinal numbers, which is not usually found in other texts. The approach is user-friendly and the presentation is lucid. There are more than 240 carefully chosen exercises.
Lattices and Ordered Algebraic Structures
Lattices and Ordered Algebraic Structures provides a lucid and concise introduction to the basic results concerning the notion of an order. Although as a whole it is mainly intended for beginning postgraduates, the prerequisities are minimal and selected parts can profitably be used to broaden the horizon of the advanced undergraduate. The treatment is modern, with a slant towards recent developments in the theory of residuated lattices and ordered regular semigroups.
Lattice : Multivariate Data Visualization with R
R is rapidly growing in popularity as the environment of choice for data analysis and graphics both in academia and industry. Lattice brings the proven design of Trellis graphics (originally developed for S by William S. Cleveland and colleagues at Bell Labs) to R, considerably expanding its capabilities in the process. Lattice is a powerful and elegant high level data visualization system that is sufficient for most everyday graphics needs, yet flexible enough to be easily extended to handle demands of cutting edge research. Written by the author of the lattice system, this book describes it in considerable depth, beginning with the essentials and systematically delving into specific low levels details as necessary. No prior experience with lattice is required to read the book, although basic familiarity with R is assumed.
LATIN 2006 : Theoretical Informatics ; 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings
This book constitutes the refereed proceedings of the 7th International Symposium, Latin American Theoretical Informatics, LATIN 2006, held in March 2006. The 66 revised full papers presented together with seven invited papers were carefully reviewed and selected from 224 submissions. The papers presented are devoted to a broad range of topics in theoretical computer science with a focus on algorithmics and computations related to discrete mathematics as well as on cryptography, data compression and Web applications.
Large-Scale Nonlinear Optimization
Large-Scale Nonlinear Optimization reviews and discusses recent advances in the development of methods and algorithms for nonlinear optimization and its applications, focusing on the large-dimensional case, the current forefront of much research.The chapters of the book including theoretical analysis, algorithmic development, implementation issues and applications.
Large-Scale Cognitive Assessment : Analyzing PIAAC Data
Summarises existing analysing techniques using data from PIAAC, a study initiated by the OECD that assesses key cognitive and occupational skills of the adult population in more than 40 countries. The approximately 65 PIAAC datasets that has been published worldwide to date has been widely received and used by an interdisciplinary research community
Laplacian Eigenvectors of Graphs : Perron-Frobenius and Faber-Krahn Type Theorems
Eigenvectors of graph Laplacians have not, to date, been the subject of expository articles and thus they may seem a surprising topic for a book. The authors propose two motivations for this new LNM volume: (1) There are fascinating subtle differences between the properties of solutions of Schrödinger equations on manifolds on the one hand, and their discrete analogs on graphs. (2) "Geometric" properties of (cost) functions defined on the vertex sets of graphs are of practical interest for heuristic optimization algorithms. The observation that the cost functions of quite a few of the well-studied combinatorial optimization problems are eigenvectors of associated graph Laplacians has prompted the investigation of such eigenvectors.
Lagrangian Transport in Geophysical Jets and Waves : The Dynamical Systems Approach
This book provides an accessible introduction to a new set of methods for the analysis of Lagrangian motion in geophysical flows. These methods were originally developed in the abstract mathematical setting of dynamical systems theory, through a geometric approach to differential equations. Despite the recent developments in this field and the existence of a substantial body of work on geophysical fluid problems in the dynamical systems and geophysical literature, this is the first introductory text that presents these methods in the context of geophysical fluid flow. The book is organized into seven chapters; the first introduces the geophysical context and the mathematical models of geophysical fluid flow that are explored in subsequent chapters. The second and third cover the simplest case of steady flow, develop basic mathematical concepts and definitions, and touch on some important topics from the classical theory of Hamiltonian systems. The fundamental elements and methods of Lagrangian transport analysis in time-dependent flows that are the main subject of the book are described in the fourth, fifth, and sixth chapters. The seventh chapter gives a brief survey of some of the rapidly evolving research in geophysical fluid dynamics that makes use of this new approach. Related supplementary material, including a glossary and an introduction to numerical methods, is given in the appendices.
