Physical Sciences and Mathematics Commons^™

The Manifesto For Teaching And Learning In A Time Of Generative Ai: A Critical Collective Stance To Better Navigate The Future, Aras Bozkurt, Junhong Xiao, Robert Farrow, John Y. H. Bai, Chrissi Nerantzi, Stephanie Moore, Jon Dron, Christian M. Stracke, Lenandlar Singh, Helen Crompton, Apostolos Koutropoulos, Evgenii Terentev, Angelica Pazurek, Mark Nichols, Alexander M. Sidorkin, Eamon Costello, Steven Watson, Dónal Mulligan, Sarah Honeychurch, Charles B. Hodges, Mike Sharples, Andrew Swindell, Isak Frumin, Ahmed Tlili, Patricia J. Slagter Van Tryon, Melissa Bond, Maha Bali, Jing Leng, Kai Zhang, Mutlu Cukurnova, Thomas K. F. Chiu, Kyungmee Lee, Stefan Hrastinski, Manuel B. Garcia, Ramesh Chander Sharma, Bryan Alexander, Olaf Zawacki-Richter, Henk Huijser, Petar Jandrić, Chanjin Zheng, Peter Shea, Josep M. Duart, Chryssa Themeli, Anton Vorochkov, Sunagül Sani-Bozkurt, Robert L. Moore, Tutaleni Iita Asino

STEMPS Faculty Publications

This manifesto critically examines the unfolding integration of Generative AI (GenAI), chatbots, and algorithms into higher education, using a collective and thoughtful approach to navigate the future of teaching and learning. GenAI, while celebrated for its potential to personalize learning, enhance efficiency, and expand educational accessibility, is far from a neutral tool. Algorithms now shape human interaction, communication, and content creation, raising profound questions about human agency and biases and values embedded in their designs. As GenAI continues to evolve, we face critical challenges in maintaining human oversight, safeguarding equity, and facilitating meaningful, authentic learning experiences. This manifesto emphasizes that …

Machine Learning As A Tool For Early Detection: A Focus On Late-Stage Colorectal Cancer Across Socioeconomic Spectrums, Hadiza Galadima, Rexford Anson-Dwamena, Ashley Johnson, Ghalib Bello, Georges Adunlin, James Blando

Community & Environmental Health Faculty Publications

Purpose: To assess the efficacy of various machine learning (ML) algorithms in predicting late-stage colorectal cancer (CRC) diagnoses against the backdrop of socio-economic and regional healthcare disparities. Methods: An innovative theoretical framework was developed to integrate individual- and census tract-level social determinants of health (SDOH) with sociodemographic factors. A comparative analysis of the ML models was conducted using key performance metrics such as AUC-ROC to evaluate their predictive accuracy. Spatio-temporal analysis was used to identify disparities in late-stage CRC diagnosis probabilities. Results: Gradient boosting emerged as the superior model, with the top predictors for late-stage CRC diagnosis being anatomic site, …

Machine-Learning-Enabled Diagnostics With Improved Visualization Of Disease Lesions In Chest X-Ray Images, Md. Fashiar Rahman, Tzu-Liang (Bill) Tseng, Michael Pokojovy, Peter Mccaffrey, Eric Walser, Scott Moen, Alex Vo, Johnny C. Ho

Mathematics & Statistics Faculty Publications

The class activation map (CAM) represents the neural-network-derived region of interest, which can help clarify the mechanism of the convolutional neural network’s determination of any class of interest. In medical imaging, it can help medical practitioners diagnose diseases like COVID-19 or pneumonia by highlighting the suspicious regions in Computational Tomography (CT) or chest X-ray (CXR) film. Many contemporary deep learning techniques only focus on COVID-19 classification tasks using CXRs, while few attempt to make it explainable with a saliency map. To fill this research gap, we first propose a VGG-16-architecture-based deep learning approach in combination with image enhancement, segmentation-based region …

A Generative Approach For Document Enhancement With Small Unpaired Data, Mohammad Shahab Uddin, Wael Khallouli, Andres Sousa-Poza, Samuel Kovacic, Jiang Li

Engineering Management & Systems Engineering Faculty Publications

Shipbuilding drawings, crafted manually before the digital era, are vital for historical reference and technical insight. However, their digital versions, stored as scanned PDFs, often contain significant noise, making them unsuitable for use in modern CAD software like AutoCAD. Traditional denoising techniques struggle with the diverse and intense noise found in these documents, which also does not adhere to standard noise models. In this paper, we propose an innovative generative approach tailored for document enhancement, particularly focusing on shipbuilding drawings. For a small, unpaired dataset of clean and noisy shipbuilding drawing documents, we first learn to generate the noise in …

Persistent Relative Homology For Topological Data Analysis, Christian J. Lentz

Mathematics, Statistics, and Computer Science Honors Projects

A central problem in data-driven scientific inquiry is how to interpret structure in noisy, high-dimensional data. Topological data analysis (TDA) provides a solution via the language of persistent homology, which encodes features of interest as holes within a filtration of the data. The recently presented U-Match Decomposition places the standard persistence computation in a flexible form, allowing for straight-forward extensions of the algorithm to variations of persistent homology. We describe U-Match Decomposition in the context of persistent homology, and extend it to an algorithm for persistent relative homology, providing proofs for the correctness and stability of the presented algorithm.

Inexact Fixed-Point Proximity Algorithm For The ℓ₀ Sparse Regularization Problem, Ronglong Fang, Yuesheng Xu, Mingsong Yan

Mathematics & Statistics Faculty Publications

We study inexact fixed-point proximity algorithms for solving a class of sparse regularization problems involving the ℓ₀ norm. Specifically, the ℓ₀ model has an objective function that is the sum of a convex fidelity term and a Moreau envelope of the ℓ₀ norm regularization term. Such an ℓ₀ model is non-convex. Existing exact algorithms for solving the problems require the availability of closed-form formulas for the proximity operator of convex functions involved in the objective function. When such formulas are not available, numerical computation of the proximity operator becomes inevitable. This leads to inexact iteration algorithms. We investigate in this …

Mapping Seagrass Distribution And Abundance: Comparing Areal Cover And Biomass Estimates Between Space-Based And Airborne Imagery, Victoria J. Hill, Richard C. Zimmerman, Dorothy A. Byron, Kenneth L. Heck Jr.

OES Faculty Publications

This study evaluated the effectiveness of Planet satellite imagery in mapping seagrass coverage in Santa Rosa Sound, Florida. We compared very-high-resolution aerial imagery (0.3 m) collected in September 2022 with high-resolution Planet imagery (~3 m) captured during the same period. Using supervised classification techniques, we accurately identified expansive, continuous seagrass meadows in the satellite images, successfully classifying 95.5% of the 11.18 km² of seagrass area delineated manually from the aerial imagery. Our analysis utilized an occurrence frequency (OF) product, which was generated by processing ten clear-sky images collected between 8 and 25 September 2022 to determine the frequency with which …

A Formalism For Extracting Track Functions From Jet Measurements, Kyle Lee, Ian Moult, Felix Ringer, Wouter J. Waalewijn

Physics Faculty Publications

The continued success of the jet substructure program will require widespread use of tracking information to enable increasingly precise measurements of a broader class of observables. The recent reformulation of jet substructure in terms of energy correlators has simplified the incorporation of universal non-perturbative matrix elements, so called “track functions”, in jet substructure calculations. These advances make it timely to understand how these universal non-perturbative functions can be extracted from hadron collider data, which is complicated by the use jet algorithms. In this paper we introduce a new class of jet functions, which we call (semi-inclusive) track jet functions, which …

An Open Natural Language Processing (Nlp) Framework For Ehr-Based Clinical Research: A Case Demonstration Using The National Covid Cohort Collaborative (N3c), Sijia Liu, Andrew Wen, Liwei Wang, Huan He, Sunyang Fu, Robert Miller, Andrew Williams, Daniel Harris, Ramakanth Kavuluru, Mei Liu, Noor Abu-El-Rub, Dalton Schutte, Rui Zhang, Masoud Rouhizadeh, John D Osborne, Yongqun He, Umit Topaloglu, Stephanie S Hong, Joel H Saltz, Thomas Schaffter, Emily Pfaff, Christopher G Chute, Tim Duong, Melissa A Haendel, Rafael Fuentes, Peter Szolovits, Hua Xu, Hongfang Liu

Faculty, Staff and Student Publications

Despite recent methodology advancements in clinical natural language processing (NLP), the adoption of clinical NLP models within the translational research community remains hindered by process heterogeneity and human factor variations. Concurrently, these factors also dramatically increase the difficulty in developing NLP models in multi-site settings, which is necessary for algorithm robustness and generalizability. Here, we reported on our experience developing an NLP solution for Coronavirus Disease 2019 (COVID-19) signs and symptom extraction in an open NLP framework from a subset of sites participating in the National COVID Cohort (N3C). We then empirically highlight the benefits of multi-site data for both …

Hiking Trail Generation In Infinite Landscapes, Matthew Jensen

MS in Computer Science Project Reports

This project procedurally generates an infinite wilderness populated with deterministic hiking trails. Our approach recognizes that hiking trails depend on contextual information beyond the location of the path itself. To address this, we implemented a layered procedural system that orchestrates the generation process. This helps ensure the availability of contextual data at each stage. The first layer handles terrain generation, establishing the foundational landscape upon which trails will traverse. Subsequent layers handle point of interest identification and selection, trail network optimization through proximity graphs, and efficient pathfinding across the terrain. A notable feature of our approach is the deterministic nature …

An Open Guide To Data Structures And Algorithms, Paul W. Bible, Lucas Moser

Computer Science Faculty publications

This textbook serves as a gentle introduction for undergraduates to theoretical concepts in data structures and algorithms in computer science while providing coverage of practical implementation (coding) issues. The field of computer science (CS) supports a multitude of essential technologies in science, engineering, and communication as a social medium. The varied and interconnected nature of computer technology permeates countless career paths making CS a popular and growing major program. Mastery of the science behind computer science relies on an understanding of the theory of algorithms and data structures. These concepts underlie the fundamental tradeoffs that dictate performance in terms of …

Evaluation Of Symmetric Functions And Boolean Functions Over Stochastic Input, Naifeng Liu

Dissertations, Theses, and Capstone Projects

In our daily life, we often face situations where we need to make precise judgments based on initially unknown information, while gathering all the evidence to make informed conclusions can be very costly. In this dissertation, we explore the problem of optimizing the decision-making process under uncertainty, and we focus on problems that can be found in both theoretical computer science and discrete mathematics. The primary goal is to develop approximation algorithms with guaranteed worst-case performance. These algorithms aim to minimize the expected cost of acquiring information necessary for evaluating fundamental functions, such as Boolean and symmetric functions. Furthermore, we …

How I Read An Article That Uses Machine Learning Methods, Aziz Nazha, Olivier Elemento, Shannon Mcweeney, Moses Miles, Torsten Haferlach

Kimmel Cancer Center Faculty Papers

No abstract provided.

Minimal Positional Substring Cover Is A Haplotype Threading Alternative To Li And Stephens Model, Ahsan Sanaullah, Degui Zhi, Shaojie Zhang

Faculty, Staff and Student Publications

The Li and Stephens (LS) hidden Markov model (HMM) models the process of reconstructing a haplotype as a mosaic copy of haplotypes in a reference panel. For small panels, the probabilistic parameterization of LS enables modeling the uncertainties of such mosaics. However, LS becomes inefficient when sample size is large, because of its linear time complexity. Recently the PBWT, an efficient data structure capturing the local haplotype matching among haplotypes, was proposed to offer a fast method for giving some optimal solution (Viterbi) to the LS HMM. Previously, we introduced the minimal positional substring cover (MPSC) problem as an alternative …

Rapid-Query For Fast Identity By Descent Search And Genealogical Analysis, Yuan Wei, Ardalan Naseri, Degui Zhi, Shaojie Zhang

Faculty, Staff and Student Publications

MOTIVATION: Due to the rapid growth of the genetic database size, genealogical search, a process of inferring familial relatedness by identifying DNA matches, has become a viable approach to help individuals finding missing family members or law enforcement agencies locating suspects. A fast and accurate method is needed to search an out-of-database individual against millions of individuals. Most existing approaches only offer all-versus-all within panel match. Some prototype algorithms offer one-versus-all query from out-of-panel individual, but they do not tolerate errors.

RESULTS: A new method, random projection-based identity-by-descent (IBD) detection (RaPID) query, is introduced to make fast genealogical search possible. …

Artificial Intelligence Cad Tools In Trauma Imaging: A Scoping Review From The American Society Of Emergency Radiology (Aser) Ai/Ml Expert Panel, David Dreizin, Pedro V Staziaki, Garvit D Khatri, Nicholas M Beckmann, Zhaoyong Feng, Yuanyuan Liang, Zachary S Delproposto, Maximiliano Klug, J Stephen Spann, Nathan Sarkar, Yunting Fu

Faculty, Staff and Student Publications

BACKGROUND: AI/ML CAD tools can potentially improve outcomes in the high-stakes, high-volume model of trauma radiology. No prior scoping review has been undertaken to comprehensively assess tools in this subspecialty.

PURPOSE: To map the evolution and current state of trauma radiology CAD tools along key dimensions of technology readiness.

METHODS: Following a search of databases, abstract screening, and full-text document review, CAD tool maturity was charted using elements of data curation, performance validation, outcomes research, explainability, user acceptance, and funding patterns. Descriptive statistics were used to illustrate key trends.

RESULTS: A total of 4052 records were screened, and 233 full-text …

Algorithmic Bias: Causes And Effects On Marginalized Communities, Katrina M. Baha

Undergraduate Honors Theses

Individuals from marginalized backgrounds face different healthcare outcomes due to algorithmic bias in the technological healthcare industry. Algorithmic biases, which are the biases that arise from the set of steps used to solve or analyze a problem, are evident when people from marginalized communities use healthcare technology. For example, many pulse oximeters, which are the medical devices used to measure oxygen saturation in the blood, are not able to accurately read people who have darker skin tones. Thus, people with darker skin tones are not able to receive proper health care due to their pulse oximetry data being inaccurate. This …

Procedural Level Generation For A Top-Down Roguelike Game, Kieran Ahn, Tyler Edmiston

Honors Thesis

In this file, I present a sequence of algorithms that handle procedural level generation for the game Fragment, a game designed for CMSI 4071 and CMSI 4071 in collaboration with students from the LMU Animation department. I use algorithms inspired by graph theory and implementing best practices to the best of my ability. The full level generation sequence is comprised of four algorithms: the terrain generation, boss room placement, player spawn point selection, and enemy population. The terrain generation algorithm takes advantage of tree traversal methods to create a connected graph of walkable tiles. The boss room placement algorithm randomly …

Algorithms, Leadership, And Morality: Why A Mere Human Effect Drives The Preference For Human Over Algorithmic Leadership, Jack Mcguire, David De Cremer

Research Collection Lee Kong Chian School Of Business

Algorithms are increasingly making decisions in organizations that carry moral consequences and such decisions are considered to be ordinarily made by leaders. An important consideration to be made by organizations is therefore whether adopting algorithms in this domain will be accepted by employees and whether this practice will harm their reputation. Considering this emergent phenomenon, we set out to examine employees’ perceptions about (a) algorithmic decision-making systems employed to occupy leadership roles and make moral decisions in organizations, and (b) the reputation of organizations that employ such systems. Furthermore, we examine the extent to which the decision agent needs to …

Why Is Biomedical Informatics Hard? A Fundamental Framework, Todd R Johnson, Elmer V Bernstam

Faculty, Staff and Student Publications

Building on previous work to define the scientific discipline of biomedical informatics, we present a framework that categorizes fundamental challenges into groups based on data, information, and knowledge, along with the transitions between these levels. We define each level and argue that the framework provides a basis for separating informatics problems from non-informatics problems, identifying fundamental challenges in biomedical informatics, and provides guidance regarding the search for general, reusable solutions to informatics problems. We distinguish between processing data (symbols) and processing meaning. Computational systems, that are the basis for modern information technology (IT), process data. In contrast, many important challenges …

Automated Contouring And Planning In Radiation Therapy: What Is 'Clinically Acceptable'?, Hana Baroudi, Kristy K Brock, Wenhua Cao, Xinru Chen, Caroline Chung, Laurence E Court, Mohammad D El Basha, Maguy Farhat, Skylar Gay, Mary P Gronberg, Aashish Chandra Gupta, Soleil Hernandez, Kai Huang, David A Jaffray, Rebecca Lim, Barbara Marquez, Kelly Nealon, Tucker J Netherton, Callistus M Nguyen, Brandon Reber, Dong Joo Rhee, Ramon M Salazar, Mihir D Shanker, Carlos Sjogreen, Mckell Woodland, Jinzhong Yang, Cenji Yu, Yao Zhao

Faculty, Staff and Student Publications

Developers and users of artificial-intelligence-based tools for automatic contouring and treatment planning in radiotherapy are expected to assess clinical acceptability of these tools. However, what is 'clinical acceptability'? Quantitative and qualitative approaches have been used to assess this ill-defined concept, all of which have advantages and disadvantages or limitations. The approach chosen may depend on the goal of the study as well as on available resources. In this paper, we discuss various aspects of 'clinical acceptability' and how they can move us toward a standard for defining clinical acceptability of new autocontouring and planning tools.

Machine Learning Algorithms Improve Modis Gpp Estimates In United States Croplands, D. Menefee, T. O. Lee, K. C. Flynn, J. Chen, M. Abraha, J. Baker, A. Suyker

School of Natural Resources: Faculty Publications

No abstract provided.

Visualization Teaching Tool For Computational Geometry Algorithms, Seth Spire

Honors Projects

Computational geometry is a branch of computer science dedicated to the study and development of algorithms that solve geometric problems. These algorithms are often complex, so this project involves the development of a teaching tool for various computational geometry algorithms. A Node app was developed which allows a user to create their own inputs for an algorithm and watch a visualization of how an algorithm solves one of the various problems. There is highlighted pseudocode matching the steps of the visualization along with more in-depth writeups of the inner workings of the algorithm. 4 algorithms have been implemented in the …

Adaptive Resolution Loss: An Efficient And Effective Loss For Time Series Self-Supervised Learning Framework, Kevin Garcia, Juan Manuel Perez, Yifeng Gao

Computer Science Faculty Publications

Time series data is a crucial form of information that has vast opportunities. With the widespread use of sensor networks, largescale time series data has become ubiquitous. One of the most prominent problems in time series data mining is representation learning. Recently, with the introduction of self-supervised learning frameworks (SSL), numerous amounts of research have focused on designing an effective SSL for time series data. One of the current state-of-the-art SSL frameworks in time series is called TS2Vec. TS2Vec specially designs a hierarchical contrastive learning framework that uses loss-based training, which performs outstandingly against benchmark testing. However, the computational cost …

Patch-Wise Training With Convolutional Neural Networks To Synthetically Upscale Cfd Simulations, John P. Romano, Alec C. Brodeur, Oktay Baysal

Mechanical & Aerospace Engineering Faculty Publications

This paper expands the authors’ prior work[1], which focuses on developing a convolutional neural network (CNN) model capable of mapping time-averaged, unsteady Reynold’s-averaged Navier-Stokes (URANS) simulations to higher resolution results informed by time-averaged detached eddy simulations (DES). The authors present improvements over the prior CNN autoencoder model that result from hyperparameter optimization, increased data set augmentation through the adoption of a patch-wise training approach, and the predictions of primitive variables rather than vorticity magnitude. The training of the CNN model developed in this study uses the same URANS and DES simulations of a transonic flow around several NACA 4-digit airfoils …

Relation Preserving Triplet Mining For Stabilising The Triplet Loss In Re-Identification Systems, Adhiraj Ghosh, Kuruparan Shanmugalingam, Wen-Yan Lin

Research Collection School Of Computing and Information Systems

Object appearances change dramatically with pose variations. This creates a challenge for embedding schemes that seek to map instances with the same object ID to locations that are as close as possible. This issue becomes significantly heightened in complex computer vision tasks such as re-identification(reID). In this paper, we suggest that these dramatic appearance changes are indications that an object ID is composed of multiple natural groups, and it is counterproductive to forcefully map instances from different groups to a common location. This leads us to introduce Relation Preserving Triplet Mining (RPTM), a feature matching guided triplet mining scheme, that …

Syllable-Pbwt For Space-Efficient Haplotype Long-Match Query, Victor Wang, Ardalan Naseri, Shaojie Zhang, Degui Zhi

Faculty, Staff and Student Publications

MOTIVATION: The positional Burrows-Wheeler transform (PBWT) has led to tremendous strides in haplotype matching on biobank-scale data. For genetic genealogical search, PBWT-based methods have optimized the asymptotic runtime of finding long matches between a query haplotype and a predefined panel of haplotypes. However, to enable fast query searches, the full-sized panel and PBWT data structures must be kept in memory, preventing existing algorithms from scaling up to modern biobank panels consisting of millions of haplotypes. In this work, we propose a space-efficient variation of PBWT named Syllable-PBWT, which divides every haplotype into syllables, builds the PBWT positional prefix arrays on …

Toward Real-Time, Robust Wearable Sensor Fall Detection Using Deep Learning Methods: A Feasibility Study, Haben Yhdego, Christopher Paolini, Michel Audette

Electrical & Computer Engineering Faculty Publications

Real-time fall detection using a wearable sensor remains a challenging problem due to high gait variability. Furthermore, finding the type of sensor to use and the optimal location of the sensors are also essential factors for real-time fall-detection systems. This work presents real-time fall-detection methods using deep learning models. Early detection of falls, followed by pneumatic protection, is one of the most effective means of ensuring the safety of the elderly. First, we developed and compared different data-segmentation techniques for sliding windows. Next, we implemented various techniques to balance the datasets because collecting fall datasets in the real-time setting has …

A Survey Of Using Machine Learning In Iot Security And The Challenges Faced By Researchers, Khawlah M. Harahsheh, Chung-Hao Chen

Electrical & Computer Engineering Faculty Publications

The Internet of Things (IoT) has become more popular in the last 15 years as it has significantly improved and gained control in multiple fields. We are nowadays surrounded by billions of IoT devices that directly integrate with our lives, some of them are at the center of our homes, and others control sensitive data such as military fields, healthcare, and datacenters, among others. This popularity makes factories and companies compete to produce and develop many types of those devices without caring about how secure they are. On the other hand, IoT is considered a good insecure environment for cyber …

Detecting Deceptive Dark-Pattern Web Advertisements For Blind Screen-Reader Users, Satwick Ram Kodandaram, Mohan Sunkara, Sampath Jayarathna, Vikas Ashok

Computer Science Faculty Publications

Advertisements have become commonplace on modern websites. While ads are typically designed for visual consumption, it is unclear how they affect blind users who interact with the ads using a screen reader. Existing research studies on non-visual web interaction predominantly focus on general web browsing; the specific impact of extraneous ad content on blind users' experience remains largely unexplored. To fill this gap, we conducted an interview study with 18 blind participants; we found that blind users are often deceived by ads that contextually blend in with the surrounding web page content. While ad blockers can address this problem via …