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

Luke Staudacher

Enabling Versal-Based Signal Processing Through a Development Framework and User Guide

When & Where:


Nichols Hall, Room 246 (Executive Conference Room)

Committee Members:

Jonathan Owen, Chair
Shannon Blunt
Carl Leuschen
Erik Perrins

Abstract

AMD’s latest generation of adaptive system-on-chip (SoC) devices, the Versal product family, offers enhanced processing capabilities that are attractive to researchers and system designers. However, these capabilities introduce a significant knowledge barrier, limiting the practical benefits of Versal devices compared to more mature platforms from AMD, Intel, and other industry vendors. This project addresses this challenge through two primary deliverables: a software framework and a comprehensive user manual targeting Versal development. The software framework, named RSL Versal Core, provides a framework for users unfamiliar with Versal devices by selectively abstracting away more complex design components. Using a small set of commands, users can synthesize a programmable logic (PL) design, compile a Linux operating system for the onboard Arm processor with PL communication support, and program supported development boards. Following initial setup, the framework also supports extended software and firmware development for specific project needs. The accompanying user manual documents both RSL Versal Core and broader Versal development concepts. It guides users through reproducing and customizing the framework outputs manually and introduces key architectural and design principles useful for effective Versal-based system development. Together, these deliverables enable new developers to rapidly gain proficiency with Versal platforms and enable implementation of digital signal processing (DSP) concepts.


William Powers

Implementation and Analysis of Robust System-Informed Waveform Design

When & Where:


Nichols Hall, Room 246 (Executive Conference Room)

Committee Members:

Jonathan Owen, Chair
Shannon Blunt
Carl Leuschen


Abstract

Due to rapid advances in high-speed analog-to-digital conversion and software-defined architectures, modern radar systems increasingly shift signal generation and conditioning into the digital domain. These architectures enable high-fidelity signal capture and provide substantial flexibility in waveform synthesis and signal processing that was previously impractical in analog implementations. Despite these advances, however, achievable radar performance remains fundamentally constrained by the physical transmit hardware through which the signal is ultimately realized. Nonlinear amplification, finite bandwidth, and memory effects introduce distortion that creates a significant gap between idealized waveform design and the waveform that is physically radiated.

To address this limitation, this work proposes a system-aware radar waveform design framework that couples data-driven system identification with deterministic optimization to generate waveforms tailored to the underlying transmit hardware. A complex baseband memory polynomial model is developed to characterize nonlinear transmit-chain behavior using loopback measurements, where $\ell_1$-regularized LASSO estimation is employed to improve robustness against ill-conditioning and feature redundancy. Under this architecture, a generalized integrated sidelobe level (GISL) objective is reformulated using logarithmic scalarization to produce a numerically stable and Pareto-tunable optimization criterion capable of balancing output energy and sidelobe suppression. Additionally, efficient vectorized gradient expressions are derived using Wirtinger calculus and implemented using gradient-based descent and the limited-memory BFGS algorithm for practical high-dimensional waveform synthesis.

To validate the framework, a comprehensive hardware-in-the-loop testbench was developed supporting direct model identification and experimental evaluation of optimized waveform performance. Simulation and experimental results demonstrate that continuous-phase FM waveforms exhibit strong inherent robustness to nonlinear distortion, while phase-coded waveforms with large instantaneous phase discontinuities show significantly greater sensitivity to transmit-chain impairments. Across both waveform classes, the proposed framework achieves substantial improvements in output power efficiency and pulse compression performance relative to system-agnostic waveform design. These results demonstrate that transmitter constraints must be treated as fundamental design variables rather than secondary effects and establish system-aware optimization as a practical framework for next-generation radar waveform synthesis.


Cody Gish

Real-time GPU Based Arbitrary Waveform Generation Utilizing a Software-Defined Radar Platform

When & Where:


Nichols Hall, Room 246 (Executive Conference Room)

Committee Members:

Jonathan Owen, Chair
Shannon Blunt
Patrick McCormick


Abstract

Due to the ever-growing demand for access to the finite resources of the electromagnetic spectrum, significant effort has been directed toward improving spectrum utilization. This has become a particular challenge in radar transmission design, where waveform diversity techniques have emerged as a promising solution despite the accompanying implementation complexity. Diverse signals are inherently non-repeating and pose unique challenges in comparison to traditional radar waveforms. Software defined radios (SDRs) allow for traditional RF components and signal processing to be implemented and controlled in software rather than hardware, providing a platform for testing experimental radar algorithms. This thesis presents a real-time parallel implementation of five previously developed distinct waveform-diverse radar signals for use in a coherent SDR system. The implemented waveforms include stochastic waveform generation (StoWGe), multi-user radar communication (MURC), phase-attached radar communication (PARC), pseudo-random optimized frequency modulation (PRO-FM), and waveform recycling. To enable real-time generation at maximum SDR data rates, these waveforms are implemented using digital synthesis techniques via GPU parallel processing. This approach alleviates CPU resource limitations by offloading computationally intensive waveform generation tasks to the GPU, enabling continuous high-throughput operation. A custom asynchronous transmit and receive architecture is developed to integrate these GPU-accelerated waveforms with UHD-based SDR hardware. The system leverages a multithreaded framework approach that can sustain coherent and synchronized radar operation. To validate the system, a series of loopback testing across all waveforms and a variety of parameters is completed to confirm the execution of the generate-transmit-receive chain.


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.


Past Defense Notices

Dates

MICHAEL BLECHA

Implementation of a 2.45GHz Power Amplifier for use in Collision Avoidance Radar

When & Where:


2001B Eaton Hall

Committee Members:

Chris Allen, Chair
Glenn Prescott
Jim Stiles


Abstract

The integration of a RF power amplifier into a Collision Avoidance Radar will increase the maximum detection distance of the radar. Increasing the maximum detection distance will allow a radar system mounted on an Unmanned Aircraft Vehicle to observe obstacles earlier and give the UAV more time to react. The UAVradars project has been miniaturized to support operation on an unmanned aircraft and could benefit from an increase in maximum detection distance. 
The goal of this project is to create a one watt power amplifier for the 2.4GHz-2.5GHz band that can be integrated into the UAVradars project. The amplifier will be powered from existing power supplies in the radar system and must be small and lightweight to support operation on board the UAV in flight. This project will consist of the schematic and layout design, simulations, fabrication, and characterization of the power amplifier. The power amplifier will be designed to fit into the current system with minimal system modifications required. 


HARSHUL ROUTHU

A Comparison of Two Decision Tree Generating Algorithms C4.5 and CART Based on Testing Datasets with Missing Attribute Values

When & Where:


2001B Eaton Hall

Committee Members:

Jerzy Grzymala-Busse, Chair
Prasad Kulkarni
Bo Luo


Abstract

In data mining, missing data are a common occurrence and can have a significant effect on the conclusions that can be drawn from the data. Classification of missing data is a challenging task. One of the most popular techniques for classifying missing data is decision tree induction. 
In this project, we compare two decision tree generating algorithms CART and C4.5 with their original implementations on different datasets with missing attribute values, taken from University of California Irvine (UCI). The comparative analysis of these two implementations is carried out in terms of accuracy on training and testing data, and decision tree complexity based on its depth and size. Results from experiments show that there is statistically insignificant difference between C4.5 and CART in terms of accuracy on testing data and complexity of the decision tree. On the other hand, accuracy on training data is significantly better for CART compared to C4.5. 


HADEEL ALABANDI

A Survey of Metrics Employed to Assess Software Security

When & Where:


246 Nichols Hall

Committee Members:

Prasad Kulkarni, Chair
Andy Gill
Heechul Yun


Abstract

Measuring and assessing software security is a critical concern as it is undesirable to develop risky and insecure software. Various measurement approaches and metrics have been defined to assess software security. For researchers and software developers, it is significant to have different metrics and measurement models at one place either to evaluate the existing measurement approaches, to compare between two or more metrics or to be able to find the proper metric to measure the software security at a specific software development phase. There is no existing survey of software security metrics that covers metrics available at all the software development phases. In this paper, we present a survey of metrics used to assess and measure software security, and we categorized them based on software development phases. Our findings reveal a critical lack of automated tools, and the necessity to possess detailed knowledge or experience of the measured software as the major hindrances in the use of existing software security metrics. 


HARISH SAMPANGI

Delay Feedback Reservoir (DFR) Design in Neuromorphic Computing Systems and its Application in Wireless Communications

When & Where:


2001B Eaton Hall

Committee Members:

Yang Yi, Chair
Glenn Prescott
Jim Rowland


Abstract

As semiconductor technologies continue to scale further into the nanometer regime, it is important to study how non-traditional computer architectures may be uniquely suited to take advantage of the novel behavior observed for many emerging technologies. Neuromorphic computing system represents a type of non-traditional architecture encompassing evolutionary. Reservoir computing, a computational paradigm inspired on neural systems, has become increasingly popular for solving a variety of complex recognition and classification problems. The traditional reservoir computing methods employs three different layers – the input layer, the reservoir and the output layer. The input layer feeds the input signals to the reservoir via fixed random weighted connections. These weights will scale the input that is given to the nodes, creating different input scaling for the input nodes. The second layer, which is called the reservoir, usually consists of a large number of randomly connected nonlinear nodes, constituting a recurrent network. Finally, the output weights are extracted from the output layer. Contrary to this traditional approach, the delayed feedback reservoir replaces the entire network of connected non-liner nodes just with a single nonlinear node subjected to delayed feedback. This approach does not only provide a drastic simplification of the experimental implementation of artificial neural networks for computing purposes, it also demonstrates the huge computational processing power hidden in even the simplest delay-dynamical system. Previous implementation of reservoir computing using the echo state network has been proven efficient for channel estimation in wireless Orthogonal Frequency-Division Multiplexing (OFDM) systems. This project aims at verifying the performance of DFR in channel estimation, by calculating its bit error rate (BER) and comparing it with other standard techniques like the LS and MMSE.


AUDREY SEYBERT

Analysis of Artifacts Inherent to Real-Time Radar Target Emulation

When & Where:


246 Nichols Hall

Committee Members:

Chris Allen, Chair
Shannon Blunt
Jim Stiles


Abstract

Executing high-fidelity tests of radar hardware requires real-time fixed-latency target emulation. Because fundamental radar measurements occur in the time domain, real-time fixed latency target emulation is essential to producing an accurate representation of a radar environment. Radar test equipment is further constrained by the application-specific minimum delay to a target of interest, a parameter that limits the maximum latency through the target emulator algorithm. These time constraints on radar target emulation result in imperfect DSP algorithms that generate spectral artifacts. Knowledge of the behavior and predictability of these spectral artifacts is the key to identifying whether a particular suite of hardware is sufficient to execute tests for a particular radar design. This work presents an analysis of the design considerations required for development of a digital radar target emulator. Further considerations include how the spectral artifacts inherent to the algorithms change with respect to the radar environment and an analysis of how effectively various DSP algorithms can be used to produce an accurate representation of simple target scenarios. This work presents a model representative of natural target motion, a model that is representative of the side effects of digital target emulation, and finally a true HDL simulation of a target.


CHRISTOPHER SEASHOLTZ

Security and Privacy Vulnerabilities in Unmanned Aerial Vehicles

When & Where:


246 Nichols Hall

Committee Members:

Bo Luo, Chair
Joe Evans
Fengjun Li


Abstract

In the past few years, UAVs have become very popular amongst the average citizen. Much like their military counterpart, these UAVs provide the ability to be controlled by computers, instead of a remote controller. While this may not appear to be a major security issue, the information gained from compromising a UAV can be used for other malicious activities. To understand potential attack surfaces of various UAVs, this paper presents the theory behind multiple possible attacks, as well as implementations of a select number of attacks mentioned. The main objective of this project was to obtain complete control of a UAV while in flight. Only a few of the attacks demonstrated, or mentioned, provide this ability. The remaining attacks mentioned provide information that can be used in conjunction with others in order to provide full control, or complete knowledge, of a system. Once the attacks have been proven possible, measures for proper defense must be taken. For each attack described in this paper, possible countermeasures will be given and explained.


ARIJIT BASU

Analyzing Bag of Visual Words for Efficient Content Based Image Retrieval and Classification

When & Where:


250 Nichols Hall

Committee Members:

Richard Wang, Chair
Prasad Kulkarni
Bo Luo


Abstract

Content Based Image Retrieval also known as QBIC (Query by Image Content) is a retrieval technique where detailed analysis of the features of an image is done for retrieving similar images from the image base. Content refers to any kind of information that can derived from the image itself like textures, color, shape which are primarily global features and local features like Sift, Surf, Hog etc. Content Based image retrieval as opposed to traditional text based image retrieval has been in the limelight for quite a while owing to its contribution in putting away too much responsibility from the end user and trying to bridge the semantic gap between low level features and high level human perception. 
Image Categorization is the process of classifying distinct image categories based on image features extracted from a subset of images or the entire database from each category followed by feeding it to a machine learning classifier which predicts the category labels eventually. Bag of Words Model is a very well known flexible model that represents an image as a histogram of visual patches. The idea originally comes from application of Bag of Words model in document retrieval and texture classification. Clustering is a very important aspect of the BOW model. It helps in grouping identical features from the entire dataset and hence feeding it to the Support Vector Machine Classifier. The SVM classifier takes into account every image that has been represented as a bag of visual features after clustering and then performs quality predictions. In this work we first apply the Bag of Words on well known datasets and then obtain accuracy parameters like Confusion Matrix, MCC, (Matthews Correlation Coefficient) and other statistical measures. For Feature selection we considered SURF Features owing to their rotation and scale invariant characteristics. The model has been trained and applied on two well known datasets Caltech 101 and Flickr- 25K followed by detailed performance analysis in different scenarios. 


SOUMYAJIT SARKAR

Biometric Analysis of Human Ear Recognition Using Traditional Approach

When & Where:


246 Nichols Hall

Committee Members:

Richard Wang, Chair
Jerzy Grzymala-Busse
Bo Luo


Abstract

Biometric ear authentication has received enormous popularity in recent years due to its uniqueness for each and every individual, even for identical twins. In this paper, two scale and rotation invariant feature detectors, SIFT and SURF, are adopted for recognition and authentication of ear images. An extensive analysis has been made on how these two descriptors work under certain real-life conditions; and a performance measure has been given. The proposed technique is evaluated and compared with other approaches on two data sets. Extensive experimental study demonstrates the effectiveness of the proposed strategy. Robust Estimation algorithm has been implemented to remove several false matches and improved results have been provided. Deep Learning has become a new way to detect features in objects and is also used extensively for recognition purposes. Sophisticated deep learning techniques like Convolutional Neural Networks(CNNs) have also been implemented and analysis has been done.Deep Learning Models need a lot of data to give a good result, unfortunately ear datasets available publicly are not very large and thus CNN simulations are being carried out on other state of the art datasets related to this research for evaluation of the model.


RUXIN XIE

Single-fiber-laser-based-multimodal coherent Raman System

When & Where:


250 Nichols Hall

Committee Members:

Ron Hui, Chair
Chris Allen
Shannon Blunt
Victor Frost
Carey Johnson

Abstract

Coherent Raman scattering (CRS) is an appealing technique for spectroscopy and microscopy, due to its selectivity and sensitivity. We designed and built single-fiber-laser-based coherent Raman scattering spectroscopy and microscopy system which can automatically maintain frequency synchronization between pump and Stokes beam. The Stokes frequency shift is generated by soliton self-frequency shift (SSFS) through a photonic crystal fiber. The impact of pulse chirping on the signal power reduction of coherent anti-Stokes Raman scattering (CARS) and stimulated Raman scattering (SRS) have been investigate through theoretical analysis and experiment. 

Our multimodal system provides measurement diversity among CARS, SRS and photothermal, which can be used for comparison and offering complementary information. Distribution of hemoglobin in human red blood cells and lipids in sliced mouse brain sample have been imaged. Frequency and power dependency of photothermal signal is characterized. 
Based on the polarization dependency of the third-order susceptibility of the material, the polarization switched SRS method is able to eliminate the nonresonant photothermal signal from the resonant SRS signal. Red blood cells and sliced mouse brain samples were imaged to demonstrate the capability of the proposed technique. The result shows that polarization switched SRS removes most of the photothermal signal. 


MAHITHA DODDALA

Properties of Probabilistic Approximations Applied to Incomplete Data

When & Where:


2001B Eaton Hall

Committee Members:

Jerzy Grzymala-Busse, Chair
Man Kong
Bo Luo


Abstract

The main focus of the project is to discuss mining of incomplete data which we find frequently in real-life records. For this, I considered the probabilistic approximations as they have a direct application to mining incomplete data. I have examined the results obtained from the experiments conducted on eight real-life data sets taken from University of California at Irvine Machine Learning Repository. I also investigated the properties of singleton, subset, and concept approximations and corresponding consistencies. The main objective was to compare the global and local approximations and generalize the consistency definition for incomplete data with two interpretations of missing attribute values: lost values and "do not care" conditions. In addition to this comparison, the most useful approach among singleton, subset and concept approximations is also tested for which the conclusion is the best approach would be selected with the help of tenfold cross validation after applying all three approaches. Also it’s shown that even if there exist six types of consistencies, there are only four distinct consistencies of incomplete data as two pairs of such consistencies are equivalent.