Updated 12/3/2000
I am junior CIS major here at Ohio State University working on my Bachelor of Science. Some of you who read the Lantern might recognize me from my weekly columns. I've also got a web page at http://www.whipworm.com/, where you can read all of my columns and try to discover the connection between celebrity, technology, and intestinal parasites.
During Winter quarter of 2001, I'll be in Brisbane, Australia for what amounts to a working vacation. No doubt I'll end up with some boring job, but heck, it'll be a boring job in Australia. If you're interested, regular updates, thoughts, and photographs will be posted at http://www.foolsinparadise.com/. After I get back from OZ, I'll be starting a co-op with IBM in Rochester, Minnesota for Spring and Summer quarters. When I'm there, I'll be writing software that will simulate and debug a new microprocessor that they're developing. What all of this amounts to, at least in terms of EUROPA, is that I won't be seeing many of you for a long time and that I probably won't get much independent research done. But it should be an excellent learning experience and a chance to experience a bit more of the real world. And when I return to the greater OSU-land area in - gasp - September, I'll be rededicated to pursuing my studies and research.
Research
Interests
Current
Projects
Completed
Projects Return to
EuropaI am primarily interested in AI and networks. But haven't actually started looking into ways to do develop these interests.
In the long term, I plan to study AI, networks, and the possible connection between the two. The synthesis of those two fields might yield interesting results, especially as the internet evolves and develops its ability to process massive amounts of data. I'll keep all of you posted as to what I'm thinking about and where this idea is going..
I am working on an implementation of Sequence that uses balanced binary trees for the representation. This allows for O(log n) time to data items with the accessor. The project also highlights the strengths of the Balanced Binary Tree algorithm developed by Scott Pike.
I've also started reading up on XML. (Interesting stuff. It might have a future...)
Undirected_Graph: Work has pretty much wrapped up on the Undirected Graph Component. I implemented the Adjacency Matrix and the Adjacenty List implementations of the component. Shawn Craft should be writing up our conclusions shortly, but my work with it is essentially done.
Dr Ryo's Revenge: This isn't really something I've done formally with Europa, but did over the summer on my own. It's just a side-scrolling arcade type game.