Readings

• Read the design of everyday things
• make a login page for myself on the agora wiki

• finish mythical man month
• read the design of everyday things
• read knuth books
• 2007-01-10: Read McKeachie? : Tips about Teaching
• The Mathematician, Jon Von Neumann.
• Never Eat Alone, by brock's recomentations.
• Gilbert strang - Eric likes him, others don't
• lookup Vandervorst and Greenbaum w/r/t iterative methods. (ask Olson for more details)

• Run through examples on http://www.selenic.com/mercurial/wiki/
• lookup the inverse function theorem
• lookup a tutorial on Earlang
• lookup map reduce
• lookup http://www.gdconf.com/news/tracks/programming/dragged_kicking_and_screaming_1.htm
• lookup how folding @ home works.
• is there a good theoretical analysis of what kind of problems are seperable and parallelizable?
• lookup Ninja - numerically intensive Java, set up by Padua.
• look up inspector-executor library
• lookup spingali, compiling sparse array codes at run time.
• lookup syncronization relaxation
• lookup chaotic relaxation
• look up symplextic methods. (force splitting?)
• strousden matrix multiplication
• multi-frontal iterative solver
• element by element iterative solver
• lookup projective integrators
• lookup and namd manual
• look into multi-stacks, a way to use previous stack information as a tree
  • branch predictions? Is this similar?
• look into mathematical load balancer analysis
• experiment converting everything over to svn
• lookup ucair here at uiuc, volunteer for search data
  • find out wheither the ucair toolbar runs in firefox, offer to port if not.
• lookup things to store searches, categorize them like in RecordedSearches
  • del.ico.us ?
• read 43folders.com
• Papers for parallel language analyis
  • Stanford - fix efficiency, parallelize Hennesy
• lookup hamiltonian systems, understand
• lookup pandora radio 2007-01-09
• 2007-01-10: lookup Tesla
• 2007-01-12: lookup fravia+ again, see what has changed.
• 2007-01-13: lookup DC++
• From Neuman, read on 1-24-2007: A database which would allow one conveniently and quickly to extract shortest paths between scientists in this way might have some practical use. Kautzetal.[60] have constructed a web-based system which does just this for computer scientists, with the idea that such a system might help to create new professional contacts by providing a “referral chain” of intermediate scientists through whom contact may be established.
• lookup power law networks
• lookup DSpace, relates to publication databases.
• lookup temporal logic.
• lookup trillinos
• look into Joost for watching video on my mac.
• lookup david patterson
• lookup cmu graduate student seminars.
• look into xfig/omingraffle
• lookup an online book (on archive.org) for P Wesseling, An Introduction to Multigrid Metods, Wylie 1992
• check to see if there is a math wiki with proofs and textbook-type information.
• preconditioning for Navier stokes