Physical Sciences and Mathematics Commons^™

Atomistic And Mesoscale Modeling Of Microstructure Development During Solid-State Sintering, Omar Marwan Isa Hussein

All Dissertations

Interfaces are ubiquitous in materials systems, and they influence the processing and properties of nearly all engineering and functional materials. Examples include grain boundaries (GBs) in polycrystalline materials, free surfaces in nanoparticles, and phase boundaries in multiphase materials. Therefore, understanding and controlling interfacial processes is a key aspect of materials design and discovery efforts. Recent developments in advanced manufacturing and synthesis techniques have enabled the fabrication of materials architectures with intricate nanoscale features. Of particular interest is solid-state sintering, known for creating complex and high-precision geometries with controlled microstructures. While sintering science has been the subject of active research, very …

New Preconditioned Conjugate Gradient Methods For Some Structured Problems In Physics, Tianqi Zhang

All Dissertations

This dissertation concerns the development and analysis of new preconditioned conjugate gradient (PCG) algorithms for three important classes of large-scale and complex physical problems characterized by special structures. We propose several new iterative methods for solving the eigenvalue problem or energy minimization problem, which leverage the unique structures inherent in these problems while preserving the underlying physical properties. The new algorithms enable more efficient and robust large-scale modeling and simulations in many areas, including condensed matter physics, optical properties of materials, stabilities of dynamical systems arising from control problems, and many more. Some methods are expected to be applicable to …

Fledge: Ledger-Based Federated Learning Resilient To Inference And Backdoor Attacks, Jorge Castillo, Phillip Rieger, Hossein Fereidooni, Qian Chen, Ahmad Sadeghi

Informatics and Engineering Systems Faculty Publications and Presentations

Federated learning (FL) is a distributed learning process that uses a trusted aggregation server to allow multiple parties (or clients) to collaboratively train a machine learning model without having them share their private data. Recent research, however, has demonstrated the effectiveness of inference and poisoning attacks on FL. Mitigating both attacks simultaneously is very challenging. State-of-the-art solutions have proposed the use of poisoning defenses with Secure Multi-Party Computation (SMPC) and/or Differential Privacy (DP). However, these techniques are not efficient and fail to address the malicious intent behind the attacks, i.e., adversaries (curious servers and/or compromised clients) seek to exploit a …

Aspects Of Stochastic Geometric Mechanics In Molecular Biophysics, David Frost

All Dissertations

In confocal single-molecule FRET experiments, the joint distribution of FRET efficiency and donor lifetime distribution can reveal underlying molecular conformational dynamics via deviation from their theoretical Forster relationship. This shift is referred to as a dynamic shift. In this study, we investigate the influence of the free energy landscape in protein conformational dynamics on the dynamic shift by simulation of the associated continuum reaction coordinate Langevin dynamics, yielding a deeper understanding of the dynamic and structural information in the joint FRET efficiency and donor lifetime distribution. We develop novel Langevin models for the dye linker dynamics, including rotational dynamics, based …

Wabanaki Experiences And Perspectives On “Our Shared Ocean”: Maine Indian Tribal-State Commission Special Report Sea Run, Anthony W. Sutton, Judson Esty-Kendall, Paul Thibeault

Maine Policy Review

The Maine Indian State Tribal Commission (MITSC) recently published a special report titled, Sea Run, documenting the impact of Colonial and Maine policies and activities on the quality and quantity of tribal fisheries spanning the time from first contact between Europeans and the Wabanaki Nations to today.

The Changing Tides Of Action To Address Ocean Acidification In Maine, Ivy L. Frignoca, Heather R. Kenyon

Maine Policy Review

As carbon dioxide emissions continue to rise worldwide, ocean acidification has become a consequence that threatens both human and natural processes. On a global scale, ocean acidification is relatively well understood. However, the complex ecosystem of the nearshore environment presents challenges for monitoring and addressing ocean acidification. In a state such as Maine, whose communities heavily depend on the health of the coastal environment, understanding this threat becomes critically important.

In 2014, Maine’s legislature established a six month study commission to investigate this problem and produce recommendations. The commission proposed a coast-wide monitoring network that could identify and use a …

New Office Supports Maine Climate Action, Parker Gassett, Ivan Fernandez

Maine Policy Review

Expanding and expediting access to climate change information can improve collective action outcomes. Accordingly, the Maine Climate Action Plan called for the creation of an information-coordinating hub, to enable effective and efficient use of climate information in Maine’s climate change response. To aid that need, the University of Maine created the Maine Climate Science Information Exchange (MCSIE) office as a gateway to information about climate-relevant research, the scientists conducting that research, and the most recent data and applied science efforts relating to Maine’s climate change strategies. The office was established in 2023, after a year of developing prototypes of the …

Radiation Exposure Calibration Of The Al2o3:C With Radium-226 And Cesium-137 Using The Osl Method, Selma Tepeli Aydin

All Theses

Optically stimulated luminescence (OSL) dosimetry was utilized to calibrate Al₂O₃:C powder dosimeters, available commercially as the nanoDot® from Landauer Inc., and compare the dosimeter response to radium-226 (²²⁶Ra) and cesium-137 (¹³⁷Cs). The signal from the OSL was quantified using a microSTARii^® OSL reader also produced by Landauer Inc. Dose-response curves were developed for ²²⁶Ra and ¹³⁷Cs experiments (5 dosimeters each) at thirteen absorbed doses. Individual dosimeter response was tracked by serial number. Linear regression analysis was performed to determine if there were significant differences between the intercepts of the …

Generalized Vulnerability Measures Of Graphs, Julia Vanlandingham

All Theses

Several measures of vulnerability of a graph look at how easy it is to disrupt the network by removing/disabling vertices. As graph-theoretical parameters, they treat all vertices alike: each vertex is equally important. For example, the integrity parameter considers the number of vertices removed and the maximum number of vertices in a component that remains. We consider the generalization of these measures of vulnerability to weighted vertices in order to better model real-world applications. In particular, we investigate bounds on the weighted versions of connectivity and integrity, when polynomial algorithms for computation exist, and other characteristics of the generalized measures.

Turing Patterns In A P-Adic Fitzhugh-Nagumo System On The Unit Ball, L. F. Chacón-Cortés, C. A. Garcia-Bibiano, Wilson A. Zuniga-Galindo

School of Mathematical and Statistical Sciences Faculty Publications and Presentations

We introduce discrete and p-adic continuous versions of the FitzHugh-Nagumo system on the one-dimensional p-adic unit ball. We provide criteria for the existence of Turing patterns. We present extensive simulations of some of these systems. The simulations show that the Turing patterns are traveling waves in the p-adic unit ball.

Gated Recurrent Units For Blockage Mitigation In Mmwave Wireless, Ahmed H. Almutairi, Alireza Keshavarz-Haddad, Ehsan Aryafar

Computer Science Faculty Publications and Presentations

Millimeter-Wave (mmWave) communication is susceptible to blockages, which can significantly reduce the signal strength at the receiver. Mitigating the negative impacts of blockages is a key requirement to ensure reliable and high throughput mmWave communication links. Previous research on blockage mitigation has introduced several model and protocol based blockage mitigation solutions that focus on one technique at a time, such as handoff to a different base station or beam adaptation to the same base station. In this paper, we address the overarching problem: what blockage mitigation method should be employed? and what is the optimal sub-selection within that method? To …

Preventing Inferences Through Data Dependencies On Sensitive Data, Primal Pappachan, Shufan Zhang, Xi He, Sharad Mehrotra

Computer Science Faculty Publications and Presentations

Simply restricting the computation to non-sensitive part of the data may lead to inferences on sensitive data through data dependencies. Inference control from data dependencies has been studied in the prior work. However, existing solutions either detect and deny queries which may lead to leakage – resulting in poor utility, or only protects against exact reconstruction of the sensitive data – resulting in poor security. In this paper, we present a novel security model called full deniability. Under this stronger security model, any information inferred about sensitive data from non-sensitive data is considered as a leakage. We describe algorithms for …

The Effects Of Salt Marsh Restoration On The Hydrology Of Salt Marsh Channels, Isis Kontas

University Honors Theses

Salt marshes produce many ecosystem services, from water purification to protection from hurricanes. Despite their benefits, salt marshes have been impacted negatively by human activities. There are many salt marsh restoration projects that intend to bring back all ecological functions and services. Quantifiable measurements are needed to evaluate the effectiveness of such restoration efforts. Earlier work by Reagan Thomas demonstrated what happens to the hydrology of salt marsh channels when they are adjacent to restored salt marshes. This study builds on Thomas’ work and uses the sinuosity of channels as a quantitative, representative metric of salt marsh hydrology restoration effectiveness. …

Parameterized Complexity Of Feature Selection For Categorical Data Clustering, Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov

Computer Science Faculty Publications and Presentations

We develop new algorithmic methods with provable guarantees for feature selection in regard to categorical data clustering. While feature selection is one of the most common approaches to reduce dimensionality in practice, most of the known feature selection methods are heuristics. We study the following mathematical model. We assume that there are some inadvertent (or undesirable) features of the input data that unnecessarily increase the cost of clustering. Consequently, we want to select a subset of the original features from the data such that there is a small-cost clustering on the selected features. More precisely, for given integers ℓ (the …

Coral Restoration: Comparisons In Space, Time, Impacts, And Costs, Allison Fargo

Honors College

Seventy-five percent of coral reefs globally face crisis due to anthropogenic disturbances, prompting heightened global coral restoration initiatives to preserve these vital ecosystems. Various regions employ diverse active coral restoration methodologies, including coral gardening, transplantation, micro-fragmentation, artificial reefs, and sexual propagation. Of these methods, coral gardening stands out as one of the most common and highly successful methods, alongside widespread transplantation practices. Restoration efforts predominantly focus on acroporids due to their relatively rapid growth and asexual fragmentation; however, a diverse range of coral species, including large, slow-growing varieties, is also employed in these endeavors. Costs vary significantly, ranging from $10,000 …

Large Language Model Is Not A Good Few-Shot Information Extractor, But A Good Reranker For Hard Samples!, Yubo Ma, Yixin Cao, Yongchin Hong, Aixin Sun

Research Collection School Of Computing and Information Systems

Large Language Models (LLMs) have made remarkable strides in various tasks. However, whether they are competitive few-shot solvers for information extraction (IE) tasks and surpass fine-tuned small Pre-trained Language Models (SLMs) remains an open problem. This paper aims to provide a thorough answer to this problem, and moreover, to explore an approach towards effective and economical IE systems that combine the strengths of LLMs and SLMs. Through extensive experiments on nine datasets across four IE tasks, we show that LLMs are not effective few-shot information extractors in general, given their unsatisfactory performance in most settings and the high latency and …

Neural Multi-Objective Combinatorial Optimization With Diversity Enhancement, Jinbiao Chen, Zizhen Zhang, Zhiguang Cao, Yaoxin Wu, Yining Ma, Te Ye, Jiahai Wang

Research Collection School Of Computing and Information Systems

Most of existing neural methods for multi-objective combinatorial optimization (MOCO) problems solely rely on decomposition, which often leads to repetitive solutions for the respective subproblems, thus a limited Pareto set. Beyond decomposition, we propose a novel neural heuristic with diversity enhancement (NHDE) to produce more Pareto solutions from two perspectives. On the one hand, to hinder duplicated solutions for different subproblems, we propose an indicator-enhanced deep reinforcement learning method to guide the model, and design a heterogeneous graph attention mechanism to capture the relations between the instance graph and the Pareto front graph. On the other hand, to excavate more …

Designing An Overseas Experiential Course In Data Science, Hua Leong Fwa, Graham Ng

Research Collection School Of Computing and Information Systems

Unprecedented demand for data science professionals in the industry has led to many educational institutions launching new data science courses. It is however imperative that students of data science programmes learn through execution of real-world, authentic projects on top of acquiring foundational knowledge on the basics of data science. In the process of working on authentic, real-world projects, students not only create new knowledge but also learn to solve open, sophisticated, and ill-structured problems in an inter-disciplinary fashion. In this paper, we detailed our approach to design a data science curriculum premised on learners solving authentic data science problems sourced …

Learning To Search Feasible And Infeasible Regions Of Routing Problems With Flexible Neural K-Opt, Yining Ma, Zhiguang Cao, Yew Meng Chee

Research Collection School Of Computing and Information Systems

In this paper, we present Neural k-Opt (NeuOpt), a novel learning-to-search (L2S) solver for routing problems. It learns to perform flexible k-opt exchanges based on a tailored action factorization method and a customized recurrent dual-stream decoder. As a pioneering work to circumvent the pure feasibility masking scheme and enable the autonomous exploration of both feasible and infeasible regions, we then propose the Guided Infeasible Region Exploration (GIRE) scheme, which supplements the NeuOpt policy network with feasibility-related features and leverages reward shaping to steer reinforcement learning more effectively. Besides, we further equip NeuOpt with dynamic data augmentations during inference for more …

Deepaco: Neural-Enhanced Ant Systems For Combinatorial Optimization, Haoran Ye, Jiarui Wang, Zhiguang Cao, Helan Liang, Yong Li

Research Collection School Of Computing and Information Systems

Ant Colony Optimization (ACO) is a meta-heuristic algorithm that has been successfully applied to various Combinatorial Optimization Problems (COPs). Traditionally, customizing ACO for a specific problem requires the expert design of knowledge-driven heuristics. In this paper, we propose DeepACO, a generic framework leveraging deep reinforcement learning to automate heuristic designs. DeepACO serves to strengthen the heuristic measures of existing ACO algorithms and dispense with laborious manual design in future ACO applications. As a neural-enhanced meta-heuristic, DeepACO consistently outperforms its ACO counterparts on eight COPs using a single neural model and a single set of hyperparameters. As a Neural Combinatorial Optimization …

Efficient Meta Neural Heuristic For Multi-Objective Combinatorial Optimization, Jinbiao Chen, Zizhen Zhang, Te Ye, Zhiguang Cao, Siyuan Chen, Jiahai Wang

Research Collection School Of Computing and Information Systems

Recently, neural heuristics based on deep reinforcement learning have exhibited promise in solving multi-objective combinatorial optimization problems (MOCOPs). However, they are still struggling to achieve high learning efficiency and solution quality. To tackle this issue, we propose an efficient meta neural heuristic (EMNH), in which a meta model is first trained and then fine-tuned with a few steps to solve corresponding single-objective subproblems. Specifically, for the training process, a (partial) architecture-shared multi-task model is leveraged to achieve parallel learning for the meta model, so as to speed up the training; meanwhile, a scaled symmetric sampling method with respect to the …

Metabox: A Benchmark Platform For Meta-Black-Box Optimization With Reinforcement Learning, Zeyuan Ma, Hongshu Guo, Jiacheng Chen, Zhenrui Li, Guojun Peng, Yue-Jiao Gong, Yining Ma, Zhiguang Cao

Research Collection School Of Computing and Information Systems

Recently, Meta-Black-Box Optimization with Reinforcement Learning (MetaBBO-RL) has showcased the power of leveraging RL at the meta-level to mitigate manual fine-tuning of lower-level black-box optimizers. However, this field is hindered by the lack of a unified benchmark. To fill this gap, we introduce MetaBox, the first benchmark platform expressly tailored for developing and evaluating MetaBBO-RL methods. MetaBox offers a flexible algorithmic template that allows users to effortlessly implement their unique designs within the platform. Moreover, it provides a broad spectrum of over 300 problem instances, collected from synthetic to realistic scenarios, and an extensive library of 19 baseline methods, including …

Truncated Affinity Maximization: One-Class Homophily Modeling For Graph Anomaly Detection, Hezhe Qiao, Guansong Pang

Research Collection School Of Computing and Information Systems

We reveal a one-class homophily phenomenon, which is one prevalent property we find empirically in real-world graph anomaly detection (GAD) datasets, i.e., normal nodes tend to have strong connection/affinity with each other, while the homophily in abnormal nodes is significantly weaker than normal nodes. However, this anomaly-discriminative property is ignored by existing GAD methods that are typically built using a conventional anomaly detection objective, such as data reconstruction. In this work, we explore this property to introduce a novel unsupervised anomaly scoring measure for GAD – local node affinity – that assigns a larger anomaly score to nodes that are …

A Poisson-Based Distribution Learning Framework For Short-Term Prediction Of Food Delivery Demand Ranges, Jian Liang, Jintao Ke, Hai Wang, Hongbo Ye, Jinjun Tang

Research Collection School Of Computing and Information Systems

The COVID-19 pandemic has caused a dramatic change in the demand composition of restaurants and, at the same time, catalyzed on-demand food delivery (OFD) services—such as DoorDash, Grubhub, and Uber Eats—to a large extent. With massive amounts of data on customers, drivers, and merchants, OFD platforms can achieve higher efficiency with better strategic and operational decisions; these include dynamic pricing, order bundling and dispatching, and driver relocation. Some of these decisions, and especially proactive decisions in real time, rely on accurate and reliable short-term predictions of demand ranges or distributions. In this paper, we develop a Poisson-based distribution prediction (PDP) …

Spatial-Temporal Episodic Memory Modeling For Adls: Encoding, Retrieval, And Prediction, Xinjing Song, Di Wang, Chai Quek, Ah-Hwee Tan, Yanjiang Wang

Research Collection School Of Computing and Information Systems

Activities of daily living (ADLs) relate to people’s daily self-care activities, which reflect their living habits and lifestyle. A prior study presented a neural network model called STADLART for ADL routine learning. In this paper, we propose a cognitive model named Spatial-Temporal Episodic Memory for ADL (STEM-ADL), which extends STADLART to encode event sequences in the form of distributed episodic memory patterns. Specifically, STEM-ADL encodes each ADL and its associated contextual information as an event pattern and encodes all events in a day as an episode pattern. By explicitly encoding the temporal characteristics of events as activity gradient patterns, STEM-ADL …

Exploring Students' Adoption Of Chatgpt As A Mentor For Undergraduate Computing Projects: Pls-Sem Analysis, Gottipati Swapna, Kyong Jin Shim, Shankararaman, Venky

Research Collection School Of Computing and Information Systems

As computing projects increasingly become a core component of undergraduate courses, effective mentorship is crucial for supporting students' learning and development. Our study examines the adoption of ChatGPT as a mentor for undergraduate computing projects. It explores the impact of ChatGPT mentorship, specifically, skills development, and mentor responsiveness, i.e., ChatGPT's responsiveness to students' needs and requests. We utilize PLS-SEM to investigate the interrelationships between different factors and develop a model that captures their contribution to the effectiveness of ChatGPT as a mentor. The findings suggest that mentor responsiveness and technical/design support are key factors for the adoption of AI tools …

Offline Rl With Discrete Proxy Representations For Generalizability In Pomdps, Pengjie Gu, Xinyu Cai, Dong Xing, Xinrun Wang, Mengchen Zhao, Bo An

Research Collection School Of Computing and Information Systems

Offline Reinforcement Learning (RL) has demonstrated promising results in various applications by learning policies from previously collected datasets, reducing the need for online exploration and interactions. However, real-world scenarios usually involve partial observability, which brings crucial challenges of the deployment of offline RL methods: i) the policy trained on data with full observability is not robust against the masked observations during execution, and ii) the information of which parts of observations are masked is usually unknown during training. In order to address these challenges, we present Offline RL with DiscrEte pRoxy representations (ORDER), a probabilistic framework which leverages novel state …

Cue-Cot: Chain-Of-Thought Prompting For Responding To In-Depth Dialogue Questions With Llms, Hongru Wang, Rui Wang, Fei Mi, Yang Deng, Zezhong Wang, Bin Liang, Ruifeng Xu, Kam-Fai Wong

Research Collection School Of Computing and Information Systems

Large Language Models (LLMs), such as ChatGPT, greatly empower dialogue systems with strong language understanding and generation capabilities. However, most of the previous works prompt the LLMs to directly generate a response based on the dialogue context, overlooking the underlying linguistic cues about the user status exhibited in the context. Such in-depth dialogue scenarios are challenging for existing LLMs to figure out the user’s hidden needs and respond satisfactorily through a single-step inference. To this end, we propose a novel linguistic cue-based chain-of-thoughts (Cue-CoT), which enhances the LLMs inference with an intermediate reasoning step to find cues exhibited in the …

Flowpg: Action-Constrained Policy Gradient With Normalizing Flows, Brahmanage Janaka Chathuranga Thilakarathna, Jiajing Ling, Akshat Kumar

Research Collection School Of Computing and Information Systems

Action-constrained reinforcement learning (ACRL) is a popular approach for solving safety-critical and resource-allocation related decision making problems. A major challenge in ACRL is to ensure agent taking a valid action satisfying constraints in each RL step. Commonly used approach of using a projection layer on top of the policy network requires solving an optimization program which can result in longer training time, slow convergence, and zero gradient problem. To address this, first we use a normalizing flow model to learn an invertible, differentiable mapping between the feasible action space and the support of a simple distribution on a latent variable, …

Generative Modelling Of Stochastic Actions With Arbitrary Constraints In Reinforcement Learning, Changyu Chen, Ramesha Karunasena, Thanh Hong Nguyen, Arunesh Sinha, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

Many problems in Reinforcement Learning (RL) seek an optimal policy with large discrete multidimensional yet unordered action spaces; these include problems in randomized allocation of resources such as placements of multiple security resources and emergency response units, etc. A challenge in this setting is that the underlying action space is categorical (discrete and unordered) and large, for which existing RL methods do not perform well. Moreover, these problems require validity of the realized action (allocation); this validity constraint is often difficult to express compactly in a closed mathematical form. The allocation nature of the problem also prefers stochastic optimal policies, …