Book Description
first university level course in discrete mathematics ... Read more

Book Description
Putting all the elements together, this book addresses CNC (Computer Numerical Control) technology in a comprehensive format that offers abundant illustrations, examples and exercises. It includes a strong foundation in blue print reading, graphical descriptions of CNC machine tools, a chapter on right triangle trigonometry and programming that uses Fanuc Controllers. It emphasizes program pattern recognition and contains completely solved programming examples and self-contained programming examples. Thoroughly updated for this edition, it includes two new chapters, four new appendices, and is bundled with Predator Simulation and Kwik Trig software. For CNC Programmers/Operators, Machinists, Process Engineers, Industrial Engineers, Shop Operators/Managers, Planners, Coordinators, Sales Personnel ... Read more

Customer Reviews (2)

Great book for getting started
When I wanted to make a career change, this book was my primer on the basics of CNC programming and machining. It helped me to quickly pick up the essentials of this manufacturing process. I recommend it to anyone who wishes to get a foundation or refresher course in the basics, such as understanding shop math, G code programming, tooling, set-ups, speeds and feeds etc. These are the necessary building blocks for success in this field.

The best illustrated CNC text on the market
This book is probably one of the best Tech texts that I have yet seen. It covers a wide range of topics and keeps the reader interested with very good photograps and 3D drawings. There are several chapters for beginners to deal with shop trigonometry, metalworking data, blueprint reading, as well as a nice overview of CNC Mill and Lathe programming.
If Peter Smid's book is the best reference on the topic of CNC Programming, this book certainly is a close second for value. This book's contents are not as advanced as Mr. Smid's work, but it is more than adequate for most students in college, university, and apprentices wishing to learn the trade.

Good job!

Peter Eigler ... Read more

Book Description

Customer Reviews (6)

Avoid this book, droogs
I've taken a first semester Discrete Math course, and am currently taking the second semester of it. I bought this book on a whim, hoping it might supplement my text, or at least clarify a few points. It fails at both of those things. Here's why:

1) Abundant errors: I read the first 15 pages and found at least one *serious* typo per page (i.e. a typo that could impede learning). Plus, the grammar ranges from illegal to ambiguous. Thankfully, I was familiar with all of the material that I was reading -- were I not, severe confusion and discouragement would have been the result.

2) Poor examples: They're too abstract or too simple -- and there aren't even very many of them. Oftentimes, he contradicts what he's trying to illustrate due to a small oversight or typo. It's truly bad.

3) Gratuitous brevity (yes I know that may sound paradoxical): The author uses compound sentences in his definitions; sometimes going as far as to define two or three concepts IN THE SAME SENTENCE! It's infuriating.

4) Chapter Zero: This deserves its own rant section. Chapter zero contains nearly all of the material from the first four chapters of my current textbook: Logic, Set theory, Induction, Relations, etc. Somehow the author crams all of it into about 24 pages (plus 4 or 5 pages of exercises). He fails at clarity or lucidity. It's an ambomination -- it reads like lecture notes (you know, the ones only the professor looks at).

OK -- I WANTED to like this book. It's kind of cute, I'll admit it. And the price is sweet. But friends, you get what you pay for. Even after I came across the first 5 or so serious typos I was willing to forgive. Eventually, the sheer amount of contradictory examples and ambiguous sentences riled me up so much that I considered tearing the book in half. Really. I doubt I'll ever open the thing again.

Excellent Text
As with any Dover text, it is important to remember that this text is designed to teach the material, not to coddle the reader.This text provides broad and deep coverage of the various topics that fall under discrete mathematics (set theory, boolean logic, graph theory, etc.) with clarity and simplicity.This book is not designed to help you pass a test, but is instead designed to help you grasp and understand the topic, which it does very well.Easily the best book I own on this topic (I often joke that the author covered my first semester course on discrete math in the first chapter!).

Too succinct for the discrete novice
I learned much more from the Schaum's Outline (ISBN: 0070380457 -Schaum'sOutline of Theory and Problems of Discrete Mathematics (Schaum's OutlineSeries) by Seymour Lipschutz, Marc Lipson (Contributor), Seymour Lipschultz).

That book overcomes the two shortcomings of this one: for aself-proclaimed introductory work on discrete mathematics, this textcontains too few worked out in-chapter examples, and too many omitted stepsin the reasoning.On this latter point, there were many times my readingbrought me to the phrase "It follows from the definition that..."or "obviously..." when, for me, it didn't follow, or it wasn'tobvious. Contrary to another reviewer's assessment, I found quite a lot oftypos, but none too serious.To its credit, the book does contain a lot ofend-of-chapter problems with solutions, and it is inexpensive.

The authorof the text I review here wrote another in this field, the Schaum's outlineseries offering with ISBN 007003575X, which is not the Schaum's text Irecommend above.I express no opinion on this other work of his.

Near-Useless Garbage
This is an unreadable, low quality text. The theorems and proofs are explained in a ridiculously formal and boring style. I challenge you to read and understand a full page of this book on your first try. Avoid atall costs, and if your professor is using this text, avoid the course atall costs, and try talking some sense into your professor.

Near-Useless Garbage
This is an unreadable, low quality text. The theorems and proofs are explained in a ridiculously formal and boring style. I challenge you to read and understand a full page of this book on your first try. Avoid atall costs, and if your professor is using this text, avoid the course atall costs, and try talking some sense into your professor. ... Read more

Book Description
Category theory is a branch of pure mathematics that is becoming an increasingly important tool in theoretical computer science, especially in programming language semantics, domain theory, and concurrency, where it is already a standard language of discourse. Assuming a minimum of mathematical preparation, Basic Category Theory for Computer Scientists provides a straightforward presentation of the basic constructions and terminology of category theory, including limits, functors, natural transformations, adjoints, and cartesian closed categories. Four case studies illustrate applications of category theory to programming language design, semantics, and the solution of recursive domain equations. A brief literature survey offers suggestions for further study in more advanced texts. Benjamin C. Pierce received his doctoral degree from Carnegie Mellon University.

Contents: Tutorial. Applications. Further Reading. ... Read more

Customer Reviews (7)

Good Introduction
I have been reading several different category theory texts recently, and this one was very succinct and accessible.Particularly useful for understanding functional programming.

Basic crib sheet for category theory
Anyone coming to this book from Pierce's "Types and Programming Languages" will be disappointed. While his "Types ..." book is a model of clear exposition, this book reads like a set of notes jotted down on the back on an envelope. The extensive bibliographic sections are more than fifteen years out of date. Much of the material referenced is no longer in print, and recent developments are, of course, not mentioned. Those seeking a very gentle introduction to category theory would do better with the book by Lawvere and Schanuel, who cover more of category theory than Pierce. Mathematically mature computer science readers will find everything they need to know about the subject in Mac Lane's book.

Really expensive for a set of notes...
You can find better introductions to category theory available on the net for free.And I'm not talking about P2P!Try searching for Lambert Meertens, Marten Fokkinga, and Jaap Van Oosten, for example.

If you have some money to spend, get Barr and Wells, Category Theory for Computing Science.It's a great book, *way* better than this!

Too terse
This is a very short book: 70 pages of text + a bibliography.The first 50 pages are about general category theory, and the last 20 pages are specifically for computer scientists.My interest is in general category theory, and I bought this because I have a BS in CS and thought I'd find plenty of familiar examples.Unfortunately this book doesn't have nearly enough examples.I found it easier to skim some undergrad abstract algebra books in the library (groups, rings, vector spaces) and then continuing with category theory intros written for math students.

the best understaning of categories you can get
This book is tiny in volume but large in contents. It does not only provide the definitions of the fundamental concepts but also clear explanations and motivations of why must everything be defined that way, which are not always found in other texts. Plenty of the right examples help you build the right intuitions. The case studies at the end put everything into context and prepare you for CS texts on semantics, type theory, etc.
If you want to UNDERSTAND this wonderful theory read this book! ... Read more

Book Description

The central problem considered in this book is the determination of rational parametrizability of an algebraic curve, and, in the positive case, the computation of a good rational parametrization. This amounts to determining the genus of a curve, i.e. its complete singularity structure, computing regular points of the curve in small coordinate fields, and constructing linear systems of curves with prescribed intersection multiplicities. Various optimality criteria for rational parametrizations of algebraic curves are discussed.

Book Description
This book provides an elementary "hands-on" presentation of important mathematical logic topics.Explores topics that are at the cutting edge of developments in computer science, while preservingthe integrity of traditional logic. Stresses several self-contained proof systems of interest to mathematical logic, some more suitable than others for particular kinds of questions.For anyone interested in Computer Science or Mathematics. ... Read more

Customer Reviews (2)

A logician from holland
I used this book as a course book and I can say that it is quite difficult to follow the book. All the proofs are either intuitive or very shortwithout much explanation or example. So, if you want to take this book as aguide for this field think twice!

gives basics for automated reasoning
I found this book to be an excellent reference for automated reasoning. It covers resolution and unification in great detail. It also covers Knuth-Bendix procedure for equational logic. I used this book as a startingpoint to learning about automated reasoning and logic in AI.

I recommendthis book for anyone who is just beginning to learn about automatedreasoning.

The one suggestion that I have to anyone reading this book isto review your abstract algebrea and set theory. Although this books doesintroduce and cover abstract algebra basics, anohter reference is useful.As for set theory, try Schaum's Outline on Set Theory as an intro or arefresher. ... Read more

Book Description
Why are mathematical ideas so hard? Is mathematics anunassailable peak, which only the few can ever hope to conquer? Or canmathematics be broadened to be accessible to the many? Noss and Hoyleshave written a book which challenges some of the conventional wisdomson the learning of mathematics. They use the computer as a window ontomathematical meaning-making, drawing together the threads of theirindividual and collaborative research over more than a decade. Thepivot of their theory is the idea of webbing, which explains howsomeone struggling with a new mathematical idea can draw on supportiveknowledge, and reconciles the individual's role in mathematicallearning with the part played by epistemological, social and culturalforces. ... Read more

Book Description
Shape interrogation is the process of extraction of information from a geometric model. It is a fundamental component of Computer Aided Design and Manufacturing (CAD/CAM) systems. The authors focus on shape interrogation of geometric models bounded by free-form surfaces. Free-form surfaces, also called sculptured surfaces, are widely used in the bodies of ships, automobiles and aircraft, which have both functionality and attractive shape requirements. Many electronic devices as well as consumer products are designed with aesthetic shapes, which involve free-form surfaces. This book provides the mathematical fundamentals as well as algorithms for various shape interrogation methods including nonlinear polynomial solvers, intersection problems, differential geometry of intersection curves, distance functions, curve and surface interrogation, umbilics and lines of curvature, geodesics, and offset curves and surfaces. This book will be of interest both to graduate students and professionals. ... Read more

Customer Reviews (1)

A powerful tool for CAD/CAM research & development
Many excellent books analyze models/methods to represent curves and surfaces in Computer-Aided Design &
Manufacturing (CAD/CAM) systems, but this is the first one focusing on solving some very complex geometric
modeling problems underlying many engineering applications. The authors identify these bottleneck problems,
analyze them in detail, and present state-of-the-art solution algorithms. These important problems are:

"Intersection problems" (Chapters 5 and 6), "Distance calculations" (Chapter 7),
"Curve/Surface Interrogation" (Chapters 8 and 9), "Computation of Shortest Paths" (Chapter 10), and
"Offset Curves and Surfaces" (Chapter 11).

In each one of the above chapters, the corresponding problem is fully analyzed using tools from advanced
Geometric Modeling, Numerical Methods and Differential Geometry, some of which are new results previously
available only in research journals. The authors have done an excellent job in collecting all these results in
a single volume, offering an invaluable tool to CAD/CAM professionals who do not have the time to study
and analyze themselves all this literature.

The solutions proposed go beyond standard tricks and heuristics: the problems are formulated as systems
of nonlinear equations and reliable solution-algorithms are offered based either on standard methods or
on fresh research. Robustness issues (accuracy, treatment of special cases, singularities, etc) are at the center
of discussion guiding the reader on dealing with the most difficult aspects of geometric-software development.

In short, this book is a powerful tool for CAD/CAM professionals (software architects/developers,
consultants, engineers/users, academic teachers and researchers, etc) as:
1) Very useful results are analyzed, that alternatively are available only in advanced mathematical texts and current research publications.
2) Problems are discussed in detail using theoretical results as well as examples.
3) Robust solution methods are presented, based on a solid mathematical analysis as opposed to heuristics.
4) All prerequisites are fully analyzed in the first 4 chapters, making the volume self-contained. ... Read more

Book Description
This book starts with an overview of the research of Gröbner bases which have many applications in various areas of mathematics since they are a general tool for the investigation of polynomial systems.
The next chapter describes algorithms in invariant theory including many examples and time tables. These techniques are applied in the chapters on symmetric bifurcation theory and equivariant dynamics.
This combination of different areas of mathematics will be interesting to researchers in computational algebra and/or dynamics. ... Read more

Book Description
"We hope that this small volume will suggest directions ofsynergy and contact for future researchers to build upon,creating connections and making discoveries that will helpexplain some of the many mysteries of computation."

---from the Preface

Finite model theory can be succinctly described as the study oflogics on finite structures. It is an area of research existingbetween mathematical logic and computer science. This area hasbeen developing through continuous interaction withcomputational complexity, database theory, and combinatorics.

The volume presents articles by leading researchers who deliveredtalks at the "Workshop on Finite Models and DescriptiveComplexity" at Princeton in January 1996 during aDIMACS-sponsored Special Year on Logic and Algorithms. Eacharticle is self-contained and provides a valuable introductionto the featured research areas connected with finite modeltheory. ... Read more

Customer Reviews (1)

A nice collection of readable articles
This book consists of seven articles on current research in DescriptiveComplexity and Finite Models.To someone not in the field they can beviewed as pointers to the literature. As such the succeed quite well. Ronald Fagin's article on E-F games inspired me to read articles on thetopic. Bruno Courcelle's article on Graph properties, and the two articleson temporal logic introduced me to these fields and were quite readable. The rest were good too.Overall a good way to learn about this field. ... Read more

Book Description
Best-selling author Nigel Cook's new second edition of Introductory Computers Mathematics provides a complete math course for those learning computer technology. Employing an “integrated math applications” approach, this book reinforces all math topics with extensive applications to show readers the value of math as a tool.Specific chapters in the section on Basic Math discuss fractions; decimal numbers; positive and negative numbers; exponents and the metric system; algebra, equations and formulas; geometry and trigonometry; and logarithms and graphs. Computer Math topics cover analog to digital, number systems and codes, logic gates, Boolean expressions and algebra, binary arithmetic, and an introduction to computers and programming.For individuals preparing for a career in computer technology. ... Read more

Customer Reviews (1)

Introduction to Computer Mathematics!?
I got this book as an assistant for programming and additional mathematics. The book is written more like an introduction to mathematics. It starts with basic fractions, multiplication, and exponents. It briefly covers advanced algebraic expressions and trig. Though the good side of it is that it covers logic gates pretty good. I would suggest buying a series of books instead of one brief one. Whether you are going into computer science or information technology, get something more in depth. ... Read more

Book Description

Customer Reviews (2)

Suitable for a graduate level course
While most computer science departments require their students to take calculus, with few exceptions it is a skill that they will not use. The mathematics used by computer scientists is almost exclusively discrete in nature. In fact, assumptions concerning continuity can often lead to subtle errors in programming, the laws of algebra do not universally apply in computing. This book presents most of the key ideas of discrete mathematics applied to computing and the coverage is thorough and detailed.
It is split into two parts, linear order and graphs, trees and recursion. The emphasis is on detailed problem solving rather than explanations of the foundations. For example, there is a detailed example of a lexicographic bucket sort on page 16. The material is presented using higher level mathematical notation, so it is best suited for graduate level courses. A large number of exercises are included, but no solutions are given.
If you are looking for a text to be used in classes that have significant discrete mathematics prerequisites, then this book is certainly appropriate. It would be best suited for students with a great deal of programming experience.

Excellent reference for data structure algorithm complexity.
This excellent reference has numerous examples, definitions and exercises covering trees, graphs, linked lists etc.This book provides a great companion to any data structures text. ... Read more

Book Description
The rapid rate at which the field of digital picture processing has grown in the past five years had necessitated extensive revisions and the introduction of topics not found in the original edition. ... Read more

Customer Reviews (1)

A classic of image processing!
This is a historic book which helped define the field of image processing. It has clarity and it presents the basic issues in a superb manner. Although it is somewhat dated now, it will still be useful to those who wish to look at the historical development of the field. ... Read more

Book Description
Algorithms for Computer Algebra is the firstcomprehensive textbook to be published on the topic of computationalsymbolic mathematics. The book first develops the foundationalmaterial from modern algebra that is required for subsequent topics.It then presents a thorough development of modern computationalalgorithms for such problems as multivariate polynomial arithmetic andgreatest common divisor calculations, factorization of multivariatepolynomials, symbolic solution of linear and polynomial systems ofequations, and analytic integration of elementary functions. Numerousexamples are integrated into the text as an aid to understanding themathematical development. The algorithms developed for each topic arepresented in a Pascal-like computer language. An extensive set ofexercises is presented at the end of each chapter.
Algorithms for Computer Algebra is suitable for use as atextbook for a course on algebraic algorithms at the third-year,fourth-year, or graduate level. Although the mathematical developmentuses concepts from modern algebra, the book is self-contained in thesense that a one-term undergraduate course introducing students torings and fields is the only prerequisite assumed. The book alsoserves well as a supplementary textbook for a traditional modernalgebra course, by presenting concrete applications to motivate theunderstanding of the theory of rings and fields.
... Read more

Customer Reviews (2)

an excellent treatment
We used this book in an advanced undergraduate/early graduate class in computer algebra.The book provides a concise and rigorous, but very readable introduction to computational algebra theory, with algorithms written in pseudo code.

Assuming proficiency in programming, as further pre-requisite I would suggest an undergraduate course in abstract algebra (or equivalent mathematical maturity) for maximum benefit.

An excellent collection of algorithms, proofs, and advanced introductory material, written in a (comparatively) breezy style.

Clear and understandable, but some bugs
I found this book very useful as a reference while writing a smallcomputer algebra system.It's a definate must-have for all the hordes ofpeople out there who are rewriting subsets of Maple, Mathematica, etc.Theexplanation of the theory is relatively clear and helpful so that anot-so-theory-inclined person (such as myself) can understand the material. The cost of such clarity is a loss of some conciseness so someone wholives and breathes abstract algebra may desire a more esoteric book (likeWinkler's). The biggest flaw of the book are the poorly debuggedalgorithms.Almost every algorithm presented in the book has some sort ofminor flaw with serious reprecussions on correctness.This results in muchfrustration if you're actually trying to implement the algorithms. ... Read more

Book Description
This book is revised and expanded version of the original German text. The arrangement of the material and the structure are essentially unchanged.All remarks in the Preface to the German Edition regarding naming conventions for formulas, theorems, lemmas, and definitions are still valid as are those concerning the arrangement and choice of material. ... Read more

Book Description
This book presents surveys on the theory and practice ofmodeling, specifying, and validating concurrent systems. Itcontains surveys of techniques used in tools developed forautomatic validation of systems. Other papers present recentdevelopments in concurrency theory, logics of programs,model-checking, automata and formal languages theory.

The volume contains the proceedings from the workshop, PartialOrder Methods in Verification, which was held in Princeton, NJ,in July 1996. The workshop focused on both the practical and thetheoretical aspects of using partial order models, includingautomata and formal languages, category theory, concurrencytheory, logic, process algebra, program semantics, specificationand verification, topology, and trace theory. The book alsoincludes a lively e-mail debate that took place about theimportance of the partial order dichotomy in modelingconcurrency. ... Read more

Book Description
In this book, the author presents a new vision of learning through design and production, and describes computer programming as a source of a learning and design power. As means of studying this extended notion of children's programming, the author implemented "Instructional Software Design Projects" to explore the learning that takes place when students develop complete mathematical software products designed for other students in their school. The results demonstrate that the young designers learned not only about mathematics (fractions) and programming (Logo), but also about design and user interfaces, as well as representational, pedagogical, and communicational issues. ... Read more