الصفحة 5
الصفحة 5
Discrete and computational geometry; Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004
This book constitutes the thoroughly refereed post-proceedings of the Japanese Conference on Discrete Computational Geometry, JCDCG 2004, held in Tokyo, Japan in October 2004, to honor Janos Pach on his fiftieth year. The 20 revised full papers presented were carefully selected during two rounds of reviewing and improvement from over 60 talks at the conference. All current issues in discrete algorithmic geometry are addressed.
Diophantine Approximation : Festschrift for Wolfgang Schmidt
This volume contains 22 research and survey papers on recent developments in the field of diophantine approximation. The first article by Hans Peter Schlickewei is devoted to the scientific work of Wolfgang Schmidt. Further contributions deal with the subspace theorem and its applications to diophantine equations and to the study of linear recurring sequences. The articles are either in the spirit of more classical diophantine analysis or of geometric or combinatorial flavor. In particular, estimates for the number of solutions of diophantine equations as well as results concerning congruences and polynomials are established. Furthermore, the volume contains transcendence results for special functions and contributions to metric diophantine approximation and to discrepancy theory.
Digital Simulation in Electrochemistry
The book shows how to numerically solve the parabolic partial differential equations (pdes) encountered in electroanalytical chemistry. It does this in a didactic manner, by first introducing the basic equations to be solved and some model systems as text cases, for which solutions exist. Then it treats basic numerical approximation for derivatives and techniques for the numerical solution of ordinary differential equations, from which the more complicated methods for pdes can be derived. The major implicit methods are described in detail, and the handling of homogeneous chemical reactions, including coupled and nonlinear cases, is detailed. More advanced techniques are presented briefly, as well as some commercially available program packages.
Data assimilation fundamentals : A unified formulation of the state and parameter estimation problem
This textbook's significant contribution is the unified derivation of data-assimilation techniques from a common fundamental and optimal starting point, namely Bayes' theorem. Unique for this book is the "top-down" derivation of the assimilation methods. It starts from Bayes theorem and gradually introduces the assumptions and approximations needed to arrive at today's popular data-assimilation methods. This strategy is the opposite of most textbooks and reviews on data assimilation that typically take a bottom-up approach to derive a particular assimilation method.
Cosmic Ray Interactions, Propagation, and Acceleration in Space Plasmas
"The book consists of four Chapters. Chapter 1 shortly describes main properties of space plasmas and primary CR, different types of CR interactions with space plasmas components Chapter 2 considers the problem of CR propagation in space plasmas described by the kinetic equation and different types of diffusion approximations ,Chapter 3 is devoted to CR non-linear effects in space plasmas caused by CR pressure and CR kinetic stream instabilities with the generation of Alfvèn turbulence In Chapter 4 different processes of CR acceleration in space plasmas are considered: the development of the Fermi statistical mechanism, acceleration in the turbulent plasma, Alfven mechanism of magnetic pumping, induction mechanisms, acceleration during magnetic collapse and compression, cumulative acceleration mechanism near the zero lines of a magnetic field, acceleration in shear flows, shock-wave diffusion (regular) acceleration. The book ends with a list providing more than 1,300 full references, a discussion on future developments and unsolved problems, as well as Object and Author indexes. "
Convergence and Applications of Newton-type Iterations
Recent results in local convergence and semi-local convergence analysis constitute a natural framework for the theoretical study of iterative methods. This monograph provides a comprehensive study of both basic theory and new results in the area. Each chapter contains new theoretical results and important applications in engineering, modeling dynamic economic systems, input-output systems, optimization problems, and nonlinear and linear differential equations. Several classes of operators are considered, including operators without Lipschitz continuous derivatives, operators with high order derivatives, and analytic operators. Each section is self-contained. Examples are used to illustrate the theory and exercises are included at the end of each chapter.
Control of Uncertain Systems : Modelling, Approximation, and Design; A Workshop on the Occasion of Keith Glover's 60th Birthday
This Festschrift contains a collection of articles by friends, co-authors, colleagues, and former Ph.D. students of Keith Glover, Professor of Engineering at the University of Cambridge, on the occasion of his sixtieth birthday. Professor Glover's scientific work spans a wide variety of topics, the main themes being system identification, model reduction and approximation, robust controller synthesis, and control of aircraft and engines. The articles in this volume are a tribute to Professor Glover's seminal work in these areas.
Computing and Combinatorics ; Vol. 4112 ; 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings
The papers are organized in topical sections on computational economics, finance, and management, graph algorithms, computational complexity and computability, quantum computing, computational biology and medicine, computational geometry, graph theory, and more.
Computing and Combinatorics ; 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings
The Book covers most aspects of theoretical computer scienceand combinatorics related to computing.It exploring research, development, and novel applications of computing and combinatorics.
Computer science : Theory and applications ; 15th International computer science symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 – July 3, 2020, Proceedings
This book constitutes the proceedings of the 15th International Computer Science Symposium in Russia, CSR 2020, held in Yekaterinburg, Russia, in June 2020. The 25 full papers and 6 invited papers were carefully reviewed and selected from 49 submissions. The papers cover a broad range of topics, such as: algorithms and data structures; computational complexity, including hardness of approximation and parameterized complexity; randomness in computing, approximation algorithms, fixed-parameter algorithms; combinatorial optimization, constraint satisfaction, operations research; computational geometry; string algorithms; formal languages and automata, including applications to computational linguistics; codes and cryptography; combinatorics in computer science; computational biology; applications of logic to computer science, proof complexity; database theory; distributed computing; fundamentals of machine learning, including learning theory, grammatical inference and neural computing; computational social choice; quantum computing and quantum cryptography; theoretical aspects of big data.
Computational Science and High Performance Computing II ; The 2nd Russian-German Advanced Research Workshop, Stuttgart, Germany, March 14 to 16, 2005
This volume contains 27 contributions to the Second Russian-German Advanced Research Workshop on Computational Science and High Performance Computing presented in March 2005 at Stuttgart, Germany. The workshop was organized jointly by the High Performance Computing Center Stuttgart (HLRS) and the Russian Institute for Computational Technologies (ICT SB RAS) The contributions range from computer science, mathematics and high performance computing to applications in mechanical and aerospace engineering. They show a wealth of theoretical work and simulation experience with a potential of bringing together theoretical mathematical modelling and usage of high performance computing systems presenting the state of the art of computational technologies.
Computational Methods in Transport ; Granlibakken 2004
Based on a series of lectures given in the Granlibakken workshop was devoted to providing a forum, where computational transport researchers could communicate their methods with their results. This book presents computational transport in mathematics, astrophysics, high energy density physics, atmospheric physics, oceanography, and plant canopies.
Computational methods for nanoscale applications : Particles, plasmons and waves
Computational Methods for Nanoscale Applications: Particles, Plasmons and Waves presents new perspectives on modern nanoscale problems where fundamental science meets technology and computer modeling. This book describes well-known computational techniques such as finite-difference schemes, finite element analysis and Ewald summation, as well as a new finite-difference calculus of Flexible Local Approximation MEthods (FLAME) that qualitatively improves the numerical accuracy in a variety of problems. Application areas in the book include long-range particle interactions in homogeneous and heterogeneous media, electrostatics of colloidal systems, wave propagation in photonic crystals, photonic band structure, plasmon field enhancement, and metamaterials with backward waves and negative refraction.
Computational Methods for Algebraic Spline Surfaces : ESF Exploratory Workshop
The papers included in this volume provide an overview about the state-of-the-art in approximative implicitization and various related topics, including both the theoretical basis and the existing computational techniques. The novel idea of approximate implicitization has strengthened the existing link between Computer Aided Geometric Design and classical algebraic geometry. There is a growing interest from researchers and professionals both in CAGD and Algebraic Geometry, to meet and combine knowledge and ideas, in order to better solve industrial--type challenges, as well as to initiate new directions for basic research. This volume will support this exchange of ideas between the various communities.
Computational Many-Particle Physics
Complicated many-particle problems abound in nature and in research alike. Plasma physics, statistical physics and condensed matter physics, as primary examples, are all heavily dependent on efficient methods for solving such problems. Addressing graduate students and young researchers, this book presents an overview and introduction to state-of-the-art numerical methods for studying interacting classical and quantum many-particle systems. A broad range of techniques and algorithms are covered, and emphasis is placed on their implementation on modern high-performance computers.
Computational Geometry and Graph Theory ; International Conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007. Revised Selected Papers
This book constitutes the thoroughly refereed post-conference proceedings of the Kyoto Conference on Computational Geometry and Graph Theory, KyotoCGGT 2007, held in Kyoto, Japan, in June 2007.
Computational Electromagnetics
Computational Electromagnetics is a young and growing discipline, expanding as a result of the steadily increasing demand for software for the design and analysis of electrical devices. This book introduces three of the most popular numerical methods for simulating electromagnetic fields: the finite difference method, the finite element method and the method of moments. In particular it focuses on how these methods are used to obtain valid approximations to the solutions of Maxwell's equations, using, for example, "staggered grids" and "edge elements." The main goal of the book is to make the reader aware of different sources of errors in numerical computations, and also to provide the tools for assessing the accuracy of numerical methods and their solutions. To reach this goal, convergence analysis, extrapolation, von Neumann stability analysis, and dispersion analysis are introduced and used frequently throughout the book. Another major goal of the book is to provide students with enough practical understanding of the methods so they are able to write simple programs on their own. To achieve this, the book contains several MATLAB programs and detailed description of practical issues such as assembly of finite element matrices and handling of unstructured meshes.
Combinatorial pattern matching ; Vol.4009) ; 17th Annual Symposium, CPM 2006, Barcelona, Spain, July 5-7, 2006, Proceedings
The book presents 33 revised full papers together with 3 invited talks, organized in topical sections on data structures, indexing data structures, probabilistic and algebraic techniques, applications in molecular biology, string matching, data compression, and dynamic programming
Combinatorial pattern matching ; 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007, Proceedings
This book presented original research contri- tions on computational pattern matching and analysis, data compression and compressed text processing, sufix arrays and trees, and computational biology. Combinatorial Pattern Matching addresses issues of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays.The goal is to derive non-trivial combinatorial properties of such structures and to exploit these properties in order to either achieve superior performance for the corresponding computational problems or pinpoint conditions under which searches cannot be performed eficiently.
Combinatorial pattern matching ; 12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1-4, 2001 Proceedings
This book constitutes the refereed proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, CPM 2001, held in Jerusalem, Israel, in July 2001. The 21 revised papers presented together with one invited paper were carefully reviewed and selected from 35 submissions. The papers are devoted to current theoretical and algorithmic issues of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays as well as to advanced applications of CPM in areas such as the Internet, computational biology, multimedia systems, information retrieval, data compression, coding, computer vision, and pattern recognition.
