chengl

I hope we will

here you go. Variance explained by Martin Odersky in his coursera course https://class.coursera.org/progfun-005/lecture/83 (you need to login to watch it). Or the Scala doc http://docs.scala-lang.org/tutorials/tour/variances.html

Cool stuff. But doesn't work for me. It's not saving when I press prefix+Alt+s. Anyone with the same experience?

I'm on MBP, tmux 1.9a.

Many comments suggest to use password managers like lastpass, 1pass, etc. But I think that may not be a good idea: a. What if lastpass/1pass is compromised? b. You have to login to retrieve your password, which is inconvenient.

I think the best solution to this is to make sure your passwords ONLY exist in your head, nowhere else. And to NOT reuse your passwords, you have to create a unique and reasonably strong one for each service.

So how do I remember all these unique and strong passwords? I create an algorithm which takes two parameters as inputs: my username and the domain of the service, it will do some simple manipulation of the inputs and give me a reasonably strong password. Hence, all you need to do is to remember your algorithm and use it to compute your password when you need it. Of course, you want the algorithm simple enough to be done in your head.

still down. Fri Aug 9 17:14:24 SGT 2013

What the author mentioned is longest common SUBSEQUENCE (not substring). And it's true that LCS requires O(n^2) if only need to find ONE LCS, using dynamic programming. But if it's required to find ALL longest common subsequence, it definitely requires higher order. http://en.wikipedia.org/wiki/Longest_common_subsequence_prob...

I agree that the author should post the code he used to benchmark different languages. Otherwise, it's not convincing