Passion is like genius; a miracle.

http://metaoptimize.com/qa/questions/186/ Among these, I’m studying Andrew Ng’s lecture from itunes univ. (It’s also available at youtube.) It’s one of the best lectures on ML.

http://www.ibm.com/developerworks/aix/library/au-sshlocks/index.html Use knock / knockd to configure secret knocking sequence. For example, knock 7000, 8000, and 9000 ports in sequence opens a ssh port at, say, 21978. Until then, 21978 is kept closed. It’s a brilliant idea!

http://bojinov.org/professional/ccs2009-xcs-paper.pdf Attacks on consumer devices with web interfaces, e.g., NAS, by exploiting not-necessarily http protocol, e.g., FTP. As an example, an attacker loads crafted contents via FTP to victims’s web based control panel. When the admin visits the admin web app, it’s owned by the attacker.

Output: Never use new Boolean. new Boolean is an Object and it’s always true. I told you. Object is true! Also, stay away from new Array. Use []. See. new Array is confusing. undefinedundefinedundefinedundefinedundefinedundefinedundefinedundefinedundefinedundefined 1020 [elem1, elem2, …] is obvious. 10 1020

Google Javascript style guide

“3” + 1 : “31” 1 + “3” : “13” But, “3”-1 : 2 “4” / 2 : 2 “2” * 2 : 4 “2” * “2”: 4

http://en.wikipedia.org/wiki/Consistent_hashing A hash scheme that does not affects the entire hash table when a node is inserted or deleted. Machines are assigned to the circular nodes, and if a machine crashes, the keys in the crashed machine are moved to the following node in the circle. This is becoming really popular due to no SQL…

http://en.wikipedia.org/wiki/Gossip_protocol Pairewise periodic comm. based protocol to spread information which resembles the way how gossip spreads among ppl. This protocol assumes a faulty network and decentralized. Epidemic algorithms are the ones that adopt gossip protocol. Simple algorithm w/ cute name.

http://en.wikipedia.org/wiki/Hash_tree A tree where a parent contains hash of it’s children. Likewise, root has hash of all nodes. Useful for contents comparison without downloading entire tree or files. Also useful for file synchronization(e.g., Amazon Dynamo); detect missing files easily and sync.

http://sna-projects.com/blog/2010/06/beating-binary-search/ Instead of just picking the middle, guess the position where the target value appears, and compares the value in the position with the target. This obtains O(loglogN).