Differences

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

--- projects [2017/04/24 20:45] – dymond
+++ projects [2017/05/03 17:43] (current) – dymond
@@ Line 1: / Line 1: @@
-======Projects from Winter 2017 ======
+======Projects ======
-Some of these projects may still be of interest to the faculty members involved.
+======New Proposed Projects, Summer 2017 ======
+\\
+======Ultrasound simulation/trainer ======
-======Distributed leader election for simple robots======
+**Supervisor:** Burton Ma
-**Supervisors**: Professors Michael Jenkin and Patrick Dymond
+**Required Background:** General CSE408x prerequisites,some knowledge of C++, knowledge of computer graphics would be useful (e.g. EECS3431)
-**Project**: How should a group of autonomous agents moving within multiple locations choose and maintain a leader to coordinate and control them?
+Trans-esophageal echocardiography (TEE) is the standard of care for most cardiac surgeries and interventional cardiology procedures. It uses a thin and flexible ultrasound probe that is inserted down the esophagus in position beside the heart, and the echocardiographer adjusts the position and orientation of the probe from outside. For new clinicians, learning how to adjust the probe into the correct location for various views of the heart can be quite challenging.
-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.
-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.
+The primary goal of this project is to develop an open source, inexpensive software simulation for training clinicians in the use of TEE ultrasound. Starting with a 3D-plus-time CT or MRI heart dataset, we will create simulated ultrasound images, and use a mouse to simulate the translation and rotation of the ultrasound probe. The software platform will render the simulated ultrasound, and provide the user with feedback on how well they can identify the standard TEE views. This project will involve a collaboration with clinicians in Toronto and London, Ontario.
-If time permits, the project will also study possible  enhancements of the infection algorithm as well as develop better upper bounds for the problem.
-**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.
+\\
-======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.
+======3D Fractal visualizations and Music======
-\\
+**Supervisor:** Vassilios Tzerpos
-======Simultaneous localization and mapping (SLAM) aided by a single unique directional landmark======
-**Supervisors**: Professors Michael Jenkin and Patrick Dymond
+**Required Background:** General CSE408x prerequisites, good knowledge of C++
-**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?
+Visualizing and navigating through 3D fractals is very cool. Check out an example here: https://www.youtube.com/watch?v=oo3f2hjV_AM
-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.
+This project will investigate the connection between music and 3D fractal visualizations, both in terms of generating music to match the visualization, as well as creating a visualization to match an existing piece of music. The project will start with a literature survey of the state of the art in this field and then focus on developing a prototype music/visualization generation tool.
-**Required skills**: knowledge of Java or Python. Interest in algorithms for robots. Completion of 3rd year courses in computer science or computer engineering.
 \\
 ======Extracting Information from Music======
@@ Line 50: / Line 44: @@
 This project will use the JUCE framework to create software that extracts such information from audio files. Existing algorithms will be implemented and compared, and possibly improved. The output will be both a stand-alone application, as well as plugins for digital audio workstations used in the music industry, such as Pro Tools, Ableton Live etc.
+-------------
+\\
+-------------
+======Projects from Winter 2017 ======
+Some of these projects from the previous term may still be possible this term.
+You can consult the faculty member concerned by email to see if the project
+or a revised version is available for summer.
+---------------------------------
 \\
 ======Immersive Virtual Worlds======
@@ Line 365: / Line 369: @@
-====== Mining Software Repositories Data======
-**Supervisor:** Zhen Ming (Jack) Jiang (zmjiang at cse dot yorku dot ca)
-**Required Background:** Good programming skills in Java; Good analytical and communication skills; Knowledge in AI and statistics; Interested in large scale software analysis
-**Short Description:** Software engineering data (e.g., source code repositories and bug databases) contains a wealth of information about a project's status and history. The research on Mining Software Repositories (MSR) aims to transform the data from static record-keeping repositories into knowledge, which can guide the software development process. For example, one can derive correct API usage patterns and flag anomalous (and potentially buggy) API usages by mining the source code across many projects in GitHub and Google Code. In this project, the student(s) will research and develop an efficient infrastructure, where MSR researchers and practitioners can share and analyze such data.
-\\
 ------------------
 \\
@@ Line 436: / Line 432: @@
 ------------------
 \\
-More project proposals may be added here in the first week of the winter term.
 \\
 ------------------
@@ Line 442: / Line 438: @@
 \\
-====Formerly Proposed Projects====
+====Proposed Projects from Previous Years====
 ====== Tilt Target Selection on Touchscreen Phones ======
@@ Line 645: / Line 641: @@
 The URL for Algorithmics Animation Workshop (AAW) is http://www.cs.yorku.ca/~aaw. The main purpose of AAW is to be a pedagogical tool by providing animation of important algorithms and data structures in computer science, especially those studied in courses CSE 3101, 4101, 5101, 6114, 6111. This is an open ended project in the sense that more animations can be added to this site over time.
-----
-===Selenium/Eiffel Web Test Driven Development===
-Supervisor: Jonathan Ostroff
-Required background: General prerequisites, at least a B+ in CSE 3311
-Recommended background: Knowledge of Javascript a plus
-Description
-The Selenium IDE is an integrated development environment for Selenium scripts. It is implemented as a Firefox extension, and allows you to record, edit, and debug tests of web applications. The Selenium IDE is a recording tool, or you may edit your scripts by hand. With autocomplete support and the ability to move commands around quickly, Selenium IDE is the nice environment for creating webtests no matter what style of tests you prefer.
-Tests can be translated to Java (JUnit), C#, Python etc. It can be extended to any language that can make HTTP calls.
-The goal of this project is (1) to translate Selenium tests into tests that can be run under Eiffel (e.g. via ESpec or AutoTest), and (2) to provide a complete Eiffel web application creation template (with embedded database such as sqlite) for creating and testing web applications.
 ----
@@ Line 695: / Line 675: @@
 Background : The NABU Network was designed and implemented by a Canadian company NABU Manufacturing between 1981 and 1983. The underlying idea behind the network was to link home personal computers to cable television networks which would supply a continuous, high speed stream of computer programs and information (at the rate of 6.5 Mbits per second) to almost an unlimited number of users. Cable television was a uniquely ideal technology for NABU to deliver software and data to home computers because of its high bandwidth and networking capabilities. After the official launch on Ottawa Cablevision in October of 1983, the NABU Network was introduced by Ottawa's Skyline Cablevision in 1984 and a year later in Sowa, Japan, via a collaboration between NABU and ASCII Corp. NABU Network subscribers could rent or buy a NABU PC and dedicated network adaptor, and use an ordinary television set as a display monitor. Once connected to the network, a user could choose from various application programs and services in categories including entertainment, information and guides, education, and professional programs. Dedicated NABU magazines, newsletters, programming guides, and user groups provided subscribers with supplementary information and support. To learn more, visit here .
 ----