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

NILISHA MANE

Tools to Explore Run-time Program Properties

When & Where:


246 Nichols Hall

Committee Members:

Prasad Kulkarni, Chair
Perry Alexander
Gary Minden


Abstract

The advancement in the field of embedded technology has resulted in its extensive use in almost all the modern electronic devices. Hence, unlike in the past, there is a very crucial need to develop system security tools for these devices. So far most of the research has been concentrated either on security for general computer systems or on static analysis of embedded systems. In this project, we develop tools that explore and monitor the run-time properties of programs/applications as well as the inter-process communication. We also present a case studies in which these tools are be used on a Gumstix (an embedded system) running Poky Linux system to monitor a particular program as well as print out a graph of all inter-process communication on the system.


BRIAN MACHARIA

UWB Microwave Filters on Multilayer LCP Substrates: A Feasibility Study

When & Where:


317 Nichols Hall

Committee Members:

Carl Leuschen, Chair
Fernando Rodriguez-Morales
Chris Allen


Abstract

Having stable dielectric properties extending to frequencies over 110 GHz, Liquid Crystal Polymer (LCP) materials are a new and promising substrate alternative for low-cost production of planar microwave circuits. This project focused on the design of several microwave filter structures using multiple layers for operation in the 2-18 GHz and 10-14 GHz bands. Circuits were simulated and optimized using EDA tools, obtaining good results over the bands of interest. The results show that it is feasible to fabricate these structures on dielectric substrates compatible with off-site manufacturing facilities. It is likewise shown that LCP technology can yield a 3-5x area reduction as compared to cavity-type filters, making them much easier to integrate in a planar circuit.


Md. MOSHFEQUR RAHMAN

OpenFlow based Multipath Communication for Resilience

When & Where:


246 Nichols Hall

Committee Members:

James Sterbenz, Chair
Victor Frost
Fengjun Li


Abstract

A cross-layer framework in the Software Defined Networking domain is pro- posed to study the resilience in OpenFlow-based multipath communication. A testbed has been built, using Brocade OpenFlow switches and Dell Poweredge servers. The framework is evaluated against regional challenges. By using differ- ent adjacency matrices, various topologies are built. The behavior of OpenFlow multipath-based communication is studied in case of a single path failure, splitting of traffic and also with multipath TCP enabled traffic. The behavior of different coupled congestion algorithms for MPTCP is also studied. A Web framework is presented to demonstrate the OpenFlow experiment by importing the network topologies and then executing and analyzing user defined regional attacks.


RAGAPRABHA CHINNASWAMY

A Comparison of Maximal Consistent Blocks and Characteristics Sets for Incomplete Data Sets

When & Where:


2001B Eaton Hall

Committee Members:

Jerzy Grzymala-Busse, Chair
Prasad Kulkarni
Bo Luo


Abstract

One of the main applications of rough set theory is rule induction. If the input data set contains inconsistencies, using rough set theory leads to inducing certain and possible rule sets. 
In this project, the concept of a maximal consistent block is applied to formulate a new approximation to a concept in the incomplete data set with a higher level of accuracy. This method does not require change in the size of the original incomplete data set. Two interpretations of missing attribute values are discussed: lost values and “do not care” conditions. The main objective is to compare maximal consistent blocks and characteristics sets in terms of cardinality of lower and upper approximations. Four incomplete data sets are used for experiments with varying levels of missing information. The next objective is to compare the decision rules induced and cases covered by both techniques. The experiments show that the both techniques provide the same lower approximations for all the datasets with “do not care” conditions. The best results are achieved by maximal consistent blocks for upper approximations for three datasets and there is a tie for the other data set. 


PRAVEEN YARLAGADDA

A Comparison of Rule Sets Generated by Algorithms: AQ, C4.5, and CART

When & Where:


2001B Eaton Hall

Committee Members:

Jerzy Grzymala-Busse, Chair
Bo Luo
Jim Miller


Abstract

In data mining, rules are the most popular symbolic representation of knowledge. Classification of data and extracting of classification rules from the data is a difficult process, and there are different approaches to this process. One such approach is inductive learning. Inductive learning involves the process of learning from examples - where a system tries to induce a set of rules from a set of observed examples. Inductive learning methods produce distinct concept descriptions when given identical training data and there are questions about the quality of the different rule sets produced. This project work is aimed at comparing and analyzing the rule sets induced by different inductive learning systems. In this project, three different algorithms AQ, CART and C4.5 are used to induce rule sets from different data sets. An analysis is carried out in terms of the total number of rules and the total number of conditions present in the rules. These space complexity measures such as rule count and condition count show that AQ tends to produce more complex rule sets than C4.5 and CART. AQ algorithm has been implemented as a part of project and is used to induce the rule sets.


DIVYA GUPTA

Investigation of a License Plate Recognition Algorithm

When & Where:


250 Nichols Hall

Committee Members:

Glenn Prescott, Chair
Erik Perrins
Jim Stiles


Abstract

License plate Recognition method is a technique to detect license plate numbers from the vehicle images. This method has become an important part of our life with an increase in traffic and crime every now and then. It uses computer vision and pattern recognition technologies. Various techniques have been proposed so far and they work best within boundaries.This detection technique helps in finding the accurate location of license plates and extracting characters of the plates. The license plate detection is a three-stage process that includes license plate detection, character segmentation and character recognition. The first stage is the extraction of the number plate as it occupies a small portion of the whole image. After tracking down the license plate, localizing of the characters is done. The character recognition is the last stage of the detection and template matching is the most common method used for it. The results achieved by the above experiment were quite accurate which showed the robustness of the investigated algorithm.


NAZMA KOTCHERLA

Hybrid Mobile and Responsive Web Application - KU Quick Quiz

When & Where:


2001B Eaton Hall

Committee Members:

Prasad Kulkarni, Chair
Perry Alexander
Jerzy Grzymala-Busse


Abstract

The objective of this project is to leverage the open source Angular JS, Node JS, and Ionic Framework along with Cordova to develop “A Hybrid Mobile Application” for students and “A Responsive Web Application” for professor to conduct classroom centered “Dynamic Tests”. Dynamic Tests are the test taking environments where questions can be posted to students in the form of quizzes during a classroom setup. Guided by the specifications set by the professor, students answer and submit the quiz from their mobile devices. The results are generated instantaneously after the completion of the test session and can be viewed by the professor. The web application performs statistical analysis of the responses by considering the factors that the professor had set to measure the students’ performance. This advanced methodology of test taking is highly beneficial as it gives a clear picture to the professor the level of understanding of all the students in any chosen topic immediately after the test. It helps to improvise the teaching methods. This is also very advantageous to students since it helps them to come out of their hesitation to clarify their doubts as their marks become the measure of their understanding which is directly uncovered before the professor. This application overall improves the classroom experience to help students gain higher standards.


JYOTHI PRASAD PANGLURI SREEHARINAIDU

Implementation of ChiMerge Algorithm for Discretization of Numerical Attributes

When & Where:


2001B Eaton Hall

Committee Members:

Jerzy Grzymala-Busse, Chair
Perry Alexander
Prasad Kulkarni


Abstract

Most of the present classification algorithms require the input data with discretized attributes. If the input data contains numerical attributes, we need to convert such attributes into discrete values (intervals) before performing classification. Discretization algorithms for real value attributes are very important for applications such as artificial intelligence and machine learning. In this project we discuss an implementation of the ChiMerge algorithm for discretization of numerical attributes, a robust algorithm, which uses X2 statistic to determine interval similarity as it constructs intervals in a bottom-up merging process. ChiMerge provides a reliable summarization of numerical attributes and determines the number of intervals. 


MOHAN KRISHNA VEERAMACHINENI

A Graphical User Interface System for Rule Visualization

When & Where:


2001B Eaton Hall

Committee Members:

Jerzy Grzymala-Busse, Chair
Bo Luo
Prasad Kulkarni


Abstract

The primary goal of data visualization is to communicate information clearly and efficiently via statistical graphs, plots and information graphics. It makes complex data more accessible, understandable and usable. The goal of this project is to build a graphical user interface called RULEVIZ to visualize the rules, induced by LERS (Learning from Examples using Rough Set Theory) data mining system in the form of directed graphs. LERS is a technique used to induce a set of rules from examples given in the form of a decision table. Such rules are used to classify unseen data. The RULEVIZ is developed as a web application where the user uploads the rule set and the data set from which the rule set is visualized in the graphical format and is rendered on the web browser. Every rule is taken sequentially, and all the conditions of that rule are visualized as nodes connected by undirected edges. The last condition is connected to the concept by a directed edge. The RULEVIZ offers custom filtering options for the user to filter the rules based on factors like the number of conditions and conditional probability or strength. The RULEVIZ also has interactive capabilities to filter out rule sets and manipulate the generated graph for a better look and feel.


HARA MADHAV TALASILA

Modular Frequency Multiplier and Filters for the Global Hawk Snow Radar

When & Where:


317 Nichols Hall

Committee Members:

John Paden, Chair
Chris Allen
Carl Leuschen
Fernando Rodriguez-Morales

Abstract

Remote sensing with radar systems on airborne platforms is key for wide-area data collection to estimate the impact of ice and snow masses on rising sea levels. NASA P-3B and DC-8, as well as other platforms, successfully flew with multiple versions of the Snow Radar developed at CReSIS. Compared to these manned missions, the Global Hawk UAV can support flights with long endurance, complex flight paths and flexible altitude operation up to 70,000 ft. This thesis documents the process of adapting the 2-18 GHz Snow radar to meet the requirements for operation on manned and unmanned platforms from 700 ft to 70,000 ft. The primary focus of this work is the development of an improved microwave chirp generator implemented with frequency multipliers. The x16 frequency multiplier is composed of a series of x2 frequency multiplication stages, overcoming some of the limitations encountered in previous designs. At each stage, undesired harmonics are kept out of the band and filtered. The miniaturized design presented here reduces reflections in the chain, overall size, and weight as compared to the earlier large and heavy connectorized chain. Each stage is implemented by a drop-in type modular design operating at microwaves and millimeter waves; and realized with commercial surface-mount ICs, wire-bondable chips, and custom filters. DC circuits for power regulation and sequencing are developed as well. Another focus of this thesis is the development of band-pass filters using different distributed element filter technologies. Multiple edge-coupled band pass filters are fabricated on alumina substrate based on the design and optimization in computer-aided design (CAD) tools. Interdigital cavity filter models developed in-house are validated by full-wave EM simulation and measurements. Overall, the measured results of the modular frequency multiplier and filters match with the expected responses from original design and co-simulation outputs. The design files, test setups, and simulation models are generalized to use with any similar or new designs in the future.