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

Jennifer Quirk

Aspects of Doppler-Tolerant Radar Waveforms

When & Where:


Nichols Hall, Room 246 (Executive Conference Room)

Committee Members:

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

Abstract

The Doppler tolerance of a waveform refers to its behavior when subjected to a fast-time Doppler shift imposed by scattering that involves nonnegligible radial velocity. While previous efforts have established decision-based criteria that lead to a binary judgment of Doppler tolerant or intolerant, it is also useful to establish a measure of the degree of Doppler tolerance. The purpose in doing so is to establish a consistent standard, thereby permitting assessment across different parameterizations, as well as introducing a Doppler “quasi-tolerant” trade-space that can ultimately inform automated/cognitive waveform design in increasingly complex and dynamic radio frequency (RF) environments. 

Separately, the application of slow-time coding (STC) to the Doppler-tolerant linear FM (LFM) waveform has been examined for disambiguation of multiple range ambiguities. However, using STC with non-adaptive Doppler processing often results in high Doppler “cross-ambiguity” side lobes that can hinder range disambiguation despite the degree of separability imparted by STC. To enhance this separability, a gradient-based optimization of STC sequences is developed, and a “multi-range” (MR) modification to the reiterative super-resolution (RISR) approach that accounts for the distinct range interval structures from STC is examined. The efficacy of these approaches is demonstrated using open-air measurements. 

The proposed work to appear in the final dissertation focuses on the connection between Doppler tolerance and STC. The first proposal includes the development of a gradient-based optimization procedure to generate Doppler quasi-tolerant random FM (RFM) waveforms. Other proposals consider limitations of STC, particularly when processed with MR-RISR. The final proposal introduces an “intrapulse” modification of the STC/LFM structure to achieve enhanced sup pression of range-folded scattering in certain delay/Doppler regions while retaining a degree of Doppler tolerance.


Mary Jeevana Pudota

Assessing Processor Allocation Strategies for Online List Scheduling of Moldable Task Graphs

When & Where:


Eaton Hall, Room 2001B

Committee Members:

Hongyang Sun, Chair
David Johnson
Prasad Kulkarni


Abstract

Scheduling a graph of moldable tasks, where each task can be executed by a varying number of

processors with execution time depending on the processor allocation, represents a fundamental

problem in high-performance computing (HPC). The online version of the scheduling problem

introduces an additional constraint: each task is only discovered when all its predecessors have

been completed. A key challenge for this online problem lies in making processor allocation

decisions without complete knowledge of the future tasks or dependencies. This uncertainty can

lead to inefficient resource utilization and increased overall completion time, or makespan. Recent

studies have provided theoretical analysis (i.e., derived competitive ratios) for certain processor

allocation algorithms. However, the algorithms’ practical performance remains under-explored,

and their reliance on fixed parameter settings may not consistently yield optimal performance

across varying workloads. In this thesis, we conduct a comprehensive evaluation of three processor

allocation strategies by empirically assessing their performance under widely used speedup models

and diverse graph structures. These algorithms are integrated into a List scheduling framework that

greedily schedules ready tasks based on the current processor availability. We perform systematic

tuning of the algorithms’ parameters and report the best observed makespan together with the

corresponding parameter settings. Our findings highlight the critical role of parameter tuning in

obtaining optimal makespan performance, regardless of the differences in allocation strategies.

The insights gained in this study can guide the deployment of these algorithms in practical runtime

systems.


Past Defense Notices

Dates

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
John Paden (Co-Chair)
Shannon Blunt
Carl Leuschen
Leigh Stearns

Abstract

Multichannel synthetic aperture radar (SAR) sounders with cross-track antenna arrays map ice sheet basal morphology in three dimensions with a single pass using tomography.  The tomographic ice-sheet imaging method leverages parametric direction-finding techniques like the Maximum Likelihood Estimator and the Multiple Signal Classification algorithm to resolve scattering interfaces in elevation.  These techniques have received considerable attention because of their potential to exceed the Rayleigh resolution limit of the receive array under certain conditions.  This performance is predicated on having perfect knowledge of the frequency-dependent response of the array to directional sources, referred to as the array manifold.  Even modest amounts of mismatch between the assumed and actual manifold model degrade the accuracy of parametric angle estimators and erode their sought-after superresolution potential.

 

Array manifold calibration refers to the step in the array processor of refining our representation of the directional array-response vectors by accounting for factors such as mutual coupling, geometric uncertainties, and channel-to-channel gain imbalances.  Pilot calibration requires measuring the in-situ array over its field of view and storing the manifold in a look-up-table.  Alternatively, the array transfer function may be modeled parametrically to levy an estimation framework for characterizing mismatch.  Parametric calibration theory for sensor position perturbations has been established for several decades.  However, there remains a marked disconnect between the signal processing and antennas communities regarding how to include mutual coupling within the parametric framework.  To date, literature lacks validated studies that address parameterization of the embedded element patterns for direction-finding arrays.

 

A manifold calibration methodology is proposed for an airborne, multichannel ice-penetrating SAR.  The methodology departs from conventional approaches by extracting calibration targets from SAR imagery of well-understood terrain to empirically characterize the directional responses of the integrated array's embedded element patterns.  This work presents a Maximum Likelihood Estimator for nonlinear parameters common across disjoint calibration sets that has the potential to improve the accuracy of our estimated geometric uncertainties by increasing the total Fisher information in our observations.  The investigation contributes to specific gaps in array signal processing and remote sensing literature by treating the unique challenge of calibrating in-situ arrays used in direction-finding applications.


Dung Viet Nguyen

Particle Swarm Deep Reinforcement Learning for Base Station Optimization in Urban Areas

When & Where:


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

Committee Members:

Taejoon Kim, Chair
Morteza Hashemi
Heechul Yun


Abstract

Densifying the network by deploying many small cells has attracted significant interests from wireless industries for exploring its potential to facilitating the proposed many data-intensive use cases in fifth-generation (5G) networks. While such efforts are essential, there are gaps in fundamental research and practical deployment of small cells. It is clear that increased interference from adjacent cells, called intercell interference, is the major limiting factor.  In order to address this issue, each base station's parameters should be properly controlled to mitigate the intercell interference. We call the task of designing the base station's parameters the base station optimization (BSO) problem in this work. Due to the large numbers of small cells and mobile users distributed over the network, solving BSO by precisely modeling the network conditions is almost infeasible. One of the popular approaches that has attracted many researchers recently is a data-based framework called machine learning (ML). While supervised ML is prevalent, it requires pre-labeled off-line data that are not available in many wireless scenarios. Unlike supervised ML, reinforcement learning (RL) can handle this situation because it is based on designing a good policy to find the best exploration-\&-exploitation tradeoff without the pre-labeled training dataset. Thus, in this work, we present a new approach to the problem of BSO, based on the application of deep reinforcement learning (DRL) to enhance the quality of service (QoS) experienced by mobile users. To speed up the exploration of DRL, we employ particle swarm optimization (PSO), which shows improved QoS and convergence compared to conventional DRL.


Dalton Hahn

Delving Into DevOps: Examining the Security Posture of State-of-Art Service Mesh Tools

When & Where:


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

Committee Members:

Alex Bardas, Chair
Drew Davidson
Fengjun Li


Abstract

Explosion in the use of containers and a shift in software engineering design from monolithic applications into a microservice model has driven a need for software solutions that can manage the deployment and networking of microservices at enterprise-level scale. Service meshes have emerged as a promising solution to the microservice eruption that enterprise software is currently experiencing. This work examines service meshes from the perspective of security solutions offered within the tools and how the available security mechanisms impact the original goals of service meshes. As part of this study, we propose a relevant threat model to the service mesh domain and consider two different levels of configuration of these tools. The first configuration we study is the “idealized” configuration; one in which a system administrator has deep knowledge and the ability to properly configure and enable all available security mechanisms within a service mesh. The second configuration scenario is that of the default configuration deployment of service meshes. Through this work, we consider a range of adversarial approaches and scenarios that comprehensively cover the available attack surface of service meshes. Our experimental results show a distinct lack in security support of service meshes when deployed under default configurations, and additionally, in many idealized scenarios studied, it is possible for attackers to achieve some of their adversarial goals, presenting tempting targets to attackers.


Calen Carabajal

Development of Compact UWB Transmit Receive Modules and Filters on Liquid Crystal Polymer for Radar

When & Where:


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

Committee Members:

Carl Leuschen, Chair
Fernando Rodriguez-Morales (Co-Chair)
Christopher Allen


Abstract

Microwave and mm-wave radars have been used extensively for remote sensing applications, and ultra-wideband (UWB) radars have provided particular utility in geophysical research due to their ability to resolve narrowly-spaced targets or media interface levels. With increased availability of unmanned aerial vehicles (UAS) and expanded application of microwave radars into other realms requiring portability, miniaturization of radar systems is a crucial goal. This thesis presents the design and development of various microwave components for a compact, airborne snow-probing radar with multi-gigahertz bandwidth and cm-scale vertical resolution.

 
First, a set of UWB, compact transmit and receive modules with custom power sequencing circuits is presented. These modules were rapid-prototyped as an initial step toward the miniaturization of the radar’s front-end, using a combination of custom and COTS circuits. The transmitter and receiver modules operate in the 2–18 GHz range. Laboratory and field tests are discussed, demonstrating performance that is comparable to previous, connectorized implementations of the system, while accomplishing a 5:1 size reduction.

 

Next, a set of miniaturized band-pass and low-pass filters is developed and demonstrated. This work addressed the lack of COTS circuits with adequate performance in a sufficiently small form factor that is compatible with the planar integration required in a multi-chip module.

 

The filters presented here were designed for manufacture on a multi-layer liquid crystal polymer (LCP) substrate. A detailed trade study to assess the effects of potential manufacturing tolerances is presented. A framework for the automated creation of panelized design variations was developed using CAD tools. Thirty-two design variations with two different types of launches (microstrip and grounded co-planar waveguide) were successfully simulated, fabricated and tested, showing good electrical performance both as individual filters and cascaded to offer outstanding out-of-band rejection. The size of the new filters is 1 cm x 1 cm x 150 µm, a vertical reduction of over 90% and a reduction of total cascaded length by over 80%.


Kunal Karnik

Augment drone GPS telemetry data onto its Optical Flow lines

When & Where:


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

Committee Members:

Andy Gill, Chair
Drew Davidson
Prasad Kulkarni


Abstract

Optical flow is the apparent displacement of objects, surfaces and edges in a visual scene caused because of the relative motion between an observer and the scene. This apparent displacement (parallax) is used to render optical flow lines for such objects which hold invaluable information about their motion. In this research, we apply this technique to study a video file. We will locate pixels of objects with strong optical flow displacements. Which will enable us to identify an aerial multirotor craft (drone) from possible object pixels. Further we will not only mark the drones path using optical flow lines, but we will also add value to the video file by augmenting the drone’s 3D Telemetry data onto its optical flow lines.


Guojun Xiong

Distributed Filter Design and Power Allocation for Small-Cell MIMO Network

When & Where:


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

Committee Members:

Taejoon Kim, Chair
Morteza Hashemi
Erik Perrins


Abstract

The deluge of wireless data traffic catalyzed by the growing number of data-intensive devices has motivated the deployment of small-cell in fifth-generation (5G) networks. A primary challenge for deploying dense small-cell networks comes from the lack of practical techniques that efficiently handle the increased network interference at a low cost. This has aroused considerable interest in the distributed precoder/combiner coordination techniques that leverage the channel reciprocity, while relying on the local channel state information (CSI) available at each communication end. In this project, a distributed approach is proposed to the problem of signal-to-interference-plus-noise-ratio (SINR)-guaranteed power minimization (SGPM) for multicell multiuser (MCMU) multiple-input multiple-output (MIMO) systems. Unlike prior SGPM approaches, the technique is based on solving necessary and sufficient optimality conditions, which are derived by decomposing the original problem into forward and backward (FB) subproblems, while ensuring the strong duality of each subproblems. The proposed distributed SGPM algorithm makes use of FB adaptation and Jacobi recursion for iterative filter design and power allocation, respectively, which guarantees target SINR performance as well as its convergence to a stationary point. Simulation results illustrate the enhanced power efficiency with the performance guarantees of the proposed method compared to the existing distributed techniques.


Jason Baxter

An FPGA Implementation of Carrier Phase and Symbol Timing Synchronization for 16-APSK

When & Where:


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

Committee Members:

Erik Perrins, Chair
Taejoon Kim
Carl Leuschen


Abstract

Proper synchronization between a transmitter and receiver, in terms of carrier phase and symbol timing, is critical for reliable communication. Carrier phase synchronization is related to the frequency translation hardware, where perfect synchronization means that the local oscillators of the transmitter’s upconverter and receiver’s downconverter are aligned in phase and frequency. Timing synchronization is related to the analog-to-digital converter in the receiver, where perfect synchronization means that samples of the received signal are taken at transmitted symbol times. Perfect synchronization is unlikely in practical systems for a number of reasons, including hardware limitations and the independence of the transmitter and receiver. This thesis explores an FPGA implementation of a PLL-based carrier phase and symbol timing synchronization subsystem as part of a 16-APSK aeronautical telemetry receiver. The theory behind this subsystem is presented, and the hardware implementation of each component is described. Results demonstrate successful demodulation of a test signal, and system performance is shown to be comparable to double-precision floating point simulations in terms of error vector magnitude, synchronization lock time, and BER.


Adam Petz

An Infrastructure for Faithful Execution of Remote Attestation Protocols

When & Where:


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

Committee Members:

Perry Alexander, Chair
Drew Davidson
Andy Gill
Prasad Kulkarni
Emily Witt

Abstract

Security decisions often rely on trust.  An emerging technology for gaining trust in a remote computing system is remote attestation.  Remote attestation is the activity of making a claim about properties of a target by supplying evidence to an appraiser over a network.  Although many existing approaches to remote attestation wisely adopt a layered architecture–where the bottom layers measure layers above–the dependencies between components remain static and measurement orderings fixed.  Further, they are often restricted to a specialized embedded platform, or only perform shallow measurements on a component of interest without considering the trustworthiness of its context or the attestation mechanism itself.  For modern computing environments with diverse topologies, we can no longer fix a target architecture any more than we can fix a protocol to measure that architecture.

Copland is a domain-specific language and formal framework that provides a vocabulary for specifying the goals of layered attestation protocols.  It remains configurable by measurement capability, participants, and platform topology, yet provides a precise reference semantics that characterizes system measurement events and evidence handling; a foundation for comparing protocol alternatives.  The aim of this work is to refine the Copland semantics to a more fine-grained notion of attestation manager execution–a high-privilege thread of control responsible for invoking attestation services and bundling evidence results.  This refinement consists of two cooperating components called the Copland Compiler and the Attestation Virtual Machine (AVM).  The Copland Compiler translates a Copland specification into a sequence of primitive attestation instructions to be executed in the AVM.  These components are implemented as functional programs in the Coq proof assistant and proved correct with respect to the Copland reference semantics.  This formal connection is critical in order to trust that protocol specifications are faithfully carried out by the attestation manger implementation.  We also explore synthesis of appraisal routines that leverage the same formally verified infrastructure to interpret evidence generated by Copland protocols and make trust decisions.


Xiaohan Zhang

Golf Ball Detection and Tracking Based on Convolutional Neural Networks

When & Where:


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

Committee Members:

Richard Wang, Chair
Bo Luo
Cuncong Zhong


Abstract

With the rapid growth in artificial intelligence (AI), AI technologies have completely changed our lives. Especially in the sports field, AI starts to play the role in auxiliary training, data management, and systems that analyze training performance for athletes. Golf is one of the most popular sports in the world, which frequently utilize video analysis during training. Video analysis falls into the computer vision category. Computer vision is the field that benefited most during the AI revolution, especially the emerging of deep learning. 

This thesis focuses on the problem of real-time detection and tracking of a golf ball from video sequences. We introduce an efficient and effective solution by integrating object detection and a discrete Kalman model. For ball detection, five classical convolutional neural network based detection models are implemented, including Faster R-CNN, SSD, RefineDet, YOLOv3, and its lite version, YOLOv3 tiny. At the tracking stage, a discrete Kalman filter is employed to predict the location of the golf ball based on its previous observations. As a trade-off between the detection accuracy and detection time, we took advantage of image patches rather than the entire images for detection. In order to train the detection models and test the tracking algorithm, we collect and annotate a collection of golf ball dataset. Extensive experimental results are performed to demonstrate the effectiveness of the proposed technique and compare the performance of different neural network models.


Ronald Moore

AIDA: An Assistant for Workers with Intellectual and Developmental Disabilities

When & Where:


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

Committee Members:

Andrew Williams, Chair
Arvin Agah
Michael Branicky
Richard Wang

Abstract

Roughly 1 in 5 people in the United States have an intellectual or developmental disability (IDD), which is a substantial amount of the population. In the realm of human-robot interaction, there have been many attempts to help these individuals lead more productive and independent lives. However, many of these solutions focus on helping individuals with IDD develop social skills. For the solutions that do focus on helping people with IDD increase their work productivity, many of these involve giving the user control over a robot that augments the worker’s capabilities. In this thesis, it is posited that an autonomous agent could effectively assist workers with IDD, thereby increasing their productivity. The artificially intelligent disability assistant (AIDA) is an autonomous agent that uses social scaffolding techniques to assist workers with IDD. Before designing the system, data was gathered by observing workers with IDD perform tasks in a light manufacturing facility.
To test the hypothesis, an initial Wizard-of-Oz (WoZ) experiment was conducted where subjects had to assemble a box using only either their dominant or non-dominant hand. During the experiment, subjects could ask the robot for assistance, but a human operator controlled whether the robot provided a response. After the experiment, subjects were required to complete a feedback survey. Additionally, this feedback was used to refine and build the autonomous system for AIDA.
The autonomous system is composed of data collection and processing modules, a scaffolding algorithm module, and robot action output modules. This system was tested in a simulated experiment using video recordings from the initial experiment. The results of the simulated experiment provide support for the hypothesis that an autonomous agent using social scaffolding techniques can increase the productivity of workers with IDD. In the future, it is desired to test the current system in a real-time experiment before using it on workers with IDD.