Applications Books

This book is very useful for students, scientists and researchers who work dealth with matlab program for their problems in calculations.

In recent year, there has been phenomenal growth in some methods for engineering calculation that use matlab. It's not difficult to study and very simple.

This book is very useful for students, scientists and researchers who work dealth with matlab program for their problems in calculations.

In recent year, there has been phenomenal growth in some methods for engineering calculation that use matlab. It's not difficult to study and very simple.

Mathematics books are often considerably more difficult to read than their authors prepare their audiences to believe; this book is a happy exception. It is written for an audience of readers at a specific place in their studies (ones who know linear algebra but want to take their understanding of it to a deeper level), and it reaches this audience very well. The emphasis of this book is on linear algebra in abstract mathematics; it is less useful for people interested in numerical linear algebra.

As the name suggests, this book requires a fair amount of background. The introductory chapter moves very fast, but is thorough, and exciting to read. The rest of the book presents advanced topics at a more leisurely pace, while still remaining fairly concise. Some difficult concepts, such as the universal property, are introduced several times at several different places in the book, so that someone working through the book will be more familiar with them when it is finally necessary to understand them on a deeper level.

I find the material on modules outstanding; the author explores the analogies between modules and vector spaces, rigorously exploring which analogies hold, and giving examples of cases in which other analogies fail. The presentation of modules in this book differs greatly from that encountered in most abstract algebra texts: while most books focus on modules' similarities to rings and applications in commutative algebra, this text focuses on their similarities to vector spaces and applications to the study linear operators on vector spaces.

One should not be scared by the word "advanced" in the book's title. Although the book covers advanced topics, it is very clear. When proofs are omitted, it is usually because they are very easy for the reader to supply. The exercises are very valuable (some are critical for understanding the material), but they're not diabolically difficult.

I think this book would make an outstanding textbook for an introductory graduate-level course in linear algebra, or perhaps a senior-level undergraduate course for students with a strong background. It is also very well-suited to self-study. A student with prior background in abstract algebra (group theory, ring theory, etc.) will find this book much more manageable than a student who has not covered such material. People wanting a more introductory text might want to look to the book by Axler, or the old classic by Shilov.

Linear algebra is crucial to anyone in a mathematical or technical field. To the pure or applied mathematician, it is the bread and butter -- a lot of fundamental theorems (even in quite advanced fields like algebraic geometry) ultimately come down to a calculation using linear algebra.

In any case, this book is brilliant for the moderately advanced student who knows the basics (maybe sketchily) and wants an extremely comprehensive, rigorous, and coherent review and reordering of his or her linear algebra knowledge. I knew most of the topics in this book in a superficial way, but reading it is quite fulfilling because it all comes together at once.

The choice of topics and the angles from which they are presented is extremely strong. The Jordan and Rational Canonical Forms get a full and rigorous treatment. Unlike many linear algebra books, which use some ugly matrix-related kludge in the proofs of the classification theorems, this book does these topics from the algebraic perspective (i.e., as decompositions of modules over principal ideal domains). Inner product spaces are done in their own substantial chunk of the book, where all the essential ideas are developed abstractly and well. Sometimes linear algebra books focus too much on particular examples of inner product spaces or resort to "magical" proofs of important inequalities. This book takes care to build up important lemmas so that big results fall out "naturally". It is by far the best abstract treatment of inner products that I have read (although it should be supplemented by a knowledge of some of the standard examples, which can be found in a typical introductory textbook).

The proofs are the most elegant possible, with no ugliness or nonsense. The notation is a gem, without confusing mixes of superscripts and subscripts and nonstandard choices. The exposition is at just the right level (for me at least) -- the steps in proofs that are left as exercises are all reasonable and straightforward, and all the details that are subtle or interesting are filled in, discussed, and emphasized.

I have been looking for a beautiful book on linear algebra of this sort for a long time, and am delighted to have finally found it.

This book serves as an awesome guide to the engineer seeking to become a key player in their team and business. The author brings a lot of experience to the book and equips the reader with the tools needed to build and maintain a successful business. John (the author) covers some of the popular frameworks, containers, API's and patterns used in Java today. Aside from the technical topics, John touches on the culture of engineering and business politics you may face.

I've been in engineering for almost 10 years now and have worn many hats; nothing beats experience and this book is a window into that experience. If you're like me, the engineer that stands the front line when the business is challenged with the technical issues of today, Affinity is the sword I'd carry into battle.

If you are responsible for any Java container at any level - You should read this book. Discusses many common pitfalls of Java server administration and for the first time in a long time, I felt that somone can relate. The author does a great job of providing examples of bad practice - almost like a Weblogic anti-pattern guide - and then advice on a better way to go about your business. Where this book really excels is in how it's written. Technical yet friendly to those who are not - think managers who aren't involved in the day to day operations, can use this book to give them strong insight into their staff's work and help to preempt many of the problems faced by organizations and personnel.

Though it could have been written in a bit more detail, this book is thourogh and explains much about lasers. If you need to learn alot about lasers and fast, READ THIS BOOK!

Though it could have been written in a bit more detail, this book is thourogh and explains much about lasers. If you need to learn alot about lasers and fast, READ THIS BOOK!

Explosion of the Internet pushes the demand of bandwidth to a critical point. Various technologies on opical fibre system enhance the transmission bandwidth in the worldwide communication system. But, a high transmission bandwidth network reveals its bottleneck on the switching bandwidth - how to switch singal and data in tight time bound in various fashions.

Existing router and switch vendors use network flow probability models to simulate the performance and blocking probability of a switching matrix design. This trial and error approach has no guarantee on the performance and implementation complexity.

Prof. Li breaks a new ground by using algebra calculation in the switching fibric representation. By his 20+ years research, his algebra algorithm has an unique ability in handling non-blocking switching, Time-Space-Time 3-phase switching and concentrator/sorter implementation. And he suggests some interesting implementation oriented design in reducing implementation complexity in a manhatten VLSI layout.

This book covers Prof. Li's lifetime work and his research in switching, probability models and information theory. It worths any information engineers for a deep look, and it's a fanastic reference book for any switching researchers...

Explosion of the Internet pushes the demand of bandwidth to a critical point. Various technologies on opical fibre system enhance the transmission bandwidth in the worldwide communication system. But, a high transmission bandwidth network reveals its bottleneck on the switching bandwidth - how to switch singal and data in tight time bound in various fashions.

Existing router and switch vendors use network flow probability models to simulate the performance and blocking probability of a switching matrix design. This trial and error approach has no guarantee on the performance and implementation complexity.

Prof. Li breaks a new ground by using algebra calculation in the switching fibric representation. By his 20+ years research, his algebra algorithm has an unique ability in handling non-blocking switching, Time-Space-Time 3-phase switching and concentrator/sorter implementation. And he suggests some interesting implementation oriented design in reducing implementation complexity in a manhatten VLSI layout.

This book covers Prof. Li's lifetime work and his research in switching, probability models and information theory. It worths any information engineers for a deep look, and it's a fanastic reference book for any switching researchers.

John Ho :-p

To my knowledge, this is the best book on this subject (at this level). I believe if you go through this book THROUGHLY and finish all the projects included, it is worth at least two year practical experience. For me an electrical engineer with 10 year working experience, I still find this book very useful.

The author could make the book even better if a bit more contents are added in Chapter 3: Digital Control of Aanlog Functions, such as examples with microcontroller applications (interface with A/D & D/A), though it may be beyond 'Analog' IC application.

Also, I found some parts used in the book are no longer available (therefore I would suggest the author to update some contents if he is planning to do so), you better check vendor's website to find the most current one.

This is a great book. I am presently one of Jacobs' students and he is the best professor i have ever had. His reading material in this book is easy to read and very interesting. Most technical books are boring and hard to understand, but not this one. His teaching style is integrated in this book with excitement and wonderful theory. This book explains the OP AMP in detail along with power supplies, layout procedures, waveform generators, filters, non-linear circuits, and many more great concepts. Even if you are not taking the course, the book is an excellent reference.

Excellent work by excellent authors. Simply the best you can find in this field!

A graduate level book. It talks about the detail model and behavior of induction machine, synchronous machine and etc. The book gave me quite an idea of machinery. It was well written and explained in a detail and clear way. Since it is the first textbook I bought at USA, after reading, I cannot help wonder: that's the reason why American has advance technology, because they have good books. In my coutry, China, the authors likes to write hard, tough things in a small thin book and we can hardly understand them.

With a book as technical as this, it's hard to know who my potential review readers will be. Nevertheless, I will give a very CONCRETE and ACCESSIBLE review. Also you should bear in mind this: the book does have some concrete and accessible aspects before getting into complex issues; moreover -- and maybe this is the most important of all: the simpler, concrete and accessible aspects of this book DO HAVE UTILITY. I'll give a personal example of the utility of the book's simpler material at the end of my review. But now let's proceed in a nice logical order...

The book deals with "combinatorial optimization" problems. These are problems where there are (1) a gigantic number of discrete configurations that are possible, (2) a way of scoring how desirous a configuration is, and (3) ways to change the configuration from the present one. Examples include the scheduling problem of how to assign 20 workers to one job apiece for 20 jobs (with different worker/job pairings having different costs); and, of course, the famous traveling salesman problem -- requiring precisely one visit to each of N cities and a return to the first.

The most easily understood algorithm to solve combinatorial optimization is BLIND RANDOM SEARCH (BRS): generate a random configuration, score it, repeat (always keeping the best score yet encountered and its corresponding configuration saved in memory). You can have stop criteria as you wish -- including an OR'd pair (which I find to be itself a great improvement) -- such as UNTIL (a) score is X good or better OR (b) you've generated N random configurations.

BRS performs relatively poorly. A HUGE improvement is an algorithm called "Iterative Improvement" (II). This algorithm is covered on pages 6 thru 8 of the book. The idea is to take a BRS configuration then do some modest moves around that configuration -- scoring and repeating until you had k failures to improve. The best obtained is that one BRS "point". Generate a new BRS point and compare to the old as usual, but now the II loop probably substantially improved that old BRS score to which you are comparing.

Both BRS and II involve only "downhill" moves. Only a lower score and its companion configuration are kept and a new configuration never becomes the current one if its score is worse. The danger is "getting stuck" in a local minimum as opposed to the global minimum (truly best score). To avoid this danger there is the "probabilistic hill-climbing" algorithm of Metropolis. An improved configuration (one with a better score) still becomes the next current configuration, but you have some probability of taking the next current configuration as being the current contendor even if this contendor configuration has a worse score. The probability is related to the score and a parameter that might be thought of as temperature.

From the probabilistic hill-climbing algorithm of Metropolis, all you need to get to an annealing algorithm is a schedule for appropriately reducing the "temperature" parameter (which controls up-hill acceptance probability) in successive steps. The analogy is freezing a liquid to get its perfectly crystalline line-up of atoms, free of defects. Go too fast and you may get a glass rather than a crystal.

The book's chief aim is how to recommend IN GENERAL, without recourse to your specific problem, a schedule for the "temperature" changes. If this be your aim in considering the book, well it goes without saying you need not consider further: here's your book.

But what about the less technical reader? First of all, the book does gently introduce you to combinatorial optimization, blind random search, Metropolis and annealing. Second, the few pages on Iterative Improvement are EMINENTLY USEFUL in a PRACTICAL sense -- and are a good simple alternative to annealing (my example will be at the end). Third is that the book includes several ancillary extras.

The ancillary extras:

· tutorial on all of matrix mathematics
· tutorial on Markov Chains
· material on probability and conditional probability
· tutorial on Statistics -- esp. w.r.t. the Normal distribution and Central Limit Thm

I'm not saying that the ancillary extras are the best there is for a novice level reader, but most folks would not know of the existence of this material in a book called "The Annealing Algorithm".

The final bit of ancillary material is Pascal computer code for all the algorithms in the book and a complete program for doing the whole annealing bit on the electronic chip placement combinatorial problem.

MY EXAMPLE OF UTILITY OF ITERATIVE IMPROVEMENT ALGORITHM:

My problem is not combinatorial optimization, but can still use the ideas of iterative improvement since I am solving a deterministic problem (one without any random element) using Monte Carlo methods (using random numbers). My problem: I have the coordinates of the midpoint of a line segment; the line segment's length is also known and is roughly one-fourth the diameter of a circle; the line segment lies the annular area between this circle and a circle with a radius half-a-line-segment bigger radius than that of the original circle; lastly, given the rotation angle of my line segment, I ask this: what are the coordinates (x,y) of the intersection of the line segment and the original circle? (I took steps to check that YES, there was an intersection.) Solving the problem analytically didn't work. (Or at least, I couldn't do it.) I had used a BRS Monte Carlo approach. Then, re-reading this book, it occurred to me to use the book's algorithm (Iterative Improvement) on pages 6-8 (Pascal code page 8). I got a big improvement in lowering the error. Obviously, I had to delete details in this review (like how I even know error in my problem, and if I do know it, why can't I fix it exactly -- hint: circle is the locus of all points equidistant from a given point), but the POINT FOR YOU is that I attained a great improvement in my problem just by using the book's explicit algorithm (Pascal code) for Iterative Improvement.

Finally, the book is nice to read -- both very easy-on-the-eyes typography (unusual for a "math" book) and a good flow to the authors' writing.

The Annealing Algorithm is part of The Kluwer International Series in Engineering and Computer Science, concentrating on VLSI, Computer Architecture And Digital Signal Processing. The Consulting Editor, Jonathan Allen, has put together a concise, academic publication that introduces the conceptually simple procedures of simulated mathematical annealing and mathematical optimization. Research for the book was carried out at the Thomas J Watson Research Center of the IBM Corporation in Yorktown Heights, NY. Chapters include A Preview of The Annealing Algorithm, Preliminaries from Matrix Theory, (Markov) Chains, Chain Statistics, Annealing Chains, Samples from Normal Distributions, Score Densities, The Control Parameter, Finite-Time Behavior of the Annealing Algorithm, The Structure of the State Space, and (Pascal) Implementation Aspects. References and an Index are included. Mathematicians and computer science professionals seeking to learn about the conception of annealing as a combinatorial optimization tool, will find this publication interesting and will appreciate its use as a basis for further research.

I'm new to computers and the internet AOL companion and AOL keywords was a great help to me thanks Jennifer.

Being a rookie on AOL, I found Jennifer Watson's AOL Companion book to be very informative and helpful. In fact, when I was having problems with my connection, it really helped me out of a bind that was bad enough I thought I'd bought a defective computer. So as far as I'm concerned, the book already paid for itself!

I had the 2nd, edition of Miss. Jennifer Watson's "AOL KEYWORDS", I think if anyone is new or old to AOL community needs this book. I just love it, I am sure you do too! Why? Because, you'll have more fun when you are armed with this book. It gives you the sense of security, knowledge, and lot more... It is my "AOL-press" "don't go on AOL without it". Have fun to you all. Yours, Gita

AOL Keywords is my online bible, I never travel without it! If you want to get there quick, get a copy of this book. My favorite keyword is TIE THE KNOT