Contents Introductory Texts ..................................................3 Programming Language ........................................4 Algorithms & Computation ..................................5 Page 4
Page 8
Discrete Math & Combinatorics ..........................11 Cryptography & Security ....................................12 Bioinformatics/Computational Biology ................14 Computer Graphics & Image Processing ............17
Page 11
Page 14
Page 18
Page 19
Machine Learning ................................................20
Visit us at
www.crctextbooks.com
to order a review copy or to view more information and complete tables of contents for these and many other related books.
MBTCOSC TMC
Introductory Texts
New!
Explorations in Computing An Introduction to Computer Science John S. Conery University of Oregon, Eugene, USA
Based on a course taught by the author, this textbook provides an introduction to computer science for non-majors or pre-majors in beginning courses. The book uses an active learning and problem-solving approach to present key topics, along with realworld examples and practical algorithms. The author explains how to read, rather than write, programs and how to solve problems. To provide a good understanding of computing without covering everything in the field, short focused chapters include tutorial projects and interactive labs that use the simple open-source language, Ruby.
Features: • Presents a project-based, active-learning approach • Provides a series of short chapters on interesting topics in computer science • Emphasizes computational thinking to show how computer scientists solve problems • Includes interactive labs and tutorial projects using the popular programming language, Ruby • Includes a hands-on project and exercises in every chapter All of the modules have been collected into a single Ruby gem—making it easy for students to install all the lab software at once at the beginning of the term. The gem also includes data files and sample Ruby code that students can copy and modify. A lab manual with step-by-step instructions for installing Ruby and lab software is available from the book’s web site. The manual includes tips for editing programs and running commands in a terminal emulator.
Contents: A General Introduction to Computation The Ruby Workbench— Introducing Ruby and the RubyLabs environment for computational experiments The Sieve of Eratosthenes— An algorithm for finding prime numbers A Journey of a Thousand Miles— Iteration as a strategy for solving computational problems Divide and Conquer— A new strategy: breaking large problems into smaller subproblems When Words Collide— Organizing data for more efficient problem solving Bit by Bit— Binary codes and algorithms for text compression and error correction The War of the Words— An introduction to computer architecture and assembly language programming Now For Something Completely Different— An algorithm for generating random numbers Ask Dr. Ruby— A program that understands English (or does it?) The Music of the Spheres— Computer simulation and the N-body problem The Traveling Salesman— A genetic algorithm for a computationally demanding problem Answers to Selected Exercises Ruby Reference
Catalog no. K10640, October 2010, c. 384 pp. ISBN: 978-1-4398-1262-4, $79.95
For more information and complete contents, visit www.crctextbooks.com
3
Programming Language
New!
Mastering Linux Paul S. Wang Kent State University, Ohio, USA
More in-depth coverage than existing introductions to Linux/UNIX Helping students use and program Linux/UNIX with confidence, this text provides a concise yet detailed introduction to Linux/UNIX. It covers interactive usage, tools and applications, system administration, web hosting, C-level programming, and software maintenance for the Linux/UNIX operating system. The author also describes the software packages for Linux, including Apache, PHP, and MySQL. He supplies many realistic examples as well as complete code files for download. The companion website provides ancillary materials, including hands-on experiments, and updates.
Features: • Provides in-depth coverage of Linux/UNIX introductory concepts, USAge tricks and tips, and Linux/UNIX programming • Explores concepts, principles, and practices, making it easy to use and program Linux/UNIX Concentrates on BASH shell • Discusses Tcsh/Csh in an appendix • Covers important software packages for Linux servers, including Apache, PHP, and MySQL • Covers all key features for major UNIX systems • Includes access to complete code files for download
Catalog no. K10350, September 2010 424 pp., Soft Cover ISBN: 978-1-4398-0686-9 $49.95
4
Contents (abridged): A Linux Primer Understanding the Shell. Using Files and Directories. Protecting Files. Text Editing. Getting Hard/Saved Copies. Browsing the Web. Creating and Running Your Own Program. Interactive Use of the Shell Interacting with Bash. Command Line Editing and Command Completion. Bash Command Execution. Input/Output Redirection. Job Control. Bash Shell Expansions. Shell Variables. Desktops, Windows, and Applications Desktop Overview: GNOME and KDE. GNOME Desktop Components. Nautilus the GNOME File Manager. Graphical Applications. Saving Energy. Filters and Regular Expressions Commands and Filters. Grep Commands. Regular Expressions. Patterns for Grep. A Stream Editor: sed. Building Pipelines. Pattern Processing. Writing Shell Scripts Invoking Shell Scripts. Execution. Positional Parameters. The For and if Commands. Test Expressions and Exit Status. The shift Command. The case Command. The while and until Commands. Numerical Expressions. File Queries. The File System A File Location Road Map. File Types. File Status. File Storage System Implementation. The Filesystem Table. Creating Special Files. Network Filesystem. Searching the File Tree. The locate Command. Saving, Compressing, and Distributing Files. Networking, Internet, and the Web Networking Protocols. The Internet. The Domain Name System. Networking in Nautilus. Networking Commands. SSH with X11 Forwarding. Public-Key Encryption and Digital Signature. Secure Email with Mutt and GnuPG. Message Digests. Web Hosting: Apache, PHP and MySQL What Is A Web Server. URL and URI. Request Processing. Response and Content Types. The Apache Web Server. Apache on Linux. Apache Run-time Configuration. Access Control. How HTTP Basic Authentication Works. How HTTP Digest Authentication Works. ...
Order your review copy at www.crctextbooks.com
Programming Language
Algorithms & Computation
Java Programming Fundamentals
Parallel Algorithms
Problem Solving Through Object Oriented Analysis and Design
University of Hawaii, Honolulu, USA
Premchand S. Nair Creighton University, Omaha, Nebraska, USA
“ …carefully thought out and well crafted … a pedagogically excellent first course in object-oriented design and programming. … my first choice for learning object orientation and Java in considerable depth …”
Henri Casanova
Arnaud Legrand University of Grenoble, France
Yves Robert Université de Lyon, France
"… sound, principled treatment of parallel algorithms. … very well written and extremely well designed from an instructional point of view. … a solid, readable text for a course on parallelism in computing. … highly recommended." —SIAM Review, Vol. 52, No. 1, 2010
—George Hacken, in Computing Reviews, July 2009
“… covers a good deal of Java, while also providing the rudiments of UML, some fundamental algorithms like sorting, and data structures like arrays. … The abundance of examples and exercises is very valuable … Summing Up: Recommended.” —L. Benedicenti, University of Regina, in CHOICE, Vol. 47, No. 04
While Java texts are plentiful, it’s difficult to find one that takes a real-world approach, one that encourages students to build on their Java skills through practical exercise. Written by an expert with two decades of Java teaching experience, this book presents object-oriented programming employing examples taken from everyday life. It uses Java 6 and includes detailed explanations of key concepts, solved examples, and a number of supplements for students and instructors found on an accompanying CD and a dedicated website. The book also includes a detailed chapter on Graphical User Interface, which allows students to begin to produce programs that they can interact with in more familiar ways.
"… a very good teaching book … contains many schemes, diagrams, and pictures for better understanding, including many practical examples, case studies, and exercises." —EMS Newsletter, June 2009
"… the tools you need to continue on a rigorous research track into the computer science aspects of parallel computing. … a solid foundation for the study of parallel algorithms." —John West, HPCwire, April 2009
Focusing on algorithms for distributed-memory parallel architectures, this text presents theoretical models of parallel computation, parallel algorithm design for homogeneous and heterogeneous platforms, complexity and performance analysis, and essential notions of scheduling. With many examples, case studies, exercises, and solutions, it encompasses both the theoretical foundations of parallel algorithms and practical parallel algorithm design.
Features:
A CD-ROM and access to a website with software, solutions, and PowerPoint® slides are available upon course adoption.
• Demonstrates the use of theoretical parallel computing models in practice • Explains network principles relevant to parallel algorithm design and performance • Provides a unified, rigorous approach to performance modeling • Shows how to recognize performance trade-offs and develop sound performance models with a variety of assumptions • Contains many examples, case studies, exercises, and solutions
Catalog no. C6547, 2009, 729 pp., Soft Cover ISBN: 978-1-4200-6547-3, $89.95
Catalog no. C9454, 2009, 360 pp. ISBN: 978-1-58488-945-8, $81.95
Contents: Object Model of Computation. Class and Java Fundamentals. Object Oriented Design. Decision Making. Power of Repetition. Methods. Principles of Object-Orientation. Graphical User Interface: Applications and Applets. Simple Data Structures. Searching and Sorting. Exception Handling.
For more information and complete contents, visit www.crctextbooks.com
5
Algorithms & Computation
Methods in Algorithmic Analysis Vladimir A. Dobrushkin Brown University, Providence, Rhode Island, USA
“…helpful to any mathematics student who wishes to acquire a background in classical probability and analysis … This is a remarkably beautiful book that would be a pleasure for a student to read, or for a teacher to make into a year's course.” —Harvey Cohn, Computing Reviews, May 2010
Accompanied by more than 1,000 examples and exercises, this comprehensive, classroomtested text presents numerous theories, techniques, and methods used for analyzing algorithms. It includes basic material on combinatorics and probability useful for students with weak backgrounds. The book presents information on asymptotics not usually found in similar books, including Rice’s method, the Euler and Boole summation formulas, and recurrences. It offers tutorials throughout the text on topics as diverse as continued fractions, functions of a complex variable, numerical calculations, and Stieltjes integration. An appendix contains a comprehensive collection of useful formulas.
Features: • Provides a solid theoretical and mathematical background on the analysis of algorithms • Includes basic material on combinatorics and probability • Contains many problems of varying levels of difficulty • Supplies a comprehensive collection of useful formulas • Uses C++ as the generic form for illustrating algorithms • Contains problems graded 1-5 according to levels of difficulty • Introduces problem sets after each major section Catalog no. C6829, January 2010, 824 pp. ISBN: 978-1-4200-6829-0 $89.95
6
Contents (abridged): Preliminaries Why Do We Analyze Algorithms? Proofs. Iteration and Recursion. Combinatorics Properties of Summation. Multiple Sums. Principles of Counting. Permutations and Combinations. Binomial Coefficients. Binomial Coefficient and Hypergeometric Functions. Stirling Approximation. Probability Set Operations. Sample Space and Random Variables. Calculating Probabilities. Random Variables. Conditional Probabilities. Independence. Joint Distributions. Dependent Random Variables. More about Probability Special Distributions. Types of Probabilistic Convergence. The Theorem of Total Probability. Bayes’ Theorem. Convolution. Order Statistics. Chebyshev Inequality. Sundry Examples. Recurrences or Difference Equations How Do Difference Equations Arise? Properties of Difference Equations. First Order Linear Difference Equations. Divide-and-Conquer Recurrences. Quicksort Recurrence. Recurrences in Numerical Analysis. Continued Fractions. Partial Difference Equations. Some Applications. Introduction to Generating Functions Generating Functions—Definitions. Extraction of Coefficients. Counting Binary Trees. Solving Recurrences. Snake Oil Summation. Applications in Probability. The Langrage Inversion Theorem. Enumeration with Generating Functions Definition of Enumerators. Sum and Product Rules. Counting Compositions of Integers. Further Set Operations. Partition of Integers. Exponential Enumerators. Further Enumeration Methods Enumeration of Trees. Occupancy Enumeration. The Principle of Inclusion and Exclusion (PIE). Extensions and Further Applications of the PIE. Probabilistic Inclusion-Exclusion Principle. Runs in Permutations. Combinatorics of Strings Operations on Languages. Regular Languages. Counting Regular Languages. Waiting Time Probabilistic Problems. Algorithms and Markov Chains. ...
Order your review copy at www.crctextbooks.com
Algorithms & Computation Introduction to Concurrency in Programming Languages Matthew J. Sottile University of Oregon, Eugene, USA
Timothy G. Mattson Intel Corporation, Dupont, Washington, USA
Craig E. Rasmussen Los Alamos National Laboratory, New Mexico, USA
“… a nice survey of the current state of the art of parallel algorithm design and implementation … this concise yet thorough book provides an outstanding introduction to the important field of concurrent programming and the techniques currently employed to design parallel algorithms. It is clearly written, well organized, and cuts to the point … I highly recommend to those interested in the design and implementation of parallel algorithms.” —Fernando Berzal, Computing Reviews, May 2010
Illustrating the effect of concurrency on programs written in familiar languages, this text focuses on novel language abstractions that truly bring concurrency into the language and aid analysis and compilation tools in generating efficient, correct programs. It also explains the complexity involved in taking advantage of concurrency with regard to program correctness and performance. The book describes the historical development of current programming languages and the common threads that exist among them. It also contains several chapters on design patterns for parallel programming and includes quick reference guides to OpenMP, Erlang, and Cilk.
Features: • Provides a solid understanding of the important concepts in concurrent/parallel computing and parallel languages • Describes the historical development of current programming languages • Contains several chapters on design patterns for parallel programming • Includes end-of-chapter exercises and algorithm case studies, along with quick reference guides to OpenMP, Erlang, and Cilk Lecture notes, source code examples, and links to language compilers are made available on the book’s website upon course adoption.
Catalog no. C7213, January 2010, 344 pp. ISBN: 978-1-4200-7213-6, $79.95
Contents (abridged): Introduction Motivation. Where does concurrency appear? Why is concurrency considered hard? Timeliness . Approach. Concepts in Concurrency Terminology. Concepts. Concurrency Control Correctness. Techniques. The State of the Art Limitations of libraries. Explicit techniques. Higherlevel techniques. The limits of explicit control. High-Level Language Constructs Common high-level constructs. Using and evaluating language constructs. Implications of concurrency. Interpreted languages. Historical Context and Evolution of Languages Evolution of machines. Evolution of programming languages. Limits to automatic parallelization. Modern Languages and Concurrency Constructs Array abstractions. Message passing. Control flow. Functional languages. Functional operators. Performance Considerations and Modern Systems Memory. Amdahl’s law, speedup, and efficiency. Locking. Thread overhead. Introduction to Parallel Algorithms Designing parallel algorithms. Finding concurrency. Strategies for exploiting concurrency. Algorithm patterns. Patterns supporting parallel source code. Demonstrating parallel algorithm patterns. Pattern: Task Parallelism Supporting algorithm structures. Case study: Genetic algorithms. Case study: Mandelbrot set computation. Pattern: Data Parallelism Case study: Matrix multiplication. Case study: Cellular automaton. Limitations of SIMD data parallel programming. Beyond SIMD. Geometric decomposition. ...
For more information and complete contents, visit www.crctextbooks.com
7
Algorithms & Computation
Grid Computing Techniques and Applications Barry Wilkinson University of North Carolina, Charlotte, USA
“…the most outstanding aspect of this book is its excellent structure: it is as though we have been given a map to help us move around this technology from the base to the summit … I highly recommend this book…” —Jose Lloret, in Computing Reviews, March 2010
Designed for senior undergraduate and firstyear graduate students, this classroom-tested book shows professors how to teach this subject in a practical way. It encompasses the varied and interconnected aspects of Grid computing, including how to design a system infrastructure and Grid portal. The text covers job submission and scheduling, Grid security, Grid computing services and software tools, graphical user interfaces, workflow editors, and Gridenabling applications. It also contains programming assignments and multiple-choice questions and answers. The author’s Web site offers various instructional resources, including slides and links to software for the programming assignments.
Features: • Includes end-of-chapter self-assessment questions and programming assignments • Introduces production-style Grid portals before covering what happens behind the portal • Explores user-friendly interfaces and Gridenabling applications • Includes related material, such as networking basics, Linux/Windows command-line interfaces, and a Globus installation tutorial, in the appendices Ancillary materials are available on the author’s website upon course adoption.
Catalog no. C6953, January 2010, 387 pp. ISBN: 978-1-4200-6953-2, $79.95
8
Contents: Introduction to Grid Computing Grid Computing Concept. History of Distributed Computing. Computational Grid Applications. Grid Computing Infrastructure Development. Grid Computing Courses. Grid Computing Software Interface. Job Submission Globus Job Submission. Transferring Files. Schedulers Scheduler Features. Scheduler Examples. Grid Computing Meta-Schedulers. Distributed Resource Management Application (DRMAA). Security Concepts Symmetric Key Cryptography. Asymmetric Key Cryptography (Public Key Cryptography). Public Key Infrastructure. Systems/Protocols Using Security Mechanisms. Grid Security Grid Security Infrastructure (GSI). Delegation. HigherLevel Authorization Tools. System Infrastructure I: Web Services Service-Oriented Architecture. Web Services. Web Service Implementation. System Infrastructure II: Grid Computing Services Grid Computing and Standardization Bodies. Interacting Grid Computing Components. Open Grid Services Architecture (OGSA). User-Friendly Interfaces Grid Computing Workflow Editors. Grid Portals. Grid-Enabling Applications Parameter Sweep. Using an Existing Program on Multiple Grid Computers. Writing an Application Specifically for a Grid. Using Multiple Grid Computers to Solve a Single Problem. Appendices Internet and Networking Basics. Linux and Windows Command-Line Interfaces. XML Markup Language. Globus Installation Tutorial. Glossary Answers to Self-Assessment Questions Each chapter starts with an Introduction and concludes with a Summary, Further Reading, Bibliography, SelfAssessment Questions, and Programming Assignments.
Order your review copy at www.crctextbooks.com
Algorithms & Computation
Introduction to Mathematical Logic Fifth Edition Elliott Mendelson Queens College, Dept. of Mathematics, Flushing, New York, USA
“Since it first appeared in 1964, Mendelson's book has been recognized as an excellent textbook in the field. It is one of the most frequently mentioned texts in references and recommended reading lists … This book rightfully belongs in the small, elite set of superb books that every computer science graduate, graduate student, scientist, and teacher should be familiar with.” —Computing Reviews, May 2010
"Since its first edition, this fine book has been a text of choice for a beginner’s course on mathematical logic. … There are many fine books on mathematical logic, but Mendelson’s textbook remains a sure choice for a first course for its clear explanations and organization: definitions, examples and results fit together in a harmonic way, making the book a pleasure to read. … a wealth of exercises to test the reader’s understanding." —MAA Reviews, December 2009
Contents: The Propositional Calculus Propositional Connectives. Truth Tables. Tautologies. Adequate Sets of Connectives. An Axiom System for the Propositional Calculus. Independence. Many-Valued Logics. Other Axiomatizations. First-Order Logic and Model Theory Quantifiers. First-Order Languages and Their Interpretations. Satisfiability and Truth. Models. First-Order Theories. Additional Metatheorems and Derived Rules. Rule C. Completeness Theorems. First-Order Theories with Equality. Definitions of New Function Letters and Individual Constants. Prenex Normal Forms. Isomorphism of Interpretations. Formal Number Theory
Retaining all the key features of its predecessors, this fifth edition of a long-established, bestselling text explores the principal topics of mathematical logic. This edition includes a new section covering basic ideas and results about nonstandard models of number theory, a second appendix that introduces modal propositional logic, and an expanded bibliography. additional exercises and selected answers.
An Axiom System. Number-Theoretic Functions and Relations. Primitive Recursive and Recursive Functions. Arithmetization. Gödel Numbers. The Fixed-Point Theorem. Gödel’s Incompleteness Theorem. Recursive Undecidability. Church’s Theorem. Nonstandard Models.
This edition continues to cover propositional logic, first-order logic, first-order number theory, axiomatic set theory, and the theory of computability. It also discusses the major results of Gödel, Church, Kleene, Rosser, and Turing.
An Axiom System. Ordinal Numbers. Equinumerosity. Finite and Denumerable Sets. Hartogs’ Theorem. Initial Ordinals. Ordinal Arithmetic. The Axiom of Choice. The Axiom of Regularity. Other Axiomatizations of Set Theory.
Features: • Provides a compact introduction to the principal topics of mathematical logic • Presents the fundamental assumptions and proof techniques that form the basis of mathematical logic • Explores logic and computability theory— indispensable tools in theoretical computer science and artificial intelligence
Axiomatic Set Theory
Computability Algorithms. Turing Machines. Diagrams. Partial Recursive Functions. Unsolvable Problems. The Kleene–Mostowski Hierarchy. Recursively Enumerable Sets. Other Notions of Computability. Decision Problems. Appendix A: Second-Order Logic. Appendix B: First Steps in Modal Propositional Logic. Answers to Selected Exercises
Catalog no. C8768, January 2010, 469 pp. ISBN: 978-1-58488-876-5, $89.95
For more information and complete contents, visit www.crctextbooks.com
9
Algorithms & Computation Classical and Modern Numerical Analysis Theory, Methods and Practice Azmy S. Ackleh and R. Baker Kearfott University of Louisiana, LaFayette, USA
Edward James Allen Texas Tech University, Lubbock, USA
Padmanabhan Seshaiyer George Mason University, Fairfax, Virginia, USA
“…provides useful background knowledge for graduate study in any area of applied mathematics … this is a thorough, well-written treatment of an important subject.” —Computing Reviews, May 2010
Helping students prepare for doctoral examinations in numerical analysis, this graduatelevel text provides a sound introduction to the theory and application of computational methods for applied mathematics problems. It also assists students in understanding the mathematical literature in this area. The authors present the most important advanced aspects of numerical linear algebra, finite element theory, approximation theory, optimization, and integral equations. They also cover interval computation methods in numerical analysis and include fully worked out solutions for selected problems. A solutions manual is available for qualifying instructors.
Features: • Provides a clear introduction to the theory and application of computational methods for applied mathematics • Helps prepare students for doctoral examinations in numerical analysis • Presents the most important advanced aspects of numerical linear algebra, finite element theory, approximation theory, optimization, and integral equations • Covers interval computation methods in numerical analysis • Includes fully worked out solutions for selected problems • Offers MATLAB® files on the authors' website Solutions manual available upon course adoption Catalog no. C9157, January 2010, 628 pp. ISBN: 978-1-4200-9157-1, $99.95
10
Contents (abridged): Mathematical Review and Computer Arithmetic Mathematical Review. Computer Arithmetic. Interval Computations. Numerical Solution of Nonlinear Equations of One Variable Bisection Method. The Fixed Point Method. Newton’s Method. The Univariate Interval Newton Method. Secant Method and Müller’s Method. Aitken Acceleration and Steffensen’s Method. Roots of Polynomials. Numerical Linear Algebra Basic Results from Linear Algebra. Normed Linear Spaces. Direct Methods for Solving Linear Systems. Iterative Methods for Solving Linear Systems. The Singular Value Decomposition. Approximation Theory Norms, Projections, Inner Product Spaces, and Orthogonalization in Function Spaces. Polynomial Approximation. Piecewise Polynomial Approximation. Trigonometric Approximation. Rational Approximation. Wavelet Bases. Least Squares Approximation on a Finite Point Set. Eigenvalue-Eigenvector Computation Basic Results from Linear Algebra. The Power Method. The Inverse Power Method. Deflation. The QR Method. Jacobi Diagonalization. Simultaneous Iteration. Numerical Differentiation and Integration Numerical Differentiation. Automatic (Computational) Differentiation. Numerical Integration. Initial Value Problems for Ordinary Differential Equations Euler’s Method. Single-Step Methods: Taylor Series and Runge–Kutta. Error Control and the Runge–Kutta–Fehlberg Method. Multistep Methods. Predictor-Corrector Methods. Stiff Systems. Extrapolation Methods. Numerical Solution of Systems of Nonlinear Equations Introduction and Fréchet Derivatives. Successive Approximation (Fixed Point Iteration) and the Contraction Mapping Theorem. Newton’s Method and Variations. Multivariate Interval Newton Methods. Quasi-Newton Methods. ...
Order your review copy at www.crctextbooks.com
Discrete Math & Combinatorics Discrete Mathematics Proofs, Structures and Applications, Third Edition R. Garnier Surrey, UK
Applied Algebra Codes, Ciphers and Discrete Algorithms, Second Edition Darel W. Hardy Colorado State University, Fort Collins, USA
Fred Richman
J. Taylor University of Brighton, UK
Florida Atlantic University, Boca Raton, USA
An accessible introduction to discrete mathematics
Carol L. Walker
"The choice of the topics covered in this text is largely suggested by the needs of computer science. … The style of exposition is very clear, step by step and the level is well adapted to undergraduates in computer science. The treatment is mathematically rigorous; therefore it is also suitable for mathematics students. Besides the theory there are many concrete examples and exercises (with solutions!) to develop the routine of the student. So I can recommend warmly this book … an excellent textbook."
“ … show[s] the power of algebra in a relatively simple setting.”
—H.G.J. Pijls, University of Amsterdam, The Netherlands
This third edition continues to provide a rigorous yet accessible exposition of discrete mathematics, including the core mathematical foundation of computer science. The text includes a new section on the formal proof of the validity of arguments in propositional logic before moving on to predicate logic. This edition also contains a new chapter on elementary number theory and congruences. This chapter explores groups that arise in modular arithmetic and RSA encryption, a widely used public key encryption scheme that enables practical and secure means of encrypting data. A detailed solutions manual is available upon course adoption.
Features: • Covers the main mathematical underpinnings of computer science • Shows how relations and functions fit into typed set theory • Introduces a specification approach to mathematical operations • Presents public key encryption algorithms based on number theory • Explores applications in relational databases and graph theory • Includes further reading suggestions and numerous exercises, many with solutions
New Mexico State University, Las Cruces, USA
—Mathematical Reviews, 2010
Includes a CD-ROM that contains an interactive version of the book Using mathematical tools from number theory and finite fields, this text presents practical methods for solving problems in data security and data integrity. It covers many algorithms that arise in cryptography and error-control codes. Along with doubling the number of exercises, this edition includes a new appendix that reviews prerequisite topics in algebra and number theory. The accompanying CD-ROM contains an interactive version of the book that is powered by Scientific Notebook®, a mathematical word processor and easy-to-use computer algebra system. A solutions manual is available upon course adoption.
Features: • Covers topics from algebra, cryptography, and number theory • Includes algorithms that offer common-sense approaches to problems, such as computing large powers • Provides complete coverage on error-correcting codes • Explains the Rijndael algorithm to help students understand the data encryption standard
CD-ROM Includes: • Links that make it easy to navigate page-bypage, chapter-by-chapter, or by keyword • Interactive examples, computing hints, self-tests • Details of solutions to problems beyond those in the printed text Catalog no. C7142, 2009, 424 pp. ISBN: 978-1-4200-7142-9, $99.95
Catalog no. K10650, January 2010, 843 pp. ISBN: 978-1-4398-1280-8, $89.95
For more information and complete contents, visit www.crctextbooks.com
11
Cryptography & Security
New!
Access Control, Security, and Trust A Logical Approach Shiu-Kai Chin and Susan Beth Older Syracuse University, New York, USA
Developed from the authors’ courses at Syracuse University and the U.S. Air Force Research Laboratory, this book equips students with an access control logic they can use to specify and verify their security designs. Throughout the text, the authors use a single access control logic based on a simple propositional modal logic. The first part of the book presents the syntax and semantics of access control logic, basic access control concepts, and an introduction to confidentiality and integrity policies. The second section covers access control in networks, delegation, protocols, and the use of cryptography. In the third section, the authors focus on hardware and virtual machines. The final part discusses confidentiality, integrity, and role-based access control. A solutions manual and slides are available upon course adoption.
Features: • Employs propositional modal logic to explain access control principles • Shows how to perform derivations and calculations with mathematical precision and accuracy • Focuses on reference monitors in security • Presents numerous examples ranging from the control of physical memory in hardware to multilevel security policies • Includes exercises that deal with application, analysis, synthesis, and evaluation • Offers HOL-4 implementation and slides for each chapter available for download
Catalog no. C8628, July 2010, 351 pp. ISBN: 978-1-58488-862-8 $89.95
12
Contents: Access Control, Security, Trust, and Logic Deconstructing Access Control Decisions. A Logical Approach to Access Control. PRELIMINARIES A Language for Access Control Sets and Relations. Syntax. Semantics. Reasoning about Access Control Logical Rules. Formal Proofs and Theorems. Soundness of Logical Rules. Basic Concepts Reference Monitors. Access Control Mechanisms: Tickets and Lists. Authentication. Security Policies Confidentiality, Integrity, and Availability. Discretionary Security Policies. Mandatory Security Policies. Military Security Policies. Commercial Policies. DISTRIBUTED ACCESS CONTROL Digital Authentication Public-Key Cryptography. Efficiency Mechanisms. Reasoning about Cryptographic Communications. Certificates, Certificate Authorities, and Trust. SymmetricKey Cryptography. Delegation Simple Delegations. Delegation and Its Properties. A Delegation Example: Simple Checking. Networks: Case Studies SSL and TLS: Authentication across the Web. Kerberos: Authentication for Distributed Systems. Financial Networks. ISOLATION AND SHARING A Primer on Computer Hardware Ones and Zeros. Synchronous Design. Microcode. Virtual Machines and Memory Protection A Simple Processor. Processors with Memory Segmentation. Controlling Access to Memory and Segmentation Registers. Design of the Virtual Machine Monitor. Access Control Using Descriptors and Capabilities Address Descriptors and Capabilities. Tagged Architectures. Capability Systems.
Order your review copy at www.crctextbooks.com
Cryptography & Security
New!
Introduction to Cryptography with Mathematical Foundations and Computer Implementations Alexander Stanoyevitch California State University–Dominguez Hills, Carson, USA
From the exciting history of its development in ancient times to the present day, this self-contained introduction provides a focused tour of the central concepts of cryptography. It delineates cryptographic concepts in chronological order, developing the mathematics as needed. The text includes numerous examples and exercises, along with computer implementation sections that guide students through the process of writing their own programs. Detailed solutions to many of the exercises can be found in the appendices while a solutions manual is available upon qualifying course adoption. A supporting website provides an extensive set of sample programs as well as downloadable platform-independent applet pages for some core programs and algorithms. A solutions manual is available upon course adoption.
Features: • Provides a focused, self-contained treatment of cryptography
Contents: Overview of the Subject Divisibility and Modular Arithmetic The Evolution of Codemaking until the Computer Era Matrices and the Hill Cryptosystem The Evolution of Codebreaking until the Computer Era Representation and Arithmetic of Integers in Different Bases Block Cryptosystems and the Data Encryption Standard (DES) Some Number Theory and Algorithms Public Key Cryptography
• Covers elliptic curve cryptography
Finite Fields in General and GF(28) in Particular
• Offers complete coverage of all the needed material on number theory and abstract algebra
The Advanced Encryption Standard (AES) Protocol
• Presents algorithms in pseudo-code Contains background material and extensive exercise solutions in the appendices
Elliptic Curve Cryptography
• Includes both standard and computer exercises as well as numerous worked examples
Sets and Basic Counting Principles. Randomness and Probability. Solutions to All Exercises. Answers and Brief Solutions to Selected OddNumbered Exercises. Suggestions for Further Reading.
• Supplies access to sample programs and platform-independent applets on the supporting website
Appendices
References Exercises and Computer Implementations appear at the end of each chapter
Catalog no. K10916, August 2010, 669 pp. ISBN: 978-1-4398-1763-6, $89.95
For more information and complete contents, visit www.crctextbooks.com
13
Bioinformatics/Computational Biology
Engineering Genetic Circuits Chris J. Myers
Algorithms in Bioinformatics A Practical Introduction
University of Utah, Salt lake City, USA
Wing-Kin Sung
"… one of the few texts in the area that gently brings the uninitiated to these edges. … admirably touches on much of the ‘required’ knowledge while creating a minimal toolset with which beginning students can confidently venture into this exciting new territory of systems biology."
"… an excellent guide. … appropriate for advanced undergraduates and graduates in mathematics or CS. … The 27-page introduction is the most efficient concept-building summary and explication of molecular biology that I have encountered. … Section 1.8 sets a new, high standard for sciencehistory exposition, covering Gregor Mendel to the present. …This self-contained, well-designed, and well-written book, with its many good exercises, bibliographic references, and photo-quality figures, is an ideal introduction to bioinformatics."
—Adam Arkin, University of California, Berkeley, USA
"… an excellent reference for any course in systems biology … . I find the many illustrations (workedout examples and ample number of figures) and exercises at the end of each chapter quite useful and important." —Baltazar Aguda, The Ohio State University, Columbus, USA
Focusing on genetic regulatory networks, Engineering Genetic Circuits presents the modeling, analysis, and design methods for systems biology. It discusses how to examine experimental data to learn about mathematical models, develop efficient abstraction and simulation methods to analyze these models, and use analytical methods to guide the design of new circuits. The author reviews basic molecular biology and biochemistry principles, covers several methods for modeling and analyzing genetic circuits, and uses the lysis/lysogeny decision circuit of phage lambda as an example throughout to help illustrate the various methods. iBioSim software, lecture slides, problem sets, and a password-protected solutions manual are available on the author’s website.
Features: • Introduces relevant biology and biochemistry for readers with an engineering background • Covers key methods for modeling and analyzing genetic circuits • Presents an introduction to the emerging area of synthetic biology • Includes exercises and self-study problem sets in every chapter • Utilizes an illustrative example system across all chapters (lambda phage)
National University of Singapore
—George Hacken, Computing Reviews, March 2010
This classroom-tested text provides an in-depth introduction to the algorithmic techniques applied in bioinformatics. For each topic, the author clearly details the biological motivation, precisely defines the corresponding computational problems, and includes detailed examples to illustrate each algorithm. The text covers basic molecular biology concepts, sequence similarity, the suffix tree, sequence databases, sequence and genome alignment, the phylogenetic tree, genome rearrangement, motif finding, the secondary structure of RNA, peptide sequencing, and population genetics. Supplementary material is provided on the author’s website and a solutions manual is available for qualifying instructors. Presents a comprehensive overview of principles and methods in bioinformatics • Covers numerous applications of algorithms in bioinformatics • Discusses the practical issues and actual performance of using various methods with real biological data • Assumes no prior knowledge of molecular biology • Offers PowerPoint® slides and other supplementary material on the author’s website Solutions manual available upon course adoption Catalog no. C7033, January 2010, 407 pp. ISBN: 978-1-4200-7033-0, $79.95
Catalog no. C3244, January 2010, 306 pp. ISBN: 978-1-4200-8324-8, $69.95
14
Order your review copy at www.crctextbooks.com
Bioinformatics/Computational Biology Systems Biology and Bioinformatics A Computational Approach Kayvan Najarian, Christopher N. Eichelberger, Siamak Najarian and Shahriar Gharibzadeh Written by field experts with proven track records, this authoritative text begins with an introduction to systems biology and its impact on biology and medicine. Next, it reviews the basic principles of molecular and cell biology using a system-oriented approach, with a brief description of the high-throughput biological experiments that produce databases. The book includes techniques to discover genes, perform nucleotide and amino acid sequence matching, and estimate static gene dynamic pathways. It also explains how to use system-oriented models to predict the behavior of biological systems for important applications such as rational drug design. The numerous examples and problem sets allow students to confidently explore practical systems biology applications using real examples with real biological data, making it an ideal text for senior undergraduate and first-year graduate students. • Provides methods to integrate high level imaging data and molecular level measurements to model biological systems • Presents the necessary biological and mathematical background • Includes practical examples and experiments with real data • Covers the computational approach and advanced mathematical methods Solutions manual is available upon course adoption
Contents:
Structural Bioinformatics An Algorithmic Approach Forbes J. Burkowski University of Waterloo, Ontario, Canada
“…the book presents a number of topics in structural bioinformatics … It targets advanced undergraduate students and hence the description of more complicated algorithms is avoided. … provides an interesting introduction to the area.” —Lucian Ilie, Mathematical Reviews, November 2009
Showcasing the beauty of protein structures, this practical text illustrates how to apply key algorithms to solve problems related to macromolecular structure. It emphasizes a methodology that uses mathematical models as links between structural biology and computational algorithms. The author shows that protein structure can produce symmetry and beauty as well as biological function. He also gives many examples of dynamic programming applications, including RNA secondary structure prediction and protein sequence alignment. The text includes problems throughout, exercises at the end of each chapter, and a 12-page color insert. • Presents the basic mathematical techniques underlying core algorithms in structural bioinformatics • Provides many examples of dynamic programming applications, including RNA secondary structure prediction and protein sequence alignment • Reviews necessary mathematics, such as linear algebra, in the appendices • Includes problems throughout, exercises at the end of each chapter, and a 12-page color insert
Cell Biology. Bioassays. Review of Some Computational Methods. Computational Structural Biology: Protein Structure Prediction. Computational Structural Biology. Genomics and Proteomics. Methods for Identification of Differentially Expressed Genes or Proteins. Binary and Bayesian Networks as Static Models of Regulatory Pathways. Metabolic Control Theory for Static Modeling of Metabolic Pathways. System Identification and Control Theory for Dynamic Modeling of Biological Pathways. Gene Silencing for Systems Biology. Simulation and Systems Biology. Software, Databases, and Other Resources for Systems Biology. Future Directions.
The Study of Structural Bioinformatics. Introduction to Macromolecular Structure. Data Sources, Formats, and Applications. Dynamic Programming. RNA Secondary Structure Prediction. Protein Sequence Alignment. Protein Geometry. Coordinate Transformations. Structure Comparison, Alignment, and Superposition. Machine Learning. Overview of the Appendices.
Catalog no. 46500, 2009, 190 pp. ISBN: 978-1-4200-4650-2, $69.95
Catalog no. C6838, 2009, 429 pp. ISBN: 978-1-58488-683-9, $81.95
Solutions MANUAL and PowerPoint® slides available upon course adoption.
Contents:
For more information and complete contents, visit www.crctextbooks.com
15
Bioinformatics/Computational Biology
New!
Biological Computation Ehud Lamm Tel-Aviv University, Israel
Ron Unger Bar-Ilan University, Ramat-Gan, Israel
Created for advanced undergraduates in computer science programs, Biological Computation covers major themes of bio-inspired computing, including cellular automata, molecular computation, genetic algorithms, and neural networks. Providing theoretical and coding exercises, this selfcontained text requires no previous knowledge of biology. The book provides valuable insight to researchers and students from biomedical backgrounds looking to gain the computational skills needed to make entry into the fields of systems biology, biological modeling, and simulations.
Features: • Gives a unified overview of computer science ideas inspired by biology • Concentrates on the aspects of biological phenomena most closely related to the computational approaches of cellular automata, evolutionary computation, artificial neural networks, and molecular computation • Presents examples of applications • Discusses possible variants of basic techniques • Includes a summary, further reading, exercises, and answers to exercises in each chapter
Contents: Introduction and Biological Background Biological Computation. The Influence of Biology on Mathematics—Historical Examples. Biological Introduction. Models and Simulations. Cellular Automata Biological Background. The Game of Life. General Definition of Cellular Automata. Examples of Cellular Automata. Comparison with a Continuous Mathematical Model. Computational Universality. Self-Replication. Pseudo Code. Evolutionary Computation Evolutionary Biology and Evolutionary. Computation. Genetic Algorithms. Example Applications. Analysis of the Behavior of Genetic Algorithms. Lamarckian Evolution. Genetic Programming. A Second Look at the Evolutionary Process. Pseudo Code. Artificial Neural Networks Biological Background. Learning. Artificial Neural Networks. The Perceptron. Learning in a Multilayered Network. Associative Memory. Unsupervised Learning. Molecular Computation Biological Background—Experimental Techniques. Computation Using DNA. Enzymatic Computation. The Never-Ending Story: Additional Topics on the Interface between Biology and Computation Swarm Intelligence. Artificial Immune Systems. Artificial Life. Systems Biology. Each chapter concludes with a Summary, Further Reading, Exercises, and Answers to Selected Exercises
Catalog no. C7959, October 2010, c. 344 pp. ISBN: 978-1-4200-8795-6, $79.95
16
Order your review copy at www.crctextbooks.com
Computer Graphics & Image Processing
New!
Computer Graphics Through OpenGL From Theory to Experiments Sumanta Guha Asian Institute of Technology, Thailand
From geometric primitives to animation to 3D modeling to lighting and shading, this comprehensive introduction to computer graphics uses an active learning style to teach key concepts. Equally emphasizing theory and practice, the book provides an understanding not only of the principles of 3D computer graphics, but also the use of the OpenGL Application Programming Interface (API) to program 3D applications. Forming the undergraduate core of the text, the first fourteen chapters cover the concepts fundamental to 3D computer graphics and illustrate how to code fairly sophisticated 3D scenes and animation, including games and movies. The remaining chapters explore more advanced topics, such as the structure of curves and surfaces, applications of projective spaces and transformations, and programmable graphics pipelines. Using a hands-on, interactive approach that mixes theory and coding, the text makes the theory accessible by having students run clarifying code.
Web Resources The book’s website provides program source code that runs on Windows, Mac OS, and Linux platforms. It also includes a guide to installing OpenGL and executing the programs, special software to help run the experiments, and figures from the book. In addition, the website provides a discussion forum for interaction among users of the book.
Features:
Contents: Hello World An Invitation to Computer Graphics. On to OpenGL and 3D Computer Graphics. Tricks of the Trade An OpenGL Toolbox. Movers and Shapers Transformation, Animation and Viewing. Inside Animation: The Theory of Transformations. Advanced Animation Techniques. Geometry for the Home Office Convexity and Interpolation. Triangulation. Orientation. Making Things Up Modeling in 3D Space. Lights, Camera, Equation Color and Light. Texture. Special Visual Techniques.
• Covers the foundations of 3D computer graphics, including animation, visual techniques, and 3D modeling • Introduces classical and programmable pipelines in OpenGL • Integrates code with the theory to give students a handson appreciation of the subject • Includes 140 programs with 200 experiments based on them • Contains 600 exercises, 100 worked examples, and nearly 600 color illustrations • Requires no previous knowledge of computer graphics • Offers access to downloadable multiplatform programs in C++ and OpenGL, installation guides, and an interactive discussion forum
Appendices:
Solutions manual and test bank questions available upon course adoption Catalog no. K12068, September 2010, 888 pp. ISBN: 978-1-4398-4620-9, $99.95
Projective Spaces and Transformations. Installing OpenGL and Running Code. Math Self-Test. Math Self-Test Solutions.
Pixels, Pixels, Everywhere Raster Algorithms. Anatomy of Curves and Surfaces Bézier. B-Spline. Hermite. The Projective Advantage Applications of Projective Spaces. The Time Is Pipe Fixed-Functionality Pipelines. Programmable Pipelines.
For more information and complete contents, visit www.crctextbooks.com
17
Computer Graphics & Image Processing
New!
The Science of Imaging Second Edition Graham Saxby University of Wolverhampton (retired), UK
Praise for the Previous Edition: "… a truly valuable book … It's the best book I have read on the subject at this level." —Ron Grahm, RPS Journal
"… well written … with lots of helpful marginal notes." —Matin Durrani, Physics World
"… every student should read it, every photographer should own it, and every lecturer and journalist should know its contents inside out." —Jon Tarrant, British Journal of Photography
Edited and expanded to keep pace with the digital revolution, the second edition of this highly popular and critically acclaimed work continues to provide students with a comprehensive exploration of imaging science. Brilliantly written and extensively illustrated, it covers fundamental laws of physics as well as the cutting-edge techniques that are defining the current direction of the field. It adds a new section on astronomical imaging, as well as major revisions in the areas of digital imaging and modern technology. All references have been updated and now include a significant number of URLs leading to both teaching materials and expanded information. Starting with the fundamentals of light and basic cameras, the author journeys through television and holography to advanced scientific and medical imaging. Topics such as digital recording of images, the photographic process, and film development are dealt with in an informative and entertaining manner.
Features:
Contents: The Nature of Light. Photometry, Lighting, and Light Filters Visual Perception Lens Principles Types of Lenses Resolution in Optical Systems Images in Color Still Cameras Motion and High-Speed Photography The Silver Halide Process Digital Recording of Images Halftone, Electrostatic, and Digital Printing Television Video Recording and Replay Systems Three-Dimensional Imaging Holography Astronomical Imaging Macrography, Micrography, and Microimaging Imaging the Invisible
• Provides a new larger format with a wealth of illustrations • Includes major revisions in the areas of digital imaging and modern technology • Directs readers to a wealth of Internet resources • Takes a non-mathematical approach but includes key equations • Covers optics, imaging systems, materials, and image interpretation and creation
Appendix 1: Logarithms: What They Are, What They Do Appendix 2: How a Hologram Works Appendix 3: The Fourier Model for Image Formation Appendix 4: The Meaning of pH
Catalog no. K10653, October 2010, c. 346 pp. ISBN: 978-1-4398-1286-0, $69.95
18
Order your review copy at www.crctextbooks.com
Computer Graphics & Image Processing An Integrated Introduction to Computer Graphics and Geometric Modeling
Digital Image Processing
Ronald Goldman
C.H. Chen
Rice University, Houston, Texas, USA
"… may be the first book on geometric modeling that also covers computer graphics. … integrates a thorough introduction to ‘freedom’ curves and surfaces and to the mathematical foundations for computer graphics. … very well presented … It certainly is a textbook I would recommend." —Computer-Aided Design, 42, 2010
"Dr. Goldman has dedicated the past 20 years of his career to teaching and research as a professor of computer science … He is an excellent mentor of students and I am pleased that his reach will be extended through the publication of this book." —Thomas W. Sederberg, Brigham Young University
This book presents an easy-to-read introduction to computer graphics and geometric modeling. Emphasizing high-level algorithms, it focuses on standard graphics, modeling, and mathematical methods, including ray tracing, polygon shading, radiosity, fractals, freeform curves and surfaces, vector methods, and transformation techniques. The author begins with fractals first rather than typical line drawing algorithms and also brings back the turtle from obscurity to introduce several major concepts in computer graphics. • Delineates vector methods, mass points, affine and projective maps, and blossoming • Emphasizes high-level algorithms, including key curve/surface spline creation and manipulation algorithms • Uses an innovative approach by presenting turtles and fractals first • Provides formulas for transformations about planes and axes in arbitrary positions • Includes many exercises and programming projects PowerPoint slides are available on the book’s website upon course adoption. ®
Catalog no. K10188, January 2010, 574 pp. ISBN: 978-1-4398-0334-9, $89.95
An Algorithmic Approach with MATLAB Uvais Qidwai Qatar University, Doha University of Massachusetts, North Dartmouth, USA
"…This book covers a reasonably large area of the subject for there to be something for most readers. …" —I-Programmer, January 2010
This text equips students with an essential understanding of digital image processing. It contains easy explanations of theoretical concepts, avoiding heavy mathematics wherever possible. The authors provide MATLAB® codes that allow students to generate the same images found in the book and present the algorithms as simple flowcharts that can be coded in any programming environment. They include algorithmic accounts of the techniques, describe practical examples and potential applications, and cover both standard and advanced topics, such as face recognition and soft computing. Lecture slides, MATLAB codes, and other resources are available on the author’s website.
Features: • Contains easy explanations of theoretical concepts, avoiding heavy mathematics wherever possible • Provides MATLAB codes that allow students to generate the same images found in the book • Covers both standard and advanced topics, such as face recognition and soft computing • Presents algorithms as simple flowcharts that can be coded in any programming environment • Includes algorithmic accounts of the techniques • Describes practical examples and potential applications Lecture slides, MATLAB code, and other resources are available upon course adoption on the author’s website. Catalog no. C7950, January 2010, 314 pp. ISBN: 978-1-4200-7950-0, $89.95
For more information and complete contents, visit www.crctextbooks.com
19
Machine Learning
Bestseller!
Machine Learning An Algorithmic Perspective Stephen Marsland Massey University, Palmerston North, New Zealand
"If you are interested in learning enough AI to understand the sort of new techniques being introduced into Web 2 applications, then this is a good place to start. … it covers the subject matter of many an introductory course on AI and it has references to the source material … . Overall it works and much of the mathematics is explained in ways that make it fairly clear what is going on … . a suitable introduction to AI if you are studying the subject on your own … a good course text for an introduction and overview of AI." —I-Programmer, November 2009
Written in an easily accessible style, this bestselling text provides the ideal blend of theory and practical, applicable knowledge. It covers neural networks, graphical models, reinforcement learning, evolutionary algorithms, dimensionality reduction methods, and the important area of optimization. It treads the fine line between adequate academic rigor and overwhelming students with equations and mathematical concepts. The author includes examples based on widely available datasets and practical and theoretical problems to test understanding and application of the material. The book describes algorithms with code examples backed up by a website that provides working implementations in Python.
Features: • Provides a clear introduction to the basic concepts of machine learning • Focuses on algorithms used in machine learning, and how and why they work • Presents real-world problems through structured exercises and programming examples • Includes a primer on the use of Python for numerical computing • Includes actual programming examples, rather than pseudocode Online access to codes, examples, and solutions is available upon qualified course adoption. Catalog no. C6718, 2009, 406 pp. ISBN: 978-1-4200-6718-7, $69.95
20
Contents (abridged): Introduction If Data Had Mass, The Earth Would Be a Black Hole. Learning. Types of Machine Learning. Supervised Learning. The Brain and the Neuron. Linear Discriminants Preliminaries. The Perceptron. Linear Separability. Linear Regression. The Multi-Layer Perceptron Going Forwards. Going Backwards: Back-propagation of Error. The Multi-Layer Perceptron in Practice. Examples of Using the MLP. Overview. Back-propagation Properly. Radial Basis Functions and Splines Concepts. The Radial Basis Function (RBF) Network. The Curse of Dimensionality. Interpolation and Basis Functions. Support Vector Machines Optimal Separation. Kernels. Learning With Trees Using Decision Trees. Constructing Decision Trees. Classification And Regression Trees. Classification Example. Decision by Committee: Ensemble Learning Boosting. Bagging. Different Ways to Combine Classifiers. Probability and Learning Turning Data into Probabilities. Some Basic Statistics. Gaussian Mixture Models. Nearest Neighbour Methods. Unsupervised Learning The k-Means Algorithm. Vector Quantisation. The Self-Organising Feature Map. Dimensionality Reduction Linear Discriminant Analysis. Principal Components Analysis. Factor Analysis. Independent Components Analysis. Locally Linear Embedding. Isomap. Optimisation and Search Going Downhill. Least-Squares Optimisation. Conjugate Gradients. Search: Three Basic Approaches. Exploitation and Exploration. Simulated Annealing. ...
Order your review copy at www.crctextbooks.com
Machine Learning
Foundations of Semantic Web Technologies Pascal Hitzler Kno.e.sis Center at Wright State University, Dayton, Ohio, USA
Markus Kroetzsch and Sebastian Rudolph University of Karlsruhe, Karlsruhe, Germany
"This book is unique in several respects. It contains an in-depth treatment of all the major foundational languages for the Semantic Web and provides a full treatment of the underlying formal semantics … easily accessible for the reader … I am confident this book will be well received and play an important role in training a larger number of students who will seek to become proficient in this growing discipline." —Amit Sheth, Wright State University, Dayton, Ohio, USA
Thoroughly covering basic introductions and intuitions, technical details, and formal foundations, this text focuses on the established foundations in this area that have become relatively stable over time. It presents the latest developments in Semantic Web standards, including RDF, RDF Schema, OWL 2, RIF, and SPARQL. It also explores formal semantics, OWL querying, the relationship between rules and OWL, and ontology engineering and applications. The authors include many exercises with solutions in the back of the book.
Features: • Presents the latest developments in Semantic Web standards, covering RDF, RDF Schema, OWL 2, RIF, and SPARQL • Provides a thorough treatment of formal semantics, including proof theory • Explores OWL querying, the relationship between rules and OWL, and ontology engineering and applications • Separates syntax and language from indepth treatments of the formal foundations • Facilitates self-study with appendices on preliminary background knowledge Updates, slides for teaching, and links to further resources are available on the book’s website upon course adoption.
Catalog no. C9050, January 2010, 456 pp. ISBN: 978-1-4200-9050-5, $79.95
Contents: The Quest for Semantics Building Models. Calculating with Knowledge. Exchanging Information. Semantic Web Technologies. RESOURCE DESCRIPTION LANGUAGE (RDF) Simple Ontologies in RDF and RDF Schema. Introduction to RDF. Syntax for RDF. Advanced Features. Simple Ontologies in RDF Schema. Encoding of Special Data Structures. An Example. RDF Formal Semantics Why Semantics? Model-Theoretic Semantics for RDF(S). Syntactic Reasoning with Deduction Rules. The Semantic Limits of RDF(S). WEB ONTOLOGY LANGUAGE (OWL) Ontologies in OWL OWL Syntax and Intuitive Semantics. OWL Species. The Forthcoming OWL 2 Standard. OWL Formal Semantics Description Logics. Model-Theoretic Semantics of OWL. Automated Reasoning with OWL. RULES AND QUERIES Ontologies and Rules What Is a Rule? Datalog as a First-Order Rule Language. Combining Rules with OWL DL. Rule Interchange Format (RIF). Query Languages SPARQL: Query Language for RDF. Conjunctive Queries for OWL DL. BEYOND FOUNDATIONS Ontology Engineering Requirement Analysis. Ontology Creation: Where Is Your Knowledge? Quality Assurance of Ontologies. Modular Ontologies: Divide and Conquer. Software Tools. Applications Web Data Exchange and Syndication. Semantic Wikis. Semantic Portals. Semantic Metadata in Data Formats. Semantic Web in Life Sciences. Ontologies for Standardizations. RIF Applications. Toward Future Applications. APPENDICES Extensible Markup Language (XML). Set Theory. Logic. Solutions to the Exercises. References. A Summary, Exercises, and Further Reading appear at the end of most chapters
For more information and complete contents, visit www.crctextbooks.com
21
EVALUATION COPY REQUEST FORM To help keep the costs of textbooks down, please do not request an Evaluation Copy unless you have a legitimate course requirement. Please fill out the form below completely, or to submit your request electronically, go to
http://www.crcpress.com/textbooks/evaluation_copy Please Print or tyPe. Please fill out one form for each book requested and provide as much of the information as you can to ensure prompt processing of your request.
Please send me:
Title ______________________________________________________________________ Catalog no. __________________________ ISBN: __________________________________ Professor’s Name ____________________________________________________________ College/University____________________________________________________________ Department ________________________________________________________________ Address ____________________________________________________________________ Please Provide comPlete shiPPing address - (no P.o. Box)
City/State/Zip ______________________________________________________________ Telephone # (include area code) ____________________________________________________ E-Mail Address ______________________________________________________________ Course Name/Number ________________________________________________________ Approx. Enrollment __________________________________________________________ Course Start Date ____________________________________________________________ Text Currently in Use ________________________________________________________ Campus Bookstore–Name/Phone no. ____________________________________________ Mail or Fax to:
CRC Press / Taylor & Francis Group 6000 Broken Sound Parkway, NW, Suite 300 • Boca Raton, FL 33487 TEL: 800-272-7737 • FAX 800-643-9428 Florida and outside the continental U.S.: TEL: 561-994-0555 • FAX: 561-361-6018 MBTCOSC TMC
Active and Agile Project-Oriented Learning
NEW!
Henrik B. Christensen University of Aarhus, Denmark
“…a careful selection of topics that are relevant, indeed crucial, for developing good quality software … leads the reader through an experience of active learning. —Michael Kölling, Bestselling author and originator of the BlueJ and Greenfoot Environments
• Presents 15 proven design patterns as well as the principles behind them • Includes numerous exercises, review questions, and two elaborate projects to help students develop the skills needed to design and implement successful frameworks • Provides access to installation guides, source code for the examples, and additional resources on the author’s website
Detailing the core concepts, practices, and tools of software design, including test-driven development, Flexible, Reliable Software: Using Patterns and Agile Development walks students through the software development process with practical stories and projects that illustrate the programming process in detail.
Catalog no. C3622, May 2010, 527 pp. ISBN: 978-1-4200-9362-9, $69.95
www.crctextbooks.com
Cutting-Edge Textbooks and Practical Teaching Tools
Request your complimentary review copy today
6000 Broken Sound Parkway, NW, Suite 300 Boca Raton, FL 33487, USA
Page 9
Page 13
For a complete list of Computer Science titles please visit www.crctextbooks.com
Page 6
Presorted Standard US Postage PAID Permit 382 South Holland IL