Mathematics Commons^™

The Computational Search For Unidentified Central Configurations Of The Newtonian N-Body Problem, Hannah G. Havel

CURE Proceedings

The N-body problem is a field of study in mathematics and physics that involves predicting the motion of particles moving under their mutual gravitational attraction. It is vital in celestial mechanics, such as planning collision-free satellite orbit trajectories. When beginning to understand the N-body problem, we can start by looking at equal masses of these particles or celestial bodies. As particles move, their position and velocity change, both energy and angular momentum are conserved. Sets of constant energy and angular momentum, known as integral manifolds, are higher-dimensional figures that represent constraints of movement to a system. Integral manifolds are described …

Adaptive Neh With Constrained Nearest Neighbor Subtours For The Electric Vehicle Routing Problem With Time Windows, Andrew Struthers

All Master's Theses

The development of electric vehicles is currently considered one of the most innovative areas in manufacturing. Largely driven by the desire to reduce greenhouse emissions, electric vehicles are seen as a viable alternative to internal combustion engine cars. Starting from consumer cars, a dedicated effort is being made to translate this into commercial vehicles for freight and delivery. This research introduces a novel adaptive Nawaz, Enscore, Ham (NEH) algorithm with constrained nearest neighbor subtour (NEH-NN). This algorithm is tested on the standard benchmark problems in literature and used as a seed solution for the Genetic Algorithm (GA). The performance and …

Optimal Network Analysis Through Vertex Order Coloring Of Intuitionistic Fuzzy Graph Operations, A. Meenakshi, S. Dhanushiya, Hong Qin, Maniyandy Elangovan

Data Science Faculty Publications

Intuitionistic fuzzy graphs IFGs are a powerful tool for modeling uncertainty and complex relationships. They offer versatile frameworks for addressing real-world challenges. In this research, we have introduced intuitionistic fuzzy vertex order coloring IFVOC and analyzed the alpha-strong (alpha str), beta-strong (beta str), and gamma-strong (gamma str) vertices through their degree. We explored important theorems based on the types of strong vertices, broadening the scope of our study. We analyzed multiple IFG products to determine the most optimal network based on some important metrics, including the weight and total number of alpha str vertices, the chromatic number, and the weight …

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.

Advanced Techniques In Time Series Forecasting: From Deterministic Models To Deep Learning, Xue Bai

Graduate Theses, Dissertations, and Problem Reports (ETD)

This dissertation discusses three instances of temporal prediction, applied to population dynamics and deep learning.

In population modeling, dynamic processes are frequently represented by systems of differential equations, allowing for the analysis of various phenomena. The first application explores modeling cloned hematopoiesis in chronic myeloid leukemia (CML) via a nonlinear system of differential equations. By tracking the evolution of different cell compartments, including cycling and quiescent stem cells, progenitor cells, differentiated cells, and terminally differentiated cells, the model captures the transition from normal hematopoiesis to the chronic and accelerated-acute phases of CML. Three distinct non-zero steady states are identified, representing …

Graph Coloring Reconfiguration, Reem Mahmoud

Theses and Dissertations

Reconfiguration is the concept of moving between different solutions to a problem by transforming one solution into another using some prescribed transformation rule (move). Given two solutions s₁ and s₂ of a problem, reconfiguration asks whether there exists a sequence of moves which transforms s₁ into s₂. Reconfiguration is an area of research with many contributions towards various fields such as mathematics and computer science.
The k-coloring reconfiguration problem asks whether there exists a sequence of moves which transforms one k-coloring of a graph G into another. A move in this case is a type …

Facilitating Mathematics And Computer Science Connections: A Cross-Curricular Approach, Kimberly E. Beck, Jessica F. Shumway, Umar Shehzad, Jody Clarke-Midura, Mimi Recker

Publications

In the United States, school curricula are often created and taught with distinct boundaries between disciplines. This division between curricular areas may serve as a hindrance to students' long-term learning and their ability to generalize. In contrast, cross-curricular pedagogy provides a way for students to think beyond the classroom walls and make important connections across disciplines. The purpose of this paper is a theoretical reflection on our use of Expansive Framing in our design of lessons across learning environments within the school. We provide a narrative account of our early work in using this theoretical framework to co-plan and enact …

Continuous-Variable Quantum Computation Of The O(3) Model In 1+1 Dimensions, Raghav G. Jha, Felix Ringer, George Siopsis, Shane Thompson

Physics Faculty Publications

We formulate the O(3) nonlinear sigma model in 1+1 dimensions as a limit of a three-component scalar field theory restricted to the unit sphere in the large squeezing limit. This allows us to describe the model in terms of the continuous-variable (CV) approach to quantum computing. We construct the ground state and excited states using the coupled-cluster Ansatz and find excellent agreement with the exact diagonalization results for a small number of lattice sites. We then present the simulation protocol for the time evolution of the model using CV gates and obtain numerical results using a photonic quantum simulator. We …

Infusing Machine Learning And Computational Linguistics Into Clinical Notes, Funke V. Alabi, Onyeka Omose, Omotomilola Jegede

Mathematics & Statistics Faculty Publications

Entering free-form text notes into Electronic Health Records (EHR) systems takes a lot of time from clinicians. A large portion of this paper work is viewed as a burden, which cuts into the amount of time doctors spend with patients and increases the risk of burnout. We will see how machine learning and computational linguistics can be infused in the processing of taking clinical notes. We are presenting a new language modeling task that predicts the content of notes conditioned on historical data from a patient's medical record, such as patient demographics, lab results, medications, and previous notes, with the …

Sparse Representer Theorems For Learning In Reproducing Kernel Banach Spaces, Rui Wang, Yuesheng Xu, Mingsong Yan

Mathematics & Statistics Faculty Publications

Sparsity of a learning solution is a desirable feature in machine learning. Certain reproducing kernel Banach spaces (RKBSs) are appropriate hypothesis spaces for sparse learning methods. The goal of this paper is to understand what kind of RKBSs can promote sparsity for learning solutions. We consider two typical learning models in an RKBS: the minimum norm interpolation (MNI) problem and the regularization problem. We first establish an explicit representer theorem for solutions of these problems, which represents the extreme points of the solution set by a linear combination of the extreme points of the subdifferential set, of the norm function, …

Hyperparameter Estimation For Sparse Bayesian Learning Models, Feng Yu, Lixin Shen, Guohui Song

Mathematics & Statistics Faculty Publications

Sparse Bayesian learning (SBL) models are extensively used in signal processing and machine learning for promoting sparsity through hierarchical priors. The hyperparameters in SBL models are crucial for the model’s performance, but they are often difficult to estimate due to the nonconvexity and the high-dimensionality of the associated objective function. This paper presents a comprehensive framework for hyperparameter estimation in SBL models, encompassing well-known algorithms such as the expectation-maximization, MacKay, and convex bounding algorithms. These algorithms are cohesively interpreted within an alternating minimization and linearization (AML) paradigm, distinguished by their unique linearized surrogate functions. Additionally, a novel algorithm within the …

Evaluating Blockchain Cybersecurity Based On Tree Soft And Opinion Weight Criteria Method Under Uncertainty Climate, Florentin Smarandache, Mona Mohamed, Michael Gr. Voskoglou

Branch Mathematics and Statistics Faculty and Staff Publications

In the era of digital transformation (DT), many digital technologies have emerged and have had a positive impact on society. Nevertheless, because of certain issues with existing technologies, innovative technology has developed to eradicate them. Fog computing (FC) plays a vital role as an intermediate between edge layer and cloud computing (CC) to resolve limited resources and capabilities. In the same vein, blockchain technology (BCT) is responsible for resolving privacy and security issues that IoT suffers from. Due to using cryptography rules and hashing which is utilized in BCT to prevent any trickery. Hence, BC shows promise as a possible …

Reducing Food Scarcity: The Benefits Of Urban Farming, S.A. Claudell, Emilio Mejia

Journal of Nonprofit Innovation

Urban farming can enhance the lives of communities and help reduce food scarcity. This paper presents a conceptual prototype of an efficient urban farming community that can be scaled for a single apartment building or an entire community across all global geoeconomics regions, including densely populated cities and rural, developing towns and communities. When deployed in coordination with smart crop choices, local farm support, and efficient transportation then the result isn’t just sustainability, but also increasing fresh produce accessibility, optimizing nutritional value, eliminating the use of ‘forever chemicals’, reducing transportation costs, and fostering global environmental benefits.

Imagine Doris, who is …

An Empirical Study Of Machine Learning Techniques For Accurate Stock Price Forecasting, Daniel Paliulis, Hari Patchigolla

Honors Scholar Theses

This paper presents a comprehensive approach to predicting future stock prices of companies using machine learning and time series analysis. The research problem is centered around addressing the complexity and emotion-driven nature of stock investment decisions. To create an objective determinant in stock decisions, we propose a machine learning model utilizing time series data from major companies, including Amazon, Apple, Google, Nvidia, Meta, Tesla, Salesforce, Intel, and Microsoft. We explore the use of Long Short-Term Memory (LSTM) neural networks, to capture the temporal dynamics of stock prices. These models are designed to process sequential data, maintaining short term and long …

On The Hardness Of The Balanced Connected Subgraph Problem For Families Of Regular Graphs, Harsharaj Pathak

Theory & Applications of Graphs

The Balanced Connected Subgraph problem (BCS) was introduced by Bhore et al. In the BCS problem we are given a vertex-colored graph G = (V, E) where each vertex is colored “red” or “blue”. The goal is to find a maximum cardinality induced connected subgraph H of G such that H contains an equal number of red and blue vertices. This problem is known to be NP-hard for general graphs as well as many special classes of graphs. In this work we explore the time complexity of the BCS problem in case of regular graphs. We prove that the BCS …

The Vulnerabilities To The Rsa Algorithm And Future Alternative Algorithms To Improve Security, James Johnson

Cybersecurity Undergraduate Research Showcase

The RSA encryption algorithm has secured many large systems, including bank systems, data encryption in emails, several online transactions, etc. Benefiting from the use of asymmetric cryptography and properties of number theory, RSA was widely regarded as one of most difficult algorithms to decrypt without a key, especially since by brute force, breaking the algorithm would take thousands of years. However, in recent times, research has shown that RSA is getting closer to being efficiently decrypted classically, using algebraic methods, (fully cracked through limited bits) in which elliptic-curve cryptography has been thought of as the alternative that is stronger than …

Every Relu-Based Neural Network Can Be Described By A System Of Takagi-Sugeno Fuzzy Rules: A Theorem, Barnabas Bede, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

While modern deep-learning neural networks are very successful, sometimes they make mistakes, and since their results are "black boxes" -- no explanation is provided -- it is difficult to determine which recommendations are erroneous. It is therefore desirable to make the resulting computations explainable, i.e., to describe their results by using commonsense rules. In this paper, we use "fuzzy" techniques -- techniques developed by Lotfi Zadeh to deal with commonsense rules formulated by using imprecise ("fuzzy") words from natural language -- to show that such a rule-based representation is always possible. Our result does not yet provide the desired explainability, …

Smooth Non-Additive Integrals And Measures And Their Potential Applications, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In this paper, we explain why non-additive integrals and measures are needed, how non-additive integrals and measures are related, how to use them in decision making, and how they can help in fundamental physics. These four topics are covered, correspondingly, in Sections 2-5 of this paper.

Why Sigmoid Transformation Helps Incorporate Logic Into Deep Learning: A Theoretical Explanation, Chitta Baral, Vladik Kreinovich

Departmental Technical Reports (CS)

Traditional neural networks start from the data, they cannot easily handle prior knowledge -- this is one of the reasons why they often take very long to train. It is desirable to incorporate prior knowledge into deep learning. For the case when this knowledge consists of propositional statements, a successful way to incorporate this knowledge was proposed in a recent paper by van Krieken et al. That paper uses the fact that a neural network does not directly return a truth value, it returns a real value -- in effect, the degree of confidence in the corresponding statement -- from …

If We Add Axiom Of Choice To Constructive Analysis, We Get Classical Arithmetic: An Exercise In Reverse Constructive Mathematics, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

A recent paper in Bulletin of Symbolic Logic reminded that the Axiom of Choice is, in general, false in constructive analysis. This result is an immediate consequence of a theorem -- first proved by Tseytin -- that every computable function is continuous. In this paper, we strengthen the result about the Axiom of Choice by proving that this axiom is as non-constructive as possible: namely, that if we add this axiom to constructive analysis, then we get full classical arithmetic.

When Is A Single "And"-Condition Enough?, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In many practical situations, there are several possible decisions. Any general recommendation means specifying, for each possible decision, conditions under which this decision is recommended. In some cases, a single "and"-condition is sufficient: e.g., a condition under which a patient is recommended to take aspirin is that "the patient has a fever and the patient does not have stomach trouble". In other cases, conditions are more complicated. A natural question is: when is a single "and"-condition enough? In this paper, we provide an answer to this question.

Foundations Of Memory Capacity In Models Of Neural Cognition, Chandradeep Chowdhury

Master's Theses

A central problem in neuroscience is to understand how memories are formed as a result of the activities of neurons. Valiant’s neuroidal model attempted to address this question by modeling the brain as a random graph and memories as subgraphs within that graph. However the question of memory capacity within that model has not been explored: how many memories can the brain hold? Valiant introduced the concept of interference between memories as the defining factor for capacity; excessive interference signals the model has reached capacity. Since then, exploration of capacity has been limited, but recent investigations have delved into the …

A Bridge Between Graph Neural Networks And Transformers: Positional Encodings As Node Embeddings, Bright Kwaku Manu

Electronic Theses and Dissertations

Graph Neural Networks and Transformers are very powerful frameworks for learning machine learning tasks. While they were evolved separately in diverse fields, current research has revealed some similarities and links between them. This work focuses on bridging the gap between GNNs and Transformers by offering a uniform framework that highlights their similarities and distinctions. We perform positional encodings and identify key properties that make the positional encodings node embeddings. We found that the properties of expressiveness, efficiency and interpretability were achieved in the process. We saw that it is possible to use positional encodings as node embeddings, which can be …

On Dyadic Parity Check Codes And Their Generalizations, Meraiah Martinez

Department of Mathematics: Dissertations, Theses, and Student Research

In order to communicate information over a noisy channel, error-correcting codes can be used to ensure that small errors don’t prevent the transmission of a message. One family of codes that has been found to have good properties is low-density parity check (LDPC) codes. These are represented by sparse bipartite graphs and have low complexity graph-based decoding algorithms. Various graphical properties, such as the girth and stopping sets, influence when these algorithms might fail. Additionally, codes based on algebraically structured parity check matrices are desirable in applications due to their compact representations, practical implementation advantages, and tractable decoder performance analysis. …

Integrating Machine Learning Methods For Medical Diagnosis, Jazmin Quezada

Open Access Theses & Dissertations

Abstract:The rapid advancement of machine learning techniques has revolutionized the field of medical diagnosis by offering powerful tools to analyze complex data sets and make accurate predictions. In this proposed method, we present a novel approach that integrates machine learning and optimization models to enhance the accuracy of medical diagnoses. Our method focuses on fine-tuning and optimizing the parameters of machine learning algorithms commonly used in medical diagnosis, such as logistic regression, support vector machines, and neural networks. By employing optimization techniques, we systematically explore the parameter space of these algorithms to discover the most optimal configurations. Moreover, by representing …

From Type-2 Fuzzy To Type-2 Intervals And Type-2 Probabilities, Vladik Kreinovich, Olga Kosheleva, Luc Longpré

Departmental Technical Reports (CS)

Our knowledge comes from observations, measurements, and expert opinions. Measurements and observations are never 100% accurate, there is always a difference between the measurement result and the actual value of the corresponding quantity. We gauge the resulting uncertainty either by an interval of possible values, or by a probability distribution on the set of possible values, or by a membership function that describes to what extent different values are possible. The information about uncertainty also comes either from measurements or from expert estimates and is, therefore, also uncertain. It is important to take such "type-2" uncertainty into account. This is …

Giant Footprints Of Buddha And Generalized Limits, Julio C. Urenda, Vladik Kreinovich

Departmental Technical Reports (CS)

In many places in Asia, there are footprints claimed to be left by Buddha. Many of them are much larger than the usual size of human feet, up to 150 cm and more in length. In this paper, we provide a possible mathematical explanation for such unusual sizes.

How To Efficiently Propagate P-Box Uncertainty, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In many practical situations, to get the desired estimate or prediction, we need to process existing data. This data usually comes from measurements, and measurements are never 100% accurate. Because we only know the input values with uncertainty, the results of processing this data also comes with uncertainty. To make an appropriate decision, we need to know how accurate is the resulting estimate, i.e., how the input uncertainty "propagates" through the data processing algorithm. In the ideal case, when we know the probability distribution of each measurement error, we can, in principle, use Monte-Carlo simulations to describe the uncertainty of …

Uncertainty Quantification For Results Of Ai-Based Data Processing: Towards More Feasible Algorithms, Christoph Q. Lauter, Martine Ceberio, Vladik Kreinovich, Olga Kosheleva

Departmental Technical Reports (CS)

AI techniques have been actively and successfully used in data processing. This tendency started with fuzzy techniques, now neural network techniques are actively used. With each new technique comes the need for the corresponding uncertainty quantification (UQ). In principle, for both fuzzy and neural techniques, we can use the usual UQ methods -- however, these techniques often require an unrealistic amount of computation time. In this paper, we show that in both cases, we can use specific features of the corresponding techniques to drastically speed up the corresponding computations.

Usually, Either Left And Right Brains Are Equally Active Or Only One Of Them Is Active: First-Principles Explanation, Julio C. Urenda, Vladik Kreinovich

Departmental Technical Reports (CS)

It is known that in most practical situations, either both left and right brains are equally active, or only one of them is active. A recent paper showed that this empirical phenomenon can be explained by a realistic model of the brain effectiveness. In this paper, we show that this conclusion can be made without any specific assumptions about the brain, based on first principles.