Mathematics Commons^™

Fuzzy Ideas Explain Fechner Law And Help Detect Relation Between Objects In Video, Olga Kosheleva, Vladik Kreinovich, Ahnaf Farhan

Departmental Technical Reports (CS)

How to find relation between objects in a video? If two objects are closely related -- e.g., a computer and it mouse -- then they almost always appear together, and thus, their numbers of occurrences are close. However, simply computing the differences between numbers of occurrences is not a good idea: objects with 100 and 110 occurrences are most probably related, but objects with 1 and 5 occurrences probably not, although 5 − 1 is smaller than 110 − 100. A natural idea is, instead, to compute the difference between re-scaled numbers of occurrences, for an appropriate nonlinear re-scaling. In …

There Is Still Plenty Of Room At The Bottom: Feynman's Vision Of Quantum Computing 65 Years Later, Alexis Lupo, Vladik Kreinovich, Victor L. Timchenko, Yuriy P. Kondratenko

Departmental Technical Reports (CS)

In 1959, Nobelist Richard Feynman gave a talk titled "There's plenty of room at the bottom", in which he emphasized that, to drastically speed up computations, we need to make computer components much smaller -- all the way to the size of molecules, atoms, and even elementary particles. At this level, physics is no longer described by deterministic Newton's mechanics, it is described by probabilistic quantum laws. Because of this, computer designers started thinking how to design a reliable computer based on non-deterministic elements -- and this thinking eventually led to the modern ideas and algorithms of quantum computing. So, …

From Quantifying And Propagating Uncertainty To Quantifying And Propagating Both Uncertainty And Reliability: Practice-Motivated Approach To Measurement Planning And Data Processing, Niklas R. Winnewisser, Vladik Kreinovich, Olga Kosheleva

Departmental Technical Reports (CS)

When we process data, it is important to take into account that data comes with uncertainty. There exist techniques for quantifying uncertainty and propagating this uncertainty through the data processing algorithms. However, most of these techniques do not take into account that in real world, measuring instruments are not 100% reliable -- they sometimes malfunction and produce values which are far off from the measured values of the corresponding quantities. How can we take into account both uncertainty and reliability? In this paper, we consider several possible scenarios, and we show, for each scenario, what is the natural way to …

Modifed Playfair For Text File Encryption And Meticulous Decryption With Arbitrary Fillers By Septenary Quadrate Pattern, N. Sugirtham, R. Sherine Jenny, B. Thiyaneswaran, S. Kumarganesh, C. Venkatesan, K. Martin Sagayam, Lam Dang, Linh Dinh, Helen Dang

Faculty Publications: Mathematics and Computer Studies

Cryptography secures data and serves to ensure the confidentiality of records. Playfair is a cryptographic symmetrical algorithm that encrypts statistics based on key costs. This secret is shared with an authorized person to retrieve data. In the conventional pattern, there is an area complexity and deficiency in letters, numbers, and special characters. This hassle has been overcome in previous studies by editing pattern dimensions. The fillers used throughout the enciphering were not eliminated during the retrieval process, which resulted in the indiscrimination of the retrieved statistics. The proposed method uses a separate quadrate pattern that strengthens the Playfair cipher and …

Does Chatgpt Know Calculus?, Kris H. Green

Journal of Humanistic Mathematics

Academics and educators across the world are grappling with how OpenAI’s new software, ChatGPT, will impact teaching and learning. This essay explores ChatGPT’s response to a typical calculus problem as a way of illustrating its functionality and limitations.

Machine Learning For Wireless Network Throughput Prediction, Gustavo A. Fernandez

School of Mathematical and Statistical Sciences Faculty Publications and Presentations

This paper analyzes a dataset containing radio frequency (RF) measurements and Key Performance Indicators (KPIs) captured at 1876.6MHz with a bandwidth of 10MHz from an operational 4G LTE network in Nigeria. The dataset includes metrics such as RSRP (Reference Signal Received Power), which measures the power level of reference signals; RSRQ (Reference Signal Received Quality), an indicator of signal quality that provides insight into the number of users sharing the same resources; RSSI (Received Signal Strength Indicator), which gauges the total received power in a bandwidth; SINR (Signal to Interference plus Noise Ratio), a measure of signal quality considering both …

Every Feasibly Computable Reals-To-Reals Function Is Feasibly Uniformly Continuous, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

It is known that every computable function is continuous; moreover, it is computably continuous in the sense that for every ε > 0, we can compute δ > 0 such that δ-close inputs lead to ε-close outputs. It is also known that not all functions which are, in principle, computable, can actually be computed: indeed, the computation sometimes requires more time than the lifetime of the Universe. A natural question is thus: can the above known result about computable continuity of computable functions be extended to the case when we limit ourselves to feasible computations? In this paper, we prove that this …

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.

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 …

From Normal Distribution To What? How To Best Describe Distributions With Known Skewness, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In many practical situations, we only have partial information about the probability distribution -- e.g., all we know is its few moments. In such situations, it is desirable to select one of the possible probability distributions. A natural way to select a distribution from a given class of distributions is the maximum entropy approach. For the case when we know the first two moments, this approach selects the normal distribution. However, when we also know the third central moment -- corresponding to skewness -- a direct application of this approach does not work. Instead, practitioners use several heuristic techniques, techniques …

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 …

An Unsupervised Machine Learning Algorithm For Clustering Low Dimensional Data Points In Euclidean Grid Space, Josef Lazar

Senior Projects Spring 2024

Clustering algorithms provide a useful method for classifying data. The majority of well known clustering algorithms are designed to find globular clusters, however this is not always desirable. In this senior project I present a new clustering algorithm, GBCN (Grid Box Clustering with Noise), which applies a box grid to points in Euclidean space to identify areas of high point density. Points within the grid space that are in adjacent boxes are classified into the same cluster. Conversely, if a path from one point to another can only be completed by traversing an empty grid box, then they are classified …

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 …

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 …

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 …

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, …

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 …

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

Graduate Theses, Dissertations, and Problem Reports

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 …

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 and 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.

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.

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.

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 …

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. …

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 …