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

Grant Jurgensen

A Verified Architecture for Trustworthy Remote Attestation

When & Where:


Zoom Meeting, please contact jgrisafe@ku.edu for link.

Committee Members:

Perry Alexander, Chair
Drew Davidson
Matthew Moore


Abstract

Remote attestation is a process where one digital system gathers and provides evidence of its state and identity to an external system. For this process to be successful, the external system must find the evidence convincingly trustworthy within that context. Remote attestation is difficult to make trustworthy due to the external system’s limited access to the attestation target. In contrast to local attestation, the appraising system is unable to directly observe and oversee the attestation target. In this work, we present a system architecture design and prototype implementation that we claim enables trustworthy remote attestation. Furthermore, we formally model the system within a temporal logic embedded in the Coq theorem prover and present key theorems that strengthen this trust argument.


Kaidong Li

Accurate and Robust Object Detection and Classification Based on Deep Neural Networks

When & Where:


Zoom Meeting, please contact jgrisafe@ku.edu for link.

Committee Members:

Cuncong Zhong, Chair
Taejoon Kim
Fengjun Li
Bo Luo
Haiyang Chao

Abstract

Recent years have seen tremendous developments in the field of computer vision and its extensive applications. The fundamental task, image classification, benefiting from deep convolutional neural networks (CNN)'s extraordinary ability to extract deep semantic information from input data, has become the backbone for many other computer vision tasks, like object detection and segmentation. A modern detection usually has bounding-box regression and class prediction with a pre-trained classification model as the backbone. The architecture is proven to produce good results, however, improvements can be made with closer inspections. A detector takes a pre-trained CNN from the classification task and selects the final bounding boxes from multiple proposed regional candidates by a process called non-maximum suppression (NMS), which picks the best candidates by ranking their classification confidence scores. The localization evaluation is absent in the entire process. Another issue is the classification uses one-hot encoding to label the ground truth, resulting in an equal penalty for misclassifications between any two classes without considering the inherent relations between the classes.

My research aims to address the following issues. (1) We proposed the first location-aware detection framework for single-shot detectors that can be integrated into any single-shot detectors. It boosts detection performance by calibrating the ranking process in NMS with localization scores. (2) To more effectively back-propagate gradients, we designed a super-class guided architecture that consists of a superclass branch (SCB) and a finer class branch (FCB). To further increase the effectiveness, the features from SCB with high-level information are fed to FCB to guide finer class predictions. (3) Recent works have shown 3D point cloud models are extremely vulnerable under adversarial attacks, which poses a serious threat to many critical applications like autonomous driving and robotic controls. To increase the robustness of CNN models on 3D point cloud models, we propose a family of robust structured declarative classifiers for point cloud classification, where the internal constrained optimization mechanism can effectively defend adversarial attacks through implicit gradients.


Christian Daniel

Dynamic Metasurface Grouping for IRS Optimization in Massive MIMO Communications

When & Where:


246 Nichols Hall

Committee Members:

Erik Perrins, Chair
Taejoon Kim, Co-Chair
Morteza Hashemi


Abstract

Intelligent Reflecting Surfaces (IRSs) grant the ability to control what was once considered the uncontrollable part of wireless communications, the channel. These smart signal mirrors show promise to significantly improve the effective signal-to-noise-ratio (SNR) of cell-users when the line-of-sight (LOS) channel between the base station (BS) and user is blocked. IRSs use implementable optimized phase shifts that beamform a reflected signal around channel blockages, and because they are passive devices, they have the benefit of having low cost and low power consumption. Previous works have concluded that IRSs need several hundred elements to outperform relays. Unfortunately, overhead and complexity costs related to optimizing these devices limit their scope to single-input single-output (SISO) systems. With multiple-input multiple-output (MIMO) and Massive MIMO becoming crucial components to modern 5G and beyond networks, a way to mitigate these overhead costs and integrate IRS technology with the promising MIMO techniques is paramount for these devices to have a place within modern cell technologies. This thesis proposes an IRS element grouping scheme that greatly reduces the number of unique IRS phases that need to be calculated and sent to the IRS controller via the limited rate feedback channel and allows for the ideal number of groups to be obtained at the BS before data transmission. Three methods are proposed to design the phase shifts and element partitioning within our scheme to improve effective SNR in an IRS-aided system. In our simulations, it is shown that our best performing method is one that dynamically partitions the IRS elements into non- uniform groups based on information gathered from the reflected channel and then optimizes its phase shifts. This method successfully handles the overhead trade-off problem, and shows significant achievable rate improvement from previous works.


Theresa Moore

Array Manifold Calibration for Multichannel SAR Sounders

When & Where:


Zoom Meeting, please contact jgrisafe@ku.edu for link.

Committee Members:

James Stiles, Chair
Shannon Blunt
Carl Leuschen
John Paden
Leigh Stearns

Abstract

Multichannel synthetic aperture radar (SAR) ice sounders rely on parametric angle estimators in tomography to resolve elevation angle beyond the Rayleigh resolution limit of their cross-track arrays. The potential super resolution capability of these techniques is predicated on perfect knowledge of the array’s response to directional sources, referred to as the array manifold. Array manifold calibration improves angle estimator performance by reducing the mismatch between the model of the array’s transfer function and truth; its study straddles the fields of both signal processing and antenna theory, yet associated literature reveals dichotomous methodologies that perpetuate fragmented interpretations of the manifold calibration problem. This dissertation addresses calibration for SAR ice sounders that three dimensionally image ice sheet and glacier beds with tomographic techniques. The approach is rooted in array signal processing first but seeks a more unifying perspective of the manifold calibration problem by leveraging commercial computational electromagnetics software to understand error mechanisms and algorithm performance with a deterministic model of an electromagnetic manifold. The research outlined here proposes creation of large snapshot databases that aid in identifying calibration targets in SAR pixels with known arrival angles. The signal processing methodology taxonomizes manifold calibration into parametric and nonparametric forms and advances both in the context of SAR sounders. A parametric estimator of nonlinear manifold parameters that are common across disjoint sets is derived. The algorithm framework capitalizes on a snapshot database to aggregate many angularly diverse observations in estimating unknown model parameters. The technique, which handles multitarget calibration, is desirable in the SAR sounder problem but requires a parametric model of the angle-dependent manifold. Nonparametric calibration techniques characterize the array response over the field of view but require many observations of single sources over dense calibration grids. A subspace clustering technique is proposed to identify snapshots with a single dominant source, thereby enabling a principal components-based characterization of the sounder manifold. The measured manifold leads to significant performance improvements over the traditional array response model in tomography. These results indicate that manifold calibration will reduce uncertainty in sounder-derived maps of the subsurface, leading to more accurate estimates of total fresh ice volume.


Shravan Kaundinya

Investigative Development of an UWB radar for UAS-borne applications

When & Where:


Nichols Hall, Room 317

Committee Members:

Carl Leuschen, Chair
Christopher Allen
Fernando Rodriguez-Morales
Emily Arnold

Abstract

Over the last few years, one of the primary focuses in engineering development has been system packaging and miniaturization. This is apparent in various areas such as the rise of Internet of Things (IoT), CubeSats, and Unmanned Aerial Systems (UAS). The simultaneous miniaturization in multiple industries has enabled advancements in remote sensing instrument development. Sensors such as radars, lidars, and cameras are used on UAS to characterize various aspects of the Earth System like ice, soil, and vegetation, thereby improving our understanding. In this work, an Ultra-wideband (UWB) radar system design for the Vapor 55 UAS rotorcraft is investigated. A compact, lightweight 2 – 18 GHz Frequency Modulated Continuous Wave (FMCW) radar with two channels on transmit and receive is designed to characterize extended targets like soil and snow. This thesis reports initial proof-of-concept field measurements performed with soil as the target to identify backscatter signatures that are indicative of moisture content. The thesis also describes the exploratory design, development, and laboratory test results of the miniaturized radar electronics and compact antenna front-end.


Zeus Gannon

Designing a SODAR testbed for RADAR applications

When & Where:


Zoom Meeting, please contact jgrisafe@ku.edu for link.

Committee Members:

Christopher Allen, Chair
Shannon Blunt
James Stiles


Abstract

In research there exists a need to constantly test and develop systems. Testing a radar system requires costly resources in terms of equipment and spectrum. These challenges relegate most testing to simulations, which are a poor approximation of reality. An alternative to over-the-air radar testing is presented here in the form of an over-the-air ultrasonic detection and ranging (SODAR) system. This system takes advantage of the similar wave-like propagation properties of acoustic and electromagnetic waves. With a SODAR testbed, radar waveform design can quickly move out of simulation and into the real world with minimal overhead. In this thesis, basic and advanced radar sensing techniques are demonstrated with a SODAR setup. Range detection, Doppler sensing, and pulse compression are shown as examples of basic radar concepts. For advanced sensing applications, array-based direction finding and synthetic aperture radar (SAR) are shown.


Usman Sajid

Effective Uni-modal to Multi-modal Crowd Estimation based on Deep Neural Networks

When & Where:


Zoom Meeting, please contact jgrisafe@ku.edu for link.

Committee Members:

Taejoon Kim, Chair
Fengjun Li
Bo Luo
Cuncong Zhong
Guanghui Wang

Abstract

Crowd estimation is a vital component of crowd analysis. It finds many applications in real-world scenarios, e.g., huge gatherings management like Hajj, sporting and musical events, or political rallies. Automated crowd counting facilitates better and effective management of such events and consequently prevents any undesired situation. This is a very challenging problem in practice since there exists a significant difference in the crowd number in and across different images, varying image resolution, large perspective, severe occlusions, and dense crowd-like cluttered background regions. Current approaches do not handle huge crowd diversity well and thus perform poorly in cases ranging from extreme low to high crowd-density, thus, yielding huge crowd underestimation or overestimation. Also, manual crowd counting proves to be infeasible due to very slow and inaccurate results. To address these major crowd counting issues and challenges, we investigate two different types of input data: uni-modal (image) and multi-modal (image and audio). 

In the uni-modal setting, we propose and analyze four novel end-to-end crowd counting networks, ranging from multi-scale fusion-based models to uni-scale one-pass and two-pass multi-task networks. The multi-scale networks employ the attention mechanism to enhance the model efficacy. On the other hand, the uni-scale models are well-equipped with novel and simple-yet-effective patch re-scaling module (PRM) that functions identical but is more lightweight than multi-scale approaches. Experimental evaluation demonstrates that the proposed networks outperform the state-of-the-art in majority cases on four different benchmark datasets with up to 12.6% improvement for the RMSE evaluation metric. Better cross-dataset performance also validates the better generalization ability of our schemes. For the multi-modal input, effective feature-extraction (FE) and strong information fusion between two modalities remain a big challenge. Thus, the multi-modal novel network design focuses on investigating different features fusion techniques amid improving the FE. Based on the comprehensive experimental evaluation, the proposed multi-modal network increases the performance under all standard evaluation criteria with up to 33.8% improvement in comparison to the state-of-the-art. The application of multi-scale uni-modal attention networks also proves more effective in other deep learning domains, as demonstrated successfully on seven different scene-text recognition task datasets with better performance.


Giordanno Castro Garcia

pyCatalstReader: Extracting Text and Tokenization of Technical

When & Where:


Zoom Meeting, please contact jgrisafe@ku.edu for link.

Committee Members:

Michael Branicky , Chair
Fengjun Li
Bo Luo
Kevin Leonard

Abstract

Catalysts are an essential and ubiquitous component of our modern life, from empowering our agriculture to reducing toxic emissions. There is a constant need for more and better catalysts.  The catalysis research literature is immense, growing, and scattered.   Natural Language Processing (NLP), a sub-field of Machine Learning (ML), offers a potential solution to automatically make full use of all this valuable information and speed innovation. Even though NLP has made much progress in the analysis of everyday text, its application in more technical text has not been as successful.  Specifically, there are even a dearth of tools that can appropriately extract text from the PDF files of research articles, which are the most common format used in the catalyst field. Therefore, this project aims to define a tool that can extract text out PDF files of catalysis science articles, which is prerequisite to applying NLP and ML tools.  We also explore the first stage of the NLP pipeline, tokenization, by objectively comparing different tokenizers for catalysis science articles.


Sai Manudeep Gadde

Landmark Classification and Tagging using Convolutional Neural Networks

When & Where:


Zoom Meeting, please contact jgrisafe@ku.edu for link.

Committee Members:

Prasad Kulkarni, Chair
Michael Branicky
Esam Al-Araby


Abstract

Photo sharing and photo storage services like to have location data for each photo that is uploaded. With the location data, these services can build advanced features, such as automatic suggestion of relevant tags or automatic photo organization, which help provide a compelling user experience. Although a photo's location can often be obtained by looking at the photo's metadata, many photos uploaded to these services will not have location metadata available. This can happen when, for example, the camera capturing the picture does not have GPS or if a photo's metadata is scrubbed due to privacy concerns.

If no location metadata for an image is available, one way to infer the location is to detect and classify a discernible landmark in the image.  Given the large number of landmarks across the world and the immense volume of images that are uploaded to photo sharing services, using human judgement to classify these landmarks would not be feasible. In this project, we aim to address this problem by building models to automatically predict the location of the image based on any landmarks depicted in the image. We will go through the machine learning design process end-to-end: performing data preprocessing, designing and training CNNs, comparing the accuracy of different CNNs, and using some own images to heuristically evaluate the best CNN.


Dalton Brucker-Hahn

Anvil: Flexible and Dynamic Service Mesh Security Design for Microservice Architectures and Future Network Security Research

When & Where:


Zoom Meeting, please contact jgrisafe@ku.edu for link.

Committee Members:

Alexandru Bardas, Chair
Drew Davidson
Fengjun Li
Bo Luo
Huazhen Fang

Abstract

Modern cloud computing environments are evolving with a focus upon speed of deployments, frequency of changes, and a greater adoption of microservice architectures.  To handle these high-level business goals, an emerging series of tools and methodologies referred to as DevOps have been adopted to handle the dynamic and flexible environments being employed in enterprise software.  A popular class of tools within the DevOps toolset are service meshes which aim to manage and connect swarms of microservices.  Service meshes are also responsible for providing service discovery and security for the requests and responses occurring between microservices in a deployment.

Previous work has demonstrated several shortcomings and design limitations in existing, state-of-art service meshes.  Due to this, studies focusing upon improving the security and providing dynamic solutions to these challenges have been proposed but fall short of addressing the issue.  This work will propose a novel design to better address the existing challenges and security needs within this domain.  Anvil, a novel, proof-of-concept service mesh will be designed, implemented, and evaluated

with the trade-off of security and performance in mind.  The goal of Anvil is to provide a security-focused service mesh that can be extended and modified as needed for future research efforts involving service meshes and service mesh design.  With flexibility and extensibility as primary design considerations, future research efforts within the domain of zero-trust networking and distributed system security will be explored and evaluated leveraging Anvil as the underlying service mesh infrastructure.  The potential design and security benefits to the domain of microservice architectures by utilizing Anvil as a testbed and platform for security research is immense.