I recently gave a presentation to Masters students in the department on my research. It’s probably the longest talk I’ve done on my own work (~50 minutes), so it covers a number of areas: stating why it is I’m doing what I’m doing, the design issues in this area, and an overview of my implementation. You can find handouts of the slides below:
I recently gave a talk at the inaugural SICSA postgraduate conference here in St Andrews. The talk itself is similar to one I gave previously, but with more added on the pressures concept we’ve been thinking about. These slides contain quite a bit of animation, so I’ve put up a link to the powerpoint version as well as the PDF.
During the Talk
I recently gave a talk on the project on a PhD away-day to Lochearnhead, following on from my DBHarvester poster presentation. These trips are always interesting because it’s often the only time you see what your peers in other research groups are doing, and feedback from people working in other areas is always useful.
After the talk we visited the Famous Grouse distillery and went for a brief walk; a good break from typical St Andrews life.
You can download the slides for the talk here: DBHarvester Talk (PDF)
Photos of the Event
The following slides are of a talk I recently gave on Enterprise Java Beans 3.0.
Tutorial Slides (1-Up)
Tutorial Slides (6-Up)
I became interested in Enterprise Java Beans while looking at the various ways companies store and access data. This led to me give this talk to the distributed systems group within the school, describing the various concepts that form a part of the technology, including the Java Persistence API.
The talk itself was interspersed with examples from the O’Reilly EJB 3.0 book, which I’d recommend buying if you’re looking for a more in-depth look at the topic.
I gave this talk at a postgraduate reading weekend in Kingussie. It was heavily based on a previous talk I gave, though with more theory and fewer practical examples of existing systems. You can download PDF copies of the talk below.
I recently gave a talk about the various methods and difficulties of searching over data stored in peer-to-peer systems. You can get PDF copies of it, if you’re interested.
The main focus of the talk was the difference between early peer-to-peer systems such as Gnutella and more recent systems such as PIER which use distributed hash table overlays to achieve a more scalable search capability.