الصفحة 29
الصفحة 29
Computational Noncommutative Algebra and Applications
The fusion of algebra, analysis and geometry, and their application to real world problems, have been dominant themes underlying mathematics for over the years. This book features topics such as: signal and image processing in remote sensing, computer vision, medical image processing, biological signal processing, geometric algebras, and more.
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 in Transport : Verification and Validation
The focus of this book deals with a cross cutting issue affecting all particle transport algorithms and applications; verification and validation (V&V). In other words, are the equations being solved correctly and are the correct equations being solved? Verification and validation assures a scientist, engineer or mathematician that a simulation code is a mirror of reality and not just an expensive computer game. In this book, we will learn what the astrophysicist, atmospheric scientist, mathematician or nuclear engineer do to assess the accuracy of their code. What convergence studies, what error analysis, what problems do each field use to benchmark and ascertain the accuracy of their transport simulations.
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 intelligence for engineering and manufacturing
Unlike traditional computing, Computational Intelligence is tolerant of imprecise information, partial truth and uncertainty. This book presents a collection of contributions on a focused treatment of important elements of CI, centred on its key element: learning.
Computational genome analysis : An introduction
Computational Genome Analysis: An Introduction presents the foundations of key problems in computational molecular biology and bioinformatics. It focuses on computational and statistical principles applied to genomes, and introduces the mathematics and statistics that are crucial for understanding these applications. The book is appropriate for a one-semester course for advanced undergraduate or beginning graduate students, and it can also introduce computational biology to computer scientists, mathematicians, or biologists who are extending their interests into this exciting field.
Computational Ergodic Theory
Ergodic theory is hard to study because it is based on measure theory, which is a technically difficult subject to master for ordinary students, especially for physics majors. Many of the examples are introduced from a different perspective than in other books and theoretical ideas can be gradually absorbed while doing computer experiments. Theoretically less prepared students can appreciate the deep theorems by doing various simulations. The computer experiments are simple but they have close ties with theoretical implications. The last chapter explains the relation between entropy and data compression, which belongs to information theory and not to ergodic theory.
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.
Computational Commutative : Algebra 2
The main part of this book is a breathtaking passeggiata through the computational domains of graded rings and modules and their Hilbert functions. Besides Gröbner bases, we encounter Hilbert bases, border bases, SAGBI bases, and even SuperG bases. The tutorials traverse areas ranging from algebraic geometry and combinatorics to photogrammetry, magic squares, coding theory, statistics, and automatic theorem proving. Whereas in the first volume gardening and chess playing were not treated, in this volume they are. This is a book for learning, teaching, reading, and most of all, enjoying the topic at hand. The theories it describes can be applied to anything from children's toys to oil production. If you buy it, probably one spot on your desk will be lost forever!
Combinatorics of Coxeter Groups
Coxeter groups are of central importance in several areas of algebra, geometry, and combinatorics. This clear and rigorous exposition focuses on the combinatorial aspects of Coxeter groups, such as reduced expressions, partial order of group elements, enumeration, associated graphs and combinatorial cell complexes, and connections with combinatorial representation theory. While Coxeter groups have already been exposited from algebraic and geometric perspectives, this text is the first one to focus mainly on the combinatorial aspects of Coxeter groups. The first part of the book provides a self-contained introduction to combinatorial Coxeter group theory. The emphasis here is on the combinatorics of reduced decompositions, Bruhat order, weak order, and some aspects of root systems. The second part deals with more advanced topics, such as Kazhdan-Lusztig polynomials and representations, enumeration, and combinatorial descriptions of the classical finite and affine Weyl groups. A wide variety of exercises, ranging from easy to quite difficult are also included.
Combinatorics and Graph Theory
This book covers a wide variety of topics in combinatorics and graph theory. It includes results and problems that cross subdisciplines, emphasizing relationships between different areas of mathematics. In addition, recent results appear in the text, illustrating the fact that mathematics is a living discipline.
Combinatorial Stochastic Processes : Ecole d'Eté de Probabilités de Saint-Flour XXXII - 2002
This volume contains the course “Combinatorial stochastic processes” of Professor Pitman. We cordially thank the author for his performance in Saint-Flour and for these notesThere is particular focus on the theory of random combinatorial structures such as partitions, permutations, trees, forests, and mappings, and connections between the asymptotic theory of enumeration of such structures and the theory of stochastic processes like Brownian motion and Poisson processes.
Combinatorial Optimization : Theory and Algorithms
Puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It has arisen as the basis of several courses on combinatorial optimization and more special topics at graduate level. Since the complete book contains enough material for at least four semesters (4 hours a week), one usually selects material in a suitable way. The book contains complete but concise proofs, also for many deep results, some of which did not appear in a book before. Many very recent topics are covered as well, and many references are provided. Thus this book represents the state of the art of combinatorial optimization. This third edition contains a new chapter on facility location problems, an area which has been extremely active in the past few years. Furthermore there are several new sections and further material on various topics. New exercises and updates in the bibliography were added.
Combinatorial Optimization : Theory and Algorithms
Places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It has arisen as the basis of several courses on combinatorial optimization and more special topics at graduate level. It contains complete but concise proofs, also for many deep results, some of which did not appear in a textbook before. Many very recent topics are covered as well, and many references are provided. Thus this book represents the state of the art of combinatorial optimization.
Combinatorial Commutative Algebra
Combinatorial commutative algebra is an active area of research with thriving connections to other fields of pure and applied mathematics. This book provides a self-contained introduction to the subject, with an emphasis on combinatorial techniques for multigraded polynomial rings, semigroup algebras, and determinantal rings. The eighteen chapters cover a broad spectrum of topics, ranging from homological invariants of monomial ideals and their polyhedral resolutions, to hands-on tools for studying algebraic varieties with group actions, such as toric varieties, flag varieties, quiver loci, and Hilbert schemes. Over 100 figures, 250 exercises, and pointers to the literature make this book appealing to both graduate students and researchers.
Combinatorial Algebraic Topology
Combinatorial algebraic topology is a fascinating and dynamic field at the crossroads of algebraic topology and discrete mathematics. This volume is the first comprehensive treatment of the subject in book form. The first part of the book constitutes a swift walk through the main tools of algebraic topology, including Stiefel-Whitney characteristic classes, which are needed for the later parts. Readers - graduate students and working mathematicians alike - will probably find particularly useful the second part, which contains an in-depth discussion of the major research techniques of combinatorial algebraic topology. Our presentation of standard topics is quite different from that of existing texts. In addition, several new themes, such as spectral sequences, are included.
Codici correttori : Un'introduzione = Correction codes : An introduction
The objective of the theory of desire is that of studying the method to communicate in an affidable way, purely in the presence of disturbance. This is if it is an indispensable instrument for the realization of digital communication systems and, pertanto, the suo studio riveste notevole of practical interest. In this testo testo, destined to studenti dei corsi di laurea di primo (II / III anno) and secondo livello in mathematics, physics or engineering, I come to introduce the famiglie classiche di codici correttori di errore and if it shows how this possano essere concretely applicable per I will communicate; If I present inoltre anche alcune family of covetousness of più recent scoperta, currently oggetto di intense attività di ricerca.
Codici cifrati: Arne Beurling e la crittografia nella II guerra mondiale = Cipher codes : Arne Beurling and cryptography in world war II
The story of the German codebreaking is told in detail for the first time and has all the makings of a thriller, but with elements that make it an excellent introduction to the field of cryptography, as well as a vibrant and human portrait of the society of the time: a desperate wartime situation, political and espionage intrigue, the sometimes incomprehensible yet always fascinating genius of the main architect of its success — mathematician Arne Beurling—the difficulties and tricks of the trade, but also the systematic and obscure work of a crowd of codebreakers who treat their situation as if it were a normal job. The author, Bengt Beckman, was for years, after the war, head of the cryptanalysis department of the Swedish intelligence agency.
Codes : An Introduction to Information Communication and Cryptography
Information is an important feature of the modern world. Mathematical techniques underlie the devices that we use to handle it, for example, mobile phones, digital cameras, and personal computers. This book is an integrated introduction to the mathematics of coding, that is, replacing information expressed in symbols, such as a natural language or a sequence of bits, by another message using (possibly) different symbols. There are three main reasons for doing this: economy, reliability, and security, and each is covered in detail. Only a modest mathematical background is assumed, the mathematical theory being introduced at a level that enables the basic problems to be stated carefully, but without unnecessary abstraction.
Cluster Analysis for Data Mining and System Identification
Presents new approaches to data mining and system identification, and new techniques and tools are presented for the clustering, classification, regression and visualization of complex datasets.
