Investigation Of Social Networks Upon Academic Performance And Mental Health,
2024
California Polytechnic State University, San Luis Obispo
Investigation Of Social Networks Upon Academic Performance And Mental Health, Rachel Izenson
Master's Theses
It has been shown that computing students have a statistically significantly lower overall sense of belongingness compared to other science students. A sense of community is important for many reasons. For example, there are studies that show that a student's sense of belonging correlates with improved academic performance. Our research aims to analyze the sense of belonging among computing students at Cal Poly San Luis Obispo through a network science lens. We surveyed for their sense of belonging, as well as their social network, to understand how friendships impact one's sense of belonging. When student responses were split by gender, …
Adan: Adaptive Nesterov Momentum Algorithm For Faster Optimizing Deep Models,
2024
Peking University
Adan: Adaptive Nesterov Momentum Algorithm For Faster Optimizing Deep Models, Xingyu Xie, Pan Zhou, Huan Li, Zhouchen Lin, Shuicheng Yan
Research Collection School Of Computing and Information Systems
In deep learning, different kinds of deep networks typically need different optimizers, which have to be chosen after multiple trials, making the training process inefficient. To relieve this issue and consistently improve the model training speed across deep networks, we propose the ADAptive Nesterov momentum algorithm, Adan for short. Adan first reformulates the vanilla Nesterov acceleration to develop a new Nesterov momentum estimation (NME) method, which avoids the extra overhead of computing gradient at the extrapolation point. Then Adan adopts NME to estimate the gradient's first- and second-order moments in adaptive gradient algorithms for convergence acceleration. Besides, we prove that …
Ohss: Optimizing Homomorphic Secret Sharing To Support Fast Matrix Multiplication,
2024
Singapore Management University
Ohss: Optimizing Homomorphic Secret Sharing To Support Fast Matrix Multiplication, Shuguang Zhang, Jianli Bai, Kun Tu, Ziyue Yin, Chan Liu
Research Collection School Of Computing and Information Systems
Homomorphic Secret Sharing (HSS) has evolved as a state-of-the-art methodology for achieving secure two-party computation, synthesizing the advantages of secret sharing and homomorphic encryption. This amalgamation ensures minimal computational and communicational overhead, making it particularly adept at arithmetic operations. However, HSS faces challenges in scalability and efficiency when confronted with extensive matrix operations, including both matrix-vector and matrix-matrix multiplications, which are fundamental in numerous privacy-preserving computations, notably within the realm of privacy-preserving machine learning. In this research, we introduce Optimized Homomorphic Secret Sharing (OHSS), a refined version of HSS, crafted to address these limitations. Our contributions include enhancements to the …
Harnessing Collective Structure Knowledge In Data Augmentation For Graph Neural Networks,
2024
Singapore Management University
Harnessing Collective Structure Knowledge In Data Augmentation For Graph Neural Networks, Rongrong Ma, Guansong Pang, Ling Chen
Research Collection School Of Computing and Information Systems
Graph neural networks (GNNs) have achieved state-of-the-art performance in graph representation learning. Message passing neural networks, which learn representations through recursively aggregating information from each node and its neighbors, are among the most commonly-used GNNs. However, a wealth of structural information of individual nodes and full graphs is often ignored in such process, which restricts the expressive power of GNNs. Various graph data augmentation methods that enable the message passing with richer structure knowledge have been introduced as one main way to tackle this issue, but they are often focused on individual structure features and difficult to scale up with …
Decoding Neural Networks: An Information-Theoretic Guide To Interpretability, Error Analysis And Efficiency,
2024
Florida Institute of Technology
Decoding Neural Networks: An Information-Theoretic Guide To Interpretability, Error Analysis And Efficiency, Mackenzie J. Meni
Theses and Dissertations
This dissertation addresses critical challenges in neural network design by leveraging entropy-based techniques to improve model efficiency, interpretability, and bias reduction. Focusing on the unique demands of computer vision applications, particularly object detection and classification for real-time systems, this work introduces a series of innovative methods centered on information theory. At the core of these methods is the Probabilistic Explanations of Entropic Knowledge (PEEK) framework, a tool developed to analyze and visualize entropy distributions across feature maps. PEEK offers insights into information flow within neural networks, making it possible to pinpoint layers that contribute meaningfully to decision-making or identify those …
Holistic Correlation Measure For Enhanced Encapsulation Of Trait Heterogeneity And Discovery Of Co-Expression,
2024
University of Missouri-St. Louis
Holistic Correlation Measure For Enhanced Encapsulation Of Trait Heterogeneity And Discovery Of Co-Expression, Zachary Valleroy
Theses
Large-scale, high-dimensional data analyses can be computationally prohibitive due to combinatorial explosion of the search space for finding complex patterns; a viable alternative is network modeling for abstraction and quantifying intrinsic data associations. Prominent network analysis methods furnish frameworks for model synthesis and validation but rely on standard correlation measures impaired by semi-supervised biases, latent heterogeneity, and uneven discretization techniques. Here we investigate a holistic measure for encapsulating data heterogeneity for enhanced efficacy of revealing complex patterns through network analysis. Our unique correlation metric, K-medoids Utility for Duo Original Similarities (Kudos), exhaustively factors real-valued analyte data to compute …
Competitive Conquest: Charting The Climb To Pokémon Supremacy,
2024
Mississippi State University
Competitive Conquest: Charting The Climb To Pokémon Supremacy, Robert Dilworth
BCoE Publications
This manuscript presents a comprehensive exploration of optimizing Pokémon gameplay through data-driven methodologies, aimed at enhancing competitive performance in high-stakes environments. In the first section, we introduce a robust Pokémon teambuilding algorithm that leverages statistical analysis of championship-winning compositions. By employing multiple linear regression techniques, we predict team performance based on critical factors such as Base Stat Totals (BSTs) and various coverage types. This integration of data science principles into Pokémon strategy underscores the importance of offensive capabilities over defensive considerations, ultimately contributing to advancements in teambuilding strategies. Our proficiency in R programming facilitated the development of an efficient codebase …
Irl For Restless Multi-Armed Bandits With Applications In Maternal And Child Health,
2024
Singapore Management University
Irl For Restless Multi-Armed Bandits With Applications In Maternal And Child Health, Gauri Jain, Pradeep Varakantham, Haifeng Xu, Aparna Taneja, Prashant Doshi, Milind Tambe
Research Collection School Of Computing and Information Systems
Public health practitioners often have the goal of monitoring patients and maximizing patients’ time spent in “favorable” or healthy states while being constrained to using limited resources. Restless multi-armed bandits (RMAB) are an effective model to solve this problem as they are helpful to allocate limited resources among many agents under resource constraints, where patients behave differently depending on whether they are intervened on or not. However, RMABs assume the reward function is known. This is unrealistic in many public health settings because patients face unique challenges and it is impossible for a human to know who is most deserving …
Lr-Auth: Towards Practical Implementation Of Implicit User Authentication On Earbuds,
2024
Singapore Management University
Lr-Auth: Towards Practical Implementation Of Implicit User Authentication On Earbuds, Changshuo Hu, Xiao Ma, Xinger Huang, Yiran Shen, Dong Ma
Research Collection School Of Computing and Information Systems
The increasing use of earbuds in applications like immersive entertainment and health monitoring necessitates effective implicit user authentication systems to preserve the privacy of sensitive data and provide personalized experiences. Existing approaches, which leverage physiological cues (e.g., jawbone structure) and behavioral cues (e.g., gait), face challenges such as limited usability, high delay and energy overhead, and significant computational demands, rendering them impractical for resource-constrained earbuds. To address these issues, we present LR-Auth, a lightweight, user-friendly implicit authentication system designed for various earbud usage scenarios. LR-Auth utilizes the modulation of sound frequencies by the user's unique occluded ear canal, generating user-specific …
A Large Scale Multi Institutional Study For Radiomics Driven Machine Learning For Meningioma Grading,
2024
Thomas Jefferson University
A Large Scale Multi Institutional Study For Radiomics Driven Machine Learning For Meningioma Grading, Mert Karabacak, Shiv Patil, Rui Feng, Raj K. Shrivastava, Konstantinos Margetis
Department of Medicine Faculty Papers
This study aims to develop and evaluate radiomics-based machine learning (ML) models for predicting meningioma grades using multiparametric magnetic resonance imaging (MRI). The study utilized the BraTS-MEN dataset's training split, including 698 patients (524 with grade 1 and 174 with grade 2-3 meningiomas). We extracted 4872 radiomic features from T1, T1 with contrast, T2, and FLAIR MRI sequences using PyRadiomics. LASSO regression reduced features to 176. The data was split into training (60%), validation (20%), and test (20%) sets. Five ML algorithms (TabPFN, XGBoost, LightGBM, CatBoost, and Random Forest) were employed to build models differentiating low-grade (grade 1) from high-grade …
Radiomics-Based Machine Learning With Natural Gradient Boosting For Continuous Survival Prediction In Glioblastoma,
2024
Thomas Jefferson University
Radiomics-Based Machine Learning With Natural Gradient Boosting For Continuous Survival Prediction In Glioblastoma, Mert Karabacak, Shiv Patil, Zachary C. Gersey, Ricardo J. Komotar, Konstantinos Margetis
SKMC Student Presentations and Publications
(1) Background: Glioblastoma (GBM) is the most common primary malignant brain tumor in adults, with an aggressive disease course that requires accurate prognosis for individualized treatment planning. This study aims to develop and evaluate a radiomics-based machine learning (ML) model to estimate overall survival (OS) for patients with GBM using pre-treatment multi-parametric magnetic resonance imaging (MRI). (2) Methods: The MRI data of 865 patients with GBM were assessed, comprising 499 patients from the UPENN-GBM dataset and 366 patients from the UCSF-PDGM dataset. A total of 14,598 radiomic features were extracted from T1, T1 with contrast, T2, and FLAIR MRI sequences …
Algorithmic Reason-Giving, Arbitrary And Capricious Review, And The Need For A Clear Normative Baseline,
2024
Yale Law School
Algorithmic Reason-Giving, Arbitrary And Capricious Review, And The Need For A Clear Normative Baseline, Cameron Averill
University of Cincinnati Law Review
Federal agencies have caught the artificial intelligence (AI) bug. A December 2023 report by the Government Accountability Office found that twenty of twenty-three federal agencies surveyed reported using some form of AI, with about two hundred current use cases for algorithms and about one thousand more in the planning phase. These agencies are using algorithms in all aspects of administration, including rulemaking, adjudication, and enforcement. The risks of AI are well-documented. Previous work has shown that algorithms can be, among other things, biased and prone to error. However, perhaps no problem poses a more serious threat to the use of …
Review Of Current Trends In Information Technology Concerning Phonetic Similarity”,
2024
Faculty of Medical Sciences, Jabir ibn Hayyan University for Medical and Pharmaceutical Sciences, Najaf, Iraq
Review Of Current Trends In Information Technology Concerning Phonetic Similarity”, Zaid Rajih Mohammed, Ahmed H. Aliwy
Al-Bahir
With the increasing availability of textual information in various languages via the Internet in homes and companies through Internet and intranet services, there is an urgent need for the technologies and tools necessary to process this information, phonetic representation, and voice interaction. For example voice to voice machine translation need to phonetic mapping and similarity among the languages especially for names and foreign words. This one example of the importance of phonetic mapping and similarity. This article aims to describe, in detail, the recent surge in interest and advancements in phonetic similarity (PS), phonetic representation, and phonetic mapping researches. PS …
Investigating Public Acceptance Of Responses To Public Emergencies: Based On Text Transparency And Empathy Sentiment Analysis,
2024
School of Economics and Management, Anhui Polytechnic University, Wuhu 241000
Investigating Public Acceptance Of Responses To Public Emergencies: Based On Text Transparency And Empathy Sentiment Analysis, Xuefeng Zhang, Yelin Huang
Journal of Scientific Information Research
[Purpose/significance]Regarding the responses to public emergencies published by official agencies on social media, this study aims to measure information transparency and empathy in the response text, and further to investigate their influence on public acceptance of responses. [Method/process]This study used public emergency responses published on Sina Weibo, a Chinese popular social media, as data source. Through carefully collecting and filtering, we finally acquired 170 public emergency responses released from 2021 to 2023. Furthermore, by using methods of content analysis, manual coding, and natural language processing, we measured information transparency of responses from three aspects: information disclosure, information accuracy, and information …
Optimizing Sensor Placements For Fixed Source Localization: A Distinct Subset Distance Sum Problem,
2024
California Polytechnic State University, San Luis Obispo
Optimizing Sensor Placements For Fixed Source Localization: A Distinct Subset Distance Sum Problem, Peter Chinh
College of Engineering Summer Undergraduate Research Program
This research addresses the problem of optimizing sensor placements for fixed source localization using distinct subset distance sums. Given a line L in R2 and a set P of n points on one side of L, we seek to locate a minimal set S of points on L such that for any two distinct subsets Q and R of P, there exists a point s∈S where the sum of reciprocal distances from Q to s uniquely identifies Q. Our results show that a minimal sensor set S of size 1 is always feasible, but computing this set exactly proves …
Empirical Support For Algorithmic Conjectures,
2024
California Polytechnic State University, San Luis Obispo
Empirical Support For Algorithmic Conjectures, Shayan Daijavad
College of Engineering Summer Undergraduate Research Program
Our project focuses on a particular Markov Chain Monte Carlo algorithm, with applications in statistical physics, known as hardcore model Glauber dynamics. The target distribution of Glauber dynamics is a distribution of all of the independent sets within a graph. An independent set is a set of vertices within a graph with no two vertices in the set containing an edge between them. Our goal is to find whether or not the Glauber dynamics for sampling independent sets on trees mixes in time O(nlogn), and determining how the mixing time changes if we bias the algorithm in favor of larger …
Leveraging Tradespace-Exploration For A Senior Project Team Formation Application,
2024
California Polytechnic State University, San Luis Obispo
Leveraging Tradespace-Exploration For A Senior Project Team Formation Application, Miguel Saenz
College of Engineering Summer Undergraduate Research Program
This project revolves around the development of an app in MATLAB that leverages the VASSAR rule-based system and a genetic algorithm to form groups of teams for the Mechanical Engineering Senior Design project class. We leveraged the iterative design process to eventually attain a functional app with a reasonable runtime that works provided correctly formatted rulesheets describing student project preference and member preference.
Constrained Assortment Optimization Under The Cross-Nested Logit Model,
2024
Singapore Management University
Constrained Assortment Optimization Under The Cross-Nested Logit Model, Cuong Le, Tien Mai
Research Collection School Of Computing and Information Systems
We study the assortment optimization problem under general linear constraints, where the customer choice behavior is captured by the cross-nested logit model. In this problem, there is a set of products organized into multiple subsets (or nests), where each product can belong to more than one nest. The aim is to find an assortment to offer to customers so that the expected revenue is maximized. We show that, under the cross-nested logit model, the unconstrained assortment problem is NP-hard even when there are only two nests, and the problem is generally NP-hard to approximate to any constant factors. To tackle …
Transformer-Based Joint Learning Approach For Text Normalization In Vietnamese Automatic Speech Recognition Systems,
2024
Singapore Management University
Transformer-Based Joint Learning Approach For Text Normalization In Vietnamese Automatic Speech Recognition Systems, The Viet Bui, Tho Chi Luong, Oanh Thi Tran
Research Collection School Of Computing and Information Systems
In this article, we investigate the task of normalizing transcribed texts in Vietnamese Automatic Speech Recognition (ASR) systems in order to improve user readability and the performance of downstream tasks. This task usually consists of two main sub-tasks: predicting and inserting punctuation (i.e., period, comma); and detecting and standardizing named entities (i.e., numbers, person names) from spoken forms to their appropriate written forms. To achieve these goals, we introduce a complete corpus including of 87,700 sentences and investigate conditional joint learning approaches which globally optimize two sub-tasks simultaneously. The experimental results are quite promising. Overall, the proposed architecture outperformed the …
Self-Replication Via Tile Self-Assembly,
2024
University of Arkansas, Fayetteville
Self-Replication Via Tile Self-Assembly, Andrew Alseth, Daniel Hader, Matthew J. Patitz
Computer Science and Computer Engineering Faculty Publications and Presentations
In this paper we present a model containing modifications to the Signal-passing Tile Assembly Model (STAM), a tile-based self-assembly model whose tiles are capable of activating and deactivating glues based on the binding of other glues. These modifications consist of an extension to 3D, the ability of tiles to form “flexible” bonds that allow bound tiles to rotate relative to each other, and allowing tiles of multiple shapes within the same system. We call this new model the STAM*, and we present a series of constructions within it that are capable of self-replicating behavior. Namely, the input seed assemblies to …
