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

Manu Chaudhary

Utilizing Quantum Computing for Solving Multidimensional Partial Differential Equations

When & Where:


Eaton Hall, Room 2001B

Committee Members:

Esam El-Araby, Chair
Perry Alexander
Tamzidul Hoque
Prasad Kulkarni
Tyrone Duncan

Abstract

Quantum computing has the potential to revolutionize computational problem-solving by leveraging the quantum mechanical phenomena of superposition and entanglement, which allows for processing a large amount of information simultaneously. This capability is significant in the numerical solution of complex and/or multidimensional partial differential equations (PDEs), which are fundamental to modeling various physical phenomena. There are currently many quantum techniques available for solving partial differential equations (PDEs), which are mainly based on variational quantum circuits. However, the existing quantum PDE solvers, particularly those based on variational quantum eigensolver (VQE) techniques, suffer from several limitations. These include low accuracy, high execution times, and low scalability on quantum simulators as well as on noisy intermediate-scale quantum (NISQ) devices, especially for multidimensional PDEs.

 In this work, we propose an efficient and scalable algorithm for solving multidimensional PDEs. We present two variants of our algorithm: the first leverages finite-difference method (FDM), classical-to-quantum (C2Q) encoding, and numerical instantiation, while the second employs FDM, C2Q, and column-by-column decomposition (CCD). Both variants are designed to enhance accuracy and scalability while reducing execution times. We have validated and evaluated our proposed concepts using a number of case studies including multidimensional Poisson equation, multidimensional heat equation, Black Scholes equation, and Navier-Stokes equation for computational fluid dynamics (CFD) achieving promising results. Our results demonstrate higher accuracy, higher scalability, and faster execution times compared to VQE-based solvers on noise-free and noisy quantum simulators from IBM. Additionally, we validated our approach on hardware emulators and actual quantum hardware, employing noise mitigation techniques. This work establishes a practical and effective approach for solving PDEs using quantum computing for engineering and scientific applications.


Prashanthi Mallojula

On the Security of Mobile and Auto Companion Apps

When & Where:


Eaton Hall, Room 2001B

Committee Members:

Bo Luo, Chair
Alex Bardas
Fengjun Li
Hongyang Sun
Huazhen Fang

Abstract

The rapid development of mobile apps on modern smartphone platforms has raised critical concerns regarding user data privacy and the security of app-to-device communications, particularly with companion apps that interface with external IoT or cyber-physical systems (CPS). In this dissertation, we investigate two major aspects of mobile app security: the misuse of permission mechanisms and the security of app to device communication in automotive companion apps.

Mobile apps seek user consent for accessing sensitive information such as location and personal data. However, users often blindly accept these permission requests, allowing apps to abuse this mechanism. As long as a permission is requested, state-of-the-art security mechanisms typically treat it as legitimate. This raises a critical question: Are these permission requests always valid? To explore this, we validate permission requests using statistical analysis on permission sets extracted from groups of functionally similar apps. We identify mobile apps with abusive permission access and quantify the risk of information leakage posed by each app. Through a large-scale statistical analysis of permission sets from over 200,000 Android apps, our findings reveal that approximately 10% of the apps exhibit highly risky permission usage. 

Next, we present a comprehensive study of automotive companion apps, a rapidly growing yet underexplored category of mobile apps. These apps are used for vehicle diagnostics, telemetry, and remote control, and they often interface with in-vehicle networks via OBD-II dongles, exposing users to significant privacy and security risks. Using a hybrid methodology that combines static code analysis, dynamic runtime inspection, and network traffic monitoring, we analyze 154 publicly available Android automotive apps. Our findings uncover a broad range of critical vulnerabilities. Over 74% of the analyzed apps exhibit vulnerabilities that could lead to private information leakage, property theft, or even real-time safety risks while driving. Specifically, 18 apps were found to connect to open OBD-II dongles without requiring any authentication, accept arbitrary CAN bus commands from potentially malicious users, and transmit those commands to the vehicle without validation. 16 apps were found to store driving logs in external storage, enabling attackers to reconstruct trip histories and driving patterns. We demonstrate several real-world attack scenarios that illustrate how insecure data storage and communication practices can compromise user privacy and vehicular safety. Finally, we discuss mitigation strategies and detail the responsible disclosure process undertaken with the affected developers.


Syed Abid Sahdman

Soliton Generation and Pulse Optimization using Nonlinear Transmission Lines

When & Where:


Eaton Hall, Room 2001B

Committee Members:

Alessandro Salandrino, Chair
Shima Fardad
Morteza Hashemi


Abstract

Nonlinear Transmission Lines (NLTLs) have gained significant interest due to their ability to generate ultra-short, high-power RF pulses, which are valuable in applications such as ultrawideband radar, space vehicles, and battlefield communication disruption. The waveforms generated by NLTLs offer frequency diversity not typically observed in High-Power Microwave (HPM) sources based on electron beams. Nonlinearity in lumped element transmission lines is usually introduced using voltage-dependent capacitors due to their simplicity and widespread availability. The periodic structure of these lines introduces dispersion, which broadens pulses. In contrast, nonlinearity causes higher-amplitude regions to propagate faster. The interaction of these effects results in the formation of stable, self-localized waveforms known as solitons.
Soliton propagation in NLTLs can be described by the Korteweg-de Vries (KdV) equation. In this thesis, the Bäcklund Transformation (BT) method has been used to derive both single and two-soliton solutions of the KdV equation. This method links two different partial differential equations (PDEs) and their solutions to produce solutions for nonlinear PDEs. The two-soliton solution is obtained from the single soliton solution using a nonlinear superposition principle known as Bianchi’s Permutability Theorem (BPT). Although the KdV model is suitable for NLTLs where the capacitance-voltage relationship follows that of a reverse-biased p-n junction, it cannot generally represent arbitrary nonlinear capacitance characteristics.
To address this limitation, a Finite Difference Time Domain (FDTD) method has been developed to numerically solve the NLTL equation for soliton propagation. To demonstrate the pulse sharpening and RF generation capability of a varactor-loaded NLTL, a 12-section lumped element circuit has been designed and simulated using LTspice and verified with the calculated result. In airborne radar systems, operational constraints such as range, accuracy, data rate, environment, and target type require flexible waveform design, including variation in pulse widths and pulse
repetition frequencies. A gradient descent optimization technique has been employed to generate pulses with varying amplitudes and frequencies by optimizing the NLTL parameters. This work provides a theoretical analysis and numerical simulation to study soliton propagation in NLTLs and demonstrates the generation of tunable RF pulses through optimized circuit design.


Past Defense Notices

Dates

SASANK REDDY

Evaluation of an Equivalent Electrical Circuit Model Predicting the Battery Characteristics

When & Where:


2001B Eaton Hall

Committee Members:

Ron Hui, Chair
Joseph Evans
Jim Stiles


Abstract

Batteries are used everywhere and with the rise of the portable devices it is crucial to lower the power dissipation and to improve the battery runtime. An efficient way to describe the electrical behavior of a battery helps the designer to better predict and optimize the battery runtime and circuit performance. In this project a suggested electrical circuit model is used to evaluate the battery characteristics of an alkaline cell and a rechargeable NiMH cell and the same is implemented in Cadence environment. The measured data is compared with the simulated data and the results are discussed further. This circuit model is efficient in modeling the behavior of the batteries used in this project and can be extended to various other types of batteries.


SCOTT LOLLMAN

A Novel Approach for Visualizing Data Sets With Many Attributes

When & Where:


2001B Eaton Hall

Committee Members:

Jim Miller, Chair
Arvin Agah
Frank Brown


Abstract

This paper proposes a novel extension to the Attribute Blocks visualization technique that can be applied to visualizations containing many attributes. The Attribute Blocks visualization scheme is a technique that divides the visualization space into a regular pattern of small cells where each cell displays only one attribute. This paper recommends that the goal of a pattern design should be to have each attribute share equal length edges with each other attribute. This goal imposes new constraints on the number of attributes that can be simultaneously displayed, hence one significant challenge was to develop a new strategy that would allow more flexible pattern geometry and evaluating the effectiveness of this strategy with real data sets.


MOHAMMADREZA HAJIARBABI

A Face Detection and Recognition System For Color Images

When & Where:


2001B Eaton Hall

Committee Members:

Arvin Agah, Chair
Jerzy Grzymala-Busse
Prasad Kulkarni
Bo Luo
Sara Wilson

Abstract

A face detection and recognition system is a biometric identification mechanism which compared to other methods such as finger print identification, speech, signature, hand written and iris recognition is shown to be more important both theoretically and practically. In principle, the biometric identification methods use a wide range of techniques such as machine learning, machine vision, image processing, pattern recognition and neural networks. The methods have various applications such as in photo and film processing, control access networks, etc. In recent years, the automatic recognition of a human face has become an important problem in pattern recognition. The main reasons are that structural similarity of human faces and great impact of illumination conditions, facial expression and face orientation. Face recognition is considered one of the most challenging problems in pattern recognition. A face recognition system consists of two main components, face detection and recognition. In this dissertation we will design and implement a detection and recognition face system using color images with multiple faces. In color images, the information of skin color is used in order to distinguish between the skin pixels and non-skin pixels, dividing the image into some components. The next step is to decide which of these components belong to human face. After face detection, the faces which were detected in the previous step are to be recognized. Appearance based methods used in this work are one of the most important methods in face recognition due to the robustness of the algorithms to head rotation in the images, noise, low quality images, and other challenges.


ARUNABHA CHOUDHURY

Generalized FLIC: Learning with misclassification for Binary Classifiers

When & Where:


2001B Eaton Hall

Committee Members:

Jerzy Grzymala-Busse, Chair
Swapan Chakrabarti
Bo Luo


Abstract

This work formally introduces a generalized fuzzy logic and interval clustering (FLIC) technique which,when integrated with existing supervised learning algorithms, improves their performance. FLIC is a method that was first integrated with neural network in order to improve neural network’s performance in drug discovery using high throughput screening (HTS). This research strictly focuses on binary classification problems and generalizes the FLIC in order to incorporate it with other machine learning algorithms. In most binary classification problems, the class boundary is not linear. This pose a major problem when the number of outliers are significantly high, degrading the performance of the supervised learning function. FLIC identifies these misclassifications before the training set is introduced to the learning algorithm. This allows the supervised learning algorithm to learn more efficiently since it is now aware of those misclassifications. Although the proposed method performs well with most binary classification problems, it does significantly well for data set with high class asymmetry. The proposed method has been tested on four well known data sets of which three are from UCI Machine Learning repository and one from BigML. Tests have been conducted with three well known supervised learning techniques: Decision Tree, Logistic Regression and Naive Bayes. The results from the experiments show significant improvement in performance. The paper begins with a formal introduction to the core idea this research is based upon. It then discusses a list of other methods that have either inspired this research or have been referred to, in order to formalize the techniques. Subsequent sections discuss the methodology and the algorithm which is followed by results and conclusion. 

Keyword: supervised learning, binary classification, fuzzy logic, clustering 


PRACHI KHADILKAR

TicketWise, an Interface for Integrating an Email Service with a Ticketing Tool

When & Where:


220 Best

Committee Members:

Hossein Saiedian, Chair
Fengjun Li
Bo Luo


Abstract

IT Service Management (ITSM) is an IT function associated with resolving user issues through the support of a service desk. Some of the widely used ticket management tools that service desk utilizes include Remedy, Falcon and ServiceNow. These tools typically use a web portal as a front end for users to submit issues. Alternately, these tools may have a dedicated application that can be installed on a device. However, an application may not be compatible with various devices and is also very costly to maintain compatibility with current technology. Access to web portals requires a high bandwidth internet connection and connectivity could be a challenge in restricted areas. In these cases, a user’s only option is to report an issue via email. Email is supported on most connected devices and has very low internet bandwidth requirement. It also tends to be an ideal solution for traveling professionals. However, none of these ITSM tools provide a convenient mechanism to log tickets via email. Emails have to be manually converted to a ticket by the service desk. This process has a potential for human errors. 

With this objective, we have implemented an auto ticketing tool, 'TicketWise' that will automatically convert email requests into service tickets. This tool provides the necessary technological bridge for interfacing an email service with a ticketing system. This is a new feature that can be integrated with existing ITSM tools. New tickets get created for users who are registered with the system. Non-registered emails are automatically filtered out. Upon receiving a confirmation email the user can also send a follow up email. This information also gets updated in the ticket work log. 

TicketWise has been integrated with an application, 'TicketMe' that simulates a ticketing system. Validation has been successfully conducted by sending emails from a registered and a non-registered email address. In the former case, a new ticket was successfully created. In the latter, the email was filtered out. Contents from a follow up email for the ticket confirmation were also successfully added to the ticket work log. The results of the validation were satisfactory. 


SANTOSH GONDI

Design, Implementation, and Performance Analysis of In-Home Video based Monitoring System for Patients with Dementia

When & Where:


246 Nichols Hall

Committee Members:

James Sterbenz, Chair
Victor Frost
Bo Luo
Russ Waitman

Abstract

Dementia is a major public health problem affecting 35 million people in USA. The caregivers of dementia patients experience many types of physical and psychological stress while dealing with disruptive behaviors of dementia patients. This will also result in frequent hospitalizations and re-admissions. In this project we design, implement, and measure the performance of an advanced video based monitoring system to aide the caregivers in managing the behavioral symptoms of dementia patients. The caregivers will be able to easily capture and share the antecedents, consequences, and the function of behavior, through a video clip, and get the real-time feedback from clinical experts. Overall the system will help in reducing the hospital admission/readmission, improve the quality of life for caregivers, and in general result in reduced cost of health care systems. System is developed using python scripts, open source web frameworks, FFmpeg tool chain, and commercial off-the-shelf IP camera and mini-PC. WebRTC is used for video based coaching of caregivers. A framework has been developed to evaluate the storage and retrieval latency of video clips to public and On-premise clouds, video streaming performance in LAN and WLAN environments, and WebRTC performance in different types of access networks. InstaGENIrack, a GENI rack in KU is used as on-premise cloud infrastructure for the evaluation. OpenSSL utilities are employed for secured transport and storage of captured video clips. We conducted the trials in Google fiber ISP in Kansas city, and compared the performance with other traditional ISPs..


ANSU JOYS

Identifying Software Phase Markers in Java Byte Code

When & Where:


250 Nichols Hall

Committee Members:

Prasad Kulkarni, Chair
Andy Gill
Bo Luo


Abstract

Program execution can be classified into phases. These phases can be repeated during a single execution of the application. Ability to identify and classify the phases statically will help prepare the system early for the next phase, which can benefit overall program performance at run time. While static program phase detection algorithms have been explored for binary executable with promising results, to the best of our knowledge, such algorithms have not been targeted and evaluated for managed language, specifically Java, programs. Accurate detection of future program phases can allow the Java virtual machine to perform phase-specific optimizations to improve performance. 

In this project, we build a framework to detect program phases and insert software phase markers in Java byte code. We employ an existing algorithm to detect program phases and adapt it to detect phases for Java binaries. We modify the control flow graph generated by the byte code analysis tool WALA (Watson library for Analysis) to integrate program loops. We analyze each method in the control flow graph produced by WALA to detect loops, and convert the call graph into a "call loop graph". We then rely on program profiling to provide data on the number of times each basic block and edge is reached at run-time. We use this profiling information to determine the average number of instructions executed along each graph edge, the average number of times an edge is executed and the standard deviation for instructions on these edges in our algorithm to identify the software phase markers. 


ADITYA BALASUBRAMANIAN

Study and Performance Analysis of OFDM using GNURadio and USRP

When & Where:


250 Nichols Hall

Committee Members:

Lingjia Liu, Chair
Joe Evans
James Sterbenz


Abstract

Software defined radios (SDR) are a rapidly evolving technology which are used widely in industry and academia today. They offer a very low cost and flexible alternative for implementing and testing wireless technologies since most of the physical layer functionalities are implemented in 
software instead of hardware. Universal Software Defined Radio Peripheral (USRP) is one of the most popular products belong to the family of SDR. GNURadio, a software development kit comprising of C++ and Python libraries is widely used with USRP as a hardware platform to create SDR applications. 
In this project a tested is implemented for performance analysis of an OFDM communication system using GNURadio and USRP. The performance is analyzed and studied in a practical laboratory environment using GNURadio and USRP. The packet error rate versus SNR is calculated in different 
environmental settings .The effect of Interference and obstruction is also taken into account in studying the performance.


LOGAN SMITH

Validation of CReSIS Synthetic Aperture Radar Processor and Optimal Processing Parameters

When & Where:


317 Nichols Hall

Committee Members:

John Paden, Chair
Chris Allen
Carl Leuschen


Abstract

Sounding the ice sheets of Greenland and Antarctica is a vital component in determining the affect of global warming on sea level rise. Of particular importance to measure are the outlet glaciers that transport ice from the interior to the edge of the ice sheet. These outlet glaciers are difficult to sound due to crevassing caused by the relatively fast movement of the ice in the glacial channel and higher signal attenuation caused by warmer ice. The Center for Remote Sensing of Ice Sheets (CReSIS) uses multi-channel airborne radars with methods for achieving better resolution and signal-to-noise ratio (SNR) in the three major dimension to sound outlet glaciers. Synthetic aperture radar (SAR) techniques are used in the along-track dimension, pulse compression in the range dimension, and an antenna array in the cross-track dimension. 

CReSIS has developed a SAR processor to effectively and efficiently process the data collected by these radars in each dimension. To validate the performance of this processor a SAR simulator was developed with the functionality to test multiple aspects of the SAR processor. In addition to the implementation of this simulator for validation of processing the data in the along-track, cross-track and range dimensions, there are a number of data-dependent processing steps that can affect the quality of the final data product. These include creating matched filters for each dimension of the data, removing phase and amplitude differences between receive channels, and determining the optimal along-track beamwidth to use for processing the data. All of these factors can improve the ability to obtain the maximum amount of information from the collected data. The validation and optimal processing parameters and their theory are discussed here. 


H. SHANKER RAO

Dominant Attribute and Multiple Scanning Approaches for Discretization of Numerical Attributes

When & Where:


2001B Eaton Hall

Committee Members:

Jerzy Grzymala-Busse, Chair
Perry Alexander
Doina Caragea


Abstract

Rapid development of high throughput technologies and database management systems has made it possible to produce and store large amount of data. However, making sense of big data and discovering knowledge from it is a compounding challenge. Generally, data mining techniques search for information in datasets and express gained knowledge in the form of trends, regularities, patterns or rules. Rules are frequently identified automatically by a technique called rule induction, which is the most important technique in data mining and machine learning and it was developed primarily to handle symbolic data. However, real life data often contain numerical attributes and therefore, in order to fully utilize the power of rule induction techniques, an essential preprocessing step of converting numeric data into symbolic data called discretization is employed in data mining. 
Here we present two entropy based discretization techniques known as dominant attribute approach and multiple scanning approach, respectively. These approaches were implemented as two explicit algorithms in a JAVA programming language and experiments were conducted by applying each algorithm separately on seventeen well known numerical data sets. The resulting discretized data sets were used for rule induction by LEM2 or Learning from Examples Module 2 algorithm. For each dataset in multiple scanning approach, experiments were repeated with incremental scans until interval counts were stabilized. Preliminary results from this study indicated that multiple scanning approach performed better than dominant attribute approach in terms of producing comparatively smaller and simpler rule sets.