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

Muhammad Momin Rahman

Development of a Signal Flow Graph-Based De-Embedding Framework for Broadband Passive Linear Multiport RF & Microwave Networks with Applications to Power Splitters

When & Where:


Nichols Hall, Room 317 (Richard K. Moore Conference Room)

Committee Members:

Carl Leuschen, Chair
Kenneth Demarest
Fernando Rodriguez-Morales


Abstract

Discrete passive components, including resistors, capacitors, inductors, and transformers, are fundamental to broadband 75-Ω radio-frequency (RF) systems, particularly in cable television (CATV) and hybrid fiber-coaxial (HFC) networks. These components are incorporated into power splitters, couplers, power inserters, and amplifiers to achieve desired frequency responses, impedance matching, and signal transmission characteristics. However, their electrical behavior becomes increasingly complex at higher frequencies due to parasitic resistance, inductance, capacitance, electromagnetic coupling, and distributed transmission-line effects. Consequently, accurate broadband characterization is essential for predicting component behavior and developing representative RF circuit models for simulation purposes.

A significant challenge arises when characterizing passive components with limited or unavailable manufacturer specifications, particularly when existing component inventories must be evaluated for broadband applications. Conventional measurement instruments, including digital multimeters, LCR meters, oscilloscopes, and function generators, generally lack the frequency range required for comprehensive RF characterization from 5 MHz to 3 GHz. Vector network analyzers (VNAs) enable complex scattering-parameter measurements across this frequency range; however, the measured response includes contributions from test fixtures, interconnections, and parasitic discontinuities that must be distinguished from the intrinsic response of the device under test (DUT).

This project investigates the development of a signal flow graph (SFG)-based de-embedding framework for broadband passive linear multiport RF networks. The methodology incorporates series-through and shunt-through DUT (CPWG) fixture configurations, conventional Open-Short and Short-Open de-embedding techniques, followed by lumped-element and distributed transmission-line representations of fixture parasitics. Scattering-parameter and ABCD-parameter analysis are employed to characterize fixture responses, while signal flow graph derivations provide a mathematical basis for analyzing interconnected multiport networks. Particular attention is given to fixture asymmetry, impedance discontinuities, and multiple signal propagation paths that complicate the extension of conventional two-port characterization methods to higher-order networks.

Experimental validation is conducted through the characterization of passive components with published impedance and quality-factor characteristics, enabling comparisons between extracted measurements, equivalent-circuit models, and manufacturer reference data. The methodology is subsequently applied to broadband power splitter networks used in CATV/HFC systems to investigate the accuracy and applicability of the proposed multiport de-embedding framework. The project aims to establish a systematic approach to broadband passive component characterization that integrates fixture modeling, network theory, and experimental measurement while reducing dependence on proprietary characterization data.


Fairuz Shadmani Shishir

Efficient and Privacy-Preserving Biomedical AI: From Precision Therapeutics Design to Private Clinical Prediction

When & Where:


Eaton Hall, Room 2001B

Committee Members:

Sumaiya Shomaji, Chair
Tamzidul Hoque
Cuncong Zhong
Bishnu Sarker
Michael Hageman

Abstract

Accurate protein characterization, precision therapeutics design, and privacy-preserving clinical modeling are important challenges in biomedical artificial intelligence (AI). Addressing these challenges requires computational frameworks that are not only accurate and scalable but also capable of supporting reliable decision-making. This dissertation develops efficient, scalable, and reliable computational frameworks across three areas: Computational characterization of proteins, precision therapeutics design, and privacy-aware clinical representation learning. The first part of this dissertation focuses on efficient protein characterization at both the sequence and residue levels. GPCR-SLM, a knowledge-distilled small protein language model, classifies G-protein-coupled receptors (GPCRs), a family targeted by approximately 35% of FDA-approved drugs. Across 86 families, GPCR-SLM achieves 99% accuracy, outperforming BLAST (86.4%) and HMMER (91%), with a 33.5-fold speedup over large protein language models. Extending characterization to the residue level, a protein-metal-ion binding site prediction framework evaluates five protein language models and incorporates positional encoding to capture long-range dependencies. Under 10-fold cross-validation, it achieves a Matthews correlation coefficient of 0.89, with precision, recall, and F1 scores exceeding 95% across six metal ions.

Building on these protein characterization methods, the second part advances precision therapeutics design through uncertainty quantification and generative learning for therapeutic antibodies. NbBayesLM combines protein language model embeddings and physicochemical descriptors in a Bayesian neural network to predict nanobody thermostability. Evaluated on 10,630 VHH sequences, it achieves a mean absolute error of 1.89C and an R2 of 0.67 while estimating epistemic and aleatoric uncertainty to support candidate prioritization. CIgFlow employs classifier-free guidance to generate de novo, antigen-conditioned antibody sequences without fixed scaffolds or paired structural data. Generated sequences achieve a median OASis humanness score of 0.90 and mean predicted local distance difference test (pLDDT) score of 85.0, demonstrating promising novelty and diversity. The third part addresses privacy-aware clinical modeling using electrocardiograms (ECGs), which encode diagnostic information and sensitive demographic attributes. A variational autoencoder with dual discriminators suppresses demographic information while preserving clinically relevant representations.

Collectively, this dissertation advances efficient protein representation learning, computational antibody design, and privacy-preserving clinical AI, contributing methodological foundations for trustworthy biomedical applications.


Arturo Solorio

Performance Analysis of Mismatched Filtering for Stochastic Waveforms

When & Where:


Nichols Hall, Room 246 (Executive Conference Room)

Committee Members:

Patrick McCormick, Chair
Shannon Blunt
Charles Mohr


Abstract

Mismatched filtering (MMF) is a widely used pulse compression technique that reduces cross-correlation sidelobe levels at the cost of some loss in signal-to-noise ratio (SNR). Applying MMF to stochastically generated radar waveforms makes the filter's performance inherently random, which can be problematic if the variability is excessive. As well as the computational cost being relatively high, as per pulse, a new MMF optimization is required. In this thesis, the feasibility of a fixed MMF strategy for stochastic radar waveforms to reduce computational cost is investigated. Two MMF formulations were evaluated, the optimal MMF (Diagonal Loaded Filter) and a projection-based MMF. Both filters were designed to minimize sidelobe energy within specified regions of the Cross-Ambiguity Function (CAF) for Stochastic Waveform Generation (StoWGe) waveforms, and their performance was assessed across multiple time-bandwidth products and sidelobe-regions for two center frequencies, Fc = 30 Ghz and Fc  = 3.5 Ghz. The MMF performance was characterized using SNR loss and sidelobe depth over hundreds of trails. It is observed that the variability in SNR and sidelobe depth decreases as the waveform time-bandwdith product and the sidelobe region targeted for minimization increase, although the Fc = 3.5 GHz cases exhibited a plateau in achievable sidelobe depth. Additional validation using 1000-trail histograms and loop-back testing confirmed the robustness for the fixed MMF approach for higher time-bandwidth product stochastic waveforms. Where, overall, the results demonstrate that a fixed MMF strategy is feasible for stochastic waveforms when the time-bandwdith product and sidelobe region are sufficiently large. Furthermore, the Projection-based MMF provides a suboptimal alternative to the optimal MMF as it achieves comparable MMF performance when constrained to similar SNR-loss and may be desirable when the size of the domination eigenvalues is small relative to the filter length and can be efficiency obtained.


Past Defense Notices

Dates

Kevin Likcani

Use of Machine Learning to Predict Drug Court Success

When & Where:


Eaton Hall, Room 2001B

Committee Members:

David Johnson, Chair
Prasad Kulkarni
Heechul Yun


Abstract

Substance use remains a major public health issue in the United States that significantly impacts individuals, families, and society. Many individuals who suffer from substance use disorder (SUD) face incarceration due to drug-related offenses. Drug courts have emerged as an alternative to imprisonment and offer the opportunity for individuals to participate in a drug rehabilitation program instead. Drug courts mainly focus on those with non-violent drug-related offenses. One of the challenges of decision making in drug courts is assessing the likelihood of participants graduating from the drug court and avoiding recidivism after graduation. This study investigates the use of machine learning models to predict success in drug courts using data from a substance use drug court in Missouri. Success is measured in terms of graduation from the program, and the model includes a wide range of potential predictors including demographic characteristics, family and social factors, substance use history, legal involvement, physical and mental health history, employment history as well as drug court participation data. The results will be beneficial to drug court teams and presiding judges in predicting client success, evaluating risk factors during treatment for participants, informing person-centered treatment planning, and the development of after-care plans for high-risk participants to reduce the likelihood of recidivism. 


Peter Tso

Implementation of Free-Space Optical Networks based on Resonant Semiconductor Saturable Absorber and Phase Light Modulator

When & Where:


Nichols Hall, Room 246 (Executive Conference Room)

Committee Members:

Rongqing Hui, Chair
Shannon Blunt
Shima Fardad


Abstract

Optical Neural Networks (ONNs) have gained traction as an alternative to the conventional computing architectures used in modern CPUs and GPUs, largely because light enables massive parallelism, ultrafast inference, and minimal power consumption. 

As with conventional deep neural networks (DNNs), free-space ONNs require two main layers: (1) a nonlinear activation function which exists to separate adjacent linear layers, and (2) weighting layers that applies a linear transformation given an input.

Firstly, a Resonant Semiconductor Saturable Absorption Mirror (RSAM) was investigated as a viable nonlinear activation function. Several mechanisms have been used to create nonlinear activation functions, such as cold atoms, vapor absorption cells, and polaritons, but these implementations are bulky and must operate under tightly controlled environments while RSAMs is a passive device. Compared to typical SESAMs, the resonance structure of RSAM also reduces the saturation fluence compared to non-resonant SAMs, allowing low power laser sources to be used. A fiber-based optical testbed demonstrated notable improvement of 8.1% in classification accuracy compared to a linear only network trained with the MNIST dataset.

Secondly, Micro-electromechanical-system-based phase light modulators (PLMs) were evaluated as an alternative to LC-SLMs for in-situ reinforcement learning. PLMs can operate at kilohertz-scale frame rates at a substantially lower cost compared to LC-SLMs but have lower phase resolution and non-uniform quantization which impacts fidelity. Despite these disadvantages, the high-speed nature of PLMs allows for significant decrease in optimization time, which not only allows for reduction in training time, but also allows for larger datasets and more complex models with more learnable parameters. A single layer optical network was implemented using policy-based learning with discrete action-space to minimize impact of quantization. The testbed achieves 90.1%, 79.7%, and 76.9% training, validation, and test accuracy, respectively, on 3,000 images from the MNIST dataset. Additionally, we achieved 79.9%, 72.1%, and 71.7% accuracy on 3,000 images from the Fashion MNIST dataset. At 14 minutes per epoch during training, it is at least a magnitude lower in training time compared to LC-SLMs based models.


Joseph Vinduska

Fault-Frequency Agnostic Checkpointing Strategies

When & Where:


Eaton Hall, Room 2001B

Committee Members:

Hongyang Sun, Chair
Arvin Agah
Drew Davidson


Abstract

Checkpointing strategies in high-performance computing traditionally employ the Young-Daly for-

mula to determine the (first-order) optimal duration between checkpoints, which assumes a known

mean time between faults (MTBF). However, in practice, the MTBF may not be known accurately

or may vary, causing Young-Daly checkpointing to perform sub-optimally. In 2021, Sigdel et al.

introduced the CHORE (CHeckpointing Overhead and Rework Equated) checkpointing strategy,

which is MTBF-agnostic yet demonstrates a bounded increase in overhead compared to the op-

timal strategy. This thesis analyzed and extends the CHORE framework in several ways. First,

it verifies Sigdel et al.’s claims about the relative overhead of the CHORE strategy through both

event-driven simulations and expected runtimes derived from the underlying probablistic model.

Second, it extends the CHORE strategy to silent errors, which must be deliberately checked for to

be detected. In this scenario, the overhead compared to optimal checkpointing is once more ana-

lyzed through simulations and expected runtimes. Third, a heuristic is proposed to offer improved

performance of the CHORE algorithm under typical runtime scenarios by interpreting CHORE as

an additive-increase multiplicative-decrease model and tuning the parameters.


Lee Taylor

Ultrawideband Single-Pass Interferometric SAR Integrated with Multi-Rotor UAV

When & Where:


Nichols Hall, Room 317 (Moore Conference Room)

Committee Members:

Carl Leuschen, Chair
Shannon Blunt
Patrick McCormick
John Paden
Fernando Rodriguez-Morales

Abstract

Ultrawideband (UWB) Interferometric Synthetic Aperture Radar (InSAR) integrated with multi-rotor Uncrewed Aerial Vehicle (UAV), or UIMU in this work for brevity, provides ultrafine-resolution, all-weather, 3D surface imagery at any time of day. UIMU can be rapidly deployable and low-cost, and therefore a critical new tool for low-altitude remote sensing applications, such as disaster response, environmental monitoring, and intelligence surveillance and reconnaissance (ISR). Traditional repeat-pass data collection methods reduce the phase coherence required for InSAR processing of ultrafine-resolution datasets due to the unstable flight behavior of multi-rotor UAVs. Collecting Synthetic Aperture Radar (SAR) datasets using two receive channels during a single-pass will improve phase coherence and the ability to produce ultrafine-resolution 3D InSAR imagery.

This work proposes to quantify and characterize 3D target-position accuracy for a dual-channel 6 GHz bandwidth (2 cm range resolution) frequency modulated continuous wave (FMCW) radar integrated with the Aurela X6 hexacopter to establish novel single-pass UWB InSAR data collection methods and processing algorithms for multi-rotor UAV. The feasibility of the proposed investigation is demonstrated by the preliminary qualitative analysis of single-pass InSAR imagery presented in this proposal. Fieldwork will be conducted to measure the positions of GPS located corner reflectors using the UIMU system. Algorithms for motion tolerant Time-Domain Backprojection (TDBP), InSAR coregistration, and digital elevation mapping novel to multi-rotor UAV at UWB will be developed and presented. An analysis of vehicle motion induced phase decoherence, and InSAR imagery signal to noise ratio (SNR) will be presented. The TDBP SNR performance will be compared to the Open Polar Radar Omega-K algorithm to attempt to quantify motion tolerance between the different SAR processing algorithms.

This work will establish a foundation for future investigations of real-time image processing, separated transmission and receive platforms (bistatic), or swarm configurations for UIMU systems.


Devin Setiawan

Concept-Driven Interpretability in Graph Neural Networks: Applications in Neuroscientific Connectomics and Clinical Motor Analysis

When & Where:


Eaton Hall, Room 2001B

Committee Members:

Sumaiya Shomaji, Chair
Sankha Guria
Han Wang


Abstract

Graph Neural Networks (GNNs) achieve state-of-the-art performance in modeling complex biological and behavioral systems, yet their "black-box" nature limits their utility for scientific discovery and clinical translation. Standard post-hoc explainability methods typically attribute importance to low-level features, such as individual nodes or edges, which often fail to map onto the high-level, domain-specific concepts utilized by experts. To address this gap, this thesis explores diverse methodological strategies for achieving Concept-Level Interpretability in GNNs, demonstrating how deep learning models can be structurally and analytically aligned with expert domain knowledge. This theme is explored through two distinct methodological paradigms applied to critical challenges in neuroscience and clinical psychology. First, we introduce an interpretable-by-design approach for modeling brain structure-function coupling. By employing an ensemble of GNNs conceptually biased via input graph filtering, the model enforces verifiably disentangled node embeddings. This allows for the quantitative testing of specific structural hypotheses, revealing that a minority of strong anatomical connections disproportionately drives functional connectivity predictions. Second, we present a post-hoc conceptual alignment paradigm for quantifying atypical motor signatures in Autism Spectrum Disorder (ASD). Utilizing a Spatio-Temporal Graph Autoencoder (STGCN-AE) trained on normative skeletal data, we establish an unsupervised anomaly detection system. To provide clinical interpretability, the model's reconstruction error is systematically aligned with a library of human-interpretable kinematic features, such as postural sway and limb jerk. Explanatory meta-modeling via XGBoost and SHAP analysis further translates this abstract loss into a multidimensional clinical signature. Together, these applications demonstrate that integrating concept-level interpretability through either architectural design or systematic post-hoc alignment enables GNNs to serve as robust tools for hypothesis testing and clinical assessment.


Mahmudul Hasan

Trust Assurance of Commercial Off-The-Shelf (COTS) Hardware Through Verification and Runtime Resilience

When & Where:


Eaton Hall, Room 2001B

Committee Members:

Tamzidul Hoque, Chair
Esam El-Araby
Prasad Kulkarni
Hongyang Sun
Huijeong Kim

Abstract

The adoption of Commercial off-the-shelf (COTS) components has become a dominant paradigm in modern system design due to their reduced development cost, faster time-to-market, and widespread availability. However, the reliance on globally distributed and untrusted supply chains introduces significant security risks, particularly the possibility of malicious hardware modifications such as Trojans, embedded during design or fabrication. In such settings, traditional methods that depend on golden models, full design visibility, or trusted fabrication are no longer sufficient, creating the need for new security assurance approaches under a zero-trust model. This proposed research addresses security challenges in COTS microprocessors through two complementary solutions: runtime resilience and pre-deployment trust verification. First, a multi-variant-execution-based framework is developed that leverages functionally equivalent program variants to induce diverse microarchitectural execution patterns. By comparing intermediate outputs across variants, the framework enables runtime detection and tolerance of Trojan induced payload effects without requiring hardware redundancy or architectural modifications. To enhance the effectiveness of variant generation, a reinforcement learning assisted framework is introduced, in which the reward function is defined by security objectives rather than traditional performance optimization, enabling the generation of variants that are more robust against repeated Trojan activation. Second, to enable black-box trust verification prior to deployment, this work presents a framework that can efficiently test the presence of hardware Trojans by identifying microarchitectural rare events and transferring activation knowledge from existing processor designs to trigger highly susceptible internal nodes. By leveraging ISA-level knowledge, open-source RTL references, and LLM-guided test generation, the framework achieves high trigger coverage without requiring access to proprietary designs or golden references. Building on these two scenarios, a future research direction is outlined for evolving trust in COTS hardware through continuous runtime observation, where multi-variant execution is extended with lightweight monitoring mechanisms that capture key microarchitectural events and execution traces. These observations are accumulated as hardware trust counters, enabling the system to progressively establish confidence in the underlying hardware by verifying consistent behavior across diverse execution patterns over time. Together, these directions establish a foundation for analyzing and mitigating security risks across zero-trust COTS supply chains.


Moh Absar Rahman

Permissions vs Promises: Assessing Over-privileged Android Apps via Local LLM-based Description Validation

When & Where:


Eaton Hall, Room 2001B

Committee Members:

Drew Davidson, Chair
Sankha Guria
David Johnson


Abstract

Android is the most widely adopted mobile operating system, supporting billions of devices and driven by a robust app ecosystem.  Its permission-based security model aims to enforce the Principle of Least Privilege (PoLP), restricting apps to only the permissions it needs.  However, many apps still request excessive permissions, increasing the risk of data leakage and malicious exploitation. Previous research on overprivileged permission has become ineffective due to outdated methods and increasing technical complexity.  The introduction of runtime permissions and scoped storage has made some of the traditional analysis techniques obsolete.  Additionally, developers often are not transparent in explaining the usage of app permissions on the Play Store, misleading users unknowingly and unwillingly granting unnecessary permissions. This combination of overprivilege and poor transparency poses significant security threats to Android users.  Recently, the rise of local large language models (LLMs) has shown promise in various security fields. The main focus of this study is to analyze whether an app is overpriviledged based on app description provided on the Play Store using Local LLM. Finally, we conduct a manual evaluation to validate the LLM’s findings, comparing its results against human-verified response.


Mohsen Nayebi Kerdabadi

Representation Augmentation for Electronic Health Records via Knowledge Graphs, Large Language Models, and Contrastive Learning

When & Where:


Learned Hall, Room 3150

Committee Members:

Zijun Yao, Chair
Sumaiya Shomaji
Hongyang Sun
Dongjie Wang
Shawn Keshmiri

Abstract

Electronic Health Records (EHRs) provide rich longitudinal patient information, but their high dimensionality, sparsity, heterogeneity, and temporal complexity make robust representation learning difficult. This dissertation studies how to improve patient and medical concept representation learning in EHRs and consequently enhance healthcare predictive tasks by integrating domain knowledge, knowledge graphs, large language models (LLMs), and contrastive learning. First, it introduces an ontology-aware temporal contrastive framework for survival analysis that learns discriminative patient representations from censored and observed trajectories by modeling temporal distinctiveness in longitudinal EHR data. Second, it proposes a multi-ontology representation learning framework that jointly propagates knowledge within and across diagnosis, medication, and procedure ontologies, enabling richer medical concept embeddings, especially under limited data and for rare conditions. Third, it develops an LLM-enriched, text-attributed medical knowledge graph framework that combines EHR-derived statistical evidence with type-constrained LLM reasoning to infer semantic relations, generate contextual node and edge descriptions, and co-learn concept embeddings through joint language-model and graph-neural-network training. Together, these studies advance a unified view of EHR representation learning in which structured medical knowledge, textual semantics, and temporal patient trajectories are jointly leveraged to build more accurate, interpretable, and robust healthcare prediction models.


Brinley Hull

Mist – An Interactive Virtual Pet for Autism Spectrum Disorder Stress Onset Detection & Mitigation

When & Where:


Nichols Hall, Room 317 (Moore Conference Room)

Committee Members:

Arvin Agah, Chair
Perry Alexander
David Johnson
Sumaiya Shomaji

Abstract

Individuals with Autism Spectrum Disorder (ASD) frequently experience elevated stress and are at higher risk for mood disorders such as anxiety and depression. Sensory over-responsivity, social challenges, and difficulties with emotional recognition and regulation contribute to such heightened stress. This study presents a proof-of-concept system that detects and mitigates stress through interactions with a virtual pet. Designed for young adults with high-functioning autism, and potentially useful for people beyond that group, the system monitors simulated heart rate, skin resistance, body temperature, and environmental sound and light levels. Upon detection of stress or potential triggers, the system alerts the user and offers stress-reduction activities via a virtual pet, including guided deep-breathing exercises and interactive engagement with the virtual companion. Through combining real-time stress detection with interactive interventions on a single platform, the system aims to help autistic individuals recognize and manage stress more effectively.


Harun Khan

Identifying Weight Surgery Attacks in Siamese Networks

When & Where:


Nichols Hall, Room 246 (Executive Conference Room)

Committee Members:

Prasad Kulkarni, Chair
Alex Bardas
Bo Luo


Abstract

Facial recognition systems increasingly rely on machine learning services, yet they remain vulnerable to cyber-attacks. While traditional adversarial attacks target input data, an underexplored threat comes from weight manipulation attacks, which directly modify model parameters and can compromise deployed systems in cyber-physical settings. This paper investigates defenses against Weight Surgery, a weight manipulation attack that modifies the final linear layer of neural networks to merge or shatter classes without requiring access to training data. We propose a computationally lightweight defense capable of detecting sample pairs affected by Weight Surgery at low false-positive rates. The defense is designed to operate in realistic deployment scenarios, selecting its sensitivity parameter 𝛾 using only benign samples to meet a target false-positive rate. Evaluation on 1000 independently attacked models demonstrates that our method achieves over 95% recall at a target false-positive rate of 0.001. Performance remains strong even under stricter conditions: at FPR = 0.0001, recall is 92.5%, and at 𝛾=0.98, FPR drops to 0.00001 while maintaining 88.9% recall. These results highlight the robustness and practicality of the defense, offering an effective safeguard for neural networks against model-targeted attacks.