Defense Notices


All students and faculty are welcome to attend the final defense of EECS graduate students completing their M.S. or Ph.D. degrees. Defense notices for M.S./Ph.D. presentations for this year and several previous years are listed below in reverse chronological order.

Students who are nearing the completion of their M.S./Ph.D. research should schedule their final defenses through the EECS graduate office at least THREE WEEKS PRIOR to their presentation date so that there is time to complete the degree requirements check, and post the presentation announcement online.

Upcoming Defense Notices

Jennifer Quirk

Aspects of Doppler-Tolerant Radar Waveforms

When & Where:


Nichols Hall, Room 129 (Apollo Auditorium)

Committee Members:

Shannon Blunt, Chair
Patrick McCormick
Charles Mohr
Alessandro Salandrino
Zsolt Talata

Abstract

The Doppler tolerance of a waveform refers to its behavior when subjected to a fast-time Doppler shift imposed by scattering that involves nonnegligible radial velocity. While previous efforts have established decision-based criteria that lead to a binary judgment of Doppler tolerant or intolerant, it is also useful to establish a measure of the degree of Doppler tolerance. The purpose in doing so is to introduce a Doppler "quasi-tolerant" trade-space that can ultimately inform automated/cognitive waveform design in increasingly complex and dynamic radio frequency (RF) environments. This idea of Doppler quasi-tolerance leads to the development of random FM (RFM) waveforms that retain a degree of Doppler tolerance while still providing the diversity of a nonrepeating waveform structure. The ensuing ambiguity functions split the delay/Doppler ridge into a variety of different patterns. Since these patterns are known at transmission, a strategy for appropriate coherent slow time combining is demonstrated in simulation. Separately, the application of slow-time coding (STC) to the Doppler-tolerant linear FM (LFM) waveform has been examined for disambiguation of multiple range ambiguities. However, using STC with non-adaptive Doppler processing often results in high Doppler "cross-ambiguity" side lobes that can hinder range disambiguation despite the degree of separability imparted by STC. To enhance this separability, a gradient-based optimization of STC sequences is developed, and a "multi-range" (MR) modification to the reiterative super-resolution (RISR) approach that accounts for the distinct range interval structures from STC is examined. The efficacy of these approaches is demonstrated using open-air measurements. Pulse agility is an alternative range disambiguation technique that relies on pulse-to-pulse waveform separability. Although pulse-agile waveforms are often uncorrelated and therefore amenable to range disambiguation, they may exhibit poor Doppler tolerance. To preserve Doppler tolerance and achieve separability, a class of hybrid waveforms is developed whereby a phase code is embedded on an LFM base waveform. A gradient-based optimization is developed for this waveform structure to achieve enhanced suppression of range-folded scattering in desired delay/Doppler regions. The Doppler tolerance and separability of the optimized waveforms are examined in simulation, and open-air measurements are used to demonstrate the range disambiguation capability.


Logan Schmalz

A Framework for Controlled Key Release

When & Where:


Nichols Hall, Room 246 (Executive Conference Room)

Committee Members:

Perry Alexander, Chair
Drew Davidson
Sankha Guria


Abstract

Modern security relies heavily on public key cryptography, and private keys and secrets in general must be protected from attackers. Against a highly-capable adversary it is ideal to store secrets outside of main memory, which is easy on general purpose systems with the now widely-available Trusted Platform Module (TPM) 2.0. However, the lack of integration between the TPM and the OS makes protecting secrets with automated availability needs difficult. We develop a strategy to authenticate OS entities and protect TPM-stored secrets without restricting access to the TPM, using standard features available on Linux---SELinux, Integrity Measurement Architecture (IMA), Extended Verification Module (EVM), and Linux Unified Key Setup (LUKS).


Past Defense Notices

Dates

AKHILESH MISHRA

Multi-look SAR Processing and Array Optimization Applied to Radio Echo Sounding of Ice Sheets

When & Where:


317 Nichols Hall

Committee Members:

Carl Leuschen, Chair
Stephen Yan
Prasad Gogineni


Abstract

Increase in sea level is a problem of global importance because of its impact on infrastructure and residents in coastal regions. Airborne and satellite observations have shown that the margins of Greenland and Antarctic ice sheets are melting and retreating, steadily increasing their contribution to sea level rise over the last decade. To understand the ice dynamics and develop models to generate accurate estimates of ice sheets’ future contribution to sea level rise, more information on ice thickness and basal conditions are required. Airborne ice penetrating radars are routinely deployed on long-range aircraft to perform ice thickness measurements, which are needed to derive information on bed topography and basal conditions. Acquiring useful radar reflections from the ice-bed interface is very challenging in regions where ice sheets are exhibiting the most rapid changes because returns from the ice-bed are very weak and often masked by the off nadir surface clutter. Advanced signal processing techniques, such as Synthetic Aperture Radar (SAR) and array processing, are required to filter the clutter and extract weak bed echoes buried in the noise. However, past attempts to detect these signals have not been completely successful because system and target-induced errors on SAR and array processing are not fully compensated. SAR processing in areas with significant surface slope degrades signal-to-noise ratio. Also, systematic and random errors in amplitude and phase between receive channels degrade the performance of array processors used to synthesize cross-track beam pattern. 
A novel Multi-look Time Domain Back Projection (MLTDBP) parallel processor has been developed to accurately model the electromagnetic wave propagation through the ice and generate echograms with better SNCR (Signal to Noise-Clutter Ratio) in the along-track dimension. A novel dynamic channel equalization method (based on null optimization) has been developed to adaptively calibrate the receive channels, giving an improved SNCR for the cross-track processing algorithms. Results from two-dimensional processing algorithms have been shown to be effective in extracting weak bed echoes, sloped internal ice layers, deep internal ice layers; and these results are also used to generate 3D ice-bed map of fast flowing Kangiata Nunaata Sermia (KNS) glacier in southwest Greenland.


SUSOBHAN DAS

Tunable Nano-photonic Devices

When & Where:


246 Nichols Hall

Committee Members:

Ron Hui, Chair
Alessandro Salandrino
Chris Allen
Jim Stiles
Judy Wu

Abstract

High speed photonic systems and networks require electro-optic modulators to encode electronic signal onto optical carrier. The central focus of this research is twofold. First, tunable properties and tuning mechanisms of optical materials like Graphene, Vanadium dioxide (VO2), and Indium Tin Oxide (ITO) are characterized systematically in the 1550nm telecommunication wavelength. Then, these materials are implemented to design novel nano-photonic devices with high efficiency and miniature footprint suitable for photonic integration. 
Specifically, we experimentally investigated the complex index of graphene in near infrared (NIR) wavelength through the reflectivity measurement on a SiO2/Si substrate. The measured change of reflectivity as the function of applied gate voltage is highly correlated with the Kubo formula. Based on a fiber-optic pump-probe setup we demonstrated that short optical pulses can be translated from pump wavelength to probe wavelength through dielectric-to-metal phase transition of VO2. In this process, pump leading edge induced optical phase modulation on the probe is converted into an intensity modulation through an optical frequency discriminator. We also theoretically modeled the permittivity of ITO with different levels of doping concentration in NIR region. 
We proposed an ultra-compact electro-optic modulator based on switching plasmonic resonance “ON” and “OFF” of ITO-on-graphene via tuning of graphene chemical potential through electrical gating. The plasmonic resonance of ITO-on-graphene significantly enhances the field interaction with graphene which allows the size reduction compare to graphene based modulators without ITO. We presented a scheme of mode-multiplexed NIR modulator by tuning ITO permittivity as the function of carrier density through applied voltage. The wisely patterned ITO on top of an SOI ridge waveguide portrayed the independent modulation of two orthogonal modes simultaneously, which enhances functionality per-area. We proposed a theoretical model of tunable anisotropic metamaterial composed of periodic layers of graphene and Hafnium Oxide where transversal permittivity can be tuned via changing the chemical potential of graphene. A novel metamaterial assisted tunable photonic coupler is designed by inserting the proposed artificial tunable metamaterial in the coupling region of a waveguide coupler. The coupling efficiency can be tuned by changing the permittivity of metamaterial through electrical gating. 


PRANAV BAHL

WOLF (machine learning WOrk fLow management Framework)

When & Where:


246 Nichols Hall

Committee Members:

Luke Huan, Chair
Fengjun Li
Bo Luo


Abstract

Recently machine learning has been creating great strides in many areas of work field such as health, finance, education, sports etc., which has encouraged demand for machine learning systems. By definition machine learning automates the task of learning in terms of rule induction, classification, regression etc. This is then used to draw knowledgeable insights and to forecast an event before it actually takes place. Despite this automation, machine learning still does not automate the task of selecting the best algorithm(s) for a specific dataset. With the rapidly growing machine learning algorithms it has become difficult for novices as well as researchers to choose the best algorithm. The crux of a machine learning system is (1) to solve fundamental problems of preprocessing the data to help machine learning algorithm understand the data better; (2) to solve the problem of choosing meaningful features hence reducing the noise from the data; and (3) to choose the best resulting machine learning algorithm which is performed by doing grid search over hyperparameters of various machine learning algorithms and afterwards doing metric comparison amongst all outcomes. These are the problems addressed by Wolf. 
Automation is the fuel that drives Wolf. Automating time-consuming and repeatable tasks are the defining characteristics of the project. The rising scope of Artificial Intelligence (AI) and machine learning increases the need for automation to simplify the process, hence help researchers and data scientists dig deeper into the problem and understand it well, rather than spending time in tweaking the algorithms. The positive correlation of growing intelligence and the complexity of solutions has shifted the trend from Artificial Intelligence (AI) to Automated Intelligence, a paradigm on which Wolf is based. 
Wolf has been built to have an impact on a wider audience. The automation of machine learning pipeline saves ~40% of the work effort spent towards implementing and testing algorithm. It helps people with different levels of expertise and requirements, helps novices to identify best combinations of algorithms without having in depth knowledge of algorithms and helps researchers and businesses better their machine learning knowledge to figure out best resulting hyperparameters. 


FARHAD MAHMOOD

Modeling and Analysis of Energy Efficiency in Wireless Handset Transceiver Systems

When & Where:


250 Nichols Hall

Committee Members:

Erik Perrins, Chair
Lingjia Liu
Shannon Blunt
Victor Frost
Bozenna Pasik-Duncan

Abstract

As it is becoming a significant part of our daily life, wireless mobile handsets have become faster and smarter. One of the main remaining requirement by users is to have a longer lasting wireless cellular devices. Many techniques have been used to increase the capacity of the battery (Ampere per Hour), but that increases the safety concern. 
Instead, it is better to have mobile handsets that consume less energy i.e increase energy efficiency. Therefore, in this research proposal, we study and analyze the radio 
frequency(RF) transceiver energy consumption, which is the largest energy consumed in the cellular device. We consider a model of large number of parameters in order to make it more realistic. First a transmitter energy of single antenna device is considered for a fixed target probability of error in the receiver for multilevel quadratic amplitude modulations (MQAM). It will be found that the power amplifier (PA) consumes the highest portion of transceiver energy due to the low efficiency of the PA.
Furthermore, when MQAM and raised cosine filter are used, the impact of peak to average ratio (PAR) on PA becomes another source of energy wasting in the PA. This issue is analyzed in this research proposal with a number of promising solutions. This analysis of energy consumption for single antenna devices will help us analyze the energy consumption of multiple antennas devices. In this regard, we discuss the energy efficiency of multiple input multiple output (MIMO) antenna with known channel state information (CSI) at the transmitter. However, the study of energy efficiency of MIMO without CSI using space time coding will be our next step. 


THEODORE LINDSEY

Interesting Rule Induction Module: Adding Support for Unknown Attribute Values

When & Where:


2001B Eaton Hall

Committee Members:

Jerzy Grzymala-Busse, Chair
Bo Luo
Prasad Kulkarni


Abstract

IRIM (Interesting Rule Induction Module) is a rule induction system designed to induce particularly strong, simple rule sets. Additionally, IRIM does not require prior discretization of numerical attribute values. IRIM does not necessarily produce consistent rules that fully describe the target concepts, however, the rules induced by IRIM often lead to novel revelations of hidden relationships in a dataset. In this paper, we attempt to extend the IRIM system to be able to handle missing attribute values (in particular, lost and do-not-care attribute values) more thoroughly than ignoring the cases that they belong to. Further, we include an implementation of IRIM in the modern programming language Python that has been written for easy inclusion in within a Python data mining package or library. The provided implementation makes use of the Pandas module which is built on top of a C back end for quick performance relative to the performance normally found with Python. 

 

 


Sathya Mahadevan

Implementation of ID3 for Data Stored in Multiple SQL Databases

When & Where:


2001B Eaton Hall

Committee Members:

Jerzy Grzymala-Busse, Chair
Man Kong
Prasad Kulkarni


Abstract

Data classification is a methodology of data mining used to retrieve meaningful information from data. A model is built from the input training set which is later used to classify new observations. One of the most widely used models is a decision tree which uses a tree like structure to list all possible outcomes. Decision trees are preferred for their simple structure, requiring little effort for data preparation and easy interpretation. This project implements ID3, an algorithm for building the decision tree using information gain. The decision tree is converted to a set of rules and the error rate is calculated using the test dataset. The dataset is usually stored in a relational database in the form tables. In practice, it might be desired that data be stored across multiple databases. In such scenarios, retrieving and coordinating data from the databases could be a challenging task. This project provides the implementation of ID3 algorithm with the convenience of reading data stored at multiple data sources.


SATHYA MAHADEVAN

Implementation of ID3 for Data Stored in Multiple SQL Databases

When & Where:


2001B Eaton Hall

Committee Members:

Jerzy Grzymala-Busse, Chair
Man Kong
Prasad Kulkarni


Abstract

Data classification is a methodology of data mining used to retrieve meaningful information from data. A model is built from the input training set which is later used to classify new observations. One of the most widely used models is a decision tree which uses a tree like structure to list all possible outcomes. Decision trees are preferred for their simple structure, requiring little effort for data preparation and easy interpretation. This project implements ID3, an algorithm for building the decision tree using information gain. The decision tree is converted to a set of rules and the error rate is calculated using the test dataset. The dataset is usually stored in a relational database in the form tables. In practice, it might be desired that data be stored across multiple databases. In such scenarios, retrieving and coordinating data from the databases could be a challenging task. This project provides the implementation of ID3 algorithm with the convenience of reading data stored at multiple data sources.


CHAO LAN

Inequity Coefficient and Fair Transfer Learning

When & Where:


250 Nichols Hall

Committee Members:

Luke Huan, Chair
Lingjia Liu
Bo Luo
Xintao Wu
Jin Feng

Abstract

Fair machine learning is an emerging and urgent research topic that aims to avoid discriminatory predictions against protected groups of people in real-world decision makings. This project aims to advance the field in two dimensions. First, we propose a more practical measurement of individual fairness called inequity coefficient, which integrates the current individual fairness framework that lacks of practice and the current situation testing practice that lacks of principle. We develop certain foundations of the measurement and present its practice. Second, we propose a first study of fairness in the context of transfer learning, with focuses on the hypothesis transfer and multi-task settings over two tasks. We illustrate a new challenge called discriminatory transfer, where discrimination is enforced by traditional task relatedness constraints that only aim to find accurate hypotheses. We propose a set of new algorithms that aim to avoid discriminatory transfer across tasks or promote fairness within each task.


Chao Lan

Inequity Coefficient and Fair Transfer Learning

When & Where:


250 Nichols Hall

Committee Members:

Luke Huan, Chair
Lingjia Liu
Bo Luo
Xintao Wu
Jin Feng

Abstract

Fair machine learning is an emerging and urgent research topic that aims to avoid discriminatory predictions against protected groups of people in real-world decision makings. This project aims to advance the field in two dimensions. First, we propose a more practical measurement of individual fairness called inequity coefficient, which integrates the current individual fairness framework that lacks of practice and the current situation testing practice that lacks of principle. We develop certain foundations of the measurement and present its practice. Second, we propose a first study of fairness in the context of transfer learning, with focuses on the hypothesis transfer and multi-task settings over two tasks. We illustrate a new challenge called discriminatory transfer, where discrimination is enforced by traditional task relatedness constraints that only aim to find accurate hypotheses. We propose a set of new algorithms that aim to avoid discriminatory transfer across tasks or promote fairness within each task.


ROHIT BANERJEE

Extraction and Analysis of Amazon Reviews

When & Where:


246 Nichols Hall

Committee Members:

Fengjun Li, Chair
Man Kong
Bo Luo


Abstract

Amazon.com is one of the largest online retail stores in the world. Besides selling millions of product on their website, Amazon provides a variety of Web services including Amazon Review and Recommendation System. Users are encouraged to write product reviews to help others to understand products’ features and make purchase decisions. However, product reviews, as a type of user generated content (UGC), suffer from quality and trust problems. To help evaluating the quality of reviews, Amazon also provides the users with the helpfulness vote feature so that a user can support a review that he considers helpful. In this project we aim to study the relation between helpfulness votes and the ranks of the reviews. In particular, we are looking for answers to questions such as “how does the helpfulness votes affect review ranks?” and “how review rank and its presentation mechanism affect people’s voting behavior?” To investigate on these questions, we built a crawler to collect reviews and votes of reviews from Amazon at a daily basis. Then, we conducted an analysis on a dataset with over 50,000 Amazon reviews to identify the voting patterns and their impact on the review ranks. Our results show that there exists a positive correlation between the review ranks and the helpfulness votes.