Hi. I am in my fourth and final (undergraduate) year at The Ohio State
University, pursuing a B.S. in computer science and engineering. I have
worked on the Europa Research Group since it was formed in AU97. On the
epsilon chance that I am not in the computer lab or the library, you can
find me visiting with my friends and family, lap swimming, or reading a
Jane Austen novel. Click here
to visit my personal homepage.
Research Interests Current
Projects Completed
Projects Return
to EuropaThe focus of my research has been on algorithms. I have explored ways
to improve or maximize the usage of already existing algorithms (Dijkstra's
Least Cost Path Algorithm) and created new ones (Recasting Median Computation.)
I am currently working with the OSU Industrial Systems Engineering
Department to research more effiicient solutions to algorithms used in
designing factory layouts.
PFAST, a software package being developed by the OSU Industrial Systems Engineering Department, is currently in need of new and more effiicient algorithms for computations on factory layouts. I am currently working with Dr. Shahrukh Irani (IWSE), Dr. Bruce Weide (CIS), and Smart Khaewsukkho (IWSE) on the algorithms for these NP-complete problems.
Ratnamala Bearavolu and I developed
a Statistics_Machine component, in concept, much like the RESOLVE Sorting_Machine
component. During this process, we noticed that the time to compute the
median was very slow. We developed a new algorithm which drastically improved
performance* over any other median algorithm we know to exist. *Note: The
case for performance improvement is where the user repeatedly finds the
median in a real-time application, not a single batch run.
Ratna and I presented our findings on the real-time median algorithm at
the Ohio State Undergraduate Research Forum in May 1999. For future work,
Ratna and I are working on developing an "intelligent" median
algorithm which switches between the real-time and batch median computations
depending on how the user is using it.
Jen Kannen and I presented the results
of our studies on Least_Cost_Path_Machines at the Ohio State Undergraduate
Research Forum in May 1998. In our "Efficiency Studies on Varying
Implementations of a Least_Cost_Path_Machine", we studied the effects
of computational procrastination on a graph theory problem.
Last modified: Th Sept 30 12:12:04 EST 1999