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.


Past Defense Notices

Dates

JOSE FRANCISCO FLORENCIO NETO

Receiver Antenna Array for a Multichannel Sense-and-Avoid Radar for Small UAVs

When & Where:


2001B Eaton Hall

Committee Members:

Chris Allen, Chair
Ron Hui
Sarah Seguin


Abstract

A receiver monopole antenna array is designed for use in a sense-and-avoid radar for use in the Cessna C-172 and small Unmanned Aerial Vehicles (UAVs). This three element array is used for range, radial velocity and azimuthal angle calculations. After modeling and simulating it, the array is designed, implemented and finally tested in an anechoic chamber. These results are compared to both simulation and theoretical results. Since this array was designed to face harsh weather conditions, a protective dome made with ABS plastic is designed to cover it. The effects of this dome on the array’s radiation pattern are analyzed and compared to the array’s pattern without the dome. 
This array has a center frequency of 1.4454 GHz and has good reflection coefficient and coupling levels for the range of frequencies tested (1.35 to 1.5 GHz). The maximum gain of its elements varies between 0 and 2.2 dB for this frequency range.


ZHI LI

Power Modeling and Optimization for GPGPUs

When & Where:


246 Nichols Hall

Committee Members:

Xin Fu, Chair
Prasad Kulkarni
Gary Minden


Abstract

State-of-the-art General-Purpose computing on Graphics Processing Unit (GPGPU) is facing severe power challenge due to the increasing number of cores placed on a chip with decreasing feature size. In order to hide the long latency operations, GPGPU employs the fine-grained multi-threading among numerous active threads, leading to the sizeable register files with massive power consumption. Exploring the optimal power savings in register files becomes the critical and first step towards the energy-efficient GPGPU design. The conventional method to reduce dynamic power consumption is the supply voltage scaling, and the inter-bank tunneling FETs (TFETs) are the promising candidates compared to CMOS for low voltage operations regarding to both leakage and performance. However, always executing at the low voltage (so that low frequency) will result in significant performance degradation. In this study, we propose the hybrid CMOS-TFET based register files. To optimize the register power consumption, we allocate TFET-based registers to threads whose execution progress can be delayed to some degree to avoid the memory contentions with other threads, and the CMOS-based registers are still used for threads requiring normal execution speed. Our experimental results show that the proposed technique achieves 30% energy (including both dynamic and leakage) reduction in register files with little performance degradation compared to the baseline case equipped with naive power optimization technique.


VICTOR JARA-OLIVARES

Enhanced Glacial Sounding Accuracy with Dual-Frequency HF Radar

When & Where:


2001B Eaton Hall

Committee Members:

Chris Allen, Chair
Shannon Blunt
Dave Petr
Jim Stiles
George Tsoflias

Abstract

Radar instruments can be used to provide information on the internal and basal conditions of large and small ice masses. Radars operating in the lower part of the high frequency (HF) spectrum are required for sounding glaciers with large inclusions. Also, low-frequency sounders are useful for measuring thickness of fast-flowing glaciers in Greenland and Antarctica. This is due to the composition, attenuation, and backscattering from large pockets of water (inclusions) present in ice profile. 
To radio-echo sound (RES) glaciers while providing compatibility between lightweight/portability (mass and volume) with low power consumption, we have designed, built, tested and deployed a radar for sounding glaciers requiring the trade-offs between science requirements and performance. The attenuation factors for an electromagnetic (EM) wave traveling through ice such as the extinction coefficient (Ke), the target surface scattering due to the rms height and correlation length, and the external EM noise sources, have been estimated for the design of the radar. 
The HF radar used is a man-portable, dual-frequency radio-echo sounder, optimized to work in the lower half of the HF spectrum using electrically-small antennas (ESA). The radar is powered by 24 VDC provided by the use of batteries, solar panels or a portable generator capable of at least 50 W. 
On July 31, 2009, the HF sounder successfully collected ice thickness data when operated at 8.75 MHz and 14.2 MHz at Jakobshavn, Greenland glacier. The present work represents the first successful survey for ice thickness using a dual-frequency technique for enhancing range accuracy. Indeed, with a single frequency time of arrival (TOA) backscattered signal the ice thickness was estimated to be 957.1 m with an estimated accuracy of 22 m. By using a second frequency TOA and the phase information at the previously estimated range at both frequencies, the target range has been re-estimated to be 952.2 m with an estimated accuracy of 8.8 m.


EHSAN HOSSEINI

Synchronization Techniques for Burst-Mode CPM

When & Where:


250 Nichols Hall

Committee Members:

Erik Perrins, Chair
Shannon Blunt
Andrew Gill
David Petr
Tyrone Duncan

Abstract

Synchronization is a critical operation in digital communication systems which establishes and maintains an operational link between the transmitter and the receiver. As the advancement of digital modulation and coding schemes continues, the synchronization task becomes more and more challenging since the new standards require high-throughput functionality at low signal-to-noise ratios (SNRs). Consequently, well-established synchronization methods have to be revised and improved in order to meet the new requirements. In this research effort, we study the synchronization of continuous phase modulations (CPMs) in burst-mode communications which allow transmission of data packets to multiple users efficiently in terms of consumed power and bandwidth. Despite the attractive characteristics of CPM, its synchronization in burst-mode transmissions has not been studied well because it is a rather complex modulation with memory. In this work, we resort to data-aided techniques where a known training sequence is embedded in the burst to assist the synchronization algorithms. Therefore, the first phase of this effort is to derive the optimum training sequence for which the estimation error is minimized. The second phase consists of designing practical synchronization algorithms to resolve frequency offset, carrier phase and symbol timing ambiguities based on the observed training sequence. Finally, a hardware implementation is proposed in order to test the theoretical results in a real-world environment.


MUHARREM ALI TUNC

Optimal LPTV-Aware Bit Loading and Reduced Complexity Schemes in Broadband PLC for Smart Grid

When & Where:


250 Nichols Hall

Committee Members:

Erik Perrins, Chair
Shannon Blunt
Lingjia Liu
James Sterbenz
Tyrone Duncan

Abstract

Power line communication (PLC) has received steady interest over recent decades because of its economic use of existing power lines, and is one of the communication technologies envisaged for Smart Grid (SG) applications. However, since the power lines are not initially designed for data communication, the power line medium exhibits unique challanges for data communication. In particular for broadband (BB) PLC, the PLC channel shows linear periodically time varying (LPTV) behavior synchronous to the AC mains cycle, due to the time varying impedances of electrical devices that are connected to the power grid. In this research proposal, we focus on BB PLC LPTV channels, and investigate two major aspects for an orthogonal frequency division multiplexing (OFDM) system. First, we investigate the problem of optimal bit and power allocation, in order to increase throughput and improve energy e?ciency. We also provide reduced complexity mechanisms for the proposed bit loading scheme. This part constitutes the initial phase of our research. Second, we plan to tackle the problem of channel estimation for BB PLC LPTV channels and try to come up with low overhead and reduced complexity solutions, which is part of our future work that is in progress.


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
Yong Zeng

Abstract

Healthcare information is growing exponentially and is made more available to public. However, not all health-related information on the Internet is scientific, accurate and objective. 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. Consequently, a significant challenge associated with the information explosion is to ensure effective use of information. One way to improve the search results is by accurately identifying more trustworthy data. Surprisingly, although trustworthiness of sources is essential for a great number of daily users, not much work has been done for healthcare information sources by far. In this work, we propose a new method, HealthTrust, a new approach to automatically assess the trustworthiness of online healthcare information providers. The goal of the HealthTrust is to generalize and formalize the observations to develop a computational model that integrates topology-based and opinion-based approaches for credibility assessment of websites containing healthcare related information.


ZAID HAYYEH

Covert Networks Exploiting OFDM

When & Where:


250 Nichols Hall

Committee Members:

Victor Frost, Chair
Shannon Blunt
David Petr
Erik Perrins
Jeffrey Lang

Abstract

The desire to hide communications has been around for a very long time. This includes hiding the existence of the transmission and the location of the sender. The existence of wireless networks offers another medium for these covert communications. 
With many devices and networks competing for the limited spectrum, new technologies and methods are constantly sought after to increase spectral efficiency and broaden use to more devices and their bandwidth hungry applications. Orthogonal Frequency Division Multiplexing (OFDM) increases spectral efficiency when compared to Frequency Division Multiplexing (FDM). Adaptive modulation and coding (AMC), hybrid auto-repeat-request (HARQ), and opportunistic scheduling allows the system the ability to adapt to the changing environment and maintain performance. These technologies are utilized in fourth generation (4G) wireless networks such as Long Term Evolution Advanced (LITE-Advanced) and WiMAX. 
This research proposes to hide a covert communications network within the RF environment of these packet based networks. We anticipate the existence of the aforementioned technologies to allow the non-covert network to adjust to the existence of the covert network. In other words, the wireless networks will view the covert network as a minor change in the RF environment. This research will also seek to measure the effect of the covert networks on the non-covert networks performance.


LI CHENG

An Extensible Model-Based Approach for Analyzing and Testing Dynamic Multi-Tier Web Applications

When & Where:


2001B Eaton Hall

Committee Members:

Hossein Saiedian, Chair
Arvin Agah
Jerzy Grzymala-Busse
Fengjun Li
Reza Barati

Abstract

Web-based applications have become predominant in commercial software for all businesses, such as e-commerce, health care, government, and academia. There is a critical demand for effective and inexpensive functional testing methodologies for such applications to ensure their quality and reliability. The existing testing methodologies are insufficient to address the testing challenges raised by the increasing complexity of Web applications, including the use of multi-tier architectures, heterogeneous execution environments, dynamic contents, and frequent requirement changes. This research aims to address the above challenges by developing an extensible gray-box model-based testing (GMT) approach. 

The GMT defines a set of models that capture the dependencies of testing artifacts from a multi-tier architectural perspective. The models include Web conceptual model (WCM), Web object relation model (WORM), Web data to logic integration model (WDLIM), Web presentation to logic integration model (WPLIM), and Web system integration model (WSIM). The WORM, in the form of object relation diagrams, is used for the test case generation in intra-tier unit testing. The WLDIM and WPLIM are employed for gray-box integration testing across tiers. The WSIM, in the forms of system dependency graphs or UML sequence diagrams, is constructed for test path selection in black-box system testing phase. 

The GMT is capable of incorporating architectural styles beyond the traditional 3-tier Web applications. Extensions are developed to capture the component dependencies in elementary Web services, composite workflows, and Ajax-based rich Internet applications. A comprehensive empirical study is conducted to validate the GMT. Sixteen medium-scale projects from industrial context are selected as the subject applications. For each subject, 173 measurable attributes are collected. Formal analysis on the experiment data is performed and GMT is empirically evaluated against a well-known benchmark method to compare testing coverage effectiveness and testing performance. 

This research makes several important contributions to the software testing research community and demonstrates that the GMT effectively addresses the difficulty of analyzing multi-tier Web applications. The empirical results verify that the GMT is highly suitable in detecting functional defects in Web applications, particularly those from inter-tier integration. The fault seeding database and its experimental data establish a baseline for future empirical studies.


ANDREW FARMER

Mechanizing Worker/Wrapper for Domain Specific Optimizations

When & Where:


250 Nichols Hall

Committee Members:

Andy Gill, Chair
Perry Alexander
Prasad Kulkarni
James Miller
Chris Depcik

Abstract

A hallmark of functional programming languages is their support for the algebraic manipulation of programs. While such techniques lend themselves to mechanization, they are usually employed by hand, requiring considerable expertise, but offering a high assurance of the correctness of the result. Library writers are especially likely to use these techniques in order to implement optimizations which are either deemed too narrowly applicable to be worth implementing in a general language compiler, or may only represent an optimization in certain specific contexts. Such domain-specific optimizations can be incredibly effective however, offering complexity-changing improvement. In many instances, they are accomplished by changing the data structures over which the computation operates. 

We propose a framework for mechanizing the worker/wrapper transformation, which can express a large number of these domain-specific optimizations that depend on changing data structures. As a significant case study, we propose to recast the Stream Fusion transformation as an instance of worker/wrapper, using it to motivate the capabilities of our framework. We also propose extensions to Stream Fusion to allow it to optimize higher-order stream combinators. The resulting framework should lower the effort required to mechanize such transformations, leading to increased correctness and reuse. Additionally, the extended Stream Fusion transformation will offer practical performance improvements to a wide range of programs.


BRIEN SMITH-MARTINEZ

A Genetic Algorithm for Generating Radar Transmit Codes

When & Where:


2001B Eaton Hall

Committee Members:

Arvin Agah, Chair
Swapan Chakrabarti
James Stiles


Abstract

This work presents the design and development of a genetic algorithm to generate long range transmit codes with low autocorrelation side lobes for radar. The genetic algorithm described in this work has a parallel processing design and has been used to generate codes with multiple constellations for various code lengths with low estimated error of a target profile.