Computer Sciences Commons^™

Concurrent Identification, Characterization, And Reconstruction Of Protein Structure And Mixed-Mode Dynamics From Rdc Data Using Redcraft, Hanin Rafiq Omar

Theses and Dissertations

A complete understanding of the structure-function relationship of proteins requires an analysis of their dynamic behaviors and the static structure. However, all current approaches to studying dynamics in proteins have their shortcomings. A conceptually attractive and alternative approach simultaneously characterizes a protein's structure and its intrinsic dynamics⁠. Ideally, such an approach could solely rely on RDC data-carrying both structural and dynamical information. The major bottleneck in utilizing RDC data in recent years has been attributed to a lack of RDC analysis tools capable of extracting the pertinent information embedded within this complex data source.

Here we present a comprehensive strategy …

Security Posture: A Systematic Review Of Cyber Threats And Proactive Security, Amanda Jones

Senior Honors Theses

In the last decade, several high-profile cyber threats have occurred with global impact and devastating consequences. The tools, techniques, and procedures used to prevent cyber threats from occurring fall under the category of proactive security. Proactive security methodologies, however, vary among professionals where differing tactics have proved situationally effective. To determine the most effective tactics for preventing exploitation of vulnerabilities, the author examines the attack vector of three incidents from the last five years in a systematic review format: the WannaCry incident, the 2020 SolarWinds SUNBURST exploit, and the recently discovered Log4j vulnerability. From the three cases and existing literature, …

Estimating Stranded Coal Assets In China's Power Sector, Weirong Zhang, Mengjia Ren, Junjie Kang, Yiou Zhou, Jiahai Yuan

Research Collection School Of Computing and Information Systems

China has suffered overcapacity in coal power since 2016. With growing electricity demand and an economic crisis due to the Covid-19 pandemic, China faces a dilemma between easing restrictive policies for short-term growth in coal-fired power production and keeping restrictions in place for long-term sustainability. In this paper, we measure the risks faced by China's coal power units to become stranded in the next decade and estimate the associated economic costs for different shareholders. By implementing restrictive policies on coal power expansion, China can avoid 90% of stranded coal assets by 2025.

Assessing Security Risks With The Internet Of Things, Faith Mosemann

Senior Honors Theses

For my honors thesis I have decided to study the security risks associated with the Internet of Things (IoT) and possible ways to secure them. I will focus on how corporate, and individuals use IoT devices and the security risks that come with their implementation. In my research, I found out that IoT gadgets tend to go unnoticed as a checkpoint for vulnerability. For example, often personal IoT devices tend to have the default username and password issued from the factory that a hacker could easily find through Google. IoT devices need security just as much as computers or servers …

Convolutional Neural Network For Covid-19 Detection In Chest X-Rays, Joshua Elliot Henderson

Honors Thesis

The COVID-19 pandemic has had a large effect on almost every facet of life. As COVID-19 was a disease only discovered in recent history, there is comparatively little data on the disease, how we detect it, and how we cure it. Deep learning is a powerful tool that can be used to learn to classify information in ways that humans might not be able to. This allows computers to learn on relatively little data and provide exceptional results. In this paper, I propose a novel convolutional neural network (CNN) for the detection of COVID-19 from chest X-rays called basicConv. This …

Cook-It!: A Web Application For Easy Meal Planning, Carol Juneau

Senior Theses

Cook-it! is a web application for meal planning based on the Django framework and deployed on the Heroku platform. This application has an intuitive interface to make it easy to use. The project has been developed over two semesters, roughly separated into a planning phase and an implementation phase. Cook-it! incorporates a robust feature set and an attractive design. Its core purpose is to make it easy for users to plan meals, interact with other users, and keep track of user information such as a grocery list.

A Meshless Approach To Computational Pharmacokinetics, Anthony Matthew Khoury

Doctoral Dissertations and Master's Theses

The meshless method is an incredibly powerful technique for solving a variety of problems with unparalleled accuracy and efficiency. The pharmacokinetic problem of transdermal drug delivery (TDDD) is one such topic and is of significant complexity. The locally collocated meshless method (LCMM) is developed in solution to this topic. First, the meshless method is formulated to model this transport phenomenon and is then validated against an analytical solution of a pharmacokinetic problem set, to demonstrate this accuracy and efficiency. The analytical solution provides a locus by which convergence behavior are evaluated, demonstrating the super convergence of the locally collocated meshless …

Quantitative Multidimensional Stress Assessment From Facial Videos, Lin He

Dissertations (1934 -)

Stress has a significant impact on the physical and mental health of an individual and is a growing concern for society, especially during the COVID-19 pandemic. Facial video-based stress evaluation from non-invasive cameras has proven to be a significantly more efficient method to evaluate stress in comparison to approaches that use questionnaires or wearable sensors. Plenty of classification models have been built for stress detection. However, most do not consider individual differences. Also, the results for such models are limited by a uni-dimensional definition of stress levels lacking a comprehensive quantitative definition of stress. The dissertation focuses on building a …

Load Balancing Algorithms For Parallel Spatial Join On Hpc Platforms, Jie Yang

Dissertations (1934 -)

Geospatial datasets are growing in volume, complexity, and heterogeneity. For efficient execution of geospatial computations and analytics on large scale datasets, parallel processing is necessary. To exploit fine-grained parallel processing on large scale compute clusters, partitioning of skewed datasets in a load-balanced way is challenging. The workload in spatial join is data dependent and highly irregular. Moreover, wide variation in the size and density of geometries from one region of the map to another, further exacerbates the load imbalance. This dissertation focuses on spatial join operation used in Geographic Information Systems (GIS) and spatial databases, where the inputs are two …

Acceleration Of Computational Geometry Algorithms For High Performance Computing Based Geo-Spatial Big Data Analysis, Anmol Paudel

Dissertations (1934 -)

Geo-Spatial computing and data analysis is the branch of computer science that deals with real world location-based data. Computational geometry algorithms are algorithms that process geometry/shapes and is one of the pillars of geo-spatial computing. Real world map and location-based data can be huge in size and the data structures used to process them extremely big leading to huge computational costs. Furthermore, Geo-Spatial datasets are growing on all V’s (Volume, Variety, Value, etc.) and are becoming larger and more complex to process in-turn demanding more computational resources. High Performance Computing is a way to breakdown the problem in ways that …

Entity Based Sentiment Analysis For Textual Health Advice, Dae Lim Chung

Computer Science Senior Theses

This work explores entity based sentiment analysis for textual health advice through deep learning. We fine tuned a pretrained BERT model to analyze sentiments across five different predetermined categories which consist of food, medicine, disease, exercise, and vitality for three different sentiments: positive, negative, and neutral. Original set of annotated medical dataset from Dartmouth College’s Persist Lab was used to conduct the experiments. For the aim of tailoring the data for the purpose of entity based sentiment analysis, we explored data transformation techniques to generate optimum training examples. During the experiments, we were able to discover that the wide variety …

Passing Time And Syncing Secrets: Demonstrating Covert Channel Vulnerabilities In Precision Time Protocol (Ptp), Aron J. Smith-Donovan

Mathematics, Statistics, and Computer Science Honors Projects

Covert channels use steganographic approaches to transfer secret digital communications; when applied to network protocols, these strategies can facilitate undetectable data exfiltration and insertion attacks. Because covert channel techniques are protocol- and implementation-specific, individual case studies are necessary to assess for vulnerabilities under different conditions. While several investigations have been published evaluating covert channel potential in infrastructure- and manufacturing-based contexts, no existing research explores Precision Time Protocol (PTP), a time synchronization protocol commonly used in industrial control systems. This study aims to fill this gap by demonstrating the feasibility of a covert channel-based attack on a PTP-enabled network.

Automata-Theoretic Approaches To Planning In Robotics: Combinatorial Filter Minimization, Planning To Chronicle, Temporal Logic Planning With Soft Specifications, And Sensor Selection For Detecting Deviations From A Planned Itinerary, Hazhar Rahmani

Theses and Dissertations

In this dissertation, we present a collection of new planning algorithms that enable robots to achieve complex goals, beyond simple point-to-point path planning, using automata-theoretic methods, and we consider the filter minimization (FM) problem and a variant of it, filter partitioning minimization (FPM) problem, which aims to minimize combinatorial filters, used for filtering and automata-theoretic planning in systems with discrete sensor data. We introduce a new variant of bisimulation, compatibility, and using this notion we identify several classes of filters for which FM or FPM is solvable in polynomial time, and propose several integer linear programming (ILP) formulations …

On Providing Efficient Real-Time Solutions To Motion Planning Problems Of High Complexity, Marios Xanthidis

Theses and Dissertations

The holy grail of robotics is producing robotic systems capable of efficiently executing all the tasks that are hard, or even impossible, for humans. Humans, undoubtedly, from both a hardware and software perspective, are extremely complex systems capable of executing many complicated tasks. Thus, the complexity of many state-of-the-art robotic systems is also expected to progressively increase, with the goal to match or even surpass human abilities. Recent developments have emphasized mostly hardware, providing highly complex robots with exceptional capabilities. On the other hand, they have illustrated that one important bottleneck of realizing such systems as a common reality is …

On Size-Oriented Long-Tailed Graph Classification Of Graph Neural Networks, Zemin Liu, Qiheng Mao, Chenghao Liu, Yuan Fang, Jianling Sun

Research Collection School Of Computing and Information Systems

The prevalence of graph structures attracts a surge of investigation on graph data, enabling several downstream tasks such as multigraph classification. However, in the multi-graph setting, graphs usually follow a long-tailed distribution in terms of their sizes, i.e., the number of nodes. In particular, a large fraction of tail graphs usually have small sizes. Though recent graph neural networks (GNNs) can learn powerful graph-level representations, they treat the graphs uniformly and marginalize the tail graphs which suffer from the lack of distinguishable structures, resulting in inferior performance on tail graphs. To alleviate this concern, in this paper we propose a …

Shieldfl: Mitigating Model Poisoning Attacks In Privacy-Preserving Federated Learning, Zhuoran Ma, Jianfeng Ma, Yinbin Miao, Yingjiu Li, Robert H. Deng

Research Collection School Of Computing and Information Systems

Privacy-Preserving Federated Learning (PPFL) is an emerging secure distributed learning paradigm that aggregates user-trained local gradients into a federated model through a cryptographic protocol. Unfortunately, PPFL is vulnerable to model poisoning attacks launched by a Byzantine adversary, who crafts malicious local gradients to harm the accuracy of the federated model. To resist model poisoning attacks, existing defense strategies focus on identifying suspicious local gradients over plaintexts. However, the Byzantine adversary submits encrypted poisonous gradients to circumvent existing defense strategies in PPFL, resulting in encrypted model poisoning. To address the issue, in this paper we design a privacy-preserving defense strategy using …

The Illusion Of Agency In Human–Computer Interaction, Michael Madary

College of the Pacific Faculty Articles

This article makes the case that our digital devices create illusions of agency. There are times when users feel as if they are in control when in fact they are merely responding to stimuli on the screen in predictable ways. After the introduction, the second section of the article offers examples of illusions of agency that do not involve human–computer interaction in order to show that such illusions are possible and not terribly uncommon. The third and fourth sections of the article cover relevant work from empirical psychology, including the cues that are known to generate the sense of agency. …

Integrating Blockchains And Intelligent Agents In The Pursuit Of Artificial General Intelligence, Benjamin Fluharty

Senior Honors Theses

Artificial General Intelligence (AGI) is the next greatest technological milestone. AGI can be defined as a realized artificial intelligence (AI) with the ability to understand and solve problems of various scope within constantly changing environments. To take steps toward this goal, a baseline of information will be provided regarding surrounding topics and the current state of AGI, itself. Through the culmination of swarms of highly optimized narrow AI agents, a collaborative effort will be extended toward general intelligence. Blockchains have been selected to facilitate this connection. A software deliverable will accompany this thesis to illustrate how this idea might be …

General Purpose Computing On Graphics Processing Units For Accelerated Deep Learning In Neural Networks, Conor Helmick

Senior Honors Theses

Graphics processing units (GPUs) contain a significant number of cores relative to central processing units (CPUs), allowing them to handle high levels of parallelization in multithreading. A general-purpose GPU (GPGPU) is a GPU that has its threads and memory repurposed on a software level to leverage the multithreading made possible by the GPU’s hardware, and thus is an extremely strong platform for intense computing – there is no hardware difference between GPUs and GPGPUs. Deep learning is one such example of intense computing that is best implemented on a GPGPU, as its hardware structure of a grid of blocks, each …

Generative Adversarial Networks Take On Hand Drawn Sketches: An Application To Louisiana Culture And Mardi Gras Fashion, Stephanie Hines

Honors Capstones

No abstract provided.

Resil: Revivifying Function Signature Inference Using Deep Learning With Domain-Specific Knowledge, Yan Lin, Debin Gao, David Lo

Research Collection School Of Computing and Information Systems

Function signature recovery is important for binary analysis and security enhancement, such as bug finding and control-flow integrity enforcement. However, binary executables typically have crucial information vital for function signature recovery stripped off during compilation. To make things worse, recent studies show that many compiler optimization strategies further complicate the recovery of function signatures with intended violations to function calling conventions.In this paper, we first perform a systematic study to quantify the extent to which compiler optimizations (negatively) impact the accuracy of existing deep learning techniques for function signature recovery. Our experiments show that a state-of-the-art deep learning technique has …

On Explaining Multimodal Hateful Meme Detection Models, Ming Shan Hee, Roy Ka-Wei Lee, Wen Haw Chong

Research Collection School Of Computing and Information Systems

Hateful meme detection is a new multimodal task that has gained significant traction in academic and industry research communities. Recently, researchers have applied pre-trained visual-linguistic models to perform the multimodal classification task, and some of these solutions have yielded promising results. However, what these visual-linguistic models learn for the hateful meme classification task remains unclear. For instance, it is unclear if these models are able to capture the derogatory or slurs references in multimodality (i.e., image and text) of the hateful memes. To fill this research gap, this paper propose three research questions to improve our understanding of these visual-linguistic …

Algorithm Selection For The Team Orienteering Problem, Mustafa Misir, Aldy Gunawan, Pieter Vansteenwegen

Research Collection School Of Computing and Information Systems

This work utilizes Algorithm Selection for solving the Team Orienteering Problem (TOP). The TOP is an NP-hard combinatorial optimization problem in the routing domain. This problem has been modelled with various extensions to address different real-world problems like tourist trip planning. The complexity of the problem motivated to devise new algorithms. However, none of the existing algorithms came with the best performance across all the widely used benchmark instances. This fact suggests that there is a performance gap to fill. This gap can be targeted by developing more new algorithms as attempted by many researchers before. An alternative strategy is …

Data Source Selection In Federated Learning: A Submodular Optimization Approach, Ruisheng Zhang, Yansheng Wang, Zimu Zhou, Ziyao Ren, Yongxin Tong, Ke Xu

Research Collection School Of Computing and Information Systems

Federated learning is a new learning paradigm that jointly trains a model from multiple data sources without sharing raw data. For the practical deployment of federated learning, data source selection is compulsory due to the limited communication cost and budget in real-world applications. The necessity of data source selection is further amplified in presence of data heterogeneity among clients. Prior solutions are either low in efficiency with exponential time cost or lack theoretical guarantees. Inspired by the diminishing marginal accuracy phenomenon in federated learning, we study the problem from the perspective of submodular optimization. In this paper, we aim at …

Improving Feature Generalizability With Multitask Learning In Class Incremental Learning, Dong Ma, Chi Ian Tang, Cecilia Mascolo

Research Collection School Of Computing and Information Systems

Many deep learning applications, like keyword spotting [1], [2], require the incorporation of new concepts (classes) over time, referred to as Class Incremental Learning (CIL). The major challenge in CIL is catastrophic forgetting, i.e., preserving as much of the old knowledge as possible while learning new tasks. Various techniques, such as regularization, knowledge distillation, and the use of exemplars, have been proposed to resolve this issue. However, prior works primarily focus on the incremental learning step, while ignoring the optimization during the base model training. We hypothesise that a more transferable and generalizable feature representation from the base model would …

Trend: Temporal Event And Node Dynamics For Graph Representation Learning, Zhihao Wen, Yuan Fang

Research Collection School Of Computing and Information Systems

Temporal graph representation learning has drawn significant attention for the prevalence of temporal graphs in the real world. However, most existing works resort to taking discrete snapshots of the temporal graph, or are not inductive to deal with new nodes, or do not model the exciting effects which is the ability of events to influence the occurrence of another event. In this work, We propose TREND, a novel framework for temporal graph representation learning, driven by TempoRal Event and Node Dynamics and built upon a Hawkes process-based graph neural network (GNN). TREND presents a few major advantages: (1) it is …

Cost: Contrastive Learning Of Disentangled Seasonal-Trend Representations For Time Series Forecasting, Gerald Woo, Chenghao Liu, Doyen Sahoo, Akshat Kumar, Steven Hoi

Research Collection School Of Computing and Information Systems

Deep learning has been actively studied for time series forecasting, and the mainstream paradigm is based on the end-to-end training of neural network architectures, ranging from classical LSTM/RNNs to more recent TCNs and Transformers. Motivated by the recent success of representation learning in computer vision and natural language processing, we argue that a more promising paradigm for time series forecasting, is to first learn disentangled feature representations, followed by a simple regression fine-tuning step – we justify such a paradigm from a causal perspective. Following this principle, we propose a new time series representation learning framework for long sequence time …

Internet Privacy Concerns Revisited: Oversight From Surveillance And Right To Be Forgotten As New Dimensions, Gaurav Bansal, Fiona Fui-Hoon Nah

Research Collection School Of Computing and Information Systems

In the post-Snowden revelation era, concerns related to government surveillance and oversight have come to the forefront. The ability of the Internet to remember “everything” (or forget anything) also raises a privacy concern associated with the right to be forgotten (RTBF). In this paper, we examine the conceptualization of Internet privacy concerns (IPC) by extending Hong and Thong's (2013) model with the addition of two dimensions: oversight (i.e., due to surveillance) and the RTBF. We provide theoretical and empirical evidence for our proposed integrated conceptualization. Data were collected from Amazon's Mechanical Turk and analyzed with structural equation modeling using a …

Metaheuristics For Time-Dependent Vehicle Routing Problem With Time Windows, Yun-C Liang, Vanny Minanda, Aldy Gunawan, Hsiang-L. Chen

Research Collection School Of Computing and Information Systems

Vehicle routing problem (VRP), a combinatorial problem, deals with the vehicle’s capacity visiting a particular set of nodes while its variants attempt to fit real-world scenarios. Our study aims to minimise total travelling time, total distance, and the number of vehicles under time-dependent and time windows constraints (TDVRPTW). The harmony search algorithm (HSA) focuses on the harmony memory and pitch adjustment mechanism for new solution construction. Several local search operators and a roulette wheel for the performance improvement were verified via 56 Solomon’s VRP instances by adding a speed matrix. The performance comparison with a genetic algorithm (GA) was completed …

Victor: An Implicit Approach To Mitigate Misinformation Via Continuous Verification Reading, Kuan-Chieh Lo, Shih-Chieh Dai, Aiping Xiong, Jing Jiang, Lun-Wei Ku

Research Collection School Of Computing and Information Systems

We design and evaluate VICTOR, an easy-to-apply module on top of a recommender system to mitigate misinformation. VICTOR takes an elegant, implicit approach to deliver fake-news verifications, such that readers of fake news can continuously access more verified news articles about fake-news events without explicit correction. We frame fake-news intervention within VICTOR as a graph-based question-answering (QA) task, with Q as a fake-news article and A as the corresponding verified articles. Specifically, VICTOR adopts reinforcement learning: it first considers fake-news readers’ preferences supported by underlying news recommender systems and then directs their reading sequence towards the verified news articles. To …