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

David Felton

Optimization and Evaluation of Physical Complementary Radar Waveforms

When & Where:


Nichols Hall, Room 129 (Apollo Auditorium)

Committee Members:

Shannon Blunt, Chair
Rachel Jarvis
Patrick McCormick
James Stiles
Zsolt Talata

Abstract

The RF spectrum is a precious, finite resource with ever-increasing demand. Consequently, the mandate to be a "good spectral neighbor" is in direct conflict with the requirements for high-performance sensing where correlation error is fundamentally limited. As such, matched-filter radar performance is often sidelobe-limited with estimation error being constrained by the time-bandwidth (TB) of the collective emission. The methods developed here seek to bridge this gap between idealized radar performance and practical utility via waveform design.    

Estimation error becomes more complex when employing pulse-agility. In doing so, range-sidelobe modulation (RSM) spreads energy across Doppler, rendering traditional methods ineffective. To address this, the gradient-based complementary-FM framework was developed to produce complementary sidelobe cancellation (CSC) after coherently combining subsets within a pulse-agile emission. In contrast to the majority of complementary signals, explored via phase-coding, these Comp-FM waveform subsets achieve CSC while preserving hardware-compatibility since they are FM (though design distortion is never completely avoided). Although Comp-FM addressed practicality via hardware amenability, CSC was localized to zero-Doppler. This work expands the Comp-FM notion to a Doppler-generalized (DG) framework, extending the cancellation condition to an arbitrary span. The same framework can likewise be employed to jointly optimize an entire coherent processing interval (CPI) to minimize RSM within the radar point-spread-function (PSF), thereby generalizing the notion of complementarity and introducing the potential for cognitive operation if sufficient scattering knowledge is available a-priori.          

Sensing with a single emitter is limited by self-inflicted error alone (e.g., clutter, sidelobes), while MIMO systems must additionally contend with the cross-responses from emitters operating concurrently (e.g., simultaneously, spatially proximate, in a shared spectrum), further degrading radar sensitivity. Now, total correlation error is dictated by the overlapping TB (i.e., how coincident are the signals) and number of operating emitters, compounding difficulty to estimate if left unaddressed. As such, the determination of "orthogonal waveforms" comprises a large portion of MIMO literature, though remains a phenomenological misnomer for pulsed emissions. Here, the notion of complementary-FM is applied to a multi-emitter context in which transmitter-amenable quasi-orthogonal subsets, occupying the same spectral band, are produced via a similar gradient-based approach. To further practicalize these MIMO-Comp-FM waveform subsets, the same "DG" approach described above, addressing the otherwise-default Doppler-induced degradation of complementary signals, is applied. In doing so, Doppler-independent separability and complementarity greatly improves estimation sensitivity for multi-emitter systems. 

This MIMO-Comp-FM framework is developed for standard matched filter processing. Coupling this framework with a "DG" form of the previously explored MIMO-MiCRFt is also investigated, illustrating the added benefit of pairing optimized subsets with similarly calibrated processing. 

Each of these methods is developed to address unique and increasingly complex sources of estimation error. All approaches are initially developed and evaluated via simulated analysis where ground-truth is known. Then, despite hardware-induced distortion being unavoidable, the MIMO-Comp-FM framework is confirmed via loopback measurements to preserve the majority of CSC that was observed in simulation. Finally, open-air demonstration of each approach validates practical utility on a radar system.


Hao Xuan

Toward an Integrated Computational Framework for Metagenomics: From Sequence Alignment to Automated Knowledge Discovery

When & Where:


Nichols Hall, Room 246 (Executive Conference Room)

Committee Members:

Cuncong Zhong, Chair
Fengjun Li
Suzanne Shontz
Hongyang Sun
Liang Xu

Abstract

Metagenomic sequencing has become a central paradigm for studying complex microbial communities and their interactions with the host, with emerging applications in clinical prediction and disease modeling. In this work, we first investigate two representative application scenarios: predicting immune checkpoint inhibitor response in non-small cell lung cancer using gut microbial signatures, and characterizing host–microbiome interactions in neonatal systems. The proposed reference-free neural network captures both compositional and functional signals without reliance on reference genomes, while the neonatal study demonstrates how environmental and genetic factors reshape microbial communities and how probiotic intervention can mitigate pathogen-induced immune activation.

These studies highlight both the promise and the inherent difficulty of metagenomic analysis: transforming raw sequencing data into clinically actionable insights remains an algorithmically fragmented and computationally intensive process. This challenge arises from two key limitations: the lack of a unified algorithmic foundation for sequence alignment and the absence of systematic approaches for selecting and organizing analytical tools. Motivated by these challenges, we present a unified computational framework for metagenomic analysis that integrates complementary algorithmic and systems-level solutions.

First, to resolve fragmentation at the alignment level, we develop the Versatile Alignment Toolkit (VAT), a unified algorithmic system for biological sequence alignment across diverse applications. VAT introduces an asymmetric multi-view k-mer indexing scheme that integrates multiple seeding strategies within a single architecture and enables dynamic seed-length adjustment via longest common prefix (LCP)–based inference without re-indexing. A flexible seed-chaining mechanism further supports diverse alignment scenarios, including collinear, rearranged, and split alignments. Combined with a hardware-efficient in-register bitonic sorting algorithm and dynamic index-loading strategy, VAT achieves high efficiency and broad applicability across read mapping, homology search, and whole-genome alignment. Second, to address the challenge of tool selection and pipeline construction, we develop SNAIL, a natural language processing system for automated recognition of bioinformatics tools from large-scale and rapidly growing scientific literature. By integrating XGBoost and Transformer-based models such as SciBERT, SNAIL enables structured extraction of analytical tools and supports automated, reproducible pipeline construction.

Together, this work establishes a unified framework that is grounded in real-world applications and addresses key bottlenecks in metagenomic analysis, enabling more efficient, scalable, and clinically actionable workflows.


Pramil Paudel

Learning Without Seeing: Privacy-Preserving and Adversarial Perspectives in Lensless Imaging

When & Where:


Eaton Hall, Room 2001B

Committee Members:

Fengjun Li, Chair
Alex Bardas
Bo Luo
Cuncong Zhong
Haiyang Chao

Abstract

Conventional computer vision relies on spatially resolved, human-interpretable images, which inherently expose sensitive information and raise privacy concerns. In this study, we explore an alternative paradigm based on lensless imaging, where scenes are captured as diffraction patterns governed by the point spread function (PSF). Although unintelligible to humans, these measurements encode structured, distributed information that remains useful for computational inference. 

We propose a unified framework for privacy-preserving vision that operates directly on lensless sensor measurements by leveraging their frequency-domain and phase-encoded properties. The framework is developed along two complementary directions. First, we enable reconstruction-free inference by exploiting the intrinsic obfuscation of lensless data. We show that semantic tasks such as classification can be performed directly on diffraction patterns using models tailored to non-local, phase-scrambled representations. We further design lensless-aware architectures and integrate them into practical pipelines, including a Swin Transformer-based steganographic framework (DiffHide) for secure and imperceptible information embedding. To assess robustness, we formalize adversarial threat models and develop defenses against learning-based reconstruction attacks, particularly GAN-driven inversion. Second, we investigate the limits of privacy by studying the reconstructability of lensless measurements without explicit knowledge of the forward model. We develop learning-based reconstruction methods that approximate the inverse mapping and analyze conditions under which sensitive information can be recovered. Our results demonstrate that lensless measurements enable effective vision tasks without reconstruction, while providing a principled framework to evaluate and mitigate privacy risks. 


Past Defense Notices

Dates

LUKE DODGE

Rule Induction on Data Sets with Set-Value Attributes

When & Where:


1 Eaton Hall

Committee Members:

Jerzy Grzymala-Busse, Chair
Arvin Agah
Bo Luo


Abstract

Data sets may have instances where multiple values are possible which are described as set-value attributes. The established LEM2 algorithm does not handle data sets with set-value attributes. To solve this problem, a parallel approach was used during LEM2's execution to avoid preprocessing data. Changing the creation of characteristic sets and attribute-value blocks to include all values for each case allows LEM2 to induce rules on data sets with set-value attributes. The ability to create a single local covering for set-value data sets increases the variety of data LEM2 can process.


SIRISHA THIPPABHOTLA

Applying Machine Learning Algorithms for Predicting Gender based on Voice

When & Where:


1415A LEEP2

Committee Members:

Jerzy Grzymala-Busse, Chair
Prasad Kulkarni
Bo Luo


Abstract

Machine learning is being applied in many domains of research. One such research area is the automation of gender prediction. The goal of this project is to determine a person’s gender based on his/her voice. Although it may seem like a simple task for any human to recognize this, the difficulty lies in the process of training a computer to do this job for us. This project is implemented by training models based on input data of voice samples from both male and female voices. The voice samples considered were from different datasets, with varying frequencies, noise ratios etc. This input data is passed through various machine learning models, with/without parameter tuning, to compare results. A comparative analysis of multiple machine learning algorithms was conducted, and the prediction with the highest accuracy is displayed as output for the given input voice sample.

 

 


SUNDEEP GANJI

A Hybrid Web Application For Conducting In Class Quizzes

When & Where:


1415A LEEP2

Committee Members:

Prasad Kulkarni, Chair
Jerzy Grzymala-Busse
Gary Minden


Abstract

Every student comes to the class with a smart phone, and they are constantly distracted. It has become a tough challenge for the instructors to keep the students focused on the lectures. The idea of this project is to build a hybrid responsive web application which helps the instructors to post questions between their discussions. The students can give their responses through their smart phones instantly. This enables the instructor to analyze the understanding of the students on the current topic through various statistics which are generated instantly. The instructors can improve their teaching methods while the students who are less interactive can give their voice along with others in the class and check their understanding. 

This application allows the instructor to add or edit courses in their account, add students to their courses, create or edit quizzes beforehand, post questions in different formats to the students, and analyze results through various kinds of plots. On the otherhand, a Student can view the courses he is added in to by his/her instructor, submit his/her responses for the quizzes posted. This application simplifies the process of conducting in-class quizzes and offers the students and the instructors an enhanced classroom experience. 


ALI MAHMOOD

Design, Integration, and Deployment of UAS-borne HF/VHF Ice Depth Sounding Radar and Antenna System

When & Where:


317 Nichols Hall

Committee Members:

Carl Leuschen, Chair
Fernando Rodriguez-Morales
Chris Allen


Abstract

The dynamic thinning of fast-flowing glaciers is so poorly understood that its potential impact on sea level rise remains unpredictable. Therefore, there is a dire need to predict the behavior of these ice bodies by understanding their bed topography and basal conditions, particularly near their grounding lines (the limit between grounded ice and floating ice). The ability to detect previous VHF radar returns in some key glacier regions is limited by strong clutter caused by severe ice surface roughness, volume scatter, and increased attenuation induced by water inclusions and debris. 
The work completed in the context of this thesis encompasses the design, integration, and field testing of a new compact light-weight radar and antenna system suitable for low-frequency operation onboard Uninhabited Aerial Systems (UASs). Specifically, this thesis presents the development of two tapered dipole antennas compatible with a 4-meter wingspan UAS. The bow-tie shaped antenna resonates at 35 MHz, and the meandering and resistively loaded element radiates at 14 MHz. Also discussed are the methods and tools used to achieve the necessary bandwidth while mitigating the electromagnetic coupling between the antennas and on-board avionics in a fully populated UAS. The influence of EM coupling on the 14 MHz antenna was nominal due to relatively longer wavelength. However, its input impedance had to be modified by resistive loading in order to avoid high power reflections back to the transmitter. The antenna bandwidths were further enhanced by employing impedance matching networks that resulted in 17.3% and 7.1% bandwidths at 35 MHz and 14 MHz, respectively. 
Finally, a compact 4 lbs. system was validated during the 2013-2014 Antarctic deployment, which led to echo sounding of more challenging temperate ice in the Arctic Circle. The thesis provides results obtained from data collected during a field test campaign over the Russell glacier in Greenland compared with previous data obtained with a VHF depth sounder system operated onboard a manned aircraft. 

 

 


KELLY RODRIGUEZ

Analysis of Extracellular Recordings and Temporal Encoding in Delayed-Feedback Reservoir

When & Where:


1 Eaton Hall

Committee Members:

Yang Yi, Chair
Randolph Nudo
Shannon Blunt


Abstract

Technological advancements in analog and digital systems have enabled new approaches to study networks of physical and artificial neurons. In biological systems, a standard method to record neuronal activity is through cortically implanted micro electrode arrays (MEAs). As advances in hardware continue to push channel counts of commercial MEAs upwards, it becomes imperative to develop automatic methods for data acquisition and analysis with high accuracy and throughput. Reliable, low latency methods are critical in closed-loop neuroprosthetic paradigms such as spike-timing dependent applications where the activity of a single neuron triggers specific stimuli with millisecond precision. This work presents an adapted version of an online spike detection algorithm, previously employed successfully on in vitro recordings, that has been improved to work under more stringent in vivo environments subject to additional sources of variability and noise. The algorithm’s performance was compared with other commonly employed detection techniques for neural data on a newly developed and highly tunable extracellular recording model that features variable firing rates, adjustable SNRs, and multiple waveform characteristics. The testing framework was created from in vivo recordings collected during quiescence and electrical stimulation periods. The algorithm presents superior performance and efficiency in all evaluated conditions. Furthermore, we propose a methodology for online signal integrity analysis from MEA recordings and quantification of neuronal variability across different experimental settings. This work constitutes a stepping stone toward the creation of large scale neural data processing pipelines and aims to facilitate reproducibility in activity dependent experiments by offering a method for unifying various metrics calculated from single unit activity. Precise spike detection becomes crucial for experiments studying temporal in addition to rate coding mechanisms. To further study and exploit the potential of temporal coding, a delay-feedback-based reservoir (DFB) has been implemented in software. This artificial network is found to be capable of processing spikes encoded from a benchmark task with performance comparable to that of more complex networks. This work allows us to corroborate the capabilities of temporal coding in a minimally-complex system suitable for implementation in physical hardware and inclusion in low-power circuit applications where computational power is also necessary.

 

 


SALEH ESHTAIWI

A New Model Predictive Control Technique Based Maximum Power Point Tracking For Photovoltaic Systems

When & Where:


2001B Eaton Hall

Committee Members:

Reza Ahmadi, Chair
Chris Allen
Jerzy Grzymala-Busse
Ron Hui
Elaina Sutley

Abstract

The worldwide energy demand is being increased day by day, anticipated to increase for 48% from 2012 to 2040. The distributed generation (DG) including renewable energy resources such as wind and solar are part of the solution in terms of lowering electricity cost, power reliability, and environmental concerns and therefore must function efficiently. Designing a robust maximum power point tracking (MPPT) technique can ensure maximized energy harvesting from PV solar systems and increases conversion efficiency which is the significant hindrance for their growth. The maximum power point (MPP) varies with intrinsic and climate changes nonlinearly. Thus, MPPT methods are expected to seek the MPP regardless of the solar module and ambient changes. The proposed method is based on the concept of Model Predictive Control (MPC) with unique properties. MPC is a powerful class of controllers that uses a system modeling to predict future behavior and optimize performance objectives. Unlike the traditional techniques that are prone to lose a tracking direction and their consequences on the stability, the proposed technique treats the photovoltaic (PV) module as a plant and uses a digital observer for predicting the behavior of the PV module and tracking the MPP. Further, it unifies the simplicity of implementation, enhances the overall dynamics performance and is robust against atmosphere changes.


ELI SYMM

Wavelets in Electromagnetic Profile Inversion

When & Where:


2001B Eaton Hall

Committee Members:

Jim Stiles, Chair
Chris Allen
Ron Hui


Abstract

Historical subsurface sensing methods applied to planar ice and snow sheets rely on underlying assumptions about the physical situation governing volumetric backscatter. Namely, the stratification of the natural medium under investigation consists of layered material with distinctly different dielectric properties. While appropriate for recovering sharp spatial discontinuities in the relative permittivity, the layer stripping approach [1] is not applicable to smooth permittivity variations about a common mean. In this project we developed techniques to model both the forward scattering from one-dimensional permittivity variation and the inverse problem - estimating the permittivity profile from the reflected energy. The underlying assumption is that smoothly varying inhomogeneities may be decomposed into wavelet basis functions which efficiently represent natural perturbations about an effective mean. Potential applications for this method are in ground penetrating radar, ionospheric sounding, nondestructive evaluation, and medical imaging.


MICHAEL STEES

Robust High Order Mesh Generation and Untangling

When & Where:


317 Nichols Hall

Committee Members:

Suzanne Shontz, Chair
Perry Alexander
Prasad Kulkarni
Jim Miller
Weizhang Huang

Abstract

Simulating the mechanics of a beating heart requires the numerical solution of partial differential equations. An application like this is a good candidate for high order computational methods that deliver higher solution accuracy at a lower cost than their low order counterparts. 
To fully leverage these high order computational methods, they must be paired with an accurate discretization of the domain. For a geometry like the heart, this requires a high order mesh. Thus robust high order mesh generation is a critical component to the widespread adoption of high order computational methods for numerically solving partial differential equations. Toward this end, we are developing high order mesh generation and untangling methods. As our first step, we have developed an optimization-based second order mesh generation method that employs triangles and tetrahedra. We will also develop generation methods for quadrilateral and hexahedral elements. Finally, we will develop untangling methods that can be used to untangle our generated meshes, as well as untangle any tangled elements that occur during motion (e.g. the beating of the heart). 


PRASANTH VIVEKANANDAN

A Simplex Architecture for Intelligent and Safe Unmanned Aerial Vehicles

When & Where:


250 Nichols Hall

Committee Members:

Heechul Yun, Chair
Prasad Kulkarni
Bo Luo


Abstract

Unmanned Aerial Vehicles (UAVs) are increasingly demanded in civil, military and research purposes. However, they also possess serious threats to the society because faults in UAVs can lead to physical damage or even loss of life. While increasing their intelligence, for example, adding vision-based sense-and-avoid capability, has a potential to reduce the safety threats, increased software complexity and the need for higher 
computing performance create additional challenges—software bugs and transient hardware faults—that must be addressed to realize intelligent and safe UAV systems. 
This work present a fault tolerant system design for UAVs. Our proposal is to use two heterogeneous hardware and software platforms with distinct reliability and performance characteristics: High-Assurance (HA) and High-Performance (HP) platforms. The HA platform focuses on simplicity and 
verfiability in software and uses a simple and transient fault tolerant processor, while the HP platform focuses on intelligence and functionality in software and uses a complex and high performance processor. During the normal operation, the HP platform is responsible for controlling the UAV. However, if it fails due to transient hardware faults or software bugs, the HA platform will take over until the HP platform recovers. 
We have implemented the proposed design on an actual UAV using a low-cost Arduino and a high-performance Tegra TK1 multicore platform. Our case-studies show that our design can improve safety without compromising performance and intelligence of the UAV. 


YUANWEI WU

Learning Deep Neural Networks for Object Detection and Tracking

When & Where:


317 Nichols Hall

Committee Members:

Richard Wang, Chair
Arvin Agah
Lingjia Liu
Bo Luo
Haiyang Chao

Abstract

Scene understanding in both static images and dynamic videos is the ultimate goal in computer vision. As two important sub-tasks of this endeavor, object detection and tracking have been extensively studied in the past decades, however, the problem is still not well addressed. The main challenge is that the appearance of objects is affected by a number of factors, such as scale, occlusion, illumination, and so on. Recently, deep learning has attracted lots of interests in the computer vision community. However, how to tackle these challenges in object detection and tracking is still an open problem. In this work, we propose a method for detecting objects in images using a single deep neural network, which can be optimized end-to-end and predict the object bounding boxes and class probabilities in one evaluation. To handle the challenges in object tracking, we propose a framework, which consists of a novel deep Convolutional Neural Networks (CNNs) to effectively generate robust spatial appearance, and a Long Short-term Memory (LSTM) network that incorporates temporal information to achieve long-term object tracking accuracy in real-time.