Compare Prices | Customer Reviews | Auctions | Forums | Links

Before buying Robotics computation, it makes good sense to search for customer reviews. The following might help. By reading robotics computation reviews, you can often get some valuable experiences and advice. This is great prior to buying! :-) Remember, while you might be thinking Books or gadgets or whatever, robotics computation might exist in other formats as well. Here are some reviews for you to check out if available. Books | Toys | Electronics | | A Mathematical Introduction to Robotic Manipulation Customer Reviews — [1] Rating: 4 Date: 2008-03-11 Summary: Good starting book ... The cool thing about this book is that it is heavy on the Math based primarily on the research on mathematical theory in robotics(may I say at Caltech). Make sure you read up your advanced math books especially on manifold theory to get a better understanding as to what it all means. But overall, the math is fun and interesting. Highly recommend this book with Craig's introduction to robotics. ...more [2] Rating: 4 Date: 2005-03-01 Summary: a branch of applied maths ... For decades, physics and engineering undergraduates have used texts on classical mechanics that often contained what some students might consider to be abstruse ideas, with little everyday usage. But this book on robotics is a worthy rejoinder. It can be regarded as an advanced text in classical mechanics. It shows how mathematical treatments of rigid and non-rigid body rotations and displacements are necessary to correctly model robot manipulators. Plus how holonomic constraints can be used to determine system behaviour. ...more Editorial Reviews — ... Product Description | A Mathematical Introduction to Robotic Manipulation presents a mathematical formulation of the kinematics, dynamics, and control of robot manipulators. It uses an elegant set of mathematical tools that emphasizes the geometry of robot motion and allows a large class of robotic manipulation problems to be analyzed within a unified framework. The foundation of the book is a derivation of robot kinematics using the product of the exponentials formula. The authors explore the kinematics of...more Algorithmic Foundations of Robotics Customer Reviews — [1] Rating: 4 Date: 2000-05-10 Summary: Almost 5! ... Top-level robotics research involves many disciplines: kinematics, dynamics, control, and programming. A growing number of researchers see the key to unifying these diverse fields in robot algorithms -mathematical descriptions linking perception and motion that can operate in the real world to achieve goals. This collection features articles by top-level scientists in theoretical computer science, computational geometry, robotics, perception, artificial intelligence, and mechanical engineering. They present robotics ...more [2] Rating: 4 Date: 2000-05-10 Summary: Almost 5! ... Top-level robotics research involves many disciplines: kinematics, dynamics, control, and programming. A growing number of researchers see the key to unifying these diverse fields in robot algorithms -mathematical descriptions linking perception and motion that can operate in the real world to achieve goals. This collection features articles by top-level scientists in theoretical computer science, computational geometry, robotics, perception, artificial intelligence, and mechanical engineering. They present robotics ...more [3] Rating: 4 Date: 2000-05-10 Summary: Almost 5! ... Top-level robotics research involves many disciplines: kinematics, dynamics, control, and programming. A growing number of researchers see the key to unifying these diverse fields in robot algorithms -mathematical descriptions linking perception and motion that can operate in the real world to achieve goals. This collection features articles by top-level scientists in theoretical computer science, computational geometry, robotics, perception, artificial intelligence, and mechanical engineering. They present robotics ...more Editorial Reviews — ... Product Description | Robotics involves the combined application of numerous disciplines, including kinematics, dynamics, control and programming. Many researchers see algorithms as an underlying core concept which assimilates these diverse areas into a unique, unified field of study. Robot algorithms, specifically, are abstractions describing motion and perception acts that when executed in the real world achieve goal arrangements of physical objects. Using this mathematical concept as its consolidating theme,...more Design and Implementation of Symbolic Computation Systems: International Symposium, DISCO '96, Karlsruhe, Germany, September 18-20, 1996. Proceedings (Lecture Notes in Computer Science) Editorial Reviews — ... Product Description | This book presents the refereed proceedings of the Fourth International Symposium on Design and Implementation of Symbolic Computation Systems, DISCO '96, held in Karlsruhe, Germany, in September 1996. The volume includes four invited contributions surveying the state of the art in a particular subfield or pointing to some new research directions together with 31 revised full papers selected from a total of some 70 submissions. Many current aspects of mathematical software systems, as...more Highly parallel computer architecture for robotic computation, awards abstract (SuDoc NAS 1.71:NPO-17632-1 CU) Evolutionary Computations Editorial Reviews — ... Product Description | Evolutionary computation, a broad field that includes genetic algorithms, evolution strategies, and evolutionary programming, has proven to offer well-suited techniques for industrial and management tasks - therefore receiving considerable attention from scientists and engineers during the last decade. This monograph develops and analyzes evolutionary algorithms that can be successfully applied to real-world problems such as robotic control. Although of particular interest to robotic...more Books | Toys | Electronics | | Please click here to continue your search. Books | Toys | Electronics | | Please click here to continue your search. Books | Toys | Electronics | | Introduction to Automata Theory, Languages and Computation (Addison-Wesley Series in Computer Science) Customer Reviews — [1] Rating: 4 Date: 2008-05-15 Summary: Very nice book ... I read this book from cover to cover, not because it was required by the Formal Languages course that I took, but because it is a very good read. This book gives all the necessary details in every theorem that it proves, which can be considered both a good and a bad thing, depending on your level of knowledge of the subject. I personally believe it is a good thing, because after reading any proof in this book you do not feel skeptical if it works or not, like it can be after reading a proof that skips lots of steps. ...more [2] Rating: 4 Date: 2008-06-25 Summary: The best theoretical computer science book out there. ... This book is a one stop solution to your theoretical computer science needs (at least, as an introduction). If you're interested in language theory, deterministic / non deterministic finite state automata design, grammars and regular languages, computational complexity (temporal and spatial complexity), this the book for you. The formal notation used in the book is not the heaviest ever seen for this kind of subject, so it remains comprehensible (assumed it's not your first exposition to this discipline). I found it ...more [3] Rating: 5 Date: 2008-12-11 Summary: Advanced? First Edition Only of 1979 ... My first exposure to Automata Theory backs to 1992, as a senior undergrad textbook for that course, which was mandatory and a prerequisite to the Compilers Course. (No student could take them together unless Automata was repeated). Although I got the highest grade among over 80 students, but I was not getting enough comprehension from the class, as it should be. I admit it was due to the complexity and sophistication of that text, since this was the first course that 100% dedicated to computational theory; taking into ...more Editorial Reviews — [1] ... Review | This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity. The authors present the theory in a concise and straightforward manner, with an eye out for the practical applications. Exercises at the end of each chapter, including some that have been solved, help readers confirm and enhance their understanding of the material. This book is appropriate for upper-level computer science undergraduates who are comfortable with mathematical...more [2] ... Product Description | This classic book on formal languages, automata theory, and computational complexity has been updated to present theoretical concepts in a concise and straightforward manner with the increase of hands-on, practical applications. This new edition comes with Gradiance, an online assessment tool developed for computer science. Gradiance is the most advanced online assessment tool developed for the computer science discipline. With its innovative underlying technology, Gradiance turns basic...more Automata and Computability (Undergraduate Texts in Computer Science) Customer Reviews — [1] Rating: 5 Date: 2005-11-02 Summary: Rigorous, clear, and concise ... I started learning the theory of computation using Sipser's excellent textbook. The goal of his book is to show students "the big picture" of the area by explaining the materials in an intuitive manner. However, when I was reading the first two chapters of his book (i.e. on finite automata), often times I found myself asking questions like "why does this automaton recognize that language, as Sipser claimed?". Sometimes, Sipser gives only intuitive explanations to justify his claim, which in my opinion is not sufficient. ...more [2] Rating: 4 Date: 2000-12-04 Summary: Clear and Concise ... This book is an excellent introduction to the subject. There is also material that can be taught to students more advanced than the beginning undergraduate. We used this book for one half (roughly) of a first-year grad course on foundations of computer science. The greatest strengths of the book are (1) its exceptionally clear writing. (2) Excellent collection of problems (with hints and solutions to a subset of these). This book follows the "standard" approach to the introduction of notion of effective computability ...more [3] Rating: 5 Date: 2003-04-04 Summary: Very good as a textbook ... This is the textbook I used for my Honors Introduction to Theory of Computing course which was taught by Kozen. This book is very well organized, each chapter corresponds exactly to one lecture, so it's almost like a collection of lecture notes in a sense. This book (and the course it's based on) provides a very good introduction to general theoretical aspects of computing. It's divided mainly into 3 sections, each covering a third of the course. First Finite Automata, then Context Free Languages and Pushdown Automata, ...more Editorial Reviews — ... Product Description | The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop some of the model's rich and varied structure. Students who have already some experience with elementary discrete mathematics will find this a well-paced first course. A number of supplementary chapters introduce more advanced concepts. The first part of the book is devoted to finite automata and their properties. Pushdown automata provide...more Computational Geometry: Algorithms and Applications Customer Reviews — [1] Rating: 5 Date: 2008-12-31 Summary: The definitive guide to computational geometry. ... When studying computer science, one will encounter a number of books. "The Dinosaur Book", Operating System Concepts (7th Edition), "The White Book", Introduction to Algorithms, "The Green Book", Artificial Intelligence: A Modern Approach (2nd Edition) (Prentice Hall Series in Artificial Intelligence), and a select few more. The best way to articulate my satisfaction with this material is to refer to it as "The Blue and Yellow Book." Each chapter is introduced with a problem. For example, "How would one install cameras ...more [2] Rating: 5 Date: 2007-11-10 Summary: A very nice introduction to the field ... The authors did a great job of introducing the reader to all the important aspects of the field of computational geometry while keeping it simple and understandable. ...more [3] Rating: 4 Date: 2006-02-24 Summary: good source of many methods ... The authors amass an impressive array of algorithms related to finding geometrical properties. Where these algorithms are performed on a computer. The book itself does not advocate any particular programming language. The algorithms are given in pseudocode, and you are expected to manually convert these to code in your choice of language. Given the calibre of the discussion in the text, which suggests that the readers are quite experienced, then this manual step should be easy to most. There are numerous contexts in ...more Editorial Reviews — ... Product Description | This well-accepted introduction to computational geometry is a textbook for high-level undergraduate and low-level graduate courses. The focus is on algorithms and hence the book is well suited for students in computer science and engineering. Motivation is provided from the application areas: all solutions and techniques from computational geometry are related to particular applications in robotics, graphics, CAD/CAM, and geographic information systems. For students this motivation will...more A Mathematical Introduction to Robotic Manipulation Customer Reviews — [1] Rating: 4 Date: 2005-03-01 Summary: a branch of applied maths ... For decades, physics and engineering undergraduates have used texts on classical mechanics that often contained what some students might consider to be abstruse ideas, with little everyday usage. But this book on robotics is a worthy rejoinder. It can be regarded as an advanced text in classical mechanics. It shows how mathematical treatments of rigid and non-rigid body rotations and displacements are necessary to correctly model robot manipulators. Plus how holonomic constraints can be used to determine system behaviour. ...more [2] Rating: 4 Date: 2008-03-11 Summary: Good starting book ... The cool thing about this book is that it is heavy on the Math based primarily on the research on mathematical theory in robotics(may I say at Caltech). Make sure you read up your advanced math books especially on manifold theory to get a better understanding as to what it all means. But overall, the math is fun and interesting. Highly recommend this book with Craig's introduction to robotics. ...more Editorial Reviews — ... Product Description | A Mathematical Introduction to Robotic Manipulation presents a mathematical formulation of the kinematics, dynamics, and control of robot manipulators. It uses an elegant set of mathematical tools that emphasizes the geometry of robot motion and allows a large class of robotic manipulation problems to be analyzed within a unified framework. The foundation of the book is a derivation of robot kinematics using the product of the exponentials formula. The authors explore the kinematics of...more Introduction to Discrete Event Systems Customer Reviews — [1] Rating: 5 Date: 2008-06-04 Summary: Pretty good balance of breadth and depth ... This book has everything from basics to more complicated maths. It also comes with algorithms which then can help you implement the theory you just learned. ...more [2] Rating: 5 Date: 2008-10-26 Summary: Discrete Event Systems 2nd Edition - REVIEW ... The book arrived in good condition and ready to use. I paid this book with my VISA credit card and didn't have any problem. I recommend everyone to buy this book on Amazon.com ...more [3] Rating: 5 Date: 2000-05-25 Summary: Introduction to discrete event systems ... This book is a great textbook for students who are interested in the control engineering field. Due to the difficulty, it is more focused for graduate students. This book has won the 1999 harold chestnut prize awarded by the International Federation of Automatic Control (IFAC). The topics are language and automata theory, supervisory control, Petri net theory, (max,+) algebra, Markov chains and queueing theory, discrete-event simulation, perturbation analysis, and concurrent estimation techniques. This book is used ...more Editorial Reviews — ... Product Description | Introduction to Discrete Event Systems is a comprehensive introduction to the field of discrete event systems, offering a breadth of coverage that makes the material accessible to readers of varied backgrounds. The book emphasizes a unified modeling framework that transcends specific application areas, linking the following topics in a coherent manner: language and automata theory, supervisory control, Petri net theory, Markov chains and queuing theory, discrete-event simulation, and...more Cellular Automata Machines: A New Environment for Modeling (Scientific Computation) Customer Reviews — [1] Rating: 5 Date: 1999-09-01 Summary: Oh my god, what a book! ... This book is absolutely stunning. It's a little dated, but the classes of problems that Toffoli and Margolus attack with dirt-simple machines is completely astonishing. I guarantee that you will not be able to put it down -- which is odd to say about a computer book. Read it! ...more [2] Rating: 5 Date: 2001-12-17 Summary: buy for the ideas, not the implementation ... This is a terrific book that takes a step-by-step approach to cellular automata, especially for modelling. Within the first two chapters I had already found several interesting ideas for improving my own general-purpose automata program. The part of the book that is most dated is the discussion of a specific hardware card and software designed for IBM PCs and ATs, and a specific dialect of Forth that can be used to program automata that will run on this card. Obviously this is no longer the mainstream approach to programming ...more [3] Rating: 5 Date: 2007-01-29 Summary: The best I've found on the subject - with a few caveats ... Of all of the books that delve into the details of cellular automata, the algorithms, and the kinds of problems you can solve with them, this is probably the best I've found. However, there are two major problems you will have to work around. First, there is the specialized and long defunct CAM computing environment. You simply have to not read the portions of the book that talk about it to get around this, and I found this a minor problem. A more major problem is that this old 1987 book is using Forth as a programming ...more Editorial Reviews — ... Product Description | Recently, cellular automata machines with the size, speed, and flexibility for general experimentation at a moderate cost have become available to the scientific community. These machines provide a laboratory in which the ideas presented in this book can be tested and applied to the synthesis of a great variety of systems. Computer scientists and researchers interested in modeling and simulation as well as other scientists who do mathematical modeling will find this introduction to cellular...more Books | Toys | Electronics | | Introduction to Automata Theory, Languages and Computation (Addison-Wesley Series in Computer Science) Customer Reviews — [1] Rating: 4 Date: 2008-06-25 Summary: The best theoretical computer science book out there. ... This book is a one stop solution to your theoretical computer science needs (at least, as an introduction). If you're interested in language theory, deterministic / non deterministic finite state automata design, grammars and regular languages, computational complexity (temporal and spatial complexity), this the book for you. The formal notation used in the book is not the heaviest ever seen for this kind of subject, so it remains comprehensible (assumed it's not your first exposition to this discipline). I found it ...more [2] Rating: 4 Date: 2008-05-15 Summary: Very nice book ... I read this book from cover to cover, not because it was required by the Formal Languages course that I took, but because it is a very good read. This book gives all the necessary details in every theorem that it proves, which can be considered both a good and a bad thing, depending on your level of knowledge of the subject. I personally believe it is a good thing, because after reading any proof in this book you do not feel skeptical if it works or not, like it can be after reading a proof that skips lots of steps. ...more [3] Rating: 5 Date: 2008-12-11 Summary: Advanced? First Edition Only of 1979 ... My first exposure to Automata Theory backs to 1992, as a senior undergrad textbook for that course, which was mandatory and a prerequisite to the Compilers Course. (No student could take them together unless Automata was repeated). Although I got the highest grade among over 80 students, but I was not getting enough comprehension from the class, as it should be. I admit it was due to the complexity and sophistication of that text, since this was the first course that 100% dedicated to computational theory; taking into ...more Editorial Reviews — [1] ... Review | This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity. The authors present the theory in a concise and straightforward manner, with an eye out for the practical applications. Exercises at the end of each chapter, including some that have been solved, help readers confirm and enhance their understanding of the material. This book is appropriate for upper-level computer science undergraduates who are comfortable with mathematical...more [2] ... Product Description | This classic book on formal languages, automata theory, and computational complexity has been updated to present theoretical concepts in a concise and straightforward manner with the increase of hands-on, practical applications. This new edition comes with Gradiance, an online assessment tool developed for computer science. Gradiance is the most advanced online assessment tool developed for the computer science discipline. With its innovative underlying technology, Gradiance turns basic...more Automata and Computability (Undergraduate Texts in Computer Science) Customer Reviews — [1] Rating: 5 Date: 2003-04-04 Summary: Very good as a textbook ... This is the textbook I used for my Honors Introduction to Theory of Computing course which was taught by Kozen. This book is very well organized, each chapter corresponds exactly to one lecture, so it's almost like a collection of lecture notes in a sense. This book (and the course it's based on) provides a very good introduction to general theoretical aspects of computing. It's divided mainly into 3 sections, each covering a third of the course. First Finite Automata, then Context Free Languages and Pushdown Automata, ...more [2] Rating: 4 Date: 2000-12-04 Summary: Clear and Concise ... This book is an excellent introduction to the subject. There is also material that can be taught to students more advanced than the beginning undergraduate. We used this book for one half (roughly) of a first-year grad course on foundations of computer science. The greatest strengths of the book are (1) its exceptionally clear writing. (2) Excellent collection of problems (with hints and solutions to a subset of these). This book follows the "standard" approach to the introduction of notion of effective computability ...more [3] Rating: 5 Date: 2005-11-02 Summary: Rigorous, clear, and concise ... I started learning the theory of computation using Sipser's excellent textbook. The goal of his book is to show students "the big picture" of the area by explaining the materials in an intuitive manner. However, when I was reading the first two chapters of his book (i.e. on finite automata), often times I found myself asking questions like "why does this automaton recognize that language, as Sipser claimed?". Sometimes, Sipser gives only intuitive explanations to justify his claim, which in my opinion is not sufficient. ...more Editorial Reviews — ... Product Description | The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop some of the model's rich and varied structure. Students who have already some experience with elementary discrete mathematics will find this a well-paced first course. A number of supplementary chapters introduce more advanced concepts. The first part of the book is devoted to finite automata and their properties. Pushdown automata provide...more Computational Geometry: Algorithms and Applications Customer Reviews — [1] Rating: 4 Date: 2006-02-24 Summary: good source of many methods ... The authors amass an impressive array of algorithms related to finding geometrical properties. Where these algorithms are performed on a computer. The book itself does not advocate any particular programming language. The algorithms are given in pseudocode, and you are expected to manually convert these to code in your choice of language. Given the calibre of the discussion in the text, which suggests that the readers are quite experienced, then this manual step should be easy to most. There are numerous contexts in ...more [2] Rating: 5 Date: 2007-11-10 Summary: A very nice introduction to the field ... The authors did a great job of introducing the reader to all the important aspects of the field of computational geometry while keeping it simple and understandable. ...more [3] Rating: 5 Date: 2007-06-13 Summary: Excellent Background ... This book is extremely well written, easy to understand, and actually is the standard text for Computational Geometry classes, as far as I know. The only thing I didn't like about it was that there seemed to be a few errors in some of the pseudocode. But, it's to be expected when publishing a textbook, and I think it'll probably be cleared up in future editions. Overall, great book. I'd recommend it to anyone taking graphics or a computational geometry class. ...more Editorial Reviews — ... Product Description | This well-accepted introduction to computational geometry is a textbook for high-level undergraduate and low-level graduate courses. The focus is on algorithms and hence the book is well suited for students in computer science and engineering. Motivation is provided from the application areas: all solutions and techniques from computational geometry are related to particular applications in robotics, graphics, CAD/CAM, and geographic information systems. For students this motivation will...more A Mathematical Introduction to Robotic Manipulation Customer Reviews — [1] Rating: 4 Date: 2008-03-11 Summary: Good starting book ... The cool thing about this book is that it is heavy on the Math based primarily on the research on mathematical theory in robotics(may I say at Caltech). Make sure you read up your advanced math books especially on manifold theory to get a better understanding as to what it all means. But overall, the math is fun and interesting. Highly recommend this book with Craig's introduction to robotics. ...more [2] Rating: 4 Date: 2005-03-01 Summary: a branch of applied maths ... For decades, physics and engineering undergraduates have used texts on classical mechanics that often contained what some students might consider to be abstruse ideas, with little everyday usage. But this book on robotics is a worthy rejoinder. It can be regarded as an advanced text in classical mechanics. It shows how mathematical treatments of rigid and non-rigid body rotations and displacements are necessary to correctly model robot manipulators. Plus how holonomic constraints can be used to determine system behaviour. ...more Editorial Reviews — ... Product Description | A Mathematical Introduction to Robotic Manipulation presents a mathematical formulation of the kinematics, dynamics, and control of robot manipulators. It uses an elegant set of mathematical tools that emphasizes the geometry of robot motion and allows a large class of robotic manipulation problems to be analyzed within a unified framework. The foundation of the book is a derivation of robot kinematics using the product of the exponentials formula. The authors explore the kinematics of...more Introduction to Discrete Event Systems Customer Reviews — [1] Rating: 5 Date: 2000-05-25 Summary: Introduction to discrete event systems ... This book is a great textbook for students who are interested in the control engineering field. Due to the difficulty, it is more focused for graduate students. This book has won the 1999 harold chestnut prize awarded by the International Federation of Automatic Control (IFAC). The topics are language and automata theory, supervisory control, Petri net theory, (max,+) algebra, Markov chains and queueing theory, discrete-event simulation, perturbation analysis, and concurrent estimation techniques. This book is used ...more [2] Rating: 5 Date: 2008-06-04 Summary: Pretty good balance of breadth and depth ... This book has everything from basics to more complicated maths. It also comes with algorithms which then can help you implement the theory you just learned. ...more [3] Rating: 5 Date: 2008-10-26 Summary: Discrete Event Systems 2nd Edition - REVIEW ... The book arrived in good condition and ready to use. I paid this book with my VISA credit card and didn't have any problem. I recommend everyone to buy this book on Amazon.com ...more Editorial Reviews — ... Product Description | Introduction to Discrete Event Systems is a comprehensive introduction to the field of discrete event systems, offering a breadth of coverage that makes the material accessible to readers of varied backgrounds. The book emphasizes a unified modeling framework that transcends specific application areas, linking the following topics in a coherent manner: language and automata theory, supervisory control, Petri net theory, Markov chains and queuing theory, discrete-event simulation, and...more Cellular Automata Machines: A New Environment for Modeling (Scientific Computation) Customer Reviews — [1] Rating: 5 Date: 1999-09-01 Summary: Oh my god, what a book! ... This book is absolutely stunning. It's a little dated, but the classes of problems that Toffoli and Margolus attack with dirt-simple machines is completely astonishing. I guarantee that you will not be able to put it down -- which is odd to say about a computer book. Read it! ...more [2] Rating: 5 Date: 2001-12-17 Summary: buy for the ideas, not the implementation ... This is a terrific book that takes a step-by-step approach to cellular automata, especially for modelling. Within the first two chapters I had already found several interesting ideas for improving my own general-purpose automata program. The part of the book that is most dated is the discussion of a specific hardware card and software designed for IBM PCs and ATs, and a specific dialect of Forth that can be used to program automata that will run on this card. Obviously this is no longer the mainstream approach to programming ...more [3] Rating: 5 Date: 2007-01-29 Summary: The best I've found on the subject - with a few caveats ... Of all of the books that delve into the details of cellular automata, the algorithms, and the kinds of problems you can solve with them, this is probably the best I've found. However, there are two major problems you will have to work around. First, there is the specialized and long defunct CAM computing environment. You simply have to not read the portions of the book that talk about it to get around this, and I found this a minor problem. A more major problem is that this old 1987 book is using Forth as a programming ...more Editorial Reviews — ... Product Description | Recently, cellular automata machines with the size, speed, and flexibility for general experimentation at a moderate cost have become available to the scientific community. These machines provide a laboratory in which the ideas presented in this book can be tested and applied to the synthesis of a great variety of systems. Computer scientists and researchers interested in modeling and simulation as well as other scientists who do mathematical modeling will find this introduction to cellular...more Hope you find it useful! And do feel free to let your friends know this free resource site... it is always evolving. [ Return to top ]