http://herbsutter.com/elements-of-modern-c-style/ 좋은글이 있어서 올립니다. 책하나 빨리 내주셨음 좋겠네요. 전체 새로운 feature 목록은 http://www2.research.att.com/~bs/C++0xFAQ.html에 있습니다.

http://i.stanford.edu/~ullman/mmds.html It’s a free ebook in pdf. At first, I just shared the link on twitter without reading it. Later, after reading some chapters, I realized that this book covers algorithms for massive data sets really nicely. Some concepts, for example, combiner(ch2), shingling and minhashing (ch3), bloom filter(ch4), association rules(ch6), etc., are must know concept…

http://instagram-engineering.tumblr.com/post/10853187575/sharding-ids-at-instagram Use time + shard id + autoincrement.

http://www.oracle.com/us/corporate/events/java7/index.html The page also has pdf files on java7 new features. Among them fork-join is really exciting.  I’ll definitely use them in the next java project as much as I can.

I found these good articles on modern algorithms for password hashing: http://www.f-secure.com/weblog/archives/00002095.html suggest the following three: • PBKDF2 • Bcrypt • PBMAC Most notably, they are intended to be slow (so that bruteforce takes long time) and prevent rainbow table attack. http://www.openwall.com/phpass/ is php implementation to use bcrypt. Read http://www.openwall.com/articles/PHP-Users-Passwords for explanation. Here’s another article…

Essential JavaScript Design Patterns For Beginners by Addy Osmani is a minibook published online. Let me quote ‘Revealing Module Pattern’ code snippet which I find very neat. Compare it with module pattern. I really enjoyed reading it. In addition to the design pattern article, you may like to read my articles on some javascript patterns:…

Spearman’s rank correlation coefficient is a non parametric measure of statistical dependence between variables. Unlike Pearson correlation coefficient which assumes linear dependence, Spearman’s rank correlation does not have such assumptions. It uses the same formula to get the coefficient, but it uses ‘rank(position in the descending order)’ of x and y.

Parzen Windows(wiki) is a non-parametric density estimation method given samples. Though the name sounds scary (it was, at least to me), it’s not that complicated algorithm. It just considers samples near x for computing p(x). For example, to compute p(x=1), it considers samples near it, e.g., 0, 3, 4 while it ignores samples far from…

클라우드가 인기를 끌면서 사람들은 애플만 이야기하지만, 실은 구글에는 이미 Google Storage for Developers 같은 포텐셜 넘치는 서비스가 있죠. 과금도 벌써 정해져 있습니다. 클라우드의 핵심 역활중 하나는 이처럼 개발자나 사업자가 scalable하게 자신의 서비스를 발전시켜나갈 수 있다는 점입니다. 오늘 서비스를 런칭하고 내일 사용자가 몰려 서버가 죽어나갈필요 없이 간단히 최소의 비용으로 용량을 확대해 나갈 수 있는 것이죠. 몇년전만해도…