Sample chapter from Don't Make Me Think

Sample chapter from Don't Make Me Think: "Why are things always in the last place you look for them?
Because you stop looking when you find them.
—Children’s riddle"

Great info on usability.

Pressure sensitive keyboard for repeat rate

Would it be helpful to have a pressure sensitive keyboard where the pressure determines the repeat rate (harder=faster, etc)? It seems that it would be especially useful for navigation keys (arrow, page up/down) and keys commonly repeated (enter, backspace, delete, space, tab). Does such a thing exist? Was it tried and how well did it work?

Ex-Google CIO breaks his own security rules | InSecurity Complex - CNET News

Ex-Google CIO breaks his own security rules | InSecurity Complex - CNET News: "But 'it's not security's responsibility to go out there and say 'Users want to use Gmail. Let them use it,'' Johnson added. 'If we decide to use Gmail we need to have a project and treat it in a formal way and pay money to do it right.'"

So are you going to have a project for every website that users might find useful? There is no way that you will keep up and the barrier to using useful websites will significantly hurt productivity.

Beyond the hype: Where open source actually saves you money | The Open Road - CNET News

Beyond the hype: Where open source actually saves you money | The Open Road - CNET News: "One way, as Urlocker points out on his blog, is that open source allows enterprise IT projects to succeed or fail with little risk. You know before you pay anything--if you pay anything--that open-source software is going to work, or not."

"Open source tends to offer best-of-breed solutions that aim to do a limited range of functions well, rather than to be all things to all people."

MIT OpenCourseWare | Electrical Engineering and Computer Science | 6.854J Advanced Algorithms, Fall 2008 | Home

MIT OpenCourseWare |


Electrical Engineering and Computer Science | 6.854J Advanced Algorithms, Fall 2008 | Home: "This is a graduate course on the design and analysis of algorithms, covering several advanced topics not studied in typical introductory courses on algorithms. It is especially designed for doctoral students interested in theoretical computer science."