Physical Sciences and Mathematics Commons^™

Effect Of Workplace Design On Collaboration And Satisfaction In Space System Command, Joshua A. Hagood

Theses and Dissertations

This study addresses a significant knowledge gap regarding the influence of physical workplace design on employee collaboration and satisfaction with the physical environment within U.S. Space Force technical military organizations.  While seminal industry research consistently demonstrates that physical design and indoor environmental quality influence employee satisfaction and collaboration (e.g., Candido et al., 2015; Sailer et al., 2021), the understanding of these impacts within military contexts remains limited.  Using a quantitative post-occupancy evaluation survey, adapted from the Sustainable Post Occupancy Evaluation Survey (SPOES), multiple regression analyses revealed that physical elements collectively predict both satisfaction and collaboration.  The final simplified model showed …

Advancing U.S. Competitiveness In Agentic Gen Ai: A Strategic Framework For Interoperability And Governance, Satyadhar Joshi

Harrisburg University Other Works

Abstract : The rapid evolution of artificial intelligence has given rise to agentic AI systems—autonomous entities capable of perceiving their environment, making decisions, and executing actions with minimal human intervention. This work provides a systematic analysis of agentic AI frameworks, governance models, and implementation strategies. Drawing on a comprehensive review of the literature, we examine the current state of agentic AI technologies, highlight key challenges in governance, security, and ethical oversight, and compare architectural frameworks for responsible deployment. Our results, illustrated through detailed framework comparisons and governance analyses, demonstrate that while agentic AI holds transformative potential across multiple sectors, notable …

Electrical Characterization Of Germanium Tin Alloys And Devices For Space Reliability, Kevin K. Choe

Theses and Dissertations

GeSn (germanium tin) alloys are potentially well suited for near-mid infrared space optoelectronic applications. Alloys of GeSn have similar properties to group III-V and mercury-cadmium-telluride semiconductors and are compatible with cost-effective complementary metal oxide semiconductor (CMOS) manufacturing technology. Recent progress in non-equilibrium remote plasma-enhanced chemical vapor deposition (RPECVD) has enabled the crystalline growth of GeSn with Sn concentrations of up to 10% without Sn surface segregation. Several experimental studies in previous literature report CVD- or molecular beam epitaxy (MBE)-grown GeSn alloys achieving a direct bandgap with 6%-9% Sn content. This novel growth technique opens opportunities for a cost-effective, next-generation optical …

Historical Research And Conservation Treatment Of An Oversized 19th-Century Subscription Family Bible, Charlotte Starnes

Art Conservation Master's Projects

This paper briefly examines the construction, materials, and conservation challenges of 19th-century subscription Bibles, focusing on the treatment of an 1885 Thomas Kelly Latin Vulgate Family Bible. These large-format, heavily decorated volumes represent the unique intersection of industrialized book production and traditional hand-binding techniques. Through the visual comparison of multiple subscription Bible structures and canvasser’s sample books, historical research, and survey responses from conservators, this project identifies key structural features, including hybrid board attachment methods, varied sewing techniques, and the sculpted two-board coverboard structure. X-radiography, microscopy, and preliminary XRF analysis provide further insights into material choices, such as the use …

Gti: Graph-Based Tree Index With Logarithm Updates For Nearest Neighbor Search In High-Dimensional Spaces, Ruoyao Ma, Yifan Zhu, Baihua Zheng, Lu Chen, Congcong Ge, Yunjun Gao

Research Collection School Of Computing and Information Systems

Nearest neighbor search (NNS) is fundamental for high-dimensional space retrieval and impacts various fields, such as pattern recognition, information retrieval, recommendation systems, and vector database management. Among existing NNS methods, graph-based methods often excel in query accuracy and efficiency. However, these methods face significant challenges, including high construction costs and difficulties with dynamic data updates. Recent efforts have focused on combining graph methods with hashing, quantization, and tree-based approaches to address these issues, but problems with large index sizes and update performance remain unresolved. In response, this paper proposes GTI, a novel, lightweight, and dynamic graph-based tree index for high-dimensional …

Learning Orientation Field For Osm-Guided Autonomous Navigation, Yuming Huang, Wei Gao, Zhiyuan Zhang, Maani Ghaffari, Dezhen Song, Cheng-Zhong Xu, Hui Kong

Research Collection School Of Computing and Information Systems

OpenStreetMap (OSM) has gained popularity recently in autonomous navigation due to its public accessibility, lower maintenance costs, and broader geographical coverage. However, existing methods often struggle with noisy OSM data and incomplete sensor observations, leading to inaccuracies in trajectory planning. These challenges are particularly evident in complex driving scenarios, such as at intersections or facing occlusions. To address these challenges, we propose a robust and explainable two-stage framework to learn an Orientation Field (OrField) for robot navigation by integrating LiDAR scans and OSM routes. In the first stage, we introduce a novel representation, OrField, which can provide orientations for each …

Probabilistic Modeling, Learnability And Uncertainty Estimation For Interaction Prediction In Movie Rating Datasets, Jennifer Poernomo, Nicole Gabrielle Lee Tan, Rodrigo Alves, Antoine Ledent

Research Collection School Of Computing and Information Systems

In this paper, we examine the hypothesis that the interactions recorded in many Recommendation Systems datasets are distributed according to a low-rank distribution, i.e. a mixture of factorizable distributions. Surprisingly, we find that on several popular datasets, a simple non-negative matrix factorization method equals or outperforms more modern methods such as LightGCN, which indicates that the sampling distribution over interactions is indeed low-rank. Furthermore, we mathematically prove that low-rank distributions are learnable with a sparse number of observations (where m/n and r refer to the number of users/items and the non-negative rank respectively) both in terms of the total variation …

Privacy-Preserving Ridge Regression Over Encrypted Data Under Multiple Keys, Yanling Li, Junzuo Lai, Meng Sun, Beibei Song, Robert H. Deng

Research Collection School Of Computing and Information Systems

With the increase of private data being collected by data owners, it has been a trend for data owners to store the data on cloud computing platforms. The huge amounts of data in cloud servers bring fresh development opportunities to machine learning, which is applied to build a high-quality machine learning model based on a large training dataset. However, to ensure the privacy of data and facilitate retrieval, data owners often upload encrypted data under their public keys. But it creates new challenges for machine learning to learn a predictive model over these encrypted data under different keys. Most existing …

From Release To Adoption: Challenges In Reusing Pre-Trained Ai Models For Downstream Developers, Peerachai Banyongrakkul, Mansooreh Zahedi, Patanamon Thongtanunam, Christoph Treude, Haoyu Gao

Research Collection School Of Computing and Information Systems

Pre-trained models (PTMs) have gained widespread popularity and achieved remarkable success across various fields, driven by their groundbreaking performance and easy accessibility through hosting providers. However, the challenges faced by downstream developers in reusing PTMs in software systems are less explored. To bridge this knowledge gap, we qualitatively created and analyzed a dataset of 840 PTM-related issue reports from 31 OSS GitHub projects. We systematically developed a comprehensive taxonomy of PTM-related challenges that developers face in downstream projects. Our study identifies seven key categories of challenges that downstream developers face in reusing PTMs, such as model usage, model performance, and …

Static Analysis As A Feedback Loop: Enhancing Llm-Generated Code Beyond Correctness, Scott Blyth, Sherlock Licorish, Christoph Treude, Markus Wagner

Research Collection School Of Computing and Information Systems

Large language models (LLMs) have demonstrated impressive capabilities in code generation, achieving high scores on benchmarks such as HumanEval and MBPP. However, these benchmarks primarily assess functional correctness and neglect broader dimensions of code quality, including security, reliability, readability, and maintainability. In this work, we systematically evaluate the ability of LLMs to generate high-quality code across multiple dimensions using the PythonSecurityEval benchmark. We introduce an iterative static analysis-driven prompting algorithm that leverages Bandit and Pylint to identify and resolve code quality issues. Our experiments with GPT-4o show substantial improvements: security issues reduced from >40% to 13%, readability violations from >80% …

Large Lithium-Ion Battery Model For Secure Shared E-Bike Battery In Smart Cities, Donghui Ding, Zhao Li, Linhao Luo, Ming Jin, Bin Zhu, Yichen Zhong, Junhao Hu, Peng Cai, Huiqi Hu

Research Collection School Of Computing and Information Systems

Electric bikes powered by lithium-ion batteries are increasingly used in smart cities to promote sustainable mobility and efficient delivery services. However, limited battery range and slow plug-in charging remain key challenges. Shared electric bike battery systems, facilitated by battery swapping stations, offer a promising solution by enabling quick and efficient battery replacements. However, their success hinges on accurate anomaly detection, battery health estimation and remain range prediction. These tasks remain challenging due to data scarcity, battery diversity and environmental variability. Here we show that a large-scale lithium-ion battery model trained on over ten million battery time series data enables robust …

Stylegan-∞: Extending Stylegan To Arbitrary-Ratio Translation With Stylebook, Yihua Dai, Tianyi Xiang, Bailin Deng, Yong Du, Hongmin Cai, Jing Qin, Shengfeng He

Research Collection School Of Computing and Information Systems

Although pre-trained large-scale generative models StyleGAN series have proven to be effective in various editing and translation tasks, they are limited to pre-defined fixed aspect ratio. To overcome this limitation, we propose StyleGAN-∞, a model that enables pre-trained StyleGAN to perform arbitrary-ratio conditional synthesis. Our key insight is to distill the expressive StyleGAN features into a StyleBook, such that an arbitrary-ratio condition can be translated to other forms by properly assembling pre-defined StyleBook vectors. To learn and leverage the StyleBook, we employ a network with three distinct stages, each corresponding to StyleBook extraction, StyleBook correspondence learning, and arbitrary-ratio synthesis. Extensive …

Dgl: Dynamic Global-Local Information Aggregation For Scalable Vrp Generalization With Self-Improvement Learning, Yubin Xiao, Yuesong Wu, Rui Cao, Di Wang, Zhiguang Cao, Xuan Wu, Peng Zhao, Yuanshu Li, You Zhou, Yuan Jiang

Research Collection School Of Computing and Information Systems

The Vehicle Routing Problem (VRP) is a critical combinatorial optimization problem with wide-reaching real-world applications, particularly in logistics, transportation. While neural network-based VRP solvers have shown impressive results on test instances similar to training data, their performance often degrades when faced with varying scales and unseen distributions, limiting their practical applicability. To overcome these limitations, we introduce DGL (Dynamic Global-Local Information Aggregation), a novel model that combines global and local information to effectively solve VRPs. DGL dynamically adjusts local node selections within a localized range, capturing local invariance across problems of different scales and distributions, thereby enhancing generalization. At the …

Coupling Category Alignment For Graph Domain Adaptation, Nan Yin, Xiao Teng, Zhiguang Cao, Mengzhu Wang

Research Collection School Of Computing and Information Systems

Graph domain adaptation (GDA), which transfers knowledge from a labeled source domain to an unlabeled target graph domain, attracts considerable attention in numerous fields. However, existing methods commonly employ message-passing neural networks (MPNNs) to learn domain-invariant representations by aligning the entire domain distribution, inadvertently neglecting category-level distribution alignment and potentially causing category confusion. To address the problem, we propose an effective framework named Coupling Category Alignment (CoCA) for GDA, which effectively addresses the category alignment issue with theoretical guarantees. CoCA incorporates a graph convolutional network branch and a graph kernel network branch, which explore graph topology in implicit and explicit …

Map As A By-Product: Collective Landmark Mapping From Imu Data And User-Provided Texts In Situated Tasks, Ryo Yonetani, Kotaro Hara

Research Collection School Of Computing and Information Systems

This paper presents Collective Landmark Mapper, a novel map-as-a-by-product system for generating semantic landmark maps of indoor environments. Consider users engaged in situated tasks that require them to navigate these environments and regularly take notes on their smartphones. Collective Landmark Mapper exploits the smartphone's IMU data and the user's free text input during these tasks to identify a set of landmarks encountered by the user. The identified landmarks are then aggregated across multiple users to generate a unified map representing the positions and semantic information of all landmarks. In developing the proposed system, we focused specifically on retail applications and …

Towards Multimodal Emotional Support Conversation Systems, Yuqi Chu, Lizi Liao, Zhiyuan Zhou, Chong-Wah Ngo, Richang Hong

Research Collection School Of Computing and Information Systems

The integration of conversational artificial intelligence (AI) into mental health care promises a new horizon for therapist-client interactions, aiming to closely emulate the depth and nuance of human conversations. Despite the potential, the current landscape of conversational AI is markedly limited by its reliance on single-modal data, constraining the systems’ ability to empathize and provide effective emotional support. This limitation stems from a paucity of resources that encapsulate the multimodal nature of human communication essential for therapeutic counseling. To address this gap, we introduce the Multimodal Emotional Support Conversation (MESC) dataset, a first-of-its-kind resource enriched with comprehensive annotations across text, …

Guiding Multiple Remote Users In Physical Tasks With Language-Driven Robotic Telepresence, Ruyi Li, Jingfei Guo, Xinyi Zhang, Xuji Zhang, Zeqing Li, Jiannan Li, Jiangtao Gong

Research Collection School Of Computing and Information Systems

Remote assistance through robotic telepresence could involve both control and memory challenges, particularly in one expert to multiple workers situation. In this work, we proposed a novelty language-driven interface to facilitate remote collaboration through telepresence robots. Through operations and maintenance expert interviews and a scenario simulation study, we identified key pain points in executing one-expert-multiple-workers remote guidance using the telepresence robot and proposed two design goals, which together consist of five sub-design goals with corresponding features. These features were integrated into a standard telepresence robot, resulting in the development of a Collaborative LLM-based Embodied Assistant Robot, named CLEAR Robot. A …

Implementing Slack-Free Custom Penalty Function For Qubo On Gate-Based Quantum Computers, Xin Wei Lee, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Solving NP-hard constrained combinatorial optimization problems using quantum algorithms remains a challenging yet promising avenue toward quantum advantage. Variational Quantum Algorithms (VQAs), such as the Variational Quantum Eigensolver (VQE), typically require constrained problems to be reformulated as unconstrained ones using penalty methods. A common approach introduces slack variables and quadratic penalties in the QUBO formulation to handle inequality constraints. However, this leads to increased qubit requirements and often distorts the optimization landscape, making it harder to find high-quality feasible solutions. To address these issues, we explore a slack-free formulation that directly encodes inequality constraints using custom penalty functions, specifically the …

Conv4rec: A 1‑By‑1 Convolutional Autoencoder For User Profiling Through Joint Analysis Of Implicit And Explicit Feedbacks, Antoine Ledent, Petr Kasalický, Rodrigo Alves, Hady Wirawan Lauw

Research Collection School Of Computing and Information Systems

We introduce a new convolutional autoencoder architecture for user modeling and recommendation tasks with several improvements over the state of the art. First, our model has the flexibility to learn a set of associations and combinations between different interaction types in a way that carries over to each user and item. Second, our model is able to learn jointly from both the explicit ratings and the implicit information in the sampling pattern (which we refer to as ”implicit feedback”). It can also make separate predictions for the probability of consuming content and the likelihood of granting it a high rating …

Rethinking Cognitive Complexity For Unit Tests: Toward A Readability-Aware Metric Grounded In Developer Perception, Wendkûuni C. Ouédraogo, Yinghua Li, Xueqi Dang, Xin Zhou, Anil Koyuncu, Jacques Klein, David Lo, Tegawendé F. Bissyandé

Research Collection School Of Computing and Information Systems

Automatically generated unit tests-from searchbased tools like EvoSuite or LLMs-vary significantly in structure and readability. Yet most evaluations rely on metrics like Cyclomatic Complexity and Cognitive Complexity, designed for functional code rather than test code. Recent studies have shown that SonarSource's Cognitive Complexity metric assigns nearzero scores to LLM-generated tests, yet its behavior on EvoSuitegenerated tests and its applicability to test-specific code structures remain unexplored. We introduce CCTR, a Test-Aware Cognitive Complexity metric tailored for unit tests. CCTR integrates structural and semantic features like assertion density, annotation roles, and test composition patterns-dimensions ignored by traditional complexity models but critical for …

Flow, Immersion, And Presence: Creating Virtual Reality And Engagement In The Era Of Ubiquitous And Intelligent Technologies, Yi Maggie Guo, Fiona Fui-Hoon Nah, Nannan Xi, Marshall Scott Poole

Research Collection School Of Computing and Information Systems

Researchers use the concepts of flow, immersion, and presence to explain the usage of and engagement (e.g., cognitive absorption) with information technology. In this special issue, we showcase four papers on empirical investigations of flow and immersion, their antecedents, and their outcomes. These papers address research questions that range from investigating the antecedents and consequences of immersion in head-mounted displays of virtual reality, designing for the flow experience in extended reality, studying factors influencing user engagement in the metaverse, and identifying adverse effects of work-related flow. We also provide directions and suggestions for future research.

Vibemus: Proactive Agentic System For Music Personalization, Zhiliang Guo, Teng Tu, Yunshan Ma, Xun Yang

Research Collection School Of Computing and Information Systems

Large language models (LLMs) enable diverse forms of AI-assisted creation, yet they often struggle to bridge the preference-articulation gap: users may provide incomplete or vague intentions or lack the vocabulary to specify what they want, yielding outputs misaligned with true preferences. To address this gap and facilitate music creation in a vibe-centric environment, we introduce VibeMus, a proactive agentic system built on open-source components. The system engages in multi-turn dialogue to progressively determine the music’s emotion, genre, lyrics, and other aspects before generation. Simulated evaluations show that proactive clarification improves alignment with users’ intended nuances. Our approach is training-free, leveraging …

Ponzilens+: Visualizing Bytecode Actions For Smart Ponzi Scheme Identification, Xiaolin Wen, Tai D. Nguyen, Shaolun Ruan, Qiaomu Shen, Jun Sun, Feida Zhu, Yong Wang

Research Collection School Of Computing and Information Systems

With the prevalence of smart contracts, smart Ponzi schemes have become a common fraud on blockchain and have caused significant financial loss to cryptocurrency investors in the past few years. Despite the critical importance of detecting smart Ponzi schemes, a reliable and transparent identification approach adaptive to various smart Ponzi schemes is still missing. To fill the research gap, we first extract semantic-meaningful actions to represent the execution behaviors specified in smart contract bytecodes, which are derived from a literature review and in-depth interviews with domain experts. We then propose PonziLens+, a novel visual analytic approach that provides an intuitive …

Managing Rumors On Electronic Interaction Platforms: How Management Responses Affect Investor Reaction, Runyu Wang, Zili Zhang, Keng Siau, Ziqiong Zhang

Research Collection School Of Computing and Information Systems

This study investigates how listed firms respond to investors’ rumor-related inquiries and examines the impact of these responses on investor reactions, as indicated by subsequent daily abnormal stock returns (ARs). Using a unique dataset of question-and-answer (Q&A) interactions from China’s major e-interaction platforms, established by the stock exchanges, our study provides insights into regulated firm-investor communications in a structured Q&A setting. Unlike informal social media channels, these platforms enable official responses from firm representatives, typically board secretaries, under direct regulatory oversight. By analyzing rumor-related Q&A pairs with regression models and several robustness checks, we find that firms can benefit from …

Shortcuts Everywhere And Nowhere: Exploring Multi-Trigger Backdoor Attacks, Yige Li, Jiabo He, Hanxun Huang, Jun Sun, Xingjun Ma, Yu-Gang Jiang

Research Collection School Of Computing and Information Systems

Backdoor attacks have become a significant threat to the pre-training and deployment of deep neural networks (DNNs). Although numerous methods for detecting and mitigating backdoor attacks have been proposed, most rely on identifying and eliminating the “shortcut” created by the backdoor, which links a specific source class to a target class. However, these approaches can be easily circumvented by designing multiple backdoor triggers that create shortcuts everywhere and therefore nowhere specific. In this study, we explore the concept of Multi-Trigger Backdoor Attacks (MTBAs), where multiple adversaries leverage different types of triggers to poison the same dataset. By proposing and investigating …

Boosting Symbolic Execution For Vulnerability Detection, Haoxin Tu

Dissertations and Theses Collection (Open Access)

Software systems written by humans tend to be unreliable and insecure, hence, bugs or vulnerabilities in them are inevitable. Symbolic execution has shown considerable potential in detecting diverse types of software bugs and also vulnerabilities that have severe security implications. However, existing symbolic execution engines still suffer from at least three fundamental limitations in memory modeling, path exploration, and structured input generation, which significantly impede existing engines from efficiently and effectively detecting software bugs and vulnerabilities.

The objective of this dissertation is to boost existing symbolic execution engines by designing a new memory model, two new path exploration strategies, and …

Memory-Efficient Graph Processing On Gpus: Reducing Intermediate Data Structure Overhead, Chang Ye

Dissertations and Theses Collection (Open Access)

The increasing scale of real-world graphs in domains such as fraud detection, community detection, and biological analysis demands high-throughput, memory-efficient graph processing solutions. GPUs offer massive parallelism for accelerating such workloads, and numerous frameworks have been developed to leverage their computational power. These frameworks primarily focus on optimizing scheduling to better align graph processing with GPU architectures. It performs well for algorithms with low memory demands, such as BFS, SSSP, and PageRank. However, for algorithms that require substantial memory, such as label propagation, and subgraph counting, the limited memory capacity of GPUs often becomes a significant bottleneck.

This dissertation addresses …

The Global Phase Space Of The Three-Vortex Interaction System And Its Application To Vortex-Dipole Scattering, Atul Anurag

Dissertations

This dissertation presents a global reduction of the classical three-vortex problem that is free from coordinate singularities, enabling a comprehensive analysis of the system's dynamics across all circulation regimes.

To achieve this, a two-step symplectic reduction procedure is developed. The first step introduces Jacobi coordinates adapted to the symplectic structure of the vortex system, and the second applies a Lie-Poisson reduction to the resulting system. This formulation eliminates the non-physical singularities associated with collinear vortex configurations and facilitates a global phase space analysis, including a detailed and novel investigation of bifurcations.

Within this reduced framework, all relative fixed points are …

Robust Ai Solutions For Financial Markets Through Generative Modeling, Dynamic Graph Learning, And Reinforcement-Based Portfolio Optimization, Jingyi Gu

Dissertations

Financial markets are inherently uncertain and dynamic, driven by complex factors such as macroeconomic signals, investor sentiment, and evolving inter-asset relationships. While machine learning has advanced financial modeling, existing approaches often fall short in addressing the real-world intricacies of finance. This dissertation confronts two critical challenges, human-driven stochasticity and risk-intensive decision-making under real-world trading constraints, while seizing a pivotal opportunity, the structural dynamics of evolving financial systems. These elements are foundational to advancing robust and practical financial intelligence.

To this end, this dissertation develops a unified framework for robust financial modeling and decision-making. The framework is architected as a progressive, …

Large-Scale Graph Algorithms And Applications With An Emphasis On Fintech Data, Fuhuan Li

Dissertations

Graph algorithms are essential analytical tools with applications spanning cybersecurity, biology, social media, and increasingly, financial technology (FinTech). The complex and interconnected nature of financial data, particularly in cryptocurrency networks, presents unique opportunities for graph-based analysis in fraud detection and anomaly identification.

This dissertation presents the design and implementation of scalable graph algorithms tailored for large-scale networks, with particular emphasis on FinTech applications. The primary contributions include: (1) novel cover-edge based triangle counting algorithms that significantly reduce computational overhead through breadth-first search preprocessing, achieving substantial speedups over traditional methods and dramatic communication reduction in distributed settings, (2) optimized parallel implementations …