|
|
|
Publications
- Joseph Kuehn, Charles Lakos, Robert Esser
"A Proposal For Relative Time Petri Nets,"
3rd IEEE International Conference on Software Engineering and Formal Methods,
Koblenz, Germany (September 2005)
- P. J. Ashenden, R. P. Esser and J. Kuehn,
"The Adelaide Rosetta Project: Towards simulation of Rosetta descriptions,"
Proceedings of Forum on Design Languages, Lyon, France (September 2001).
Research History
- 2001:
"System-Level Design Tools using Rosetta."
A one-year research placement also at The University of Adelaide,
this project was aimed at producing proto-type parsing and simulation
tools for a proposed system design language called Rosetta. My work
primarily consisted of producing an initial implementation of the tools
and identifying the unresolved issues within the language encountered
during that process. The parser was based on the JavaCC grammar parser,
and the simulator developed was a standard recursive functional evaluator
with a time-sensitive data store and visualisation toolbox.
- 1999-2000:
"Solving large sparse homogenous systems over GF(2)."
This was my joint Pure Maths & Computer Science honours project at
The University of Adelaide. Completed
within the standard honours year time frame, this project was focused on
exploring the work done by two researchers who were attempting to optimise
the process of finding solutions for massively sparse (very big and mostly empty)
singular binary matricies. In particular, the first paper discussed a
hybrid method based on Krylov sub-spaces to quickly find a single solution
to the matrix. The second paper discussed a further method to "block"
multiple entries in the matrix into a single vector for processing in a single CPU cycle.
The project provided an independant mathematical proof for the
method, and provided a comparison of the efficiency of an implementation
of each of the two methods.
- 1997-1998:
"Optimisation of cosine waveform generation in the digital
synthesis of communication signals."
This was a 3 month summer placement in the CRC-BTN at Curtin University.
The goal of the research was to produce a table of "lookup values" that could
be used to produce a linear approximation to a sine curve. The advantage
of using a linear approximation is the ability to rapidly calculate an analog
signal from a microchip, such as in a Digital-to-Analog Converter (DAC).
The disadvantage of this approach was that the inaccuracies in the signal
produced would create noise within the spectrum of the signal produced.
The aim of this work was to examine which approximation techniques produced
the least interference in the production of the analog signal.
Here is a copy of my presentation
announcement, as I did not retain a personal copy of the working files.
Unfortunately, my time ran out before I was able to perform a further
analysis about an additional method which built the table by attempting
to generate sub-lines that connected exactly at the end points.
Education History
- 2002 - present: PhD in Computer Science at The University of Adelaide (INCOMPLETE). Awarded an Australian Postgraduate Award Scholarship.
- 1999 - 2000: B. Sc. (Maths & CS) Honours (First Class) at The University of Adelaide. Joint Pure Mathematics and Computer Science honours.
- 1996 - 1998: Bachelor of Science (Mathematics & Computer Science) at The University of Adelaide. Qualified for the double majors of Pure Mathematics and Computer Science. Received all three Dean's Certificates. Co-awarded the David Murray Scholarship in Mathematical Sciences.
- 1995: School Dux of Gleeson College. Received four out of five best of subject awards.
|