ARRAY(0xaab1a8c4)
 
Profil de Willy Van den Driessche > Commentaires

Fiche d'identité

Contenu rédigé par Willy Van den ...
Classement des meilleurs critiques: 35.458
Votes utiles : 15

Chez vous : découvrez nos services personnalisés en pages d'aide !

Commentaires écrits par
Willy Van den Driessche (Belgium)
(VRAI NOM)   

Afficher :  
Page : 1 | 2 | 3 | 4 | 5 | 6
pixel
What a Plant Knows: A Field Guide to the Senses
What a Plant Knows: A Field Guide to the Senses
par Daniel Chamovitz
Edition : Relié
Prix : EUR 21,61

4.0 étoiles sur 5 A palnt knows more than you expect, 14 octobre 2013
Achat authentifié par Amazon(De quoi s'agit-il ?)
Ce commentaire fait référence à cette édition : What a Plant Knows: A Field Guide to the Senses (Relié)
I found this a delightful book. It focusses on the senses and has a look on what plants have to do for each of them. It is a scientific work with many surprising facts. I was also happy that the myth of the "plants listening to mozart" was finally debunked.


AOP in .NET
AOP in .NET
par Matthew D Groves
Edition : Broché
Prix : EUR 38,13

5.0 étoiles sur 5 PostSharp and Castle, 14 octobre 2013
Achat authentifié par Amazon(De quoi s'agit-il ?)
Ce commentaire fait référence à cette édition : AOP in .NET (Broché)
This book gives a very good oevrsight of techniques that are available to .NET programmers to practice AOP. Even though there is obviously a chance for this to outdate quickly, I would still advise it because it goes beyond simple existing technologies and also focusses on principles.


The Strangest Man: The Hidden Life of Paul Dirac, Quantum Genius
The Strangest Man: The Hidden Life of Paul Dirac, Quantum Genius
par Graham Farmelo
Edition : Broché
Prix : EUR 10,43

5.0 étoiles sur 5 A correct title, 14 octobre 2013
Achat authentifié par Amazon(De quoi s'agit-il ?)
Ce commentaire fait référence à cette édition : The Strangest Man: The Hidden Life of Paul Dirac, Quantum Genius (Broché)
I didn't know Dirac (except from name) before this book. There is no doubt that Dirac was a genius and a very dedicated person to his cause. It's very enlightning to learn about his family life to provide clues in which way he was traumatizes by his father, mother and the suicide of his brother. It once again shows that a beautiful theory comes from a beautiful mind but not necessarily from a good person (I wouldn't want to live with him).


The Parrot's Theorem
The Parrot's Theorem
par Denis Guedj
Edition : Broché
Prix : EUR 15,34

4.0 étoiles sur 5 Nice, 6 juillet 2013
Achat authentifié par Amazon(De quoi s'agit-il ?)
Ce commentaire fait référence à cette édition : The Parrot's Theorem (Broché)
This is a fictional book about an old men that inherits a library of mathematical books. Together with his cohabitants they try to solve some problems and in doing so they visit the history of mathematics.


Candide
Candide
par Voltaire
Edition : Poche
Prix : EUR 2,90

5.0 étoiles sur 5 Comical, 6 juillet 2013
Achat authentifié par Amazon(De quoi s'agit-il ?)
Ce commentaire fait référence à cette édition : Candide (Poche)
I'm not a native french speaker so this book took some character to read (not all of the french words are easy). This edition has the advantage of explaining all the references voltaire makes. If find this a very commical book and I highly recommend it to anyone.


Counting on Frameworks: Mathematics to Aid the Design of Rigid Structures
Counting on Frameworks: Mathematics to Aid the Design of Rigid Structures
par Jack E. Graver
Edition : Broché
Prix : EUR 22,21

5.0 étoiles sur 5 Beautiful mathematics, 6 juillet 2013
Achat authentifié par Amazon(De quoi s'agit-il ?)
The title of the book is a little bit misleading for a computer expert. In this book frameworks are really frameworks, not the computer science equivalent of it. The question is : what makes a framework rigid. We start up from the one-dimensional case up to the 2-dimensional case of grids and further up. The mathematics behind this question is very beautiful and can be grasped by anybody who does the effort. The mathematical theorems that come out are elegant and a little surprising. Highly recommended.


Algorithms For Interviews: A Problem Solving Approach
Algorithms For Interviews: A Problem Solving Approach
par Adnan Aziz
Edition : Broché

4.0 étoiles sur 5 Some sparkling examples, 1 février 2013
Achat authentifié par Amazon(De quoi s'agit-il ?)
Ce commentaire fait référence à cette édition : Algorithms For Interviews: A Problem Solving Approach (Broché)
There might be a debate on what a candidate has to know to "pass" an interview. If -like me- you are convinced that some algorithmic thinking should be displayable then you should read this book to have some good ideas on (currently) novel questions to ask your candidates. The examples are very good and can catually be done during an interview. In the end - all you want to know is that the canidate was delivered "with the batteries" and this book can help you set up part of your interviews.


Cloud Architecture Patterns
Cloud Architecture Patterns
par Bill Wilder
Edition : Broché
Prix : EUR 19,15

1 internaute sur 1 a trouvé ce commentaire utile :
5.0 étoiles sur 5 Software architect : read this, 1 février 2013
Achat authentifié par Amazon(De quoi s'agit-il ?)
Ce commentaire fait référence à cette édition : Cloud Architecture Patterns (Broché)
This is a very good book on what a technical architect needs to care about when writing cloud applications. The exposition is on an abstract level and the author clearly explains which patterns there are and when you should use them. The patterns are applicable to both Microsoft Azure and Amazon S3 services. All patterns matter and none of them are exotic or far fetched. the use of a fcititious example application (PoP) helps in seeing when to apply the pattern. As a technician I would have loved some code snippets to get a taste of the flavor of code that these patterns require but that's just my opinion. I have only one advice to anyone serious in cloud development : read this.


A = B
A = B
par Donald E. Knuth
Edition : Relié
Prix : EUR 45,78

5.0 étoiles sur 5 A comprehensible book about a difficult topic., 16 décembre 2012
Achat authentifié par Amazon(De quoi s'agit-il ?)
Ce commentaire fait référence à cette édition : A = B (Relié)
This is a beautiful book about a very beautiful topic. The authors - and inventors of the algorithm - take their time to describe what is a hypergeometric series; what approaches don't work and finally, what does work. Just like generatingfunctionology this is a book that deserves to be read by everyone interested.


Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
par Mark de Berg
Edition : Relié
Prix : EUR 35,13

5.0 étoiles sur 5 Beautiful contents in a beautiful book, 11 décembre 2012
Ce commentaire fait référence à cette édition : Computational Geometry: Algorithms and Applications (Relié)
I've always been interested in algorithms. Since it has been a while since I graduated, I bought this book in order to have an update on the status of several problems. This is a fantastic book. The layout is very gentle and it makes for easy reading (not everything is easy but that's not the point). The authors illustrate the crucial steps of most algorithms with nice accompanying illustrations. Care has been taken to keep th eillustrations with the text.
But the contents itself is also beautiful. It starts with algorithms to compute the convex hull of a set of points, to compute intersection points for a set of line segments, ... Here the authors introduce the "sweeping line" approach, an approach that was new to me and a pleasure to learn. It doesn't stop there, they continue for triangulation of polygons (the art gallery problem), linear programming, orthogonal range checking, point location, ... Point location is done through a very very clever partitioning into trapezoids. The algorithm is not simple but the authors take their time to gently point out how it works.
This is the way (mathematics) books ought to be. A warm thank you to the authors.


Page : 1 | 2 | 3 | 4 | 5 | 6