Differential Diagnosis and Management for the Chiropractor, Third Edition: Protocols and Algorithms

Book Description

The third edition of this best selling reference maintains its goal of helping the practitioner evaluate a patient's complaint in the contest of a chiropractor's scope of practice

Average customer rating:

slightly better than corman
great text
One of the better introduction algorithm books
Truly great book on algorithm design
Extremely Wordy

Algorithm Design
Jon Kleinberg , and Éva Tardos
Manufacturer: Addison Wesley
ProductGroup: Book
Binding: Hardcover

General | Programming | Computers & Internet | Subjects | Books

General | Software | Computers & Internet | Subjects | Books

Look Inside Computer Books | Trip | Specialty Stores | Books

All Titles | Qualifying Textbooks - Fall 2007 | Stores | Books

Computers & Internet | Qualifying Textbooks - Fall 2007 | Stores | Books
Similar Items:

ASIN: 0321295358

Book Description

Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science.

Customer Reviews:

slightly better than corman.......2007-06-11

best undergraduate handbook about algorithms i've seen so far.
examples are much less artificial than in cormen (introduction to algorithms)

great text.......2007-05-28

This is a great text as it teaches you the major techniques for designing efficient algortihms and how to solve real-life problems using algorithms rather than just presenting polished but inscrutable solutions to abstract problems

One of the better introduction algorithm books.......2006-12-10

With algorithms not a strength of mine (although I am a computer scientist student), I was quite happy that our professor switched to this book away from the MIT Press book. The first few chapters were exactly what I needed in order to finally get a grasp of key algorithm analysis and design concepts. As the book progressed to more difficult chapters, their explanations became less and less clear and seemed to rely more on text than on nice diagrams and graphics. A few complaints I have about the book: no mention of the Master Method in the dynamic programming chapter, NP-Complete explanation confusing, and no published errata that I could find. Although I have a few complaints about the book, it is one of the better books for being introduced to algorithms. It needs a little tuning now and then as some explanations are not so clear, but you'll find even more complicated explinations in other algorithm books.

Truly great book on algorithm design.......2006-03-18

I use this book in a course and I am immensely pleased with it. I must point out, though, that this is a very theoretical book. There is not much code and the authors use rather high-level psuedo code for what's there. However, it is great at explaining concepts and what the generic algorithms actually do. So it does its job quite brilliantly. If you need more code, you might want to pick up the Sedewick books, although the code could be better commented and organized if you asked me.

Extremely Wordy.......2005-09-15

This book is not concise; also the pseudocode syntax used in the book is annoying.

If you enjoy reading for the sake of reading then you might enjoy this book.There are better books out there by Knuth, Corman and Aho that cover the same topics as this one.

Average customer rating:

Excellent buy
Confusing to say the least
Fantastic algorithms book
Good Reference, Poor Textbook
Too much and too little

Introduction to Algorithms
Thomas H. Cormen , Charles E. Leiserson , Ronald L. Rivest , and Clifford Stein
Manufacturer: The MIT Press
ProductGroup: Book
Binding: Hardcover

General | Programming | Computers & Internet | Subjects | Books

General | Computers & Internet | Subjects | Books

General | Operating Systems | Computers & Internet | Subjects | Books

General | Mathematics | Science | Subjects | Books

Look Inside Computer Books | Trip | Specialty Stores | Books

Look Inside Science Books | Trip | Specialty Stores | Books

All Titles | Qualifying Textbooks - Fall 2007 | Stores | Books

Computers & Internet | Qualifying Textbooks - Fall 2007 | Stores | Books

Professional | Qualifying Textbooks - Fall 2007 | Stores | Books

Science | Qualifying Textbooks - Fall 2007 | Stores | Books
Similar Items:

ASIN: 0262032937

Amazon.com

Aimed at any serious programmer or computer science student, the new second edition of Introduction to Algorithms builds on the tradition of the original with a truly magisterial guide to the world of algorithms. Clearly presented, mathematically rigorous, and yet approachable even for the math-averse, this title sets a high standard for a textbook and reference to the best algorithms for solving a wide range of computing problems.

With sample problems and mathematical proofs demonstrating the correctness of each algorithm, this book is ideal as a textbook for classroom study, but its reach doesn't end there. The authors do a fine job of explaining each algorithm. (Reference sections on basic mathematical notation will help readers bridge the gap, but it will help to have some math background to appreciate the full achievement of this handsome hardcover volume.) Every algorithm is presented in pseudo-code, which can be implemented in any computer language, including C/C++ and Java. This ecumenical approach is one of the book's strengths. When it comes to sorting and common data structures, from basic linked lists to trees (including binary trees, red-black, and B-trees), this title really shines, with clear diagrams that show algorithms in operation. Even if you just glance over the mathematical notation here, you can definitely benefit from this text in other ways.

The book moves forward with more advanced algorithms that implement strategies for solving more complicated problems (including dynamic programming techniques, greedy algorithms, and amortized analysis). Algorithms for graphing problems (used in such real-world business problems as optimizing flight schedules or flow through pipelines) come next. In each case, the authors provide the best from current research in each topic, along with sample solutions.

This text closes with a grab bag of useful algorithms including matrix operations and linear programming, evaluating polynomials, and the well-known Fast Fourier Transformation (FFT) (useful in signal processing and engineering). Final sections on "NP-complete" problems, like the well-known traveling salesman problem, show off that while not all problems have a demonstrably final and best answer, algorithms that generate acceptable approximate solutions can still be used to generate useful, real-world answers.

Throughout this text, the authors anchor their discussion of algorithms with current examples drawn from molecular biology (like the Human Genome Project), business, and engineering. Each section ends with short discussions of related historical material, often discussing original research in each area of algorithms. On the whole, they argue successfully that algorithms are a "technology" just like hardware and software that can be used to write better software that does more, with better performance. Along with classic books on algorithms (like Donald Knuth's three-volume set, The Art of Computer Programming), this title sets a new standard for compiling the best research in algorithms. For any experienced developer, regardless of their chosen language, this text deserves a close look for extending the range and performance of real-world software. --Richard Dragan

Topics covered: Overview of algorithms (including algorithms as a technology); designing and analyzing algorithms; asymptotic notation; recurrences and recursion; probabilistic analysis and randomized algorithms; heapsort algorithms; priority queues; quicksort algorithms; linear time sorting (including radix and bucket sort); medians and order statistics (including minimum and maximum); introduction to data structures (stacks, queues, linked lists, and rooted trees); hash tables (including hash functions); binary search trees; red-black trees; augmenting data structures for custom applications; dynamic programming explained (including assembly-line scheduling, matrix-chain multiplication, and optimal binary search trees); greedy algorithms (including Huffman codes and task-scheduling problems); amortized analysis (the accounting and potential methods); advanced data structures (including B-trees, binomial and Fibonacci heaps, representing disjoint sets in data structures); graph algorithms (representing graphs, minimum spanning trees, single-source shortest paths, all-pairs shortest paths, and maximum flow algorithms); sorting networks; matrix operations; linear programming (standard and slack forms); polynomials and the Fast Fourier Transformation (FFT); number theoretic algorithms (including greatest common divisor, modular arithmetic, the Chinese remainder theorem, RSA public-key encryption, primality testing, integer factorization); string matching; computational geometry (including finding the convex hull); NP-completeness (including sample real-world NP-complete problems and their insolvability); approximation algorithms for NP-complete problems (including the traveling salesman problem); reference sections for summations and other mathematical notation, sets, relations, functions, graphs and trees, as well as counting and probability backgrounder (plus geometric and binomial distributions).

Book Description

There are books on algorithms that are rigorous but incomplete and others that cover masses of material but lack rigor. Introduction to Algorithms combines rigor and comprehensiveness.

The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.

The first edition became the standard reference for professionals and a widely used text in universities worldwide. The second edition features new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming, as well as extensive revisions to virtually every section of the book. In a subtle but important change, loop invariants are introduced early and used throughout the text to prove algorithm correctness. Without changing the mathematical and analytic focus, the authors have moved much of the mathematical foundations material from Part I to an appendix and have included additional motivational material at the beginning.

Customer Reviews:

Excellent buy.......2007-09-24

I bought a new copy of the book, and was happy to receive it the way I expected. Got free shipping with this one.

Confusing to say the least.......2007-09-14

This book does not provide enough examples to really get the ideas across. It is a thick read that provides little help to the subject matter unless the reader already has a wealth of knowledge on mathematical proofs and algorithms to begin with.

If the book had a solution manual, or at least explained many of the things that occur in the problem sections that never show up in the actual reading, then it would be a much easier to understand textbook.

Fantastic algorithms book.......2007-06-03

This is one of the few books that I've kept from my undergrad days as a computer science major. Although I haven't been doing software development in a while, I still use it for reference once in a while. It's easy to understand and timeless reference book. I work for a large DoD company and quite a few of my co-workers have this book on their shelves as well. (We all went to different colleges.)

Good Reference, Poor Textbook.......2007-04-19

This is a good reference for researchers, but it is not suitable for beginners. For anyone who try to study algorithms in the beginning, he just needs the big picture of this course, but this book contains too many mathematical proofs. In other words, the beginners just want a cup of milk, but the authors of this book give them a whole cow.

Although this book is quite huge, it does not contain some important topics, like online algorithms, randomized algorithms ... etc. In fact, this book should try to 'lose its weight' in order to get more useful knowledge.

The book contains a lot of interesting exercises, but does not indicate any hints or solutions. In fact, some of those exercises are too hard for students, and the authors should try to announce all sloutions in the website.

Too much and too little.......2007-03-02

+ Defacto standard
+ Accompanying WebCourse

- Too deep if used as an intro book; lacks solutions if used for a reference book
- It's HUGE!; hard to carry around

= Tries to appease too wide an audience. Definately attractive to professors who already know the information and feel this is THE book yet probably too deep for an intro algorithms class. Wish there was a searchable pdf version that came with the book on a CD as well as odd numbered solutions.

Applied Cryptography: Protocols, Algorithms, and Source Code in C, Second Edition

Average customer rating:

Dated but indespensible
The unique and original applied cryptography book!
Easy to read, perfect level of detail.
Excellent Introduction
A must-have book for understanding Cryptography.

Applied Cryptography: Protocols, Algorithms, and Source Code in C, Second Edition
Bruce Schneier
Manufacturer: Wiley
ProductGroup: Book
Binding: Paperback

General | Programming | Computers & Internet | Subjects | Books

General | Computers & Internet | Subjects | Books

General | Software | Computers & Internet | Subjects | Books

Look Inside Computer Books | Trip | Specialty Stores | Books

Look Inside Science Books | Trip | Specialty Stores | Books

All Deals | Blowout Books | Stores | Books

Computers & Internet | Blowout Books | Stores | Books

Science | Blowout Books | Stores | Books

All Amazon Upgrade | Amazon Upgrade | Stores | Books

Computers & Internet | Amazon Upgrade | Stores | Books

Professional & Technical | Amazon Upgrade | Stores | Books

Science | Amazon Upgrade | Stores | Books

All Titles | Qualifying Textbooks - Fall 2007 | Stores | Books

Computers & Internet | Qualifying Textbooks - Fall 2007 | Stores | Books

Professional | Qualifying Textbooks - Fall 2007 | Stores | Books

Science | Qualifying Textbooks - Fall 2007 | Stores | Books
Similar Items:

ASIN: 0471117099

Amazon.com

Cryptographic techniques have applications far beyond the obvious uses of encoding and decoding information. For Internet developers who need to know about capabilities, such as digital signatures, that depend on cryptographic techniques, there's no better overview than Applied Cryptography, the definitive book on the subject. Bruce Schneier covers general classes of cryptographic protocols and then specific techniques, detailing the inner workings of real-world cryptographic algorithms including the Data Encryption Standard and RSA public-key cryptosystems. The book includes source-code listings and extensive advice on the practical aspects of cryptography implementation, such as the importance of generating truly random numbers and of keeping keys secure.

Book Description

". . .the best introduction to cryptography I've ever seen. . . . The book the National Security Agency wanted never to be published. . . ." -Wired Magazine

". . .monumental . . . fascinating . . . comprehensive . . . the definitive work on cryptography for computer programmers . . ." -Dr. Dobb's Journal

". . .easily ranks as one of the most authoritative in its field." -PC Magazine

". . .the bible of code hackers." -The Millennium Whole Earth Catalog

This new edition of the cryptography classic provides you with a comprehensive survey of modern cryptography. The book details how programmers and electronic communications professionals can use cryptography-the technique of enciphering and deciphering messages-to maintain the privacy of computer data. It describes dozens of cryptography algorithms, gives practical advice on how to implement them into cryptographic software, and shows how they can be used to solve security problems. Covering the latest developments in practical cryptographic techniques, this new edition shows programmers who design computer applications, networks, and storage systems how they can build security into their software and systems.

What's new in the Second Edition?
* New information on the Clipper Chip, including ways to defeat the key escrow mechanism
* New encryption algorithms, including algorithms from the former Soviet Union and South Africa, and the RC4 stream cipher
* The latest protocols for digital signatures, authentication, secure elections, digital cash, and more
* More detailed information on key management and cryptographic implementations

Customer Reviews:

Dated but indespensible.......2007-08-02

Sadly, this book is more than a few years old. That said, it is still the finest single volume introduction to data security in the modern age. For clarity of description, for illustration, and for its success at communicating essential concepts and ideas without resorting entirely to mathematics, it is without peer.

Every so often I look on Amazon and hope that I'll find Schneier has penned a third edition, updating this work with the results of the AES selection process and all the other recent developments in this suddenly fast paced field. Alas, I don't think that's going to happen. But I'm not sure that it would really make any difference -- the field now evolves so swiftly that any detailed, thorough volume would be obsolete by the time it reaches the shelves.

So instead of looking for something more recent, pick up Applied Cryptography. Read it and keep it close at hand as a reference (mine is almost falling apart from years of loving use). Nothing presents the fundamentals as well. If you need to know about a new cipher, a new hash, a new encryption mode or protocol, that's what the Internet is for.

But to really understand the underlying ideas, techniques, challenges, risks, and rewards of cryptography, nothing finer exists.

The unique and original applied cryptography book!.......2007-06-27

This book is extremely complete. It briefly covers the history of cryptography. It describes the political implications of cryptography and finally it shows how cryptography can be used in applications and presents the different cryptographic algorithms.

The algorithm section starts with a number theory primer.Honestly, I have found it a little bit too thin to learn all the needed background to fully understand the algorithms but on the other side, you cannot expect a simple 600 pages book to provide that background in the latest mathematical research number theories. It has at least the merit that it did stimulate my curiosity about number theory when I have read the first edition of this book.

Another point that makes this book interesting is that at the end of each chapter presenting the various algorithms in a given category, you will get Bruce Schneier opinion on which algorithm is the best. Of course, this type of information usually become outdated real fast but it is interesting to follow his thought process and test his predictions as the book grow older.

So, if you are looking for your first cryptography book, it should be this one.

Easy to read, perfect level of detail........2007-06-07

Great Book! The author's style makes this very easy to follow, and he frequently clarifies on topics which are difficult to grasp. Most importantly, he writes from a practical point of view; the material is very grounded and applicable instead of being a math textbook. That being said, he cites over 1600 sources; the book is riddled with leads to sources with more complete coverage for those interested in the fine details. Though I have some programming experience, I don't intend to write any programs; but it is interesting to read the logic in code. It was my goal to learn about modern cryptography and I have achieved that and much more.

Excellent Introduction.......2007-03-12

This book is now in the thirteenth reprinting of it's second edition with more than a hundred thousand copies sold. It is the definitive book on cryptography from the standpoint of a general overview of what sending secret messages is all about. It is not specifically oriented to the developer, but is more general in nature. There is not enough here for the mathematically inclined to seriously research the background of all the various systems.

As such consider this to be an introductory book on cryptography in general with a bit of history, a bit of story telling, an analysis of various cryptographic protocols and systems. There is source code provided for nine common protocols, and an invitation to order a three disk system that has source code for several more algorithms, functions, systems and additional text on various subjects. This disk set can only be sent to US and Canada addresses because of export rules on cryptographic information.

This is the definitive book on the subject. The only complaint I have is that it could stand to be done over in a third edition that would bring it more up to date.

A must-have book for understanding Cryptography........2006-03-11

This book has really shed a lot of light on cryptography for me. I honestly can't put it down--I wish I had paid more attention in my statistics classes so I could be able to apply some of the stuff the author talks about better. I am about half way through the book, and I haven't gotten to the point where it's more of a chore than a pleasure to read it (something I can't about my other technical books).
Glancing through the C source code at the end of the book started me thinking on the code implementation in my efforts - although I used Java althrough my life. I am not much comfortable with the C code because I was hoping for more goodie examples. If you want some practical guidance..you may little bit uncomforatble as well. At the end of the day if you are serious about Cryptography then you really need to get a copy of this.

Probability and Computing: Randomized Algorithms and Probabilistic Analysis

Average customer rating:

Advanced probability topics without measure theory
Just unnecessary
Another poorly written text book
Good Introductory Textbook

Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Michael Mitzenmacher , and Eli Upfal
Manufacturer: Cambridge University Press
ProductGroup: Book
Binding: Hardcover

General | Computers & Internet | Subjects | Books

General | Science | Subjects | Books

General | Mathematics | Science | Subjects | Books

Mathematical Analysis | Mathematics | Science | Subjects | Books

Look Inside Computer Books | Trip | Specialty Stores | Books

Look Inside Science Books | Trip | Specialty Stores | Books

All Deals | Blowout Books | Stores | Books

Computers & Internet | Blowout Books | Stores | Books

Science | Blowout Books | Stores | Books

All Titles | Qualifying Textbooks - Fall 2007 | Stores | Books

Computers & Internet | Qualifying Textbooks - Fall 2007 | Stores | Books

Professional | Qualifying Textbooks - Fall 2007 | Stores | Books

Science | Qualifying Textbooks - Fall 2007 | Stores | Books
Similar Items:

ASIN: 0521835402

Book Description

Assuming only an elementary background in discrete mathematics, this textbook is an excellent introduction to the probabilistic techniques and paradigms used in the development of probabilistic algorithms and analyses. It includes random sampling, expectations, Markov's and Chevyshev's inequalities, Chernoff bounds, balls and bins models, the probabilistic method, Markov chains, MCMC, martingales, entropy, and other topics. The book is designed to accompany a one- or two-semester course for graduate students in computer science and applied mathematics.

Customer Reviews:

Advanced probability topics without measure theory.......2007-08-18

This book is underestimated by two reviewers below. I totally do not agree with them. This book covers a wide range of topics in a very readable style. The contents in this book is complementary to the book of Motwani and Raghavan (but this book is much easier to digest).

It, without requiring any knowledge on measure theory, contains excellent introductions to many difficult topics in probability including

- concentration bounds (Chernoff, Azuma-Hoeffding, etc.)
- applications of stochastic processes such as queuing theory
- martingale (Wald's equation)
- coupling of Markov chains and their mixing times
- Shannon's source coding and noisy channel theorems
- Erdos' probabilistic method
- etc.

All of these topics are provided with excellent applications in computing.
The authors illustrate many clever tricks for proving theorems, and these tricks give insights to the readers as well.

Just unnecessary.......2007-05-17

This book, while written by two renowned computer scientists, is truly disappointing. In trying to discuss randomness and computation, this book just does a mediocre job on discussing randomized computation and also an equally poor job discussing relevant aspects of probability theory. Their approach is not novel and many of their examples can be found in other texts. If you really want to learn randomized computation, get Motwani et al's book on Randomized Algorithms. If you want to learn probability theory, get any advanced probability theory book like Spencer and Alon on the probabilistic method, one of Sheldon Ross's books, or even Grimmett and Stirzaker. Whatever you do don't get this weak hybrid of a book that will require you to get another book at some point to supplement your understanding.

Another poorly written text book.......2006-03-19

The authors must be smart guys. They obviously understand alot about this subject but make the mistake that you do too! As a result, the book is inadequate as a teaching tool.

They use only half to a third of the narrative they need to adequately explain a subject. They also like to leave out proof steps or not explain them. The problems at the end of chapters are poor as well, since the authors seem to have forgotten to teach the techniques needed to solve most them in the chapter they belong to.

I am sure to them it is intuitive.

Good Introductory Textbook.......2005-03-16

It's pretty easy to get computers to do things where the answer is yes or no, or 4 or 6, given that the inputs to the problem are known. It's much harder to get an answer to a problem where the answer is that their is a 62% chance that the answer is yes. Unfortunately, in real life it's this second class of problems that predominates.

This book is oriented to solving these kinds of real world problems. The exercises in the book are chosen from real world examples -- what we used to call story problems. This tends to give the student a better understanding of not only the mathematics and programming involved but experience in looking at problems with a view to understanding this approach to solving the problem.

This book is suitable for a one or two semester introductory class at the upper undergraduate or beginning graduate level.

Just a word about the illustration on the front of the book. At the end of the book Alice in Wonderland the queen is about to order Alice beheaded. Alice says, "You're nothing but a pack of cards." At this, the whole pack rose up into the air and came flying down around her. This illustration is by John Tenniel from the original book of 1899. A deck of flying playing cards is a good way to illustrate random and probability.

Fundamentals of Astrodynamics and Applications, 2nd. ed. (The Space Technology Library)

Average customer rating:

excellent book
One of the most widely cited texts in the field - for a reason
Aerospace Engineering Student
New and Improved 2nd Edition

Fundamentals of Astrodynamics and Applications, 2nd. ed. (The Space Technology Library)
David A Vallado
Manufacturer: Microcosm, Inc
ProductGroup: Book
Binding: Paperback

Aeronautics & Astronautics | Astronomy | Science | Subjects | Books

Look Inside Science Books | Trip | Specialty Stores | Books

All Titles | Qualifying Textbooks - Fall 2007 | Stores | Books

Science | Qualifying Textbooks - Fall 2007 | Stores | Books
Similar Items:

ASIN: 1881883124

Book Description

The second edition features several exciting changes to this exceptional book. 30 pages longer than the original, there are ground illumination calculations, Moon rise and set data, a listing of relevant Internet sites. Moreover there are improved and expanded discussions of coordinate systems, orbit determination and differential correction, along with FREE Software available in Fortran, Pascal and C!

Summary

The increased power of microcomputers has changed the study of perturbations perhaps more than any other subfield of astrodynamics, but students and practitioners still need a compendium of well-documented algorithms to use that power. Vallado's book is just such a compendium, integrating two-body dynamics with perturbation methods and real-world applications while consolidating recent literature about coordinates and fundamental concepts. It attempts to use new programming capabilities to exploit the keys for the future-- standardizing, documenting, modularity, efficiency, and maintainability.

Ample algorithms, numbered and handily summarized at the beginning of the book, and extensive derivations have been included to save time often spent recreating something that has already been proven. The author cites many references and alternative methods to expand understanding of the topics discussed

Customer Reviews:

excellent book.......2006-06-02

This book is really excellent book among all books about astrodynamics, they give us the details about how to solve problems step by step. i like Algorithm part.

One of the most widely cited texts in the field - for a reason.......2006-05-10

This is one of the most thorough, well-written, accessible texts on astrodynamics that I've seen. The coverage of spherical harmonics (zonal, sectorial and tesseral) in Chapter 8 is very well done and welcomed. Beginners (or those who need a refresher) will also appreciate the very accessible coverage of Kalman filtering in Chapter 10.

The text provides 70 algorithms in addition to the wealth of mathematical derivations throughout the text.

The publisher's web site does not provide the updated table of contents for the 2nd Edition (as of 9 May 2006). I have provided this below. I wish that I had the time to provide the section headings within each chapter. However, if you are familiar with the subject area, you will be able to see from the chapter titles that this text is quite thorough.

Loaded with well-executed illustrations and clear, descriptive text, I doubt that anything in this text will leave you with questions or confusion. You can't go wrong with purchasing this text.

Table of Contents for 2nd Edition

1. Equations of Motion
2. Kepler's Equation and Kepler's Problem
3. Coordinate and Time Systems
4. Observations
5. Celestial Phenomena
6. Orbital Maneuvering
7. Initial Orbit Determination
8. Special Perturbation Techniques
9. General Perturbation Techniques
10. Orbit Determination and Estimation
11. Mission Analysis

Appendix A. Dictionary of Symbols
Appendix B. Modeling the Atmosphere
Appendix C. Mathematical Fundamentals
Appendix D. Constants and Expansions

Aerospace Engineering Student.......2004-02-21

As a student taking a graduate-level course in astrodynamics, this book has been a fantastic resource. It has (for the most part), the same material as Prussing & Conway, but it really develops the topics much more. The algorithms Dave Vallado outlines in his book have helped me tremendously in my research. I have found this book to be the most comprehensive astrodynamics book I have ever come across - a definate must have for anyone studying astrodynamics!

New and Improved 2nd Edition.......2003-02-27

I liked the original edition of this book very much, and I like the second edition even better. It is a unique format in that Vallado presents algorithms of all the major routines such as Lambert's Problem (several methods), Kepler's Problem (again, several methods), time conversion, date conversion, orbital element to ECI, and many, many other transformations. Although I no longer work in the field actively, I bought the second edition and would highly recommend it to anyone as an introduction and/or a reference to astrodynamics.

Average customer rating:

very nice conceptual overview
Not for the practitioner
Trash
Excellent Introduction, Sparse on Details
A Good Introductory Survey

Scientific Computing
Michael T. Heath
Manufacturer: The McGraw-Hill Companies, Inc.
ProductGroup: Book
Binding: Hardcover

General | Computers & Internet | Subjects | Books

Research | Education | Science | Subjects | Books

Methodology & Statistics | Experiments, Instruments & Measurement | Science | Subjects | Books

General | Science | Subjects | Books

General | Mathematics | Science | Subjects | Books

General | Computer Science & Information Systems | New & Used Textbooks | Stores | Books

Algorithms | Computer Science & Information Systems | New & Used Textbooks | Stores | Books

All Titles | Qualifying Textbooks - Fall 2007 | Stores | Books

Computers & Internet | Qualifying Textbooks - Fall 2007 | Stores | Books

Professional | Qualifying Textbooks - Fall 2007 | Stores | Books

Science | Qualifying Textbooks - Fall 2007 | Stores | Books
Similar Items:

ASIN: 0072399104

Book Description

Heath 2/e, presents a broad overview of numerical methods for solving all the major problems in scientific computing, including linear and nonlinear equations, least squares, eigenvalues, optimization, interpolation, integration, ordinary and partial differential equations, fast Fourier transforms, and random number generators. The treatment is comprehensive yet concise, software-oriented yet compatible with a variety of software packages and programming languages. The book features more than 160 examples, 500 review questions, 240 exercises, and 200 computer problems. Changes for the second edition include: expanded motivational discussions and examples; formal statements of all major algorithms; expanded discussions of existence, uniqueness, and conditioning for each type of problem so that students can recognize "good" and "bad" problem formulations and understand the corresponding quality of results produced; and expanded coverage of several topics, particularly eigenvalues and constrained optimization. The book contains a wealth of material and can be used in a variety of one- or two-term courses in computer science, mathematics, or engineering. Its comprehensiveness and modern perspective, as well as the software pointers provided, also make it a highly useful reference for practicing professionals who need to solve computational problems.

Customer Reviews:

very nice conceptual overview.......2006-07-22

Wow, people seem to be really split on this book. I had Mike Heath for numerical analysis/scientific computing and he was an excellent instructor, one of the best lecturers I've ever had. (As a consequence, I have a hard time separating the book and the class, so judge accordingly.) The book is based on his lecture notes, though he added some material and didn't cover every topic in the book. Just reading the book is useful to give you an overview of the point behind different methods. The goal of the class for which this book was written is actually quite conceptual. It was to give scientists (that's me: a stats researcher who makes heavy use of numerical computation) and CS people in areas other than scientific computing a leg up. It was only a first class for people in scientific computing, the rough equivalent of intro Physics or intro Probability/Stats for people in those respective majors. However, you *won't* be prepared to "roll your own" from this book. In fact, at the beginning of the semester Heath was very careful to note that if you have the opportunity to use a library function for most numerical programming, you are nuts to roll your own. Why? Numerical algorithms are usually extremely complicated and the authors of the code often spend years developing careful expertise on them. Frequently the formulas used to elucidate a given method are NOT the ones used to implement it. You need error traps, tricks to handle ill-scaling and other special cases, etc. These are things that someone who has a one-semester, superficial understanding of a topic simply won't have. So consider the book on the goals it set: it is an overview of a field. If you want to learn more about any one topic, you have to dig deeper and consult references and other works, but this is a good place to start. For this, the book serves admirably.

Not for the practitioner.......2005-11-17

If you are interested in Scientific computing from the viewpoint of the end user that is the guy who uses the method to solve practical engineering problems then this book is lacking.

Not enough methods in this book to constitute an introductory survey of the field. Every chapter gets heavy dose mathematical treatment, apparently Heath loves his math but for the rest of us it doesnt translate into know-how. Know how to solve equations using computational techniques. Very few derivations to back his mathematical swagger, very few examples (if any) and fewer numerical schemes to solve problems. Many of the chapters receive cursory treatment such as PDE's get about 70 pages of print. Far too little to do anyone any good.

He does talk about interesting issues such as conditioning and error analysis and computer precision and memory issues but it is done from such a superficial viewpoint that one cannot use anything to improve ones code. Not recommended if you want to learn numerical methods even if you have an excellent professor to learn from. His chapter on FFT's was even more abstruse and there was hardly any methods with which to solve PDE's.

I had this for a graduate course in Numerical Methods but ended up using Hoffman's excellent book on Numerical Methods.

Trash.......2005-10-14

If you want to have a solid understanding of numerical computation, this book is definitely the last choice. Many theorems are given without any proof or even intuitions behind them in this book. Even when a proof is provided, it's often far from rigorous. The organization of chapters is the worst I have ever seen, revelant materials are scattered over several different locations rather than put together. Take the SVD for example, it is mentioned in the end of chapter 3, but reappears in chapter 4, which is very confusing. If you are new to this area, please don't read this book. It gives you many many facts without explanations, which I think is not a good way to learn new things. David S. Watkins' Fundamentals of Matrix Computations is a lot better and easier to understand. It also emcompasses many detailed treatments of various theorems. If you have bought Heath's book, don't be sad, at least it can serve as a coaster.

Excellent Introduction, Sparse on Details.......2004-11-20

While sparse on the details of many of the algorithms and theorems mentioned, as an introduction it covers a broad range of material-enough for two semesters of study. The writing is lucid, and when a proof of a theorem is given, it is easy to follow and explained in english afterward. Rationale is given for everything, which is a great benefit to a student not familiar with the nuances of sophisticated linear algebra.

A Good Introductory Survey.......2002-11-05

This book excels at presenting a reader with little to no knowledge in computer science and a mild mathematical background (knowledge of differential equations as a prerequisite) with the fundamental concepts regarding scientific computing. The presentation of pseudo-code algorithms helps smooth the transition from analytical (pencil and paper) thinking to numerical thinking. The algorithms are presented in a manner such tha anyone with access to dozens of possible environments can apply them, though they are by no means complete, thus requiring some thought into the processes. The material covered is 110% of what an engineer will want to know, 90% of what an applied mathematician will want to know, and 45% of what a numerical analyist will want to know. In all, a great book to begin a foray into numerical computing.

Digital Signal Processing: Principles, Algorithms and Applications (3rd Edition)

Average customer rating:

Immense volume, meager quality
Excellet handbook for system identification background
A great theoretical introduction to DSP
Something is missing ...
Solid Book

Digital Signal Processing: Principles, Algorithms and Applications (3rd Edition)
John G. Proakis , and Dimitris K Manolakis
Manufacturer: Prentice Hall
ProductGroup: Book
Binding: Hardcover

General | Graphic Design | Computers & Internet | Subjects | Books

Applied | Physics | Science | Subjects | Books

Electrical & Electronics | Engineering | New & Used Textbooks | Stores | Books

All Titles | Qualifying Textbooks - Fall 2007 | Stores | Books

Computers & Internet | Qualifying Textbooks - Fall 2007 | Stores | Books

Professional | Qualifying Textbooks - Fall 2007 | Stores | Books

Science | Qualifying Textbooks - Fall 2007 | Stores | Books
Similar Items:

ASIN: 0133737624

Customer Reviews:

Immense volume, meager quality.......2007-09-06

This is a very large book covering many areas of digital signal processing. I bought a used copy of the third edition to replace an earlier one. Unfortunately, many of the errors - conceptual, not typographical - have remained. For example, the authors state in Sec. 8.3 that the frequency response of an elliptic (Cauer) filter is a rational function of a Jacobian elliptic function of frequency. An electrical engineer would know that a transfer function of a network of discrete components is a rational function of frequency, whereas the Jacobian elliptic is a transcendental function. The typographical error in the name of the mathematician Schur has finally been corrected attesting to the fact that neither author ever read the original paper. The presentation is extremely detailed in trivialities, with as many pictures, including a derivation of the sum of a geometric series as an exercise, a subject usually taught in high school. Finally, as another example, the solution's manual gives the wrong answer for Problem 2.9(a) stating, in effect, that a periodic function possesses a limit as its argument tends to infinity, showing complete ignorance of the notion of limit by the authors. Books such as this have little educational value, confusing the student with tons of irrelevant information, non-standard nomenclature - the Cauchy Residue Theorem in Sec. 3.1.2 is renamed to Cauchy Integral Theorem - and wrong answers. This book, if properly corrected, would be very useful.

Excellet handbook for system identification background.......2006-03-13

It's very very useful book for system identification specially newstarted, because of the fact that system identification is heavily related DFT, FFT, Spectral Analysis, Wiener-Khinchine relations and so on. Congratulations !!!

A great theoretical introduction to DSP.......2005-12-12

This book is a great theoretical introduction to DSP. Although its size looks intimidating and there is a lot of math, this book is very good for a beginner because firstly, the size of the book is due to numerous examples as well as clear and detailed explanations for most of the concepts and secondly, it is possible to skip over much of the math if you are so inclined and take away the gist of the section. This is the case in some of the more advanced topics covered which may be suitable for a second reading.

Some of the things I liked in this book are:
- The organization of the material and lucidity of the writing and explanation
- Consistency of notation
- The concepts of frequency in continuous and discrete time signals in Chapter 1
- The long introduction to discrete time systems and the concepts of linear time invariance in Chapter 2
- The explanation of Fourier series and Fourier transforms of continuous time and discrete time signals (periodic and non periodic) in Chapter 4 is the best part of this book
- Frequency domain characteristics of LTI systems in Chapter 4
- The way the DFT was introduced and its relationship with the DTFT in Chapter 5
- Sampling and reconstruction of signals in Chapter 9

Some of the things I did not like in this book are:
- The way the sampling theorem was derived in Chapter 4. In DSP you can derive the same thing in many ways but in many cases one method is more intuitive and simpler than the rest. There is an easier way to derive the sampling theorem
- There are mistakes in some equations. Not a major issue though
- There is no MATLAB or computer exercises or examples anywhere. This is a pity because you can learn so much and get a lot of insights with a few hours of DSP with MATLAB. Also there are some things like filter design which are done only on a computer
- I did not like the treatment of Multirate DSP in Chapter 10
- There is no treatment of 2D processing anywhere

On the whole this is a great theoretical introduction to DSP with a few minor drawbacks. I would still recommend this book over the ones by Oppenheim and Mitra for a beginner. But I would wait for the fourth edition that comes out in Feb. 2006 before buying any DSP book.

Something is missing ..........2004-10-29

This book was required for a graduate-level DSP course, but I found it quite insufficient for study without a VERY good set of classroom notes. There are mistakes in various equations throughout the text, little to no examples, and I have yet to find a solutions manual.

The one nice thing I can say about the text is that it is thorough in its coverage. The book covers almost every topic I can think of for both undergraduate and graduate-level courses. My course has supplemented the text with "Discrete-Time Signal Processing" by Oppenheim and Schafer as well as "Adaptive Filter Theory" by Haykin. I found Oppenheim's text to be better for the examples -- even buying the Shaum's Outline for DSP can suffice. Haykin's text is for our coverage of adaptive filter theory.

If you're looking for a good undergraduate text try B.P. Lathi's book "Signal Processing and Linear Systems" -- it's much better and has been used at my University for a number of years now to teach our two undergraduate-level DSP courses.

Solid Book.......2004-03-10

I am a graduate student at USC and this book I actually used in lieu of the assigned book Digital Signal Processing (by Mitra). I referred to this book mainly because the assigned book hardly had any intuitive explanations and was quite convoluted. Proakis did a much better job in terms of the relationships between the various Fourier Transforms without comprising mathematical rigor. I also have Lyons Understanding Digital Signal Processing which is great for people new to DSP but I felt it lacked some depth in certain areas and did not have sample problems. Overall Proakis does a solid job with this book. I'd recommend it after knowing the material in Lyon's book.

Average customer rating:

Kind of old stuffs
Optimization Mini-Library
It's not the technique, it's the logic behind it
improve your problem solving ability
get this book!, read it!, understand it! :)

How to Solve It: Modern Heuristics
Zbigniew Michalewicz , and David B. Fogel
Manufacturer: Springer
ProductGroup: Book
Binding: Hardcover

CAD | Graphic Design | Computers & Internet | Subjects | Books

General | Computers & Internet | Subjects | Books

General | Software | Computers & Internet | Subjects | Books

Look Inside Art Books | Trip | Specialty Stores | Books

Look Inside Computer Books | Trip | Specialty Stores | Books

Look Inside Science Books | Trip | Specialty Stores | Books

All Amazon Upgrade | Amazon Upgrade | Stores | Books

Computers & Internet | Amazon Upgrade | Stores | Books

Professional & Technical | Amazon Upgrade | Stores | Books

Science | Amazon Upgrade | Stores | Books

All Titles | Qualifying Textbooks - Fall 2007 | Stores | Books

Computers & Internet | Qualifying Textbooks - Fall 2007 | Stores | Books

Professional | Qualifying Textbooks - Fall 2007 | Stores | Books

Science | Qualifying Textbooks - Fall 2007 | Stores | Books
Similar Items:

Accessories:

ASIN: 3540224947

Book Description

This book is the only source that provides comprehensive, current, and correct information on problem solving using modern heuristics. It covers classic methods of optimization, including dynamic programming, the simplex method, and gradient techniques, as well as recent innovations such as simulated annealing, tabu search, and evolutionary computation. Integrated into the discourse is a series of problems and puzzles to challenge the reader. The book is written in a lively, engaging style and is intended for students and practitioners alike. Anyone who reads and understands the material in the book will be armed with the most powerful problem solving tools currently known.

This second edition contains two new chapters, one on coevolutionary systems and one on multicriterial decision-making. Also some new puzzles are added and various subchapters are revised.

Customer Reviews:

Kind of old stuffs.......2007-09-23

The material is alright but it is just kind of old. I can not tell from the original description otherwise, I will
not have bought it.

Optimization Mini-Library.......2007-02-20

This is the best book I have in my optimization library. It is excellent for students and teachers as well. It introduces you to optimization using a simple language, practical examples explained in a very didactical manner. It surveys optimization techniques and categorizes it in a very well-arranged and simplified format. You wouldn't have to read tens of pages with unsightly symbols, messed with subscripts and superscripts to understand a single optimization technique.
It also brings an uplifting introduction to the concept of problem solving. I highly recommend this book to Optimization and Mathematics students and teachers.
Read the book, once you are done, look at the table of contents and give a five minutes lecture on each single title and subtitle, which is what you will be capable of doing at the end.

It's not the technique, it's the logic behind it.......2006-07-24

Most evolutionary computation or math books deal with the techniques of solving problems. This book teachs you how to think of a solution for the problem you face, and not what problems are appropriate for the technique in hand.

The logic is that when you do a craft work, you do pick the appropriate tool from your tools box, but you don't grasp a tool and then find a job to go with it, which is the case when you can only handle this tool.

improve your problem solving ability.......2006-02-20

The authors have updated their successful first edition, though the latter, printed in 99, was scarcely obsolete. A heuristic can be basically a rule of thumb, dressed up in fancier language. What the authors intend is for you to develop an intuition about when to use modern algorithms. Where is almost every case, these are actually implemented on a computer; a reflection of the cheap availability of computing power to most readers.

The book is a good complement to various standard algorithm texts, like those by Sedgewick, Aho and Knuth. You can consider this book as standing a level above those. [Though Knuth's books also do an excellent job of suggesting when to use or modify algorithms. ]

The level of discussion here is not of a strict, heavy mathematical approach. It can be read as informal guidelines, that discuss the gist of such ideas as simulated annealing and evolutionary methods. There is a wide range of example problems, to motivate you in understanding what might be used to solve them.

get this book!, read it!, understand it! :).......2006-01-01

i have not finished reading this book, but it's 'worth it' if only for the first two chapters! :) anyone interested in dynamical systems (control aspects), general problem solving, AI, and human thinking should read and understand this book! :) work the problems! :) think! enjoy! :)

A Wavelet Tour of Signal Processing, Second Edition (Wavelet Analysis & Its Applications)

Average customer rating:

Great Book
The most universal treatment of the subject
The worst textbook I have ever seen
Algorithms and much more!
A bold approach to wavelet transforms that simplifies

A Wavelet Tour of Signal Processing, Second Edition (Wavelet Analysis & Its Applications)
Stéphane Mallat
Manufacturer: Academic Press
ProductGroup: Book
Binding: Hardcover

General | Engineering | Professional & Technical | Subjects | Books

General | Science | Subjects | Books

General | Mathematics | Science | Subjects | Books

Applied | Physics | Science | Subjects | Books

General | Arts & Photography | Subjects | Books

Electrical & Electronics | Engineering | New & Used Textbooks | Stores | Books

General | Engineering | New & Used Textbooks | Stores | Books

All Amazon Upgrade | Amazon Upgrade | Stores | Books

Arts & Photography | Amazon Upgrade | Stores | Books

Computers & Internet | Amazon Upgrade | Stores | Books

Engineering | Amazon Upgrade | Stores | Books

Professional & Technical | Amazon Upgrade | Stores | Books

Science | Amazon Upgrade | Stores | Books

All Titles | Qualifying Textbooks - Fall 2007 | Stores | Books

Arts & Photography | Qualifying Textbooks - Fall 2007 | Stores | Books

Computers & Internet | Qualifying Textbooks - Fall 2007 | Stores | Books

Professional | Qualifying Textbooks - Fall 2007 | Stores | Books

Science | Qualifying Textbooks - Fall 2007 | Stores | Books

Look Inside Art Books | Trip | Specialty Stores | Books

Look Inside Computer Books | Trip | Specialty Stores | Books

Look Inside Science Books | Trip | Specialty Stores | Books
Similar Items:

ASIN: 012466606X

Book Description

This book is intended to serve as an invaluable reference for anyone concerned with the application of wavelets to signal processing. It has evolved from material used to teach "wavelet signal processing" courses in electrical engineering departments at Massachusetts Institute of Technology and Tel Aviv University, as well as applied mathematics departments at the Courant Institute of New York University and École
Polytechnique in Paris.

Key Features
* Provides a broad perspective on the principles and applications of transient signal processing with wavelets
* Emphasizes intuitive understanding, while providing the mathematical foundations and description of fast algorithms
* Numerous examples of real applications to noise removal, deconvolution, audio and image compression, singularity and edge detection,
multifractal analysis, and time-varying frequency measurements
* Algorithms and numerical examples are implemented in Wavelab, which is a Matlab toolbox freely available over the Internet
* Content is accessible on several level of complexity, depending on the individual reader's needs
New to the Second Edition
* Optical flow calculation and video compression algorithms
* Image models with bounded variation functions
* Bayes and Minimax theories for signal estimation
* 200 pages rewritten and most illustrations redrawn
* More problems and topics for a graduate course in wavelet signal processing, in engineering and applied mathematics

Customer Reviews:

Great Book.......2007-03-20

A great tool for Harmonic Analysis. The book is really well written, a most read for any one who is interested in the area of wavelets, S.P. or harmonic analysis.

The most universal treatment of the subject.......2005-06-08

I say universal because this book would appeal to engineers, computer scientists, and mathematicians alike. Mallat was particularly successful to present the topic in a sufficiently rigorous way but without losing sight of the practical and more intuitive side. The presentation comprises the mathematical and the signal processing viewpoints simultaneously. The wavelet field is very vast by now with several subfields. In this respect, Mallat made a great selection of topics in this book. There is a chapter on estimation which offers great review material and pretty much the state-of-the art on signal estimation over a wavelet basis. The chapter on approximation is particularly useful for those who are not well versed in approximation theory and thus are unable to understand other treatments. If you're interested in learning wavelet theory to solve practical problems such as image compression, signal estimation, etc, this is the book to have.

The worst textbook I have ever seen.......2004-02-12

I just finished Chapter 3 of this book, but I have had enough of it. Conceptions about Fourier Transform are not clear at all. And the most unbearable thing is that, there are many printing errors which may lead to misunderstanding.

Algorithms and much more!.......2002-07-10

The subject of wavelets has many facets, --infinite in all directions;-- some of the more exciting sides of the subject
are algorithmic, and the underlying mathematical principles are both simple and powerful. Stephane Mallat's great, and readable, book, in both of its editions, brings
this out wonderfully!

A bold approach to wavelet transforms that simplifies.......2002-04-24

This is an outstanding tour through the field of wavelet decompositions of both continuous and discrete signals. It employs the formalism of Hilbert space, instead of linear algebra. This is important because the power of this formalism yields insights into the subject matter that are practically impossible in linear algebra. The formalized approach allows a wide variety of subjects to be placed on a common basis (no pun intended). For example, the transition of the treatment of the Fourier transform into Hilbert space, brings to bear the powerful guns of that space (such guns as inner product and completeness), and allows for a truly elegant proof of the Parseval and Plancherel formulas.
Parseval's theorem, simply stated, is that the inner products in Hilbert space are conserved by the Fourier transform. How simple. Linear algebra approaches cannot hope to make things this simple.

Proof of the General Sampling Theorem is equally elegant; it is shown that the projection of the function to be decomposed onto a basis function gives the discrete spectral coefficient.

Readers will also enjoy the treatment of windowed Fourier transforms and frames.

I should add a note about the style of the treatise. This treatise is not ordinary. It consistently uses very precise and carefully defined symbology. Contrary to popular belief, this makes the text easier to read, not more difficult. Once the reader understands the symbol set being used (they are all defined in the front of the text), even the proofs are tractable. Yes, I said proofs. That is another aspect of the text. There are proofs embedded in the text, without loss of continuity or clarity. Proofs are necessary to a good understanding of the subject matter. The formalism of theorems, lemmas and propositions makes the conclusions understandable, because the theorems, lemmas and propositions supporting the conclusions are identifiable.

I applaud the author for his approach and recommend that other text book writers use the same approach.

Books:

Books Index

Books Home

Recommended Books