Differences

This shows you the differences between two versions of the page.

--- ongoing [2011/01/17 17:25] – bil
+++ ongoing [2011/04/18 20:34] (current) – bil
@@ Line 1: / Line 1: @@
 ====== Ongoing projects ======
-====== Leadership Election Among Numbered Agents with Constrained Interactions ======
+No projects are ongoing yet.
-**Student**:  Stephen Voland
+<html><!--
-**Supervisor**:  Patrick Dymond and Michael Jenkin
+====== Acoustic Cues and Self Motion ======
+**Student**:  Evangelos Zotos
+**Supervisor**:  Michael Jenkin
 __Description__
-This project is an examination of the efficiency with which numbered distributed agents are able to elect a leader, given certain constraints.  It builds on the paper 'Efficient Leader Election Among Numbered Agents', by R. Chaturvedi, P. Dymond, and M. Jenkin.
+We are capable of estimating the magnitude of our own self-motion and the relative motion of other objects as we move about in our natural environment. This perception is based on information arising from several sensory modalities including visual, auditory, and physical motion. In general, the perceived distance of self-motion is over-estimated when using visual or physical motion cues solely or even in conjunction, although judgments are more accurate when both cues are available. In other words, the distance we perceive ourselves to have moved is typically greater than the distance we have actually moved. Despite the potential contribution of dynamic auditory localization to the perception of self-motion, few studies have examined the effects on auditory cues on the perception of self-motion and the effect of auditory cues may have on our visual perception and more specifically, our visual motion perception.
-When collections of agents are deployed to solve a problem it can be beneficial to establish a leader among the group. For certain applications it may be desirable to establish this leader in some static manner. For other situations it is desirable to have the group of agents establish the leader themselves. Chatuervedi et al. (2011) developed an algorithm that enables a group of identical agents differentiated only by their unique identification number to elect their own leader. Chaturvedi et al.'s work contained a very simple simulator for a specific algorithm. Ongoing work requires the development of a more sophisticated simulator of this collection of agents, in particular the development of a simulator that allows for systematic evaluation of certain properties of the collection of agents.  It is also desirable to perform a rigorous mathematical analysis of some of the more simpler variants of the existing work.
+The purpose of this project is twofold: i) develop software that will permit conducting of psychophysical experiments that examine audio + visual motion perception, and ii) conduct an experiment that will investigate the interaction of audio + visual cues on our perception of self-motion.  The software will be developed using the Unity Game Development Tool and will be developed to allow for maximum robustness.  More specifically, it will allow for various experimental parameters (rate of acceleration, size of the environment/hallway where the motion takes place, amongst others) to be easily modified thus allowing to investigate their effect on self-motion perception.
+====== Implementation and Analysis of a Non-blocking Chromatic Search Tree ======
+**Student**:  Trevor Brown
+**Supervisor**:  Eric Ruppert
+__Description__
-The project will involve the creation of a simulator which will take parameters for the number of agents, their internal initial state such as arrangement in space, and a function to determine the probability of an interaction between two given agents based on their positions.  In the most straightforward case, all paired interactions would be equally likely, and thus the agents would have no associated positions.  Another case would have the agents spread randomly on a bounded plane, where the probability of a pair interacting would be inversely proportional to the distance between them.  A third would have the agents distributed among rooms, and would allow an agent to communicate only with agents in the same or an adjacent room.  The program will simulate a leadership election using the supplied parameters, and report properties of the simulation including how many interactions were necessary to complete the election, if the election was successful, and actual number of interactions taken for election
+This project seeks to take the theoretical description of the
+non-blocking chromatic search tree that was developed in a
+previous CSE4080 project and produce a Java implementation, then perform
+experiments to test it and compare it with other leading concurrent dictionary structures.
-Theoretical results for such elections will also be determined, and will be compared with the experimental results for mutual validation.
+Additionally, many potential performance improvements and structural or
+algorithmic variations on the aforementioned theoretical description
+were identified during the last project.
+This project would attempt to explore many of these variations to
+further refine the theoretical description, and produce a competitive
+dictionary algorithm.
+In particular, this project would
+provide a dictionary implementation with better
+worst-case performance guarantees than previous
+non-blocking dictionary implementations.
+Finally, the project would attempt to establish formal proofs that the
+structure provides guarantees regarding balance and worst-case performance.
+If time permits, further work will be done towards establishing the
+correctness of the algorithm.
 ====== UCOSP: Development for Encyclopedia of Life ======
@@ Line 53: / Line 81: @@
 More information: [[http://www.eol.org]]
+--> </html>