Applications Books

I checked Dr. Dielman's Applied Regression textbook out from Tsing-Hua Univ (Taiwan) Library for preparing my MBA thesis regarding the interaction effects. Given the widespread use of the SPSS or SAS, there are fewer texts writen in other commercially available packages. This book provided an alternative option for conducting the regression work.

This book takes you along the process of learning regression analysis easily. The author takes the time to show you how to solve real problems, the disc that comes with the book allows to even go deeper on the subject of study. The one who buys this book will never sell it, you'll need it all your professional life.

Reiss systematically develops the distribution theory for order statistics. For intermediate order statistics a central limit theorem applies and for the very extreme order statistics extreme value limit distributions apply. This theory and its application to nonparametric statistics is also covered in the book "Order Statistics" by David and "The Asymptotic Theory of Extreme Order Statistics" by Galambos. Reiss departs from these books by providing a complete and rigorous treatment of the most recent research including the bootstrap.
Chapter 0 is a good introduction that puts everything in the proper context. The book was published in 1989 and the theory continues to develop. Reiss and others have published texts in the 1990s that further develop the theory and applications of extreme values.

Reiss systematically develops the distribution theory for order statistics. For intermediate order statistics a central limit theorem applies and for the very extreme order statistics extreme value limit distributions apply. This theory and its application to nonparametric statistics is also covered in the book "Order Statistics" by David and "The Asymptotic Theory of Extreme Order Statistics" by Galambos. Reiss departs from these books by providing a complete and rigorous treatment of the most recent research including the bootstrap.

Chapter 0 is a good introduction that puts everything in the proper context. The book was published in 1989 and the theory continues to develop. Reiss and others have published texts in the 1990s that further develop the theory and applications of extreme values.

If your are an art teacher or an amateur in the field of art, you must use this book as a source for classroom teaching. This book leads you through the elements and principles of the visual arts. It is easy reference for lesson plans and for reference material, for any teacher. This book also covers areas in the profiles of learning and technique tips. Excellent for any one interested in the visual arts!

If your are an art teacher or an amateur in the field of art, you must use this book as a source for classroom teaching. This book leads you through the elements and principles of the visual arts. It is easy reference for lesson plans and for reference material, for any teacher. This book also covers areas in the profiles of learning and technique tips. Excellent for any one interested in the visual arts!

This book is an excellent reference book on current approaches to some of the foundational questions in artificial intelligence, philosophy of mind, and engineering of intelligent systems. The editors as amply demonstrated by their other publications, have the rare ability to interrelate an amazing diversity of perspectives on Artificial Intelligence - from symbolic methods to neural networks and evolutionary apporaches, to uncover the shared principles and common foundations, and show how different paradigms can be brought together in synergistic ways to advance our ability to design and analyze intelligent systems. This book includes chapters written by some of the leading experts in the field. The book should be especially useful as a reference to graduate students and researchers interested in artificial intelligence, machine learning, cognitive science, software agents, and philosophy of mind. It should also be useful as supplementary reading for a graduate or upper level undergraduate course in artificial intelligence or cognitive science, or as a primary text for a seminar course. All in all, a great book!

Symbolic (e.g., logic based) and connectionist (e.g., neural network) models are often viewed as separate, and perhaps incompatible approaches to artificial intelligence and cognitive modelling. Far too many young researchers (including myself) have been swept away by the exaggerated claims of each camp. This collection of chapters is an excellent medicine for such a malaise. The chapters in this collection demonstrate, with pursuasive theoretical and philosophical arguments as well as empirical data that symbolism and connectionism can, and perhaps should, be reconciled. At the time this book came out, this was not a popular position. However, recent developments in AI and cognitive science have more than vindicated the views expressed in this book. Now (6 years later), some of the chapters are a bit dated. However, I recommend the book strongly to those who are interested in foundational issues in artificial intelligence and cognitive science.

I almost didn't by the ASP.NET 3.5 for Dummies. Then I noticed that it was a different author than ASP.NET 2.0 for Dummies and I thought I would give it a look. Bill Hatfield wrote the 'Dummies' book on the previous version and while I found him to be very knowledgeable, I got frustrated because I was trying to learn how to use Visual Studio with ASP.NET and his book didn't provide much help. Ken Cox however "gets it". He wrote the book for use with Visual Studio and by the end of Chapter 4 you're already using AJAX with no difficulty! By chapter 7 you're delving into LINQ! Ken's approach is intelligent and his style works both for the beginner as well as those more seasoned in ASP.NET. Excellent book!

I am an experienced developer so I only expected to skim over the book to get familiar with any of the new asp.net 3.5 features. I found myself reading every word of every page because the book was actually "entertaining". The writing is very smooth and easy to understand. You feel as if a really good teacher who knows how to relate to people is talking to you.

I was also surprised how deep the book was able to go into each subject. For example Linq is a very complicated subject yet the book does contain enough examples for you to use it in the real world.

As I mentioned, my search for COM understanding could end here. I just went through the chapter that explains COM. I felt really relieved and accomplished. I searched and read several other COM books but none of them were this good. I'll go through the reminder of the book to quench my thrist.

I just read the first chapter last night. I found it to be very clear and succinct. In flipping through the rest of the chapters, they appear to be of the same quality.

I have some brief C++ experience from several years ago, and more recently some Java. All of my COM experience is with VB. With this background I was able to easily grasp the concepts being explained.

My goal is to learn to write COM objects in C++ as quickly as possible. This book is my choice for that task. It seems to have the balance of fundamentals review and new information that's right for someone who already has the basics of the C++ language and wants to expand into COM.

I haven't tested the code examples, so I can't be sure there aren't typos, but the code I saw looked correct to my relatively novice eye.

At this point, I'm very pleased with the purchase of this book.

I had purchesed the 2002 seris for work and found the books to be the best step-by-step text on AutoCAD had had found to date. When my company updated to 2004, I checked to see if Mr. Metz had writen a new seris for the latest version. I was elated when I saw that he had. This new seris is as easy to use as the original.

These books are the most user friendly I have ever used. Weather you are a novice or seasoned AutoCAD user, these books should be on your shelf at work or home.

If there could be a higher rating then 5 stars, this AutoCAD seris would get my vote.

I've used the previous edition and am now using the new edition of these books for my high school technology classes and really like them. In place of lectures, I let the students work through the books at their own pace. These books are so well written with easy to follow instructions that my students learn the AutoCAD program very quickly. The best part is that after the students have completed the exercises in the books, I can assign them any drawing and they can do it.

I really recommend these books to any instructor who teaches an introductory course in AutoCAD or for any individual who wants to learn AutoCAD on their own.

This book explains the basics of the networks and protocols used in industrial automation. It goes into detail about specific protocols, explaining their intended purpose, how they evolved, and what they're used for today. It explains the models that separate fieldbuses from control networks and where the lines blur. There is good discussion of field control vs distributed control. It explains how redundancy and failsafes come into play with each type of network.

I approached this book as an engineer who designs industrial products without any training in the purposes behind the various industrial communication systems. Users of industrial products often understand the relationships between the various standards intuitively but cannot explain it well to a product engineer with little manufacturing experience. This book clears it all up in under 150 pages of easy-to-follow text and diagrams.

Anyone who wants to take a couple hours to learn what's behind the apparent hodgepodge of communication standards used in industrial automation should read this book.

Dick Caro has a wealth of knowledge about automation networking--and it shows throughout this book. From his rendering of the history of industrial networks and fieldbuses to the technical review of the leading contenders, the book is a veritable encyclopedia on the subject. It has a permanent place on my reference shelf.
Gary Mintchell
Editor, Automation World

If you have ever been curious to know what is the mathematics behind the fancy formulas describing the average-case behavior of algorithms -- this book is for you. An excellent addition to the classic "The Art of Computer Programming" by D.Knuth, "Introduction to Analysis of Algorithms" by R.Sedgewick and P.Flajolet, and "Analysis of Algorithms" by M.Hofri, this book walks reader through a beautiful, and at the same time very diverse (not to say complex) world of mathematical tools and techniques needed to obtain precise answers to questions like "what is the average depth of a digital tree built over $n$ strings?", or "what is the average number of comparisons performed by a Knuth-Morris-Pratt algorithm when it searches for a given pattern of length $m$ in a random text of length $n$?".

Being well organized, the book present these (sometimes very sophisticated) techniques in a simple step-by-step fashion, starting with brief reviews of several known (and necessary for future presentation) results from probability, complex analysis/special functions, and information theory. The presentation of the numerous specific techniques is split in two parts: explaining probabilistic and analytic approaches to the analysis of algorithms correspondingly. Probabilistic techniques (inequalities of moments, limit theorems, large deviations, etc.) are very useful in the analysis of complex random structures, as they often yield simple estimates of their asymptotic behavior, where more accurate techniques fail or become prohibitively laborious. Analytic techniques (generating functions, singularity analysis, saddle point techniques, Mellin transform, analytic poissonization and depoissonization) on the other hand, represent a toolbox for exact modelling of the characteristics of the algorithms, yielding estimates of unparalleled precision.

As indicated by its title, this book is mostly devoted to the analysis of a special class of combinatorial algorithms - ones that operate with sequences of symbols, or sequences. For example, it includes a detailed analysis of various algorithms for searching and sorting alphanumeric sequences based on digital trees (tries, digital search tries, Patricia-tries, etc.), redundancy expressions for popular Lempel-Ziv data compression schemes, average complexity estimates for text pattern-matching algorithms (such as Knuth-Morris-Pratt scheme), and so on.

Following the tradition of "The Art of Computer Programming", the author wraps many results in the form of exercises, so that active readers can have fun solving them. These excersises are grouped into several classes, ranging from simple routine calculations to serious research problems (including ones that are currently unsolved).

Overall, this is a very good graduate-level textbook and a valuable (and almost self-contained) source of information for everyone interested in the analysis of algorithms.

If you have ever been curious to know what is the mathematics behind the fancy formulas describing the average-case behavior of algorithms -- this book is for you. An excellent addition to the classic "The Art of Computer Programming" by D.Knuth, "Introduction to Analysis of Algorithms" by R.Sedgewick and P.Flajolet, and "Analysis of Algorithms" by M.Hofri, this book walks reader through a beautiful, and at the same time very diverse (not to say complex) world of mathematic tools and techniques needed to obtain precise answers to questions like "what is the average depth of a digital tree built over $n$ strings?", or "what is the average number of comparisons performed by a Knuth-Morris-Pratt algorithm when it searches for a given pattern of length $m$ in a random text of length $n$?".

Being well organized, the book present these (sometimes very sophisticated) techniques in a simple step-by-step fashion, starting with brief reviews of several known (and necessary for future presentation) results from probability, complex analysis/special functions, and information theory. The presentation of the numerous specific techniques is split in two parts: explaining probabilistic and analytic approaches to the analysis of algorithms correspondingly. Probabilistic techniques (inequalities of moments, limit theorems, large deviations, etc.) are very useful in the analysis of complex random structures, as they often yield simple estimates of their asymptotic behavior, where more accurate techniques fail or become prohibitively laborious. Analytic techniques (generating functions, singularity analysis, saddle point techniques, Mellin transform, analytic poissonization and depoissonization) on the other hand, represent a toolbox for exact modelling of the characteristics of the algorithms, yielding estimates of unparalleled precision.

As indicated by its title, this book is mostly devoted to the analysis of a special class of combinatorial algorithms -- ones that operate with sequences of symbols, or sequences. For example, it includes a detailed analysis of various algorithms for searching and sorting alphanumeric sequences based on digital trees (tries, digital search tries, Patricia-tries, etc.), redundancy expressions for popular Lempel-Ziv data compression schemes, average complexity estimates for text pattern-matching algorithms (such as Knuth-Morris-Pratt scheme), and so on.

Following the famous tradition of "The Art of Computer Programming", the author wraps many (in some case very difficult to derive) results in the form of exercises, so that active readers can have fun solving them. As a special bonus, some of these "exercises" represent currently open research problems.

Overall, this is a very good graduate-level textbook and a valuable (and almost self-contained) source of information for everyone interested in the analysis of algorithms.

This book consists of a set of 5 volumes, each dedicated to different topics and each written by a different group of authors. Unavoidably this has led to much repetition, but the biggest weakness of the book is the absence of a common index for all the volumes in the end. One often has to make quesses and search several volumes to find what one wants and even then one may not find all the information there is in it. There are also differences between the authors in the quality of their writing and the brilliance of the late A.E.Bailey who wrote the original classic masterpiece is definitely absent. I also thought there were not suficient physical data for chemical engineers working on oils and fats and primary oleochemical derivatives, biodiesel etc. Nevertheless, the sheer size of this book, makes it easily the most comprehensive single source of information on oils and fats available today. For this reason, it is a necessary posession for any library on oils and fats worthy of its name.

A five volume set, much expanded over previous editions, to cover the latest processing technology as well as the latest developments in oilseeds. This is the definitive text that covers fats and oils, composition, processing and equipment, edible products, industrial products and derivatives (e.g. soap.) The only drawbacks are that there is no common index to all volumes and that there is a great deal of valuable information which is not findable through the index (i.e. one must actually READ the sections to unearth valuable facts and bits of information.)