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

Logan Schmalz

A Framework for Controlled Key Release

When & Where:


Nichols Hall, Room 246 (Executive Conference Room)

Committee Members:

Perry Alexander, Chair
Drew Davidson
Sankha Guria


Abstract

Modern security relies heavily on public key cryptography, and private keys and secrets in general must be protected from attackers. Against a highly-capable adversary it is ideal to store secrets outside of main memory, which is easy on general purpose systems with the now widely-available Trusted Platform Module (TPM) 2.0. However, the lack of integration between the TPM and the OS makes protecting secrets with automated availability needs difficult. We develop a strategy to authenticate OS entities and protect TPM-stored secrets without restricting access to the TPM, using standard features available on Linux---SELinux, Integrity Measurement Architecture (IMA), Extended Verification Module (EVM), and Linux Unified Key Setup (LUKS).


Pranav Sudhakar Raju

Information Theoretic Waveform Design and Receive Processing for Pulse Agile Radar

When & Where:


Nichols Hall, Room 246 (Executive Conference Room)

Committee Members:

James Stiles, Chair
Shannon Blunt
Patrick McCormick
Charles Mohr
Zsolt Talata

Abstract

Modern radar systems are increasingly required to operate in complex, dynamic environments where traditional waveform design and signal processing techniques reach fundamental limitations. To address this, waveform diversity has been utilized to increase design degrees of freedom and improve detection performance in challenging scattering scenarios. This dissertation leverages an information-theoretic framework to implement waveform design and receive processing techniques in pulse-agile radars.

First, a modification of Fishers Information known as Marginal Fishers Information is adapted specifically for application to pulse-agile radars, where the ensuing waveform sets are optimally designed to minimize the error covariance of the scene estimate, improving target detection. This methodology is applied to range-Doppler estimation, where some knowledge of the scattering scene is known a priori. By incorporating the a priori knowledge of the scene into the waveform design, the waveforms are able to inherently suppress the self-interference introduced by pulse-agility.

Second, the information theoretic framework is used to create pulse-agile receive processing techniques for range-only and range-Doppler estimation. The range-only implementation is an iterative minimum mean square error (MMSE) estimator similar to a Kalman filter, where the innovation-based update suited to pulse-agility, mirrors the Kalman filter’s correction step. The range-Doppler implementation leverages the same principles as the range-Doppler waveform design technique, where some knowledge of the scattering scenario a priori is used to suppress self-interference and improve the range-Doppler estimate in a desired region.

Both the waveform design and advanced receive processing techniques are first developed in the fast-time slow-time parameterization space, and then translated to a frequency-domain implementation to reduce computation complexity and improve tractability. Finally, future work is proposed to round out the content of the dissertation.


Sirisha Thippabhotla

From Fragments to Function: Computational Approaches for Reconstructing Biological Context in Metagenomic and Exosomal Discovery

When & Where:


Eaton Hall, Room 2001B

Committee Members:

Cuncong Zhong, Chair
Prasad Kulkarni
Fengjun Li
Zijun Yao
Liang Xu

Abstract

Advances in high-throughput Next Generation Sequencing (NGS) technologies have transformed our ability to study biological systems. However, a fundamental gap remains between generating data and interpreting it. Sequencing produces genomes, transcriptomes, and cell-derived signals as millions of short, fragmented sequences, resulting in the loss of biological context, specifically the long-range relationships that determine genes, structured RNAs, or regulatory signals. This work investigates computational and experimental approaches to improve functional discovery by reconstructing or preserving biological context. The concept is developed across three interconnected dimensions: sensitivity, scalability, and biological fidelity, demonstrating that context is lost and must be recovered at two distinct stages of the discovery process.

The first contribution handles the loss of context that occurs after sequencing. By representing metagenomic sequencing reads as connected paths in an assembly graph and guiding graph traversal with biological models, this work recovers both protein-coding and non-coding signals that conventional fragment-level analyses fail to detect, thereby revealing functional pathways that would otherwise be missed. The second contribution makes this recovery practical at scale by introducing a significantly faster framework that preserves the sensitivity of graph-based methods while reducing computational costs by over an order of magnitude, thus enabling the analysis of large present-day datasets.

The third contribution studies the loss of context prior to sequencing. Using extracellular vesicles as a model system, the findings show that cells cultured in conventional two-dimensional environments generate signals that differ from their physiological state. In contrast, cells cultured in three-dimensional models produce signals that closely resemble those observed in patients. This shows that an accurate biological model is essential for reliable discovery, since computational methods cannot recover signals that are fundamentally distorted at their origin.

Taken together, these contributions establish a set of methods and principles for extracting meaningful biological information from fragmented, high-throughput genomic data, thereby enabling more accurate functional discovery.


Harlan Williams

State-replicated key directories: Decoupling key distribution from the messaging service to prevent person-in-the-middle attacks

When & Where:


Zoom defense, please email jgrisafe@ku.edu for defense information.

Committee Members:

Hossein Saiedian, Chair
Arvin Agah
Perry Alexander


Abstract

End-to-end encrypted (E2EE) messaging services rely on the service operator to distribute authentic public keys. This arrangement protects users from external attackers, but fails catastrophically when the service itself acts maliciously. A service that distributes a spoofed key can silently decrypt, read, and re-encrypt its users' communications—undetectably, if users simply assume the service is trustworthy.

This thesis proposes and evaluates a state-replicated key directory, a model that decouples key distribution from the messaging service entirely. Instead of a single service controlling the directory, the directory is built and maintained across multiple decentralized nodes that follow a consensus and validation protocol. This design substantially raises the cost of key substitution attacks and, under well-defined assumptions, can prevent them outright.

We make three core contributions. First, we present End2, a fully functional browser-based E2EE messaging application that integrates a state-replicated key directory without modifying the underlying cryptographic session protocol. Second, we implement and compare three distinct key directory backends—centralized, permissionless blockchain (Ethereum), and permissioned blockchain (CometBFT)—and analyze their respective security and performance trade-offs. Third, we provide an empirical evaluation under realistic workloads, including upload and query latency, long-term performance degradation, validator failure resilience, and detection of malicious key insertions.

Our results show that a permissioned, Byzantine fault-tolerant key directory achieves query performance comparable to a centralized directory while providing substantially stronger security guarantees against service-side attacks. State-replicated key directories offer a practical and deployable path toward reducing the excessive trust placed in modern E2EE messaging providers.


Past Defense Notices

Dates

JUNYAN LI

Geo-Diversity Routing Protocol Implementation in ns-3

When & Where:


246 Nichols Hall

Committee Members:

James Sterbenz, Chair
Victor Frost
Bo Luo


Abstract

The path geo-diversity routing protocol described in this report takes advantage of geographical diversity of physical network topology, and quickens the routing selection. By importing this mechanism, a more accurate path could be provided instead of multiple useless attempts when area-based challenges occur in the network. A k-shortest path algorithm is introduced, followed by a modified algorithm. These two algorithms are implemented in ns-3, and tested in both grid network and real network. Simulation results show that they provide better performance compared to OSPF, as multiple geo-diverse paths are calculated to provide reliable performance.


NAJLA AHMAD

Intent Recognition in Multi-Agent Systems: Collective Box Pushing and Cow Herding

When & Where:


250 Nichols Hall

Committee Members:

Arvin Agah, Chair
Victor Frost
Jerzy Grzymala-Busse
Bo Luo
Sara Kieweg

Abstract

In a multi-agent system, an idle agent may be available to assist other agents in the system. An agent architecture called intent recognition is proposed to accomplish this with minimal communication. 
In order to assist other agents in the system, an agent performing recognition observes the tasks other agents are performing. Unlike the much studied field of plan recognition, the overall intent of an agent is recognized instead of a specific plan. The observing agent may use capabilities that it has not observed. This study focuses on the key research questions of: (1) What are intent recognition systems? (2) How can these be used in order to have agents autonomously assist each other effectively and efficiently? A conceptual framework is proposed for intent recognition systems. An implementation of the conceptual framework is tested and evaluated. We hypothesize that using intent recognition in a multi-agent system increases utility (where utility is domain specific) and decreases the amount of communication. We test our hypotheses using two experimental series in the domains of Box Pushing, where agents attempt to push boxes to specified locations; and Cow Herding, where agents attempt to herd cow agents into team corrals. A set of metrics, including task time and number of communications, is used to compare the performance of plan recognition and intent recognition. In both sets of experimental series, intent recognition agents communicate fewer times than plan recognition agents. In addition, unlike plan recognition, when agents use the novel approach of intent recognition, they select unobserved actions to perform, which was seen in both experimental series. Intent recognition agents were also able to outperform plan recognition agents by sometimes reducing task completion time in the Box Pushing domain and consistently scoring more points in the Cow Herding domain.


JUSTIN METCALF

Signal Processing for Non-Gaussian Statistics: Clutter Distribution Identification and Adaptive Threshold Estimation

When & Where:


129 Nichols

Committee Members:

Shannon Blunt, Chair
Luke Huan
Lingjia Liu
Jim Stiles
Tyrone Duncan

Abstract

We examine the problem of determining a decision threshold for the binary hypothesis test that naturally arises when a radar system must decide if there is a target present in a range cell under test. Modern radar systems require predictable, low, constant rates of false alarm (i.e. when unwanted noise and clutter returns are mistaken for a target). Measured clutter returns have often been fitted to heavy tailed, non-Gaussian distributions. The heavy tails on these distributions cause an unacceptable rise in the number of false alarms. We use the class of spherically invariant random vectors (SIRVs) to model clutter returns. SIRVs arise from a phenomenological consideration of the radar sensing problem, and include both the Gaussian distribution and most commonly reported non-Gaussian clutter distributions (e.g. K distribution, Weibull distribution). We propose an extension of a prior technique called the Ozturk algorithm. The Ozturk algorithm generates a graphical library of points corresponding to known SIRV distributions. These points are generated from linked vectors whose magnitude is derived from the order statistics of the SIRV distributions. Measured data is then compared to the library and a distribution is chosen that best approximates the measured data. Our extension introduces a framework of weighting functions and adaptively scaling of the measured data. Further, we extend the Ozturk algorithm to both a distribution classi fication technique as well as a method of determining an adaptive threshold in data that may not belong to a known distribution. Special attention is paid to producing a robust, adaptive estimation of the detection threshold.


EGEMEN CETINKAYA

Modelling and Design of Resilient Networks under Challenges

When & Where:


246 Nichols Hall

Committee Members:

James Sterbenz, Chair
Victor Frost
Bo Luo
Gary Minden
Tyrone Duncan

Abstract

Communication networks, in particular the Internet, face a variety of challenges that can disrupt our daily lives resulting in the loss of human lives and significant financial costs in the worst cases. We define challenges as external events that trigger faults that eventually result in service failures. Understanding these challenges accordingly is essential for improvement of the current networks and for designing Future Internet architectures. This dissertation presents a taxonomy of challenges that can help evaluate design choices for the current and Future Internet. Graph models to analyse critical infrastructures are examined and a multilevel graph model is developed to study interdependencies between different networks. Furthermore, graph-theoretic heuristic optimisation algorithms are developed. These heuristic algorithms add links to increase the resilience of networks in the least costly manner and they are computationally less expensive than an exhaustive search algorithm. The performance of networks under random failures, targeted attacks, and correlated area-based challenges are evaluated by the challenge simulation module that we developed. The GpENI Future Internet testbed is used to conduct experiments to evaluate the performance of the heuristic algorithms developed.


AQSA PATEL

Interpretation of SIRAL Waveforms using Ultra-wideband Radar Altimeter Data

When & Where:


317 Nichols Hall

Committee Members:

Carl Leuschen, Chair
Swapan Chakrabarti
Prasad Gogineni
John Paden
David Braaten

Abstract

The surface-elevation of ice sheets and sea ice is currently measured using both satellite and airborne radar altimeters. These measurements are used for generating mass balance estimates of ice sheets and thickness estimates of sea ice. However, due to the penetration of the altimeter signal into the snow there is ambiguity between the surface tracking point and the actual surface location which produces errors in the surface elevation measurement. Until now there is no comprehensive study done to address how the penetration of the Ku-band signal affects the shape of the return signal over various snow zones and sea ice. Therefore, it is important to study the effect sub-surface scattering and seasonal variations in the properties of snow pack have on the return waveform to correctly interpret the satellite radar altimeter data. To address this problem, an ultra-wide bandwidth Ku-band radar altimeter was developed at the Center for Remote Sensing of Ice Sheets (CReSIS). The CReSIS Ku-band Altimeter (CKA) operates over the frequency range of 12 to 18 GHz providing very fine resolution to resolve the sub-surface features of the snow. The CKA is design to encompass the frequency band of SIRAL, a satellite radar altimeter on board CryoSat-2, operating from 13.4 to 13.75 GHz. The data from CKA can be used to simulate SIRAL data, and the simulated SIRAL waveforms can help us understand the effect of signal penetration and sub-surface scattering on the low bandwidth satellite altimeter. The extensive CKA data collected as a part of the Operation Ice Bridge (OIB) campaign can be used to interpret SIRAL data over surfaces with varying snow conditions. The goal of this research is to use modeling and data inter-comparisons from CKA and satellite measurements to investigate the effect of signal penetration into snow and geophysical snow conditions on the retrieval of surface elevation from satellite radar altimeters, such as SIRAL. Based on the results of this investigation, the plan is to improve the tracking algorithms used by SIRAL to effectively track the actual surface location accurately.


MEEYOUNG PARK

HealthTrust: Assessing the Trustworthiness of Healthcare Information on the Internet

When & Where:


250 Nichols Hall

Committee Members:

Bo Luo, Chair
Xue-Wen Chen
Arvin Agah
Luke Huan
Michael Wang

Abstract

As well recognized, healthcare information is growing exponentially and is made more available to public. Frequent users such as medical professionals and patients are highly dependent on the web sources to get the appropriate information promptly. However, the trustworthiness of the web information can be hardly discriminated due to the fast and augmentative properties of the Internet. Most search engines provide relevant pages to given keywords, but the results might contain unreliable or biased information. 

In this dissertation, I proposed a new system named HealthTrust, which automatically assesses the trustworthiness of healthcare information over the Internet. First, in the first phase, a new ranking algorithm for structure-based analysis is adopted. The basic hypothesis is that trustworthy pages are more likely to link to trustworthy pages. In this way, the original set of positive and negative seeds will propagate over the Web graph. Next, in the second phase, the content-consistency between general healthcare-related webpages and trusted sites is evaluated using information retrieval techniques to evaluate the context of the webpage. In addition, sentence modeling is employed to generate contents-based ranking for each page. Finally, an iterative algorithm is developed to integrate the two components.


STEVE PENNINGTON

Spectrum Coverage Estimation Using Large Scale Measurements

When & Where:


246 Nichols Hall

Committee Members:

Joe Evans, Chair
Arvin Agah
Victor Frost
Gary Minden
Ronald Aust

Abstract

Existing RF path loss models are useful for prediction but do not necessarily exploit additional knowledge such as differing terrain features. This research will examine the relationship between terrain type (determined by public GIS data sets) and empirical path loss model parameters through the use of a large scale data collection platform. A large scale measurement campaign will be undertaken to sample the UHF DTV bands from a variety of environments using a set of portable software defined radio sensors. Machine learning and geostatistical algorithms will then be used to learn path loss parameters for generalized terrain types.


MARK CALNON

Assistive Robotics for the Elderly: Encouraging Trust and Acceptance Using Affective Body Language

When & Where:


2001B Eaton Hall

Committee Members:

Arvin Agah, Chair
Frank Brown
Jerzy Grzymala-Busse
Bo Luo
Richard Branham

Abstract

"Assistive robotics for the elderly has become a significant area of research, driven primarily by a rapidly aging global population. Between 2011 and 2050, the number of people aged 60 and over is expected to climb from 893 million to 2.4 billion. In addition to a rapidly aging global population, a growing shortage of caretakers has placed additional urgency on the search for alternative solutions. 

Despite the potential benefits of assistive robotics, one significant hurdle that remains is designing robots that the elderly are willing to use. Not only must assistive robots be effective at monitoring and caring for the elderly, but they must also be acceptable to a wide range of elderly individuals. While a variety of factors can influence the acceptability of a robot, past research has focused primarily on the physical embodiment of the robot. 

Social robotics, however, uses human-robot interactions to study the many social factors that can influence the acceptability of a robot, including affective behaviors, or behaviors that simulate personality and emotion. While the majority of research in affective behaviors has focused on facial expressions, these methods require sophisticated anthropomorphic representations, which are not generally preferred by the elderly. 

However, in addition to facial expressions, body language can also be an effective communicator of emotions and personalities. This research will demonstrate the effectiveness of using non-verbal behaviors to simulate a variety of personalities and emotions on the Aldebaran Nao, as well as the impact these behaviors have on the elderly’s trust and acceptance of the assistive robot. By adapting the personalities and emotions of an assistive robot both to the task it is performing, as well as to individual elderly users, this research will ultimately enable assistive robots to perform as more effective caretakers for the elderly."


DAVID HARVIE

Targeted Scrum: Software Development Inspired by Mission Command

When & Where:


2001B Eaton Hall

Committee Members:

Arvin Agah, Chair
Bo Luo
Jim Miller
Hossein Saiedian
Prajna Dhar

Abstract

Software development has been and continues to be a difficult enterprise. As early as the 1960’s, computer experts recognized the need to develop working and reliable software, within budget and on time. One of the major obstacles to successful software development is the inevitability of changing requirements. Agile software development methods, such as Extreme Programming and Scrum, emerged in the 1990’s as responses to deal with constant change. However, agile software development methods have their own set of weaknesses. Two specific weaknesses with Scrum are a lack of initial planning and a lack of an overall architecture. 
Military operations are another field that must deal with constantly changing requirements in complex environments. In response to this inescapable change, the military these days has primarily employed mission command to direct operations. Mission command is the philosophy where a commander gives subordinates his/her intent and desired end state for an operation, and then the subordinates have appropriate flexibility to operate to achieve that intent and end state. This research effort seeks to use inspirations from mission command to improve certain aspects of agile software development, namely Scrum, both in terms of the process and the product. 
This research effort seeks to address the lack of initial planning in Scrum with the addition of a Product Design Meeting at the onset of the process. This effort also addresses the lack of an overall architecture using two artifacts derived from mission command, the product’s end state and lines of effort (LOEs) necessary to achieve that end state. The addition of the Product Design Meeting, product end state, and LOEs will add more formalism to an agile method. However, we hypothesize that the benefits of adding those techniques will offset any perceived loss of agility.


SAHANA RAGHUNANDAN

Analysis of Angle of Arrival Estimation Algorithms for Basal Ice Sheet Tomography

When & Where:


317 Nichols Hall

Committee Members:

John Paden, Chair
Shannon Blunt
Carl Leuschen


Abstract

One of the key requirements for deriving more realistic ice sheet models is to obtain a good set of basal measurements that enable accurate estimation of bed roughness and conditions. For this purpose, 3D tomography of the ice bed has been successfully implemented with the help of angle of arrival estimation (AoA) algorithms such as multiple signal classification (MUSIC) and maximum likelihood estimation (MLE) techniques. These methods have enabled fine resolution in the cross-track dimension using synthetic aperture radar (SAR) images obtained from single pass multichannel data. This project analyzes and compares the results obtained from the spectral MUSIC algorithm, an alternating projection (AP) based MLE technique, and a relatively recent approach called the reiterative superresolution (RISR) algorithm. While the MUSIC algorithm is more attractive computationally compared to MLE, the performance of the latter is known to be superior in a low signal to noise ratio regime. The RISR algorithm takes a completely different approach by using a recursive implementation of the minimum mean square error (MMSE) estimation technique instead of using the sample covariance matrix (SCM) that is central to subspace based algorithms. This renders the algorithm more robust in scenarios where there is a very low sample support. The SAR focused datasets provide a good case study to explore the performance of the three techniques to the application of ice sheet bed elevation estimation.