Differences

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

--- ongoing [2011/03/22 15:19] – bil
+++ ongoing [2017/04/24 20:50] (current) – dymond
@@ Line 1: / Line 1: @@
-====== Ongoing projects ======
+====== Previous projects ======
+======Distributed leader election for simple robots======
+**Supervisors**: Professors Michael Jenkin and Patrick Dymond
+**Project**: How should a group of autonomous agents moving within multiple locations choose and maintain a leader to coordinate and control them?
+Utilizing the concept of an infection algorithm — a process much like the spread of a disease in which agents infect each other with
+information — it is possible to develop a probabilistic approach to this kind of leader election problem. Solutions to this type of problem finds wide application in distributed computing, and in particular distributed computing of autonomous agents and sensors which must compute information about control structures with limited information about the presence/absence of potential leaders in the environment.
-====== Acoustic Cues and Self Motion ======
+To make this project more specific, and given the limited time available for an undergraduate student project, this project will explore certain properties of leader election algorithms, both with real and simulated  groups of robots.  Using a simulator, performance bottlenecks in the infection algorithm will be studied, considering cases where direct communication is limited to agents in the same local area. Simulations will be supported using a collection of real devices (Android devices) who can communicate with each other in the local environment using bluetooth and/or WIFI.
+If time permits, the project will also study possible  enhancements of the infection algorithm as well as develop better upper bounds for the problem.
-**Student**:  Evangelos Zotos
+**Required skills**: knowledge of Java or Python. Interest in algorithms for a distributed collection of simple robot agents. Completion of 3rd year courses in computer science or computer engineering.
-**Supervisor**:  Michael Jenkin
+======Asynchronicity in infection algorithms======
+**Supervisors**: Professors Michael Jenkin and Patrick Dymond
+**Project**: How does changing the model of synchronization changing run time bounds on infection algorithms?
+Infection algorithms are a class of algorithms within which individual agents exchange information via infection. That is, the algorithm proceeds by the various agents transmitting (infecting) each other with information. Under an assumption of synchronization — that is, a model in which no two agents can infect each other at precisely the same time — it is possible to derive models of expected time until all agents have been infected. But how does this algorithm adapt when agents can actually infect each other simultaneously?  This project will explore this problem. First, a simple simulation algorithm will be implemented to test infection rates when it is assumed that at a given time instant only one infection can occur. This algorithm will then be generalized to a model under which within a given time interval more than one infection can occur. Experimental validation will explore how existing infection algorithms perform under this more realistic model.  Simulations will be supported using a collection of real devices (Android devices) who can communicate with each other in the local environment using bluetooth and/or WIFI.
+**Required skills**: knowledge of Java or Python. Interest in algorithms for a distributed collection of simple robot agents. Completion of 3rd year courses in computer science or computer engineering.
+\\
+======Simultaneous localization and mapping (SLAM) aided by a single unique directional landmark======
+**Supervisors**: Professors Michael Jenkin and Patrick Dymond
+**Project**: How can a simple SLAM algorithm be improved if it is known a priori that there exists in the environment a single unique landmark that provides both position and orientation information?
+SLAM algorithms have been developed for a large number of different environments, and for relatively straightforward environments such as those found indoors, the problem can in many ways be considered solved. However, current algorithms have in the main concentrated on a general version of the problem in which no a priori information is assumed about the environment. From theoretical results we know that a single directional landmark is sufficient to solve the SLAM problem algorithmically, but can we exploit this result within the traditional probabilistic framework found in SLAM algorithms? Starting with a standard vision-based SLAM algorithm, this project will explore how a single landmark can be used to drive exploration and critically, drive algorithmic loop closure.
+**Required skills**: knowledge of Java or Python. Interest in algorithms for robots. Completion of 3rd year courses in computer science or computer engineering.
+====== Comparison of Finger Tracking systems ======
+**Student**:
+**Supervisor**: Wolfgang Stuerzlinger
+**Required Background**: C/C++ coding
 __Description__
+This project compares the Leap Motion and the 3Gear System against each other in a comparative Fitts' law study
-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.
-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.
+__Completed__
+Winter, 2013
-====== Implementation and Analysis of a Non-blocking Chromatic Search Tree ======
+====== Imputation of missing values in microarray data ======
-**Student**:  Trevor Brown
+**Student**:  Michael Larin
-**Supervisor**:  Eric Ruppert
+**Supervisor**:  S. Datta
 __Description__
-This project seeks to take the theoretical description of the
+Microarrays are a relatively new technology that have had tremendous
-non-blocking chromatic search tree that was developed in a
+impact on many areas within biology and bioinformatics.  Microarray
-previous CSE4080 project and produce a Java implementation, then perform
+technology enables researchers to study the behaviour of many genes
-experiments to test it and compare it with other leading concurrent dictionary structures.
+and/or conditions in a single experiment.
-Additionally, many potential performance improvements and structural or
+Due to technological limitations and experiment design issues,
-algorithmic variations on the aforementioned theoretical description
+microarray data sets typically have several missing values.  It has been
-were identified during the last project.
+shown that imputation of these values improves the accuracy of
-This project would attempt to explore many of these variations to
+different processing tasks, including clustering, that are typically
-further refine the theoretical description, and produce a competitive
+done on these data sets.  Therefore, good imputation algorithms are
-dictionary algorithm.
+required.
-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
+In this project, we will explore fast and accurate imputation algorithms
-structure provides guarantees regarding balance and worst-case performance.
+for microarray data.  The student will first read the papers assigned
-If time permits, further work will be done towards establishing the
+and write a short summary of them.  Then, he will study the performance
-correctness of the algorithm.
+a few algorithms from the literature (many algorithms are already
+implemented but 1 - 2 may need to be implemented).  Finally, he will
+work with the supervisor on the design of better algorithms for the
+problem being studied.  He will use publicly available data sets to
+compare the performance (accuracy and speed) of the new algorithm(s) to
+the GMCImpute algorithm and several other existing ones.
-====== UCOSP: Development for Encyclopedia of Life ======
+Throughout the course, the student is required to maintain a course
+website to report any progress and details about the project.
-**Student**:  Feng Sun
+====== An Open Source Structural Equation Modeling Graph Drawing Application ======
-**Supervisor**:  Vassilios Tzerpos
+**Student**:  Doug Scheurich
+**Supervisor**:  J. Edmonds
 __Description__
-The Encyclopedia of Life (EOL) is a free, online collaborative
+Structural equation modeling (SEM) is a statistical technique that is becoming increasingly popular in the sciences. SEM allows researchers to test the validity of hypothesized models involving complex relationships among multiple variables. These models can include latent variables, which are not measured directly but are constructs inferred by observed variables. Structural equation models can be represented visually by graphs. To generate such graphs currently in R would require over 80 lines of code which has no reusability and has to be re written each time a new graph has to be developed or analyzed (R is a UNIX based command line only program, however it is a very powerful analytic research tool).
-encyclopedia intended to document all of the 1.8 million living species
-known to science. It is compiled from existing databases and from
-contributions by experts and non-experts throughout the world.
-The ultimate criteria of success for a web application is the user
+Collected data is used to estimate the parameters of the equations and assessing the fit of the model. There are several SEM software options available to researchers, however all have serious limitations (Windows only, Unix only, expensive licensing fees, text based or command line only, no GUI, etc).
-experience. EOL is no exception. This project involves creating a
-framework for describing how visitors are supposed to interact with
-Encyclopedia of Life. It automatically checks that a new version the EOL
-code is functioning as expected. It is very beneficial for open source
-projects to be released often, and automated tests decrease the cost of
-releases dramatically and ensure the integrity of the data, code, and
-visual representation. The tests are run either in production or a
-duplicate of the production environment. The acceptance testing
-framework can be extended to check any website, not only EOL, by
-changing the configuration and defining new test suites. It also enables
-testing a web application with different browsers and operating systems.
-Acceptance testing is an import skill for aspiring developers. By
+We propose developing an application which will allow the user to load observed variables from a data file to create graphs, or allow using an intuitive graphical interface, and convert the graphs into a text based model specification file (ie generate the code required so the graph can be used in other programs such as R).  This text file can then be used as input for the sem() function in R.  The application will be implemented in Java, which can then be used with any OS.  Later versions may include the ability to call R functions directly from within the application and provide options for more advanced structural equation modeling techniques.
-participating in this project you will learn the inner mechanics of
-operating a browser automatically using scripts, emulating a real
-person's actions. This project will provide experience using Selenium (a
-leading open source acceptance testing tool), XML, XPATH, CSS selectors,
-and Behavior Driven Development.
-More information: [[http://www.eol.org]]
+====== Exploring the notion of Variability in Business Process Modeling (and its relationship with Goals) ======
+**Student**:  Dean Shaft
+**Supervisor**:  S. Liaskos and Y. Lesperance
+__Description__
+Business Process Modeling (BPM) notations are an increasingly popular subject of investigation in the analysis and design of Information Systems. Such notations allow analysts to represent different ways by which actors of a domain can collaboratively perform tasks in order to meet certain business goals. The diagrammatic result allows understanding of the involved activities at various levels of abstraction each being useful for different stakeholders, such as business versus technical ones. It also provides a basis for further formalization and analysis of the modeled business process or its translation into implementation models such as service composition programs. Several BPM languages have been introduced, most prominent being the Business Process Modeling Notation (BPMN).
+Variability occurs in business processes, in that the same business process may need to either be reused in a different context (e.g. a different organization) or adapt to changing requirements or environmental constraints. Thus, each variation of the business process is applicable to a different situation affects specified customization criteria in a different way. Such criteria may include high-level qualities or non-functional goals e.g. such as key performance indicators (KPIs) or operational constraints that prescribe patterns which the business process must follow. To some extend BPMs offer constructs for modeling such variability. However, both the problems of modeling customization criteria and that of using them to derive business process variations that best satisfy them have not enjoyed significant attention in the literature.
+In this project we shall investigate ways of modeling and reasoning about business process variability. We will pick a BPM, possibly BPMN, and explore different ways by which variability can be expressed. Then we will look at criteria that define variant selection and how such can be represented as well. Through possible formalizations in specification frameworks that are used in AI such as Situation Calculus or planning definition languages, the problem of automatically selecting variants of interest in order to meet certain customization criteria shall be studied. In the end we are hoping to develop a concrete framework for representing and reasoning about business process variability in light of high-level goal-based customization criteria.
+====== Mobile Software Development Platform Comparison: Windows Phone 7 and Android ======
+**Student**:  Ahmad Hasan
+**Supervisor**:  J. Ostroff
+__Description__
+Over the past decade the development and use of smartphone technologies has become increasingly sophisticated. The computational power of modern smartphones is growing to match the power of conventional desktop computers. More people and organizations are becoming increasingly dependent on their mobile devices being able to perform sophisticated computations. As the leaders in the technology industry move towards providing advanced products and development platforms, the environment of traditional software development is changing rapidly. Mobile applications that provide a variety of services involving cloud computing, GPS, games, and automation.
+The goal of this project is to explore and compare the software development platforms for popular mobile phone operating systems for the development of applications and games.
+Business applications and games have distinctive features in the context of mobile platforms. For regular applications, platform capabilities relating to cloud computing, GPS and everyday consumer applications have a unique development cycle that differ from regular desktop applications. Mobile applications are usually lightweight and efficient tools for everyday administrative tasks. Under Windows Phone 7 such apps are usually built under the Microsoft Silverlight framework, and the the application must adhere to guidelines and best practices laid out in the Windows Phone 7 documentation. The Android platform provides no such single framework for developing these types of applications but all of the tools and functionalities are available to provide the same services, again this app will also follow the guidelines and best practices described in the official Android documentation.
+The games developed in each platform are intended to serve as explorations into the graphics capabilities of both systems. Graphics environments and frameworks are another area in mobile devices that are becoming increasingly important. Rich graphics and animation capabilities are important for providing immersive user experiences and games are excellent environments to develop and test interactive graphics capabilities on mobile devices. The Windows Phone 7 game development framework uses and extension of Microsoft’s well established XNA framework. This provides libraries to develop and debug game and graphics engines and easily integrate multimedia content into mobile games. Android game applications depend on a to be determined open source game engine.
+This project aims to compare the mobile platforms with respect to development languages, the use of object oriented software development principles and the utility of the tools. The applications and documentation developed through the course of this project should also provide a good source of information for computer science and engineering students who might want to develop software on mobile platforms. Using standard libraries and working with established frameworks and as well as open source frameworks to develop reliable, extendible and reusable code for mobile platforms would be an excellent experience for students to learn about new emerging technologies and the software engineering concepts that apply to them.
+====== CPS/1 Emulator ======
+**Student**:  Vahid Bahreman
+**Supervisor**:  Z. Stachniak
+__Description__
+The manufacturers of tablets, pocket PCs, smart-phones, etc.  frequently
+release software simulators (or emulators) of these devices to emulate
+the functionality of actual products for cost-effective development of
+application software   (e.g.  to test how a given device's software,
+screen, keyboard, or trackwheel will  work with an application under
+development). These simulators can also be used as sophisticated tools
+for testing, training and in presentations. The design and
+implementation of such emulators require a broad computer science
+expertise from hardware architecture to operating systems and computer
+graphics.
+The history of computing is another area that actively supports  the
+development of emulators of historically significant hardware (mostly
+computers   and game consoles).  As a result, there is at least one
+emulator of almost every significant system. This activity contributes,
+in the first place, to the preservation and dissemination of significant
+hardware and software technologies. The project's objective is to design
+and implement an emulator of the CPS/1 computer -- one of the   earliest
+commercially available microprocessor-powered computers. York University
+Computer Museum is in the possession of CPS-1's design blueprints and
+other technical documentation. The completed project would be a
+significant contribution to the preservation of unique Canadian computer
+technologies.
+Background information: The CPS/1 computer was designed and built   by a
+Canadian company Microsystems International Ltd. between 1972 and 73.
+The computer   was built around the first Canadian microprocessor--the
+MF7114--one of world's  earliest microprocessors.  Although none of the
+CPS/1 computers have survived, technical information about the CPS/1 has
+been preserved. This makes the design and  implementation  of an
+emulator possible. More information on
+http://www.cse.yorku.ca/museum/collections/MIL/MIL.htm
+====== Quantum Cryptography ======
+**Student**:  Abdulaziz Busbate
+**Supervisor**:  Hamzeh Roumani
+__Description__
+Quantum mechanics makes it impossible (not just infeasible) to passively eavesdrop on a communication channel. Quantum channels are thus ideal for secret key distribution, and a protocol named BB84-Cascade has been devised to manage the transmission and correct channel errors.
+Determining the block size in this protocol is critical due to its exponential effect on information leaked to an eavesdropper. If the block size is too small, too much information is leaked, and if it is too large, not enough bits will be shared.
+The purpose of this project is to simulate the protocol in a Java program and then run the simulation for a variety of error rates and block sizes while monitoring the leakage. This will allow us to determine the optimal block size for the BB84 Quantum Key Distribution Protocol.