Page 4
Page 4
Basic Notions of Algebra
Aims to present a general survey of algebra, of its basic notions and main branches.Those parts of the book devoted to the systematic treatment of notions and results of algebra make very limited demands on the reader: we presuppose only that the reader knows calculus, analytic geometry and linear algebra in the form taught in many high schools and colleges. The extent of the prerequisites required in our treatment of examples is harder to state; an acquaintance with projective space, topological spaces, differentiable and complex analytic manifolds and the basic theory of functions of a complex variable is desirable, but the reader should bear in mind that difficulties arising in the treatment of some specific example are likely to be purely local in nature, and not to affect the understanding of the rest of the book.
Baseband Analog Circuits for Software Defined Radio
Baseband Analog Circuits for Software Defined Radio aims to describe the transition towards a Software Radio from the analog design perspective. A complete overview of the actual state-of-art for reconfigurable transceivers is given in detail, focusing on the challenges imposed by flexibility in analog design.
Algorithmic number theory ; 7th International Symposium, ANTS-VII, Berlin, Germany, July 23-28, 2006, Proceedings
This book constitutes the refereed proceedings of the 7th International Algorithmic Number Theory Symposium, ANTS 2006, held in Berlin, July 2006. The book presents 37 revised full papers together with 4 invited papers selected for inclusion. The papers are organized in topical sections on algebraic number theory, analytic and elementary number theory, lattices, curves and varieties over fields of characteristic zero, curves over finite fields and applications, and discrete logarithms.
Algorithm Theory - SWAT 2006 ; 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings
This book constitutes the refereed proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT 2006, held in Riga, Latvia, in July 2006. The proceedings includes 36 revised full papers presented together with 3 invited papers, addressing issues of theoretical algorithmics and applications in various fields including graph algorithms, computational geometry, scheduling, approximation algorithms, network algorithms, data storage and manipulation, combinatorics, sorting, searching, online algorithms, optimization, amd more.
Advances in Discrete Differential Geometry
On a newly emerging field of discrete differential geometry and an excellent way to access this exciting area. It surveys the fascinating connections between discrete models in differential geometry and complex analysis, integrable systems and applications in computer graphics. The authors take a closer look at discrete models in differential geometry and dynamical systems. Their curves are polygonal, surfaces are made from triangles and quadrilaterals, and time is discrete. Nevertheless, the difference between the corresponding smooth curves, surfaces and classical dynamical systems with continuous time can hardly be seen. This is the paradigm of structure-preserving discretizations. Current advances in this field are stimulated to a large extent by its relevance for computer graphics and mathematical physics.
Advances in cryptology -- ASIACRYPT 2006 ; 12th International conference on the theory and application of cryptology and information security, Shanghai, China, December 3-7, 2006, Proceedings
This book constitutes the refereed proceedings of the 12th International Conference on the Theory and Application of Cryptology and Information Security, held in Shanghai, China, December 2006. The 30 revised full papers cover attacks on hash functions, stream ciphers, biometrics and ECC computation, id-based schemes, public-key schemes, RSA and factorization, construction of hash function, protocols, block ciphers, and signatures.
Abstract Computing Machines : A Lambda Calculus Perspective
The book addresses ways and means of organizing computations, highlighting the relationship between algorithms and the basic mechanisms and runtime structures necessary to execute them using machines. It completely abstracts from concrete programming languages and machine architectures, taking instead the lambda calculus as the basic programming and program execution model to design various abstract machines for its correct implementation. The emphasis is on fully normalizing machines based on full-fledged beta-reductions as essential prerequisites for symbolic computations that treat functions and variables truly as first-class objects. Their weakly normalizing counterparts are shown to be functional abstract machines that sacrifice the flavors of full beta-reductions for decidedly simpler runtime structures and improved runtime efficiency. Further downgrading of the lambda calculus leads to classical imperative machines that permit side-effecting operations on the runtime environment.
