Innovative Projects Realized

Explore thousands of successful projects resulting from collaboration between organizations and post-secondary talent.

13270 Completed Projects

1072
AB
2795
BC
430
MB
106
NF
348
SK
4184
ON
2671
QC
43
PE
209
NB
474
NS

Projects by Category

10%
Computer science
9%
Engineering
1%
Engineering - biomedical
4%
Engineering - chemical / biological

Super Fast Sparse Polynomial Interpolation

I’ve started a new research project with the goal of implementing a new algorithm which interpolates a polynomial F of degree D in N variables with T non-zero terms.

It has long been known how to interpolate a polynomial F(x) in one variable of degree D from D+1 values of F in O( D log D ) time.  The tool to do this is the Fast Fourier Transform.  It is considered to be one of the top 10 scientific computing achievements of the 20th century.  It has many applications.  But, if the polynomials are multivariate, in N variables they are usually sparse, that is, the number of terms T is much less than D^N, the Fast Four Transform may not help.   On such polynomials, the Fast Fourier Transform may take a very long time.   Since sparse polynomials occur in many practical applications, we need new algorithms and new tools.  A lot of researchers, beginning with Richard Zippel in his PhD thesis in 1979, have developed algorithms which are efficient for sparse polynomials.

We have a new algorithm that theoretically, is much better than Zippel’s algorithm, and the other algorithms in the literature.  Theoretically, It combines ideas and tools from cryptography, theoretical computing science, number theory, and algebra.  But in order for it to be fast, we need to implement a variety of algorithms, including the Fast Fourier Transform, for polynomials with coefficients from the integers modulo a prime where the prime can be small, e.g., 32 bits, medium, e.g. 64 bits, and large, i.e., more than 64 bits long.  Each case will be important for practical applications. We need help with programming mathematical algorithms for different cases and trying out various algorithms.  The list of algorithms needed includes algorithms for computing roots of polynomials over finite fields, taking discrete logarithms in finite fields where discrete logarithms are tractable, multiplying and dividing polynomials, computing greatest common divisors of polynomials, etc.The student would participate in a small group of students, two graduate students  and one other undergraduate student in a project to design and implement a software package of mathematical algorithms for polynomials in GF(p)[x], that is, polynomials in one variable whose coefficients are integers reduced modulo a prime p.  We will need a 32 bit library, a 64 bit library and a quadruple precision 128 bit library.  We will use the C programming language for the final version of the code but will try out algorithms in Maple.

View Full Project Description
Faculty Supervisor:

Dr. Michael Monagan

Student:

Jaiganesh Balasundaram

Partner:

Discipline:

Mathematics

Sector:

Information and communications technologies

University:

Simon Fraser University

Program:

Globalink Research Internship

Structural Properties of Propositional Formulas Defining Combinatorial Search Problems

We are interested in understanding the power and limitations of families of algorithms for solving combinatorial search problems, in particular those whose decision versions are NP-complete.   In some application areas involving such problems, the state of the art involves representing a problem instance as a formula of propositional logic (or a natural extension, typical examples being cardinality constraints and Boolean combinations of linear inequalities), and using a program designed to find satisfying assignments (e.g., a SAT solver, or SMT solver) to attempt to construct a solution. (SMT stands for Satisfiability Modulo Theories, which means satisfiability of a set of ground first order formulas involving atoms whose interpretation is determined by some decidable theory, e.g., Presburger arithmetic or the theory of arrays.)

An interesting observation about practical experience is that “industrial” SAT and SMT solvers commonly solve instances with millions of variables and clauses.   In contrast, we know how to design families of formulas with a few hundreds of variables which no known method could decide satisfiability of in our lifetimes.   While industrial sources produce a continual source of increasingly hard instances which are too hard for current technology to solve, these instances are nonetheless very easy relative to their number of variables when we take into account how small a hard formula can be.  Such observations have lead to considerable speculation about the structure of comparatively hard or easy instances from various sources. 

A frequent suggestion is that many industrial instances are relatively easy because they are satisfy some particular structural property, such as (a graph associated with the formula) having small width, by one of a number of related notions of with of graph width, and thus being solvable by efficient algorithms for instances with this property.   Actual evidence is weak: it is not clear that the formulas satisfy any such a property, and in many cases we know they do not – or even cannot – satisfy the most obvious candidate properties.  It is even less clear that the algorithms used in practice should be able to efficiently solve instances because they have properties of the sorts proposed.  However, there are many intriguing possibilities.

The students role will be to help in answering some particular parts of the first question.  Their work would proceed in the following stages: Reading of appropriate background material, and selection of a small number of families of formulas (e.g., from hardware verification, automated planning, bioinformatics, combinatorial designs, etc.) and structural properties to study (notions of width, scale-freeness, etc.); Study of algorithms and existing implementations for the properties chosen; preliminary experiments.  It is anticipated that we will not be able to measure interesting properties precisely for large instances with existing implementations; Work, together with the supervisor and other students (and likely a post-doc) on refining the algorithms and data structures to improve speed and thus the size of instances that can be measured; Prepare a report on the progress made.

View Full Project Description
Faculty Supervisor:

Dr. David Mitchell

Student:

Paul G C

Partner:

Discipline:

Computer science

Sector:

Information and communications technologies

University:

Simon Fraser University

Program:

Globalink Research Internship

Declarative Solving of Computationally Hard Search and Optimization Problems

Computationally hard search and optimization problems are ubiquitous in science, engineering and
business. Examples include drug design, protein folding, phylogeny reconstruction, hardware and
software design, test generation and verification, planning, timetabling, scheduling and on and on. In
rare cases, practical application-specific software exists, but most often development of successful
methods requires hiring specialists, and often significant time and expense, to apply one or more
computational approaches. The goal of our project is to provide another practical technology for
solving these problems, but one which would require considerably less specialized expertise on the
part of the user, thus making technology for solving such problems accessible to a wider variety of
users. In this approach, the user gives a precise specification of their search (or optimization)
problem in a declarative modeling language. A solver then takes this specification, together with an
instance of the problem, and produces a solution to the problem (if there is one). We undertake a
research program of both theoretical development and demonstrating practical feasibility through
system development.

The student will be working in a team which includes two faculty members, two PhD students and
two Masters students on a very active ongoing research project. The main task will be to write
specifications of search and optimization problems in an extension of First-Order (Predicate) Logic,
to develop some benchmarks, run experiments on our system and gather the performance statistics.
The student will have a choice of a more theoretical or a more applied work, depending on their
interests. The result will be used in research papers we plan to publish in first-rate academic
conferences and journals.

View Full Project Description
Faculty Supervisor:

Dr. Evgenia (Eugenia) Ternovska

Student:

Akshay Gupta

Partner:

Discipline:

Computer science

Sector:

Information and communications technologies

University:

Simon Fraser University

Program:

Globalink Research Internship

Personal Social Network Management

We are conducting an exciting project on building tools for managing personal social networks.  You have a lot of friends, communicating with you in a few online social networks, such as Facebook, LinkedIn, and Twitter, as well as some traditional channels, such as emails, phone calls, and online messages.  How to manage your contacts in a social network way?

This personal social network management project will construct tools to collect and organize communication details, analyze and recommend actions, and protect privacy.  While the details of the specific Globalink project will be further determined by the supervisor and the student, we expect that the student can finish a small but concrete component during the internship.  Some topics for example include entity ambiguity detection and removal, integration and aggregation of communication, visualization of communication and social networks.

The student will work under the supervision of Dr. Jian Pei and a Ph.D. student (as the mentor) to understand the global picture of the project, and contribute a concrete component to the tool set under development.  The student is expected to develop the algorithmic framework, very likely involving data mining and machine learning research, and implement a prototype.
 

View Full Project Description
Faculty Supervisor:

Dr. Jian Pei

Student:

Sameera Gupta

Partner:

Discipline:

Computer science

Sector:

Information and communications technologies

University:

Simon Fraser University

Program:

Globalink Research Internship

Modeling and simulation of fingering instabilities in groundwater flow

In this project, we aim to develop a mathematical model and perform numerical simulations for gravity-driven fingering instabilities that occur during the flow of groundwater in soils and aquifers.  Fingers form in response to gravitational forces that derive from the difference in density between invading water and displaced air.  These forces can destabilize an otherwise stable, planar wetting front, leading to a periodic array of rapidly propagating fingers.  These instabilities can play a very important role in the study of both contamination and remediation of soils, because fingers provide a route for rapid entry of rain or other surface water sources into the subsurface. Numerous models have been proposed for capturing fingered flow phenomena, which are mostly based on the well-known Richards equation for flow in porous media in combination with appropriate constitutive equations for soil properties.  In this project, we are interested in studying three specific models that employ different approaches for incorporating hysteresis and non-equilibrium effects in the dynamic equation that governs capillary pressure.  

Our aim in this project is to take the basic computational framework we have already developed in Matlab for Model A [1] and to extend it by implementing models B and C.  The governing equations in each case are a coupled nonlinear system of partial differential equations of parabolic type.  Based on the simple, rectangular geometry of the typical experimental soil sample, we will restrict ourselves to a two-dimensional rectangular domain and use a standard finite difference discretization in space.  The time discretization will be handled using a method-of-lines approach with the ODE solvers built-in to Matlab. We will then be prepared to perform a comprehensive comparison of the ability of all three models to simulate gravity-driven fingering phenomena, and to evaluate the advantages and disadvantages of each.  No such comparison has yet been done because models B and C [2,5] are relatively recent; neither has model B or C yet been systematically compared to the wealth of experimental data available in the literature (see the references in [1] for examples).

The student will spend roughly the first month reviewing the two models mentioned above and implementing an algorithm for the numerical solution in Matlab.  The code development will be aided by the fact that we already have a working model for capillary hysteresis [1], which is primary complication in the code. We will then perform a series of numerical simulations to validate the results and compare to other related models.  The aim is to determine which model most accurately and reliably captures observed fingering behavior.

View Full Project Description
Faculty Supervisor:

Dr. John Stockie

Student:

Samir Jain

Partner:

Discipline:

Mathematics

Sector:

Environmental industry

University:

Simon Fraser University

Program:

Globalink Research Internship

Stereoscopic Eye Tracking

This project involves several researchers in the Multimedia Communications Lab at SFU, and is
aimed at developing a prototype system for binocular stereoscopic eye tracking. The system
will consist of eyeglasses worn by the subject, two infrared eye cameras (one for each eye) and a
stereo imaging device. In addition to conventional gaze direction estimation, this would require
estimating the gaze depth as well. Some of the challenges related to the development of such a
system are: Synchronization of the measurements from the two eyes, multi-eye calibration, gaze depth estimation, markers for stereoscopic binocular eye tracking, visualization of 3-D fixation data.

The Globalink student intern working on this project may fit into any of the five subprojects
listed above, depending on his/her set of skills and interests.

View Full Project Description
Faculty Supervisor:

Dr. Ivan Bajic

Student:

Lokesh

Partner:

Discipline:

Engineering

Sector:

Information and communications technologies

University:

Simon Fraser University

Program:

Globalink Research Internship

Optimal design of experiments in geological carbon storage

The project’s aims are to conduct research on geological carbon storage from the perspective of dynamic analysis and process systems engineering, looking in particular at the dynamics between the wellhead and the CO2 storage reservoir. The main objective is to achieve closed loop operation and management of the reservoir with respect to CO2 sequestration and storage, along with enhanced oil recovery in cases where the reservoir is not fully depleted. The main thrust areas of the project are described below.

The research aims to develop an integrated approach to the co-optimization of CO2 storage and oil recovery, i.e., closed loop reservoir management. In order to develop closed loop strategies for reservoir management, the elements included in this research include the building of reduced order proxy/surrogate models, experiment design for well placement and parameter estimation, state estimation and model updating using variants of the ensemble Kalman filter. Since reservoir models and compositional simulators are computationally expensive to run, the development of reduced order models are crucial to enable experiment design, state estimation and optimization.

The student’s role in the project will be to work on the development of strategies for the optimal design of experiments in geological carbon storage. There are two main aspects to this work: the first is the use of surrogate / proxy reservoir models for D optimal experiment design, and comparison of the results with Bayesian sequential experiment design.  The second aspect is to obtain optimal subsets or groups of parameters that are identifiable from the experiment design.This project will involve the development and modification of MATLAB code for design of experiments and reparameterization. Code has already been developed in the group for these techniques, and the student’s main role will be to modify the code for use with reservoir simulations, and analysis of the results.

View Full Project Description
Faculty Supervisor:

Dr. Amos Ben-Zvi

Student:

Ayush Agrawal

Partner:

Discipline:

Chemistry

Sector:

Oil and gas

University:

University of Alberta

Program:

Globalink Research Internship

Lab-on-a-Chip for Detection of Listeria in Food Samples

Food safety is of paramount importance to Canada. Recent episode of Listeria out-break in a meat processing plant has created renewed interest in monitoring of food borne pathogens in ready-to-eat (RTE) meat products. The proposed device is aimed to detect Listeria monocytogenes in food samples within a few hours. This device integrates the microfluidics and the biosensor within a single platform, commonly referred to as a Lab-on-a-Chip (LOC). The proposed LOC will have a label free detection mechanism incorporating the state-of-art optofluidics principles and fabrications. The project will involve design, analysis and fabrication of the LOC and the prototype will be tested for its sensitivity and specificity towards L. monocytogenes. It is expected that the proposed LOC will provide timely early warning to any possible Listeria out-breaks in RTE meat products and will be an important tool for the regulators, like Canadian Food Inspection Agency, to monitor the meat processing units.

The student will be responsible for the following: Running microfluidics simulations, designing extraction process to be integrated with Lab-on-a-Chip (LOC) and working with other team members on various aspects of this industrial funded project.

View Full Project Description
Faculty Supervisor:

Dr. Sushanta K. Mitra

Student:

Aditya Bandopadhyay

Partner:

Discipline:

Engineering - mechanical

Sector:

Life sciences

University:

University of Alberta

Program:

Globalink Research Internship

Robust detector design based on Stochastic Resonance

The stochastic resonance (SR) is a phenomenon discovered recently in some nonlinear systems where addition of a certain amount of noise can, somewhat paradoxically, enhance its performance. It has found applications in biological sensory systems [1] such as visual, auditory systems, and tactile system as well as engineering applications such as ac-driven Schmitt triggers, and bistable ring lasers. The bistable systems (BS) are nonlinear systems [4] that are widely used as SR systems. The BS systems based detectors (henceforth referred to as BS-SR detectors) are constructed with a BS followed by an inner detector. The inner detector can be a matched filter (MF), a coherent detector or other types. It is also possible to directly apply the input to the inner detector and to make a decision. Therefore, the BS is considered as a preprocessor of the inner detector. Despite several achievements by researchers in the design of BS-SR detectors, there are still many unsolved issues and difficulties. The focus of this project is to address some of these issues.

Two potential applications of SR will be considered in this project. First, the SR detector will be used in digital watermarking in the DCT domain. The watermark information is considered as weak signal embedded in the DCT coefficients considered as noise. The statistics of the noise is difficult to estimate. The BS-detector provides a robust solution and the detection performance is expected to be improved significantly. Secondly, a SR detector will be used to detect features in MRI brain images. The MRI images do not have sharp features, and are noisy. It is difficult to detect small features (e.g., lesions or tumors) in an MRI image. We would investigate the use of SR detector in improving the feature detection performance.

The student will have a role both in theoretical development and experimental evaluation of the BS-SR detector, including the following three major tasks: The student will evaluate various measures of the BS performance for signal transmission, the student will investigate the relationship between the BS performance measure (MI or cross-correlation) and the BS system parameters, for given input signal and noise characteristics, the student will evaluate the efficacy of the developed performance measure by applying the SR detector in digital watermarking applications.

View Full Project Description
Faculty Supervisor:

Dr. Mrinal Mandal

Student:

Shaileshh BV

Partner:

Discipline:

Engineering - computer / electrical

Sector:

Information and communications technologies

University:

University of Alberta

Program:

Globalink Research Internship

Comparative Study of Fixed-Rate Coded and Rateless Coded Cooperative Wireless Networks

Fixed-rate coding for cooperative wireless networks with decode-and-forward (DF) relay processing has received much attention. Yet, only a fairly narrow body of research exists on rateless coded DF relaying networks. Little is known about how the performances and complexity implications of fixed-rate and rateless coded systems compare. Meanwhile, such comparisons play a vital role in the system design for cooperative networks. This project aims at casting light on the relative merits of fixed-rate and rateless coded relaying networks in terms of data throughput and complexity, by analysis and simulation. Two matching, state-of-the-art fixed-rate and rateless coded relaying networks will be analyzed, simulated, and compared in terms of achievable data rates, the amount of CSI and feedback required at different nodes, and sensitivity to CSI estimation errors. Low density parity check (LDPC) codes, or a similar match, for the fixed-rate coded scheme and Raptor codes, or a variation, for the rateless coded scheme will be considered. The project commences with studying single-relay networks. Depending on the progress of the analytical and simulation parts of the project, multi-relay networks and networks in which relays are also sources of information will be examined.

The student will be primarily responsible for a comprehensive literature survey and constructing a comprehensive bibliography of the work that has been performed to date. The student will also be responsible for the computer simulation of the fixed-rate and rateless coded schemes, to determine their error probabilities, maximum data throughputs, and the sensitivity of the data throughputs to channel fading and CSI estimation errors. The simulation includes generating random signals and fading gains, and implementing the transmitter with the encoder and the receiver with the decoder for both fixed-rate and rateless coded schemes. The optimal performance of the systems will be determined by varying different system parameters. Concurrently, the student will be instructed in the relevant statistical communication theory and coding theory, and will formulate mathematical models for the fixed-rate and rateless coded protocols and for coding and decoding at the transmitters and receivers, respectively.

The ultimate goal is to complete both mathematical and simulation comparisons between the fixed-rate and rateless coded relaying networks. If progress is rapid, the important effect of optimal power allocation between different users will be investigated via analytical optimization methods and simulation.

View Full Project Description
Faculty Supervisor:

Dr. Norman Beaulieu

Student:

Lakshmi Sumala

Partner:

Discipline:

Engineering - computer / electrical

Sector:

Information and communications technologies

University:

University of Alberta

Program:

Globalink Research Internship

Development of proxy reservoir models for geological carbon storage

The project’s aims are to conduct research on geological carbon storage from the perspective of dynamic analysis and process systems engineering, looking in particular at the dynamics between the wellhead and the CO2 storage reservoir. The main objective is to achieve closed loop operation and management of the reservoir with respect to CO2 sequestration and storage, along with enhanced oil recovery in cases where the reservoir is not fully depleted.

The research aims to develop an integrated approach to the co-optimization of CO2 storage and oil recovery, i.e., closed loop reservoir management. In order to develop closed loop strategies for reservoir management, the elements included in this research include the building of reduced order proxy/surrogate models, experiment design for well placement and parameter estimation, state estimation and model updating using variants of the ensemble Kalman filter. Since reservoir models and compositional simulators are computationally expensive to run, the development of reduced order models are crucial to enable experiment design, state estimation and optimization.

The student’s role in the project will be to develop proxy or surrogate models for reservoir simulators. In the literature, most proxy models have been developed using artificial neural networks (ANNs), with genetic algorithms being also being used in the development of the proxy models. The aim of this project is to use different, potentially better methods to develop reduced order models. The methods to be investigated include Karhunen-Loeve expansion, which is related to principal component analysis. Other methods include the use of suitable reparameterization techniques (e.g., discrete cosine transform, pseudo-parameter grouping) or analytical simplifications (e.g., streamline based models) of the detailed models.

View Full Project Description
Faculty Supervisor:

Dr. Biao Huang

Student:

Shrayank Gupta

Partner:

Discipline:

Engineering - chemical / biological

Sector:

Oil and gas

University:

University of Alberta

Program:

Globalink Research Internship

3D Visualization of Tunnelling Construction using a Construction Synthetic Environment

Our research aims at developing highly interactive and inter-operative applications for use in complex simulation environments. Its goals are to develop a suite of modeling, simulation, and analysis tools for: (1) the planning and management of construction projects throughout their life phases from conception to operation, (2) the training of construction personnel, and (3) the exploration of construction management best practices.

To facilitate these distributed simulation and industrial applications, we have been focusing on frameworks for Construction Synthetic Environments (CSE), which integrate multiple individual simulations using High Level Architecture to achieve comprehensive, extensive modeling of an industrial application. One such application is tunnelling.  The Tunnelling CSE  is based on our experience with the construction domain – tunnel simulation in this case – our findings related to the applicability of the High Level Architecture in construction simulation, and the developments of COSYE framework.  The CSE is composed of a number of individual simulations that collaborate to achieve comprehensive and extensible modeling of the entire tunnelling project.  The development of this CSE demonstrates a number of important features not readily available in the simulation systems of today including concurrent and collaborative development of large scale systems, distributed simulation, integrated simulation systems and real time visualization. Future developments will include sophisticated techniques for forecasting and tracking tunnel construction, as well as expansion of its 3D visualization capabilities.

The student’s role will be to familiarize him or herself with the tunnelling CSE, the concept of High Level Architecture, and the existing visualization faculties.  The student will then assist in furthering those faculties:  some possibilities include adding to the existing 3D model library, developing model textures through site visits, assisting in the development and integration of a 3D animation engine with the tunnelling CSE through TCP/IP, and exploring the possibilities of gaming engines.  The student will be encouraged to choose an area of focus and develop expertise in that area.  Because of the nature of HLA, the visualization component will be reusable in multiple CSEs once developed, and has the potential to be an extremely valuable contribution to both our research program and the construction industry as a whole.

View Full Project Description
Faculty Supervisor:

Dr. Simaan M. AbouRizk

Student:

Shreedhar Hardikar

Partner:

Discipline:

Engineering - civil

Sector:

Construction and infrastructure

University:

University of Alberta

Program:

Globalink Research Internship