computer science textbooks - august 2010

http://www.crcpress.com/product/isbn/9781584888628




Contents

Introductory Texts ..................................................3

Programming Language ........................................4

Algorithms & Computation ..................................5

Discrete Math & Combinatorics ..........................11

Cryptography & Security ....................................12

Bioinformatics/Computational Biology ................14

Computer Graphics & Image Processing ............17

Machine Learning ................................................20

Page 8Page 4

Page 11 Page 14

Page 18

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.

Page 19

MBTCOSC TMC







http://issuu.com/action/page?page=3








3

Introductory Texts

For more information and complete contents, visit www.crctextbooks.com

New!

Explorations in ComputingAn Introduction to Computer ScienceJohn S. ConeryUniversity of Oregon, Eugene, USA

Catalog no. K10640, October 2010, c. 384 pp.ISBN: 978-1-4398-1262-4, $79.95

Based on a course taught by the author, this text-book provides an introduction to computer sciencefor non-majors or pre-majors in beginning courses.The book uses an active learning and problem-solv-ing approach to present key topics, along with real-world examples and practical algorithms. Theauthor explains how to read, rather than write, pro-grams and how to solve problems.

To provide a good understanding of computingwithout covering everything in the field, shortfocused chapters include tutorial projects and inter-active labs that use the simple open-source lan-guage, Ruby.

Features:

• Presents a project-based, active-learningapproach

• Provides a series of short chapters on interestingtopics in computer science

• Emphasizes computational thinking to showhow computer scientists solve problems

• Includes interactive labs and tutorial projectsusing the popular programming language,Ruby

• Includes a hands-on project and exercises inevery chapter

All of the modules have been collected into a singleRuby gem—making it easy for students to install allthe lab software at once at the beginning of theterm. The gem also includes data files and sampleRuby code that students can copy and modify.

A lab manual with step-by-step instructions forinstalling Ruby and lab software is available fromthe book’s web site. The manual includes tips forediting programs and running commands in a ter-minal emulator.

Contents:

A General Introduction to Computation

The Ruby Workbench—Introducing Ruby and the RubyLabs environmentfor computational experiments

The Sieve of Eratosthenes—An algorithm for finding prime numbers

A Journey of a Thousand Miles—Iteration as a strategy for solving computationalproblems

Divide and Conquer—A new strategy: breaking large problems intosmaller subproblems

When Words Collide—Organizing data for more efficient problem solv-ing

Bit by Bit—Binary codes and algorithms for text compressionand error correction

The War of the Words—An introduction to computer architecture andassembly 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 computationallydemanding problem

Answers to Selected Exercises

Ruby Reference


4 Order your review copy at www.crctextbooks.com

Programming Language

New!

Mastering LinuxPaul S. WangKent State University, Ohio, USA

Catalog no. K10350, September 2010424 pp., Soft CoverISBN: 978-1-4398-0686-9$49.95

More in-depth coverage than exist-ing introductions to Linux/UNIX

Helping students use and programLinux/UNIX with confidence, this text pro-vides a concise yet detailed introduction toLinux/UNIX. It covers interactive usage, toolsand applications, system administration, webhosting, C-level programming, and softwaremaintenance for the Linux/UNIX operatingsystem.

The author also describes the software pack-ages for Linux, including Apache, PHP, andMySQL. He supplies many realistic examplesas well as complete code files for download.The companion website provides ancillarymaterials, including hands-on experiments,and updates.

Features:

• Provides in-depth coverage of Linux/UNIXintroductory concepts, USAge tricks andtips, and Linux/UNIX programming

• Explores concepts, principles, and prac-tices, making it easy to use and programLinux/UNIX Concentrates on BASH shell

• Discusses Tcsh/Csh in an appendix

• Covers important software packages forLinux servers, including Apache, PHP, andMySQL

• Covers all key features for major UNIX systems

• Includes access to complete code files fordownload

Contents (abridged):

A Linux PrimerUnderstanding the Shell. Using Files and Directories.Protecting Files. Text Editing. Getting Hard/SavedCopies. Browsing the Web. Creating and Running YourOwn Program.Interactive Use of the ShellInteracting with Bash. Command Line Editing andCommand Completion. Bash Command Execution.Input/Output Redirection. Job Control. Bash ShellExpansions. Shell Variables. Desktops, Windows, and ApplicationsDesktop Overview: GNOME and KDE. GNOME DesktopComponents. Nautilus the GNOME File Manager.Graphical Applications. Saving Energy. Filters and Regular ExpressionsCommands and Filters. Grep Commands. RegularExpressions. Patterns for Grep. A Stream Editor: sed.Building Pipelines. Pattern Processing. Writing Shell ScriptsInvoking Shell Scripts. Execution. Positional Parameters.The For and if Commands. Test Expressions and ExitStatus. The shift Command. The case Command. Thewhile and until Commands. Numerical Expressions. FileQueries. The File SystemA File Location Road Map. File Types. File Status. FileStorage System Implementation. The Filesystem Table.Creating Special Files. Network Filesystem. Searchingthe File Tree. The locate Command. Saving,Compressing, and Distributing Files.Networking, Internet, and the WebNetworking Protocols. The Internet. The Domain NameSystem. Networking in Nautilus. NetworkingCommands. SSH with X11 Forwarding. Public-KeyEncryption and Digital Signature. Secure Email withMutt and GnuPG. Message Digests. Web Hosting: Apache, PHP and MySQLWhat 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. ...


5

Programming Language Algorithms & Computation


JavaProgrammingFundamentalsProblem SolvingThrough ObjectOriented Analysisand DesignPremchand S. NairCreighton University, Omaha,Nebraska, USA

“ …carefully thought out and well crafted … a ped-agogically excellent first course in object-orienteddesign and programming. … my first choice forlearning object orientation and Java in considerabledepth …”

—George Hacken, in Computing Reviews, July 2009

“… covers a good deal of Java, while also providingthe rudiments of UML, some fundamental algo-rithms like sorting, and data structures like arrays.… The abundance of examples and exercises is veryvaluable … Summing Up: Recommended.”

—L. Benedicenti, University of Regina, in CHOICE, Vol. 47, No. 04

While Java texts are plentiful, it’s difficult to find onethat takes a real-world approach, one that encour-ages students to build on their Java skills throughpractical exercise. Written by an expert with twodecades of Java teaching experience, this bookpresents object-oriented programming employingexamples taken from everyday life. It uses Java 6and includes detailed explanations of key concepts,solved examples, and a number of supplements forstudents and instructors found on an accompany-ing CD and a dedicated website. The book alsoincludes a detailed chapter on Graphical UserInterface, which allows students to begin to pro-duce programs that they can interact with in morefamiliar ways.

Contents:

Object Model of Computation. Class and JavaFundamentals. Object Oriented Design. DecisionMaking. Power of Repetition. Methods. Principlesof Object-Orientation. Graphical User Interface:Applications and Applets. Simple Data Structures.Searching and Sorting. Exception Handling.

A CD-ROM and access to a website with software,solutions, and PowerPoint® slides are available uponcourse adoption.

Catalog no. C6547, 2009, 729 pp., Soft CoverISBN: 978-1-4200-6547-3, $89.95

ParallelAlgorithmsHenri CasanovaUniversity of Hawaii, Honolulu,USA

Arnaud LegrandUniversity of Grenoble, France

Yves RobertUniversité de Lyon, France

"… sound, principled treatment of parallel algo-rithms. … very well written and extremely welldesigned from an instructional point of view. … asolid, readable text for a course on parallelism incomputing. … highly recommended."

—SIAM Review, Vol. 52, No. 1, 2010

"… a very good teaching book … contains manyschemes, diagrams, and pictures for better under-standing, including many practical examples, casestudies, and exercises."

—EMS Newsletter, June 2009

"… the tools you need to continue on a rigorousresearch track into the computer science aspects ofparallel computing. … a solid foundation for thestudy of parallel algorithms."

—John West, HPCwire, April 2009

Focusing on algorithms for distributed-memoryparallel architectures, this text presents theoreticalmodels of parallel computation, parallel algorithmdesign for homogeneous and heterogeneous plat-forms, complexity and performance analysis, andessential notions of scheduling. With many exam-ples, case studies, exercises, and solutions, itencompasses both the theoretical foundations ofparallel algorithms and practical parallel algorithmdesign.

Features:

• Demonstrates the use of theoretical parallelcomputing models in practice

• Explains network principles relevant to parallelalgorithm design and performance

• Provides a unified, rigorous approach to per-formance modeling

• Shows how to recognize performance trade-offsand develop sound performance models with avariety of assumptions

• Contains many examples, case studies, exercis-es, and solutions

Catalog no. C9454, 2009, 360 pp.ISBN: 978-1-58488-945-8, $81.95




Algorithms & Computation

Methods in Algorithmic AnalysisVladimir A. DobrushkinBrown University, Providence, Rhode Island, USA

Catalog no. C6829, January 2010, 824 pp. ISBN: 978-1-4200-6829-0$89.95

“…helpful to any mathematics student whowishes to acquire a background in classicalprobability and analysis … This is a remark-ably beautiful book that would be a pleasurefor a student to read, or for a teacher to makeinto a year's course.”—Harvey Cohn, Computing Reviews, May 2010

Accompanied by more than 1,000 examplesand exercises, this comprehensive, classroom-tested text presents numerous theories, tech-niques, and methods used for analyzing algo-rithms. It includes basic material on combina-torics and probability useful for students withweak backgrounds.

The book presents information on asymptot-ics not usually found in similar books, includ-ing Rice’s method, the Euler and Boole sum-mation formulas, and recurrences. It offerstutorials throughout the text on topics asdiverse as continued fractions, functions of acomplex variable, numerical calculations, andStieltjes integration. An appendix contains acomprehensive collection of useful formulas.

Features:

• Provides a solid theoretical and mathemat-ical background on the analysis of algo-rithms

• Includes basic material on combinatoricsand probability

• Contains many problems of varying levelsof difficulty

• Supplies a comprehensive collection ofuseful formulas

• Uses C++ as the generic form for illustrat-ing algorithms

• Contains problems graded 1-5 accordingto levels of difficulty

• Introduces problem sets after each majorsection

Contents (abridged):PreliminariesWhy Do We Analyze Algorithms? Proofs. Iteration andRecursion.CombinatoricsProperties of Summation. Multiple Sums. Principles ofCounting. Permutations and Combinations. BinomialCoefficients. Binomial Coefficient and HypergeometricFunctions. Stirling Approximation.ProbabilitySet Operations. Sample Space and Random Variables.Calculating Probabilities. Random Variables.Conditional Probabilities. Independence. JointDistributions. Dependent Random Variables. More about ProbabilitySpecial Distributions. Types of ProbabilisticConvergence. The Theorem of Total Probability. Bayes’Theorem. Convolution. Order Statistics. ChebyshevInequality. Sundry Examples. Recurrences or Difference EquationsHow Do Difference Equations Arise? Properties ofDifference Equations. First Order Linear DifferenceEquations. Divide-and-Conquer Recurrences. QuicksortRecurrence. Recurrences in Numerical Analysis.Continued Fractions. Partial Difference Equations.Some Applications.Introduction to Generating FunctionsGenerating Functions—Definitions. Extraction ofCoefficients. Counting Binary Trees. SolvingRecurrences. Snake Oil Summation. Applications inProbability. The Langrage Inversion Theorem.Enumeration with Generating FunctionsDefinition of Enumerators. Sum and Product Rules.Counting Compositions of Integers. Further SetOperations. Partition of Integers. ExponentialEnumerators.Further Enumeration MethodsEnumeration of Trees. Occupancy Enumeration. ThePrinciple of Inclusion and Exclusion (PIE). Extensionsand Further Applications of the PIE. ProbabilisticInclusion-Exclusion Principle. Runs in Permutations.Combinatorics of StringsOperations on Languages. Regular Languages. CountingRegular Languages. Waiting Time ProbabilisticProblems. Algorithms and Markov Chains. ...


7



Introduction to Concurrency in Programming LanguagesMatthew J. SottileUniversity of Oregon, Eugene, USA

Timothy G. MattsonIntel Corporation, Dupont, Washington, USA

Craig E. RasmussenLos Alamos National Laboratory, New Mexico, USA

Catalog no. C7213, January 2010, 344 pp.ISBN: 978-1-4200-7213-6, $79.95

“… a nice survey of the current state of the art ofparallel algorithm design and implementation …this concise yet thorough book provides an out-standing introduction to the important field of con-current programming and the techniques currentlyemployed to design parallel algorithms. It is clearlywritten, well organized, and cuts to the point … Ihighly recommend to those interested in the designand implementation of parallel algorithms.”

—Fernando Berzal, Computing Reviews, May 2010

Illustrating the effect of concurrency on programswritten in familiar languages, this text focuses onnovel language abstractions that truly bring con-currency into the language and aid analysis andcompilation tools in generating efficient, correctprograms. It also explains the complexity involvedin taking advantage of concurrency with regard toprogram correctness and performance. The bookdescribes the historical development of current pro-gramming languages and the common threadsthat exist among them. It also contains severalchapters on design patterns for parallel program-ming and includes quick reference guides toOpenMP, Erlang, and Cilk.

Features:

• Provides a solid understanding of the importantconcepts in concurrent/parallel computing andparallel languages

• Describes the historical development of currentprogramming languages

• Contains several chapters on design patterns forparallel programming

• Includes end-of-chapter exercises and algorithmcase studies, along with quick reference guidesto OpenMP, Erlang, and Cilk

Lecture notes, source code examples, and links tolanguage compilers are made available on thebook’s website upon course adoption.

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. Higher-level techniques. The limits of explicit control. High-Level Language ConstructsCommon high-level constructs. Using and evaluat-ing language constructs. Implications of concur-rency. Interpreted languages.Historical Context and Evolution of LanguagesEvolution of machines. Evolution of programminglanguages. Limits to automatic parallelization.Modern Languages and ConcurrencyConstructsArray abstractions. Message passing. Control flow.Functional languages. Functional operators.Performance Considerations and ModernSystemsMemory. Amdahl’s law, speedup, and efficiency.Locking. Thread overhead. Introduction to Parallel Algorithms Designing parallel algorithms. Finding concurren-cy. Strategies for exploiting concurrency.Algorithm patterns. Patterns supporting parallelsource code. Demonstrating parallel algorithmpatterns.Pattern: Task ParallelismSupporting algorithm structures. Case study:Genetic algorithms. Case study: Mandelbrot setcomputation.Pattern: Data ParallelismCase study: Matrix multiplication. Case study:Cellular automaton. Limitations of SIMD dataparallel programming. Beyond SIMD. Geometricdecomposition. ...




Grid ComputingTechniques and ApplicationsBarry WilkinsonUniversity of North Carolina, Charlotte, USA

Catalog no. C6953, January 2010, 387 pp. ISBN: 978-1-4200-6953-2, $79.95

“…the most outstanding aspect of this book isits excellent structure: it is as though we havebeen given a map to help us move around thistechnology from the base to the summit … I highly recommend this book…”—Jose Lloret, in Computing Reviews, March 2010

Designed for senior undergraduate and first-year graduate students, this classroom-testedbook shows professors how to teach this sub-ject in a practical way. It encompasses the var-ied and interconnected aspects of Grid com-puting, including how to design a system infra-structure and Grid portal. The text covers jobsubmission and scheduling, Grid security, Gridcomputing services and software tools, graphi-cal user interfaces, workflow editors, and Grid-enabling applications. It also contains pro-gramming assignments and multiple-choicequestions and answers. The author’s Web siteoffers various instructional resources, includingslides and links to software for the program-ming assignments.

Features:

• Includes end-of-chapter self-assessmentquestions and programming assignments

• Introduces production-style Grid portalsbefore covering what happens behind theportal

• Explores user-friendly interfaces and Grid-enabling applications

• Includes related material, such as network-ing basics, Linux/Windows command-lineinterfaces, and a Globus installation tutorial,in the appendices

Ancillary materials are available on the author’swebsite upon course adoption.

Contents:Introduction to Grid ComputingGrid Computing Concept. History of DistributedComputing. Computational Grid Applications. GridComputing Infrastructure Development. GridComputing Courses. Grid Computing SoftwareInterface. Job SubmissionGlobus Job Submission. Transferring Files. SchedulersScheduler Features. Scheduler Examples. GridComputing Meta-Schedulers. Distributed ResourceManagement Application (DRMAA).Security ConceptsSymmetric Key Cryptography. Asymmetric KeyCryptography (Public Key Cryptography). Public KeyInfrastructure. Systems/Protocols Using SecurityMechanisms.Grid SecurityGrid Security Infrastructure (GSI). Delegation. Higher-Level Authorization Tools. System Infrastructure I: Web ServicesService-Oriented Architecture. Web Services. WebService Implementation.System Infrastructure II: Grid Computing ServicesGrid Computing and Standardization Bodies.Interacting Grid Computing Components. Open GridServices Architecture (OGSA).User-Friendly InterfacesGrid Computing Workflow Editors. Grid Portals.Grid-Enabling ApplicationsParameter Sweep. Using an Existing Program onMultiple Grid Computers. Writing an ApplicationSpecifically for a Grid. Using Multiple Grid Computersto Solve a Single Problem.AppendicesInternet and Networking Basics. Linux and WindowsCommand-Line Interfaces. XML Markup Language.Globus Installation Tutorial.GlossaryAnswers to Self-Assessment Questions

Each chapter starts with an Introduction and concludeswith a Summary, Further Reading, Bibliography, Self-Assessment Questions, and Programming Assignments.


9



Introduction to Mathematical LogicFifth EditionElliott MendelsonQueens College, Dept. of Mathematics, Flushing, New York, USA


“Since it first appeared in 1964, Mendelson's book hasbeen recognized as an excellent textbook in the field.It is one of the most frequently mentioned texts in ref-erences and recommended reading lists … This bookrightfully belongs in the small, elite set of superb booksthat every computer science graduate, graduate stu-dent, scientist, and teacher should be familiar with.”

—Computing Reviews, May 2010

"Since its first edition, this fine book has been a textof choice for a beginner’s course on mathematicallogic. … There are many fine books on mathemati-cal logic, but Mendelson’s textbook remains a surechoice for a first course for its clear explanationsand organization: definitions, examples and resultsfit together in a harmonic way, making the book apleasure to read. … a wealth of exercises to test thereader’s understanding."

—MAA Reviews, December 2009

Retaining all the key features of its predecessors, thisfifth edition of a long-established, bestselling textexplores the principal topics of mathematical logic.This edition includes a new section covering basicideas and results about nonstandard models ofnumber theory, a second appendix that introducesmodal propositional logic, and an expanded bibli-ography. additional exercises and selected answers.

This edition continues to cover propositional logic,first-order logic, first-order number theory,axiomatic set theory, and the theory of com-putability. It also discusses the major results ofGödel, Church, Kleene, Rosser, and Turing.

Features:

• Provides a compact introduction to the principaltopics of mathematical logic

• Presents the fundamental assumptions andproof techniques that form the basis of mathematical logic

• Explores logic and computability theory—indispensable tools in theoretical computer science and artificial intelligence

Contents:

The Propositional Calculus

Propositional Connectives. Truth Tables.Tautologies. Adequate Sets of Connectives. AnAxiom System for the Propositional Calculus.Independence. Many-Valued Logics. OtherAxiomatizations.

First-Order Logic and Model Theory

Quantifiers. First-Order Languages and TheirInterpretations. Satisfiability and Truth. Models.First-Order Theories. Additional Metatheoremsand Derived Rules. Rule C. CompletenessTheorems. First-Order Theories with Equality.Definitions of New Function Letters andIndividual Constants. Prenex Normal Forms.Isomorphism of Interpretations.

Formal Number Theory

An Axiom System. Number-Theoretic Functionsand Relations. Primitive Recursive and RecursiveFunctions. Arithmetization. Gödel Numbers. TheFixed-Point Theorem. Gödel’s IncompletenessTheorem. Recursive Undecidability. Church’sTheorem. Nonstandard Models.

Axiomatic Set Theory

An Axiom System. Ordinal Numbers.Equinumerosity. Finite and Denumerable Sets.Hartogs’ Theorem. Initial Ordinals. OrdinalArithmetic. The Axiom of Choice. The Axiom ofRegularity. Other Axiomatizations of Set Theory.

Computability

Algorithms. Turing Machines. Diagrams. PartialRecursive Functions. Unsolvable Problems. TheKleene–Mostowski Hierarchy. RecursivelyEnumerable Sets. Other Notions ofComputability. Decision Problems.

Appendix A: Second-Order Logic.

Appendix B: First Steps in Modal PropositionalLogic.

Answers to Selected Exercises




Classical and Modern Numerical AnalysisTheory, Methods and PracticeAzmy S. Ackleh and R. Baker KearfottUniversity of Louisiana, LaFayette, USA

Edward James AllenTexas Tech University, Lubbock, USA

Padmanabhan SeshaiyerGeorge Mason University, Fairfax, Virginia, USA

Catalog no. C9157, January 2010, 628 pp. ISBN: 978-1-4200-9157-1, $99.95

“…provides useful background knowledge forgraduate study in any area of applied mathe-matics … this is a thorough, well-writtentreatment of an important subject.”

—Computing Reviews, May 2010

Helping students prepare for doctoral exami-nations in numerical analysis, this graduate-level text provides a sound introduction tothe theory and application of computationalmethods for applied mathematics problems.It also assists students in understanding themathematical literature in this area. Theauthors present the most importantadvanced aspects of numerical linear algebra,finite element theory, approximation theory,optimization, and integral equations. Theyalso cover interval computation methods innumerical analysis and include fully workedout solutions for selected problems. A solu-tions manual is available for qualifyinginstructors.

Features:

• Provides a clear introduction to the theoryand application of computational methods for applied mathematics

• Helps prepare students for doctoral examinations in numerical analysis

• Presents the most important advancedaspects of numerical linear algebra, finiteelement theory, approximation theory,optimization, and integral equations

• Covers interval computation methods innumerical analysis

• Includes fully worked out solutions forselected problems

• Offers MATLAB® files on the authors' website

Solutions manual available upon course adoption

Contents (abridged):Mathematical Review and Computer Arithmetic Mathematical Review. Computer Arithmetic. IntervalComputations.Numerical Solution of Nonlinear Equations of OneVariable Bisection Method. The Fixed Point Method. Newton’sMethod. The Univariate Interval Newton Method.Secant Method and Müller’s Method. AitkenAcceleration and Steffensen’s Method. Roots ofPolynomials. Numerical Linear Algebra Basic Results from Linear Algebra. Normed LinearSpaces. Direct Methods for Solving Linear Systems.Iterative Methods for Solving Linear Systems. TheSingular Value Decomposition.Approximation TheoryNorms, Projections, Inner Product Spaces, andOrthogonalization in Function Spaces. PolynomialApproximation. Piecewise Polynomial Approximation.Trigonometric Approximation. Rational Approximation.Wavelet Bases. Least Squares Approximation on a FinitePoint 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 DifferentialEquationsEuler’s Method. Single-Step Methods: Taylor Series andRunge–Kutta. Error Control and theRunge–Kutta–Fehlberg Method. Multistep Methods.Predictor-Corrector Methods. Stiff Systems.Extrapolation Methods. Numerical Solution of Systems of NonlinearEquations Introduction and Fréchet Derivatives. SuccessiveApproximation (Fixed Point Iteration) and theContraction Mapping Theorem. Newton’s Method andVariations. Multivariate Interval Newton Methods.Quasi-Newton Methods. ...


11

Discrete Math & Combinatorics


DiscreteMathematicsProofs, Structuresand Applications,Third EditionR. GarnierSurrey, UK

J. TaylorUniversity of Brighton, UK

An accessible introduction to discretemathematics

"The choice of the topics covered in this text is large-ly suggested by the needs of computer science. …The style of exposition is very clear, step by step andthe level is well adapted to undergraduates in com-puter science. The treatment is mathematically rig-orous; therefore it is also suitable for mathematicsstudents. Besides the theory there are many concreteexamples and exercises (with solutions!) to developthe routine of the student. So I can recommendwarmly this book … an excellent textbook."

—H.G.J. Pijls, University of Amsterdam, TheNetherlands

This third edition continues to provide a rigorousyet accessible exposition of discrete mathematics,including the core mathematical foundation ofcomputer science. The text includes a new sectionon the formal proof of the validity of arguments inpropositional logic before moving on to predicatelogic. This edition also contains a new chapter onelementary number theory and congruences. Thischapter explores groups that arise in modular arith-metic and RSA encryption, a widely used public keyencryption scheme that enables practical andsecure means of encrypting data.

A detailed solutions manual is available upon courseadoption.

Features:

• Covers the main mathematical underpinnings ofcomputer science

• Shows how relations and functions fit into typedset theory

• Introduces a specification approach to mathe-matical operations

• Presents public key encryption algorithms basedon number theory

• Explores applications in relational databases andgraph theory

• Includes further reading suggestions andnumerous exercises, many with solutions

Catalog no. K10650, January 2010, 843 pp.ISBN: 978-1-4398-1280-8, $89.95

Applied AlgebraCodes, Ciphers andDiscrete Algorithms,Second EditionDarel W. HardyColorado State University, FortCollins, USA

Fred RichmanFlorida Atlantic University, BocaRaton, USA

Carol L. WalkerNew Mexico State University, Las Cruces, USA

“ … show[s] the power of algebra in a relativelysimple setting.”

—Mathematical Reviews, 2010

Includes a CD-ROM that contains an interactive ver-sion of the book

Using mathematical tools from number theory andfinite fields, this text presents practical methods forsolving problems in data security and data integri-ty. It covers many algorithms that arise in cryptog-raphy and error-control codes. Along with dou-bling the number of exercises, this edition includesa new appendix that reviews prerequisite topics inalgebra and number theory. The accompanyingCD-ROM contains an interactive version of thebook that is powered by Scientific Notebook®, amathematical word processor and easy-to-usecomputer algebra system.

A solutions manual is available upon course adoption.

Features:

• Covers topics from algebra, cryptography, andnumber theory

• Includes algorithms that offer common-senseapproaches to problems, such as computinglarge powers

• Provides complete coverage on error-correctingcodes

• Explains the Rijndael algorithm to help studentsunderstand the data encryption standard

CD-ROM Includes:

• Links that make it easy to navigate page-by-page, chapter-by-chapter, or by keyword

• Interactive examples, computing hints, self-tests • Details of solutions to problems beyond those inthe printed text





Cryptography & Security

New!

Access Control, Security, and TrustA Logical ApproachShiu-Kai Chin and Susan Beth OlderSyracuse University, New York, USA

Catalog no. C8628, July 2010, 351 pp.ISBN: 978-1-58488-862-8$89.95

Developed from the authors’ courses atSyracuse University and the U.S. Air ForceResearch Laboratory, this book equips stu-dents with an access control logic they canuse to specify and verify their securitydesigns. Throughout the text, the authorsuse a single access control logic based ona simple propositional modal logic. Thefirst part of the book presents the syntaxand semantics of access control logic,basic access control concepts, and anintroduction to confidentiality and integri-ty policies. The second section coversaccess control in networks, delegation,protocols, and the use of cryptography. Inthe third section, the authors focus onhardware and virtual machines. The finalpart discusses confidentiality, integrity, androle-based access control.

A solutions manual and slides are availableupon course adoption.

Features:

• Employs propositional modal logic toexplain access control principles

• Shows how to perform derivations andcalculations with mathematical preci-sion and accuracy

• Focuses on reference monitors in secu-rity

• Presents numerous examples rangingfrom the control of physical memory inhardware to multilevel security policies

• Includes exercises that deal with appli-cation, analysis, synthesis, and evalua-tion

• Offers HOL-4 implementation andslides for each chapter available fordownload

Contents:

Access Control, Security, Trust, and Logic Deconstructing Access Control Decisions. A LogicalApproach to Access Control. PRELIMINARIES A Language for Access ControlSets and Relations. Syntax. Semantics.Reasoning about Access Control Logical Rules. Formal Proofs and Theorems. Soundness ofLogical Rules.Basic Concepts Reference Monitors. Access Control Mechanisms: Ticketsand Lists. Authentication. Security PoliciesConfidentiality, Integrity, and Availability. DiscretionarySecurity Policies. Mandatory Security Policies. MilitarySecurity Policies. Commercial Policies.DISTRIBUTED ACCESS CONTROL Digital Authentication Public-Key Cryptography. Efficiency Mechanisms.Reasoning about Cryptographic Communications.Certificates, Certificate Authorities, and Trust. Symmetric-Key Cryptography.Delegation Simple Delegations. Delegation and Its Properties. ADelegation Example: Simple Checking. Networks: Case Studies SSL and TLS: Authentication across the Web. Kerberos:Authentication for Distributed Systems. FinancialNetworks.ISOLATION AND SHARING A Primer on Computer HardwareOnes and Zeros. Synchronous Design. Microcode.Virtual Machines and Memory Protection A Simple Processor. Processors with MemorySegmentation. Controlling Access to Memory andSegmentation Registers. Design of the Virtual MachineMonitor.Access Control Using Descriptors and CapabilitiesAddress Descriptors and Capabilities. Tagged Architectures.Capability Systems.


13

Cryptography & Security


New!

Introduction to Cryptography withMathematical Foundations and ComputerImplementationsAlexander StanoyevitchCalifornia State University–Dominguez Hills, Carson, USA

Catalog no. K10916, August 2010, 669 pp.ISBN: 978-1-4398-1763-6, $89.95

From the exciting history of its development inancient times to the present day, this self-containedintroduction provides a focused tour of the centralconcepts of cryptography. It delineates crypto-graphic concepts in chronological order, develop-ing the mathematics as needed. The text includesnumerous examples and exercises, along with com-puter implementation sections that guide studentsthrough the process of writing their own programs.Detailed solutions to many of the exercises can befound in the appendices while a solutions manual isavailable upon qualifying course adoption. A sup-porting website provides an extensive set of sampleprograms as well as downloadable platform-inde-pendent applet pages for some core programs andalgorithms.

A solutions manual is available upon course adoption.

Features:

• Provides a focused, self-contained treatment ofcryptography

• Covers elliptic curve cryptography

• Offers complete coverage of all the neededmaterial on number theory and abstract algebra

• Presents algorithms in pseudo-code Containsbackground material and extensive exercisesolutions in the appendices

• Includes both standard and computer exercisesas well as numerous worked examples

• Supplies access to sample programs and plat-form-independent applets on the supportingwebsite

Contents:

Overview of the Subject

Divisibility and Modular Arithmetic

The Evolution of Codemaking until the ComputerEra

Matrices and the Hill Cryptosystem

The Evolution of Codebreaking until theComputer Era

Representation and Arithmetic of Integers inDifferent Bases

Block Cryptosystems and the Data EncryptionStandard (DES)

Some Number Theory and Algorithms

Public Key Cryptography

Finite Fields in General and GF(28) in Particular

The Advanced Encryption Standard (AES) Protocol

Elliptic Curve Cryptography

Appendices

Sets and Basic Counting Principles. Randomnessand Probability. Solutions to All Exercises.Answers and Brief Solutions to Selected Odd-Numbered Exercises. Suggestions for FurtherReading.

References

Exercises and Computer Implementations appear atthe end of each chapter



Bioinformatics/Computational Biology

EngineeringGenetic CircuitsChris J. MyersUniversity of Utah, Salt lake City,USA

"… one of the few texts in the area that gentlybrings the uninitiated to these edges. … admirablytouches on much of the ‘required’ knowledge whilecreating a minimal toolset with which beginningstudents can confidently venture into this excitingnew territory of systems biology."

—Adam Arkin, University of California, Berkeley, USA

"… an excellent reference for any course in systemsbiology … . I find the many illustrations (worked-out examples and ample number of figures) andexercises at the end of each chapter quite useful andimportant."

—Baltazar Aguda, The Ohio State University,Columbus, USA

Focusing on genetic regulatory networks,Engineering Genetic Circuits presents the model-ing, analysis, and design methods for systems biol-ogy. It discusses how to examine experimental datato learn about mathematical models, develop effi-cient abstraction and simulation methods to ana-lyze these models, and use analytical methods toguide the design of new circuits. The authorreviews basic molecular biology and biochemistryprinciples, covers several methods for modelingand analyzing genetic circuits, and uses thelysis/lysogeny decision circuit of phage lambda asan example throughout to help illustrate the vari-ous methods.

iBioSim software, lecture slides, problem sets, and apassword-protected solutions manual are availableon the author’s website.

Features:

• Introduces relevant biology and biochemistryfor readers with an engineering background

• Covers key methods for modeling and analyzinggenetic circuits

• Presents an introduction to the emerging areaof synthetic biology

• Includes exercises and self-study problem sets inevery chapter

• Utilizes an illustrative example system across allchapters (lambda phage)


Algorithms inBioinformaticsA PracticalIntroductionWing-Kin SungNational University of Singapore

"… an excellent guide. … appropriate for advancedundergraduates and graduates in mathematics orCS. … The 27-page introduction is the most efficientconcept-building summary and explication ofmolecular biology that I have encountered. …Section 1.8 sets a new, high standard for science-history exposition, covering Gregor Mendel to thepresent. …This self-contained, well-designed, andwell-written book, with its many good exercises,bibliographic references, and photo-quality figures,is an ideal introduction to bioinformatics."

—George Hacken, Computing Reviews, March 2010

This classroom-tested text provides an in-depthintroduction to the algorithmic techniques applied inbioinformatics. For each topic, the author clearlydetails the biological motivation, precisely definesthe corresponding computational problems, andincludes detailed examples to illustrate each algo-rithm. The text covers basic molecular biology con-cepts, sequence similarity, the suffix tree, sequencedatabases, sequence and genome alignment, thephylogenetic tree, genome rearrangement, motiffinding, the secondary structure of RNA, peptidesequencing, and population genetics.Supplementary material is provided on the author’swebsite and a solutions manual is available for quali-fying instructors. Presents a comprehensive overviewof principles and methods in bioinformatics

• Covers numerous applications of algorithms inbioinformatics

• Discusses the practical issues and actual per-formance of using various methods with realbiological data

• Assumes no prior knowledge of molecular biology

• Offers PowerPoint® slides and other supplemen-tary material on the author’s website

Solutions manual available upon course adoption




15



Systems BiologyandBioinformaticsA ComputationalApproachKayvan Najarian,Christopher N.Eichelberger, Siamak Najarian andShahriar Gharibzadeh

Written by field experts with proven track records, thisauthoritative text begins with an introduction to sys-tems biology and its impact on biology and medicine.Next, it reviews the basic principles of molecular andcell biology using a system-oriented approach, with abrief description of the high-throughput biologicalexperiments that produce databases. The bookincludes techniques to discover genes, performnucleotide and amino acid sequence matching, andestimate static gene dynamic pathways. It alsoexplains how to use system-oriented models to pre-dict the behavior of biological systems for importantapplications such as rational drug design.

The numerous examples and problem sets allowstudents to confidently explore practical systemsbiology applications using real examples with realbiological data, making it an ideal text for seniorundergraduate and first-year graduate students. • Provides methods to integrate high level imag-ing data and molecular level measurements tomodel biological systems

• Presents the necessary biological and mathe-matical background

• Includes practical examples and experimentswith real data

• Covers the computational approach andadvanced mathematical methods

Solutions manual is available upon course adoption

Contents:

Cell Biology. Bioassays. Review of SomeComputational Methods. ComputationalStructural Biology: Protein Structure Prediction.Computational Structural Biology. Genomics andProteomics. Methods for Identification ofDifferentially Expressed Genes or Proteins. Binaryand Bayesian Networks as Static Models ofRegulatory Pathways. Metabolic Control Theoryfor Static Modeling of Metabolic Pathways.System Identification and Control Theory forDynamic Modeling of Biological Pathways. GeneSilencing for Systems Biology. Simulation andSystems Biology. Software, Databases, and OtherResources for Systems Biology. Future Directions.

Catalog no. 46500, 2009, 190 pp.ISBN: 978-1-4200-4650-2, $69.95

StructuralBioinformaticsAn AlgorithmicApproachForbes J. BurkowskiUniversity of Waterloo, Ontario,Canada

“…the book presents a number of topics in struc-tural bioinformatics … It targets advanced under-graduate students and hence the description ofmore complicated algorithms is avoided. … pro-vides an interesting introduction to the area.”

—Lucian Ilie, Mathematical Reviews, November 2009

Showcasing the beauty of protein structures, thispractical text illustrates how to apply key algo-rithms to solve problems related to macromolecu-lar structure. It emphasizes a methodology thatuses mathematical models as links between struc-tural biology and computational algorithms. Theauthor shows that protein structure can producesymmetry and beauty as well as biological function.He also gives many examples of dynamic program-ming applications, including RNA secondary struc-ture prediction and protein sequence alignment.The text includes problems throughout, exercisesat the end of each chapter, and a 12-page colorinsert.• Presents the basic mathematical techniquesunderlying core algorithms in structural bioin-formatics

• Provides many examples of dynamic program-ming applications, including RNA secondarystructure prediction and protein sequence align-ment

• Reviews necessary mathematics, such as linearalgebra, in the appendices

• Includes problems throughout, exercises at theend of each chapter, and a 12-page color insert

Solutions MANUAL and PowerPoint® slides availableupon course adoption.

Contents:

The Study of Structural Bioinformatics.Introduction to Macromolecular Structure. DataSources, Formats, and Applications. DynamicProgramming. RNA Secondary StructurePrediction. Protein Sequence Alignment. ProteinGeometry. Coordinate Transformations. StructureComparison, Alignment, and Superposition.Machine Learning. Overview of the Appendices.






New!

Biological ComputationEhud LammTel-Aviv University, Israel

Ron UngerBar-Ilan University, Ramat-Gan, Israel

Catalog no. C7959, October 2010, c. 344 pp.ISBN: 978-1-4200-8795-6, $79.95

Created for advanced undergraduates in computerscience programs, Biological Computation coversmajor themes of bio-inspired computing, includingcellular automata, molecular computation, geneticalgorithms, and neural networks.

Providing theoretical and coding exercises, this self-contained text requires no previous knowledge ofbiology. The book provides valuable insight toresearchers and students from biomedical back-grounds looking to gain the computational skillsneeded to make entry into the fields of systemsbiology, biological modeling, and simulations.

Features:

• Gives a unified overview of computer scienceideas inspired by biology

• Concentrates on the aspects of biological phe-nomena most closely related to the computa-tional approaches of cellular automata, evolu-tionary 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 Biologyon Mathematics—Historical Examples. BiologicalIntroduction. Models and Simulations.

Cellular Automata

Biological Background. The Game of Life. GeneralDefinition of Cellular Automata. Examples ofCellular Automata. Comparison with aContinuous Mathematical Model. ComputationalUniversality. Self-Replication. Pseudo Code.

Evolutionary Computation

Evolutionary Biology and Evolutionary.Computation. Genetic Algorithms. ExampleApplications. Analysis of the Behavior of GeneticAlgorithms. Lamarckian Evolution. GeneticProgramming. A Second Look at the EvolutionaryProcess. Pseudo Code.

Artificial Neural Networks

Biological Background. Learning. Artificial NeuralNetworks. The Perceptron. Learning in aMultilayered Network. Associative Memory.Unsupervised Learning.

Molecular Computation

Biological Background—Experimental Techniques.Computation Using DNA. EnzymaticComputation.

The Never-Ending Story: Additional Topics onthe Interface between Biology andComputation

Swarm Intelligence. Artificial Immune Systems.Artificial Life. Systems Biology.

Each chapter concludes with a Summary, FurtherReading, Exercises, and Answers to Selected Exercises


17

Computer Graphics & Image Processing


New!

Computer Graphics Through OpenGLFrom Theory to ExperimentsSumanta GuhaAsian Institute of Technology, Thailand

Catalog no. K12068, September 2010, 888 pp.ISBN: 978-1-4398-4620-9, $99.95

From geometric primitives to animation to 3D modeling tolighting and shading, this comprehensive introduction to com-puter graphics uses an active learning style to teach key con-cepts. Equally emphasizing theory and practice, the book pro-vides an understanding not only of the principles of 3D com-puter graphics, but also the use of the OpenGL ApplicationProgramming Interface (API) to program 3D applications.

Forming the undergraduate core of the text, the first fourteenchapters cover the concepts fundamental to 3D computergraphics and illustrate how to code fairly sophisticated 3Dscenes and animation, including games and movies. Theremaining chapters explore more advanced topics, such as thestructure of curves and surfaces, applications of projectivespaces and transformations, and programmable graphicspipelines. Using a hands-on, interactive approach that mixestheory and coding, the text makes the theory accessible byhaving students run clarifying code.

Web Resources

The book’s website provides program source code that runs onWindows, Mac OS, and Linux platforms. It also includes a guideto installing OpenGL and executing the programs, special soft-ware to help run the experiments, and figures from the book. Inaddition, the website provides a discussion forum for interactionamong users of the book.

Features:• Covers the foundations of 3D computer graphics, includinganimation, visual techniques, and 3D modeling

• Introduces classical and programmable pipelines inOpenGL

• Integrates code with the theory to give students a hands-on appreciation of the subject

• Includes 140 programs with 200 experiments based onthem

• Contains 600 exercises, 100 worked examples, and nearly600 color illustrations

• Requires no previous knowledge of computer graphics • Offers access to downloadable multiplatform programs inC++ and OpenGL, installation guides, and an interactivediscussion forum

Solutions manual and test bank questions available upon courseadoption

Contents:

Hello World

An Invitation to Computer Graphics.On to OpenGL and 3D ComputerGraphics.

Tricks of the Trade

An OpenGL Toolbox.

Movers and Shapers

Transformation, Animation andViewing. Inside Animation: TheTheory of Transformations. AdvancedAnimation 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 VisualTechniques.

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.

Appendices:

Projective Spaces and Transformations.Installing OpenGL and Running Code.Math Self-Test. Math Self-TestSolutions.




New!

The Science of ImagingSecond EditionGraham SaxbyUniversity of Wolverhampton (retired), UK

Catalog no. K10653, October 2010, c. 346 pp.ISBN: 978-1-4398-1286-0, $69.95

Praise for the Previous Edition:

"… a truly valuable book … It's the best book I have readon 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 photographershould own it, and every lecturer and journalist shouldknow its contents inside out."

—Jon Tarrant, British Journal of Photography

Edited and expanded to keep pace with the digital revo-lution, the second edition of this highly popular and crit-ically acclaimed work continues to provide students witha comprehensive exploration of imaging science.Brilliantly written and extensively illustrated, it covers fun-damental laws of physics as well as the cutting-edgetechniques that are defining the current direction of thefield. It adds a new section on astronomical imaging, aswell as major revisions in the areas of digital imaging andmodern technology. All references have been updatedand now include a significant number of URLs leading toboth teaching materials and expanded information.

Starting with the fundamentals of light and basic cam-eras, the author journeys through television and hologra-phy to advanced scientific and medical imaging. Topicssuch as digital recording of images, the photographicprocess, and film development are dealt with in aninformative and entertaining manner.

Features:

• 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

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, andMicroimaging

Imaging the Invisible

Appendix 1: Logarithms: What They Are,What They Do

Appendix 2: How a Hologram Works

Appendix 3: The Fourier Model for ImageFormation

Appendix 4: The Meaning of pH


19



An IntegratedIntroduction to ComputerGraphics andGeometric ModelingRonald GoldmanRice University, Houston, Texas,USA

"… may be the first book on geometric modelingthat also covers computer graphics. … integrates athorough introduction to ‘freedom’ curves and sur-faces and to the mathematical foundations for com-puter graphics. … very well presented … It certain-ly is a textbook I would recommend."

—Computer-Aided Design, 42, 2010

"Dr. Goldman has dedicated the past 20 years of hiscareer to teaching and research as a professor ofcomputer science … He is an excellent mentor ofstudents and I am pleased that his reach will beextended through the publication of this book."

—Thomas W. Sederberg, Brigham Young University

This book presents an easy-to-read introduction tocomputer graphics and geometric modeling.Emphasizing high-level algorithms, it focuses onstandard graphics, modeling, and mathematicalmethods, including ray tracing, polygon shading,radiosity, fractals, freeform curves and surfaces, vec-tor methods, and transformation techniques. Theauthor begins with fractals first rather than typicalline drawing algorithms and also brings back theturtle from obscurity to introduce several majorconcepts in computer graphics. • Delineates vector methods, mass points, affineand projective maps, and blossoming

• Emphasizes high-level algorithms, including keycurve/surface spline creation and manipulationalgorithms

• Uses an innovative approach by presenting turtles and fractals first

• Provides formulas for transformations aboutplanes and axes in arbitrary positions

• Includes many exercises and programming projects

PowerPoint® slides are available on the book’s web-site upon course adoption.

Catalog no. K10188, January 2010, 574 pp.ISBN: 978-1-4398-0334-9, $89.95

Digital ImageProcessingAn AlgorithmicApproach with MATLABUvais QidwaiQatar University, Doha

C.H. ChenUniversity 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 under-standing of digital image processing. It containseasy explanations of theoretical concepts, avoid-ing heavy mathematics wherever possible. Theauthors provide MATLAB® codes that allow stu-dents to generate the same images found in thebook and present the algorithms as simple flow-charts that can be coded in any programmingenvironment. They include algorithmic accountsof the techniques, describe practical examples andpotential applications, and cover both standardand advanced topics, such as face recognition andsoft computing. Lecture slides, MATLAB codes,and other resources are available on the author’swebsite.

Features:

• Contains easy explanations of theoretical con-cepts, avoiding heavy mathematics whereverpossible

• Provides MATLAB codes that allow students togenerate 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 thatcan be coded in any programming environ-ment

• Includes algorithmic accounts of the tech-niques

• Describes practical examples and potentialapplications

Lecture slides, MATLAB code, and other resourcesare available upon course adoption on the author’swebsite.




Bestseller!

Machine LearningAn Algorithmic PerspectiveStephen MarslandMassey University, Palmerston North, New Zealand


"If you are interested in learning enough AI tounderstand the sort of new techniques being intro-duced into Web 2 applications, then this is a goodplace to start. … it covers the subject matter ofmany an introductory course on AI and it has refer-ences to the source material … . Overall it worksand much of the mathematics is explained in waysthat make it fairly clear what is going on … . a suit-able introduction to AI if you are studying the sub-ject on your own … a good course text for an intro-duction and overview of AI."

—I-Programmer, November 2009

Written in an easily accessible style, this bestsellingtext provides the ideal blend of theory and practi-cal, applicable knowledge. It covers neural net-works, graphical models, reinforcement learning,evolutionary algorithms, dimensionality reductionmethods, and the important area of optimization. Ittreads the fine line between adequate academicrigor and overwhelming students with equationsand mathematical concepts. The author includesexamples based on widely available datasets andpractical and theoretical problems to test under-standing and application of the material. The bookdescribes algorithms with code examples backedup by a website that provides working implemen-tations in Python.

Features:

• Provides a clear introduction to the basic con-cepts of machine learning

• Focuses on algorithms used in machine learn-ing, and how and why they work

• Presents real-world problems through structuredexercises and programming examples

• Includes a primer on the use of Python fornumerical computing

• Includes actual programming examples, ratherthan pseudocode

Online access to codes, examples, and solutions isavailable upon qualified course adoption.

Contents (abridged):

IntroductionIf Data Had Mass, The Earth Would Be a BlackHole. Learning. Types of Machine Learning.Supervised Learning. The Brain and the Neuron. Linear DiscriminantsPreliminaries. The Perceptron. Linear Separability.Linear Regression. The Multi-Layer PerceptronGoing Forwards. Going Backwards: Back-propaga-tion of Error. The Multi-Layer Perceptron inPractice. Examples of Using the MLP. Overview.Back-propagation Properly. Radial Basis Functions and SplinesConcepts. The Radial Basis Function (RBF)Network. The Curse of Dimensionality.Interpolation and Basis Functions. Support Vector MachinesOptimal Separation. Kernels. Learning With TreesUsing Decision Trees. Constructing Decision Trees.Classification And Regression Trees. ClassificationExample. Decision by Committee: Ensemble LearningBoosting. Bagging. Different Ways to CombineClassifiers. Probability and LearningTurning Data into Probabilities. Some BasicStatistics. Gaussian Mixture Models. NearestNeighbour Methods. Unsupervised LearningThe k-Means Algorithm. Vector Quantisation. TheSelf-Organising Feature Map. Dimensionality ReductionLinear Discriminant Analysis. PrincipalComponents Analysis. Factor Analysis.Independent Components Analysis. Locally LinearEmbedding. Isomap.Optimisation and SearchGoing Downhill. Least-Squares Optimisation.Conjugate Gradients. Search: Three BasicApproaches. Exploitation and Exploration.Simulated Annealing. ...


Machine Learning


21

Machine Learning


Foundations of Semantic Web TechnologiesPascal HitzlerKno.e.sis Center at Wright State University, Dayton, Ohio, USA

Markus Kroetzsch and Sebastian RudolphUniversity of Karlsruhe, Karlsruhe, Germany


"This book is unique in several respects. It con-tains an in-depth treatment of all the majorfoundational languages for the Semantic Weband provides a full treatment of the underlyingformal semantics … easily accessible for thereader … I am confident this book will be wellreceived and play an important role in traininga larger number of students who will seek tobecome proficient in this growing discipline."

—Amit Sheth, Wright State University, Dayton,Ohio, USA

Thoroughly covering basic introductions andintuitions, technical details, and formal founda-tions, this text focuses on the established foun-dations in this area that have become relative-ly stable over time. It presents the latest devel-opments in Semantic Web standards, includingRDF, RDF Schema, OWL 2, RIF, and SPARQL. Italso explores formal semantics, OWL querying,the relationship between rules and OWL, andontology engineering and applications. Theauthors include many exercises with solutionsin the back of the book.

Features:

• Presents the latest developments inSemantic Web standards, covering RDF,RDF Schema, OWL 2, RIF, and SPARQL

• Provides a thorough treatment of formalsemantics, including proof theory

• Explores OWL querying, the relationshipbetween rules and OWL, and ontologyengineering and applications

• Separates syntax and language from in-depth treatments of the formal foundations

• Facilitates self-study with appendices onpreliminary background knowledge

Updates, slides for teaching, and links to furtherresources are available on the book’s websiteupon course adoption.

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 SpecialData Structures. An Example.RDF Formal Semantics Why Semantics? Model-Theoretic Semantics for RDF(S).Syntactic Reasoning with Deduction Rules. The SemanticLimits of RDF(S).WEB ONTOLOGY LANGUAGE (OWL) Ontologies in OWL OWL Syntax and Intuitive Semantics. OWL Species. TheForthcoming 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 InterchangeFormat (RIF). Query Languages SPARQL: Query Language for RDF. Conjunctive Queriesfor OWL DL.BEYOND FOUNDATIONSOntology Engineering Requirement Analysis. Ontology Creation: Where Is YourKnowledge? Quality Assurance of Ontologies. ModularOntologies: 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 forStandardizations. RIF Applications. Toward FutureApplications.APPENDICESExtensible Markup Language (XML). Set Theory. Logic.Solutions to the Exercises. References.

A Summary, Exercises, and Further Reading appear at theend of most chapters


MBTCOSC TMC

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

CRC Press / Taylor & Francis Group6000 Broken Sound Parkway, NW, Suite 300 • Boca Raton, FL 33487

TEL: 800-272-7737 • FAX 800-643-9428Florida and outside the continental U.S.: TEL: 561-994-0555 • FAX: 561-361-6018

Mail or Fax to:

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. ____________________________________________

Active and Agile Project-Oriented Learning

Catalog no. C3622, May 2010, 527 pp.ISBN: 978-1-4200-9362-9, $69.95

“…a careful selection oftopics that are relevant,indeed crucial, for devel-oping good quality soft-ware … leads the readerthrough an experience ofactive learning.

—Michael Kölling,Bestselling author and

originator of the BlueJ andGreenfoot Environments

Henrik B. ChristensenUniversity of Aarhus, Denmark

• Presents 15 provendesign patterns as well as the principlesbehind them

• Includes numerousexercises, review questions, and twoelaborate projects tohelp students developthe skills needed todesign and implementsuccessful frameworks

• Provides access toinstallation guides,source code for the examples, andadditional resources on the author’s website

Detailing the core concepts, practices, andtools of software design, including test-driv-en development, Flexible, ReliableSoftware: Using Patterns and AgileDevelopment walks students through thesoftware development process with practi-cal stories and projects that illustrate theprogramming process in detail.

NEW!


Pre

so

rted

Sta

nd

ard

US

Po

sta

ge

PA

IDP

erm

it 3

82

So

uth

Ho

llan

d I

L

Pag

e 6

Fo

r a c

om

ple

te li

st

of

Co

mp

ute

r Scie

nce t

itle

s p

lease

visit w

ww

.crc

textb

oo

ks.c

om

Pag

e 9

Pag

e 1

3

6000 Broken Sound Parkway, N

W, Suite 300

Boca Raton, FL 33487, USA

Requ

est y

our c

ompl

imen

tary

revi

ew c

opy

toda

y

Cutt

ing-

Edge

Tex

tboo

ks a

nd P

ract

ical

Tea

chin

g To

ols

ww

w.c

rcte

xtbo

oks.

com




computer science textbooks - august 2010

Documents

computer sciencejohn

showhow computer scientists

wordsan introduction

general introduction

computingan introduction

computer sciencefor

lab manual

complete contents