الصفحة 24
الصفحة 24
Analysis, Modeling and Simulation of Multiscale Problems
This book reports recent mathematical developments in the Programme "Analysis, Modeling and Simulation of Multiscale Problems", which started as a German research initiative in 2006. Multiscale problems occur in many fields of science, such as microstructures in materials, sharp-interface models, many-particle systems and motions on different spatial and temporal scales in quantum mechanics or in molecular dynamics. The book presents current mathematical foundations of modeling, and proposes efficient numerical treatment.
An Invitation to Quantum Cohomology : Kontsevich's Formula for Rational Plane Curves
This book is an elementary introduction to stable maps and quantum cohomology, starting with an introduction to stable pointed curves, and culminating with a proof of the associativity of the quantum product. The viewpoint is mostly that of enumerative geometry, and the red thread of the exposition is the problem of counting rational plane curves. Kontsevich's formula is initially established in the framework of classical enumerative geometry, then as a statement about reconstruction for Gromov–Witten invariants, and finally, using generating functions, as a special case of the associativity of the quantum product.
An Introduction to the Relativistic Theory of Gravitation
The geometric interpretation of gravitation is one of the major foundations of modern theoretical physics. This primer introduces classical general relativity with emphasis on the clarity of conceptual structure and on the basic mathematical methods to build up systematically application skills. The wealth of physical phenomena entailed by the Einstein‘s equations is revealed with the help of specific models describing gravitomagnetism, gravitational waves, cosmology, gravitational collapse and black holes. End-of-chapter exercises complete the main text.
An Introduction to the Mathematics of Money : Saving and Investing
This is an undergraduate textbook on the basic aspects of personal savings and investing with a balanced mix of mathematical rigor and economic intuition. It uses routine financial calculations as the motivation and basis for tools of elementary real analysis rather than taking the latter as given. Proofs using induction, recurrence relations and proofs by contradiction are covered. Inequalities such as the Arithmetic-Geometric Mean Inequality and the Cauchy-Schwarz Inequality are used. Basic topics in probability and statistics are presented.
An introduction to relativistic processes and the standard model of electroweak interactions
The first part of the volume is devoted to the description of scattering processes in the context of relativistic quantum field theory. The use of the semi-classical approximation allows us to illustrate the relevant computation techniques in a reasonably small amount of space. Our approach to relativistic processes is original in many respects. The second part contains a detailed description of the construction of the standard model of electroweak interactions, with special attention to the mechanism of particle mass generation. The extension of the standard model to include neutrino masses is also described. We have included a number of detailed computations of cross sections and decay rates of pedagogical and phenomenological relevance.
An Introduction to Quantum and Vassiliev Knot Invariants
Provides an accessible introduction to knot theory, focussing on Vassiliev invariants, quantum knot invariants constructed via representations of quantum groups, and how these two apparently distinct theories come together through the Kontsevich invariant. Consisting of four parts, the book opens with an introduction to the fundamentals of knot theory, and to knot invariants such as the Jones polynomial. The second part introduces quantum invariants of knots, working constructively from first principles towards the construction of Reshetikhin-Turaev invariants and a description of how these arise through Drinfeld and Jimbo's quantum groups. Its third part offers an introduction to Vassiliev invariants, providing a careful account of how chord diagrams and Jacobi diagrams arise in the theory, and the role that Lie algebras play. The final part of the book introduces the Konstevich invariant. This is a universal quantum invariant and a universal Vassiliev invariant, and brings together these two seemingly different families of knot invariants. The book provides a detailed account of the construction of the Jones polynomial via the quantum groups attached to sl(2), the Vassiliev weight system arising from sl(2), and how these invariants come together through the Kontsevich invariant.
An Introduction to Manifolds
Manifolds, the higher-dimensional analogs of smooth curves and surfaces, are fundamental objects in modern mathematics. Combining aspects of algebra, topology, and analysis, manifolds have also been applied to classical mechanics, general relativity, and quantum field theory. In this streamlined introduction to the subject, the theory of manifolds is presented with the aim of helping the reader achieve a rapid mastery of the essential topics. By the end of the book the reader should be able to compute, at least for simple spaces, one of the most basic topological invariants of a manifold, its de Rham cohomology. Along the way the reader acquires the knowledge and skills necessary for further study of geometry and topology.
Algoritmi : Lo spirito dell’informatica = Algorithms : The spirit of information technology
Algorithms are the heart of computer science and mathematics, since without them the use of computers would not be possible. In this book, which in its English edition has been a longtime bestseller, Harel and Feldmann answer all questions relating to this topic. They talk about the evaluation, correctness and effectiveness of algorithms, but also clarify some doubts about programming techniques and also refer to the very current discussion on quantum computing. The book is useful both as a basic text for an introductory university course in computer science, and as a general introduction to natural sciences, mathematics or engineering.
Algorithms in Real Algebraic Geometry
The algorithmic problems of real algebraic geometry such as real root counting, deciding the existence of solutions of systems of polynomial equations and inequalities, finding global maxima or deciding whether two points belong in the same connected component of a semi-algebraic set appear frequently in many areas of science and engineering. In this first-ever graduate textbook on the algorithmic aspects of real algebraic geometry, the main ideas and techniques presented form a coherent and rich body of knowledge, linked to many areas of mathematics and computing.
Algorithms and computation ; Vol. 4288: 17th International symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings
This book constitutes the refereed proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC 2006, held in Kolkata, India in December 2006. The 73 revised full papers presented were carefully reviewed and selected from 255 submissions. The papers are organized in topical sections on algorithms and data structures, online algorithms, approximation algorithm, graphs, computational geometry, computational complexity, network, optimization and biology, combinatorial optimization and quantum computing, as well as distributed computing and cryptography.
Algorithms and computation ; Vol. 3827 ; 16th International symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings
This book constitutes the refereed proceedings of the 16th International Symposium on Algorithms and Computation, ISAAC 2005, held in China in 2005. The 112 revised full papers presented were carefully reviewed and selected from 549 submissions. The papers are organized in topical sections on computational geometry, computational optimization, graph drawing and graph algorithms, computational complexity, approximation algorithms, internet algorithms, quantum computing and cryptography, data structure, computational biology, experimental algorithm mehodologies and online algorithms, randomized algorithms, parallel and distributed algorithms, graph drawing and graph algorithms, computational complexity, combinatorial optimization, computational biology, computational complexity, computational optimization, computational geometry, approximation algorithms, graph drawing and graph algorithms, computational geometry, approximation algorithms, graph drawing and graph algorithms, and data structure.
Algorithms and computation ; 18th International symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings
This book presented algorithms and data structures, online algorithms, approximation algorithm, graphs, computational geometry, computational complexity, network, optimization and biology, combinatorial optimization and quantum computing, as well as distributed computing and cryptography.
Algorithms and Complexity ; 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings
Here are the refereed proceedings of the 6th Italian Conference on Algorithms and Computation, CIAC 2006. The 33 revised full papers presented together with 3 invited papers address such topics as sequential, parallel and distributed algorithms, data structures, approximation algorithms, randomized algorithms, on-line algorithms, graph algorithms, analysis of algorithms, algorithm engineering, algorithmic game theory, computational biology, computational complexity, communication networks, computational geometry, cryptography, discrete optimization, graph drawing, mathematical programming, and quantum algorithms.
Algorithms – ESA 2005 ; 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings
This volume contains the 75 contributed papers and the abstracts of the threeinvited lectures presented at the 13th Annual European Symposium on Algo-rithms (ESA 2005), held in Spain, 2005. respectively.Papers were solicited in all areas of algorithmic research, including but notlimited to algorithmic aspects of networks, approximation and on-line algo-rithms, computational biology, computational geometry, computational financeand algorithmic game theory, data structures, database and information re-trieval, external memory algorithms, graph algorithms, graph drawing, machinelearning, mobile computing, pattern matching and data compression, quantumcomputing, and randomized algorithms. The algorithms could be sequential,distributed, or parallel. Submissions were especially encouraged in the area ofmathematical programming and operations research, including combinatorialoptimization, integer programming, polyhedral combinatorics, and semidefiniteprogramming.Each extended abstract was submitted to one of the two tracks.
Algorithmic Foundation of Robotics VII : Selected Contributions of the 7th International Workshop on the Algorithmic Foundations of Robotics
This book contains the proceedings from the 2006 Workshop on the Algorithmic Foundations of Robotics. The 32 papers in this book span a wide variety of topics: from fundamental motion planning algorithms to applications in medicine and biology, but they have in common a foundation in the algorithmic problems of robotic systems.
Algèbre, Chapitres 1 à 3 = Algebra, Chapters 1 to 3
To do algebra is essentially to calculate, that is to say to perform, on elements of a set, (<algebraic operations n, the best-known example of which is provided by the (<four rules)) of elementary arithmetic. This is not the place to retrace the slow process of progressive abstraction by which the notion of algebraic operation, initially restricted to natural integers and to measurable quantities, gradually widened its field, as it grew. at the same time generalized the notion of ((number O, until, going beyond the latter, it came to apply to elements which no longer had any character ((numeric)>, for example to permutations of a - seems (see Historical Note in chap. 1).
Algebraic Geometry and Number Theory : In Honor of Vladimir Drinfeld's 50th Birthday
One of the most creative mathematicians of our times, Vladimir Drinfeld received the Fields Medal in 1990 for his groundbreaking contributions to the Langlands program and to the theory of quantum groups.These ten original articles by prominent mathematicians, dedicated to Drinfeld on the occasion of his 50th birthday, broadly reflect the range of Drinfeld's own interests in algebra, algebraic geometry, and number theory.
Algebraic and Proof-theoretic Aspects of Non-classical Logics : Papers in Honor of Daniele Mundici on the Occasion of His 60th Birthday
It profound connections between logic and such diverse fields of research as functional analysis, probability and measure theory, the geometry of toric varieties, piecewise linear geometry, and error-correcting codes. Several prominent logicians, mathematicians, and computer scientists
Aging, shaking, and cracking of infrastructures : From mechanics to concrete dams and nuclear structures
Focuses on the safety assessment of existing structures subjected to multi-hazard scenarios through advanced numerical methods. Whereas the focus is on concrete dams and nuclear containment structures, the presented methodologies can also be applied to other large-scale ones. This book is composed of seven sections: Fundamentals: theoretical coverage of solid mechnics, plasticity, fracture mechanics, creep, / seismology, dynamic analysis, probability and statistics / Damage: that can affect concrete structures, such as cracking of concrete, AAR, chloride ingress, and rebar corrosion, / Finite Element: formulation for both linear and nonlinear analysis including stress, heat and fracture mechanics, / Engineering Models: for soil/fluid-structure interaction, uncertainty quantification, probablilistic and random finite element analysis, machine learning, performance based earthquake engineering, ground motion intensity measures, seismic hazard analysis, capacity/fragility functions and damage indeces, / Applications to dams through potential failure mode analyses, risk-informed decision making, deterministic and probabilistic examples, / Applications to nuclear structures through modeling issues, aging management programs, critical review of some analyses, / Other applications and case studies: massive RC structures and bridges, detailed assessment of a nuclear containment structure evaluation for license renewal.
Advances of novel formulations in drug delivery
This is an endeavor to bring all the nanotechnology-based drug carriers under the umbrella of a single text. The drug carriers made up using natural as well as synthetic polymers are described in detail. The drug carriers include (though not limited to) particulates, vesicular, dendrimers, quantum dots, carbon nano tubes, nanocrystals, nanoemulsions, nanofibers
