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.

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.

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.

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.

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.

Supervisor: Vassilios Tzerpos

Required Background: General CSE408x prerequisites, good knowledge of C++

While humans are quite good at extracting musical information from audio, such as tempo and time signature, computers have room for improvement in this regard.

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.

Supervisor: Robert Allison

Required Background: General CSE408x prerequisites, good programming skills, previous work with computer graphics would be helpful

We have a new and unique fully immersive virtual environment at York. The student would develop interactive 3D virtual worlds to study self motion perception and human computer interaction in a virtual world. In particular, working with a senior graduate student or postdoctoral fellow, the successful applicant would model 3D environments, render them in a virtual reality display and develop/implement interaction methods to control and interact with the simulation. Artistic background or skill would be an asset but is not required.

Supervisor: Robert Allison

Required Background: General CSE408x prerequisites, good programming and mechanical skills

Simulating effective walking in an immersive virtual environment is challenging. Working with a senior graduate student, the successful applicant would help to develop a circular treadmill interface to support virtual walking metaphors.

Supervisor: James Smith

3D printers are an enabling technology for engineering design. However most low- to medium-end printers can only extrude plastics through a hot-end extrusion system. A local company has developed a nozzle and pump system for pastes that can be integrated with existing printers. A student group is sought to design a mounting bracket for an existing TAZ 4 printer that can be used to augment its ABS extruder with a Discov3ry paste extruder. The bracket is to be printed with the TAZ and the design is to be released publicly to the open-source community. Sample prints, calibration routines and possible modifications to the printer's software may be required. Experience with programming and hardware are important prerequisites.

For more information, please send email to drsmith@yorku.ca.

Required Background: General CSE408x prerequisites

Supervisor: Hany Farag

Multi-agent systems have been mentioned recently as a potential technology for several operational control objectives in smart power grids. The multi-agents technology allows the rapid and detailed creation of a system model and creates a robust framework for distributed control. The distributed control structure consists of components called control agents. These control agents try, through communication and negotiation with other control agents, to: 1) determine the current state of the system and/or subsystems and 2) make decisions (set their local actuators or communicate with other agents) in such a way that their own objectives are met as closely as possible and any constraints are satisfied.

This project aims to implement formulated distributed constraint optimization (DCOP) in a multi-agent platform for two objectives in smart grids: 1) voltage regulation and 2) electricity market,. There are several Java-based open source platforms for peer-to-peer agent based applications e.g. (JADE, Jadex, Jason,..etc). With the help of the supervisor, the student will choose the platform that suits the required applications. Also, the student will implement the formulated DCOP in the suitable multi-agent platform to test its effectiveness and robustness. Toward that end, an interface between the multi-agent platform in Java environment and the power grid simulator in MATLAB environment is required to transfer the measurements from MATLAB to the multi-agent platform and then transfer the actions from the multi-agent platform to MATLAB in real-time.

The student should be a strong Java and MATLAB programmer. He should have prior knowledge about multi-agent platforms such as JADE. The work involves reading and understanding the formulated DCOP in smart grids and working with the supervisor and master/PhD student(s) to implement the developed algorithms and to measure the performance of the developed algorithm(s) in the multi-agent platform.

For more information, please send email to hefarag@cse.yorku.ca.

Required Background: General CSE408x prerequisites

Supervisor: Suprakash Datta

Clustering is a basic technique for analyzing data sets. Clustering is the process of grouping data points in a way that points within a group are more similar to each other than points in other clusters. Many clustering algorithms have been developed over the years. However no single algorithm works well for all data sets. Further, most clustering algorithms have running times of the order of n^2 or n^3, so that they are not feasible for data sets with hundreds of thousands of points. In this project we will design good clustering algorithms for large real data sets. In particular we are interested in Biological data sets.

Our data sets will include those obtained from Flow Cytometry data. Flow Cytometry is a common technique in many areas of Biology, particularly Immunology. Typical usage involves testing a blood sample for 25 attributes on a per-cell basis, and thus typical data sets are arrays of 500,000 points in a 25 dimensional space. The aim is to identify clusters that correspond to a biologist's notion of a cell “population”. In addition to the size of the data, the factors that make this problem difficult are heterogeneity of population sizes and densities and overlapping populations. With the help of collaborators we proposed an accurate algorithm called SWIFT (Cytometry A. 2014 May;85(5):408-33) that successfully finds small cell populations of interest to Immunologists. This project attempts to design and implement algorithms that are faster than SWIFT but at least as accurate. The supervisor has collaborators in Immunology who are experts in interpreting and analyzing Flow Cytometry data. Their expertise will be used to design and validate effective clustering algorithms that can run on large data sets.

No Biology knowledge is required. The student should be a strong programmer. Knowledge of C/C++ is desirable but not essential. The work involves reading and understanding existing algorithms and working with the supervisor to design and implement improved algorithms and to measure the performance of the proposed algorithm(s).

For more information, please send email to datta@cse.yorku.ca.

Required Background: General CSE408x prerequisites

Supervisor: Suprakash Datta

Optimization is a crucial step in many computational problems. For computational problems that seem (or are known to be) intractable, metaheuristic-based techniques often work well in practice. These are typically randomized algorithms, often inspired by physical or biological systems. Examples of such algorithms include simulated annealing, genetic algorithms and ant colony optimization. In this project we will focus on particle swarm optimization (PSO), a technique inspired by the search for food by flocks of birds or schools of fish. Briefly, a set (or population) of candidate solutions (called particles) are maintained at all times by the algorithm. These particles move in the search-space using simple rules that make use of the best solutions found so far by the particle as well as by the swarm. Movement of particles result in new particles being generated. The process is repeated until some termination criteria are met and the best solution found is output by the algorithm. While there is no guarantee of optimality, PSO has been shown to produce good or very good solutions for many practical problems. Many variants of PSO's have been proposed. In this problem we will study the performance of some PSO variants on both artificial and real optimization problems.

The student should be a strong programmer. A good grasp of algorithms and knowledge of C/C++ are desirable but not essential. The work involves reading and understanding existing algorithms and working with the supervisor to design and implement improved algorithms and to measure the performance of the proposed algorithm(s).

For more information, please send email to datta@cse.yorku.ca.

Required Background: General CSE408x prerequisites

Supervisor: Jarek Gryz

Skydive is a prototype system designed for database visualization using a concept of the so called data pyramid. The system is composed of three modules (DB - Database Module, D2I - Data-to-Image module, and VC - Visualizaton Client). Each is designed to use a different type of computer memory. The DB module uses disk to store and manage the raw data, and materialized data pyramids. The D2I module works with a small subset of the aggregated dataset, and stores data in main memory (RAM). The VC module uses the graphic card’s capabilities to perform more advanced operations – such as zooming, scaling, panning, and rotation – over the graphical representation of the data. Currently the system support three presentation models implemented within the Visualization Component, namely:

• a 2D heat-map;

• a 2.5 D heat-map by 3D barchart; and

• a 2.5 D terrain (by mesh and UV-mapping).

The goal of the project is to implement two additional ways of data visualization as well as extend some of existing ones, that is:

1. Implement and test functions for data pyramid-based visualization of time series.

2. Implement functions for visualization based on cross-product of data pyramids.

3. Add support for specular and normal maps for 2.5 D terrain presentation model.

Required Background: CSE 3421, Java programming course, (C programming course a plus)

Supervisor: Katalin Hudak

The Hudak Lab in the Biology Department has an opening for a fourth-year Honours student to assist with a bioinformatics project. We study the pokeweed plant, Phytolacca americana, which displays broad-spectrum virus resistance. To evaluate pokeweed gene expression, we recently sequenced the plant’s mRNA and small RNA transcriptomes under jasmonic acid (JA) treatment. JA is a plant hormone that mediates defence against pathogens and insect herbivores. We are interested in learning how pokeweed gene expression is regulated by miRNAs during biotic stress. Please note: no previous knowledge of biology is required.

Working with the support of a PhD student, your project will involve:

1) Prediction of micro RNA (miRNA) targets on the basis of complementary sequence matches

2) Correlation of miRNA and mRNA expression changes to identify genes that are regulated by miRNAs

3) Conducting pathway analysis to determine which biological processes are controlled by miRNAs

4) Construction of a miRNA/target interaction network to visualize predictions This work will contribute to a scientific manuscript on miRNA-mediated gene regulation in pokeweed during response to JA.

Requirements:

1) Pre-requisites as per EECS Calendar

2) Facility with script-writing/modification (in Perl or Python)

3) Preference for students with knowledge of statistics and familiarity with R programming

4) Able to begin in September 2015

Learning outcomes:

1) Manipulate and analyze quantitative biological data

2) Develop and test hypotheses by modifying existing software and writing new script

3) Manage a CentOS computer server to store and facilitate ongoing research

No knowledge of biology is required.

For more information, please see: Hudak Lab website- http://hudak.lab.yorku.ca/

RNA sequencing- http://www.illumina.com/applications/sequencing/rna.html

miRNAs- http://en.wikipedia.org/wiki/MicroRNA

Supervisor: Michael Jenkin

Contrary to most industries, fine chemical manufacturing is dominated by batch production methods. Increasing economic, environmental and safety pressures are motivating a turn towards continuous synthesis. Rather than making products in one big flask, continuous synthesis involves performing chemical reactions by flowing reagents through a tube. Working in this way provides more control over the reaction parameters leading to increases in product quality, and process efficiency and safety. The flow chemistry industry for fine chemical production is a relatively new but burgeoning field with a projected market capacity of billions of dollars by 2018.

Extraction of the reaction mixture for purification and/or further processing is an important step in chemical manufacturing. This is a relatively straightforward operation in batch production, but offers several challenges for flowing processes. In order to facilitate continuous liquid extraction we require a sophisticated control system. This project involves designing, constructing and evaluating a pertinent practical problem in the field.

A key step in the process takes place in a clear tube that is mounted vertically. The tube contains two fluids with a boundary between them. During the process material flows into and out of the tube from the top and the bottom. Chemical reactions take place within this tube and It is essential that the position of the boundary be monitored as its position in the tube is used to control the flow of materials into the tube.

One way of solving this problem is to float a marker at the boundary between the two liquids and to monitor this boundary using a video camera. Although this approach solves the problem, it requires the introduction of a specific float within the tube. Can we build a system that monitors the boundary without resorting to the use of an artificial float?

Specific goals of the project include:

- Develop a computer vision system that can detect and monitor the interface between two miscible fluids of different density.

- Evaluate the performance of the system over a range of different (and typical) fluids

- Explore the use of different illuminant/filter choices to simplify the task for specific fluid combinations.

The successful candidate(s) will have the experience of working with a diverse group of scientists and engineers toward the design and implementation of an automated liquid extraction device with applications across many industries. Upon successful prototyping, you will be able to interact with professionals in high-throughput manufacturing and system integration. Based on project success, you may be invited to join the MACOS(TM) team for implementation and process validation, which may involve opportunities in graduate school. You will have the opportunity to interact with the broad audience of MACOS(TM) technology including governmental regulatory agencies and industrial partners. This project will give you a great opportunity to apply your engineering expertise and gain experience in process implementation and technology transfer.

For further information please contact,

Michael Jenkin (jenkin@cse.yorku.ca) or Michal Organ (organ@yorku.ca)

Supervisor: Natalija Vlajic

Recommended Background: CSE 3213 or CSE 3214, CSE 3482

Not long ago, botnets - networks of compromised computers - were seen as the most effective (if not the only) means of conducting Distributed Denial of Service (DDoS) attacks. However, with the growing popularity and prevalence of application-layer over other types of DDoS attacks, the DDoS execution landscape is becoming increasingly more diverse. An especially interesting new trend is the execution of application-layer DDoS attacks by means of skillfully manipulated Web-crawlers, such as Google-bots. The goal of this project is to design, implement and test a real-world framework consisting of the following: a) the attacker's web-accessible domain specially designed to attract Google-bots and then manipulate them into generating attack traffic towards the target/victim site; b) the victim's Web site set up in Amazon S3 cloud. In addition to the hands-on component, the project will also look into the statistical/numerical estimation of the framework's anticipated 'attack potential' relative to an actual (real-world) target/victim site.

Supervisor: James Elder

Required Background: General CSE408x prerequisites, good programming skills, good math skills, knowledge of C and MATLAB programming languages

One of the challenges in remote learning is to allow students to communicate effectively with the lecturer. For example, when a student asks a question, communication will be more effective if the instructor has a zoomed view of the student’s face, so that s/he can interpret expressions etc.

The goal of this project is to apply attentive sensing technology (www.elderlab.yorku.ca) to this problem. This technology is able to monitor a large environment such as a classroom and direct a high-resolution ‘attentive’ sensor to events of interest.

In particular, working with a senior graduate student or postdoctoral fellow, the successful applicant will:

1. Study the problem of detecting hand-raises in the preattentive sensor stream
2. Implement algorithms for detecting hand-raises based upon this investigation
3. Evaluate these algorithms in a real-classroom setting, using proprietary attentive sensing technology

Supervisor: James Elder

Required Background: Good programming skills; Good math skills; Knowledge of C and MATLAB programming languages

The goal of this project is to modify York University’s patented attentive sensor technology to the sport video recording market. Specific application domains under investigation include skiing, indoor BMX parks, and horse tracks.

The general problem is to use attentive sensing technology (www.elderlab.yorku.ca) to visually detect and track multiple moving agents (e.g., skiers, riders, horses) and to select specific agents for active high-resolution smooth pursuit.

The student will work with senior graduate students, postdoctoral fellows and research scientists to help modify the attentive sensing technology to operate in these domains. Specific tasks include:

1. Ground-truth available datasets 2. Evaluate current attentive algorithms on these datasets 3. Modify these algorithms to improve performance on these datasets

————

Supervisor: Franck van Breugel

Description: JPF, which is short for Java PathFinder, is an open source tool that has been developed at NASA's Ames Research Center. The aim of JPF is to find bugs in Java code. Instead of using testing to find those bugs, JPF uses model checking. The facts that JPF is downloaded hundreds of times per month and that some of the key papers on JPF have been cited more than a thousand times reflect the popularity of JPF. In fact it is the most popular model checker for Java.

A study done by Cambridge University in 2014 found that the global cost of debugging code has risen to $312 billion annually. Furthermore, on average software developers spend 50% of their programming time with finding and fixing bugs. As a consequence, advocating the use tools, such as JPF, may have significant impact.

Installing JPF is far from trivial. The tool itself has been implemented in Java. Therefore, it should, in theory, be feasible to encapsulate JPF in a Java archive (jar) file. This would make it significantly simplifying the installation process of JPF and, therefore, make the tool more easily accessible to its potential users.

The aim of this project is to attempt to put JPF in a jar. Since JPF relies on a number of configuration files, so-called Java properties files, incorporating these properly into the jar is one of the challenges. Setting JPF's classpath is another challenge. Since JPF changes almost on a daily basis, our modifications to JPF should ideally be limited to only a few classes, yet another challenge.

In this project you may collaborate with graduate students of the DisCoVeri group (discoveri.eecs.yorku.ca) and computer scientists of NASA. For more information, feel free to send email to franck@cse.yorku.ca.

Required Background: General CSE408x prerequisites

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.

Supervisor: Jia Xu

Required Background: At least a B+ in Embedded Systems (CSE3215), MATLAB, C programming skills, solid experience in using a microcontroller such as Arduino.

Project Description:

Model-based design with code generation tools can be used for simulation, rapid prototyping, and hardware-in-the-loop testing of embedded systems. This project explores model-based design and development of embedded systems on various hardware platforms with code generation tools. The selected student will develop and test embedded systems using model-based design and code generation tools such as MathWorks MATLAB /Simulink Coder.

Supervisor: Jia Xu

Required Background: At least a B+ in Embedded Systems (CSE3215), strong C programming skills, solid knowledge of microcontrollers

Description: The C2000 Concerto family of microcontrollers combines two cores on a single-chip with on-chip low latency interprocessor communication between the two cores: a C28x 32-bit control core for real-time control with faster/more loops and small sampling window; and an ARM 32-bit Cortex-M3 host core for communications and general purpose. The selected student will evaluate the capabilities of the C2000 Concerto family of microcontrollers through testing and investigating open source software for real-time control applications that runs on C2000 Concerto Microcontrollers.

Supervisor: Jia Xu

Required Background: At least a B+ in Operating System Fundamentals (CSE3221), strong Ubuntu/Linux, C++ programming, GCC, TCP/IP skills

Description: Real-time bidding (RTB) is a new method of selling and buying online display advertising in real-time one ad impression at a time. Once a bid request has been sent out, all bids must be received within a strict deadline - generally under 100 milliseconds, including network latency. This project explores RTBkit, an open source SDK allowing developers to create customized real time ad bidding systems (for Media Buyers/Bidders).

Supervisor:Sebastian Magierowski

Description: The project requires the construction of components for a ground penetrating radar. The students would have to design microwave boards for the high-frequency components of this unit, on both the transmitter and the receiver. On the transmitter side the board would take a 5-MHz input clock, run it through a series of off-the-shelf amplifiers and then through a shaping circuit that would convert the input into an outgoing series of pulses (still at 5-MHz repetition rate) less than 400-ps in duration each. The bandwidth of the signal is roughly 2-8 GHz and hence requires very careful board layout. The receiver would be a time-shifted sampler, used to sample the returning pulses in progressive periods. This radar circuit is ultimately intended to be positioned on a rover doing ground analysis.

Required Background A background in undergraduate-level electronics is very important. Experience with board level implementations and knowledge of microstrip lines would be helpful, otherwise the basics would have to be picked up during the project.

More project proposals may be added here in the first week of the winter term.

Supervisor: Scott MacKenzie

Required Background: General 4080 prerequisites, CSE3461, and (preferably) CSE4441. Interest in user interfaces and human-computer interaction (HCI). Students can use their own Android phone for the project or one supplied by the course supervisor.

Touchscreen mobile devices commonly use a built-in accelerometer to sense movement or tilting actions of the device. Tilt is commonly used the change the orientation of the display between portrait and landscape. Gaming is another common use for tilting actions. However, tilt may also be used for target selection, as a replacement for touch. This research project will evaluate tilt as an input primitive for target selection on touchscreen mobile devices.

Readings: MacKenzie, I. S., & Teather, R. J. (2012). FittsTilt: The application of Fitts’ law to tilt-based interaction. Proceedings of the Seventh Nordic Conference on Human-Computer Interaction – NordiCHI 2012, pp. 568-577. New York: ACM.

Supervisor: James Elder

Required Background: General CSE408x prerequisites, good programming skills, good math skills, knowledge of C and MATLAB programming languages

One of the challenges in remote learning is to allow students to communicate effectively with the lecturer. For example, when a student asks a question, communication will be more effective if the instructor has a zoomed view of the student’s face, so that s/he can interpret expressions etc.

The goal of this project is to apply attentive sensing technology (www.elderlab.yorku.ca) to this problem. This technology is able to monitor a large environment such as a classroom and direct a high-resolution ‘attentive’ sensor to events of interest.

In particular, working with a senior graduate student or postdoctoral fellow, the successful applicant will:

1. Study the problem of detecting hand-raises in the preattentive sensor stream
2. Implement algorithms for detecting hand-raises based upon this investigation
3. Evaluate these algorithms in a real-classroom setting, using proprietary attentive sensing technology

Supervisor: James Elder

Required Background: Good programming skills; Good math skills; Knowledge of C and MATLAB programming languages

The goal of this project is to modify York University’s patented attentive sensor technology to the sport video recording market. Specific application domains under investigation include skiing, indoor BMX parks, and horse tracks.

The general problem is to use attentive sensing technology (www.elderlab.yorku.ca) to visually detect and track multiple moving agents (e.g., skiers, riders, horses) and to select specific agents for active high-resolution smooth pursuit.

The student will work with senior graduate students, postdoctoral fellows and research scientists to help modify the attentive sensing technology to operate in these domains. Specific tasks include:

1. Ground-truth available datasets 2. Evaluate current attentive algorithms on these datasets 3. Modify these algorithms to improve performance on these datasets

Supervisor: Jeff Edmonds

Required Background: General CSE408x prerequisites

Recommended Background: Java software development

Structural equation modeling (SEM) is a statistical technique that is becoming increasingly popular in the educational and behavioral sciences. SEM allows researchers to test the validity of hypothesized models involving complex relationships among multiple variables. Collected data is used to estimate the parameters of the equations and assessing the fit of the model.

The software required is an application that allows researchers to define their hypothesized models visually and will output the correct syntax for the analytical software of their choosing.

To date a promising functional application has been developed in JAVA by a Computer Science student as a 4080 project. The existing software allows the user to draw a path diagram and outputs code for the R package sem. There are a number of improvements to be made (refinements and additions to graphical user interface) and then the application needs to be extended to output syntax appropriate for additional software applications (openMX, MPlus and EQS). Though this project may not begin at “the first stages” of the software lifecycle, this scenario is likely common in the software development market. In addition, the student will be working with a primary “client” who is far less technically advanced, which is also reflective of real-world situations.

More details here.

Supervisor: Sotirios Liaskos (liaskos at yorku dot ca)

Required Background: Good knowledge of Unix tools / Python, Perl or Awk. Comfort with algorithms and programming. Essential: 2031 – Software Tools. Desired: 3402 – Functional & Logic Programming, 3101 – Design and Analysis of Algorithms, 4302 – Compilers and Interpreters.

Description: This project involves enriching and integrating a set of fairly complex scripts, which are components of an Artificial Intelligence (AI) planner, and exporting them to the public in a Software-as-a-Service (SaaS) fashion.

The components are various Unix executables and LISP programs that need to interact in complex ways. The components may be residing in different servers in different universities. Currently integration is performed manually, at the expense of usability. Thus, we aim at constructing a module that: (a) integrates involved components to deliver output in one call, (b) exports a unique web interface (preferably following WSDL/SOAP) to be easily accessed by custom front-end tools by anyone, anywhere, (c ) offers a simple front-end for human users.

Learning objectives:

• Understand the technologies and process involved in turning native code into a web-service (“servicizing”).
• Study a state-of-the-art AI planner and understand its workings.
• Exercise scripting skills.

Supervisor: Burton Ma

Description: Registration is a fundamental step in image-based surgical navigation. Several (seemingly) different approaches for predicting distance errors in registration are known, but for some surgical procedures, the angular error in registration is more important. This project will validate an approach for predicting angular error in registration; the student will use a combination of simulated and actual registration data for testing purposes.

Supervisor: Burton Ma

Description: Tracked pointers are the most common tools used in surgical navigation systems. A typical pointer has a tracked target on one end and a sharp or ball tip on the other end. Finding the location of the tip relative to the target is a calibration problem. One solution to the calibration problem involves pivoting the pointer about the tip while tracking the target; if the tip is kept stationary, then the target moves on the surface of a sphere. Fitting the tracking data to the surface of a sphere yields the location of the tip as the sphere center. Unfortunately, the calibrated tip position obtained using such a spherical calibration has high variance. This project will investigate how much variance there is in the calibrated tip position, and methods for reducing the variance of the calibrated tip position.

Supervisor: Uyen Trang Nguyen

Description: One of the major privacy concerns in Online Social Networks is photo sharing. A user may post his/her friends’ photos without their consent. The friends have no control over the user’s Facebook activities, namely photo sharing. In this project, we design and implement a third-party Facebook application that allows people to protect their identities in photos uploaded by another user without their consent.

Required prerequisite background: Proficiency in programming, especially in Java and Web application programming.

Desired prerequisite: Knowledge of image processing, Facebook API, JavaScript Object Notation (JSON)

Supervisor: Rob Allison

Required Background: General CSE408x prerequisites

Recommended Background: CSE3431 or CSE4471 or equivalent

Description

Detection of forest fires is a challenging activity that requires considerable training. The objective of this project is to implement a virtual reality simulation to incorporate key aspects of this task and then to perform an evaluation with a small user study.

Supervisor: Rob Allison

Required Background: General CSE408x prerequisites

Recommended Background: CSE3431 or CSE4471 or equivalent

Description

This is a computer graphics project to present visual motion stimuli to an observer. The software will experimentally control scene content, collect user responses and control the camera trajectory to simulate the desired self-motion profile.

Supervisor: Rob Allison

Required Background: General CSE408x prerequisites

Recommended Background: CSE3431 or CSE4471 or equivalent

Description

Directors of three-dimensional movies sometimes use 'stereo calculators' to compute the simulated depth of objects in the film show to the viewer in order to maximize the stereoscopic effects and maintain comfortable viewing. However current calculators have limited ability to visualize the results of the calculations. This project will combine stereo calculations with visualization software to assist the director in artistic and technical decisions.

Supervisor: Scott MacKenzie

Required Background: General 4080 prerequisites, CSE3461, and (preferably) CSE4441

Recommended Background: Interest in user interfaces and human-computer interaction (HCI). Understanding of experiment design. Experience in doing user studies.

Supervisor: Scott MacKenzie

Required Background: General 4080 prerequisites, CSE3461, and (preferably) CSE4441

Recommended Background: Interest in user interfaces and human-computer interaction (HCI). Understanding of experiment design. Experience in doing user studies.

Supervisor: Andy Mirzaian

Required background: General prerequisites

Recommended background: CSE 3101

Description

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.

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.

Supervisor: Zbigniew Stachniak

Required background: General prerequisites

Recommended background: Passion for programming and experimentation; Some knowledge of propositional and predicate logic

Description

Quantified Propositional Logics (QPL) plays an important role in a number of computer science disciplines from the theoretical computer science to knowledge representation and verification. There are also a number of open problems concerning this logic, and formulated more than 70 years ago, that can be finally solved (or at least approached) using automated reasoning techniques. The first step in such investigations has to be the design and implementation of a theorem prover, or automated reasoning system, for QPL. Such a system should, in principle, be able to determine whether or not a given formula of QPL is a theorem (or a tautology) in this logic.

The theorem prover for QPL is to be designed, implemented, and fully tested.

Background: Various variants of QPL have been formally formulated for the first time in the 1920s by a number of logicians and mathematicians. In modern computer science, QPL plays a significant role in theoretical computer science (proof complexity, satisfiability) as well as in verification and AI.

Supervisor: Zbigniew Stachniak

Required background: General prerequisites

Recommended background: Java (including 2D graphics); Some knowledge of PC hardware architecture; Some knowledge of (any) assembler language is an asset.

Description

Have you ever considered writing your own emulator of an interesting system? There has been a substantial activity in building software emulators of historically significant computers, game consoles, and, recently, smart communication devices. 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. It also allows for cost-effective development of contemporary software and hardware. The project's objective is to design and implement an emulator of the NABU Network – one of the earliest “proto-Internet” networks. The emulator is to be implemented in Java.

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 .