ongoing
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
ongoing [2011/05/09 20:10] – bil | ongoing [2016/12/07 15:27] (current) – roumani | ||
---|---|---|---|
Line 1: | Line 1: | ||
- | ====== | + | ====== |
+ | ====== Comparison of Finger Tracking systems ====== | ||
+ | |||
+ | **Student**: | ||
+ | |||
+ | **Supervisor**: | ||
+ | |||
+ | **Required Background**: | ||
+ | |||
+ | __Description__ | ||
+ | This project compares the Leap Motion and the 3Gear System against each other in a comparative Fitts' law study | ||
+ | |||
+ | |||
+ | __Completed__ | ||
+ | Winter, 2013 | ||
+ | |||
+ | ====== Imputation of missing values in microarray data ====== | ||
+ | |||
+ | **Student**: | ||
+ | |||
+ | **Supervisor**: | ||
+ | |||
+ | __Description__ | ||
+ | |||
+ | Microarrays are a relatively new technology that have had tremendous | ||
+ | impact on many areas within biology and bioinformatics. | ||
+ | technology enables researchers to study the behaviour of many genes | ||
+ | and/or conditions in a single experiment. | ||
+ | |||
+ | Due to technological limitations and experiment design issues, | ||
+ | microarray data sets typically have several missing values. | ||
+ | shown that imputation of these values improves the accuracy of | ||
+ | different processing tasks, including clustering, that are typically | ||
+ | done on these data sets. Therefore, good imputation algorithms are | ||
+ | required. | ||
+ | |||
+ | In this project, we will explore fast and accurate imputation algorithms | ||
+ | for microarray data. The student will first read the papers assigned | ||
+ | and write a short summary of them. Then, he will study the performance | ||
+ | a few algorithms from the literature (many algorithms are already | ||
+ | implemented but 1 - 2 may need to be implemented). | ||
+ | work with the supervisor on the design of better algorithms for the | ||
+ | problem being studied. | ||
+ | compare the performance (accuracy and speed) of the new algorithm(s) to | ||
+ | the GMCImpute algorithm and several other existing ones. | ||
+ | |||
+ | Throughout the course, the student is required to maintain a course | ||
+ | website to report any progress and details about the project. | ||
+ | |||
+ | ====== An Open Source Structural Equation Modeling Graph Drawing Application ====== | ||
+ | |||
+ | **Student**: | ||
+ | |||
+ | **Supervisor**: | ||
+ | |||
+ | __Description__ | ||
+ | |||
+ | 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). | ||
+ | |||
+ | 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, | ||
+ | |||
+ | 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. | ||
====== Exploring the notion of Variability in Business Process Modeling (and its relationship with Goals) ====== | ====== Exploring the notion of Variability in Business Process Modeling (and its relationship with Goals) ====== | ||
Line 76: | Line 137: | ||
http:// | http:// | ||
+ | ====== Quantum Cryptography ====== | ||
+ | |||
+ | **Student**: | ||
+ | |||
+ | **Supervisor**: | ||
+ | |||
+ | __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, | ||
+ | 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. |
ongoing.1304971807.txt.gz · Last modified: 2011/05/09 20:10 by bil