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

Sathya Mahadevan

Implementation of ID3 for Data Stored in Multiple SQL Databases

When & Where:


2001B Eaton Hall

Committee Members:

Jerzy Grzymala-Busse, Chair
Man Kong
Prasad Kulkarni


Abstract

Data classification is a methodology of data mining used to retrieve meaningful information from data. A model is built from the input training set which is later used to classify new observations. One of the most widely used models is a decision tree which uses a tree like structure to list all possible outcomes. Decision trees are preferred for their simple structure, requiring little effort for data preparation and easy interpretation. This project implements ID3, an algorithm for building the decision tree using information gain. The decision tree is converted to a set of rules and the error rate is calculated using the test dataset. The dataset is usually stored in a relational database in the form tables. In practice, it might be desired that data be stored across multiple databases. In such scenarios, retrieving and coordinating data from the databases could be a challenging task. This project provides the implementation of ID3 algorithm with the convenience of reading data stored at multiple data sources.


SATHYA MAHADEVAN

Implementation of ID3 for Data Stored in Multiple SQL Databases

When & Where:


2001B Eaton Hall

Committee Members:

Jerzy Grzymala-Busse, Chair
Man Kong
Prasad Kulkarni


Abstract

Data classification is a methodology of data mining used to retrieve meaningful information from data. A model is built from the input training set which is later used to classify new observations. One of the most widely used models is a decision tree which uses a tree like structure to list all possible outcomes. Decision trees are preferred for their simple structure, requiring little effort for data preparation and easy interpretation. This project implements ID3, an algorithm for building the decision tree using information gain. The decision tree is converted to a set of rules and the error rate is calculated using the test dataset. The dataset is usually stored in a relational database in the form tables. In practice, it might be desired that data be stored across multiple databases. In such scenarios, retrieving and coordinating data from the databases could be a challenging task. This project provides the implementation of ID3 algorithm with the convenience of reading data stored at multiple data sources.


CHAO LAN

Inequity Coefficient and Fair Transfer Learning

When & Where:


250 Nichols Hall

Committee Members:

Luke Huan, Chair
Lingjia Liu
Bo Luo
Xintao Wu
Jin Feng

Abstract

Fair machine learning is an emerging and urgent research topic that aims to avoid discriminatory predictions against protected groups of people in real-world decision makings. This project aims to advance the field in two dimensions. First, we propose a more practical measurement of individual fairness called inequity coefficient, which integrates the current individual fairness framework that lacks of practice and the current situation testing practice that lacks of principle. We develop certain foundations of the measurement and present its practice. Second, we propose a first study of fairness in the context of transfer learning, with focuses on the hypothesis transfer and multi-task settings over two tasks. We illustrate a new challenge called discriminatory transfer, where discrimination is enforced by traditional task relatedness constraints that only aim to find accurate hypotheses. We propose a set of new algorithms that aim to avoid discriminatory transfer across tasks or promote fairness within each task.


Chao Lan

Inequity Coefficient and Fair Transfer Learning

When & Where:


250 Nichols Hall

Committee Members:

Luke Huan, Chair
Lingjia Liu
Bo Luo
Xintao Wu
Jin Feng

Abstract

Fair machine learning is an emerging and urgent research topic that aims to avoid discriminatory predictions against protected groups of people in real-world decision makings. This project aims to advance the field in two dimensions. First, we propose a more practical measurement of individual fairness called inequity coefficient, which integrates the current individual fairness framework that lacks of practice and the current situation testing practice that lacks of principle. We develop certain foundations of the measurement and present its practice. Second, we propose a first study of fairness in the context of transfer learning, with focuses on the hypothesis transfer and multi-task settings over two tasks. We illustrate a new challenge called discriminatory transfer, where discrimination is enforced by traditional task relatedness constraints that only aim to find accurate hypotheses. We propose a set of new algorithms that aim to avoid discriminatory transfer across tasks or promote fairness within each task.


ROHIT BANERJEE

Extraction and Analysis of Amazon Reviews

When & Where:


246 Nichols Hall

Committee Members:

Fengjun Li, Chair
Man Kong
Bo Luo


Abstract

Amazon.com is one of the largest online retail stores in the world. Besides selling millions of product on their website, Amazon provides a variety of Web services including Amazon Review and Recommendation System. Users are encouraged to write product reviews to help others to understand products’ features and make purchase decisions. However, product reviews, as a type of user generated content (UGC), suffer from quality and trust problems. To help evaluating the quality of reviews, Amazon also provides the users with the helpfulness vote feature so that a user can support a review that he considers helpful. In this project we aim to study the relation between helpfulness votes and the ranks of the reviews. In particular, we are looking for answers to questions such as “how does the helpfulness votes affect review ranks?” and “how review rank and its presentation mechanism affect people’s voting behavior?” To investigate on these questions, we built a crawler to collect reviews and votes of reviews from Amazon at a daily basis. Then, we conducted an analysis on a dataset with over 50,000 Amazon reviews to identify the voting patterns and their impact on the review ranks. Our results show that there exists a positive correlation between the review ranks and the helpfulness votes. 


Rohit Banerjee

Extraction and Analysis of Amazon Reviews

When & Where:


246 Nichols Hall

Committee Members:

Fengjun Li, Chair
Man Kong
Bo Luo


Abstract

Amazon.com is one of the largest online retail stores in the world. Besides selling millions of product on their website, Amazon provides a variety of Web services including Amazon Review and Recommendation System. Users are encouraged to write product reviews to help others to understand products’ features and make purchase decisions. However, product reviews, as a type of user generated content (UGC), suffer from quality and trust problems. To help evaluating the quality of reviews, Amazon also provides the users with the helpfulness vote feature so that a user can support a review that he considers helpful. In this project we aim to study the relation between helpfulness votes and the ranks of the reviews. In particular, we are looking for answers to questions such as “how does the helpfulness votes affect review ranks?” and “how review rank and its presentation mechanism affect people’s voting behavior?” To investigate on these questions, we built a crawler to collect reviews and votes of reviews from Amazon at a daily basis. Then, we conducted an analysis on a dataset with over 50,000 Amazon reviews to identify the voting patterns and their impact on the review ranks. Our results show that there exists a positive correlation between the review ranks and the helpfulness votes.​


BIJAL PARIKH

A Comparison of Tolerance Relation and Valued Tolerance Relation for Incomplete Datasets

When & Where:


2001B Eaton Hall

Committee Members:

Jerzy Grzymala-Busse, Chair
Prasad Kulkarni
Bo Luo


Abstract

Rough set theory is a popular approach for decision rule induction. However, it requires the objects in the information system to be completely described. Many real life data sets are incomplete, so we cannot apply directly rough set theory for rule induction. This project implements and compares two generalizations of rough set theory, used for rule induction from incomplete data: Tolerance Relation and Valued Tolerance Relation. A comparative analysis is conducted for the lower and upper approximations and decision rules induced by the two methods. Our experiments show that Valued Tolerance Relation provides better approximations than Simple Tolerance Relation when the percentage of missing attribute values in the datasets is high.


Bijal Parikh

A Comparison of Tolerance Relation and Valued Tolerance Relation for Incomplete Datasets

When & Where:


2001B Eaton Hall

Committee Members:

Jerzy Grzymala-Busse, Chair
Prasad Kulkarni
Bo Luo


Abstract

Rough set theory is a popular approach for decision rule induction. However, it requires the objects in the information system to be completely described. Many real life data sets are incomplete, so we cannot apply directly rough set theory for rule induction. This project implements and compares two generalizations of rough set theory, used for rule induction from incomplete data: Tolerance Relation and Valued Tolerance Relation. A comparative analysis is conducted for the lower and upper approximations and decision rules induced by the two methods. Our experiments show that Valued Tolerance Relation provides better approximations than Simple Tolerance Relation when the percentage of missing attribute values in the datasets is high.


ALHANOOF ALTHNIAN

Evolutionary Learning of Goal-Driven Multi-Agent Communication

When & Where:


2001B Eaton Hall

Committee Members:

Arvin Agah, Chair
Prasad Kulkarni
Fengjun Li
Bo Luo
Elaina Sutley

Abstract

Multi-agent systems are a common paradigm for building distributed systems in different domains such as networking, health care, swarm sensing, robotics, and transportation. Systems are usually designed or adjusted in order to reflect the performance trade-offs made according to the characteristics of the mission requirement. 
Research has acknowledged the crucial role that communication plays in solving many performance problems. Conversely, research efforts that address communication decisions are usually designed and evaluated with respect to a single predetermined performance goal. This work introduces Goal-Driven Communication, where communication in a multi-agent system is determined according to flexible performance goals. 
This work proposes an evolutionary approach that, given a performance goal, produces a communication strategy that can improve a multi-agent system’s performance with respect to the desired goal. The evolved strategy determines what, when, and to whom the agents communicate. The proposed approach further enables tuning the trade-off between the performance goal and communication cost, to produce a strategy that achieves a good balance between the two objectives, according the system designer’s needs. 


JYOTI GANGARAJU

A Laboratory Manual for an Introduction to Communication Systems Course

When & Where:


2001B Eaton Hall

Committee Members:

Victor Frost, Chair
Dave Petr
Glenn Prescott


Abstract

Communication systems laboratory is a hands-on way to effectively visualize the real life applications of communication systems in its simplest form. Recently, hardware equipment such as spectrum analyzer, oscilloscope, and function generator were replaced by Pico Scope 6, a software based data analyzer. The Pico Scope 6 is a user friendly software which enables its users to capture and analyze analog and digital signals with a comparatively higher accuracy. Additionally, it is an economically viable solution, from both the procurement and maintenance stand point. The current effort focuses on developing a laboratory user manual, based on Pico Scope 6, for undergraduates of the Department of Electrical Engineering and Computer Science (EECS). The series of laboratory exercises developed follows the course outline of Introduction to Communication Systems – EECS 562. The expected outcomes of this laboratory manual is an improved understanding of analog modulations, digital modulations, and noise analysis of communication systems.