For Freshman or Introductory courses in Engineering and Computer Science. ESource Prentice Hall's Engineering Source provides a comprehensive, customizable introductory engineering and computing library. Featuring over 25 modules and growing, ESource allows professors to fully customize their textbooks through the ESource website. Professors are not only able to pick and choose complete modules, but also custom-build a freshman engineering text that matches their content needs and course organization exactly! Using the ESource online BookBuild system at www.prenhall.com/esource, they can view and select book chapters, change the sequence, instantly calculate the book's net (bookstore) price, request a free examination copy, and generate an ISBN for placing a bookstore order. They can also add your own course notes, syllabi, reference charts, or other favorite materials, including material from third-party publishers. ESource Access Card: 0-13-090400-7. Include this ISBN when setting up an ESource Bundle.

The fully revised edition of this best-selling title presents the modern computer algebra system Maple. It teaches the reader not only what can be done by Maple, but also how and why it can be done. The book provides the necessary background for those who want the most of Maple or want to extend its built-in knowledge, containing both elementary and more sophisticated examples as well as many exercises.

This is a fully revised edition of the best-selling Introduction to Maple. The book presents the modern computer algebra system Maple, teaching the reader not only what can be done by Maple, but also how and why it can be done. The book also provides the necessary background for those who want the most of Maple or want to extend its built-in knowledge. Emphasis is on understanding the Maple system more than on factual knowledge of built-in possibilities. To this end, the book contains both elementary and more sophisticated examples as well as many exercises. The typical reader should have a background in mathematics at the intermediate level. Andre Heck began developing and teaching Maple courses at the University of Nijmegen in 1987. In 1989 he was appointed managing director of the CAN Expertise Center in Amsterdam. CAN, Computer Algebra in the Netherlands, stimulates and coordinates the use of computer algebra in education and research. In 1996 the CAN Expertise Center was integrated into the Faculty of Science at the University of Amsterdam, into what became the AMSTEL Institute. The institute program focuses on the innovation of computer activities in mathematics and science education on all levels of education. The author is actively involved in the research and development aimed at the integrated computer learning environment Coach for mathematics and science education at secondary school level.

Scientific computing is the study of how to use computers effectively to solve problems that arise from the mathematical modeling of phenomena in science and engineering. It is based on mathematics, numerical and symbolic/algebraic computations and visualization. This book serves as an introduction to both the theory and practice of scientific computing, with each chapter presenting the basic algorithms that serve as the workhorses of many scientific codes; we explain both the theory behind these algorithms and how they must be implemented in order to work reliably in finite-precision arithmetic. The book includes many programs written in Matlab and Maple – Maple is often used to derive numerical algorithms, whereas Matlab is used to implement them. The theory is developed in such a way that students can learn by themselves as they work through the text. Each chapter contains numerous examples and problems to help readers understand the material “hands-on”.

This book explains the key features of Maple, with a focus on showing how things work, and how to avoid common problems.

This introduction to cryptography employs a programming-oriented approach to study the most important cryptographic schemes in current use and the main cryptanalytic attacks against them. Discussion of the theoretical aspects, emphasizing precise security definitions based on methodological tools such as complexity and randomness, and of the mathematical aspects, with emphasis on number-theoretic algorithms and their applications to cryptography and cryptanalysis, is integrated with the programming approach, thus providing implementations of the algorithms and schemes as well as examples of realistic size. A distinctive feature of the author's approach is the use of Maple as a programming environment in which not just the cryptographic primitives but also the most important cryptographic schemes are implemented following the recommendations of standards bodies such as NIST, with many of the known cryptanalytic attacks implemented as well. The purpose of the Maple implementations is to let the reader experiment and learn, and for this reason the author includes numerous examples. The book discusses important recent subjects such as homomorphic encryption, identity-based cryptography and elliptic curve cryptography. The algorithms and schemes which are treated in detail and implemented in Maple include AES and modes of operation, CMAC, GCM/GMAC, SHA-256, HMAC, RSA, Rabin, Elgamal, Paillier, Cocks IBE, DSA and ECDSA. In addition, some recently introduced schemes enjoying strong security properties, such as RSA-OAEP, Rabin-SAEP, Cramer--Shoup, and PSS, are also discussed and implemented. On the cryptanalysis side, Maple implementations and examples are used to discuss many important algorithms, including birthday and man-in-the-middle attacks, integer factorization algorithms such as Pollard's rho and the quadratic sieve, and discrete log algorithms such as baby-step giant-step, Pollard's rho, Pohlig--Hellman and the index calculus method. This textbook is suitable for advanced undergraduate and graduate students of computer science, engineering and mathematics, satisfying the requirements of various types of courses: a basic introductory course; a theoretically oriented course whose focus is on the precise definition of security concepts and on cryptographic schemes with reductionist security proofs; a practice-oriented course requiring little mathematical background and with an emphasis on applications; or a mathematically advanced course addressed to students with a stronger mathematical background. The main prerequisite is a basic knowledge of linear algebra and elementary calculus, and while some knowledge of probability and abstract algebra would be helpful, it is not essential because the book includes the necessary background from these subjects and, furthermore, explores the number-theoretic material in detail. The book is also a comprehensive reference and is suitable for self-study by practitioners and programmers.

This text presents mathematical biology as a field with a unity of its own, rather than only the intrusion of one science into another. The book focuses on problems of contemporary interest, such as cancer, genetics, and the rapidly growing field of genomics.