Previous Quarters

Previous final examination defense schedule

An archive of some previous School of STEM master’s degree thesis/projects.

Select a master’s program to navigate to candidates:

Master of Science in Computer Science & Software Engineering

SUMMER 2023

Monday, July 24

SREJA BABU

Chair: Dr. Min Chen
Candidate: Master of Science in Computer Science & Software Engineering
11:00 A.M.; Join Sreja Babu’s online defense
Project: Gardening Mobile Application Powered by Machine Learning and Artificial Intelligence Technologies

There are many research studies that show that gardening is a helpful hobby to improve physical and mental health in human beings. However, it is a well-known fact that gardening itself requires a lot of time, effort, and knowledge to be successful. While most of the information needed to be good at gardening is spread across various plant resources online, it needs a lot of effort from the gardeners to gather all in one place for the plants of their interest.

In this study, we researched different models and features to identify a combination of a model and features that provide higher accuracy in plant species identification, thereby offloading some of the human hard work to automation and technology, resulting in green gardens and happy people. We built a plant database cross-platform application based on image identification research and Generative Pretrained Transformer (GPT). The application allows users to identify plant species using digital image processing and machine learning techniques and to automatically add the plants into a “Virtual Garden.” For the plant recognition aspect, we are able to identify the plant species with an accuracy of 91.6%, using the Support Vector Machine (SVM) model. The SVM model plugs directly into our backend REST server. The key advantage of our backend implementation is the possibility to swap our current classifier model with an improved model at any time, therefore, keeping the option to improve our accuracy with support to more plants. Currently, our application is capable of identifying 32 different plant species.

Once the user adds plants to the Virtual Garden, our application will be able to fetch detailed information about each plant from the plant database that we built. This information comes from our automatically populated plant database built on top of Generative Pre-trained Transformer, Large Language Models (LLM). The GPT-3.5-Turbo LLM has been integrated with our backend application. We have a continuous process (DB populator) that updates our internal plant database continuously. The DB populator, research on models and features, and the questionnaire prompt set are the key contributions in our research. The DB populator uniquely enables our plant database to scale for new plants and species when more data becomes available later. We leverage the fine granular pruned gardening information with the help of GPTs to notify users when to water or replenish the soil and other useful information. These notifications will offload a lot of planning that a gardener typically has to perform and convert them to a set of simple instructions to follow easily.

The uniqueness of our application when compared to other applications is that it leverages the GPT LLM models to automate the process of information gathering as opposed to relying heavily on user contributions, and plant experts like the existing applications. Based on our research, our application uses an SVM model with a unique set of features that has a higher accuracy than the rest of the other feature sets used. The results from the usability study proved that this application reduced a significant amount of work and time taken to gather all the information. It also provided crisp information as opposed to the information gathered manually. For future work, we intend to add more social features and also measure the impact of the longevity of sticking with gardening with the app as compared to without using it. Overall, this application serves as a very useful tool that facilitates an enjoyable gardening experience for gardeners.

Thursday, July 27

KANIKA SARASWAT

Chair: Dr. William Erdly
Candidate: Master of Science in Computer Science & Software Engineering
11:00 A.M.; Discovery Hall Room 464
Project: Quickcheck Application for Mobile Platforms: Architectural and Release Planning

According to the Visual Health Initiative (VHI) of the Centers for Disease Control (CDC), 6.8% of children under the age of 18 have been diagnosed with visual impairment. It is estimated that 60% of children with learning disability actually have undiagnosed vision problems and 80% of learning is visual. It is crucial to identify and diagnose any potential vision impairments and eye illnesses as early as possible since they cannot self-report their vision impairment. When children struggle with visual tasks, they may not be able associate their difficulty with an issue with their eyes. Adults generally exacerbate the issue by misconstruing the symptom as a learning disability. A quick examination termed a vision screening, commonly known as an eye test, searches for suspected vision issues and eye conditions.

QuickCheck is a mobile application that enables school nurses to diagnose students for suspected vision health concerns. It is not intended to replace an eye exam, but rather to provide the students with a “quick” check-up so that potential patients can be referred to professionals, so that children who show signs of vision issues can have the necessary eye exams.

The application underwent comprehensive testing using specialized tools, including UI automation tools and load testing tools such as Apache JMeter. This rigorous testing process facilitated an in-depth evaluation of the app’s performance, user interface, and responsiveness, ensuring its reliability and efficiency in various usage scenarios. Based on a series of rigorous test runs using these criteria, it was determined that the application has reached a state of readiness suitable for initial launch so that we may proceed with clinical testing.

Friday, July 28

MARY EYVAZI

Chair: Dr. Min Chen
Candidate: Master of Science in Computer Science & Software Engineering
3:30 P.M.; Join Mary Eyvazi’s online defense
Project: Efficient Receipt Understanding Using Model Compression Techniques For a Cost-Sharing Application

In today’s fast-paced and interconnected business world, managing expenses and processing receipts efficiently is a pressing concern, not only for organizations but also for individuals navigating personal and shared expense systems. The traditional manual approach to receipt processing is laborious and error-prone, resulting in inefficiencies and potential financial discrepancies that can adversely affect both individuals and businesses alike.

This project seeks to address these challenges by focusing on the development of a cost-effective solution to automate receipt processing, with a specific emphasis on cost-sharing systems. We also shed light on the complexities associated with managing shared expenses and identify the limitations of existing deep learning models, particularly concerning their high computational and storage demands.

To overcome these obstacles, we propose the utilization of two model compression techniques: knowledge distillation and model quantization. By leveraging these cutting-edge methods, we aim to significantly reduce the size and computational requirements of visual document models utilized in receipt processing. Through rigorous evaluation, we assess the effectiveness of these techniques, ensuring that the resulting solution maintains exceptional accuracy and performance standards.

To demonstrate the practicality and efficiency of our proposed solution, we develop a cost-sharing application that showcases its seamless integration into real-world scenarios. Our ultimate objective is to democratize receipt processing by providing a more accessible and affordable solution for end-users, empowering both individuals and organizations to streamline expense management processes and make informed financial decisions with confidence. With this project, we aspire to foster greater financial transparency and alleviate the burden of manual receipt processing, thus enabling individuals and businesses to thrive in today’s dynamic economic landscape.

Thursday, August 3

CHRISTIAN ROLPH

Chair: Dr. Geethapriya Thamilarasu
Candidate: Master of Science in Computer Science & Software Engineering
1:15 P.M.; Join Christian Rolph’s online defense
Project: Semaphore: Mobile Application for the Hearing-Impaired Using Peer-To-Peer Connections in an Ad Hoc Network

Few mobile applications exist for the deaf and hearing impaired to be able to communicate, and those that do exist typically rely on the Internet to be able to function. This creates a problem for the deaf community when they want to use their app in a location that has poor or no Internet service. This capstone project aims to develop a mobile application for the deaf that can be used without the Internet. The proposed solution uses Bluetooth Low Energy (BLE) for the underlying network protocol to allow direct peer-to-peer message passing. The CoreBluetoth framework, provided by Apple, serves as the primary interface between the application and BLE functionality. The project builds on this protocol to create an ad hoc mesh network, allowing peers that are not directly within Bluetooth range of one another to communicate. The implementation uses the iOS operating system and a mobile platform to be easily usable for most users using their smartphone. It allows for real-time translation of speech to text, and two-way communication between a network of connected users.

The application was tested in several key areas including transcription accuracy, scalability, usability, and resource efficiency. Transcription testing primarily focused on ensuring that the speech-to-text functionality of the application was of a high enough quality to support everyday conversation. The application takes a heavy dependence on the voice-to-text APIs provided by the iOS operating system that operate on-device, which generally performed very well. Scalability testing focused on how well the application could handle multiple users in a single chatroom, and how many chatrooms could be created simultaneously without interfering with one another. Usability testing was conducting using a beta test with real users and asking them to evaluate their experience on a feedback form. Finally, resource efficiency testing focused on evaluating the application’s impact on battery life compared to that of other popular apps.

Overall, this project met its goal to provide a usable offline communication mechanism for the deaf community. It demonstrates that BLE is a reasonable choice as an underlying network protocol for this purpose. This project’s ad hoc network demonstrates potential for applications in other areas including disaster relief, military applications, and Internet of Things devices. Future research and work can build on this project to expand the use of Bluetooth to create such networks.

Monday, August 7

ZUODONG WANG

Chair: Dr. Yang Peng
Candidate: Master of Science in Computer Science & Software Engineering
1:15 P.M.; Join Zuodong Wang’s online defense
Project: Multiple Vehicle Task Scheduling for Vehicle Based On-Demand Mobile Edge Server

The rapid growth of mobile devices and the increasing demand for real-time data processing have led to the emergence of mobile edge computing (MEC) as a promising solution to address the limitations of traditional cloud computing. MEC leverages the proximity of edge servers to mobile users to provide low-latency and high-bandwidth services. In this context, the efficient dispatch and scheduling of vehicle-based, on-demand mobile edge servers (VOMES) have gained significant attention. This report proposes a vehicle movement and task allocation approach for VOMES.

The objective is to maximize the total operating profit while considering the operational costs and mobility constraints of the VOMES. To achieve this, we develop a mixed-integer linear programming (MILP) formulation that considers various parameters, including the computational capacity of the VOMES, the processing requirements of the tasks, the vehicle mobility patterns, and the operational costs. By formulating the problem as an MILP, we enable the use of optimization techniques to find the optimal task allocation and scheduling solution. To handle the dynamic nature of the VOMES environment, we propose two approaches. In the first approach, an initial schedule is generated based on the current knowledge of the tasks and the VOMES locations. In the second approach, the schedule is updated periodically to adapt to the changes in task arrivals and VOMES availability. To facilitate dynamic scheduling, we employ a heuristic algorithm that considers the task needed capacity, VOMES mobility patterns, and the proximity of the VOMES to the task locations.

The proposed approach has been evaluated through extensive simulations using realistic mobility and operation constraints. The results demonstrate that the proposed approach achieves significant improvements in terms of operation profit compared to baseline scheduling strategies.

Wednesday, August 9

RAMI H ABED

Chair: Dr. William Erdly
Candidate: Master of Science in Computer Science & Software Engineering
3:30 P.M.; Join Rami Abed’s online defense
Project: Skurupuru – A Secure, Mobile-First Schoolpooling App

Traffic congestion is wasteful of time and emissions. Around schools, it creates hazards to students and staff and it clogs arterials for other commuters during drop-off and pick-up times. In response to this problem, the city of Bellevue developed a TDM program called SchoolPool. However, Bellevue’s Districtwide Travel Survey reveals that the same proportion of people carpooled in 2022 as did in 2017 – 11%. This despite 42% of parents expressing interest in carpooling in another 2017 survey. While considering various approaches to increasing carpooling over the years, Bellevue schools still lack a viable technical solution to address the problem.

We develop「スクールプール」- Skurupuru – a secure, mobile-first, featureful, and brandable cross-platform app built on a Firebase backend. Skurupuru primarily aims to facilitate carpooling to and from schools. Skurupuru is designed in response to requirements elicited from city of Bellevue staff, incorporates stakeholder input from school staff and parents, addresses limits in previous technical solutions, and is mindful of findings in carpooling and schoolpooling studies.

Friday, August 11

REMYA MAVILA KIZHAKKEVEETTIL

Chair: Dr. Dong Si
Candidate: Master of Science in Computer Science & Software Engineering
8:45 A.M.; Join Remya Mavalia Kizhakkeveettil’s online defense
Project: Icare – A Virtual Assistant for Mental Health Powered by AI

This presentation describes the design and implementation of a virtual assistant to support mental health, using artificial intelligence and machine learning. Currently, mental health related issues are increasing among individuals because of various reasons. Sharing their feelings with someone who cares about them plays a major role in resolving these issues. Virtual assistants that can simulate human conversations using artificial intelligence can be very effectively used to communicate with individuals facing challenges. iCare is an application integrated with a virtual assistant or chatbot intended to provide support for individuals suffering from mental-health-related issues. The iCare virtual assistant provides a safe, private, virtual environment for users to share their feelings, and get empathetic response that improves their mental condition. The virtual assistant relies on machine learning algorithms to formulate the response for users. The bot understands the user’s query and triggers an accurate response as text or speech with the help of natural language processing. iCare implements a different approach from current solutions, by using a combination of multiple techniques to provide accurate responses to its users. The project is designed to provide support for a range of users like those who are suffering from anxiety, depression, individuals who are unhappy and need some help to improve their present feeling.

HARLEEN KAUR BHAMRAH

Chair: Dr. David Socha
Candidate: Master of Science in Computer Science & Software Engineering
1:15 P.M.; Join Harleen Kaur Bhamrah’s online defense
Project: Data Modeler: UWB Web Based Learning Tool for Database Modeling

Object-Role Modeling (ORM) serves as a robust technique for teaching and implementing database and object-oriented design. Its visual representation of real-world entities and emphasis on semantics make it a valuable resource for students and professionals seeking to grasp database design concepts swiftly. Similarly, Logical Data Modeling (LDM) is widely embraced for its ease of learning and adaptability to changes, as it is supported by numerous modeling tools and frameworks. However, many available modeling tools lack comprehensive support for ORM, and Microsoft VisioModeler is incompatible with new operating systems. To address this limitation, the project’s focus is on developing a web-based application that supports ORM, LDM, and SQL conversion and generation, following software engineering principles, enhancing features, and conducting comparative analysis. The main goal is to implement essential features for building ORM models in the initial phase of the database modeling process, while also diligently examining the system to address bugs and non-functional aspects effectively. Additionally, we will prioritize clean code practices, Test-Driven Development (TDD), logging, exploring and implementing exception handling enhancements. The project also emphasizes the learnings and decisions made throughout the tasks.

APURVA SHARMA

Chair: Dr. David Socha
Candidate: Master of Science in Computer Science & Software Engineering
3:30 P.M.; Join Apurva Sharma’s online defense
Project: Data Modelling Tool: A Tool to Create Database Models and their Automatic Conversion

The tool primarily focuses on ORM (Object Role Modeling) and LDM (Logical Data Model) techniques. It offers students a practical and visual approach to explore various modeling concepts, create ORM models, convert them to LDM representations, and generate SQL scripts. The tool bridges the gap between theoretical concepts and real-world applications, providing students with hands-on experience and a deeper understanding of database designing principles. Developed as an initiative by Professor Mark Kochanski, the “”Data Modeling Tool”” offers an interactive and visual learning environment for students, facilitating their understanding, application, and exploration of various modeling techniques. Project is inspired by VisioModeler 3.1 which supported ORM modeling comprehensively but is no longer available to use.

This paper presents the development of features and functionalities of the tool with implementation of new architectural design to enhance the forward and reverse engineering of ORM, LDM and SQL models.

SPRING 2023

Tuesday, May 2

AMITA RAJPUT

Chair: Dr. Hazeline Asuncion
Candidate: Master of Science in Computer Science & Software Engineering
8:45 A.M.; Online
Project: Checking Security Design Patterns In Source Code

A big challenge for software developers, engineers, and programmers is that the software they write may be subject to attacks by hostile actors. One way to address this problem is to use Security Design Patterns (SDP), but many software engineers are unaware of these patterns or do not have the proper understanding of them. Currently, our research group has been working on finding existing SDPs in source code, to help software engineers determine if they are missing any SDPs. My project builds on this by not only finding additional SDPs in source code but also checking whether they are correctly implemented. During these studies, I will deep dive and find the bigger issue of whether software developers are unaware of the SDPs or they know about them but wrongly implement them. An improvement in this area of research will be helpful for programmers to identify errors in both existing and new programs quickly and fix the vulnerabilities faster and more efficiently. Hundreds of thousands of software engineers and programmers working at big tech companies such as Norton, Microsoft, Oracle, and Adobe, and writing thousands of lines of source codes every day will be highly benefited from my research. An automated process will help them save hundreds of their man hours every week and put them into more value-adding tasks. It brings higher productivity and efficiency to the organizations and also ensures a more robust firewall against outside attacks on the organization’s proprietary data. This helps to safely keep the users’ private data which eventually helps the organizations retain their credibility and market share among their customers.

Tuesday, May 16

YIFEI YANG

Chair: Dr. Munehiro Fukuda
Candidate: Master of Science in Computer Science & Software Engineering
8:45 A.M.; Online
Project: Agents Visualization and Web GUI Development in MASS Java

Multi-Agent Spatial Simulation (MASS) is an agent-based modeling (ABM) library that supports parallelized simulation over a distributed computing cluster. Places is a multi-dimensional array of elements, each called Place, which are dynamically allocated within the cluster. Agents is a set of execution instances that can reside on a Place and migrate to any other Place with global indices. MASS UI consists of two parts: InMASS and MASS-Cytoscape. InMASS allows users to execute commands line by line in an interactive way and provides users with additional features. MASS-Cytoscape enables users to visualize Places and Agents in Cytoscape. However, the current implementation of InMASS hacked MASS too much and became incompatible with the latest versions of MASS. The current visualization is limited to a single computing node and to agent existence. Moreover, the recent MASS does not have a web interface to simplify operations. To address these problems, the goals of this project are: (1) re-engineering the current implementation of InMASS; (2) developing place visualization of 2D continuous space, Binary Tree, and Quad Tree. Improve current Agent visualization; and (3) designing an all-in-one WEB GUI for InMASS design. We adopted the existing features to accomplish the first goal, re-implemented InMASS features, including dynamical loading, checkpointing/rollback, and agent history tracking; and optimized the current codebase. These modifications open the possibility of the future expansion of InMASS and allow InMASS to serve all MASS users. The project extended the current Places and Agents visualization for distributed settings and more descriptive Agents information, optimized the operation logic of MASS control panel. These additions and optimizations made it easy to use and analyze simulations. The implementation of the web interface enables users to monitor their clusters. And it provides a basic frame for future developers to add on more practical functions.

POOJA PAL

Chair: Mark Kochanski
Candidate: Master of Science in Computer Science & Software Engineering
11:00 A.M.; Online
Project: Enhancements in Teaching Tools: An Application to Simplify the Complexities in Course Management

Canvas is a web-based learning management system, or LMS, that allows institutions to manage digital learning, educators to create and present online learning materials and assess student learning, and students to engage in courses and receive feedback about skill development and learning achievement. Canvas features specifically designed to meet a variety of institutional, educational, and learning needs. However, Canvas can be improved with new features to increase the productivity of instructors and students using the system. This capstone project is part of a team effort developing a browser-based full stack application that supports new features by following software engineering principles, performing feature enhancements, and comparative analysis. The project’s focus is to build several independent features in the Teaching Tools application as a first step towards making it as a component to be embedded within Canvas to have a great digital learning experience at the University of Washington – Bothell along with practicing software engineering principles to ensure efficient system design and user experience.

Thursday, May 18

BRANDON VASSION

Chair: Dr. Kelvin Sung
Candidate: Master of Science in Computer Science & Software Engineering
1:15 P.M.; Online
Thesis: Investigating Constrained Objects in AR for Validation of Real-life Models

Augmented Reality (AR) studies the approaches that enhance reality by integrating virtual content into the physical environment in real-time. In the simplest form, virtual objects in the physical environment are stationary, where AR applications serve as powerful tools for visualization. The support of interaction with objects in the environment brings the AR application from being passive for observing the augmented world to one where the user can actively explore. When the interactions follow intuitive physical world constraints, an AR application, or constraint-based AR, can immerse users in a realistic augmented world.

We categorize existing constraint-based AR by the relationship between and interaction of the objects being constrained: virtual objects constrained by virtual objects, physical by virtual, and virtual by physical. This straightforward classification provides insights into the types of and potentials for useful applications. For example, virtual by virtual can describe the pages of a virtual book being constrained where the corresponding interaction would be the flipping of the virtual pages. In contrast, physical by virtual would mean placing a physical coffee cup over the virtual book. Lastly, virtual by physical would be placing and pushing the virtual book on an actual physical desktop. The subtle and yet crucial differences are that in the first case, the objects and the interactions can also be carried out in a pure virtual 3D world, physical by virtual has practical implementation challenges, and that, virtual by physical presents an interesting opportunity for immersing and engaging users.

This project investigates using virtual by physical constraint-based AR to validate the functionality and visuals of real-life models. We observe and identify common and representative real-world interaction constraints to include: 1D sliding, 2D planar sliding, hinged rotation, and the potential for combining these constraints. The project examines the functionality, interactability, and integration of these constraints in practical applications, in this case, a home decoration setting. With the results from an initial technology investigation, aiming to achieve accuracy and reliability in interactions, we have chosen marker-based AR through Vuforia with Unity3D. We have derived a systematic workflow for creation and have demonstrated successful integration of virtual objects into the real world with relevant constraints by corresponding physical objects. Our prototype results are various versions of an augmented room with distinct decorative virtual objects that are constrained by relevant physical objects where the interactions are intuitive and integrations essentially seamless. These rooms support multiple constrained objects functioning in the same environment.

Our categorization points to a well-defined AR application domain, virtual by physical, for investigation. The success of the augmented rooms demonstrates the usefulness of this category of constraint-based AR applications in validating functionality and visuals. Lastly and significantly, our formulated workflow for constructing virtual by physical constraint-based AR applications serves as an efficient and effective template for future investigations into this domain.

Monday, May 22

IRENE LALIN WACHIRAWUTTHICHAI

Chair: Dr. David Socha
Candidate: Master of Science in Computer Science & Software Engineering
11:00 A.M.; Online
Project: Multi-Stream, Multi-Modal Dataset Viewer That Supports the Navigational Work of Wide-Field Ethnography Research

Wide-Field Ethnography (WFE) refers to an approach of gathering and analyzing large datasets of videos, audio files, screen capture, photos, and other artifacts related to the intricate intermingling of human subjects with computer systems and the social relationship and collaborations among these entities. WFE datasets are high in volume, containing multiple types of data and multiple data sources capturing the same events or moments of interest. For instance, the BeamCoffer datasets has 6 terabytes of video and audio recordings of software developers at work, videos of their computer screens, and thousands of photographs. The sheer volume of data gathered and its modal diversity make it hard to navigate the dataset to find the moments that are meaningful to the research question, especially if one wants to simultaneously play more than one video or audio file to concurrently see and hear different perspectives of the action unfolding at a particular moment of time. There are currently no tools that offer a reasonable way to navigate a WFE dataset. This project describes a software system built to help researchers navigate through large multi-stream, multi-modal datasets effectively and efficiently: the WFE Navigator.

KOROSH MOOSAVI

Chair: Dr. Afra Mashhadi
Candidate: Master of Science in Computer Science & Software Engineering
1:15 P.M.; Online
Project: Domain-Specific NLP Recommendation System for Live Chat

Twitch.tv is one of the oldest and most popular livestreaming platforms in use today, where a unique culture of emote usage and niche language has developed. Emotes are custom-made images, or GIFs, used in chat with varying degrees of access. Emotes render standard forms of English NLP ineffective, even when using models trained on data from social media posts including traditional emoji. The largest prior study created a Word2Vec model of the 100 most popular emotes across Twitch for sentiment analysis. This project branches from this work by creating a chat recommender system with a model trained on more recent data. The system finds similar emotes in a new channel for users based on their available emotes, allowing for easier onboarding and moderation in the chat. Users are recommended new channels based on the usage of emotes in a channel they are already familiar with.

Tuesday, May 23

SAHANA PANDURANGI RAGHAVENDRA

Chair: Dr. Munehiro Fukuda
Candidate: Master of Science in Computer Science & Software Engineering
8:45 A.M.; Online
Project: Agent-Based GIS Queries

A Geographical Information System (GIS) is a vital software tool used across numerous domains to help store, manage, analyze, and visualize geospatial data. One of the core functions of the GIS is its ability to query, enabling scientists and researchers to analyze and discover underlying patterns and associations among various data layers. However, it is extremely time and computationally intensive to process complex spatial GIS queries on a single standalone system sequentially. Therefore, in this capstone project we parallelize GIS queries using an agent-based parallelization framework, Multi-Agent Spatial Simulation (MASS), and further explore the idea of incorporating computational geometry algorithms such as closest pair of points, range search and minimum spanning tree to GIS queries using agent propagation.

The major motivation behind integrating MASS library and GIS queries stems from the results of previous research in comparing MASS with other popular big data streaming tools. This research observed that agent-based computation using MASS yielded competitive performance and intuitive parallelization when introduced into data structures such as graphs. To verify this hypothesis of agent’s superiority, we now would like to utilize MASS Agents in GIS queries where agents utilize computational geometry problems to find results of GIS queries through propagation over MASS Places spread across different computing nodes.

The significant contributions of this capstone project are to demonstrate GIS queries as a practical application of agent-based data analysis. Further, this project focuses on migrating the previous implementation of MASS-GIS system from Amazon Web Services (AWS) to the University of Washington Bothell computational clusters consisting of 24 computing nodes to achieve scalability and fine-grained partitioning of the GIS datasets suitable for agent-based parallel GIS queries. Sequential and parallel, attribute and spatial GIS queries are designed and implemented in this project using contextual query language (CQL) modules from GeoTools (open-source GIS package) and MASS. Additionally, we also extend and integrate the previous research on computational geometry algorithms using MASS to GIS queries. Algorithms such as the closest pair of points are incorporated into GIS queries to find the closest cities within a certain distance from a given city. Likewise range search is used to find all the cities in a given country given the range of geographical bounds of a country and minimum spanning tree is extended to find the shortest path between two points on a map. Lastly, we evaluate the performance of parallel agent-based GIS queries implemented using MASS. The results show that agent-based GIS queries using MASS-CQL and the closest pair of points algorithm are time efficient. Furthermore, MASS based GIS queries using computational geometry algorithms of the closest pair of points and range search provide 100% accuracy. However better optimization techniques need to be applied to improve the performance of agent-based GIS queries using the range search algorithm.

JASKIRAT KAUR

Chair: Dr. Hazeline Asuncion
Candidate: Master of Science in Computer Science & Software Engineering
11:00 A.M.; Online
Project: Improving the Accuracy of Mapping Vulnerabilities to Security Design Patterns

The increasing incidence of software vulnerabilities poses a significant threat to businesses and individuals worldwide. According to a threat report by Nuspire, 2022 was a record-breaking year for cyber threats, thus making mitigating vulnerabilities even more important. Identifying and mitigating vulnerabilities is challenging due to their complexity and the varied and increasing number of potential security threats that threaten the integrity of the software. Many researchers have proposed methods to identify vulnerabilities. Seyed Mohammad Ghaffarian and Hamid Reza Shahriari used data mining and machine learning techniques to discover vulnerabilities in their paper Software Vulnerability Analysis and Discovery Using Machine-Learning and Data-Mining Techniques: A Survey. Similar to their work, a substantial amount of work has been done on discovering vulnerabilities and doing analysis on them but not much has been done to predict security patterns to mitigate vulnerabilities.

To discover security design patterns for security vulnerabilities, Sayali Kudale developed a project for predicting security patterns by using keyword extraction and text similarity techniques. This capstone study extends her work. It proposes techniques and measures different similarity metrics, to improve precision by extending the Common Weakness Enumeration (CWE) dataset by including the Top Ten standards of the Open Worldwide Application Security Project (OWASP) data in each CWE vulnerability description. We have also manually verified the ground truth data using the mitigations described by LeBlanc et al. in the book “24 deadly sins of software security”. To draw comparisons we worked on 4 datasets: 1. The security design document; 2. The Common Weakness Enumeration (CWE) vulnerabilities; 3. The extended dataset includes both CWE and OWASP data; and 4. Ground truth data.

To implement this we have executed the keyword extraction technique, Rapid Automatic Keyword Extraction (RAKE) using which we extracted keywords from the security pattern and CWE description and mapped them to each other. After this, different similarity measures have been applied to calculate the similarity metrics of the mapping. We then used the ones that gave the best results and tested them again on the two datasets to compare precision. The evaluation results indicated that the extended dataset gave better precision and accuracy.

CONNOR BENJAMIN BROWNE

Chair: Dr. Erika Parsons
Candidate: Master of Science in Computer Science & Software Engineering
1:15 P.M.; Discovery Hall 464
Thesis: Evaluating the Effectiveness of Preprocessing Methods on Motor Imagery Classification Accuracy in EEG Data

Classification of motor imagery tasks is of significant interest in brain-computer interfacing today. Electroencephalograph data contains a large amount of noise obfuscating the signal associated with these motor imagery tasks. Various preprocessing techniques exist to increase the signal-to-noise ratio allowing for more accurate classifications. The effectiveness of these techniques varies between motor imagery tasks and in different environments. There is a need to evaluate these different techniques in many different environments and with different motor imagery tasks. This thesis investigates the effectiveness of several preprocessing techniques and classification models for classifying four different motor imagery tasks from EEG data. Specifically, Frequency Filtering, ICA, and CSP are evaluated using Naive Bayes, kNN, Linear SVM, RBF SVM, LDA, Random Forest, and a MLP Neural Network.

To control for the environment data was collected from student volunteers in short sessions designed to demonstrate either eye blinking, eye rolling, jaw clenching, or neck turning. Each task had its own procedure for the session. Motor imagery tasks in data were evaluated for frequency and amplitude commonalities using continuous wavelet transforms and Fourier transforms. Preprocessing Techniques were then iteratively applied to these datasets and evaluated using an ML model. The evaluation metrics used were Accuracy, F1, Precision, and Recall.

Results showed that the combination of Frequency Filtering, ICA, and CSP with the Naive Bayes model yielded the highest accuracy and F1 for all motor imagery tasks. These findings contribute to the field of EEG signal processing and could have potential applications in the development of brain-computer interfaces. It also directly contributes to a greater project in spatial neglect rehabilitation by providing novel insights to common artifacts in EEG data, as well as to the creation of a framework for data processing in real-time and offline.

Wednesday, May 24

ANIRUDH POTTURI

Chair: Dr. Munehiro Fukuda
Candidate: Master of Science in Computer Science & Software Engineering
11:00 A.M.; Discovery Hall 464
Project: Programmability and Performance Analysis of Distributed and Agent-Based Frameworks

In big data, the importance shifts from raw text presentation of data to structure and space of the data. Computational geometry is an area of interest, particularly for the structure and distribution of data. Thus, we propose using Agent-Based Modelling (ABM) libraries for big data to leverage the benefits of parallelization and support the creation of complex data structures like graphs and trees. ABMs offer a unique and intuitive approach to solving problems by simulating the structural elements over an environment and using agents to break these problems down using swarming, propagation, collisions, and more. For this research, we introduce using Multi-agent Spatial Simulations (MASS) for big data. We compare the programmability and performance of MASS Java against Hadoop MapReduce and Apache Spark. We have chosen six different applications in computational geometry implemented using all three frameworks. We have conducted a formal analysis of the applications through a comprehensive set of tests. We have developed tools to perform code analysis to compute metrics like identifying the number of Lines of Code (LoC) and computing McCabe’s cyclomatic complexity to analyze the programmability. From a quantitative perspective, in most cases, we found that MASS demanded less coding than MapReduce, while Spark required the least. While the cyclomatic complexity of MASS applications was higher in some cases, components of Spark and MapReduce applications were highly cohesive. From a qualitative viewpoint, MASS applications required fine-tuning resulting in significant improvements, while MapReduce and Spark offered very limited performance enhancement options. The performance of MASS directly correlates with the data, unlike MapReduce and Spark, whose performance is not affected by the distribution of data.

BALAJI RAM MOHAN CHALLAMALLA

Chair: Dr. Brent Lagesse
Candidate: Master of Science in Computer Science & Software Engineering
1:15 P.M.; Online
Project: Yeast Analysis Tool

This paper presents an improvement of an application called the Yeast Analysis tool, which was developed by Dr. Lagesse to assist a group of biology researchers in their yeast analysis research project. The researchers aim to understand the cell division and chemical composition of yeast cells using fluorescent proteins. To achieve this, they need to examine the microscopic images of yeast cells and measure the distance between their nuclei. However, this is a tedious and error-prone task. They must segment the images manually, input the data, and check the accuracy. And even then, they are not sure about their outcomes. They require a better approach. That is why Dr. Lagesse created the Yeast Analysis tool, an automated image analysis method that can perform the task for them. It can segment yeast cells in images and measure the distance between their nuclei with high precision and speed. It uses deep learning techniques to learn from the data and enhance its performance. It is a valuable tool for researchers.

However, the Yeast Analysis tool is not perfect. It has large methods and most of the code is written in a single file, which makes it complicated and obscure. It has bugs that cause errors and crashes. It has some limitations and needs some refinements. That makes it hard to use and maintain. The paper focuses on re-architecting, refactoring, improving GUI, and resolving the bugs of the project. Followed best practices such as developing iteratively, managing requirements, and agile software development model to work on this project.

Proposed plugin-based architecture where an application can be created from the collection of different, reusable components that don’t rely on one another but can still be assembled dynamically using these components. It helps to extend the functionality of the application without affecting the core structure of the application. Refactoring the code included making the methods modular, and removing the code duplicates. It helped increase the readability of code and increase in the performance by 7.4% of the application. Improving GUI and making the application bug free helps the user to use the application easy to use and increases user productivity. Performed a GUI survey where users said the new GUI is user-friendly and rated 4.3 out of 5. In conclusion, the Yeast Analysis tool is now more user-friendly, reliable, and efficient. It will help the researchers achieve their goals faster and easier. It will advance science and technology in various fields.

SIDHANT BANSAL

Chair: Dr. William Erdly
Candidate: Master of Science in Computer Science & Software Engineering
5:45 P.M.; Discovery Hall 464
Project: Refactoring Virtual Reality-Based Orthoptic Toolkit

According to the Centers for Disease Control (CDC) under the Vision Health Initiative, it is noted that approximately 6.8% of children under the age of eighteen years in the United States are diagnosed with vision problems. Vision problems can severely impact a child’s learning.

Strabismus (crossed eyes) is one of the most common eye conditions in children. If left untreated, it can lead to amblyopia, commonly known as lazy eye. To regain binocular vision, a person with strabismus requires training in five levels of fusion skills, each level indicating progression in ability and vision complexity. The existing toolkit uses virtual reality (VR) to provide an environment for individualized, supervised therapy for children suffering from strabismus to regain binocular vision. The toolkit has the following four applications that may be useful for improving vision: luster, simultaneous perception, sensory fusion, and motor fusion. Since each of these applications are a separate application right now, it doesn’t adhere to the non-functional requirements of the overall toolkit. This project aims to evaluate and provide an architecture that will support the nonfunctional requirements i.e., maintainability, portability, and extensibility.

Thursday, May 25

HARSHIT RAJVAIDYA

Chair: Dr. Munehiro Fukuda
Candidate: Master of Science in Computer Science & Software Engineering
8:45 A.M.; Online
Project: An Agent-based Graph Database

Graph databases are a type of NoSQL databases that use graph structures to store and represent data. Unlike traditional relational databases that use tables and rows to represent data, graph databases use nodes and edges to represent relationships between data items. This allows for more flexible and efficient querying of complex and connected data items. Graph databases provide us with functional capabilities of querying a large number of interconnected data schemas, such as social networks and biological networks. In this project, we aim to build a Graph database using the MASS (Muti-Agent Spatial Simulation) library that relies on Places and Agents as the core components. The MASS library has already supported graph data structure (GraphPlaces) which is distributed on a cluster of computing nodes. However, the current implementation worked on specific graph types. This project implements graph creation using CSV files as generic inputs as possible. We also implement a query-parsing engine that takes OpenCypher queries as inputs and parses it to method calls of MASS GraphPlaces. On top of that we have implemented four types of queries (including where clause, aggregate type, and multi relationship queries) in order to perform verification of the graph database and to perform query benchmarks. Each benchmark measures the query latency, graph creation times, and spatial scalability of all the queries. The performance measurements are performed on a cluster of eight computing nodes, and the spatial scalability is measured using a Twitch monthly dataset, which contains more than 7k nodes and more than 20k edges. The research presents significant improvements in query latency and spatial scalability as we increase the number of computing nodes.

VENKATA RAMANI SRILEKHA BANDARU

Chair: Dr. Munehiro Fukuda
Candidate: Master of Science in Computer Science & Software Engineering
11:00 A.M.; Online
Project: Parallelization of Bio-inspired Computing Algorithms Using MASS JAVA

The exponential growth of big data has posed significant challenges for traditional optimization algorithms in effectively processing and extracting meaningful insights from large-scale datasets. In this context, bio-inspired computing has emerged as a promising approach, drawing inspiration from natural systems and phenomena. By mimicking biological processes such as evolution, swarm behavior, and natural selection, bio-inspired algorithms offer innovative solutions for optimizing data processing, pattern recognition, classification, clustering, and other tasks related to big data analytics.

Parallelizing bio-inspired computing algorithms is crucial for achieving improved performance and scalability. This accelerates the optimization process and enhances the efficiency of solving challenging problems. Multi-Agent Spatial Simulation (MASS) is an agent-based modelling library that has been used in great extent to parallelize a variety of simulations and data analysis applications. Building on this foundation, the implementation of Bio-inspired Computing algorithms project is an exploration into the advantages of using MASS Java to parallelize computationally complex algorithms.

This project presents the applications of algorithm designs for agent-based versions of Swarm Based Computation, Evolutionary Computation and Ecological Computation Algorithms. In addition to the designs of the algorithms, we present an analysis of programmability and performance comparing MASS Java to another agent based modelling framework named Repast Simphony.

FIONA VICTORIA STANLEY JOTHIRAJ

Chair: Dr. Afra Mashhadi
Candidate: Master of Science in Computer Science & Software Engineering
1:15 P.M.; Discovery Hall 464
Thesis: Phoenix: Federated Learning for Generative Diffusion Model

Generative AI has made impressive strides in enabling users to create diverse and realistic visual content such as images, videos, and audio. However, training generative models on large centralized datasets can pose challenges in terms of data privacy, security, and accessibility. Federated learning is an approach that uses decentralized techniques to collaboratively train a shared deep learning model while retaining the training data on individual edge devices to preserve data privacy. This paper proposes a novel method for training a Denoising Diffusion Probabilistic Model (DDPM) across multiple data sources using federated learning techniques. Diffusion models, a newly emerging generative model, show promising results in achieving superior quality images than Generative Adversarial Networks (GANs). Our proposed method Phoenix is an unconditional diffusion model that leverages strategies to improve the data diversity of generated samples even when trained on data with statistical heterogeneity (Non-IID data). We demonstrate how our approach outperforms the default diffusion model in a federated learning setting. These results are indicative that high-quality samples can be generated by maintaining data diversity, preserving privacy, and reducing communication between data sources, offering exciting new possibilities in the field of generative AI.

Friday, May 26

JEFFREY ALEXANDER KYLLO

Chair: Dr. Afra Mashhadi
Candidate: Master of Science in Computer Science & Software Engineering
1:15 P.M.; Online
Project: Inflorescence: A Framework for Evaluating Fairness with Clustered Federated Learning

Measuring and ensuring machine learning model fairness is especially difficult in federated learning (FL) settings where the model developer is not privy to client data. This project explores how the application of clustered FL strategies, which are designed to handle data distribution skew across federated clients, affects model fairness when the skew is correlated with privileged group labels. The study report presents empirical simulation results quantifying the extent to which clustered FL impacts various group and individual fairness metrics and introduces a Python package called Inflorescence (“a cluster of flowers”) that extends Flower, an open-source FL framework, with several clustered FL strategies from the literature.

PRIANKA BANIK

Chair: Dr. Min Chen
Candidate: Master of Science in Computer Science & Software Engineering
3:30 P.M.; Online
Project: Automatic Fake News Detection

With the proliferation of fake news, automatic fake news detection has become an important research area in recent years. However, teaching computers to differentiate between fake and credible news is complex. One of the main challenges is to train computers with an abstract understanding of natural languages. This project introduces a web framework that is capable of classifying fake and real news, employing three different approaches. The first approach uses a TF-IDF vectorizer and a Multinomial Naive Bayes classifier to identify fake news based on the significance of words appearing in the text news. The second approach uses a count vectorizer in place of TF-IDF vectorizer which emphasizes the frequency of words occurring in the news article. As a third strategy, LSTM (long short-term memory networks) neural network is implemented along with the word embedding technique to improve classification accuracy. Experimental results compare these three models with some of the existing works and a comparative analysis of multiple fake news detection techniques is presented to justify the effectiveness of the proposed system.

Tuesday, May 30

SANJAY VARMA PENMETSA

Chair: Dr. Min Chen
Candidate: Master of Science in Computer Science & Software Engineering
8:45 A.M.; Online
Project: Collaboratative Rhythm Analysis For Endangered Languages

Nearly 40% of 7000 languages in the world are expected to become extinct if no efforts are made to preserve them. To preserve the indigenous language and the heritage and culture associated with it, there is a significant need to analyze and document these languages. Blackfoot is an endangered language with approximately 3,000 native speakers left. It is used in the regions of Alberta in Canada, and Montana in the U.S.A. As a pitch accent language, meaning of Blackfoot words is dependent on the pitch patterns in addition to the spelling of the words. This makes it especially difficult to learn and teach the language. To address this need, MeTILDA (Melodic Transcription in Language Documentation and Application) was developed by Dr. Min Chen’s research group in collaboration with researchers at the University of Montana. It is a cloud-based platform to support the documentation and analysis of the Blackfoot language.

The primary goal of this capstone project is to enhance collaboration and data reuse on the MeTILDA platform. To achieve this goal, we have implemented several key features that are designed to improve user engagement and increase the overall efficiency of the platform. Firstly, to achieve improved collaboration, our project allows multiple users to work together for creating a Pitch Art, on the Create page. Secondly, we introduced enhancements to the file system, that includes the ability to share files with different levels of access, on the My Files page. Finally, to improve data reusability, we made significant improvements to the way Pitch Arts are saved to the Collections page. Specifically, allowing users to have the ability to modify the saved Pitch Art.

To ensure the quality of our implementation, we conducted extensive unit and load testing to identify any bugs or performance issues that could impact user experience. Additionally, we conducted a usability study with a diverse group of population to evaluate the effectiveness of the new features. The results of the study indicated that our improvements help in streamlining the workflow and improve the overall productivity on the MeTILDA platform. Furthermore, we published a paper at ACM ICMR 2023 with details to replicate and evaluate several main MeTILDA functions . Given the urgency in endangered language research, our ICMR paper helps share resources and knowledge among interested individuals in academic and local communities, and enables the operation, customization, and extension of our toolsets.

MEGANA REDDY BODDAM

Chair: Dr. Wooyoung Kim
Candidate: Master of Science in Computer Science & Software Engineering
3:30 PM.; Online
Project: Interpretation of a Residual Neural Network and an Inception Convolutional Neural Network Through Concept Whitening Layers

Deep Learning models are difficult to interpret because they are complex, non-linear, and high dimensional algorithms. This paper’s goal is to contribute to interpreting one of these deep learning models: convolutional neural networks. Interpretive analysis is performed in the context of predicting Hepatocellular Carcinoma (HCC), the most common type of primary liver cancer, from liver tissue histopathology images. The convolutional neural network models analyzed are a 50 layer residual neural network and an inception convolutional network. The results from the predictive training and testing of the models show that the accuracy of models remains the same regardless of adding the interpretive training technique of concept whitening layers. Additionally, the results also show a greater interpretive power with concept whitening layers added to the model through post-hoc analysis methods, specifically inter-concept similarity rating, intra-concept similarity rating, concept importance rating, and feature vector displays.

TYLER CHOI

Chair: Dr. Kelvin Sung
Candidate: Master of Science in Computer Science & Software Engineering
5:45 P.M.; Online
Project: Enhancing Search and Rescue Operations: A Pragmatic Application of User-Centered Development

This capstone paper investigates the development of a software solution tailored for search and rescue (SAR) operations, with a particular emphasis on evaluating the implementation and effectiveness of user-centered development (UCD) principles. Initially, the project aimed to create a Virtual Reality (VR) Interactive Topographical Mapping System. This phase resulted in the research and development of a sophisticated VR prototype, incorporating a comprehensive suite of features that facilitated live, interactive topographical mapping within a 3D virtual environment.

The objectives of UCD involve placing users’ needs and requirements at the forefront of the design process, ensuring that solutions not only possess technical prowess but also deliver value and impact for the target audience. However, despite the numerous technical accomplishments of the VR project, end-user feedback from stakeholders, such as forest firefighters, revealed the necessity for a solution that better aligned with their real-world requirements. These users required direct observation of ground and vegetation conditions to make informed decisions about mission trajectories, a capability unattainable with the VR application. This insight led to a pivotal shift in our approach, redirecting the project towards the development of a targeted desktop application explicitly designed to address the operational needs of Search and Rescue (SAR) personnel.

The resulting product is a desktop application accessible through both a Graphical User Interface (GUI) and a Command Line Interface (CLI), with development centered on continuous end-user engagement and feedback. This solution offers two distinct interfaces catering to different end-users, prioritizing a concise UI and output while avoiding unnecessary complexity and irrelevant details.

In evaluating the implementation of UCD, the project demonstrates that adopting a user-centric approach can enhance the efficiency and effectiveness of SAR operations, emphasizing users’ preference for utility over visual and graphical elements. Furthermore, the project’s evolution from a cutting-edge VR system to a specialized desktop application provides insights into the broader fields of computer science and emergency response.

In future work, this report investigates potential enhancements, illustrating a sustained commitment to continuous improvement and alignment with user requirements. The accomplishments of the VR project, despite the pivot, attest to the importance of innovation and exploration in software development. Additionally, the project underscores the vital role of UCD in crafting solutions that combine technical utility with a focus on addressing real-world challenges.

Wednesday, May 31

RAGHAV NASWA

Chair: Dr. Dong Si
Candidate: Master of Science in Computer Science & Software Engineering
8:45 A.M.; Online
Project: Conversational AI to Deliver Family Intervention Training for Mental Health Caregivers

Mental health issues are prevalent in the United States, affecting 22.8% of adults in 2022. Unfortunately, a significant proportion (55.6%) of these adults did not receive treatment. Effective communication characterized by empathy is essential for enhancing the well-being of individuals with mental health issues. Family intervention training can empower friends and family members to provide in-home treatment to mental health patients. However, many caregivers lack the necessary training to engage with patients in a compassionate and understanding manner. To address this issue, a conversational AI chatbot was developed to train caregivers in empathetic communication. The chatbot engages in interactive conversations with caregivers and offers guidance on compassionate and empathetic communication. The chatbot was designed to be interactive, user-friendly, and accessible to caregivers. Our study demonstrates that conversational AI can serve as a valuable tool for training caregivers, leading to improved patient outcomes through enhanced communication skills.

FAHMEEDHA APPARAWTHAR AZMATHULLAH

Chair: Dr. Yang Peng
Candidate: Master of Science in Computer Science & Software Engineering
11:00 A.M.; Online
Project: Design of Energy-Efficient Offloading Schemes for Opportunistic Vehicular Edge Computing

In edge computing, computation tasks are offloaded to the edge servers, which can be either stationary edge servers or mobile edge servers. Stationary Edge Servers (SES) are usually located at the edge of a network, such as a cellular tower. SES can provide computing resources for nearby users or devices with low communication latency. When more devices connect to the stationary edge servers they cannot easily scale up due to limited design capacity, resulting in degraded performance. In contrast, Vehicular Edge Servers (VES) are a type of mobile edge computing server that is usually deployed on vehicles. VES can provide low-latency computing services by bringing computing resources even closer to the users with higher flexibility. VES also overcomes the drawback of stationary edge servers by providing services to the areas where stationary edge servers may be unavailable to reach. These benefits ideally satisfy the performance requirement of latency-sensitive but computing-intensive mobile applications such as pervasive AI, augmented reality, and virtual reality. When designing computing offloading strategies for vehicular edge computing systems supported through opportunistic VES, one challenge is handling the tradeoff between the time-varying availability of VES resources and the limited energy of mobile devices. In this project, we formulated an optimization problem, which considers VES’s capacity constraints and mobile users’ energy constraints, for solving the offloading problems in opportunistic vehicular computing systems. To solve the formulated problem, we designed and implemented a solution using CVXPY, a convex optimization problem solver along with three heuristic approaches: greedy, round-robin, and moderate offloading methods. We conducted extensive simulations, and the obtained results demonstrated the effectiveness of the proposed algorithm in improving mobile users’ energy usage while maintaining an expected quality of computing tasks.

CAMERON KLINE-SHARPE

Chair: Dr. William Erdly
Candidate: Master of Science in Computer Science & Software Engineering
3:30 P.M.; Discovery Hall 464
Thesis: Technical and Clinical Approaches For Implementing a Vision Screening Tool

Detecting vision problems is a challenging task, especially in children and in underserved or rural communities. This is in part due to the difficulty of obtaining useful indications of vision problems, which may cause a child to be sent to an eye doctor. Modern vision screening approaches are either hard to scale, expensive, or limited in applicability. The aim of this thesis was to clinically test QuickCheck, a vision screening mobile application aimed to combat these limitations, and determine future development and testing plans based on the results of those tests. This was accomplished through continuing the development of QuickCheck from past work to a clinically testable state, completing several clinical tests of the application in different settings, analyzing the results of those trials, and determining what future work needed to be done on the application and in future clinical trials to get the application ready for distribution.

After four clinical tests across two different testing sites, QuickCheck’s performance was measured using testing time, test accuracy, specificity, and sensitivity, and an analysis of error types and causes was also performed. While QuickCheck was able to detect most individuals who had vision problems, this work determined that further testing and development is needed to decrease the false negative error rate, improve testing time, and increase study sample size to ensure that QuickCheck is ready for deployment as a screening tool.

DIVYA KAMATH

Chair: Dr. Michael Stiber
Candidate: Master of Science in Computer Science & Software Engineering
5:45 P.M.; Online
Project: Migrating a Complex, Cpu-Gpu Based Simulator to Modern C++ Standards

Software engineering encompasses not just the act of writing code, but also the act of maintaining it. Maintainability can be improved in a number of ways; one such way involves updating the codebase to incorporate newer language features. This project focuses on updating Graphitti, a graph-based CPU-GPU simulator, to leverage modern C++ features and idioms. The objectives include enhancing reusability, reducing technical debt, and addressing serialization and deserialization limitations. All this while monitoring performance impact due to these changes.

The updated Graphitti codebase demonstrates improved memory management, enhanced reusability, and reduced technical debts, without sacrificing performance. This project has also paved the way for smoother integration of serialization and deserialization for all objects within Graphitti.

Thursday, June 1

NAYANA YESHLUR

Chair: Dr. Erika Parsons
Candidate: Master of Science in Computer Science & Software Engineering
8:45 A.M.; Online
Thesis: Using Data Analysis to Detect Intracranial Hemorrhage Through Ultrasound Tissue Pulsatility Imaging

Traumatic Brain Injury (TBI) is a type of injury that affects how the brain functions. TBI can lead to short-term problems or more long-term severe problems including various types of intracranial hemorrhage, some of which can even result in death. For this reason, finding ways of detecting intracranial hemorrhages early in patients can help to provide faster and more appropriate care, potentially improving patient outcomes. While CT and MRI are more traditional methods of diagnosing intracranial hemorrhage, they have certain drawbacks which ultrasound imaging can overcome. This work utilizes data collected from experiments on TBI patients using an ultrasound technique known as Tissue Pulsatility Imaging (TPI), specifically data about brain and other tissues displacements over the cardiac cycle. The aim of this research is to use such data to understand the differences between healthy brain displacement and brain displacement of TBI patients (with dangerous bleeding in their brain). In addition, we explore if and how the identification of the points of maximum and minimum displacement can be used to further aid in the identification of intracranial hemorrhage. The identification of these displacement points has emerged as a significant objective in this study, as they hold the potential to uncover crucial distinctions between states of wellness and illness. Furthermore, their utility in future research lies in assessing the consistency of these discoveries when applied to a broader dataset.

KISHAN NAGENDRA

Chair: Dr. David Socha
Candidate: Master of Science in Computer Science & Software Engineering
11:00 A.M.; Online
Project: Maya: An Open-Source Framework for Creating Educational Mobile Applications for Low-Tech Communities

This capstone project introduces “Maya,” an open-source framework aimed at assisting content creators in developing mobile applications to disseminate educational and awareness-related information to members of low-tech and low-literacy communities with limited or no internet access. The framework automates the transformation of PowerPoint presentations into mobile applications. The framework currently consists of two stages. In the first stage, the content creator feeds a PowerPoint presentation file to a user-friendly executable software system that extracts relevant information from the presentation and generates a single extract folder that contains both: a) a JSON file containing the metadata from the PowerPoint file, and b) a sub-folder with all the media from the PowerPoint file. The metadata includes information such as text, fonts, hyperlinks to pages, and paths to the media in the sub-folder. In the second stage, this extracted folder serves as input to another application that uses that information to create a mobile application that replicates the layout, images, text, and features from the original PowerPoint presentation.

The design for the Maya framework is based on the specifications provided for the Luna mhealth project (Luna), an initiative by Eliana Socha and Jon Socha. Luna aims to develop and deploy a low-tech mobile application to raise awareness about prenatal and postnatal health among the indigenous tribes in the Comarca Ngäbe-Buglé region of Panama. The development of Maya was based on the insights gained during the design and development of a non-generic mobile app that implemented the functionality in the original PowerPoint mock-up provided by Eliana and Jon Socha. Developing the Luna mobile app motivated the creation of the generic Maya framework. By utilizing the Maya framework, educational content creators without knowledge of mobile development can create powerful educational mobile applications for underserved communities across the globe, without the need to write any code.

JASON CHEN

Chair: Dr. Dong Si
Candidate: Master of Science in Computer Science & Software Engineering
11:30 A.M.; Online
Thesis: Protein Structure Refinement via DeepTracer and AlphaFold2

Understanding the structures of proteins has numerous applications, such as vaccine development. It is a slow and labor-intensive task to build protein structures from the experimental electron density maps through manual effort, therefore, machine learning approaches have been proposed to automate this process. However, most of the experimental maps are not atomic resolution, so the densities of side-chain residues are insufficient for computer vision-based machine learning methods to precisely determine the correct amino acid type when the sequence of the protein is not provided. On the other hand, methods that utilize evolutionary information from protein sequences to predict structures, like AlphaFold2, have recently achieved groundbreaking accuracy but often require manual effort to refine the results. We propose a method, DeepTracer-Refine, which automatically splits AlphaFold’s structure and aligns them to DeepTracer’s model to improve AlphaFold’s result. We tested our method on 39 multi-domain proteins and we increased the average residue coverage from 78.2% to 90.0% and average lDDT score from 0.67 to 0.71. We also compared DeepTracer-Refine against another method, Phenix’s AlphaFold refinement, to demonstrate that our method not only performs better when the initial AlphaFold model is less precise but also exceeds Phenix in run-time performance.

YIWEI TU

Chair: Dr. Kelvin Sung
Candidate: Master of Science in Computer Science & Software Engineering
1:15 P.M.; Online
Project: Interactive Watercolor Painting

Watercolor, as a well-known style of artistic painting, is appealing due to the translucent patterns formed by the spreading of its coloring water-based solution. These translucent patterns are produced by two basic brushing techniques, wet-on-wet and wet-on-dry, and due the stochastic nature of liquid mixture motion, each watercolor painting is distinctive. For newcomers, challenges in creating watercolor paintings include soiled canvas and wrong brush strokes that cannot be corrected due to the limitations of the paper and inconvenient tools.

To offer more freedom to watercolor creation, simulation of watercolor painting has been extensively studied including physically-based methods. The physically-based approach presents watercolor patterns by emulating the physical dynamics of paint and water flow and rendering an image based on the simulated results. The Lattice-Boltzmann method (LBM) is favored by researchers in watercolor fluid dynamic simulation due to its computation efficiency and stability in dealing with complex boundaries, incorporation of microscopic interactions, and potentials for parallel implementation.

The project follows Chu and Tai’s approach of modeling hydrodynamics with LBM and using the Kubelka-Munk (KM) reflectance model rendering method proposed by Curtis et al. Compared to other methods, this approach strikes a balance between accuracy of the simulation model and execution time. The LBE models fluid flow as a continuous propagation and collision process on a discrete lattice where the multiple lattices can be processed in parallel. By trading-off realism, LBE is capable of presenting relatively realistic watercolor results, while the parallel processing significantly reduces the simulation time.

The implementation of the physically-based simulation requires a platform that supports parallel processing at the per-pixel level, user’s interactive drawing activities, and rendering of the simulation results. Unity3D, as a cross-platform game engine, is chosen for the implementation of the system because of its support for user-defined HLSH shaders that can process pixel operations in parallel, a well-designed editor that can accommodate complex parameter adjustments, and pre-built pipelines that can render simulation results.

The implemented simulation system consists of four components: fluid injection, fluid flow simulation, pigment movement, and pigment composition. The first component receives the water applied to the digital canvas from the brush, and updates the edges between the wet and dry canvas. The fluid flow simulation component then simulates the diffusion of the fluid with a semi-rebounding scheme of LBE. The pigment movement component calculates the movement of the paint. As the final step, the rendering component renders the resulting image based on the KM model with the transmittance and reflectance of the pigment layers as input parameters.

The provided watercolor simulation system allows for the manipulation of brush, paper on canvas, and simulation settings. The system can make images based on the two basic brush approaches with popular watercolor patterns such as edge darkening, purposeful backrun, and pigment granulation by adjusting the brush settings. The mixture of multiple pigments might result in new and distinct colors when the KM model is used. Paper and simulation parameters can be adjusted to allow painting on canvases that do not exist in the physical world.

A novice painter can use the features of our system to make simple watercolor paintings. The system proved that the KM model can render watercolor visuals with color blending on the canvas, and that LBM can reduce the computational load of fluid simulations while maintaining simulation realism. The results of this project lay a solid platform for additional, in-depth research into watercolor simulation.

JIAQI ZHAN

Chair: Dr. William Erdly
Candidate: Master of Science in Computer Science & Software Engineering
3:30 P.M.; Discovery Hall 464
Project: Refactoring of EYE Toolbox, a Web-Based Medical System

The EYE Toolbox is a web-based medical system offering services for testing, diagnose and therapy of patients’ learning related vision problem, and has been evolving for 10 years. It has been implemented and is currently being used in a single clinical setting, but now needs to be updated and prepared for use for wider distribution across multiple clinics. To prepare this software for more general use and proper maintenance, detailed analysis and review is required – and a new, refactored version needs to be developed to assure that all functional and non-functional requirements of this system may be maintained properly – and HIPAA-compliant and use modern-day cloud-based architectures.

After review of the existing code base, the importance of a focused refactoring effort was determined because during previous software development cycles (using code and fix processes/iterative development), the system did not appear to leverage standardized data structures and refined programming methods such as extendable classes mapping different types of users, and generalized methods covering multiple using cases. In addition, with limited focus on code maintenance, the system development over a long time span has problems of code redundancy and legacy code for deprecation. Facing the widening application environment the system supports with a greater number of users and new use demands, the system has a necessity to be reviewed and refactored to ensure it meets the required standards of adaptability, scalability, maintainability and performance to ensure its stable supports for the updating working environment.

This project determines at figuring out how to tailor a practical and suitable refactoring plan for the EYE Toolbox system, generating automatic tests for verifying the accuracy of refactored code based on its front-end and back-end effects, evaluating to what degree the generated refactoring plan could improve the system, and analyzing whether the refactored system could meet the requirement of system evolution and distribution in broader application environment or not. To design, implement, and evaluate the customized refactoring plan, this project applied a code review approach, used refactoring methods for PHP language to process back-end logic and HTML language to design web page, and measured the refactoring performance through derived metrics of adaptability ,scalability, maintainability and performance.

Based upon the evaluation result, the benefit and limitation of this refactoring plan was analyzed, and the further improvement direction including the further refactoring tasks and recommended evaluation metrics were discussed. This project enriches the exploration of the systematic refactoring approach for a medical system, and could inspire researchers and offer guidance for new team members in their future refactoring work of similar or related medical system.

Friday, June 2

POOJA NADAGOUDA

Chair: Dr. Hazeline Asuncion
Candidate: Master of Science in Computer Science & Software Engineering
8:45 A.M.; Online
Project: Scaling and Parallelizing LDA-GA (Latent Dirichlet Allocation – Genetic Algorithm) for Data Provenance Reconstruction

The task of ensuring the reliability of sources and accuracy of information is becoming increasingly challenging due to the Internet’s ability to facilitate the creation, duplication, modification, and deletion of data with great ease. Hence the importance of Data Provenance Reconstruction, which attempts to create an estimated provenance of existing datasets when no provenance information has been previously recorded. The Provenance-Reconstruction approach proposed by the ”Provenance and Traceability Research Group”, is based on the Latent Dirichlet Allocation Genetic Algorithm (LDA-GA), which uses a Mallet library, was implemented in Java and achieved satisfactory results when applied to small datasets. As a result of the increase in datasets, performance degraded. To improve accuracy and performance, the GALDAR-C++, a Multi-Library Extensible Solution for Topic Modeling in C++, was developed. As compared to a Java implementation, this solution using WarpLDA offered satisfactory results. To improve the performance further, a parallel computing strategy, Message Passing Interface (MPI), was applied on both the serial Java and C++ versions of code by parallelizing the LDA calls in each generation of the LDA Genetic algorithm. Both parallel Java and C++ implementations gave extraordinary performance improvement compared to their respective serial implementations. But both the parallel solutions were limited to using 9 nodes in parallel as the Genetic algorithm supported 9 populations. In order to further scale the parallel solution, we implemented a scaled genetic algorithm to support 12 and 24 populations using 12 and 24 computing nodes for both Java and C++ versions. Also, the previous serial and parallel solutions did not provide much improvement in terms of accuracy. For bigger datasets of size 5K articles, the accuracy was as low as 8%. Hence we further extended our Scaled Parallel LDA-GA Java version to improve accuracy. We optimized the existing LDA-GA strategy by providing the genetic algorithm with initial LDA parameters (topic count and iteration count) proportional to the size of the dataset and applying a cosine filter to LDA-GA clusters. This strategy provides accuracy improvement of more than 3 times based on the dataset size in comparison to previous serial and parallel solutions and performance improvement of 4x to 8x based on the dataset size in comparison to the previous serial solution. The results obtained make this a viable solution for future studies on provenance reconstruction, especially for larger datasets.

WINTER 2023

Friday, March 3

PURRNIMA DAYANANDAM

Chair: Dr. William Erdly
Candidate: Master of Science in Computer Science & Software Engineering
3:30 P.M.; Online
Project: A Layered Model for Embedding Knowledge Management within Project Management: A Case Study

Knowledge management systems (KMS) and project management (PM) techniques are important for providing effective and high-quality products and services. These methods are evolving to be more complex and impactful, especially with more recent efforts to identify and build solutions that create a synergistic approach between the two.

This study aims to explore the unique needs of existing projects and the need for an efficient onboarding process of new students to recommend solutions to improve PM, onboarding process, and software development practices at EYE Research Group [1].

The study consists of two parts: 1) Classification and evaluation of ongoing projects. And, 2) Performing descriptive statistics and inductive coding on an electronic-survey data conducted among 20 existing and previous students at EYE Research Group [1].

First, the ongoing projects were classified into five different cases. These cases vary along key attributes such as technology, stage of project, environmental setting, testing procedures and end user to describe the uniqueness of each project. Second, an electronic-survey collected data to analyze the overall satisfaction rate and recommendations to improve existing onboarding processes, manage software development projects and improve software development work practices.

Results from the classification of ongoing projects into five unique cases provided an understanding of the project strategy of each project in terms of refactoring, clinical testing, new feature development, and new project planning. Next, the project attributes provided an initial insight into the existing knowledge base of the project by providing the stage of the project, the technology the software was developed, testing methods followed in each project, and the targeted users for each project. Finally, the current project goals provided an understanding of the direction of each project.

Results from the electronic survey suggests that while the majority of the new students that were onboarded with the existing system were satisfied, several changes need to be made to the system in order for it to become more efficient. These additions include the need for a project manager to set and follow up on goals, to have at least three features in the onboarding system, having a set meeting agenda, having clearly defined team and leadership roles as well as the use of a tracking tool to outline tasks and deadlines. The respondents also saw it best to have recent project documents, and for a better document storage system. Tutorials to the software development software were also to be offered in the form of videos.

Recommendations were made for implementing a layered project knowledge management (PKM) model for managing project knowledge. This layered model is a collection of PKM plan [2], KMS tools [3], knowledge processes (KP) [4] and project knowledge base [5]. Also, recommendations were made for an onboarding portal that introduces a three-step onboarding plan [6] to direct the student to the appropriate core knowledge elements (and associated resources) needed for their particular project type and specific attributes. It includes these three steps; 1) Getting Started 2) Overview of the Projects, Project Documents and Onboarding Buddy; and 3) Settling In.

Overall, embedding an effective KMS approach within project management (PM) might enhance the project management knowledge and promote an efficient onboarding process of new students.

Monday, March 6

LEUNG TSAN NG

Chair: Dr. Munehiro Fukuda
Candidate: Master of Science in Computer Science & Software Engineering
3:30 P.M.; Online
Project: Parallelization of computational Geometry Algorithms

Computational geometry is a study of efficient algorithms for solving geometric problems. The aim of it is to optimize the algorithms as it always involves very large dataset in the real world. For such a dataset, a little improvement of the time complexity of algorithms can save a lot of time. Besides this, parallelization is another way to shorten the computational time. In stead of optimizing the time complexity, we can assign the sub-problems to different computing nodes and let them compute the problem individually. As a result, the division of workload can reduce the computational time largely. However, many computational geometry algorithms, such as Convex Hull, Voronoi Diagram, Closest Pair, have been researched for many years, and their performance had been tuned up to be very good in sequential version. It is very difficult to compare the parallel version and sequential version in this case. One major advantage for parallel programming is the amount of space. As we scale up the number of computing resources, the space such as memory and disk space increase. Therefore, parallel programming can handle much larger dataset. In this project, we focus on extending the previous projects including Euclidean Shortest Path and Voronoi diagrams that is done by previous students. We improve these two problems by using different approaches to handle larger amounts of data. The implementation is done with MapReduce, Spark, and Multi-Agent Spatial Simulation (MASS). These three frameworks have their own features. This project shows their performance on different geometric problems and compares their advantages and disadvantages.

Thursday, March 9

SATYAVADA VENKATA NAGA SIRISHA

Chair: Dr. Clark Olson
Candidate: Master of Science in Computer Science & Software Engineering
5:45 P.M.; Online
Project: Explore UWB In Augumented Reality

This paper presents a smartphone application for Android Platform that uses Augmented Reality (AR) to build an immersive experience for people visiting UW Bothell campus to understand and interact with the surroundings. The application has two main features: 1. Display nearby points of interests (POIs) as the user points the camera in a certain direction 2. Show navigation instructions in AR when the user selects a POIs. The challenge in AR applications in geo location mapping is to render AR content tied to a specific GPS coordinate. In this project, our solution, based on Google AR Core’s geospatial APIs, which uses Visual Positioning System (VPS) to precisely locate the user’s real world GPS Coordinates based on the surrounding images from Google’s Street View and tie AR content to the detected location. Existing methods for AR navigation store a virtual map in memory to render location-specific AR content thereby having high space and computational complexity. The use of the Geospatial API alleviates this problem. This project serves as a proof of concept for outdoor AR navigation in campuses. Currently, the application shows only navigation signs in AR. This project can be further extended to show richer AR and graphical content. It can be combined with existing techniques for indoor navigation to offer seamless AR experience anywhere within campus.

Friday, March 10

AHMED NADA

Chair: Dr. Min Chen
Candidate: Master of Science in Computer Science & Software Engineering
1:15 P.M.; Online
Thesis: Visual Question Answering

Visual Question Answering (VQA) is an Artificial intelligence (AI) and Computer Vision (CV) comprehensive task to answer questions about the visual content of an image. For instance, questions like “What color is the bus?” or “How many people are in the photo?” can be answered using VQA. The task has been shown to be important and useful in various domains, such as autonomous vehicles to find parking spots and understand parking signs, medical imaging applications to identify tumors, as well as virtual assistants and search engines. Researchers have developed models that are trained to solve VQA problems and effectively aid in tasks related to VQA to meet the need for such tools. In this project, we present a web-based VQA tool that consists of two components: a front-end application for submitting an image and a question, and a back-end application that utilizes a trained model to respond to the user’s request. In this research, VQA v2 dataset and state-of-the-art pre-trained models to extract image features and question embeddings were used to train a VQA model on Google Colab. Without resorting to partial credits or word similarity metrics, this approach achieved an accuracy rate of 48%, representing a 9% improvement over the results obtained with static word embedding.

Wednesday, March 15

POOJA CHHAGANLAL TANK

Chair: Dr. David Socha
Candidate: Master of Science in Computer Science & Software Engineering
8:00 A.M.; Online
Project: Continuation of Model Databases: A tool for designing and learning database systems

Object-Role Modeling (ORM) is a powerful technique for teaching database and object-oriented design. Its visual representation of real-world entities and focus on semantics help students understand database design concepts quickly. Logical data modeling (LDM) is another widely accepted technique that is easy to learn and adapt to changes, and that is supported by many modeling tools and frameworks. Many tools that are readily available and easy to use for students, don’t support ORM as comprehensively as Microsoft VisioModeler 3.1, which is no longer compatible with new operating systems. To address this issue, this capstone project is part of a team effort to develop a browser-based app that supports ORM, LDM, and SQL conversion and generation by following software engineering principles, performing feature enhancements, and comparative analysis. The project’s focus is to provide forward and reverse engineering for ORM, LDM, and SQL, ensuring efficient and accurate software system design.

AUTUMN 2022

Tuesday, November 15

SAMRIDHI AGRAWAL

Chair: Dr. Hazeline Asuncion
Candidate: Master of Science in Computer Science & Software Engineering
8:45 A.M.; Online
Project: Optimized Provenance Reconstruction for Machine-generated data

A lot of data is created, deleted, copied and modified easily over the Internet which makes it difficult to identify the authenticity and credibility of the data. It is important to reconstruct the provenance of data which has lost its provenance information. There are techniques which helps in recovering the metadata from which provenance can be reconstructed. However, many systems fail to capture provenance due to lack of provenance capture mechanisms such as the Source file repositories or file storage system. The Provenance-Reconstruction approach proposed by the “Provenance and Traceability Research Group” has numerous projects on reconstructing provenance.

The current research (OneSource) captures various reconstruction techniques for machine generated datasets with attributes such as file size, semantic meaning of the content, and word count in the files. OneSource improves provenance reconstruction for git commit history as machine generated datasets. OneSource algorithm uses multi-funneling approach which includes techniques such as data cleaning in python, topic modelling and cosine similarity for clustering, and lineage algorithm with endpoints known to achieve higher accuracy in recovering valid provenance information. OneSource generates ground truth data by extracting commit history and file versions of a git repository. To assess OneSource model performance, the model is evaluated on various datasets with varying data size and count of files. OneSource reconstructs provenance of clusters and relationship of files (cluster derivation) within the cluster. The evaluation results indicate that OneSource can reconstruct provenance of cluster by attaining 90% precision and reconstruct provenance of cluster derivation by attaining 66% precision with cosine similarity as the clustering method. OneSource yields improvement in accuracy of 60% for cluster derivation than the existing technique. In the future, research studies may use parallelization for larger datasets as well as optimizations in lineage algorithm may improve the model performance.

Thursday, December 1

DI WANG

Chair: Dr. Kelvin Sung
Candidate: Master of Science in Computer Science & Software Engineering
1:15 P.M.; Online
Project: Real-time Cloth Simulation

Computer animated cloth is commonplace in video games and film making. Believable cloth animation greatly improves the sense of immersion for video gamers. Simulated cloth can seamlessly blend into live-action footage, allowing filmmakers to generate desired visuals by adjusting parameters. Real-time cloth simulation allows a user to interact with the materials, making the virtual cloth try-on experience possible. All these use cases prefer fast solutions, ideally achieving believable cloth animation in real-time. It is, however, challenging to simulate cloth both accurately and efficiently, due to its infinite deformation scenarios and complex inner mechanics. This project studied two solutions to tackle real-time cloth simulations: 1) an iterative approach using a linear solver, which fully exploits the GPU’s parallel processing architecture and efficiently solves the cloth material with thousands of vertices in real-time. 2) a nonlinear solver, which is based on the Projective Dynamics global-local optimization technique. We implemented an interactive application to demonstrate the two solutions, and assessed their qualities based on generality, correctness, and efficiency of the results. Our results show that both solvers are capable of generating believable real-time cloth animations in a wide range of testing scenarios: they interactively react to the changes in cloth attributes, internal and external forces, can be properly illuminated, texture mapped, and are capable of interacting with other objects in the scene, e.g., proper collision. The known conditions where the solvers could generate incorrect results were investigated: the instability of the linear solver with overly stiff spring constants, and the stiff self-bending of the nonlinear solver resulting in inability to support realistic wrinkles. By experimentation and theoretical reasoning, we identified that the linear solver’s instability is inevitable, while the nonlinear stiff-bending can be improved by a more sophisticated energy definition. To evaluate the both solvers’ efficiency, we recorded actual runtime and derived each performance function with respect to the cloth resolutions. Our results verify the expected algorithmic complexity: within GPU supported range, linear solver runtime can maintain constant as the resolution increases. The nonlinear’s running-time grows at a O(N3) rate.

KEVIN WANG

Chair: Dr. Munehiro Fukuda
Candidate: Master of Science in Computer Science & Software Engineering
3:30 P.M.; Online
Project: Performance and Programmability Comparison of Parallel Agent-Based Modeling (ABM) Libraries

Agent-based modeling (ABM) allows researchers in the social, behavioral, and economic (SBE) sciences to use software to model complex problems and environments that involve thousands to millions of interacting agents. These models require significant computing power and memory to handle the high numbers of agents. Various research groups have implemented parallelized ABM libraries which allow models to utilize multiple computing nodes to improve performance with higher problem sizes. However, it is not clear which of these libraries provides the best-performing models and which is the easiest to develop a model with. The goal of this project is to compare the performance and programmability of three current parallel ABM libraries, MASS C++, RepastHPC, and FLAME. The Distributed Systems Lab at the University of Washington Bothell developed Multi-Agent Spatial Simulation (MASS) C++ as a C++-based ABM library. Different research groups developed RepastHPC and FLAME before MASS C++, and SBE researchers have successfully used these libraries to create agent-based models. To measure performance, we designed a set of seven benchmark programs covering various problems in the SBE sciences, and implemented each of them three times using MASS C++, RepastHPC, and FLAME. We compared the average execution times of the three implementations for each benchmark to determine which library performed the best. We found that certain benchmarks would perform better with MASS C++ compared to RepastHPC, while for other benchmarks the opposite was true. However, we found that across all benchmarks FLAME had the worst performance since it could not handle the same parameters given to the MASS C++ and RepastHPC implementations. To measure programmability, we performed a static code analysis and manual code review of each benchmark implementation to assess the three libraries quantitatively and qualitatively. We found that in terms of quantitative metrics, none of the three libraries was conclusively more programmable than the others. However, MASS C++ and RepastHPC may have more desirable qualities for developing agent-based models compared to FLAME.

Friday, December 2

JASON KOZODOY

Chair: Dr. Min Chen
Candidate: Master of Science in Computer Science & Software Engineering
8:45 A.M.; Online
Project: Automobile Retrieval Price Predictive System using LightGbm with Permutation Feature Importance

We see different powered vehicles of hybrid, gasoline, and electric models in the vehicle market. The varying vehicle features in these types of vehicles creates a unique problem in vehicle selection and price prediction. We create an automobile retrieval price predictive system to enable users to access different powered car results that have similar vehicle features. Our system focuses on selecting multiple powered vehicles for users and predicting prices on the selected vehicles. Our system also enables similar recommendations based on past vehicle selections. Our capstone project compares four different regression models: LightGbm, FastForest, Ordinary Least Squares, and Online Gradient Descent. The four models cover ensemble machine learning models and linear machine learning models on automobile datasets
for price prediction. We select a model to use for our system after comparisons. We select and use the LightGbm regression model for our personalized support retrieval prediction system. The LightGbm regression model achieved a price prediction accuracy of .97 within our regression evaluation results with cross-validation. Furthermore, we record permutation feature importance scores within our system to signify how feature importance scores differ after predictive learning. The system displays these rankings by car results to the user. This allows the user to learn about how different features influence the prediction of prices. This gives the user insight into the structure of importance by showing users low, medium, and high rankings for vehicle features that influence price predictions.

LUYAO WANG

Chair: Dr. Kelvin Sung
Candidate: Master of Science in Computer Science & Software Engineering
3:30 P.M.; Online
Thesis: Real-Time Hatch Rendering

Hatching has been a common and popular artistic drawing style for centuries. In computer graphics rendering, hatching has been investigated as one of the many Non-Photorealistic Rendering solutions. However, existing hatch rendering solutions are typically based on simplistic illumination models, and real-time 3D hatch-rendered applications are rarely seen in interactive systems such as games and animations. This project studies the existing hatch rendering solutions, identifies the most appropriate one, develops a real-time hatch rendering system, and improves upon existing results in three areas: support general illumination and hatch tone computation related to observed artistic styles, unify spatial coherence support for Tonal Art Maps and mipmaps, and demonstrate support for animation.

The existing hatch rendering solutions can be categorized into texture-based and primitive-based methods. These solutions can be derived in object or screen space. Based on our background research, we chose to examine the texture-based object-space method presented by Praun et al. The approach inherits the advantage of object-space temporal coherence. The object-space spatial incoherence is addressed by the introduction of the Tonal Art Map (TAM). The texture-based solution ensures that the rendering results resemble actual artists’ drawings.

The project investigated the solution proposed by Praun et al. based on two major components: TAM generation as an off-line pre-computation and real-time rendering via a Multi-Texture Blending shader.

The TAM construction involves building a two-dimensional structure, vertically to address spatial coherence as projected object size changes and horizontally to capture hatch tone changes. This unique structure enables the support for smooth transitions during zoom and illumination changes. We have generalized the levels in the vertical dimension of a TAM to integrate with results from traditional mipmaps to allow customization based on spatial coherence requirements. Our TAM implementation also supports the changing of hatch styles such as 90-degree or 45-degree cross hatching.

The Multi-Texture Blending shader reproduced the results from Praun et al. in real time. Our rendered results present objects with seamless hatch strokes and appear natural and resemble those of hand-drawn hatch artwork. Our implementation integrated and supported interactive manipulation of effects from general illumination models including specularity, light source types, variable hatch and object colors, and rendering of surface textures as cross hatch. Additionally, we investigated trade-offs between per-vertex and per-fragment tone computation and discovered that the smoothness in hatching can be better captured in the per-vertex computation with the lower sampling rate and interpolations. Finally, the novel integration of TAMs and traditional mipmaps allow customizable spatial coherence support which allows smooth hatch strokes and texture transitions in animations during object size and illumination changes.

Monday, December 5

JONATHAN LEE

Chair: Dr. Dong Si
Candidate: Master of Science in Computer Science & Software Engineering
11:00 A.M.; Online
Project: Psychosis iREACH: Reach for Psychosis Treatment using Artificial Intelligence

Psychosis iREACH aims to optimize the delivery of evidence-based cognitive behavioral therapy to family caregivers who have a loved one with psychosis. It is an accessible digital platform that can utilize the user’s intent and entities to determine the appropriate response. The platform is implemented based on an artificial intelligence and natural language understanding (NLU) framework, RASA. We developed the web application of the platform, and the chatbot has been integrated into the platform to collect data and evaluate performance. The link to the website is https://psychosisireach.uw.edu/.

Thursday, December 8

MEGHNA REDDY

Chair: Dr. Min Chen
Candidate: Master of Science in Computer Science & Software Engineering
11:00 A.M.; Online
Project: Audio Classifier for Melodic Transcription in Language Documentation and Application (MeTILDA)

There are about 7000 languages around the world, and 42% of these languages are considered endangered due to the decline in the number of speakers of the language. Blackfoot is one such language and is primarily spoken in Northwest Montana and Southern Alberta. MeTILDA (Melodic Transcription in Language Documentation and Application) is a collaborative platform created for researchers, teachers, and students to interact, teach, and learn endangered languages. It is currently being developed based on the Blackfoot language. Deep learning has progressed rapidly in the field of audio classification and has shown potential to serve as a tool for linguistic researchers in documenting and analyzing endangered languages. This project focuses on creating a web application for researchers of Blackfoot to assist their continuous research efforts in supporting deep learning research for MeTILDA. This application focuses on the automatic classification of different sounds in Blackfoot, specifically vowels and consonants, and provides three main functionalities. The dataset preparation section allows the user to create datasets of vowels and consonants easily and reduces manual effort. The feature extraction section allows the user to extract their choice of audio features such as Mel-Frequency Cepstral Coefficients, spectrograms, and spectral features for further processing and re-training models, and the audio classifier section allows the user to automatically obtain instances of vowels and consonants in user-provided audio files within Blackfoot language. The audio classifier uses an optimized ANN with audio spectral features and Mel-Frequency Cepstral Coefficients as input features and provides an accuracy of 89%. This application lowers the manual efforts and time-intensive tasks for researchers of Blackfoot and can be extended to classify other sounds in the future.

Friday, December 9

CAROLINE TSUI

Chair: Dr. Munehiro Fukuda
Candidate: Master of Science in Computer Science & Software Engineering
8:45 A.M.; Online
Project: Agent-based Graph Applications in MASS Java and Comparison with Spark

Graph theory is constantly evolving as it is applied to mathematics, science, and technology, and it has active applications in communication networks, computer science (algorithms and computation), and operations research (scheduling). Research on the realization and optimization of graph theory is of great significance to various fields. However, due to the increasing size of databases today, the volume of datasets (which can be represented as graphs for graph theory analysis) in real academia and industry has reached the level of petabytes (1,024 terabytes) or level of exabytes (1,024) petabytes. Analyzing and processing massive graphs has become a principal task in different fields. It is very challenging to process and compute rapidly growing, huge datasets (graphs) in a reasonable amount of time with limited computing and memory resources. In order to meet the need of improving performance, some solutions have emerged one after another – parallel frameworks that support graph computing. However, it is unclear how these parallelization libraries differ in performance and programmability for graph theory research or graph application development. The goal of this project is to compare the performance and programmability of two parallel libraries, MASS Java developed by the DSLab at the University of Washington Bothell, and Spark (including Spark GraphX) developed by the AMPLab at the University of California Berkeley, for graphics programming. In order to balance performance and programmability, we used MASS Java and Spark to design and develop Graph Bridge, Minimum Spanning Tree, and Strongly Connected Components respectively, for a total of six graph applications. After three rounds of running the applications and comparing their performance, the results show that for the Graph Bridge application, the performance of Spark is slightly better than that of MASS Java, and for Minimum Spanning Tree and Strongly Connected Components applications, MASS Java performs slightly better. Because MASS Java provides agents, they can more flexibly handle vertex-based regional operations and pass data to other agents; but Spark is not an agent-based library. However, for Graph Bridge applications that require depth-first traversal to obtain results, the agent advantage of MASS cannot be reflected. To measure programmability, we perform quantitative and qualitative evaluations respectively. The results show that the programmability of the two libraries is similar, but from the user’s point of view, MASS Java is more intuitive and suitable for developing graphical applications.

CHRIS LEE

Chair: Dr. Min Chen
Candidate: Master of Science in Computer Science & Software Engineering
1:15 P.M.; Online
Project: Extending a Cloud-Based System for Endangered Language Analysis and Documentation

With 40% of the world’s 7000 languages considered endangered, there is a significant need to document and analyze these languages to preserve the language and its associated culture and heritage. Blackfoot, spoken by approximately 2800 speakers in Alberta, Canada and Montana in the United States, is one such endangered language. Classified as a pitch accent language, the meaning of a Blackfoot word is not based exclusively on the spelling of the word but on the pitch patterns of the spoken word, which makes it challenging to teach and learn. To overcome this challenge and aid in the revitalization of the Blackfoot language, we collaborated with researchers at the University of Montana in developing a cloud-based system known as MeTILDA (Melodic Transcription in Language Documentation and Application). The goal of this project is to modernize the technologies originally used in the MeTILDA system, extend its analytic capabilities to incorporate the study of rhythm, and improve its data reuse and collaboration capability by persisting the data used in creating the visual aids called Pitch Art. The proposed features will benefit linguistic researchers in furthering their understanding of the Blackfoot language. It will facilitate teachers in developing curriculum for language acquisition, and help students take advantage of a teachers guided learning plan. With this system, we aim to provide an extensible platform to support future development to support the documentation and preservation of other endangered languages.

SUMMER 2022

Monday, August 1

JUNJIE LIU

Chair: Dr. Min Chen
Candidate: Master of Science in Computer Science & Software Engineering
11:00 A.M.; Online
Project: COVID-19 Fake News Detector

COVID-19, caused by a coronavirus called SARS-Cov-2, has triggered a pandemic impacting people’s everyday life for more than two years. With the fast spreading of online communication and social media platforms, the number of fake news related to COVID-19 is in rapid growth and propagates misleading information to the public. To tackle this challenge and stop the spreading of fake news regarding COVID-19, this project proposes to build an online software detector specifically for COVID-19 news to classify whether the news is trustworthy. Specifically, the intellectual contributions for this project are summarized below:

1. This project specifically focuses on fake news detection for COVID-19 related news. In general, it is difficult to train a generic model for all domains, the general practice is to fine-tune a base model to adapt the specific domain context.
2. A data collection mechanism to obtain fresh COVID-19 fake news data and to keep the model fresh.
3. Performance comparisons between different models: traditional machine learning models, ensemble machine learning models, and state-of-the art models – Transfer models.
4. From engineering perspective, the project will be the first online fake news detection website to focus on COVID-19 related fake news.

ANDREW NELSON

Chair: Dr. Kelvin Sung
Candidate: Master of Science in Computer Science & Software Engineering
5:45 P.M.; Online
Project: Real-time Caustic Illumination

Caustic illumination is the natural phenomenon that occurs when light rays bend as they pass through transparent objects and focus onto receiver objects. One might notice this effect on the ocean floor as light rays pass through the water and focus on the floor. Rendering this effect in a simulated environment would provide an extra touch of realism in applications that are meant to fully immerse a user in the experience. Traditionally, caustic illumination is simulated with offline ray tracing solutions that simulate the physical phenomenon of transporting photon particles through refraction and depositing the results on the receiving object. While this approach can yield accurate results, it is computationally intensive, and these ray tracing solutions can only be rendered in batches. To support caustics in real time, the calculations must simulate the natural phenomenon of photons traveling through transparent objects in every rendering frame without slowing down the application. This project focuses on rendering caustics in real time using a multi-pass rendering solution developed by Shah et al. Their approach constructs a caustic map in every frame which is used by subsequent rendering frames to create the final effect. The goal of this project was to develop an application that renders caustics and supports user interaction in real time. Our implementation uses the Unity game engine to successfully create the desired effect while maintaining a minimum frame rate of thirty frames per second.

Thursday, August 4

KALUAD ABDULBASET SANYOUR

Chair: Dr. Wooyoung Kim
Candidate: Master of Science in Computer Science & Software Engineering
11:00 A.M.; Online
Project: The Role of Machine Learning Algorithms in Editing Genes of Rare Diseases

Clustered Regularly Interspaced Short Palindromic Repeats (CRISPR), is an adaptive immunity mechanism in prokaryotes. Scientists have discovered that it is a programmable system that could be used to edit the genes of various species, which allows us to edit genes causing some rare diseases. CRISPR is associated with Cas9 protein causing double-stranded breaks in DNA. Cas9 binds to a gRNA that guides the Cas9 to a specific site that can be edited. Although gRNA is versatile and easy to design, it lacks accuracy in determining the editable sites. This can misguide Cas9 to a wrong location, causing changes in different genes. Hence, CRISPR process needs to find the ideal gRNA that can guide Cas9 to on-target, and avoid off-target. Various machine learning (ML) algorithms can play an important role in evaluating gRNAs for the CRISPR mechanism, and recently many computational tools have been developed to predict the cleavage efficiency of gRNA design process. Here, the project aims to provide an overview and comparative analysis of various machine and deep learning (MDL)-based methods that are effective in predicting CRISPR gRNA on-target activities. Comparison results show that hybrid approach combining deep learning and other ML algorithms presented excellent results.

Monday, August 8

SYED ABDULLAH

Chair: Dr. David Socha
Candidate: Master of Science in Computer Science & Software Engineering
3:30 P.M.; Online
Project: Remote Onboarding for Software Engineers: From “Forming” to “Performing”

Onboarding is defined as the process when a new employee joins, learns about, integrates into and becomes a contributing member of a team. A successful onboarding is essential for moving a team from Forming to Performing stage. It helps increase the new hire’s job satisfaction, improve the team’s performance, and reduce turnovers (which bring the team back to the forming stage). With remote work being the new norm in software engineering, remote onboarding brings a unique set of challenges.

In this project, I aim to identify the main challenges faced during remote onboarding for software engineers, specifically for role-specific onboarding that happens in the team domain, and provide recommendations on improving this onboarding process. To achieve these aims, I conducted a qualitative interview study and activity exercise with software engineers who have gone through remote onboarding. Nine interviews were conducted with software engineers ranging from junior software engineers to senior software engineers and software engineering managers. I analyzed these interviews to gain insights into factors affecting onboarding. From the interviews, I identified a hierarchy of needs, in which I classified the needs of the new hire into basic needs and needs required for excellence. Needs such as access to tools, clarity of tasks and knowledge were categorized as basic needs to do the work, whereas mentorship, relationship building, and collaboration transform the onboarding into an excellent experience. I then further linked these needs to 5 main themes that emerged during the interviews for having an effective onboarding: (i) having an effective onboarding buddy; (ii) the ability to create relationships with team members and other stakeholders; (iii) being provided with up to date and organized documentation and onboarding plan; (iv) the manager’s ability to listen and adapt to remote needs; and (v) a team culture which enables team members to communicate effectively and get unblocked quickly. Based on the interviews’ analysis together with insights from the literature, I developed checklists for recommended best practices for effective onboarding. A checklist was developed for each of the main onboarding stakeholders i.e., manager, onboarding buddy and new hire, along with a template of an onboarding plan. Using these checklists will help improve the effectiveness and consistency of remote onboarding for software engineering new hires.

Tuesday, August 9

ASHWINI ARUN RUDRAWAR

Chair: Dr. Michael Stiber
Candidate: Master of Science in Computer Science & Software Engineering
1:15 P.M.; Online
Thesis: Evaluating the impact of GPU API evolution on application performance and software quality

Researchers and engineers have started to build parallel computing systems using sequential CPU + parallel GPU programs. In recent years, there has been an increasing number of hardware GPU devices available in the market along with a number of software solutions that support these hardware devices. A substantial amount of work is required in identifying the best combination of hardware and software for building heterogeneous solutions. One of the combinations developers use is NVIDIA GPUs and CUDA APIs. With the rapid architectural changes in GPU hardware, the related functioning of APIs also changes. There is considerable regression in the development of applications built using prior versions of APIs due to backward compatibility limitations. This thesis evaluates the evolution of NVIDIA GPU and CUDA APIs with the help of Graphitti, a graph based heterogeneous CUDA/C++ simulator. This thesis identifies the advantages, limitations, and underlying functioning of a subset of APIs. This research explores these APIs in the context of performance, compatibility, ease of development, and code readability. It discusses how this process helped to implement a software change compatible with the simulator. This thesis documents the implementation of two APIs, ‘separate compilation’ and ‘link time optimization’ on the simulator, and how the implementation will help users to write modular code in Graphitti. It also shows there is almost no performance overhead over one of the largest neural network simulations in Graphitti. The implementation offers flexibility and scope to enhance the heterogeneous nature of Graphitti which will help to simulate much larger networks.

Wednesday, August 10

ANDREW HITOSHI NAKAMURA

Chair: Dr. Dong Si
Candidate: Master of Science in Computer Science & Software Engineering
11:00 A.M.; Online
Thesis: Macromolecular Modeling: Integrating DNA/RNA into DeepTracer’s Prediction Pipeline

DeepTracer is a fully automatic deep learning-based method for fast de novo multi-chain protein complex structure determination from high-resolution cryoelectron microscopy (cryo-EM) density maps. The macromolecular pipeline extends DeepTracer’s functions by including a segmentation step and pipeline steps to predict nucleic acids from the density. Segmentation uses a Convolutional Neural Network (CNN) to separate the densities of the two types of macromolecules, amino acids and nucleotides. Two U-Nets are trained to predict amino acid and nucleotide atoms in order to predict the structure from the density data. The nucleotide U-Net was trained with a map sample size of 163 cryo-EM maps containing nucleotide density, and identifies phosphate, sugar carbon 4 and sugar carbon 1 atom positions. When compared to Phenix’s pipeline, amino acids show favorable RMSD metrics, and nucleotide show comparable phosphate and nucleotide correlation coefficient (CC) metrics. The trained nucleotide U-Net model primarily focuses on double stranded DNA/RNA. Future work involves utilizing more density map data in training the nucleotide U-Net to detect single stranded DNA/RNA and removing phosphate outliers in postprocessing to improve the nucleic acid prediction.

ALEX XIE

Chair: Dr. Yang Peng
Candidate: Master of Science in Computer Science & Software Engineering
1:15 P.M.; Online
Project: Improving the Quality of Inference during Edge Server Switch for Applications using Chained DNN Models

Recent advances in deep neural networks (DNN) have substantially benefited intelligent applications, for example, real-time video analytics. More complex DNN models typically require a more robust computing capacity. Unfortunately, the considerable computation resource requirements of DNNs make the inference on resource-constrained mobile devices challenging. Edge intelligence is a paradigm solving this issue by offloading DNN inference tasks from mobile devices to more powerful edge servers. Due to user mobility, however, one challenge for such mobile intelligent services is maintaining the quality of service during the handover between edge servers. To address this problem, we propose in this report a solution to help improve the quality of inference for real-time video analytics applications that use chained DNN models. The scheme comprises two sub-schemes: (1) a non-handover scheme that determines the optimal offloading decisions with the shortest end-to-end inference latency, and (2) a handover scheme that improves the inference quality by maximizing the usage of mobile devices for the most useful inference outcomes. We evaluated the proposed scheme using a DNN-based real-time traffic monitoring application via testbed and simulation experiments. The results show that our solution can improve the inference quality by 57% during handovers compared to a greedy algorithm-based solution.

Thursday, August 11

MICHAEL J. WAITE

Chair: Dr. William Erdly
Candidate: Master of Science in Computer Science & Software Engineering
3:30 P.M.; Online
Project: Mobile-Ready Expression Analysis

The field of computerized facial expression analysis has grown fast in recent years, with multiple commercial solutions and a plethora of research being produced. However, there has not been much focus on this technology’s use in disability assistance. Studies have shown that an inability to read facial expressions can have a drastic negative impact on a person’s life, presenting a clear need for tools to help those impacted. Most work in this field focuses on analytic performance over computational performance. This project aims to create an application that can be used by the disabled to read facial expressions in situations where they cannot, with a focus on computational performance to allow for real-time analysis. By utilizing a simplified methodology inspired by classic object detection such as SIFT and SURF, we found that our emotional analysis can achieve a computational performance of 100 milliseconds per image while retaining an overall accuracy of 64% when evaluated on the CK+ database. We hope that in the future our system can be further developed to produce greater accuracy with minimal loss in computational performance using machine learning.

SPRING 2022

Wednesday, May 4

DAT TIEN LE

Chair: Dr. Brent Lagesse
Candidate: Master of Science in Computer Science & Software Engineering
11:00 A.M.; Online
Thesis: Emulated Autoencoder: A Time-Efficient Image Denoiser for Defense of Convolutional Neural Networks against Evasion Attacks

As Convolutional Neural Networks (CNN) have become essential to modern applications such as image classification on social networks or self-driving vehicles, evasion attacks targeting CNNs can lead to damage for users. Therefore, there has been a rising amount of research focusing on defending against evasion attacks. Image denoisers have been used to mitigate the impact of evasion attacks; however, there is not a sufficiently broad view of the use of image denoisers as adversarial defenses in image classification due to a lack of trade-off analysis. Thus, trade-offs, including training time, image reconstruction time, and loss of benign F1-scores of CNN classifiers, of a group of image denoisers are explored in this thesis. Additionally, Emulated Autoencoder (EAE), which is the proposed method of this thesis to optimize trade-offs for high volume classification tasks, is evaluated alongside state-of-the-art image denoisers in both the gray-box and white-box threat model. EAE outperforms most image denoisers in both the gray-box and white-box threat models while drastically reducing training and image reconstruction time compared to the state-of-the-art denoisers. As a result, EAE is more appropriate for securing high-volume classification applications of images.

Wednesday, May 18

NIRALI GUNDECHA

Chair: Dr. Munehiro Fukuda
Candidate: Master of Science in Computer Science & Software Engineering
8:45 A.M.; Online
Project: Lambda and Reduction method implementation for MASS Library

The MASS is a parallelizing library that provides multi-agent and spatial simulation over a cluster of computing nodes. The goal of this capstone is to reduce the communication overhead for data and make the user experience effortless. Hence improving the efficiency of MASS.

This paper introduces new features, lambda and reduction methods, and implementation to achieve the goals. This feature is not implemented and provided to any agent-based library till the date. Hence making this sole contribution to agent-based library. This paper validates the lambda and reduce method and uses MASS library to do so.

Implementation of the lambda method library and provides users the flexibility of using the MASS library frictionlessly. Using lambda methods, user can describe their own new feature implementation on the fly and have results instantaneously. On top of the lambda feature, reduce method is responsible to perform reduce operation of any type of users’ data or Agent data. The operation user wants to perform can be anything such as max, min or sum.

The data collection method is described as a lambda method. Using reduce method, user can perform tasks of reduction in single line of code that improves code reliability and clean code. These features remove the hassle of writing blocks of code and getting involved into agents’ behavior over cluster of nodes is distinctive as well as innovative. Lambda and reduce method implementation are revolutionary as this is unique contribution to agent-based library and their users.

PALLAVI SHARMA

Chair: Dr. Min Chen
Candidate: Master of Science in Computer Science & Software Engineering
11:00 A.M.; Online
Project: Text Synthesis

With explosion of data in the digital domain, manual synthesis of long texts to extract important information is quite a laborious and time-consuming task. Mobile based text synthesis systems that can take text input and extract important information can be very handy and would reduce the overall time and effort required in manual text synthesis. In this work, a novel system is developed that facilitate users to extract summaries and keywords from long texts in real time using a cross-platform mobile application. The mobile application uses a hybrid approach based on feature extraction and unsupervised learning for generating quality summaries. In this paper, 10 sentence features are used for feature extraction. A hybrid technique based on machine learning with semantic methods is used to extract keywords/key-phrases from the source text. This application also allows users to manage, share and listen to the information extracted from the input text. Additional features like allowing users to draft-error free notes improve users’ experience. To test reliability of this system, experimental and research evaluation were carried out on DUC 2002 dataset using ROGUE parameters. Results demonstrate 51% F-Score which is higher than state of the art methods used for extractive summarization on the same dataset. The hybrid approach used for keyword/key-phrase extraction was tested from the validity of the resulting keywords. Application could produce proper keywords in the form of phrases and words with an accuracy of 70%.

Thursday, May 19

ZHIYANG ZHOU

Chair: Dr. Afra Mashhadi
Candidate: Master of Science in Computer Science & Software Engineering
1:15 P.M.; Online
Project: Facial Recognition on Android Devices with Convolutional Neural Networks and Federated Learning

Machine Learning (ML) and Artificial Intelligence (AI) are widely applied in many modern services and products we use. Facial Recognition (FR) is a powerful ML application that has been used extensively in various fields. However, traditionally, the models are trained on photos crawled from the World Wide Web (WWW), and they are often biased towards celebrities and the caucasian population. Centralized Learning (CL), one of the most popular training techniques, requires all data to be on the central server to train ML models. However, it comes with additional privacy concerns as the server takes ownership of end-user data. In this project, we first use Convolutional Neural Networks (CNN) to develop an FR model that can classify 7 demographic groups using the FairFace image dataset. This has a more balanced and diverse distribution of ordinary face images across the racial groups. To further extend the training accessibility and protect sensitive personal data, we propose a novel Federated Learning (FL) system using Flower as the backend and Android phones as edge devices. These pre-trained models are initially converted to TensorFlow Lite models, which are then deployed to each Android phone to continue learning on-device from additional subsets of FairFace. Training takes place in real-time and only the weights are communicated to the server for model aggregation, thus separating user data from the server. In our experiments, we explore various centralized model architectures to achieve an initial accuracy of 52.9%, which is lightweight enough to continue improving to 68.6% in the Federated Learning environment. Application requirements on Android are also measured to validate the feasibility of our approach in terms of CPU, memory, and energy usage. As for future work, we hope the system can be scaled to enable training across thousands of devices and have a filtering algorithm to counter adversarial attacks.

Friday, May 20

VISHNU MOHAN

Chair: Dr. Munehiro Fukuda
Candidate: Master of Science in Computer Science & Software Engineering
8:45 A.M.; Online
Project: Automated Agent Migration Over Structured Data

Agent-based data discovery and analysis views big-data computing as the results of agent interactions over the data. It performs better onto a structured dataset by keeping the structure in memory and moving agents over the space. The key is how to automate agent migration that should simplify scientists’ data analysis. We implemented this navigational feature in multi-agent spatial simulation (MASS) library. First, this paper presents eight automatic agent navigation functions, each we identified, designed, and implemented in MASS Java. Second, we present the performance improvements made to existing agent lifecycle management functions that migrate, spawn and terminate agents. Third, we measure the execution performance and programmability of the new navigational functions in comparison to the previous agent navigation. The performance evaluation shows that the overall latency of all the four benchmark applications improved with the new functions. Programmability evaluation shows that new implementations reduced user line of codes (LOC), made the code more intuitive and semantically closer to the original algorithm. The project successfully carried out two goals: (1) design and implement automatic agent navigation functions and (2) make performance improvements to the current agent lifecycle management functions.

CARL ANDERS MOFJELD

Chair: Dr. Yang Peng
Candidate: Master of Science in Computer Science & Software Engineering
3:30 P.M.; Online
Project: Adaptive Acceleration of Inference Services at the Network Edge

Deep neural networks (DNN) have enabled dramatic advancements in applications such as video analytics, speech recognition, and autonomous navigation. More accurate DNN models typically have higher computational complexity. However, many mobile devices do not have sufficient resources to complete inference tasks using the more accurate DNN models under strict latency requirements. Edge intelligence is a strategy that attempts to solve this issue by offloading DNN inference tasks from end devices to more powerful edge servers. Some existing works focus on optimizing the inference task allocation and scheduling on edge servers to help reduce the overall inference latency. One key aspect of the problem is that the number of requests, the latency constraints they have, and network connection quality will change over time. These factors all impact the latency budget for inference computation. As a result, the DNN model that maximizes inference quality while meeting latency constraints can change as well. To address this opportunity, other works have focused on dynamically adapting the inference quality. Most such works, though, do not solve the problem of how to allocate and schedule tasks across multiple edge servers, as the former group does. In this work, we propose combining strategies from both areas of research to serve applications that use deep neural networks to perform inference on offloaded video frames. The goals of the system are to maximize the accuracy of inference results and the number of requests the edge cluster can serve while meeting latency requirements of the applications. To achieve the design goals, we propose heuristic algorithms to jointly adapt model quality and route inference requests, leveraging techniques that include model selection, dynamic batching, and frame resizing. We evaluated the proposed system with both simulated and testbed experiments. Our results suggest that by combining techniques from both areas of research, our system is able to meet these goals better than either approach alone.

Monday, May 23

ISHPREET TALWAR

Chair: Dr. Min Chen
Candidate: Master of Science in Computer Science & Software Engineering
9:00 A.M.; Online
Project: Recycle Helper – A Cross-Platform mobile application to Aid Recycling

With the growth of the population on the planet, the amount of waste generated has also increased. Such waste, if not handled correctly, can cause environmental issues. One of the solutions to this problem is Recycling. Recycling is the process of collecting and processing materials that would otherwise be thrown away as trash and turning them into new products. It can benefit the community and the environment. Recycling can be considered as an umbrella term for the 3R’s – Reduce, Reuse and Recycle. There are a variety of items that are present in the surrounding environment in different states/conditions which makes the process of recycling complex because having the knowledge of the correct way to recycle these items can be overwhelming and time-consuming. To help solve this problem to an extent, this paper proposes a cross-platform mobile application that promotes recycling. It helps users by providing them with recycling instructions for different product categories. The application allows the user to capture/choose an image of an item using a phone camera or gallery. It uses software engineering methodologies and machine learning to predict the item and provide the relevant recycle instructions. The application is able to detect and predict the items with an accuracy of 81.06%, using a Convolutional Neural Network (CNN) model. To motivate and engage users for recycling, the application allows the user to set a monthly target goal for recycling, track its progress, and view their recycling history. The application is user-friendly and will help promote correct recycling in a less time-consuming manner.

Wednesday, May 25

YAN HONG

Chair: Dr. Munehiro Fukuda
Candidate: Master of Science in Computer Science & Software Engineering
8:45 A.M.; Online
Project: Graph Streaming in MASS Java

This project is to facilitate graph streaming in agent-based big data computing where agents find a shape or attributes of a huge graph. Analyzing and processing massive graphs in general has become an important task in different domains because many real-world problems can be represented as graphs such as biological networks and neural networks. Those graphs can have millions of vertices and edges. It is quite challenging to process such a huge graph with limited resources as well as in a reasonable timeframe. The MASS (Muti-Agent Spatial Simulation) library has already supported graph data structure (GraphPlaces) which is distributed on a cluster of computing nodes. However, when processing a big graph, we may still encounter the following two problems. The first is the construction overhead that will delay the actual computation. The second is limited resources that slow down graph processing. To solve those two problems, we implemented graph streaming in MASS Java which repetitively reads a portion of a graph and processes it while reading the next graph portion. It supports HIPPIE and MATSim file formats as the input graph files. We also implemented two graph streaming benchmarks: Triangle Counting and Connected Components, to verify the correctness of and evaluate the performance of graph streaming. Those two programs were executed with 1 – 24 computing nodes, which demonstrates the significant CPU-scalable and memory-scalable performance improvements. We also compared the performance with the non-streaming solution. Graph streaming avoids the explosive growth of the agent population and loads only a small portion of a graph, both efficiently using limited memory space.

Thursday, May 26

BRETT BEARDEN

Chair: Dr. Erika Parsons
Candidate: Master of Science in Computer Science & Software Engineering
8:45 A.M.; Online
Project: Redesigning the Virtual Academic Advisor System, Backend Optimizations, and Implementing a Python and Machine Learning Engine

Community College students have admiration of continuing their education at a 4-year college or university. The process of navigating college can be complex, let alone figuring out transfer requirements for individual schools. Assisting students in this process requires special knowledge for specific departments and majors. Lower budgeting colleges do not have funds for additional staff regarding academic advising, and the task gets passed to the teaching faculty. Student academic planning is a time-consuming process that can detract from an instructor’s time needed to focus on their current courses and students. For years, a team of students at the University of Washington Bothell have been working on a Virtual Academic Advisor (VAA) system to automate the process of generating student academic plans in support of Everett Community College (EvCC). The goal of the VAA system is to reduce the amount of time an instructor sits with an individual student during academic advisement. However, the VAA system is not yet complete and there were a few roadblocks preventing it from moving forward. The work proposed in this capstone focusses on redesigning the previous VAA system to remove fundamental flaws in how data is stored related to scheduling academic plans. A new system architecture will be designed allowing to conduct backend optimizations. Cross-language support will give the VAA system the ability to communicate with Python for conducting machine learning research. The proposed work brings the VAA system closer to completion and ready for deployment to support EvCC.

SANA SUSE

Chair: Dr. Clark Olson
Candidate: Master of Science in Computer Science & Software Engineering
1:15 P.M.; Online
Project: Classifying Urban Regions in Satellite Imagery Using the Bag of Words Methodology

Satellite imagery has become more accessible over the years in terms of both availability and in quality, though the analysis of such images has not kept up at the same pace. To investigate the analysis process, this work explores the detection of urban area boundaries from satellite imagery. The ground truth values of these boundaries were collected from the U.S. Census Bureau’s geospatial urban area dataset and were used to train a classification model using the Bag of Words methodology. During training and testing, 1000×1000 pixel patches were used for classification. The resulting classification accuracy was between 85-90% and showed that urban areas were classified with higher confidence than non-urban areas. Most of the sub-images that were classified with a lower confidence are in the transition areas between urban and non-urban areas. In addition to low confidence in classifying these transition areas, these patch sizes are quite large. For this reason, they are not helpful to delineate granular details in the urban area boundaries.

TIANHUI NIE

Chair: Dr. Munehiro Fukuda
Candidate: Master of Science in Computer Science & Software Engineering
3:30 P.M.; Online
Project: Visualization of 2D Continuous Spaces and Trees in MASS Java

MASS is an Agent-Based Modeling (ABM) library. It supports parallelized simulation over a distributed computing cluster. The Place objects in these simulations can be thought of as the environment where agents interact with each other. Places can mimic different data structures to simulate various interaction environments, such as graphs, multi-dimensional arrays, trees, and continuous spaces.

However, the continuous spaces and trees are usually complex for programmers to debug and verify. So, this project will focus on how to visualize these data structures visually. These data structures are available in the MASS library. They can be instantiated at InMASS which enables Java’s JShell interface to execute codes line by line in an interactive fashion. InMASS has also facilitated additional functionalities including checkpoint, and rollback. These functionalities can help programmers to view their simulations better. MASS allows Places and agents to be transferred to the Cytoscape for their visualization. Cytoscape is an open-source network visualization tool initially developed to analyze biomolecular interaction networks. Expanded Cytoscape MASS plugins can build a MASS control panel on the Cytoscape application. It helps users to visualize graphs, continuous spaces, and trees at Cytoscape.

This project successfully realized the visualization of MASS binary trees, quad trees, and 2D continuous spaces with Cytoscape. It also enhanced MASS-Cytoscape integration and optimized the MASS control panel. From this project, these data structure visualizations provide an easier way for other users to learn the MASS library and debug their codes.

Friday, May 27

MARÉ SIELING

Chair: Dr. Munehiro Fukuda
Candidate: Master of Science in Computer Science & Software Engineering
11:00 A.M.; Online
Project: AGENT-BASED DATABASE WITH GIS

Geographic Information Systems (GIS) create, manage, analyse and maps data. These systems are used to find relationships and patterns between different pieces of data in a geographically long distance. GIS data can be extremely large and analysing the data can be laborious while consuming a substantial amount of resources. By distributing the data and processing it in parallel, the system will consume less resources and improve performance.

The Multi-Agent Spatial Simulation (MASS) library applies agent-based modelling to big data analysis over distributed computing nodes through parallelisation. GeoTools is a GIS system that is installed on a single node and processes data on that node. By creating a distributed GIS from GeoTools with the MASS library, results are produced faster and more effectively than traditional GIS systems located on a single node.

This paper discusses the efficacy of coupling GIS and MASS through agents that render fragments of feature data as layers on places, returning the fragments to be combined for a completed image. It also discusses distributing and querying the data, returning results by running a query language (CQL). Image quality is retained when panning and zooming without major loss of performance by rerendering visible sections of the map through agents and parallelisation. Results show that coupling GIS and MASS significantly improves the efficiency and scalability of a GIS system.

LIWEN FAN

Chair: Dr. Kelvin Sung
Candidate: Master of Science in Computer Science & Software Engineering
3:30 P.M.; Online
Project: Realistic Fluid Rendering in Real-Time

Real-time realistic fluid rendering is important because fluid is ubiquitous and can be found in many Computer Generated Imagery (CGI) applications, such as video games and movies. However, realism in fluid rendering can be complex due to the fact that fluid does not have a concrete physical form or shape. There are many existing solutions in modeling the movement and the appearance of fluid. The movement of fluid focuses on simulating motions such as waves, ripples, and dripping. The appearance, or rendering, of fluid aims to reproduce the physical illumination process to include effects including reflection, refraction, and highlights. Since these solutions focus on addressing different aspects of modeling fluid, it is important to clearly understand application requirements when choosing among these.

This project focuses on the appearance, or the rendering, of fluid. We analyze existing solutions in detail and adopt the solution which is most suitable for real-time realistic rendering. With a selected solution, we explore implementation options based on modern graphics hardware. More specifically, we focused on graphics hardware that can be programmed through popular interactive graphical applications for the reasons of supporting interactive modeling, high-level shading language, and fast turnaround debugging cycles. The solution proposed by Van Der Laan et al., in their 2009 I3D research article is the choice of solution for this project. Our analysis shows that their approach is the most suitable because of the real-time performance, high-quality rendered results, and very importantly, provided implementation details.

The graphics system and hardware evaluation led to the Unity game engine. This is our choice of implementation platform due to its friendly interactive 3D functionalities, high-level shading language support, and support for efficient development cycles. In particular, the decision is based on Unity’s support of Scriptable Render Pipeline (SRP) functionality where the details of an image generation process can be highly customized. The SRP offers flexibility with ease of customizing shaders, and control of number of passes in processing the scene geometry for each generated image. In our implementation, the SRP is configured to compute the values to all of the parameters in the fluid model via separate rendering passes.

Our implementation is capable of rendering fluid realistically in real-time, where the users have control over the actual fluid appearance. The delivered system supports two types of simple fluid motion: waves and ripples. The rendered fluid successfully captures effects from the intrinsic color of the fluid under Fresnel reflection, the reflection of environmental elements, and, highlights from the light sources. In addition, to provide users with the full control on the rendered results, a friendly interface is supported. To demonstrate the system, we have configured to showcase our fluid rendering of some common conditions including swimming pool, muddy pond, green algae creek, and colored fluid in a flowery environment.

Wednesday, June 1

YILIN CAI

Chair: Dr. Brent Lagesse
Candidate: Master of Science in Computer Science & Software Engineering
11:00 A.M.; Online
Project: Model Extraction Attacks Effectiveness And Defenses

Machine learning is developing quickly in data industry and many technology companies who have the resources to collect huge datasets and train models are starting to provide services of pre-trained models for profits. The cost of training a good model for business use is expensive because huge training datasets may not be easily accessible and training the model itself requires a lot time and effort. The increased value of a pre-trained model motivates attackers to conduct model extraction attack, which focus on extracting valuable information from the target model or construct a clone close to the target model for free use by only making queries from the victim. The goal of this experiment is exploring the vulnerability of proposed model extraction attacks and evaluating the effectiveness of the attack by comparing the attack results when the victim model and its target datasets are more complex. We first construct datasets for the attacks by making queries to the victim model and some attacks propose to have certain strategies of selecting queries. Then, we execute the attack either by running it from scratch or using existing test framework. We run the attack with different victim models and datasets and compare the attack results. The results show that the attacks which extract information from a model are effective on simpler models but not on more complex models, and the difficulty of making a cheaper clone model will increase and the attacker may need more knowledge besides query info from the victim when the victim model and its target datasets are more complex. Potential defenses and their weakness are also discussed after the experiment.

PRATIK GOSWAMI

Chair: Dr. William Erdly
Candidate: Master of Science in Computer Science & Software Engineering
3:30 P.M.; Online
Project: Virtual Reality based Orthoptics for Binocular Vision Disorders

The Center for Disease Control noted that approximately 6.8% of children under the age of 18 years in the United States are diagnosed with vision problems significant enough to impact learning. Binocular Disorders can lead to headaches, blurry vision, double vision, loss of coordination, fatigue, and the inability to track objects, thereby severely impacting a child’s ability to learn. Without intervention, vision problems can lead to suppression of vision in the affected eye. Vision Therapy or Orthoptics is meant to help individuals recover their eyesight. It aims to retrain the user to achieve Binocular Fusion using therapeutic exercises. Binocular Fusion refers to the phenomenon of perceiving a single fused image when presented with 2 images in each eye. Virtual Reality (VR) shows a lot of potential as an orthoptics medium. VR headsets can isolate the user from the physical world, reduce real world distractions, provide a dichoptic display where each eye can be presented with a different input, and provide a customized therapy experience for the user.

Although several VR applications exist with a focus on orthoptics, clinicians report that these applications fail to strike a balance between therapy and entertainment. These applications can be too entertaining for the user and thus distract them from the therapy goals.

As a part of the EYE Research Group, I have developed 2 applications which when added to the previously developed applications make a VR toolkit to provide vision therapy to individuals diagnosed with Binocular Disorders. Each application in the toolkit focuses on a level of Binocular Fusion. The 2 applications I developed focuses on the third and fourth level of fusion – Sensory Fusion and Motor Fusion. The project has been successfully developed using Unity Game Engine along with the Oculus VR plugin. All decisions about the controls and features have been made after the analysis of the feedback and interview of the therapists at the EYE See Clinic. Key design decisions have also been the outcome of the demonstration and trial of the prototypes at the ACTION Forum 2021. The forum was attended by therapists, students and researchers in the field of orthoptics.

Although the applications have been successfully developed and have been approved by the therapists at the EYE See Clinic, a clinical study is required to test the usability and the effectiveness of the tools as a therapy tool. As of May 16th, 2022, all applications have been successfully developed, tested, and approved by Dr. Alan Pearson, the clinical advisor to the EYE Research Group. A case study was proposed, reviewed and approved by the UW IRB and the UW Human Subjects Division (HSD) board. The results of the study will be beneficial for future research.

FRANZ ANTHONY VARELA

Chair: Dr. Michael Stiber
Candidate: Master of Science in Computer Science & Software Engineering
5:45 P.M.; Online
Thesis: The Effects of Hybrid Neural Networks on Meta-Learning Objectives

Historically, models do not generalize well when they are trained solely on a dataset/task’s objective, despite the plethora of data and computing available in the modern digital era. We propose that this is at least partially because the representations of the model are inflexible when learned in this setting; in this paper, we experiment with a hybrid neural network architecture that has an unsupervised model at its head (the Knowledge Representation module) and a supervised model at its tail (the Task Inference module) with the idea that we can supplement the learning of a set of related tasks with a reusable knowledge base. We analyze the two-part model in the contexts of transfer learning, few-shot learning, and curriculum learning, and train on the MNIST and SVHN datasets. The results of the experiment demonstrate that our architecture on average achieves a similar test accuracy as the E2E baselines, and sometimes marginally better in certain experiments depending on the subnetwork combination.

NHUT PHAN

Chair: Dr. Erika Parsons
Candidate: Master of Science in Computer Science & Software Engineering
3:30 P.M.; Online
Thesis: Deep Learning Methods to Identify Intracranial Hemorrhage Using Tissue Pulsatility Ultrasound Imaging

Traumatic Brain Injury (TBI) is a serious medical condition when a person experiences trauma in the head, resulting in intracranial hemorrhage (bleeding) and potential deformation of head-enclosed anatomical structures. Detecting these abnormalities early is the key to saving lives and improving survival outcomes. Standard methods of detecting intracranial hemorrhage are Computed Tomography (CT) and Magnetic Resonant Imaging (MRI). However, they are not readily available on the battlefield and in low-income settings. A team of researchers from the University of Washington developed a novel ultrasound signal processing technique called Tissue Pulsatility Imaging (TPI) that operates on raw ultrasound data collected using a hand-held tablet-like ultrasound device. This research work aims to build segmentation deep-learning models that take the input TPI data and detect the skull, ventricles, and intracranial hemorrhage in a patient’s head. We employed the U-Net architecture and four of its variants for this purpose. Results show that the proposed methods can segment the brain-enclosing skull and is relatively successful in ventricle detection, while more work is needed to produce a model that can reliably segment intracranial hemorrhage.

Friday, June 3

MONALI KHOBRAGADE

Chair: Dr. Min Chen
Candidate: Master of Science in Computer Science & Software Engineering
8:45 A.M.; Online
Project: EcoTrip Planner – An Android App

The emergence of online travel websites like TripAdvisor, Priceline, Expedia, and KAYAK allowed users to get an experience of booking the accommodation online without any hassle with the agent. Users are no longer waiting in queues to get flight tickets to their favorite destinations. They can also get enough idea about the vacation destination over the online travel websites, which was earlier depended solely on the agent’s guidance. Users can book flights, hotels, and restaurants using these online websites. In short, using online travel websites, they can plan a vacation trip after manually evaluating all the options like price, flight timings and availability, hotel location, food options, and nearby locations to checkout. However, a recent study indicates that abundant options available in online travel agencies are overwhelming to users. The main challenge is that these online travel websites do not provide a holistic trip plan including flight and hotel accommodation under the user’s budget. In this paper, we intend to provide a trip plan with flight travel and hotel stay suggestions under the user’s given budget by using personalized factors and analyzing user experience. The aim of this project is to develop an android mobile application that will help users plan trips under a given budget and help fight information overload. Our approach in this application asks users about the vacation destination and the budget amount they can afford. It also asks users about their preferred hotel location, hotel stars, and ratings. It then analyzes the budget and uses heuristic models and natural language processing to recommend the best available travel and lodging. For travel, it suggests the round-trip plan from current location to destination, and for hotels, it suggests the top 3 hotels with a personalized user experience. This system also extracts the top 5 keywords from the hotel reviews. These keywords allow users to get an overall idea about the hotel. Our approach in this android application will help users to plan the trip including flight travel and hotel accommodation in minutes.

WILLIAM OTTO THOMAS

Chair: Dr. Erika Parsons
Candidate: Master of Science in Computer Science & Software Engineering
1:15 P.M.; Online
Thesis: Human Cranium, Brain Ventricle and Blood Detection Using Machine Learning on Ultrasound Data

Any head related injury can be very serious and may be classified as a traumatic brain injury (TBI), which can be a result of intracranial hemorrhaging. TBI is one of the most common injuries in or around a battlefield, which can be caused by both direct and indirect impacts. While assessing a brain injury in a well-equipped hospital is typically a trivial task, the same cannot be said about a TBI assessment in a non-hospital environment. Typically, a computer tomography (CT) machine is used to diagnose TBI. However, this project demonstrates the use of ultrasound and how it can be used to predict where skull, ventricles, and bleeding occur. The Pulsatility Research Group at the University of Washington has conducted three years of data collection and research to create a procedure that diagnoses TBI in a field situation. In this paper, machine learning methodologies will be used to predict these CT derived features. The result of this research shows that with adequate data and collection methods skull, ventricles, and potentially blood can be detected while applying machine learning to ultrasound obtained data.

WINTER 2022

Thursday, March 3

FANG-CHUN LIN

Chair: Dr. Kelvin Sung
Candidate: Master of Science in Computer Science & Software Engineering
1:15 P.M.; Online
Project: A Location-aware Grocery List Application

People are increasingly interested in fast and easy shopping at the supermarket. However, shopping for groceries can be a complex and stressful process that involves identifying, selecting, and purchasing required items for sustaining everyday lives. The grocery list is one of the most common solutions that assists in carrying out these activities. However, the task of creating and managing the lists for grocery shopping is often overlooked where the efforts and time spent are typically unseen and unrecognized. This study aims to bridge the gap by designing and developing a modern shopping list application that facilitates the process of creating and managing shopping lists for busy workers and assists them in locating products at nearby stores.

Existing shopping list applications lack an effective way to map shopping lists written in natural language to actual products in supermarkets. In addition, most mobile shopping assistants with search functionality rely on product information manually entered by the retailers and thus the recommended product lists are specific with limited options. It can be inconvenient and time-consuming for grocery shoppers who are in a hurry to locate specific products, especially when they are not familiar with the nearby stores.

To address these issues, we designed a location-aware shopping list application that can locate products from nearby stores. With the API services and website information from supermarkets, it becomes possible to provide users with the option to choose from all the products available online. Details of the relevant products are displayed in the search results, along with a navigation map showing all the nearby stores that carry the products. Additionally, once selected, when the product is available in a nearby store, a notification will be sent to the user. To streamline product selection process, our application supports ranking the product list based on the purchase history of the user.

Our implementation began with a proposed user story for typical grocery shopping, followed by a derived system specification to efficiently support the hypothetical shopper. We then designed and developed a multi-tier system to prototype the modern shopping list application based on the specified requirements. The evaluation results illustrated the completeness of the prototype system, including grocery list management, navigation map and location-aware notification. The results from a small-scale study showed that the personalized search ranking system achieved its initial success in integrating user preferences and the specified items in recommending personalized and appropriate products for different users. The results from our study contributed to the understanding of system and user interface requirements of a shopping list application. Our project and results can serve as an effective reference for developers and researchers in the field when developing similar applications.

Friday, March 4

RAHIL MEHTA

Chair: Dr. Dong Si
Candidate: Master of Science in Computer Science & Software Engineering
3:30 P.M.; Online
Project: CT Metal Artifact Reduction using Unpaired Image-to-Image Translation

Computed tomography (CT) scans are a common diagnostic technique in medicine, used for the management of a range of conditions. One factor that can degrade the quality of CT scans is the presence of metal implants in the patient’s body. The presence of metal can cause streaks or bright spots on the image, which are known as artifacts. Metal artifacts can make it more difficult for doctors to interpret an image, potentially impacting the quality of a patient’s care. The traditional mathematical methods for reducing artifacts are limited in their effectiveness and can produce undesirable secondary artifacts. In recent years, researchers have been applying machine learning techniques such as convolutional neural networks and generative adversarial networks (GAN) for CT metal artifact reduction and have had better results. The task of removing artifacts can be understood as translating images from one domain to another. The goal of this project is to apply the machine learning technique of contrastive unpaired translation to metal artifact reduction and explore changes to the network architecture. We used the SpineWeb and DuDoNet datasets to evaluate the effectiveness of our method. The results show that CUT can effectively eliminate most metal artifacts and it was more effective at removing or reducing certain types of metal artifacts than CycleGAN and DualGAN. We explored the addition of the Convolutional Block Attention Module and found an improvement of greater than 10% for color images from the SpineWeb dataset, based on the Frechet Inception Distance and Kernel Inception Distance. Areas for future work include training on a larger dataset, obtaining a greater diversity of data, testing a greater number of training parameters, and exploring more changes to the network architecture.

Monday, March 7

AFROOZ RAHMATI

Chair: Dr. Afra Mashhadi
Candidate: Master of Science in Computer Science & Software Engineering
1:15 P.M.; Online
Project: Sound classification using Deep Embedded Clustering and Federated Learning

Applications of machine learning have an opportunity to positively impact a variety of fields. Recent work in digital health applications have demonstrated how ML can be leveraged to improve understanding of human health for both populations and individuals; however, there are many challenges that need to be addressed. Federated Learning has been adopted to remove the data pooling requirement for developing AI-models, but the majority of research in this domain focuses on cross-silo applications using patient data from multiple clinical institutions. Research evidence in cross-device applications has been rare though. Such research would enable researchers to build models based on a more diverse dataset rather than developing models that are biased by the patient populations of clinical institutions. In this project, we present an end-to-end system for cross-device FL in identifying abnormal heartbeat sounds. We posit a fully unsupervised learning model based on LSTM-Autoencoder and Deep Embedded Clustering for detecting heartbeat biomarkers based on audio recordings collected through smartphone and digital-stethoscopes. We evaluate the performance of our model in comparison with the existing benchmark algorithms and report its competitive performance despite its comparatively light architecture. We show that our model is able to learn to distinguish normal and abnormal heart sounds under the FL setting, achieving 97% accuracy on the PhysioNet Heart Dataset. We validate the feasibility of our approach in terms of energy, memory, and computation power on the ordinary smartphones.

Tuesday, March 8

DIEM TO

Chair: Dr. Dong Si
Candidate: Master of Science in Computer Science & Software Engineering
8:45 A.M.; Online
Thesis: Traveler’s Next Activity Predication with Location-Based Social Network Data

The rise of technology and the internet provides powerful means for people from all around the world to communicate and connect with one another. Online social network platforms become go-to places for users to express and share their individuality, which includes choice of activities, locations and associated timestamps. In turn, their opinions affect the point of view of others, who are in their online friendship circle. Users’ increasing usage of social networks help accumulate massive amounts of data that can be further explored. Particularly, this type of data attracts and allows researchers, who are interested in studying and understanding how social factors and previous experience influence user behavior in terms of activity-related travel choice. In this paper, the goal is to utilize such rich data sources to build a model that predicts user next activity. Such model contributes a powerful tool for integrating the location prediction with transportation planning and operations processes. Besides, it is valuable in commercial applications to create a better recommendation system with higher accuracy and ultimately attract more customers to partnering businesses. By studying the dataset, which contains millions of historical check-ins from thousands of users, it is possible to derive information that is useful in predicting user next activity. The proposed approach applies machine learning techniques on the collected features to deliver highly accurate prediction results with fast training and prediction time.

SAYALI KUDALE

Chair: Dr. Hazeline Asuncion
Candidate: Master of Science in Computer Science & Software Engineering
11:00 A.M.; Online
Project: Security Patterns Discovery to Mitigate Vulnerabilities

In the IT security industry, vulnerabilities in software are a significant concern, as malicious hackers can often exploit these weaknesses for unethical reasons. Identifying and fixing software vulnerabilities early in the development process can reduce costs and prevent reputational damage and litigation. The one way to address these security vulnerabilities is to use security patterns during the early phases of the software lifecycle; however, software developers who understand the design and implementation of software features and functionalities are often not cybersecurity experts, so it is difficult to choose an appropriate security pattern manually from the vast security pattern catalog. Moreover, the amount of work on vulnerability prediction is substantial, but little has been done on security pattern prediction for a vulnerability.

In order to address identified security vulnerabilities, this study proposes a new approach for predicting security patterns using extracting keywords and text similarity techniques. We have worked on three datasets by parsing the public websites and technical documentation: 1. The security patterns. 2. The common weakness enumeration (CWE) vulnerabilities. 3. Open-source repositories CWE vulnerabilities and associated GitHub code fix commit messages. The Security Pattern Discovery to Mitigate Vulnerability (SPDMV) algorithm was executed on these datasets, and the mapping of CWE and security patterns were obtained.

The ground truth data is generated manually by assignment security patterns as the solution to the CWE software development categories and reviewed by experts. To assess SPDMV, we compared two keyword extraction techniques for each vulnerability category – MALLET topic modeling and Rapid Automatic Keyword Extraction (RAKE). The evaluation results indicate that the SPDMV algorithm can recommend security patterns for the most frequently occurring CWE vulnerabilities using the Rake keyword extraction approach by attaining 70% average precision. In the future, studies by including the data of other vulnerability sources such as the Open Web Application Security Project (OWASP) may improve the performance.

Wednesday, March 9

CRAIG RAINEY

Chair: Dr. Min Chen
Candidate: Master of Science in Computer Science & Software Engineering
11:00 A.M.; Online
Project: Algorithmic Stock Trading Framework

Well-funded hedge funds and banks have taken advantage of computerized stock trading as early as the 1960s. Recently, personal computers, infrastructure, and data have become accessible for retail traders. These tools allow traders to develop and build their own algorithmic trading strategies based on a variety of data sources like market prices, sentiment, or news. Automated trading strategies can provide an edge over humans, but they require time and effort to develop and monitor. The purpose of this project was to implement a fast and scalable framework that supports multiple algorithmic trading strategies. I created two strategies: one was a rule-based momentum strategy, and the other was an AI-driven strategy that combines market and sentiment data. The rule-based momentum strategy used several technical indicators to define profitable entry and exit criteria over time. For the AI-driven strategy, technical indicators derived from market price data and sentiment data extracted from Tweets were used to train a machine learning model on how to profit from trading stocks. Then, I created a framework that enabled the automation of these algorithmic trading strategies by streaming real time data and integrating with a stockbroker API to manage order and accounts.

Thursday, March 10

SEETU AGARWAL

Chair: Dr. Yang Peng
Candidate: Master of Science in Computer Science & Software Engineering
1:15 P.M.; Online
Project: Accelerated Inference on Mobile Devices via Adaptive Model Selection

With the development of model compression, model selection, and other inference acceleration techniques, more complex Deep Neural Network (DNN) models can run on various resource-constrained mobile devices. To achieve a satisfactory user experience, DNN models must be adaptively selected for the hardware characteristics of mobile devices to balance important performance metrics such as accuracy, latency, and power consumption. State-of­ the-art methods select the best model based on image features captured by mobile devices or contextual and user feedback information. This research work designs a novel framework that comprehensively considers image features, mobile contextual information, and user feed­ back for selecting the best DNN model for inference on mobile devices. The framework first utilizes a series of KNN models running on edge servers to filter out a suitable subset of models based on image features. After obtaining this subset, the mobile device selects the best model for the current context using a model selection algorithm, which uses contextual information such as ambient brightness, battery level, CPU temperature, and DNN accuracy and latency. This algorithm continuously improves the Quality of Experience (QoE) through reinforcement learning. The proposed solution has been evaluated through the image classification task using the ImageNet ILSVRC 2012 validation dataset. Experimental results show that our method achieves 79.8% top-1 accuracy and 96.1% top-5 accuracy, which is higher than most accurate single DNN models. Its average inference time (1.48 s) is also much shorter than most of the individual DNN models. Additionally, the proposed solution achieves an average QoE of 0.5862, which is the highest in comparison with Mobilenet (0.4423), Mobilenet-V2 (0.5123) and Inception-V3 (0.5523).

Friday, March 11

YASHASWINI JAYASHANKAR

Chair: Dr. Hazeline Asuncion
Candidate: Master of Science in Computer Science & Software Engineering
8:45 A.M.; Online
Project: Parallelizing LDA-GA (Latent Dirichlet Allocation – Genetic Algorithm) for Data Provenance Reconstruction

On the Internet, data can be created, copied, modified, and deleted easily, making it hard to rely on the authenticity of information sources and confirm their reliability. Therefore, it is necessary to reconstruct data provenance in the absence of previously documented provenance information. The Provenance-Reconstruction approach proposed by the “Provenance and Traceability Research Group”, based on the Latent Dirichlet Allocation Genetic Algorithm (LDA-GA), which uses a Mallet library, was implemented in Java and achieved satisfactory results when applied to small datasets. As a result of the increase in datasets, performance degraded. To improve accuracy and performance, the GALDAR-C++, a Multi-Library Extensible Solution for Topic Modeling in C++, was developed. As compared to a Java implementation, this solution using WarpLDA offered satisfactory results.

Parallel computing allows code to be executed more efficiently, saving time and money while sorting through ‘big data’ faster than ever before. This project aims to apply a parallel computing strategy, Message Passing Interface (MPI), on both the Java and C++ versions of code by parallelizing the LDA calls in each generation of the LDA Genetic algorithm. Both the implementations have performance improvement as compared to their respective serial implementations. The performance improvement of original C++ to Parallel C++ versions varies between 10% and 64% depending on input size. Similarly, when the original C++ was compared to the parallel Java version, it gave performance improvement by 35% and 78%, depending on the input size. As a whole, for bigger data sets, parallel C++ provides the best results, approximately 2x speed up, while keeping the same accuracy. In the future, studies using large datasets on provenance reconstruction may find this to be a feasible solution.

AUTUMN 2021

Thursday, December 2

APOORVA BHATNAGAR

Chair: Dr. Min Chen
Candidate: Master of Science in Computer Science & Software Engineering
1:15 P.M.; Online
Project: GIF Image Descriptor

Social media platforms feature short animations known as GIFs, but they are inaccessible to people with vision impairments. Such individuals rely heavily on accessibility tools such as screen readers to help them understand the context of an image. In this paper, we present a project that aims to improve the accessibility of web pages by auto-injecting machine-generated but accurate commentaries of the GIF image content into the alt text tag of the image on the web. We use machine learning and web browser extension to create a software system, the “GIF Image Descriptor,” to solve an often-overlooked issue: web accessibility for non-static images. This system uses a CNN-LSTM architecture to generate descriptive texts for GIF images because CNN prospers at encoding images and videos, and LSTM works well with sequence generation. We examine two very popular model architectures of 2D CNNs and 3D CNNs for generating our first neural network, and settle for a hybrid 2D CNN model that can take multiple frames of a single image to create vector embeddings, which then become the input to our LSTM neural network. This approach gives us substantial improvement in accuracy metrics such as BLEU (7% improvement), ROUGE (6% improvement), and METEOR (10% improvement) when compared to existing TGIF model that generates captions for GIF images. A usability study performed with a focus group of individuals with and without vision disabilities further proves that the system performs well for its targeted audience.

Friday, December 3

PINKI PATEL

Chair: Dr. Min Chen
Candidate: Master of Science in Computer Science & Software Engineering
11:00 A.M.; Online
Project: Yoga Pose Correction and Classification

Yoga is an ancient physical science that originated in India over 5,000 years ago. It has been popularized in the West due its various benefits. A lot of people are participating in performing yoga by themselves through watching TV or videos. However, it is not easy for novice people to find incorrect parts of their Yoga poses by themselves. Therefore, in this paper we are introducing a web application, YogaAndPoses, which provides two-fold benefits to users: Yoga Pose Correction and Yoga Pose Classification.

The goal of Yoga Pose Correction is to use pose estimation technology and allow a person to practice different yoga poses using their webcams and receive feedback on their yoga poses. Since Pose Estimation is a well explored area in Computer Vision and Deep Learning, we are leveraging the public knowledge and using it for our application. Our Yoga Detection uses CMU’s open-source pose estimator OpenPose as a pre-processing module in order to detect the joints in the human body and extract their keypoints. We use these keypoints to calculate the angle difference between the yoga pose of an instructor/expert and a novice performing yoga and suggest the correction if the angle difference is larger than the given threshold. For evaluations, we have applied the Yoga Pose Detection to three people and confirmed that it found the incorrect parts in the yoga pose.

We are introducing Yoga Pose Classification that classifies 82 Yoga Poses which are very challenging in terms of viewpoints of yoga poses. Our yoga pose classification allows a user to upload an image of a yoga pose or capture a yoga pose using the user’s web camera and classify the yoga pose using the DenseNet-201 pretrained model. Before sending an image to DenseNet-201, we perform various pre-processing steps on the image such as resizing, augmentation, segmentation and converting the image to RGB if it is a grayscale image. We have obtained results of 64% for top 1 accuracy and 78% for top 3 accuracy for 82 yoga poses where others’ state of the art yoga pose classifier was able to achieve similar accuracy with maximum of 20 yoga poses.

Monday, December 6

SUKRITI TIWARI

Chair: Dr. David Socha
Candidate: Master of Science in Computer Science & Software Engineering
3:30 P.M.; Online
Project: Art Website: UX Design and Development

The aim of this undertaking is to design and develop an art website for an individual artist – the author’s mother – Mrs. Kavita Tiwari. The website will act as an online portfolio, help showcase her skills and advertise her offerings. Artists often find it difficult to market their products as they are engrossed in perfecting their skills and lack the necessary marketing prowess. The intention of creating a website is to take a concrete step towards becoming an established presence online for streamlined sales.

The methods opted for reaching the goal of a full-fledged artist website include determining the scope of the project through conducting semi-structured user interviews and competitive analysis of existing websites, identifying and segregating the types of users of the website, understanding the user’s needs, selecting features to be implemented on the website, accordingly, designing and creating a prototype using Figma, and finally developing and testing the website. The author wishes to use this opportunity to help her with sales as well as learn full-stack web development.

Tuesday, December 7

TEJASWINI MADAM

Chair: Dr. Min Chen
Candidate: Master of Science in Computer Science & Software Engineering
8:45 A.M.; Online
Project: MealFit – Health Monitoring Mobile Application

Obesity is one of the major problems many people are facing today. There has been a rapid increase in dietary ailments during the last few decades caused by unhealthy food routine. Mobile based dietary assessment systems that can record meal consumption and physical activities can be very handy and would improve dietary habits. This paper proposes a novel system that allows users to capture images of the meal consumed and upload them into the mobile application. The mobile application uses a pre-trained Convulational neural network model, MobileNet to classify the meal images. In order to improve the accuracy, pre-processing has been performed using Keras image data generator, which takes a batch of images and applies random transformation to each image in the batch. In this way multiple copies of the images in different parameters would be generated for the training process. Users can monitor consumption details via mobile application and receive regular alerts on the percentage of calories consumed with respect to the assigned daily calorie limit. Additional features to maintain the daily calorie consumption, such as access to different levels of exercises, nutrition tips and calendar modules, are developed in order to motivate the users. The experimental results demonstrate that the application is able to recognize the food items accurately with over 87% validation accuracy. The application is user friendly and is able to generate meaningful notifications according to the usability studies, which will benefit the user with a clear insight of healthy dietary and guide their daily consumption to improve body health and wellness.

Friday, December 10

CARLA COLAIANNE

Chair: Dr. Erika Parsons
Candidate: Master of Science in Computer Science & Software Engineering
1:15 P.M.; Online
Project: Developing Autonomous Mining Through a Simulation and Reinforcement Learning

Fully autonomous mining could provide many opportunities to safely and efficiently mine materials on earth and in extraterrestrial environments. Due to the complexity of autonomous mining, having a method to test out various solutions rapidly and safely is beneficial. This leads to the development of simulations that accurately represent the real excavator and the environment it is interacting with. In addition to using simulations, reinforcement learning is considered a promising application for developing autonomous algorithms for the complex situation of mining material. Reinforcement learning provides the key advantages of being able to interact with and learn from a changing environment. This project creates a simulation to model a robotic excavator and its interaction with mining lunar simulant soil. It then uses reinforcement learning to create an autonomous mining algorithm capable of reaching a certain depth in the soil and producing motions that can overcome any soil resistance the excavator may face.

Back to top

Master of Science in Cybersecurity Engineering

Summer 2023

Thursday, July 27

SETH DON-HAO PHAM

Chair: Dr. Marc Dupuis
Candidate: Master of Science in Cybersecurity Engineering
1:15 P.M.; Join Seth Don-Hao Pham’s online defense
Project: Evaluating Player Engagement in a Choose-Your-Own-Adventure Game Illustrating Personal Cybersecurity Awareness

The professional environment has seen great success in adapting serious games to raise cybersecurity awareness and skills in the workplace. These games provide scenario-driven experiences allowing players to explore and interact with cybersecurity skills without real-world consequences. Enterprise training requirements ensure employees engage with the games, a function not present for personal cybersecurity, leading the average person to not engage with this type of game in their free time. With an organically engaging game, the integration of cybersecurity scenarios can be introduced in an inviting context to the casual player, leading to higher engagement in cybersecurity awareness. This project evaluates the effectiveness of a cybersecurity game designed to entertain and engage players while increasing their cybersecurity awareness. Based on the feedback from an initial test group, three core concepts were critical for player engagement and enjoyment: an easy-to-handle UI; a fun, exciting story; and player text-length preference. The survey evaluated player preferences and the effect of their evaluation on the game. In addition, participants evaluated the game’s effectiveness based on the framework used in the previous study.

CLAIRE ANNA JENNINGS

Chair: Dr. Marc Dupuis
Candidate: Master of Science in Cybersecurity Engineering
3:30 P.M.; Join Claire Anna Jennings’ online defense
Project: Developing an Entertaining Choose-Your-Own-Adventure Game Illustrating Personal Cybersecurity Awareness

Cybersecurity awareness and education improvements in professional settings substantially increased with the development of serious cybersecurity games. These games engage interactively with the player to teach awareness and skills around cybersecurity and show higher engagement rates over other types of corporate training. These games primarily train, not entertain, and the average person chooses entertainment over voluntarily playing a serious game. While 93% of American adults use the internet and 72% use social media, most Americans approach cybersecurity with fear, confusion, or apathy, resulting in a reluctance to find training for personal cybersecurity awareness and education. This project combines entertainment and cybersecurity awareness by using a popular Hollywood storytelling approach, Save the Cat, with cybersecurity lessons to create an entertaining useful game. Iterative development, informed by user studies, ensures the game maintains a “fun” factor while improving the player’s cybersecurity awareness. Integrating cybersecurity knowledge into stories, with the primary goal of entertaining, allows the average American adult to improve their personal cybersecurity through a positive experience. Based on project results, not all useful games need to be serious games, and the average person does not need to seek cybersecurity knowledge to gain awareness.

Friday, August 11

HARSHAVARDHAN KAKARLA

Chair: Dr. Yang Peng
Candidate: Master of Science in Cybersecurity Engineering
5:45 P.M.; Join Harshavardhan Kakarla’s online defense
Project: Quick Connection/Handoff In An Opportunistic Vehicular Edge Computing Environment

The rise of connected vehicles has led to an explosion of data generated by vehicular networks. However, transmitting this data to centralized cloud servers can result in high latency and network congestion. Vehicular Edge Computing (VEC) presents a promising solution by offloading data processing to edge servers situated in close proximity to vehicles. This project introduces a VEC project that focuses on optimizing data offloading in connected vehicles, with a particular emphasis on quick connection and seamless handoff to ensure efficient edge computing in opportunistic environments.

The objective of this project is to design and implement a VEC framework that facilitates rapid data connection between connected vehicles and edge servers. The proposed system employs intelligent context-aware decision-making algorithm to dynamically choose edge servers based on network conditions, performance parameters, and vehicle proximity. By adopting this approach, the project aims to decrease data transmission time, reduce handoff delays, and enhance overall data processing efficiency, contributing to improved performance in opportunistic vehicular edge computing environments.

The project leverages Internet of Things (IoT) communication protocols, including MQTT, to establish real-time connections between the client, cloud service, and edge servers. Multiple algorithms are used to optimize edge server selection for seamless handoffs. Android devices and ESP32 microcontroller modules act as clients and edge servers, while AWS IoT Core and DynamoDB serve as cloud services respectively. The implementation involves Java for Android application development and C++ for Arduino IDE programming.

Comprehensive experimentation and testing of the VEC framework have been conducted by downloading the APK to multiple android devices which were used as clients and ESP32 microcontroller as the server. The results showcase significant improvements in connection and handoff delays. The system demonstrates exceptional performance in managing varying network conditions and ensuring seamless data processing at edge servers, enhancing the overall efficiency of connected vehicles.

The project’s findings highlight the effectiveness of Vehicular Edge Computing in addressing the challenges of connection handoffs in opportunistic environments. By optimizing data connection and enabling seamless handoff, the VEC framework contributes to faster data processing, reduced latency, and enhanced overall network efficiency. The project’s emphasis on quick connection and handoff in an opportunistic setting underscores the potential of edge computing to cater to the dynamic nature of vehicular networks, making it a valuable contribution to the field of connected vehicle technology.

Future endeavours focus on extending the VEC framework to accommodate a larger number of connected vehicles and edge servers, enabling scalability for city-wide smart transportation applications. Additionally, the integration of advanced handoff algorithms and context-aware decision-making techniques could further enhance the system’s performance and adaptability in opportunistic environments. Conducting field trials with live vehicular data would validate the framework’s effectiveness in real-world scenarios and provide insights into its practical deployment.

Spring 2023

Friday, May 26

NEIL PRAKASAM

Chair: Dr. Brent Lagesse
Candidate: Master of Science in Cybersecurity Engineering
8:45 A.M.; Online
Thesis: A System for Secure and Categorized Video-Sharing

Online video sharing is a phenomenon which continues to be increasingly utilized by the entire population. Preserving the privacy of videos shared online is of utmost importance, but there is one use case that hasn’t yet been covered by current mainstream video sharing platforms. This project aims to provide the ability to categorize whether multiple videos are of the same event, so that users can share them only amongst others who were also present at the event and have video evidence. The main method of categorization will be through DNA sequencing, where video files will be converted into literal DNA in order to be categorized into 4 categories. This includes those that are of the same event, space, activity, or are completely different videos. The research has shown promising results that can be further optimized to categorize videos between the 4 categories, let alone whether or not they are of the same event.

NIHARIKA JAIN

Chair: Dr. Brent Lagesse
Candidate: Master of Science in Cybersecurity Engineering
11:00 A.M.; Online
Project: FortifyML: Machine Learning Security Recommender for Everyone

Deep Neural Networks (DNN) models have achieved remarkable performance in various applications, ranging from language translation to autonomous vehicles. However, studies have shown that DNN models are vulnerable to adversarial attacks, wherein malicious inputs are carefully crafted to deceive the models. Adversarial attacks pose a significant threat to the reliability and security of DNN models, especially in critical applications such as robotics, finance, text-to-speech, healthcare, and even national security. The number of research publications focused on adversarial attacks and defenses, including the sophistication of approaches has grown immensely since the first such publication in 2013. Even with an abundance of research papers on adversarial attacks, there is a lack of tools or systems that can coherently and systematically align a researcher or user with the specific defenses that could strengthen their individual use case, more so for beginners in the machine learning domain. In this paper, we extended FortifyML, an existing machine learning security recommender for everyone. We have accomplished the following with this project: 1) Successfully extended the recommender system to support DNN models in the Natural Language Processing (NLP) domain, making it a valuable tool for researchers and practitioners in the field of machine learning. 2) Simplified the user interface to make the system accessible to everyone, including beginners. 3) Added suggested links to articles or academic papers to direct users to additional details regarding potential attacks or mitigation strategies. 4) Recommendations made by the system are based on real-world statistics collected by running actual attacks and defenses in contained environments and can act as guidelines out of the box. As a result, FortifyML will help guide machine learning engineers and practitioners secure the models and their applications without the need for explicit security knowledge.

Tuesday, May 30

SANGYOON JIN

Chair: Dr. Marc Dupuis
Candidate: Master of Science in Cybersecurity Engineering
11:00 A.M.; Online
Project: A Study on the Password Usage Behavior of Online Users

This project aims to measure online users’ password usage behavior and examine the relationship between it and its antecedent factors based on Protection Motivation Theory (PMT). PMT is a representative theory that explains the process of changing protection motivation according to threat messages in the health science field and has been extended to the area of information security. This project uses PMT to explain how motivation for password usage behavior is formed against the threat of password compromise. While previous studies applying PMT have observed its relevance concerning protective behavioral intentions, such as the intention to comply with information security guidelines, this project focuses on the relevance concerning password usage behavior in terms of password security strength.

The Qualtrics survey platform and Amazon Mechanical Turk are used to create and distribute a survey. In addition, the survey uses the Rockyou.txt file, which contains password usage behaviors of past online users. The result suggests that different password usage behaviors are identified according to the characteristics of each user. In addition, multiple regression analysis derives some relationship between the PMT model and password usage behavior. At the same time, we found that the explanatory power of the antecedents can be enhanced in an extended PMT model that also considers the information security climate of the organization to which the online users belong. These findings suggest the need to consider new research models for future research in the field of password-based information security. Furthermore, these results can contribute to providing customized password policies to organizations that ultimately need to improve information security.

PAUL BEARD

Chair: Dr. Brent Lagesse
Candidate: Master of Science in Cybersecurity Engineering
1:15 P.M.; Online
Project: Two Factor Message Authentication for Entry/Exit Operations During Autonomous Vehicle Platooning

As the use of autonomous vehicles becomes more prevalent, ensuring secure and reliable communication between the vehicles is crucial. One important aspect of this communication is message authentication during the docking and undocking process, which involves verifying the identity of the vehicles so that the origin of the message can be established.

An evolution of that autonomy involves vehicular operations know as platooning. This transit method involves multiple autonomous vehicles that are connected, either logically or physically, and behaving as a single unit. This capstone paper will discuss available methods to securely communicate during the entry and exit functions of those platooning operations. A vulnerable period during the platooning process occurs when a vehicle enters and exits the platoon.

The performance of various authentication methods has been analyzed based on security, computational complexity, and communication overhead. Additionally, the implementation feasibility of each method has been assessed for the docking/undocking process.

Overall, this paper will contribute to the body of knowledge on secure message authentication in autonomous vehicles and provide insights into the best practices for ensuring secure and trustworthy communication between autonomous vehicles during the docking and undocking process. Ultimately, this will help ensure the safety and security of autonomous vehicles and their passengers.

Thursday, June 1

ADITYA SIDDALINGASWAMY

Chair: Dr. Erika Parsons
Candidate: Master of Science in Cybersecurity Engineering
11:00 A.M.; Online
Project: Cybersecurity Framework for an Edge Computing Medical Application for Stroke Patient Rehabilitation

This project aims to design and develop a cybersecurity framework for an Edge Computing ecosystem used in a medical setting. In the scope of this project, the focus is a medical application for the rehabilitation of stroke patients. Such patients often experience spatial neglect, a condition that significantly affects their functional recovery and quality of life, making rehabilitation crucial. This work is part of a larger project to make use of the aforementioned Edge Computing ecosystem, which in the long term, is geared to make the rehabilitation experience more enjoyable for the patients while collecting data to help medical providers monitor patient progress and design individualized treatment plans. The design of the ecosystem is based on technologies such as Edge Computing, Cloud Computing, IoT, Kubernetes, and, from a medical standpoint, Electroencephalography. The use of all these technologies, used particularly in a medical environment, means that it is of the utmost importance to address cybersecurity risks to ensure patient data security and privacy. The project’s goal is to create a strong cybersecurity framework that protects patient data from unauthorized access and prevents data breaches while promoting collaboration among healthcare providers and technology experts. The project focused on studying the current importance of cybersecurity in the medical industry and the potential applications of edge computing, the importance of collaboration, and teamwork in developing technological solutions. By achieving the cybersecurity work objectives, the project has the potential to enable current and future efforts to improve the quality of stroke patient rehabilitation methods.

Friday, June 2

MATT DIOSO

Chair: Dr. Brent Lagesse
Candidate: Master of Science in Cybersecurity Engineering
1:15 P.M.; Online
Project: CSI: Channel State Investigation, A Device Localization System based on Physical Layer Properties

Hidden streaming devices are becoming a more widespread issue as these types of devices become smaller and more accessible. Existing methods for localizing these devices in an environment require a user to traverse the area of interest while monitoring network traffic to draw correlation between digital spikes and physical location. These methods state a localization time ranging from five to 30 minutes depending on the size of the environment and the number of reference points throughout the area.

This work presents a system that greatly reduces this localization time and removing the need for the user to traverse an entire area, thus enabling detection in a wider variety of locations and situations. The use of RGB images to determine environment information from depth images provides the bounds in which the streaming device can be located. Localization time is greatly reduced by leveraging Channel State Information (CSI), a physical layer characteristic of transmitted signals, which has been proven to be more temporally stable than the RSSI value and provides richer, fine-grained data to learn position from. The results from this work show the following:

• Localization precision within 1.9m of device’s true location
• 0.98 F1 score with 0.98 recall and precision
• Removed physical requirement for users to traverse an area for localization efforts
• Localization estimation time greatly reduced from 5 – 30 minutes down to 30 seconds

BALAPRASANTH RAMISETTY

Chair: Dr. Marc Dupuis
Candidate: Master of Science in Cybersecurity Engineering
1:15 P.M.; Online
Project: Developing individual Awareness on Phishing Towards Mitigating Increased Cases of Email Phishing

In today’s digital landscape, safeguarding our online safety and security is of utmost importance. This capstone report delves into the issue of phishing attempts, specifically focusing on email phishing, and explores effective measures to prevent and mitigate their impact. To gather insights, a comprehensive questionnaire was administered using the user-friendly Qualtrics survey platform. Participants were engaged with an embedded awareness video and provided valuable feedback and perspectives. The findings highlight the widespread occurrence of phishing attempts and underscore the significance of understanding their characteristics, identifying suspicious elements in emails, and recognizing different types of phishing attacks. Education and awareness emerge as critical factors in empowering individuals to effectively combat phishing attempts. The research findings contribute to the existing body of knowledge on phishing prevention, offering practical recommendations for individuals and organizations to bolster their resilience. By leveraging the Qualtrics platform and incorporating an awareness video, the survey methodology comprehensively captures participants’ perspectives, providing a deeper understanding of email phishing. This capstone report serves as a valuable resource for individuals, organizations, and security professionals seeking to tackle the persistent threat of phishing attacks. It presents insights, trends, strategies, and preventive measures to safeguard personal and sensitive information.

Winter 2023

Thursday, February 28

VINCENT SCHIARELLI

Chair: Dr. Marc Dupuis
Candidate: Master of Science in Cybersecurity Engineering
3:30 P.M.; Online
Project: Evaluating the Public Perception of a Blockchain-Based Election

The concept of voter confidence was introduced into the political domain after the contentious recount of the 2000 United States presidential election results in Florida. Twenty years after this election, the concept of voter confidence has made headlines again as record low number of voters express confidence that votes will be accurately cast and counted nationwide. Even in the absence of specific security concerns regarding vote tabulation, the low voter confidence elicited by our existing voting infrastructure has impacts to our democratic institutions. As an alternative to existing voting infrastructure, some have proposed incorporating blockchain solutions into electoral systems. While blockchain could add additional transparency through mechanisms such as the public ledger and decentralized accounting, blockchain’s impact to voter confidence may not be straightforward. This project seeks to evaluate the public’s confidence in the ability of a blockchain-based voting system to fairly and accurately tabulate votes. In order to measure this confidence, the Technology Acceptance Model was leveraged in order to quantify the relationships between individuals and their perception of blockchain technology. A between groups experiment was performed in order to measure these relationships.

Thursday, March 2

CAROLYNE SIBOE

Chair: Dr. Geethapriya Thamilarasu
Candidate: Master of Science in Cybersecurity Engineering
8:45 A.M.; Online
Project: Towards Zero Trust Model Using Software Defined Perimeter in 5G Based IoT Networks

Internet of things (IoT) has emerged as one of the significant technologies in recent years, with the vision of providing ubiquitous connectivity to devices, things, and people ‘anytime’ and ‘anywhere’. This increased connectivity of many devices generates massive volumes of data requiring high bandwidth. The evolution of fifth generation cellular networking technology (5G) networks with their high throughput, extended coverage, reliable communication, and lower latency, has the potential to meet the continuously increasing demands of future IoT services and is thus becoming a major driving force for IoT. While the use of 5G technology for Internet of Things is gaining interest, research also points out various security issues in these networks. These attacks include advance scanning, Denial of Service (DoS) attacks, wireless jamming, Sensitive data exposure, Brute Force Attacks, DDoS, Man-In-The-Middle attacks, session hijacking among others. These security problems, if not addressed, will severely impede the deployment of 5G based IoT networks. Since 5G technology and its integration with IoT networks continues to evolve, there exists limited research on security of these networks. While some of the initial security research in these networks has focused on authentication and AI based privacy solutions, most of these solutions are conceptual in nature, with no real implementation. The aim of this capstone project is to simulate and implement a zero-trust security framework based on Software Defined Perimeter that can be used to prevent security attacks in 5G based IoT networks. We leverage the existing open source solution provided by Waverley Labs to evaluate and verify if it works on 5G SA (stand-alone) based IoT. The proposed framework ensures end to end security that helps in reducing the risk exposure of the IoT devices in 5G SA(stand-alone) network. Our results show that the proposed zero-trust SDP solution successfully protects the IoT Application server running on 5G SA network against various attacks and vulnerabilities. This confirms that SDP is an effective way of implementing zero trust security framework in 5G IoT based applications.

Monday, March 6

JAYANT JIRAGE

Chair: Dr. Brent Lagesse
Candidate: Master of Science in Cybersecurity Engineering
10:00 A.M.; Online
Project: Ethical Penetration Test for AAA Washington

Penetration testing, which simulates an attack from the viewpoint of the attacker, is a well-known ethical hacking technique for actively examining and assessing the security of a network or information system. Modern industry standards suggest that vulnerability scanning and penetration testing are crucial for a company to keep a secure posture as cyberattacks escalate. Organizations functioning as payment gateways must conduct frequent penetration testing on their infrastructure to comply with industry standards. AAA Washington has expressed the need for an external penetration test to assess their internet-facing resources. This project aimed to carry out and conduct such a test by establishing a custom penetration testing methodology for the organization while creating a repeatable procedure for subsequent work. The test identified weak configurations and vulnerabilities in assets controlled by AAA Washington and exploited them. This test’s findings, executive summary, and detailed remediation recommendations were forwarded to AAA Washington for performing remedial action. Following the completion of corrective actions, a validation test was conducted to ensure all vulnerabilities had been patched per the specified remedial actions, completing the penetration testing life cycle.

Tuesday, March 7

MATTHEW HEWITT

Chair: Dr. Hazeline Asuncion
Candidate: Master of Science in Cybersecurity Engineering
3:30 P.M.; Online
Project: Connecting Security Design Patterns To Source Code

All software has a need to be secure in the tech industry. Inside the source code of each piece of software contains sections or implementations of secure patterns which are meant to strengthen the security of the overall product. Security patterns serve as the set of reusable building blocks of a secure software architecture that are able to provide solutions to particular recurring security problems in different contexts. Incomplete or nonstandard implementations of security patterns are enticing to attackers and open the door for vulnerabilities within the infrastructure to be discovered and exploited. Therefore, being able to detect these security patterns improves the quality of the security features and prevents vulnerabilities from occurring in the future. In this paper, we propose a means of connecting security design patterns to source code through the use of various software tools such as Visual Paradigm, PatternScout, CodeOntology, and Apache Jena. By using open source Java projects as a testing ground, it is possible to discover security design patterns scattered throughout a project, saving programmers and software engineers valuable time in trying to find them manually. We discuss the underlying architecture of PatternScout and its functionalities with converting UML diagrams to SPARQL queries, and how CodeOntology can take source code from each open source project and generate a meaningful set of RDF triples for parsing. The results are queries that represent portions of source code where the security design patterns exist, simplifying the search for these patterns across various projects and allowing quicker action in ensuring a more secure piece of software.

Thursday, March 9

JOSEPH KHAMSENE TSAI

Chair: Dr. Marc Dupuis
Candidate: Master of Science in Cybersecurity Engineering
3:30 P.M.; Online
Project: Identification and Operationalization of Key Threats and Mitigations for the Cybersecurity Risk Management of Home Users

The negative impact of cybercrime against organizations and home users is on the rise. While organizations can utilize dedicated risk management teams to leverage robust and holistic risk management frameworks to address cybersecurity risks, the standard home user does not have access to such resources. This research leveraged the Delphi Technique over three separate surveys sent to cybersecurity professionals to identify what key threats and corresponding mitigations would be most important to home users. The identified threats and mitigations were then operationalized into a personalized security recommendations tool. The tool allows users to answer questions related to their security preferences and priorities and returns relevant results for management of their own security risk. As a result of this research, future research opportunities have been identified in the realm of cybersecurity risk management for both home users and organizations.

Autumn 2022

Wednesday, November 30

PETER VAN EENOO

Chair: Dr. Brent Lagesse
Candidate: Master of Science in Cybersecurity Engineering
11:00 A.M.; Online
Project: Securing WireGuard with an HSM

WireGuard is a popular, secure, and relatively new VPN implementation that has seen widespread adoption. WireGuard’s basic key management in the reference implementation leaves some weaknesses that could be exploited by threat actors to steal keys, compromising a user’s identity or exploit their privileged access. In my project I combined the industry-standard practice of isolating sensitive data with cutting-edge support for Curve25519 keys on an HSM. I created a WireGuard-compatible fork called WireGuard-HSM which uses the PKCS#11 interface to securely access a user’s private key and perform privileged operations on a USB security key. After performing two threat model analysis and comparing the results, I show how my modifications improve the security of the WireGuard system by decreasing the attack surface and mitigating two vulnerabilities, if the host computer is compromised. WireGuard-HSMs security improvements come without a noticeable performance penalty.

Summer 2022

Thursday, July 14

CHRISTIAN DUNHAM

Chair: Dr. Geethapriya Thamilarasu
Candidate: Master of Science in Cybersecurity Engineering
11:00 A.M.; Online
Thesis: Adversarial Trained Deep Learning Poisoning Defense: SpaceTime

Smart homes, hospitals, and industrial complexes are increasingly reliant on the Internet of Things (IoT) technology to unlock doors, regulate insulin pumps, or operate critical national infrastructure. While these technologies have made tremendous improvements that were not achievable before IoT, the increased the adoption of IoT has also expanded the attack surface and increased the security risks in these landscapes. Diverse IoT protocols and networks have proliferated allowing these tiny sensors with limited resources to both create new edge networks and deploy at depth into conventional internet stacks. The diverse nature of the IoT devices and their networks has disrupted traditional security solutions.

Intrusion Detection Systems (IDS) are one security mechanism that must adopt a new paradigm to provide measurable security in this technological evolution. The diverse resource limitations of IoT devices and their enhanced need for data privacy complicates centralized machine learning models used by modern IDS for IoT environments. Federated Learning (FL) has drawn recent interest adapting solutions to meet the requirements of the unevenly distributed nodes in IoT environments. A federated anomaly-based IDS for IoT adapts to the computational restraints, privacy needs, and heterogeneous nature of IoT networks.

However, many recent studies have demonstrated that federated models are vulnerable to poisoning attacks. The goal of this research is to harden the security of federated learning models in IoT environments to poisoning attacks. To the best of our knowledge poisoning defenses do not exist for IoT. Existing solutions to defend against poisoning attacks in other domains commonly utilize different spatial similarity measurements from Euclidean Distance (ED), cosine similarity (CS), and other pairwise measurements to identify poison attacks.

Poisoning attack methodologies have also adapted to IoT causing an evolution that defeats these existing defensive solutions. Poisoning evolution creates a need to develop new defensive methodologies. In this we develop SpaceTime a deep learning recurrent neural network that uses a four-dimensional spacetime manifold to distinguish federated participants. SpaceTime is built upon a time series regression many-to-one architecture to provide an adversarial trained defense for federated learning models. Simulation results shows that SpaceTime exceeds the previous solutions for Byzantine and Sybil label flipping, backdoor, and distributed backdoor attacks in an IoT environment.

SPRING 2022

Monday, May 16

MATTHEW SELL

Chair: Dr. Marc Dupuis
Candidate: Master of Science in Cybersecurity Engineering
11:00 A.M.; Online
Project: Designing an Industrial Cybersecurity Program for an Operational Technology Group

The design of a cybersecurity program for an Information Technology (“IT”) group is well documented by a variety of international standards, such as those provided by the U.S. National Institute of Standards and Technology (“NIST”) 800-series Special Publications. However, for those wishing to apply standard information security practices in an Operational Technology (“OT”) environment that supports industrial control and support systems, guidance is seemingly sparse.

For example, a search of a popular online retailer for textbooks on the implementation of an industrial cybersecurity program revealed only seven books dedicated to the subject, with another two acting as “how-to” guides for exploiting vulnerabilities in industrial control systems. Some textbooks cover the high-level topics of developing such a program, but only describe the applicable standards, policies, and tools in abstract terms. It is left as an exercise to the reader to explore these concepts further when developing their own industrial cybersecurity program.

This project expands on the abstract concepts described in textbooks like those previously mentioned by documenting the implementation of an industrial cybersecurity program for a local manufacturing firm. The project started with hardware and software asset inventories, followed by a risk assessment and gap analysis, and then implemented mitigating controls using a combination of manual and automated procedures. Security posture of the OT group was constantly evaluated against corporate security goals, the project-generated risk assessment, and NIST SP800-171 requirements. Improvements in security posture and compliance to corporate requirements were achieved in part through alignment with existing policies and procedures developed by the organization’s IT group, with the balance implemented and documented by the author of this project. The materials generated by this project may be used to assist other organizations starting their journey towards securing their industrial control assets.

Friday, May 20

JAYNIE A. SHORB

Chair: Dr. Brent Lagesse
Candidate: Master of Science in Cybersecurity Engineering
11:00 A.M.; Hybrid (DISC 464 & Online)
Project: Malicious USB Cable Exposer

Universal Serial Bus (USB) cables are ubiquitous with many uses connecting a wide variety of devices such as audio, visual, and data entry systems and charging batteries. Electronic devices have decreased in size over time and they are now small enough to fit within the housing of a USB connector. There are harmless 100W USB cables with embedded E-marker chips to communicate power delivery for sourcing and sinking current to charge mobile devices quickly. However, some companies have designed malicious hardware implants containing keyloggers and other nefarious programs in an effort to extract data from victims. Any system compromise that can be implemented with a keyboard is possible with vicious implants. This project designs a malicious hardware implant detector by sensing current draw from the USB cable which exposes these insideous designs. The Malicious USB Exposer is a hardware circuit implementation with common USB connectors to plug in the device under test (DUT). It provides power to the DUT and uses a current sensor to determine the current draw from the cable. The output is a red LED bargraph to show if the DUT is compromised. Unless, the DUT contains LEDs internally, any red LED output shows compromise. Active long USB cables intended to drive long distances produce a false positive and are not supported. The minimum current sensed is 10mA which is outside the range of normal USB cables with LEDs (4-6mA), and E-Marker chips (1mA). Though there is another malicious USB detector on the market it is created by a malicious USB cable supplier and designed to detect their cable. This project provides an open source solution for distinguishing USB cables to uncover a range of compromised cables from different vendors.

Wednesday, May 25

ANKITA CHAKRABORTY

Chair: Dr. Brent Lagesse
Candidate: Master of Science in Cybersecurity Engineering
3:30 P.M.; Online
Project: EXPLORING ADVERSARIAL ROBUSTNESS USING TEXTATTACK

Deep neural networks (DNNs) are subject to adversarial examples, that forces deep learning classifiers to make incorrect predictions of the input samples. In the visual domain, these perturbations are typically indistinguishable from human perception, resulting in disagreement between the classification done by people and state-of-the-art models. Small perturbations, on the other hand, are readily perceptible in the natural language domain, and the change of a single word might substantially affect the document’s semantics. In our approach, we perform ablation studies to analyze the robustness of various attacks in NLP domain and formulate ways to alter the factor of “Robustness” leading to more diverse adversarial text attacks. This work heavily relies on TextAttack (a Python framework for adversarial attacks, data augmentation, and adversarial training in NLP), for deducing the robustness of various models under attack from pre-existing or fabricated attacks. We offer various strategies to generate adversarial examples on text classification models which are anything but out of-context and unnaturally complex token replacements, easily identifiable by humans. We compare the results of our project with two baselines: Random and Pre-existing recipes. Finally, we conduct human evaluations on thirty-two volunteers with diverse backgrounds to guarantee semantic and grammatical coherence. Our research project proposes three novel attack recipes namely USEHomogyphSwap, InputReductionLeven and CompositeWordSwaps. Not only are these attacks able to reduce the prediction accuracy of current state-of-the-art deep-learning models to 0 % with the least number of queries, but also, they create crafted text that are visually imperceptible to human annotators to a great extent.

Wednesday, June 1

ROCHELLE PALTING

Chair: Dr. Geethapriya Thamilarasu
Candidate: Master of Science in Cybersecurity Engineering
1:15 P.M.; Online
Project: A Methodology for Testing Intrusion Detection Systems for Advanced Persistent Threat Attacks

Advanced Persistent Threats (APTs) are well-resourced, highly-skilled, adaptive, malicious actors who pose a major threat to the security of an organization’s critical infrastructure and sensitive data. An Intrusion Detection System (IDS) is one type of mechanism used in detecting attacks. Testing with a current and realistic intrusion dataset, promptly detecting and correlating malicious behavior at various attack stages, and utilizing relevant metrics are critical in effectively testing an IDS for APT attack detection. Testing with outdated and unrealistic data would yield results unrepresentative of the IDS’s detection ability of real-world APT attacks. In this project, we present a testing methodology utilizing our recommended procedure for preparing the intrusion dataset along with recommended evaluation metrics. Our proposed testing methodology incorporates a software program we develop which dynamically retrieves real-world intrusion examples compiled in the MITRE ATT&CK knowledge base, presents the list of known APT tactics and techniques for user selection into their scenario, and exports the attack scenario to an output file consisting of the selected APT tactics and techniques. Our testing methodology, along with attack scenario generator, provide IDS testers with guidance in testing with a current and realistic dataset and with additional evaluation data points to improve their IDS under test. The benefits IDS testers are afforded include time saved in dataset preparation and improved reliability in their IDS APT detection evaluation.

Thursday, June 2

CHRISTOPHER COY

Chair: Dr. Geethapriya Thamilarasu
Candidate: Master of Science in Cybersecurity Engineering
1:15 P.M.; Online
Project: Multi-platform User Activity Digital Forensics Intelligence Collection

In today’s interconnected world, computing devices are employed for all manner of professional and personal activity, from implementing business processes and email communications to online shopping and web browsing. While most of this activity is legitimate, there are user actions that violate corporate policy or constitute criminal activity, such as clicking a link in a phishing email or downloading child sexual abuse material.

When a user is suspected of violating policies or law, a digital forensic analyst is typically brought in to investigate the traces of user activity on a system in an effort to confirm or refute the suspected activity.

Digital forensics analysts need the capability to quickly and easily collect and process key user activity artifacts that enable rapid analysis and swift decision making. The FORINT project was developed to provide digital forensics analysts with this very capability across multiple operating systems.

SARIKA RAMESH BHARAMBE

Chair: Dr. Brent Lagesse
Candidate: Master of Science in Cybersecurity Engineering
11:00 A.M.; Online
Project: New Approach towards Self-destruction of Data in Cloud

One of the most pressing issues faced by cloud service industry is ensuring data privacy and security. Dealing with data in a cloud environment that leverages shared resources, as well as offering reliable and secure cloud services, necessitates a strong encryption solution that has no or minimal performance impact. One of the approaches towards this issue is to introduce self-destruction of data which mainly aims at protecting the shared data. Encrypting files is a simple way to protect personal or commercial data. Using a hybrid RSA AES algorithm, we propose a time-based self-destruction method to address the above difficulties and improve file encryption performance and security using file split functionality. Each data owner must set an expiration limit on the contents for collaboration which will initialize after uploading file to the cloud. Once a user-specified expiration period has passed, the sensitive information is securely self-destructed.

In this approach we have introduced on how to use channels on clouds which will help increase the data security as we split the bits of each word and upload it in encrypted format. For this purpose, we are using ThingSpeak, a cloud platform used for visualization, analyzation and sharing data through public and private channels. We experimentally test the performance overhead of our approach with ThingSpeak and use realistic tests to demonstrate the viability of our solution for enhancing the security of cloud-based data storage. For encryption and decryption technique we have used Hybrid RSA AES algorithm. Through results of various experiments performed, we can conclude that this algorithm has higher efficiency, increased accuracy, better performance, and security benefits.

WINTER 2022

Friday, March 11

KRATICA RASTOGI

Chair: Dr. Brent Lagesse
Candidate: Master of Science in Cybersecurity Engineering
11:00 A.M.; Online
Project: Fully Homomorphic Encryption for Privacy-Preserving Fingerprint Screening

In many applications, fingerprint-based authentication has recently gained traction as a viable alternative to traditional password or token-based authentication, owing to user ease and the uniqueness of fingerprint features. Biometric template data, on the other hand, is considered sensitive information because it uniquely links to a user’s identity. As a result, it must be secured to avoid data leakage. In this research, a fingerprint authentication system based on fully homomorphic encryption for access control is proposed which protect private fingerprint template data. Fingerprint data can be matched in the encrypted domain using fully homomorphic encryption, making it more difficult for attackers to retrieve the original biometric template without knowing the private key. The authors propose a proof-of-concept implementation based on the SEAL library, which includes the fundamental basic operations required to perform fingerprint matching. For a 10-bit integer, the suggested system can achieve fingerprint matching in 0.074 seconds.

AUTUMN 2021

Thursday, December 9

NHU LY

Chair: Dr. Marc Dupuis
Candidate: Master of Science in Cybersecurity Engineering
11:00 A.M.; Online
Project: The impact of cultural factors, trait affect, and risk perception on the spread of COVID-19 misinformation on social media

In the information age, social media has created a favorable environment for spreading misinformation. This has become a serious concern for public health, especially during the unpredictable developments of COVID-19 and its variants. Misinformation related to COVID-19 has spread faster than ever on social media, emerging in numerous types from its origin and treatment methods to vaccines. This results in social media users making dangerous health decisions, as well as impacting the pandemic control process of authorities. Despite the warnings from accredited organizations about the risks of misinformation, a majority of social media users still trust such misinformation and spread it without verifying the reliability of the content. To tackle the spread of COVID-19 misinformation, this paper aims to explore what factors influence users’ beliefs in such misinformation and their tendencies to share it on social media. We conduct a survey to assess users’ reactions and behaviors toward COVID-19 misinformation. Memes and additional measures are included in the survey to evaluate the roles of culture, trait affect, and risk perception on the spread of misinformation.

Back to top

Master of Science in Electrical Engineering

Summer 2023

Friday, August 11

PRITAM BHANDARI

Chair: Dr. Seungkeun Choi
Candidate: Master of Science in Electrical Engineering
11:00 A.M.; Join Pritam Bhandari’s online defense
Thesis: Characterization of Nafion Based Resistive RAM Devices

The development of computers in the modern era has escalated the race towards the development of powerful and efficient memory devices. In the past hundred years, we have gone from using punch cards for a mere kilobyte of storage to an enormous capability of storing terabytes of data. This progress has been mainly possible due to the advancement in the field of non- volatile memory devices and the fabrication technologies. By the use of advanced miniaturization techniques and new materials, we have been able to dramatically reduce the size of the memory devices while increasing the storage capacity and computing performance.

Despite having achieved this feat of miracle, we are reaching a point of slower growth in the computing performance of MOSFET-based non-volatile memory devices. It becomes very difficult to further decrease the size of memory devices. Hence, the next generation memory technology must have the following features to meet the high computing performance in the era of artificial intelligence: low-power consumption, fast switching, non-volatile, high-density fabrication. Resistive Random-Access Memory Devices (ReRAM) meets all those requirements; hence, is considered as one of the best candidates for the next generation memory technologies.

In this research, a ReRAM device with Nafion as a switching layer was fabricated. To characterize the resistive switching performance, Nafion was annealed at three different temperatures: 30°C, 60°C, and 90°C. In order to study the effect of different electrode, we used two different bottom electrodes (Au and Cu) and Al as a top electrode. The devices with Cu as a bottom electrode exhibits good resistive switching properties while the device with Au as a bottom electrode shows little or negligible switching performance. We found that the performance of switching is best when Nafion is annealed at 60°C. However, the experiment shows a wide variation of device performance even in the same substrate, indicating the importance of uniform film thickness and quality of Nafion.

Summer 2022

Tuesday, August 9

MOOSA RAZA

Chair: Dr. Seungkeun Choi
Candidate: Master of Science in Electrical Engineering
8:45 A.M.; Online
Thesis: Multilevel Resistive Switching in a Metal Oxide Semiconductor based on MoO₃

Over the years a resistive random-access memory (ReRAM) has received so much attention among many emerging memory technologies due to its simple structure and fabrication process, cost-effective development, low-power consumption, scalability, high throughput, and other attracting memory characteristics.

Multilevel switching operation of the stack ReRAM device based on the MoO₃ has been investigated by the compliance current control method, where the device exhibited 2-bit per cell memory storage density. Device realized the bipolar resistive switching mode with the varying levels of high resistive state (HRS) between 11.7 Ω to 90 Ω and low resistive state (LRS) between 3.89 Ω to 47 Ω read at 0.01 V during the endurance characteristics, exhibiting the variable OFF/ON ratio between 1.6 to 15. The device also showed insignificant variations in the switching voltages such as set voltage (V_set) between 0.22 V to 0.27 V and reset voltage (V_reset) between 0.15 V to 0.30 V was observed over 11 resistive switching cycles, when swept between -0.5 V to +0.5 V.

Also, the unique resistive switching behavior of the novel lateral ReRAM device based on MoO₃ has been reported, showing multiple set and reset voltages in both the positive and negative voltage regimes and maintained the consistency across the switching voltages i.e., V_set A, V_set B, V_set C, V_reset A and V_reset B were noticed around -40 V, 40 V, -10 V, 40 V and -40 V respectively throughout the 105 switching cycles. The device also exhibits the self-compliance property at much smaller currents around few microamperes (≅ 0.9 μA), making it suitable for the wide range of power applications. Further investigation is required to determine the plausible applications of the unique resistive switching properties achieved from the lateral ReRAM

AUTUMN 2021

Friday, December 3

SHARMILA DEVI KANNIVELU

Chair: Dr. Sunwoong S. Kim
Candidate: Master of Science in Electrical Engineering
8:45 A.M.; Online
Thesis: Privacy-Preserving Image Filtering and Thresholding Using Numerical Methods for Homomorphically Encrypted Numbers

Homomorphic encryption (HE) is an important cryptographic technique that allows one to directly perform computation on encrypted data without decryption. In HE-based applications using digital images, a user often encrypts a private image captured on a local device. This image can contain noise that negatively affects the results of HE-based applications. To solve this problem, this thesis paper proposes a HE-based locally adaptive Wiener filter (HELAWF). For small-sized encrypted input data, pixels that have no dependency when sliding a window are encoded into the same ciphertext. For division in the adaptive filter, which is not supported by conventional HE schemes, a numerical approach is adopted. Image thresholding is a method of segmenting a region of interest and is used in many real-world applications. Typically, image thresholding contains a comparison operation, but this operation is not supported in conventional HE schemes. To solve this problem, a numerical approach for comparison operation is used in the proposed HE-based image thresholding (HETH). The proposed HELAWF and HETH designs are integrated and implemented as a proof-of-concept client-server model. In practical HE schemes, the number of consecutive multiplications on encrypted data is limited. Therefore, the number of iterations of the numerical methods used in the integrated design is carefully chosen. To the best of the authors’ knowledge, this thesis paper is the first work that applies approximate division and comparison operation over encrypted data to image processing algorithms. The proposed solutions can address important privacy issues in image processing applications in internet-of-things and cyber-physical systems, where many devices are connected through a vulnerable network.

SPRING 2021

Tuesday, June 1

COURTNEY CHAN CHHENG

Chair: Dr. Denise Wilson
Candidate: Master of Science in Electrical Engineering
5:45 P.M.; Online
Thesis: Abnormal Gait Detection using Wearable Hall-Effect Sensors

Abnormalities and irregularities in walking (gait) are predictors and indicators of both disease and injury. Gait has traditionally been monitored and analyzed in clinical settings using complex video (camera-based) systems, pressure mats, or a combination thereof. Wearable gait sensors offer the opportunity to collect data in natural settings and to complement data collected in clin-ical settings, thereby offering the potential to improve quality of care and diagnosis for those whose gait varies from healthy patterns of movement. This paper presents a gait monitoring system designed to be worn on the inner knee or upper thigh. It consists of low-power Hall-effect sensors positioned on one leg and a compact magnet positioned on the opposite leg. Wireless data collected from the sensor system were used to analyze stride width, stride width variability, cadence, and cadence variability for four different individuals engaged in normal gait, two types of abnormal gait, and two types of irregular gait. Using leg gap variability as a proxy for stride width variability, 81% of abnormal or irregular strides were accurately identified as different from normal stride. Cadence was surprisingly 100% accurate in identifying strides which strayed from normal, but variability in cadence provided no useful information. This highly sensitive, non-contact Hall-effect sensing method for gait monitoring offers the possibility for detecting visually imperceptible gait variability in natural settings. These nuanced changes in gait are valuable for predicting early stages of disease and also for indicating progress in recovering from injury.

WINTER 2021

Friday, March 12

RUOHAO “EDDIE” LI

Chair: Dr. Kaibao Nie
Candidate: Master of Science in Electrical Engineering
11:00 A.M.; Online
Thesis: Improving Keywords Spotting in Noise with Augmented Dataset from Vocoded Speech and Speech Denoising

As more electronic devices have an on-device Keywords Spotting (KWS) system, producing and deploying trained models for keyword(s) detection is becoming more demanding. The dataset preparation process is one of the most challenging and tedious tasks in Keywords Spotting. It requires a significant amount of time to obtain raw or segmented audio speeches. In this thesis, we first proposed a data augmentation strategy using a speech vocoder to generate vocoded speech at different numbers of channels artificially. Such a strategy can increase the dataset size by at least two-fold, depending on the use case. With the new features introduced by the different number of channels of the vocoded speeches, a convolutional neural network (CNN) KWS system trained with the augmented dataset from vocoded speech showed promising improvement evaluated at +10 dB SNR noisy condition. The same results were confirmed in hardware implementation and proved using vocoded speech in data augmentation is the potential to improve KWS on microcontrollers. We further proposed a neural-network-based speech denoising system using the Weighted Overlap-Add (WOLA) algorithm for feature extraction for more efficient processing. The proposed speech denoising system uses regression between a noisy speech and a clean speech and converts noisy speech (as input) into clean speech (as output). Thus, the input of the proposed KWS system will be relatively clean speech. Furthermore, by changing the training target to vocoded speech, such a speech denoising system can convert noisy speech (as input) into vocoded speech (as output). The combination of speech denoising and vocoded speech in data augmentation achieved relatively high accuracy when evaluated at +10 dB SNR noisy condition.

SPRING 2019

Friday, June 7

FEIFAN LAI

Chair: Dr. Kaibao Nie
Candidate: Master of Science in Electrical Engineering
11:00 A.M.; DISC 464
Thesis: Intelligent background sound event detection and classification based on WOLA spectral analysis in hearing devices

Audio signals from real-life hearing devices typically contain background noises. The purpose of this thesis is to build a system model which can automatically separate background noise from noisy speech, and then classify background sound into predefined event categories. This thesis proposed to use weighted overlap-add algorithm (WOLA) for feature extraction and feed-forward neural network for sound event detection. In this approach, an energy signal trough detection algorithm is used to separate out speech gaps which primarily contain background noise. To further analyze the noise signal’s spectrum, the WOLA algorithm is used to extract spectral features by transforming a fraction of time domain signal into frequency domain data represented in 22 channels. Moreover, a feed-forward neural network with one hidden layer is used to recognize each event’s diverse spectral feature pattern. It then produces classification decisions based on confidence values. Recordings of 11 realistic background noise scenes (cafe, station, hallway …), mixed with human speech at Signal to Noise Ratio (SNR) of 5 dB, are used for training. The neural network will learn the mapping between spectral feature characteristics and sound event categories. After training, the neural network classifier is evaluated by measuring the accuracy of event classification. The overall detection accuracy has achieved 96%, while the event ‘hallway’ has the lowest detection rate at 85%. This detection algorithm also has the ability for improving noise reduction in hearing devices by applying distinct compensation gains, which will attenuate the noise dominated frequency bands for each particular predefined event. In our preliminary evaluation experiment, the application of gain patterns has been proven to be effective in reducing background noise. Its combinational usage with instant gain pattern would produce improved results with noticeably attenuated noise and smooth spectral cues in the processed audio output.

SUMMER 2018

Friday, August 3

MALIA STEWARD

Chair: Dr. Seungkeun Choi
Candidate: Master of Science in Electrical Engineering
3:30 P.M.; DISC 464
Thesis: Development of Corrugated Wrinkle Surface for an Organic Solar Cell

There have been great interest in organic photovoltaics (OPVs) due to their potential for the development of low-cost, high throughput, and large-area solar cells with a flexible form factor. Hence, the power conversion efficiency of OPVs has been dramatically improved for the past two decades. Although the power conversion efficiency (PCE) of OPVs exceeds 10% now, the PCE of this thin-film based solar cells is fundamentally limited by the ability of the photo-active layer to absorb the incident sunlight. The external quantum efficiency (EQE) is used to describe this ability and rarely exceeds 70% for the state-of-the-art OPVs, implying that only 70% of incident photons contributes to a photo-current generation. The EQE can be improved by trapping more light in the active layer which is very challenging for thin-film based photovoltaics.

In this research, I have investigated optimization of the organic solar cell fabrication by tuning a charge carrier transport layer and also developed a new metallization method in order to replace vacuum deposited silver electrode with electroplated copper which is less expensive and better fits to the industry manufacturing. I also investigated a number of methods to fabricate optimum wrinkle structure that can be used as a light trapping vehicle for organic solar cells. I fabricated wrinkles on SU-8 polymer by controlling softness of the SU-8. While wrinkles generally produced after metal deposition, I found that more suitable wrinkle profile can be fabricated before the metal deposition. Future work will focus on the development of reproducible, scalable, and high throughput wrinkle fabrication with an optimum profile and the demonstration of highly efficient organic solar cells by enhancing light trapping thanks to the wrinkles.

Back to top