Book Description

John Vince explains a wide range of mathematical techniques and problem-solving strategies associated with computer games, computer animation, virtual reality, CAD, and other areas of computer graphics.

Covering all the mathematical techniques required to resolve geometric problems and design computer programs for computer graphic applications, each chapter explores a specific mathematical topic prior to moving forward into the more advanced areas of matrix transforms, 3D curves and surface patches. Problem-solving techniques using vector analysis and geometric algebra are also discussed.

All the key areas are covered including: Numbers, Algebra, Trigonometry, Coordinate geometry, Transforms, Vectors, Curves and surfaces, Barycentric coordinates, Analytic geometry.

Plus – and unusually in a student textbook – a chapter on geometric algebra is included.

From the Back Cover
John Vince explains a wide range of mathematical techniques and problem-solving strategies associated with computer games, computer animation, virtual reality, CAD, and other areas of computer graphics.

Covering all the mathematical techniques required to resolve geometric problems and design computer programs for computer graphic applications, each chapter explores a specific mathematical topic prior to moving forward into the more advanced areas of matrix transforms, 3D curves and surface patches. Problem-solving techniques using vector analysis and geometric algebra are also discussed. Download Now »

Book Description

The hybrid/heterogeneous nature of future microprocessors and large high-performance computing systems will result in a reliance on two major types of components: multicore/manycore central processing units and special purpose hardware/massively parallel accelerators. While these technologies have numerous benefits, they also pose substantial performance challenges for developers, including scalability, software tuning, and programming issues.

Researchers at the Forefront Reveal Results from Their Own State-of-the-Art Work
Edited by some of the top researchers in the field and with contributions from a variety of international experts, Scientific Computing with Multicore and Accelerators focuses on the architectural design and implementation of multicore and manycore processors and accelerators, including graphics processing units (GPUs) and the Sony Toshiba IBM (STI) Cell Broadband Engine (BE) currently used in the Sony PlayStation 3. The book explains how numerical libraries, such as LAPACK, help solve computational science problems; explores the emerging area of hardware-oriented numerics; and presents the design of a fast Fourier transform (FFT) and a parallel list ranking algorithm for the Cell BE. It covers stencil computations, auto-tuning, optimizations of a computational kernel, sequence alignment and homology, and pairwise computations. The book also evaluates the portability of drug design applications to the Cell BE and illustrates how to successfully exploit the computational capabilities of GPUs for scientific applications. It concludes with chapters on dataflow frameworks, the Charm++ programming model, scan algorithms, and a portable intracore communication framework. Download Now »

Book Description

Technology has now progressed to the point that intelligent systems are replacing humans in the decision making processes as well as aiding in the solution of very complex problems. In many cases intelligent systems are already outperforming human activities. Artificial neural networks are not only capable of learning how to classify patterns, such images or sequence of events, but they can also effectively model complex nonlinear systems. Their ability to classify sequences of events is probably more popular in industrial applications where there is an inherent need to model nonlinear system behavior.

Fuzzy systems have similar applications. Their main advantage is their simplicity and ease of implementation. Various aspects of neural networks and fuzzy systems are covered in this volume from The Industrial Electronics Handbook, Second Edition. System optimization is also examined and several new techniques are discussed, including evolutionary methods and swarm and ant colony optimizations. The last section is devoted to several applications involving methods of computational intelligence.

The four other volumes in the Handbook are available individually: Fundamentals of Industrial Electronics, Industrial Communication Systems, Power Electronics and Motor Drives, and Control and Mechatronics. Additionally, all of the volumes are available as a set.

Download Now »

Book Description

This book constitutes the thoroughly referred post-proceedings of the 21st International Workshop on Combinatorial Algorithms, IWOCA 2010, held in London, UK, in July 2010.
The 31 revised full papers presented together with extended abstracts of 8 poster presentations were carefully reviewed and selected from a total of 85 submissions. A broad variety of combinatorial graph algorithms for the computations of various graph features are presented; also algorithms for network compuation, approximation, computational geometry, games, and search are presented and complexity aspects of such algorithms are discussed.

This volume contains the papers presented at IWOCA 2010: The 21st International Workshop on Combinatorial Algorithms. The 21st IWOCA was held in the Great Hall of the Strand Campus, King’s College London (KCL), July 26–28, 2010. The meeting was sponsored and supported financially by KCL and the London Mathematical Society; it was hosted by the Algorithm Design Group in the KCL Department of Informatics. The local Organizing Committee, co-chaired by Tomasz Radzik and German Tischler, did an outstanding job; the Program Committee was co-chaired by Costas Iliopoulos and Bill Smyth.

The EasyChair system was used to facilitate management of submissions and refereeing, with three referees selected from the Program Committee assigned to each paper. Out of 85 contributed papers, a total of 31 were accepted, subject to revision, for presentation at the workshop and publication in the LNCS proceedings. An additional 13 papers were accepted for poster presentation, of which eight are included as four-page papers in the proceedings. Download Now »

Book Description

Essential Information about Algorithms and Data Structures

A Classic Reference
The latest version of Sedgewick’s best-selling series, reflecting an indispensable body of knowledge developed over the past several decades.

Broad Coverage
Full treatment of data structures and algorithms for sorting, searching, graph processing, and string processing, including fifty algorithms every programmer should know. See algs4.cs.princeton.edu/code.

Completely Revised Code
New Java implementations written in an accessible modular programming style, where all of the code is exposed to the reader and ready to use.

Engages with Applications
Algorithms are studied in the context of important scientific, engineering, and commercial applications. Clients and algorithms are expressed in real code, not the pseudo-code found in many other books.

Intellectually Stimulating
Engages reader interest with clear, concise text, detailed examples with visuals, carefully crafted code, historical and scientific context, and exercises at all levels. Download Now »

Book Description

This expanded and updated second edition of a classic bestseller continues to take the “mystery” out of designing and analyzing algorithms and their efficacy and efficiency. Expanding on the highly successful formula of the first edition, the book now serves as the primary textbook of choice for any algorithm design course while maintaining its status as the premier practical reference guide to algorithms.

NEW: (1) Incorporates twice the tutorial material and exercises. (2) Provides full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video. (3) Contains a highly unique catalog of the 75 most important algorithmic problems. (4) Includes new “war stories” and “interview problems”, relating experiences from real-world applications.

Written by a well-known, IEEE Computer Science teaching-award winner, this new edition is an essential learning tool for students needing a solid grounding in algorithms, as well as a uniquely comprehensive text/reference for professionals.

From the Back Cover
The most comprehensive guide to designing practical and efficient algorithms!

Download Now »