9/16/2002: Somebody suggested there should be a Google toolbar that runs with any browser and takes up very little screen space. So I wrote one.
12/30/2001: I posted some software I've written. It's a backup program for Windows, for backing up to a CD-RW, network, or Zip drive. It's Freeware, go ahead and try it out, if you like. Just be forewarned, I can't offer much support. Download it here.
11/6/2001: My Cryptography paper is online, titled PGP: An Algorithmic Overview.
6/1/2000: Updated my resume.
3/2000: Despite the fact that my RIT Singers CD is fully legal, I cannot prove it, and so it must be taken down. More details here.
7/1999: Now that I'm looking for a co-op, I should probably have my resume on-line. Here it is, in a web-friendly format.
11/1998: Good god. Somebody threw away an incredible about of category-5 cable. I have it. Grand total: 4,348 feet. That's 83% of a mile. Picture
9/1998: Last year (Spring '98), the RIT Singers recorded their spring concert for a CD. I have ripped the CD and compressed it into MP3 format. Don't worry, it is legal to copy these MP3s, as RIT Singers does not hold any copyrights. Heck, the CD I bought was a CD-R. Anyway, this page contains the entire CD insert with links to the songs.
8/1998: At home, I have a coaxial network cable running between my house and the house next door. During the summer, it appears that lightning struck the cable. It fried my power supply, blew out the first comm. port on my motherboard (I moved COM1 to the second connector), and fried the network card. Here's a cool pic of the damage to the network card. The actual card now holds an honored place among the circuit boards I use for posters.
5/1997: I am the very proud owner of a rack mount cabinet. The CS Department was going to throw it away, so I asked if I could have it. They almost threw away a piece of equipment that is worth about $1,800.00. You can see some pictures of my cabinet (1.2.3).
4/1997: I wrote an algorithm to solve the traveling salesman problem, using the 48 state capitols as data. (The goal of the traveling salesman problem is to find the shortest path that visits everywhere in the system, and then returns to where it started from.) After running billions of mutations, I think I may have found the answer. Look at my tours of the U. S. page.