Hibernate: A Developer's Notebook Review

Average Reviews:

(More customer reviews)This book is not intended as a comprehensive/blow-by-blow tutorial. It is a part of o'reilly's new 'notebook' series which is intended as a VERY brief intro to a new technology for experienced developers.
This book is for folks who are pretty experienced with Java and databases, and its intention is to provide a very high-level fast-paced into to hibernate.
In my opinion, it does these things well. I've got about 9 years experience with Java, and about 15 years with SQL/databases, and about 15 years commercial development experience. I've never used hibernate, and I decided to use it in a project. I'm in a HUGE hurry, and I needed to get up to speed FAST. This book got me there. In this sense, I think the book succeeds very well.
There are plenty of spots where I needed additional help, and a quick web search or a quick jump out to hibernates reference documentation (hibernate.org) was all that was required.
This book does what it intends. If you need hand-holding, detailed instructions, or in-depth tutorials, find another book. (And as far as I know, there aren't any).
:)

Click Here to see more reviews about: Hibernate: A Developer's Notebook


Do you enjoy writing software, except for the database code? Hibernate:A Developer's Notebook is for you.

Database experts may enjoy fiddling with SQL, but you don't have to--the rest of the application is the fun part. And even database experts dread the tedious plumbing and typographical spaghetti needed to put their SQL into a Java program. Hibernate: A Developers Notebook shows you how to use Hibernate to automate persistence: you write natural Java objects and some simple configuration files, and Hibernate automates all the interaction between your objects and the database.You don't even need to know the database is there, and you can change from one database to another simply by changing a few statements in a configuration file.

Hibernate: A Developer's Notebook walks you through the ins and outs of using Hibernate, from installation and configuration, to complex associations and composite types. Two chapters explore ways to write sophisticated queries, which you can express either through a pure Java API, or with an SQL-inspired, but object-oriented, query language. Don't let that intimidate you though: one of the biggest surprises in working with Hibernate is that for many of the common real-world application scenarios, you don't need an explicit query at all.

If you've needed to add a database backend to your application, don't put it off.It's much more fun than it used to be, and Hibernate: A Developer's Notebook shows you why.

Here's what a few reviewers had to say:

"I'm sitting on an airplane after finishing Hibernate: A Developer's Notebook.It's rare to find a book on a new Java technology that you can get through on a domestic flight.That this notebook effectively and succinctly tackles object-relational mapping makes it, and Hibernate, even more impressive.Many books in this category would need to be checked luggage.With this book, you travel first class." --Mike Clark

"A simple persistence framework deserves a simple book, and this one delivers. The examples are well described and easy to understand, yet sophisticated enough to demonstrate Hibernate in a real-world context. Jim, I'm a new fan."--Bruce Tate

About the new Developer's Notebook Series from O'Reilly: Developer's Notebooks are a new book series covering important new tools for software developers.Developer's Notebooks stress example over explanation and practice over theory. They are about learning by doing; by experimenting with tools and discovering what works."All lab, no lecture," with a thoughtful lab partner to guide the way.

Get 28% OFF

Click here for more information about Hibernate: A Developer's Notebook

Read More...

Starting Out with Java: From Control Structures through Data Structures (2nd Edition) (Gaddis Series) Review

Average Reviews:

(More customer reviews)If you're new to programming and are considering which book to buy, it is essential to consider that many good books (such as Head First Java, Core Java, Just Java, and The Java Tutorial) are meant for experienced programmers who need insight into Java's more complicated concepts. These aren't textbooks for students. But Tony Gaddis's books are, and this book is no exception; in fact, it is the best Java textbook I have ever bought. This book is loaded with examples, exercises, case studies, and projects. It has everything from loops to linked lists, and it does not neglect GUIs by placing GUI topics to an optional section at the end of the chapter or in the last chapters of the book. This book will also serve you well as a reference book and as preparation for the SCJP certificate. I have also bought Gaddis's Starting Out with C++ From Control Structures through Objects, 5th Edition, and I am quite willing to recommend, sight unseen, any book that Gaddis writes.

Click Here to see more reviews about: Starting Out with Java: From Control Structures through Data Structures (2nd Edition) (Gaddis Series)

Starting Out with Java: From Control Structures through Data Structures is designed to be used in a 2 or 3 semester/quarter sequence for beginning programmers.Tony Gaddis emphasizes problem-solving and program design by teaching the Java programming language through a step-by-step detailed presentation. He introduces procedural programming early and covers control structures and methods before objects.Students are engaged and have plenty of opportunity to practice using programming concepts through practical tools that include end-of-section and chapter exercises, case studies and programming projects.

Get 27% OFF

Click here for more information about Starting Out with Java: From Control Structures through Data Structures (2nd Edition) (Gaddis Series)

Read More...

Data Structures and Algorithms in C++ Review

Average Reviews:

(More customer reviews)On my bookshelf right now I have 13 books on DS&A using C++. Every time I am in need of a new type of data structure or algorithm, and quickly scan through each of them to determine which seem to have the most relevant information, and also which have useable source-code. Drozdek's book is almost always the book I end up selecting to learn a new topic.
Without a doubt, Drozdek's DS&A book is the most complete and well-written of its kind. It includes a chapter of graphs, which many books surprisingly omit. Also, as of the 3rd edition, it includes a chapter on string matching. As far as I know, this is the *only* C++ DS&A book to dive into this subject.
Surprisingly (because of such a broad-scoped book), the material presented in the string matching chapter is modern and incredibly useful. I found the coverage of suffix tries to be excellent. According to Professor Drozdek (via email correspondence), this chapter is actually a compressed version of what was to be an entire C++ book on string matching. Apparently no publisher would touch such a 'specialized' book. How short-sighted of them!
I work in a research-intensive company focused on developing cutting-edge algorithms to solve difficult modern problems. We do the majority of our coding in C++, which is what originally attracted me to Drozdek's book. Since then, I have referred several colleagues to this book, all of which now use it regularly and are loving it.
My only complaint about this book is that it doesn't discuss primality or random-number generation at all. So many algorithms rely heavily on one or both of these, so I find it strange that this book (and most others) completely ignore them.
As for the reviewer who negatively commented "worst written educational book I have ever read", this person obviously bought Drozdek's book expecting to learn C++ and not DS&A. If you're looking to learn C++, I recommend "C++ Primer Plus (5th Edition)" by Stephen Prata (ISBN: 0672326973). Despite its awkward title and oft-maligned publisher, it really is an excellent book for learning C++ (and also as a reference for an experienced programmer).
Depending on your needs, you might look into supplementing Drozdek's book with Robert Sedgewick's books 'Algorithms in C++'. His books do not go as deep as Drozdek does, but he provides an enormous number of fully implemented algorithms that don't exist in any other C++ DS&A book. Be sure to get the 3rd edition; it is much improved over the 2nd.
Here's a complete TOC of Drozdek's book (3rd edition):
Table of Contents
1. Object-Oriented Programming Using C++
2. Complexity Analysis
3. Linked Lists
4. Stacks and Queues
5. Recursion
6. Binary Trees
7. Multiway Trees
8. Graphs
9. Sorting
10. Hashing
11. Data Compression
12. Memory Management
13. String Matching
Appendices
A: Computing BIG-O
B: Algorithms in the Standard Template Library
C: NP-Completeness


Click Here to see more reviews about: Data Structures and Algorithms in C++

Using the C++ programming language, author Adam Drozdek highlights three important aspects of data structures and algorithms. First, the book places special emphasis on the connection between data structures and their algorithms, including an analysis of the algorithms' complexity. Second, the book presents data structures in the context of object-oriented program design, stressing the principle of information hiding in its treatment of encapsulation and decomposition. Finally, the book closely examines data structure implementation. Overall, this practical and theoretical book prepares students with a solid foundation in data structures for future coursesand work in design implementation, testing, or maintenance of virtually any software system.

Get 43% OFF

Click here for more information about Data Structures and Algorithms in C++

Read More...

An Introduction to Data Structures and Algorithms (Progress in Theoretical Computer Science) Review

Average Reviews:

(More customer reviews)If you have cut your teeth on Donald Knuth's classic three volumes, "The Art of Computer Programming", and you want more detail, at a similar level of complexity, then consider Storer's book.
It delves into lists, recursion, trees, graphs, heaps and sets. Like Knuth, Storer thoughtfully supplies an extensive list of questions at the end of each chapter that will greatly deepen your appreciation of the field if you tackle them. Ok, he doesn't give answers, but think of that as greater incentive on your part to solve them. There are almost 400 questions in the book.
The teaching style is similar to Knuth, in that it has all the rigour needed by an algorithm designer like yourself, without drowning you in epsilon-delta ultra rigour like a pure maths text.
Note that the only code fragments are in pseudocode. This should not be a problem for you. I am assuming you are experienced enough that what you need is understanding of an algorithm, and that manually converting it to code is straightforward and a purely secondary issue.
The take home message is that this is excellent for anyone doing serious programming.

Click Here to see more reviews about: An Introduction to Data Structures and Algorithms (Progress in Theoretical Computer Science)

Data structures and algorithms are presented at the college level in a highly accessible format that presents material with one-page displays in a way that will appeal to both teachers and students. The thirteen chapters cover: Models of Computation, Lists, Induction and Recursion, Trees, Algorithm Design, Hashing, Heaps, Balanced Trees, Sets Over a Small Universe, Graphs, Strings, Discrete Fourier Transform, Parallel Computation. Key features: Complicated concepts are expressed clearly in a single page with minimal notation and without the "clutter" of the syntax of a particular programming language; algorithms are presented with self-explanatory "pseudo-code." * Chapters 1-4 focus on elementary concepts, the exposition unfolding at a slower pace. Sample exercises with solutions are provided. Sections that may be skipped for an introductory course are starred. Requires only some basic mathematics background and some computer programming experience. * Chapters 5-13 progress at a faster pace. The material is suitable for undergraduates or first-year graduates who need only review Chapters 1 -4. * This book may be used for a one-semester introductory course (based on Chapters 1-4 and portions of the chapters on algorithm design, hashing, and graph algorithms) and for a one-semester advanced course that starts at Chapter 5. A year-long course may be based on the entire book. * Sorting, often perceived as rather technical, is not treated as a separate chapter, but is used in many examples (including bubble sort, merge sort, tree sort, heap sort, quick sort, and several parallel algorithms). Also, lower bounds on sorting by comparisons are included with the presentation of heaps in the context of lower bounds for comparison-based structures. * Chapter 13 on parallel models of computation is something of a mini-book itself, and a good way to end a course. Although it is not clear what parallel

Get 48% OFF

Click here for more information about An Introduction to Data Structures and Algorithms (Progress in Theoretical Computer Science)

Read More...

Designing Concurrent, Distributed, and Real-Time Applications with UML Review

Average Reviews:

(More customer reviews)This book provides a practical method to apply the Unified Modeling Language (UML) to design concurrent and distributed software for large systems. While many books have been published to explain the details of the UML notation, this book provides a method, COMET, to approach software design through application of a practical subset of the UML notation. The book contains numerous, extensive case studies and provides pragmatic, useful guidelines to identify distributed subsystems and concurrent tasks from a UML analysis model. The approach described represents a unique and valualbe contribution by the author of this text. Finally, because this book is intended mainly as a text for software design courses, I consulted with a few students who have used this book in a graduate-level software engineering course. All of the students were favorably impressed with the content, clarity, practicality, and detail contained in the book.
Prior to the publication of this text, a software design course based on UML could only be taught using a UML text together with a separate software design text. In this text book, Dr. Gomaa has integrated material from UML and software design in such a form that a software design course can now be taught with this text alone.

Click Here to see more reviews about: Designing Concurrent, Distributed, and Real-Time Applications with UML

In this book, renowned real-time software expert Hassan Gomaa adapts UML to the unique needs of the concurrent, distributed, and real-time applications -- helping developers leverage the powerful flexibility, reliability, and time-to-market benefits associated with UML. Gomaa starts by reviewing the key issues and concepts associated with analysis and design of distributed and real-time applications -- focusing not only on standard object-oriented concepts such as information hiding, classes, and inheritance, but also specialized issues such as finite state machines, concurrent tasks, and real-time scheduling. Next, he introduces the COMET (Concurrent Object Modeling and Architectural Design) Method, a UML-based object-oriented analysis and design method specifically created for concurrent, distributed, and real-time applications. The book presents detailed structuring criteria that assist the designer at every stage of the analysis and design process, and offers exceptional insight into dynamic modeling, concurrency, distributed application design, and performance analysis of real-time designs.Gomaa concludes with several detailed case studies covering a broad range of applications, including systems for banking, e-Commerce, cruise control, factory automation, and more.

Get 20% OFF

Click here for more information about Designing Concurrent, Distributed, and Real-Time Applications with UML

Read More...

Scaling MongoDB Review

Average Reviews:

(More customer reviews)Scaling MongoDB is a short book that focuses on how scaling works on the document centered database of the same name.
The book is an enjoyable introduction to scaling MongoDB.
It begins by defining concepts such as sharding or splitting and in how MongoDB splits data between servers.
Step by step the book guide us in how to implement a database cluster, its configuration and administration.
It is so easy that in less than an hour you can have running a cluster in, for example, Amazon EC2 for testing.
It also offers a few tips on how to configure the database depending on the data you're working in.
This book is not a complete manual or an administration guide and it doesn't want to be on, it only provides us an introduction to mongoDB capabilities.
In short, a simple but useful book.

Click Here to see more reviews about: Scaling MongoDB


Create a MongoDB cluster that will to grow to meet the needs of your application. With this short and concise book, you'll get guidelines for setting up and using clusters to store a large volume of data, and learn how to access the data efficiently. In the process, you'll understand how to make your application work with a distributed database system.

Scaling MongoDB will help you:

Set up a MongoDB cluster through sharding
Work with a cluster to query and update data
Operate, monitor, and backup your cluster
Plan your application to deal with outages

By following the advice in this book, you'll be well on your way to building and running an efficient, predictable distributed system using MongoDB.

Get 4% OFF

Click here for more information about Scaling MongoDB

Read More...

Bundle of Algorithms in C++, Parts 1-5: Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (3rd Edition) (Pts. 1-5) Review

Average Reviews:

(More customer reviews)If you're looking for an exhaustive, upto-date reference/textbook for
fundamental, searching and sorting algorithms, then this is one of
the very best available.
Sedgewick has split his popular book into two volumes, with Graph
algorithms being hifted to the second volume. Moreover, many advanced
topics like computational geometry, fft, number theoretic algorithms
etc, which were introduced in the previous edition, seem to be missing
now - so the breadth of coverage seems to have reduced, which is a pity.
However, the depth has increased instead - i doubt that even Knuth
covers more sorting algorithms ! In particular, there are several
recent algorithms and data structures which are treated in greater
detail here than by Knuth. Of course, Knuth analyses all the
algorithms he presents in rigorous and exhaustive detail, which
this book doesn't.
Moreover, the book has many new algorithms and presents the state of the
art in sorting and searching algorithms, giving it a distinct advantage
over the older books.
Sedgewick makes it very clear in the preface that the emphasis is on
the practical importance of the algorithms, so esoteric algorithms which
are important 'only in theory' may find no mention. Also the emphasis is
more on the design of algorithms than on their analysis.
The number of (exercise!!) problems has multiplied manifold in this edition
to become more than most competing textbooks. Problems are graded by
difficulty level to help you choose the ones relevant to your needs.
The exposition is clear and authoritative - Prof. Sedgewick is a leading
authority in the field of algorithms and a student of Donald Knuth.
He has a gift for making difficult concepts seem simple, and the great
illustrations in the book go a long way in explaining the behaviour of
the algorithms.
For the practising professional, this is an ideal reference, since it'll
help you select the best algorithm for your task without bogging you
down with heavy mathematics.
The reasearcher, on the other hand, may benefit by gaining unique insights
from a master of the area, while using other books for the detailed
analysis of algorithms, including prehaps Sedgewick's own book on the
analysis of algorithms(with Flajolet).
A caveat - the code may not be 'ready to run'. It's better not to rely
on this book to provide you with usable code - if that is what you want,
perhaps the books by Drozdek/Weiss/Heileman/Rowe might be better choices.
If you want C code rather than C++, then the C version of this book is
a good choice, since the code provided is of 'K & R' class and therefore
a delight to read.
Of course, if you're looking for a language independent coverage,
then 'Introduction to algorithms' by Cormen,Leiserson and Rivest is
possibly the best book which combines rigor with comprehensive coverage
of the most important algorithms. Look out for the newly released
second edition.
And if you want a more rigorous and equally exhaustive coverage of
sorting and searching, go for Knuth vol.3 - still the authoritative
reference, though it may require more hard work on the reader's part.
Otherwise, invest in this and you won't be disappointed.

Click Here to see more reviews about: Bundle of Algorithms in C++, Parts 1-5: Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (3rd Edition) (Pts. 1-5)

Software developers and computer scientists have eagerly awaited this comprehensive revision of Robert Sedgewick's landmark texts on algorithms for C++. Sedgewick has completely revamped all five sections, illuminating today's best algorithms for an exceptionally wide range of tasks. This shrink-wrapped package brings together Algorithms in C++, Third Edition, Parts 1-4 and his new Algorithms in C++, Third Edition, Part 5. Together, these books are the most definitive, up-to-date, and practical algorithms resource available. The first book introduces fundamental concepts associated with algorithms; then covers data structures, sorting, and searching. The second book focuses entirely on graphing algorithms, which are critical for a wide range of applications, including network connectivity, circuit design, scheduling, transaction processing, and resource allocation. Sedgewick focuses on practical applications, giving readers all the information, diagrams, and real (not pseudo-) code they need to confidently implement, debug, and use the algorithms he presents. Together, these books present nearly 2,000 new exercises, hundreds of new figures, and dozens of new programs.

Get 23% OFF

Click here for more information about Bundle of Algorithms in C++, Parts 1-5: Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (3rd Edition) (Pts. 1-5)

Read More...

R in a Nutshell: A Desktop Quick Reference Review

Average Reviews:

(More customer reviews)'R in a Nutshell' is the essential introductory book on R. Do not try to learn R without it.
I made two attempts to learn R before purchasing this book. In both previous attempts, I had to abort and use another tool to solve my problem because it was taking me too long to accomplish very simple things in R.
The reason R is hard to learn is that its documentation is organized for statisticians that already know R, but have forgotten a detail or two. There are a few other books on learning R, but they are setup like a college course - complete the entire book and THEN you can actually accomplish something.
R in a Nutshell allows you to get working immediately. Simply lookup what you need to do. The firsts thing I did was load a file and make a histogram. I found that stuff in the section on "Loading Data" and the section on charts. In no time I was making stacked area charts for cohorts. Now R is an essential tool for me - and I haven't even taken the time to learn it well! With this book, I don't have to. I can learn as I go. So I actually use R.
Do not R without it.

Click Here to see more reviews about: R in a Nutshell: A Desktop Quick Reference


What people are saying about R in a Nutshell

"I am excited about this book. R in a Nutshell is a great introduction to R, as well as a comprehensive reference for using R in data analytics and visualization. Adler provides 'real world' examples, practical advice, and scripts, making it accessible to anyone working with data, not just professional statisticians." --Martin Schultz, Arthur K. Watson Professor of Computer Science, Yale University

"R in a Nutshell is an ideal book for getting started with R. Newcomers will find the fundamentals for performing statistical analysis and graphics, all illustrated with practical examples. This book is an invaluable reference for anyone who wants to learn what R is and what is can do, even for longtime R users looking for new tips and tricks." --David M. Smith, Editor of the "Revolutions" blog at REvolution Computing

Why learn R? Because it's rapidly becoming the standard for developing statistical software. R in a Nutshell provides a quick and practical way to learn this increasingly popular open source language and environment. You'll not only learn how to program in R, but also how to find the right user-contributed R packages for statistical modeling, visualization, and bioinformatics.

The author introduces you to the R environment, including the R graphical user interface and console, and takes you through the fundamentals of the object-oriented R language. Then, through a variety of practical examples from medicine, business, and sports, you'll learn how you can use this remarkable tool to solve your own data analysis problems.

Understand the basics of the language, including the nature of R objects
Learn how to write R functions and build your own packages
Work with data through visualization, statistical analysis, and other methods
Explore the wealth of packages contributed by the R community
Become familiar with the lattice graphics package for high-level data visualization
Learn about bioinformatics packages provided by Bioconductor

Get 15% OFF

Click here for more information about R in a Nutshell: A Desktop Quick Reference

Read More...

Data Structures and Algorithms in Java (2nd Edition) Review

Average Reviews:

(More customer reviews)This is an excellent book on data structures and algorithms and would be a great addition to a student's text book. Fortunately Lafore does not dwell on the algorithm analysis as many data structures books do. This is a plus for me, as most texts on the subject get the reader bogged down in the analysis portion of the subject matter. Note: algorithm analysis is a very important subject I just don't believe it should be taught in parallel with data structures to the extent it is. Its easier for me and many others to first learn how to implement data structures and get a feel for their performance then move on to in-depth analysis.
In this book you'll learn the more important data structures without the heavy mathematics many algorithm and data structure books torture readers with. The book is written in very accessible language and the applets really help the inexperienced see the algorithms in action.
As I mentioned this book does not cover algorithm analysis in detail. A step up from this book would be one of Sedgewick's books which provides more detail on the analysis front and some really 'tight' implementations. A good book that focuses on Algorithm Analysis is Intro to Algorithms by Cormen. You better have your math skills up to snuff for the Cormen book however.

Click Here to see more reviews about: Data Structures and Algorithms in Java (2nd Edition)

Data Structures and Algorithms in Java, Second Edition is designed to be easy to read and understand although the topic itself is complicated. Algorithms are the procedures that software programs use to manipulate data structures. Besides clear and simple example programs, the author includes a workshop as a small demonstration program executable on a Web browser. The programs demonstrate in graphical form what data structures look like and how they operate. In the second edition, the program is rewritten to improve operation and clarify the algorithms, the example programs are revised to work with the latest version of the Java JDK, and questions and exercises will be added at the end of each chapter making the book evenmore useful.Educational SupplementSuggested solutions to the programming projects found at the end of each chapter are made available to instructors at recognized educational institutions. This educational supplement can be found at www.prenhall.com, in the Instructor Resource Center.

Get 38% OFF

Click here for more information about Data Structures and Algorithms in Java (2nd Edition)

Read More...

Visualizing Data: Exploring and Explaining Data with the Processing Environment Review

Average Reviews:

(More customer reviews)This book allowed me to quickly create some simple applications using the processing API. So, in that respect, the book was successful. However, the book falls short in three respects.
1) One would expect a book with the title "Visualizing Data" to be crammed with pictures showing many different data visualizations. However, this book has relatively few. Every colleague of mine who passed by my desk and picked up the book had the exact same reaction.
2) The processing language is touted as a means for people unfamiliar with programming to get up to speed with visualization. However, I would be very surprised if anyone with little programming experience would get much out of this book.
3) Don't expect to use this book as a reference for the processing language. It is basically just a collection of half explained examples. Consider for example the function smooth(). This function appears in almost every example but forget about trying to find an explanation of what the function does in the book.
The book is probably worth buying to get up to speed quickly but plan on spending a significant amount of time sifting through the processing.org website and other online resources before being able to get anything non-trivial done. And if you don't already know Java then don't expect to accomplish anything even modestly complex without a lot of outside help.


Click Here to see more reviews about: Visualizing Data: Exploring and Explaining Data with the Processing Environment


Enormous quantities of data go unused or underused today, simply because people can't visualize the quantities and relationships in it. Using a downloadable programming environment developed by the author, Visualizing Data demonstrates methods for representing data accurately on the Web and elsewhere, complete with user interaction, animation, and more. How do the 3.1 billion A, C, G and T letters of the human genome compare to those of a chimp or a mouse? What do the paths that millions of visitors take through a web site look like? With Visualizing Data, you learn how to answer complex questions like these with thoroughly interactive displays. We're not talking about cookie-cutter charts and graphs. This book teaches you how to design entire interfaces around large, complex data sets with the help of a powerful new design and prototyping tool called "Processing". Used by many researchers and companies to convey specific data in a clear and understandable manner, the Processing beta is available free. With this tool and Visualizing Data as a guide, you'll learn basic visualization principles, how to choose the right kind of display for your purposes, and how to provide interactive features that will bring users to your site over and over. This book teaches you:

The seven stages of visualizing data -- acquire, parse, filter, mine, represent, refine, and interact
How all data problems begin with a question and end with a narrative construct that provides a clear answer without extraneous details
Several example projects with the code to make them work
Positive and negative points of each representation discussed. The focus is on customization so that each one best suits what you want to convey about your data set
The book does not provide ready-made "visualizations" that can be plugged into any data set. Instead, with chapters divided by types of data rather than types of display, you'll learn how each visualization conveys the unique properties of the data it represents -- why the data was collected, what's interesting about it, and what stories it can tell. Visualizing Data teaches you how to answer questions, not simply display information.

Get 37% OFF

Click here for more information about Visualizing Data: Exploring and Explaining Data with the Processing Environment

Read More...

Cloud Application Architectures: Building Applications and Infrastructure in the Cloud (Theory in Practice (O'Reilly)) Review

Average Reviews:

(More customer reviews)All it talks about is Amazon's EC2, S3, MapReduce. It does not talk about "Application Architecture". It does not have ideas about how to break up traditional programs into MapReduce paradigm. It should be called Cloud Operations Architecture. If it was named by that title, I'd give it 5 stars. The book itself is not bad, but it will get obsolete very quickly due to its specificity to Amazon.
subtitle should be :Building Applications and Infrastructure in Amazon Cloud

Click Here to see more reviews about: Cloud Application Architectures: Building Applications and Infrastructure in the Cloud (Theory in Practice (O'Reilly))


If you're involved in planning IT infrastructure as a network or system architect, system administrator, or developer, this book will help you adapt your skills to work with these highly scalable, highly redundant infrastructure services. While analysts hotly debate the advantages and risks of cloud computing, IT staff and programmers are left to determine whether and how to put their applications into these virtualized services. Cloud Application Architectures provides answers -- and critical guidance -- on issues of cost, availability, performance, scaling, privacy, and security. With Cloud Application Architectures, you will:



Understand the differences between traditional deployment and cloud computing
Determine whether moving existing applications to the cloud makes technical and business sense
Analyze and compare the long-term costs of cloud services, traditional hosting, and owning dedicated servers
Learn how to build a transactional web application for the cloud or migrate one to it
Understand how the cloud helps you better prepare for disaster recovery
Change your perspective on application scaling

To provide realistic examples of the book's principles in action, the author delves into some of the choices and operations available on Amazon Web Services, and includes high-level summaries of several of the other services available on the market today.Cloud Application Architectures provides best practices that apply to every available cloud service. Learn how to make the transition to the cloud and prepare your web applications to succeed.

Get 34% OFF

Click here for more information about Cloud Application Architectures: Building Applications and Infrastructure in the Cloud (Theory in Practice (O'Reilly))

Read More...

Data Structures in Java Review

Average Reviews:

(More customer reviews)As a student who completed a data structures course using this book, I believe that I can offer a review that has special insight that might be lacking in a typical review.
Overall, the book is very solid, and it accomplishes its purpose. Standish takes a naturally abstract topic and provides numerous visuals and models to help the student visualize ADT's. Without these models, a data structures book would not only be extremely dry, but also difficult to follow. This is certainly the book's strong point. There is no doubt in my mind that Standish is a great teacher of data structures because of this. Also noteworthy is the setup of the book. Recursion, a difficult but essential topic in computer science, is covered early on. For the CS2 programmer, recursion can be very difficult at times, and it is critical that the reader understands the value of incorporating this technique into ADT programs. In addition, chapter 5 covers modularity and information hiding, which partially introduces the essence behind ADT's. I think this is a great placement of this chapter, because when we get into real ADT's, like Stacks and Queues, we understand the purpose of ADT's: all we need to know now is the operations that Stacks and Queues have to offer. In short, this placement of the chapters allows for quick and easy understanding of a subject that is not concrete by definition. Another good point is its sorting chapter, which covers almost any sorting and searching algorithm you could think of, including Radix Sort and ProxMap sort, which are difficult, if not impossible, to find in other data structures books.
The only negative point about the book is the price. For its price, the books should be 50-100 pages longer. And by that, I don't mean extending long appendices, which contribute to the mediocre thickness of the book already. When I finished the book, I thought I got most of what data structures in computer science had to offer. But I was dead wrong. I found another book (I don't recall the author) that covered trees which I never heard of, and other advanced ADT's like binomial queues. Sorry, you won't find anything like this in this book. In addition, there just aren't enough exercises offered in this book that present any real challenge. That may be up to the ability level of the programmer, but in most exercises, all that is required to complete them is just a simple modification of a source code example. That, in my judgment, is not enough if one wants to build up any skills in programming.
In conclusion, the book may have its shortcomings, particularly in its length, but overall, its fabulous explanations of an obscure topic more than make up for any faults. This book is excellent for an intro to data structures ONLY!

Click Here to see more reviews about: Data Structures in Java

Using Java 1.1, this book teaches the fundamentals of data structures and algorithms. With this exciting new language, Tim Standish takes a fresh look at the subject matter. New challenges arise any time a new language is used, and the author meets these challenges. For example, although Java is a language without explicit pointers, this book offers pointer diagrams to help students visualize, reason about, and understand this major Data Structures topic. Standish's clear presentation helps readers tie the many concepts of data structures together with recurring themes. Central ideas-such as modularity, levels of abstraction, efficiency, and tradeoffs-serve as integrators in the book in order to tie the material together conceptually and to reveal its underlying unity and interrelationships.

Click here for more information about Data Structures in Java

Read More...

Object-Oriented Discrete-Event Simulation with Java - A Practical Introduction (SERIES IN COMPUTER SYSTEMS (previously: The Plenum Series in Computer (Series in Computer Science) Review

Average Reviews:

(More customer reviews)Some of the concepts were new to me and some were not. The old ideas were the ones that I came across in a first Java programming course or in a discrete-event simulation course. Book is easy to read, concise, not a textbook. Useful for someone that has not studied anything about discrete-event simulation.

Click Here to see more reviews about: Object-Oriented Discrete-Event Simulation with Java - A Practical Introduction (SERIES IN COMPUTER SYSTEMS (previously: The Plenum Series in Computer (Series in Computer Science)

This book introduces the application of the Java programminglanguage in discrete-event simulation. In addition, the fundamentalconcepts and practical simulation techniques for modeling differenttypes of systems to study their general behavior and their performanceare introduced. The approaches applied are the process interactionapproach to discrete-event simulation and object-oriented modeling.Java is used as the implementation language and UML as the modelinglanguage. The first offers several advantages compared to C++, themost important being thread handling, graphical user interfaces (GUI),and Web computing. The second language, UML (Unified ModelingLanguage), is the standard notation used today for modeling systems asa collection of classes, class relationships, objects, and objectbehavior. The book concentrates on object-oriented modeling andimplementation aspects of simulation models using Java and practicalsimulation techniques. In addition, the book illustrates the dynamicbehavior of systems using the various simulation models as casestudies.

Click here for more information about Object-Oriented Discrete-Event Simulation with Java - A Practical Introduction (SERIES IN COMPUTER SYSTEMS (previously: The Plenum Series in Computer (Series in Computer Science)

Read More...

Access Database Design & Programming (3rd Edition) Review

Average Reviews:

(More customer reviews)In Access Database Design & Programming, the author uses very mathematical and academic language. The database design part of the book is focused on the mathematical theory of relational databases. The programming part of the book is a reference work to programming with VBA.
All parts of the relational database in Access will be mathematically defined and proven. It will have a name you most probably will find confusing, and far from what you are used to from the Access interface. Apparently the author follows the naming standards established in the academic world to prove the algebra. After all, he is a professor of Mathematics !
In the programming part of the book you will be introduced to the DDL, DML and DCL components included in Access. Also, these components will probably be completely unknown to you, if you have no previous programming experience. Further, the book makes use of DAO as opposed to ADO.
The book is perfect for someone, who has completed courses in Computer Science, Programming and Algebra, or with the equivalent knowledge and a mathematical/academic way of thinking. They will be able to read through the book in a fast pace, and immediately make use of Access at a high level.
If your background is different, I would recommend another approach to database design and programming. For database design, I recommend "Inside Relational Databases" by Whitehorn and Marklyn (ISBN 354076092X). To learn programming I recommend "Learn to Program with VB 6" by John Smiley (ISBN1902745000).
This book is going to split its readers in two groups: The mathematically and academic minded who will love the book for its concise language. And the "grass roots" among the Access users/developers, who will be looking for database samples or VBA code snippets to learn from, and find none.
You will probably ask yourself if you need to know this much theory and detail. But remember, a relational database operates purely on mathematics. It is difficult and tiresome to learn, but your reward will be well worth the effort.

Click Here to see more reviews about: Access Database Design & Programming (3rd Edition)


Access Database Design & Programming takes you behind the details of the Access interface, focusing on thegeneral knowledge necessary for Access power users or developers to create effective database applications. When using software products with graphical interfaces, we frequently focus so much on the interface that we forgetabout the general concepts that allow us to understand and use the software effectively. In particular, this bookfocuses on three areas:
Database design. The book provides an enjoyable, informative overview of database design thatcarefully shows you how to normalize tables to eliminate redundancy without losing data. Queries. The book examines multi-table queries (i.e.,various types of joins) and shows how toimplement them indirectly by using the Access interface or directly by using Access SQL. Programming. The book examines the VBA integrated development environment (IDE). It then goes onto provide an excellent introduction to Data Access Objects (DAO), ActiveX Data Objects (ADO), and ADO Extensions for Data Definition and Security (ADOX). These sections serve as a handy introduction and primer for basicdatabase operations,such as modifying a table under program control, dynamically adding and deleting a record,and repositioning a record pointer. The concluding chapter focuses on common programming problems, such ascomputing running sums and comparing two sets.
Unlike other Access books that take the long, detailed approach to every topic of concern to Access programmers,Access Database Design &Programming instead focuses on the core concepts, enabling programmers to developsolid, effective database applications. This book also serves as a 'second course' in Access that provides arelatively experienced Access user who is new to programming with the frequently overlooked techniques necessaryto develop successfully in the Microsoft Access environment.
Anyone interested in learning Access in depth, rather than just scraping the surface, will enjoy and benefitimmensely from reading this book.

Get 35% OFF

Click here for more information about Access Database Design & Programming (3rd Edition)

Read More...

Developing Software with UML: Object-Oriented Analysis and Design in Practice (2nd Edition) Review

Average Reviews:

(More customer reviews)Surely this book is not the absolute reference for the UML. Someone seeking for such a book, should check up on: "The Unified Modeling Language User Guide", "The Unified Modeling Language Reference Manual" both by the 3 amigos, and "UML Distilled, Second Ed." by Martin Fowler et al.
I gave 5 stars because, to my opinion, the author has catched the main need of someone who uses the UML for the first time; to design/develop software. Formalizations and abstractions are absolutely necessary in real applications, but really destructing during the first steps simply because anything usefull is interspersed in several chapters. On the other hand, the coverage of both the UML and the OO S/W development in this book is definitely not shallow.
"Developing Software with UML" is perhaps the best choise for beginning with UML. It is well-structured, intuitive and easy.

Click Here to see more reviews about: Developing Software with UML: Object-Oriented Analysis and Design in Practice (2nd Edition)

Practical guide to exploiting the power of Object Technology & UML in your software development process.

Get 15% OFF

Click here for more information about Developing Software with UML: Object-Oriented Analysis and Design in Practice (2nd Edition)

Read More...

The Object Constraint Language: Precise Modeling With Uml (Addison-Wesley Object Technology Series) Review

Average Reviews:

(More customer reviews)First, I like this book. I trust about every line of it. It is itself precise or at least as precise as possible. It summarizes things in a concise and complete way. Required prior knowledge is UML (of course). I'd recommend Fowler's beautiful UML distilled and also even more important a solid understanding of design by contract. I recommend the complete book of Bertrand Meyer "Object Oriented Software Construction". Yes I know its many month of reading.
The problem with this OCL book is the following: It is difficult to understand anything not prior understood. However once one has a grasp of understanding this book is really clarifying. So, it requires in many areas more maturity in the field than most of us including me have. So, I would wish a book, which starts of at a somewhat lower level, in a less dry diction.

Click Here to see more reviews about: The Object Constraint Language: Precise Modeling With Uml (Addison-Wesley Object Technology Series)

Click here for more information about The Object Constraint Language: Precise Modeling With Uml (Addison-Wesley Object Technology Series)

Read More...

Domain-Specific Modeling: Enabling Full Code Generation Review

Average Reviews:

(More customer reviews)This book is excellent. It deals with why we need domain specific modeling (DSM), starting off with business value- then defines DSM and provides an architecture for it - the language, the models, code generation, a framework and the process that connects all of these. It follows this with 5 detailed case studies and then towards the end talks about uses and tools.
I enjoyed reading it and am planning to implement in my projects. The authors are associated with a tool that does DSM - Metaedit+ found at metacase dot com and which has a trial download.

Click Here to see more reviews about: Domain-Specific Modeling: Enabling Full Code Generation

"[The authors] are pioneers. . . . Few in our industry have their breadth of knowledge and experience."—From the Foreword by Dave Thomas, Bedarra Labs
Domain-Specific Modeling (DSM) is the latest approach to software development, promising to greatly increase the speed and ease of software creation. Early adopters of DSM have been enjoying productivity increases of 500–1000% in production for over a decade. This book introduces DSM and offers examples from various fields to illustrate to experienced developers how DSM can improve software development in their teams.
Two authorities in the field explain what DSM is, why it works, and how to successfully create and use a DSM solution to improve productivity and quality. Divided into four parts, the book covers: background and motivation; fundamentals; in-depth examples; and creating DSM solutions. There is an emphasis throughout the book on practical guidelines for implementing DSM, including how to identify the necessary language constructs, how to generate full code from models, and how to provide tool support for a new DSM language. The example cases described in the book are available the book's Website, www.dsmbook.com, along with, an evaluation copy of the MetaEdit+ tool (for Windows, Mac OS X, and Linux), which allows readers to examine and try out the modeling languages and code generators.
Domain-Specific Modeling is an essential reference for lead developers, software engineers, architects, methodologists, and technical managers who want to learn how to create a DSM solution and successfully put it into practice.

Get 16% OFF

Click here for more information about Domain-Specific Modeling: Enabling Full Code Generation

Read More...