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
Mahmudul Hasan
Assertion-Based Security Assessment of Hardware IP Protection MethodsWhen & Where:
Eaton Hall, Room 2001B
Committee Members:
Tamzidul Hoque, ChairEsam El-Araby
Sumaiya Shomaji
Abstract
Combinational and sequential locking methods are promising solutions for protecting hardware intellectual property (IP) from piracy, reverse engineering, and malicious modifications by locking the functionality of the IP based on a secret key. To improve their security, researchers are developing attack methods to extract the secret key.
While the attacks on combinational locking are mostly inapplicable for sequential designs without access to the scan chain, the limited applicable attacks are generally evaluated against the basic random insertion of key gates. On the other hand, attacks on sequential locking techniques suffer from scalability issues and evaluation of improperly locked designs. Finally, while most attacks provide an approximately correct key, they do not indicate which specific key bits are undetermined. This thesis proposes an oracle-guided attack that applies to both combinational and sequential locking without scan chain access. The attack applies light-weight design modifications that represent the oracle using a finite state machine and applies an assertion-based query of the unlocking key. We have analyzed the effectiveness of our attack against 46 sequential designs locked with various classes of combinational locking including random, strong, logic cone-based, and anti-SAT based. We further evaluated against a sequential locking technique using 46 designs with various key sequence lengths and widths. Finally, we expand our framework to identify undetermined key bits, enabling complementary attacks on the smaller remaining key space.
Masoud Ghazikor
Distributed Optimization and Control Algorithms for UAV Networks in Unlicensed Spectrum BandsWhen & Where:
Nichols Hall, Room 246 (Executive Conference Room)
Committee Members:
Morteza Hashemi, ChairVictor Frost
Prasad Kulkarni
Abstract
UAVs have emerged as a transformative technology for various applications, including emergency services, delivery, and video streaming. Among these, video streaming services in areas with limited physical infrastructure, such as disaster-affected areas, play a crucial role in public safety. UAVs can be rapidly deployed in search and rescue operations to efficiently cover large areas and provide live video feeds, enabling quick decision-making and resource allocation strategies. However, ensuring reliable and robust UAV communication in such scenarios is challenging, particularly in unlicensed spectrum bands, where interference from other nodes is a significant concern. To address this issue, developing a distributed transmission control and video streaming is essential to maintaining a high quality of service, especially for UAV networks that rely on delay-sensitive data.
In this MSc thesis, we study the problem of distributed transmission control and video streaming optimization for UAVs operating in unlicensed spectrum bands. We develop a cross-layer framework that jointly considers three inter-dependent factors: (i) in-band interference introduced by ground-aerial nodes at the physical layer, (ii) limited-size queues with delay-constrained packet arrival at the MAC layer, and (iii) video encoding rate at the application layer. This framework is designed to optimize the average throughput and PSNR by adjusting fading thresholds and video encoding rates for an integrated aerial-ground network in unlicensed spectrum bands. Using consensus-based distributed algorithm and coordinate descent optimization, we develop two algorithms: (i) Distributed Transmission Control (DTC) that dynamically adjusts fading thresholds to maximize the average throughput by mitigating trade-offs between low-SINR transmission errors and queue packet losses, and (ii) Joint Distributed Video Transmission and Encoder Control (JDVT-EC) that optimally balances packet loss probabilities and video distortions by jointly adjusting fading thresholds and video encoding rates. Through extensive numerical analysis, we demonstrate the efficacy of the proposed algorithms under various scenarios.
Ganesh Nurukurti
Customer Behavior Analytics and Recommendation System for E-CommerceWhen & Where:
Eaton Hall, Room 2001B
Committee Members:
David Johnson, ChairPrasad Kulkarni
Han Wang
Abstract
In the era of digital commerce, personalized recommendations are pivotal for enhancing user experience and boosting engagement. This project presents a comprehensive recommendation system integrated into an e-commerce web application, designed using Flask and powered by collaborative filtering via Singular Value Decomposition (SVD). The system intelligently predicts and personalizes product suggestions for users based on implicit feedback such as purchases, cart additions, and search behavior.
The foundation of the recommendation engine is built on user-item interaction data, derived from the Brazilian e-commerce Olist dataset. Ratings are simulated using weighted scores for purchases and cart additions, reflecting varying degrees of user intent. These interactions are transformed into a user-product matrix and decomposed using SVD, yielding latent user and product features. The model leverages these latent factors to predict user interest in unseen products, enabling precise and scalable recommendation generation.
To further enhance personalization, the system incorporates real-time user activity. Recent search history is stored in an SQLite database and used to prioritize recommendations that align with the user’s current interests. A diversity constraint is also applied to avoid redundancy, limiting the number of recommended products per category.
The web application supports robust user authentication, product exploration by category, cart management, and checkout simulations. It features a visually driven interface with dynamic visualizations for product insights and user interactions. The home page adapts to individual preferences, showing tailored product recommendations and enabling users to explore categories and details.
In summary, this project demonstrates the practical implementation of a hybrid recommendation strategy combining matrix factorization with contextual user behavior. It showcases the importance of latent factor modeling, data preprocessing, and user-centric design in delivering an intelligent retail experience.
Srijanya Chetikaneni
Plant Disease Prediction Using Transfer LearningWhen & Where:
Eaton Hall, Room 2001B
Committee Members:
David Johnson, ChairPrasad Kulkarni
Han Wang
Abstract
Timely detection of plant diseases is critical to safeguarding crop yields and ensuring global food security. This project presents a deep learning-based image classification system to identify plant diseases using the publicly available PlantVillage dataset. The core objective was to evaluate and compare the performance of a custom-built Convolutional Neural Network (CNN) with two widely used transfer learning models—EfficientNetB0 and MobileNetV3Small.
All models were trained on augmented image data resized to 224×224 pixels, with preprocessing tailored to each architecture. The custom CNN used simple normalization, whereas EfficientNetB0 and MobileNetV3Small utilized their respective pre-processing methods to standardize the pretrained ImageNet domain inputs. To improve robustness, the training pipeline included data augmentation, class weighting, and early stopping.
Training was conducted using the Adam optimizer and categorical cross-entropy loss over 30 epochs, with performance assessed using accuracy, loss, and training time metrics. The results revealed that transfer learning models significantly outperformed the custom CNN. EfficientNetB0 achieved the highest accuracy, making it ideal for high-precision applications, while MobileNetV3Small offered a favorable balance between speed and accuracy, making it suitable for lightweight, real-time inference on edge devices.
This study validates the effectiveness of transfer learning for plant disease detection tasks and emphasizes the importance of model-specific preprocessing and training strategies. It provides a foundation for deploying intelligent plant health monitoring systems in practical agricultural environments.
Ahmet Soyyigit
Anytime Computing Techniques for LiDAR-based Perception In Cyber-Physical SystemsWhen & Where:
Nichols Hall, Room 250 (Gemini Room)
Committee Members:
Heechul Yun, ChairMichael Branicky
Prasad Kulkarni
Hongyang Sun
Shawn Keshmiri
Abstract
The pursuit of autonomy in cyber-physical systems (CPS) presents a challenging task of real-time interaction with the physical world, prompting extensive research in this domain. Recent advances in artificial intelligence (AI), particularly the introduction of deep neural networks (DNN), have significantly improved the autonomy of CPS, notably by boosting perception capabilities.
CPS perception aims to discern, classify, and track objects of interest in the operational environment, a task that is considerably challenging for computers in a three-dimensional (3D) space. For this task, the use of LiDAR sensors and processing their readings with DNNs has become popular because of their excellent performance However, in CPS such as self-driving cars and drones, object detection must be not only accurate but also timely, posing a challenge due to the high computational demand of LiDAR object detection DNNs. Satisfying this demand is particularly challenging for on-board computational platforms due to size, weight, and power constraints. Therefore, a trade-off between accuracy and latency must be made to ensure that both requirements are satisfied. Importantly, the required trade-off is operational environment dependent and should be weighted more on accuracy or latency dynamically at runtime. However, LiDAR object detection DNNs cannot dynamically reduce their execution time by compromising accuracy (i.e. anytime computing). Prior research aimed at anytime computing for object detection DNNs using camera images is not applicable to LiDAR-based detection due to architectural differences. This thesis addresses these challenges by proposing three novel techniques: Anytime-LiDAR, which enables early termination with reasonable accuracy; VALO (Versatile Anytime LiDAR Object Detection), which implements deadline-aware input data scheduling; and MURAL (Multi-Resolution Anytime Framework for LiDAR Object Detection), which introduces dynamic resolution scaling. Together, these innovations enable LiDAR-based object detection DNNs to make effective trade-offs between latency and accuracy under varying operational conditions, advancing the practical deployment of LiDAR object detection DNNs.
Rahul Purswani
Finetuning Llama on custom data for QA tasksWhen & Where:
Eaton Hall, Room 2001B
Committee Members:
David Johnson, ChairDrew Davidson
Prasad Kulkarni
Abstract
Fine-tuning large language models (LLMs) for domain-specific use cases, such as question answering, offers valuable insights into how their performance can be tailored to specialized information needs. In this project, we focused on the University of Kansas (KU) as our target domain. We began by scraping structured and unstructured content from official KU webpages, covering a wide array of student-facing topics including campus resources, academic policies, and support services. From this content, we generated a diverse set of question-answer pairs to form a high-quality training dataset. LLaMA 3.2 was then fine-tuned on this dataset to improve its ability to answer KU-specific queries with greater relevance and accuracy. Our evaluation revealed mixed results—while the fine-tuned model outperformed the base model on most domain-specific questions, the original model still had an edge in handling ambiguous or out-of-scope prompts. These findings highlight the strengths and limitations of domain-specific fine-tuning, and provide practical takeaways for customizing LLMs for real-world QA applications.
Rithvij Pasupuleti
A Machine Learning Framework for Identifying Bioinformatics Tools and Database Names in Scientific LiteratureWhen & Where:
LEEP2, Room 2133
Committee Members:
Cuncong Zhong, ChairDongjie Wang
Han Wang
Zijun Yao
Abstract
The absence of a single, comprehensive database or repository cataloging all bioinformatics databases and software creates a significant barrier for researchers aiming to construct computational workflows. These workflows, which often integrate 10–15 specialized tools for tasks such as sequence alignment, variant calling, functional annotation, and data visualization, require researchers to explore diverse scientific literature to identify relevant resources. This process demands substantial expertise to evaluate the suitability of each tool for specific biological analyses, alongside considerable time to understand their applicability, compatibility, and implementation within a cohesive pipeline. The lack of a central, updated source leads to inefficiencies and the risk of using outdated tools, which can affect research quality and reproducibility. Consequently, there is a critical need for an automated, accurate tool to identify bioinformatics databases and software mentions directly from scientific texts, streamlining workflow development and enhancing research productivity.
The bioNerDS system, a prior effort to address this challenge, uses a rule-based named entity recognition (NER) approach, achieving an F1 score of 63% on an evaluation set of 25 articles from BMC Bioinformatics and PLoS Computational Biology. By integrating the same set of features such as context patterns, word characteristics and dictionary matches into a machine learning model, we developed an approach using an XGBoost classifier. This model, carefully tuned to address the extreme class imbalance inherent in NER tasks through synthetic oversampling and refined via systematic hyperparameter optimization to balance precision and recall, excels at capturing complex linguistic patterns and non-linear relationships, ensuring robust generalization. It achieves an F1 score of 82% on the same evaluation set, significantly surpassing the baseline. By combining rule-based precision with machine learning adaptability, this approach enhances accuracy, reduces ambiguities, and provides a robust tool for large-scale bioinformatics resource identification, facilitating efficient workflow construction. Furthermore, this methodology holds potential for extension to other technological domains, enabling similar resource identification in fields like data science, artificial intelligence, or computational engineering.
Vishnu Chowdary Madhavarapu
Automated Weather Classification Using Transfer LearningWhen & Where:
Nichols Hall, Room 246 (Executive Conference Room)
Committee Members:
David Johnson, ChairPrasad Kulkarni
Dongjie Wang
Abstract
This project presents an automated weather classification system utilizing transfer learning with pre-trained convolutional neural networks (CNNs) such as VGG19, InceptionV3, and ResNet50. Designed to classify weather conditions—sunny, cloudy, rainy, and sunrise—from images, the system addresses the challenge of limited labeled data by applying data augmentation techniques like zoom, shear, and flip, expanding the dataset images. By fine-tuning the final layers of pre-trained models, the solution achieves high accuracy while significantly reducing training time. VGG19 was selected as the baseline model for its simplicity, strong feature extraction capabilities, and widespread applicability in transfer learning scenarios. The system was trained using the Adam optimizer and evaluated on key performance metrics including accuracy, precision, recall, and F1 score. To enhance user accessibility, a Flask-based web interface was developed, allowing real-time image uploads and instant weather classification. The results demonstrate that transfer learning, combined with robust data preprocessing and fine-tuning, can produce a lightweight and accurate weather classification tool. This project contributes toward scalable, real-time weather recognition systems that can integrate into IoT applications, smart agriculture, and environmental monitoring.
RokunuzJahan Rudro
Using Machine Learning to Classify Driver Behavior from Psychological Features: An Exploratory StudyWhen & Where:
Eaton Hall, Room 1A
Committee Members:
Sumaiya Shomaji, ChairDavid Johnson
Zijun Yao
Alexandra Kondyli
Abstract
Driver inattention and human error are the primary causes of traffic crashes. However, little is known about the relationship between driver aggressiveness and safety. Although several studies that group drivers into different classes based on their driving performance have been conducted, little has been done to explore how behavioral traits are linked to driver behavior. The study aims to link different driver profiles, assessed through psychological evaluations, with their likelihood of engaging in risky driving behaviors, as measured in a driving simulation experiment. By incorporating psychological factors into machine learning algorithms, our models were able to successfully relate self-reported decision-making and personality characteristics with actual driving actions. Our results hold promise toward refining existing models of driver behavior by understanding the psychological and behavioral characteristics that influence the risk of crashes.
Md Mashfiq Rizvee
Energy Optimization in Multitask Neural Networks through Layer SharingWhen & Where:
Eaton Hall, Room 2001B
Committee Members:
Sumaiya Shomaji, ChairTamzidul Hoque
Han Wang
Abstract
Artificial Intelligence (AI) is being widely used in diverse domains such as industrial automation, traffic control, precision agriculture, and smart cities for major heavy lifting in terms of data analysis and decision making. However, the AI life- cycle is a major source of greenhouse gas (GHG) emission leading to devastating environmental impact. This is due to expensive neural architecture searches, training of countless number of models per day across the world, in-field AI processing of data in billions of edge devices, and advanced security measures across the AI life cycle. Modern applications often involve multitasking, which involves performing a variety of analyzes on the same dataset. These tasks are usually executed on resource-limited edge devices, necessitating AI models that exhibit efficiency across various measures such as power consumption, frame rate, and model size. To address these challenges, we introduce a novel neural network architecture model that incorporates a layer sharing principle to optimize the power usage. We propose a novel neural architecture, Layer Shared Neural Networks that merges multiple similar AI/NN tasks together (with shared layers) towards creating a single AI/NN model with reduced energy requirements and carbon footprint. The experimental findings reveal competitive accuracy and reduced power consumption. The layer shared model significantly reduces power consumption by 50% during training and 59.10% during inference causing as much as an 84.64% and 87.10% decrease in CO2 emissions respectively.
Fairuz Shadmani Shishir
Parameter-Efficient Computational Drug Discovery using Deep LearningWhen & Where:
Eaton Hall, Room 2001B
Committee Members:
Sumaiya Shomaji, ChairTamzidul Hoque
Hongyang Sun
Abstract
The accurate prediction of small molecule binding affinity and toxicity remains a central challenge in drug discovery, with significant implications for reducing development costs, improving candidate prioritization, and enhancing safety profiles. Traditional computational approaches, such as molecular docking and quantitative structure-activity relationship (QSAR) models, often rely on handcrafted features and require extensive domain knowledge, which can limit scalability and generalization to novel chemical scaffolds. Recent advances in language models (LMs), particularly those adapted to chemical representations such as SMILES (Simplified Molecular Input Line Entry System), have opened new ways for learning data-driven molecular representations that capture complex structural and functional properties. However, achieving both high binding affinity and low toxicity through a resource-efficient computational pipeline is inherently difficult due to the multi-objective nature of the task. This study presents a novel dual-paradigm approach to critical challenges in drug discovery: predicting small molecules with high binding affinity and low cardiotoxicity profiles. For binding affinity prediction, we implement a specialized graph neural network (GNN) architecture that operates directly on molecular structures represented as graphs, where atoms serve as nodes and bonds as edges. This topology-aware approach enables the model to capture complex spatial arrangements and electronic interactions critical for protein-ligand binding. For toxicity prediction, we leverage chemical language models (CLMs) fine-tuned with Low-Rank Adaptation (LoRA), allowing efficient adaptation of large pre-trained models to specialized toxicological endpoints while maintaining the generalized chemical knowledge embedded in the base model. Our hybrid methodology demonstrates significant improvements over existing computational approaches, with the GNN component achieving an average area under the ROC curve (AUROC) of 0.92 on three protein targets and the LoRA-adapted CLM reaching (AUROC) of 0.90 with 60% reduction in parameter usage in predicting cardiotoxicity. This work establishes a powerful computational framework that accelerates drug discovery by enabling both higher binding affinity and low toxicity compounds with optimized efficacy and safety profiles.
Soma Pal
Truths about compiler optimization for state-of-the-art (SOTA) C/C++ compilersWhen & Where:
Eaton Hall, Room 2001B
Committee Members:
Prasad Kulkarni, ChairEsam El-Araby
Drew Davidson
Tamzidul Hoque
Jiang Yunfeng
Abstract
Compiler optimizations are critical for performance and have been extensively studied, especially for C/C++ language compilers. Our overall goal in this thesis is to investigate and compare the properties and behavior of optimization passes across multiple contemporary, state-of-the-art (SOTA) C/C++ compilers to understand if they adopt similar optimization implementation and orchestration strategies. Given the maturity of pre-existing knowledge in the field, it seems conceivable that different compiler teams will adopt consistent optimization passes, pipeline and application techniques. However, our preliminary results indicate that such expectation may be misguided. If so, then we will attempt to understand the differences, and study and quantify their impact on the performance of generated code.
In our first work, we study and compare the behavior of profile-guided optimizations (PGO) in two popular SOTA C/C++ compilers, GCC and Clang. This study reveals many interesting, and several counter-intuitive, properties about PGOs in C/C++ compilers. The behavior and benefits of PGOs also vary significantly across our selected compilers. We present our observations, along with plans to further explore these inconsistencies in this report. Likewise, we have also measured noticeable differences in the performance delivered by optimizations across our compilers. We propose to explore and understand these differences in this work. We present further details regarding our proposed directions and planned experiments in this report. We hope that this work will show and suggest opportunities for compilers to learn from each other and motivate researchers to find mechanisms to combine the benefits of multiple compilers to deliver higher overall program performance.
Nyamtulla Shaik
AI Vision to Care: A QuadView of Deep Learning for Detecting Harmful Stimming in AutismWhen & Where:
Eaton Hall, Room 2001B
Committee Members:
Sumaiya Shomaji, ChairBo Luo
Dongjie Wang
Abstract
Stimming refers to repetitive actions or behaviors used to regulate sensory input or express feelings. Children with developmental disorders like autism (ASD) frequently perform stimming. This includes arm flapping, head banging, finger flicking, spinning, etc. This is exhibited by 80-90% of children with Autism, which is seen in 1 among 36 children in the US. Head banging is one of these self-stimulatory habits that can be harmful. If these behaviors are automatically identified and notified using live video monitoring, parents and other caregivers can better watch over and assist children with ASD.
Classifying these actions is important to recognize harmful stimming, so this study focuses on developing a deep learning-based approach for stimming action recognition. We implemented and evaluated four models leveraging three deep learning architectures based on Convolutional Neural Networks (CNNs), Autoencoders, and Vision Transformers. For the first time in this area, we use skeletal joints extracted from video sequences. Previous works relied solely on raw RGB videos, vulnerable to lighting and environmental changes. This research explores Deep Learning based skeletal action recognition and data processing techniques for a small unstructured dataset that consists of 89 home recorded videos collected from publicly available sources like YouTube. Our robust data cleaning and pre-processing techniques helped the integration of skeletal data in stimming action recognition, which performed better than state-of-the-art with a classification accuracy of up to 87%
In addition to using traditional deep learning models like CNNs for action recognition, this study is among the first to apply data-hungry models like Vision Transformers (ViTs) and Autoencoders for stimming action recognition on the dataset. The results prove that using skeletal data reduces the processing time and significantly improves action recognition, promising a real-time approach for video monitoring applications. This research advances the development of automated systems that can assist caregivers in more efficiently tracking stimming activities.
Alexander Rodolfo Lara
Creating a Faradaic Efficiency Graph Dataset Using Machine LearningWhen & Where:
Eaton Hall, Room 2001B
Committee Members:
Zijun Yao, ChairSumaiya Shomaji
Kevin Leonard
Abstract
Just as the internet-of-things leverages machine learning over a vast amount of data produced by an innumerable number of sensors, the Internet of Catalysis program uses similar strategies with catalysis research. One application of the Internet of Catalysis strategy is treating research papers as datapoints, rich with text, figures, and tables. Prior research within the program focused on machine learning models applied strictly over text.
This project is the first step of the program in creating a machine learning model from the images of catalysis research papers. Specifically, this project creates a dataset of faradaic efficiency graphs using transfer learning from pretrained models. The project utilizes FasterRCNN_ResNet50_FPN, LayoutLMv3SequenceClassification, and computer vision techniques to recognize figures, extract all graphs, then classify the faradaic efficiency graphs.
Downstream of this project, researchers will create a graph reading model to integrate with large language models. This could potentially lead to a multimodal model capable of fully learning from images, tables, and texts of catalysis research papers. Such a model could then guide experimentation on reaction conditions, catalysts, and production.
Amin Shojaei
Scalable and Cooperative Multi-Agent Reinforcement Learning for Networked Cyber-Physical Systems: Applications in Smart GridsWhen & Where:
Nichols Hall, Room 246 (Executive Conference Room)
Committee Members:
Morteza Hashemi, ChairAlex Bardas
Prasad Kulkarni
Taejoon Kim
Shawn Keshmiri
Abstract
Significant advances in information and networking technologies have transformed Cyber-Physical Systems (CPS) into networked cyber-physical systems (NCPS). A noteworthy example of such systems is smart grid networks, which include distributed energy resources (DERs), renewable generation, and the widespread adoption of Electric Vehicles (EVs). Such complex NCPS require intelligent and autonomous control solutions. For example, the increasing number of EVs introduces significant sources of demand and user behavior uncertainty that can jeopardize grid stability during peak hours. Traditional model-based demand-supply controls fail to accurately model and capture the complex nature of smart grid systems in the presence of different uncertainties and as the system size grows. To address these challenges, data-driven approaches have emerged as an effective solution for informed decision-making, predictive modeling, and adaptive control to enhance the resiliency of NCPS in uncertain environments.
As a powerful data-driven approach, Multi-Agent Reinforcement Learning (MARL) enables agents to learn and adapt in dynamic and uncertain environments. However, MARL techniques introduce complexities related to communication, coordination, and synchronization among agents. In this PhD research, we investigate autonomous control for smart grid decision networks using MARL. First, we examine the issue of imperfect state information, which frequently arises due to the inherent uncertainties and limitations in observing the system state.
Second, we focus on the cooperative behavior of agents in distributed MARL frameworks, particularly under the central training with decentralized execution (CTDE) paradigm. We provide theoretical results and variance analysis for stochastic and deterministic cooperative MARL algorithms, including Multi-Agent Deep Deterministic Policy Gradient (MADDPG), Multi-Agent Proximal Policy Optimization (MAPPO), and Dueling MAPPO. These analyses highlight how coordinated learning can improve system-wide decision-making in uncertain and dynamic environments like EV networks.
Third, we address the scalability challenge in large-scale NCPS by introducing a hierarchical MARL framework based on a cluster-based architecture. This framework organizes agents into coordinated subgroups, improving scalability while preserving local coordination. We conduct a detailed variance analysis of this approach to demonstrate its effectiveness in reducing communication overhead and learning complexity. This analysis establishes a theoretical foundation for scalable and efficient control in large-scale smart grid applications.
Past Defense Notices
DAIN VERMAAK
Modeling, Visualizing, and Analyzing Student Progress on Learning MapsWhen & Where:
2001 B Eaton Hall
Committee Members:
James Miller, ChairMan Kong
Suzanne Shontz
Guanghui Wang
Bruce Frey
Abstract
A learning map is an unweighted directed graph containing relationships between discrete skills and concepts with edges defining the prerequisite hierarchy. They arose as a means of connecting student instruction directly to standards and curriculum and are designed to assist teachers in lesson planning and evaluating student response. As learning maps gain popularity there is an increasing need for teachers to quickly evaluate which nodes have been mastered by their students. Psychometrics is a field focused on measuring student performance and includes the development of processes used to link a student's response to multiple choice questions directly to their understanding of concepts. This dissertation focuses on developing modeling and visualization capabilities to enable efficient analysis of data pertaining to student understanding generated by psychometric techniques.
Such analysis naturally includes that done by classroom teachers. Visual solutions to this problem clearly indicate the current understanding of a student or classroom in such a way as to make suggestions that can guide future learning. In response to these requirements we present various experimental approaches which augment the original learning map design with targeted visual variables. Particular attention is given to variable selection and their effect on the usability of the resulting graphics.
As well as looking forward, we also consider methods by which data visualization can be used to evaluate and improve existing teaching methods. We present several graphics based on modelling student progression as information flow. These methods rely on conservation of data to increase edge information, reducing the load carried by the nodes and encouraging path comparison.
Finally, we propose a means of combining features of key experimental approaches to design a single graphic capable of meeting both the predictive and validation requirements. We also propose several methods to measure the effectiveness and correctness of the final design.
HAMID MAHMOUDI
Novel Predictive Control Strategies in Power Electronics SystemsWhen & Where:
2001 B Eaton Hall
Committee Members:
Reza Ahmadi, ChairChristopher Allen
Alessandro Salandrino
James Stiles
Shawn Keshmiri
Abstract
This work proposes several advanced predictive switching algorithms and modulation methods for power electronics converters based on model predictive control (MPC) paradigm. The proposed methods retain the advantages of conventional MPC methods in programing the nonlinear effects of the converter into the design calculations to improve the overall dynamic performance and steady state operation of the system. Besides, the proposed methods provide a fixed switching frequency operation of the system, which results in regulating the system objectives with minimized ripple. In the first part of this work, a new modulation based MPC technique is proposed. The proposed method provides flexibility to prioritize different objectives of the system against each other using weighting factors. To further evaluate the merits of the proposed method, it has been used to control modular multilevel converters (MMCs) in voltage-source-converter high-voltage-DC (VSC-HVDC) systems. The proposed method minimizes the line total harmonic distortion (THD), circulating current ripple and steady-state error. Furthermore, a new Finite-Control-Set MPC (FCS-MPC) method for controlling MMCs with minimized computational burden is proposed that doesn’t employ weighting factors to control different system objectives.
Furthermore, a Modulated MPC (MMPC) based control system for a Z-source Inverter (ZSI) based Permanent Magnet Synchronous Motor (PMSM) drive system is proposed. The Proposed method uses two separate MMPC loops for the Z-source network and PMSM control. For the Z-source network, a cascaded MMPC control scheme has been proposed and for the PMSM, a novel MMPC controller is proposed that predicts the future value of PMSM current vectors, selects specific current vectors that minimize a certain cost function the most, and performs modulation between them.
Finally, a torque ripple minimization method for a PMSM drive system that utilizes a modified quasi-Z-source (qZS) inverter which provides a wider range of capabilities for inverter input voltage control is proposed. It also allows for modification of the traditional switching sequence selection scheme when using the Space Vector Modulation (SVM) for switching. The provided flexibilities are leveraged to develop a control system that minimizes the torque ripples during PMSM operation while satisfying conventional control objectives such as shaft speed control.
SALLY SAJADIAN
Model Predictive Control of Impedance Source Inverter for Photovoltaic ApplicationsWhen & Where:
2001B Eaton Hall
Committee Members:
Reza Ahmadi, ChairGlenn Prescott
Alessandro Salandrino
Jim Stiles
Huazhen Fang
Abstract
A model predictive controlled power electronics interface (PEI) based on impedance source inverter for photovoltaic (PV) applications is proposed in this dissertation. The proposed system has the capability of operation in both grid-connected and islanded mode. Firstly, a model predictive based maximum power point tracking (MPPT) method is proposed for PV applications based on single stage grid-connected Z-source inverter (ZSI). This technique predicts the future behavior of the PV side voltage and current using a digital observer that estimates the parameters of the PV module. The proposed method adaptively updates the perturbation size in the PV voltage using the predicted model of the system to reduce oscillations and increase convergence speed. The experimental results demonstrate fast dynamic response to changes in solar irradiance level, small oscillations around maximum power point at steady-state, and high MPPT efficacy.
The second part of this dissertation focuses on the dual-mode operation of the proposed PEI based on ZSI with capability to operate in islanded and grid-connected mode. The transition from islanded to grid-connected mode and vice versa can cause significant deviation in voltage and current due to mismatch in phase, frequency, and amplitude of voltages. The proposed controller using MPC offers seamless transition between the two modes of operations. The proposed direct decoupled active and reactive power control in grid‑connected mode enables the dual-mode ZSI to behave as a power conditioning unit for ancillary services.
The final part of this dissertation focuses on the low voltage ride through (LVRT) capability of the proposed PV systems during grid faults such as voltage sag. In normal grid condition mode, the maximum available power from the PV panels is injected into the grid. In this mode, the system can provide reactive power compensation as a power conditioning unit for ancillary services from DG systems to main ac grid. In case of grid faults, the proposed system changes the behavior of reactive power injection into the grid for LVRT operation according to the grid requirements. Thus, the proposed controller for ZSI is taking into account both the power quality issues and reactive power injection under abnormal grid conditions.
APOORV INGLE
QuB: A Resource Aware Functional Programming LanguageWhen & Where:
2001B Eaton Hall
Committee Members:
Garrett Morris, ChairPerry Alexander
Andy Gill
Prasad Kulkarni
Abstract
Modern programming languages treat resources as normal values. The static semantics of resources in such
languages does not match their runtime semantics. In this thesis, we tackle the resource management problem
by making resources first class citizens in the language, and concentrating on sharing or separation of resources.
We design and implement QuB (pronounced: cube), a Curry-Howard interpretation of logic of bunched implications (BI).
We distinguish two kinds of values—restricted and unrestricted—and two kinds of function implications— sharing and separating.
The restricted values model resources while the unrestricted values model program objects that do not contain any resources.
Sharing functions denote that functions share resources with its arguments, while separating functions denote that functions do not
share resources with its arguments. We show how the use of monads with sharing and separating functions helps in modeling
patterns, such as exception handling, that are difficult to express in linear languages, .
MANJISH ADHIKARI
Basal Conditions of Petermann Glacier and Jakobshavn Isbrae derived from Airborne Ice Penetrating Radar MeasurementsWhen & Where:
317 Nichols Hall
Committee Members:
Carl Leuschen, ChairJilu Li
Christopher Allen
John Paden
Abstract
Understanding ice dynamics and ice basal conditions is important because of their impacts on sea level rise. Radio echo sounding has been extensively used for characterizing the ice sheets. The radar reflectivity of the ice bed is of special importance because it can discriminate frozen and thawed ice beds. The knowledge of spatial distribution of basal water is crucial in explaining the flow velocity and stability of glaciers and ice sheets. Basal echo reflectivity used to identify the areas of basal melting can be calculated by compensating ice bed power for geometric losses, rough interface losses, system losses and englacial attenuation.
Two important outlet glaciers of Greenland, Petermann glacier and Jakobshavn isbrae have been losing a lot of ice mass in recent years, and are therefore studied to derive its basal conditions from airborne radar surveys in this thesis.
The ice surface and bed roughness of these glaciers are estimated using Radar Statistical Reconnaissance (RSR) method, and validated using roughness derived from NASA’s Airborne Topographic Mapper (ATM) and Ku band altimeter. Englacial attenuation is modelled using Schroeder’s variable attenuation method. After compensating for these losses, the basal reflectivity for the two glaciers is estimated, and validated using cross over analysis, geophysics, hydraulic potential, abruptive index and coherence index.
The areas of basal melting i.e. areas with higher reflectivity are identified. Petermann glacier is found to have alternate frozen and thawed regions explaining the process of ice movement by friction and freezing. Due to the lack of topographic pinning the glacier is subject to higher ice flow speed. Jakobshavn glacier has several areas of basal melting scattered in the catchment area with most concentration near the glacier front which is likely due to surface water infiltration into ice beds via moulins and sinks. The ice bed channels and retrograde slope of this glacier is also important in routing subglacial water and ice mass. The basal conditions of these two glaciers presented in this study can help in modelling the behavior of these glaciers in the future.
DIVYA CHALLA
Optimized Synthetic Aperture Radar (SAR) Processing for Airborne UWB FMCW RadarWhen & Where:
317 Nichols Hall
Committee Members:
Carl Leuschen, ChairJohn Paden
James Stiles
Abstract
Remote Sensing of snow covered sea ice in melting Polar Regions has become crucial in estimating the results of increased global warming and to overcome the Earth’s energy imbalance. And to accurately map the snow models over sea ice, it has become essential to build radar systems that has increased sensitivity and to use post processing techniques that enhance the performance. The Center for Remote Sensing of Ice Sheets (CReSIS) at KU has developed ultra-wideband snow radar system that operates over 2-18 GHz frequency range to effectively measure the snow thickness including very thin snow cover and map the snow-ice and snow-ice interfaces precisely. Synthetic Aperture Radar (SAR) processing is one of the post processing technique employed to further increase the sensitivity of the radar in terms of resolution and SNR. In this thesis, a time domain correlation SAR technique which is essentially a matched filter application is described and implemented. It is verified initially with an ideal simulated point target data and then with point target data collected by the snow radar system over sea-ice. It is also shown how noise is multiplied with increasing synthetic aperture length. The effect of aircraft motion non-linearities on SAR processing are also studied at different altitudes. To overcome the effect of non-linearities and multiplicative noise, a multilooking SAR processing is proposed and explained. This is then applied to the field data collected by the snow radar in 2016 and 2017 over sea ice and observed that the SNR and azimuth resolution are improved by 40 dB. The optimum parameters like SAR aperture length and the number of looks are extracted based on the results of SAR processing on various data sets. Finally, a comparison of SAR application to low and high altitude data sets collected in 2016 over the same region is also provided.
GARRETT ZOOK
Applications of FM Noise Radar Waveforms: Spatial Modulation and Polarization DiversityWhen & Where:
246 Nichols Hall
Committee Members:
Shannon Blunt, ChairChristopher Allen
James Stiles
Abstract
Two possible radar application spaces are explored through the exploitation of high-dimensional nonrecurrent FM-noise waveforms. The first involving a simultaneous dual-polarized emission scheme that provides good separability with respect to co- and cross-polarized terms and the second mimicking the passive actuation of the human eye with a MIMO emission. A waveform optimization scheme denoted as pseudo-random optimized (PRO) FM has been shown to generate FM-noise radar waveforms that are amenable to high power transmitters. Each pulse is generated and optimized independently and possesses a non-repeating FM-noise modulation structure. Because of this the range sidelobes of each pulse are unique and thus are effectively suppressed given enough coherent integration.
The PRO-FM waveform generation scheme is used to create two independent sets of FM-noise waveforms to be incorporated into a simultaneous dual-polarized emission; whereby two independent PRO-FM waveforms will be transmitted simultaneously from orthogonal polarization channels. This effectively creates a polarization diverse emission. The random nature of these waveforms also reduce cross-correlation effects that occur during simultaneous transmission on both channels. This formulation is evaluated using experimental open-air measurements to demonstrate the effectiveness of this high-dimensional emission.
This research aims to build upon previous work that has demonstrated the ability to mimic fixational eye movements (FEM) employed by the human eye. To implement FEM on a radar system, a MIMO capable digital array must be utilized in conjunction with spatial modulation beamforming. Successful imitation of FEM will require randomized fast-time beamsteering from a two-dimensional array. The inherent randomness associated with FEM will be paired with the PRO-FM waveforms to create an emission possessing randomness in the space and frequency domains, called the FEM radar (FEMR). Unlike traditional MIMO, FEMR emits a coherent and time-varying beam. Simulations will show the inherent enhancement to spatial resolution in two-dimensional space (azimuth and elevation) relative to standard beamforming using only the matched filter to process returns.
SAI SANDEEP BHOOSHI
MANET Routing Protocol Simulations Using Different Mobility ModelsWhen & Where:
246 Nichols Hall
Committee Members:
James Sterbenz , ChairVictor Frost
Fengjun Li
Abstract
Mobile Ad-hoc Networks (MANETs) due to their highly dynamic nature pose a great challenge in designing new protocols. Because these networks are infrastructure independent, routing protocol design and efficiency becomes essential in the functioning of these networks. There are many protocols proposed in the past and many are under development now. But the new or existing protocols are to be compared against each other and analyzed under realistic conditions including, but not limited to transmission range, mobility patterns, of the nodes in the network. This project is an endeavor to provide an unbiased comparison of AODV, DSDV, DSR, and OLSR under different mobility models with varying densities and dynamicity. The mobility models compared in this work include steady-state random waypoint, Gauss-Markov, and Levy walk.
RENISH THOMAS
Design and development of Ultra wide-band Microwave Components for snow–probing radarsWhen & Where:
317 Nichols Hall
Committee Members:
Carl Leuschen, ChairFernando Rodriguez-Morales
Rongqing Hui
Abstract
This thesis describes the design and development of two different ultra-wideband circuits for snow-probing radars. First, a broadband, low-loss planar quadrature hybrid coupler for the 2-20 GHz range is presented. The coupler offers better performance than commercially available options in terms of phase/amplitude imbalance and form factor. Next, a broadband, high-power T/R module with fast switching and integrated LNA is demonstrated to enable high altitude and multi-channel modes of operations of the CReSIS airborne snow radar along with automated surface tracking ability. The modules include a custom medium-power switch with an overall order of magnitude performance increase compared to commercially available duplexers/SPDT switch solutions.
Pulse mode operations at peak power levels exceeding 100 Watts
(conservatively) can be supported with these devices and a demonstrated switching speed of less than 600 ns.
LUMUMBA HARNETT
Post Pulse Compression & Partially Adaptive Multi-Waveform Space-Time Adaptive Processing for Heterogeneous ClutterWhen & Where:
246 Nichols Hall
Committee Members:
Shannon Blunt, ChairChristopher Allen
James Stiles
Abstract
A new form of multi-waveform space-time adaptive processing (MuW-STAP) is presented. The formulation provides additional training data for adaptive clutter cancellation for ground moving target indication after pulse compression. The pulse compression response is homogenized using stochastic phase filters to produce a smeared response that approximates identically distribution assumed by covariance estimation. Post pulse compression MuW-STAP (PMuW-STAP) is proposed to address clutter heterogeneity that causes degradation in detection performance of STAP similar to single-input multi-output MuW-STAP. Furthermore, the family of MuW-STAP algorithms are computationally expensive due to estimation of multiple covariance matrices and inversion of a single covariance for every range sample. Well-known partially adaptive techniques, previously implemented in STAP, are implemented with PMuW-STAP. Partial adaptation in element-space post-Doppler, beam-space pre-Doppler, and beam-space post-Doppler are presented. Each of these are examined on several simulated, controlled clutter scenarios. Fully adaptive PMuW-STAP is further evaluated on the high-fidelity knowledge aided adaptive radar architecture: knowledge-aided sensor signal processing and expert reasoning (KASSPER) dataset.