Computer Sciences Commons^™

Towards An Optimal Design: What Can We Recommend To Elon Musk?, Martine Ceberio, Olga Kosheleva, Vladik Kreinovich, Hung T. Nguyen

Departmental Technical Reports (CS)

Elon Musk's successful "move fast and break things" strategy is based on the fact that in many cases, we do not need to satisfy all usual constraints to be successful. By sequentially trying smaller number of constraints, he finds the smallest number of constraints that are still needed to succeed -- and using this smaller number of constrains leads to a much cheaper (and thus, more practical) design. In this strategy, Musk relies on his intuition -- which, as all intuitions, sometimes works and sometimes doesn't. To replace this intuition, we propose an algorithm that minimizes the worst-case cost of …

Exploring Quaternion Neural Network Loss Surfaces, Jeremiah Bill, Bruce A. Cox

Faculty Publications

This paper explores the superior performance of quaternion multi-layer perceptron (QMLP) neural networks over real-valued multi-layer perceptron (MLP) neural networks, a phenomenon that has been empirically observed but not thoroughly investigated. The study utilizes loss surface visualization and projection techniques to examine quaternion-based optimization loss surfaces for the first time. The primary contribution of this research is the statistical evidence that QMLP models yield smoother loss surfaces than real-valued neural networks, which are measured and compared using a robust quantitative measure of loss surface “goodness” based on estimates of surface curvature. Extensive computational testing validates the effectiveness of these surface …

Wang Tilings In Arbitrary Dimensions, Ian Tassin

Rose-Hulman Undergraduate Mathematics Journal

This paper makes a new observation about arbitrary dimensional Wang Tilings,
demonstrating that any d -dimensional tile set that can tile periodically along d − 1 axes must be able to tile periodically along all axes.
This work also summarizes work on Wang Tiles up to the present day, including
definitions for various aspects of Wang Tilings such as periodicity and the validity of a tiling. Additionally, we extend the familiar 2D definitions for Wang Tiles and associated properties into arbitrary dimensional spaces. While there has been previous discussion of arbitrary dimensional Wang Tiles in other works, it has been …

Why Pavement Cracks Are Mostly Longitudinal, Sometimes Transversal, And Rarely Of Other Directions: A Geometric Explanation, Edgar Daniel Rodriguez Velasquez, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In time, pavements deteriorate, and need maintenance. One of the most typical pavement faults are cracks. Empirically, the most frequent cracks are longitudinal, i.e., following the direction of the road; less frequent are transversal cracks, which are orthogonal to the direction of the road. Sometimes, there are cracks in different directions, but such cracks are much rarer. In this paper, we show that simple geometric analysis and fundamental physical ideas can explain these observed relative frequencies.

Why Linear And Sigmoid Last Layers Work Better In Classification, Lehel Dénes-Fazakas, Lásló Szilágyi, Vladik Kreinovich

Departmental Technical Reports (CS)

Usually, when a deep neural network is used to classify objects, its last layer computes the softmax. Our empirical results show we can improve the classification results if instead, we have linear or sigmoid last layer. In this paper, we provide an explanation for this empirical phenomenon.

Why Two Fish Follow Each Other But Three Fish Form A School: A Symmetry-Based Explanation, Shahnaz Shahbazova, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

Recent experiments with fish has shown an unexpected strange behavior: when two fish of the same species are placed in an aquarium, they start following each other, while when three fish are placed there, they form (approximately) an equilateral triangle, and move in the direction (approximately) orthogonal to this triangle. In this paper, we use natural symmetries -- such as rotations, shifts, and permutation of fish -- to show that this observed behavior is actually optimal. This behavior is not just optimal with respect to one specific optimality criterion, it is optimal with respect to any optimality criterion -- as …

Some Generalizations Of Corona Product Of Two Graphs, Aparajita Borah, Gajendra Pratap Singh

Applications and Applied Mathematics: An International Journal (AAM)

In this paper we are seeking to conceptualize the notion of corona product of two graphs to contrive some special types of graphs. That is, here our attempt is to regenerate a familiar graph as a product graph. We are considering seven familiar graphs here to reconstruct them with the help of corona product of two graphs. Such types of families of the graphs and operations can be used to study biological pathways as well as to find the optimal order and size for the special types of graphs.

Fuzzy Software Reliability And Optimal Release Policy With Log-Logistic Testing Effort: An Analysis, Seema Rani, Jitendra Kumar, N. Ahmad

Applications and Applied Mathematics: An International Journal (AAM)

We will discuss a Software Reliability Growth Model (SRGM) using fuzzy and imperfect debugging environments; we integrate Log-Logistic (LL) Testing Effort Function (TEF) into fuzzy SRGMs. Estimation methods, such as Least Square and Maximum Likelihood, are used to obtain the value of Testing-Effort and SRGMs parameters. It is not always possible and is constantly required to quantify the exact value of parameters. Due to human conduct, the value of Testing-Effort and SRGM parameters cannot be exactly quantified. In this scenario, parameters are supposed to be vague or fuzzy. To make the software consistent, the developer needs to propose some quantity …

Session 8: Machine Learning Based Behavior Of Non-Opec Global Supply In Crude Oil Price Determinism, Mofe Jeje

SDSU Data Science Symposium

Abstract

While studies on global oil price variability, occasioned by OPEC crude oil supply, is well documented in energy literature; the impact assessment of non-OPEC global oil supply on price variability, on the other hand, has not received commensurate attention. Given this gap, the primary objective of this study, therefore, is to estimate the magnitude of oil price determinism that is explained by the share of non-OPEC’s global crude oil supply. Using secondary sources of data collection method, data for target variable will be collected from the US Federal Reserve, as it relates to annual crude oil price variability, while …

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 …

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

Mathematics and Computer Studies: Faculty Publications

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 …

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 …

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 & Statistical Sciences Faculty Publications

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 …

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 …

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 …

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 …

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 …

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 …

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.

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 …

Volume 15, Connor Thompson, Emily Steffenhagen, Emily Robertson, Luis Fernando Dos Reis, Emily Farmer, Samuel Villa, Robert Allison, Zachary Chessor, Megan Borden, Austin Burnett, Larry W. Grant Jr., Tristan Marowski, Emma Moore, Pearl Siff

Incite: The Journal of Undergraduate Scholarship

Introduction Dr. Amorette Barber, Director, Office of Student Research

From the Editor Dr. Hannah Dudley-Shotwell

Artist’s Statement Connor Thompson

On Mentorship Dr. John Miller

The Meat of the Matter: Alien, Human, and Animal in Terry Bisson’s “They’re Made Out of Meat” by Emily Steffenhagen

“Please REBLOG!”: An Ethical Analysis of Doxxing, Internet Vigilantism and Racists Getting Fired by Emily Robertson

Journaling: Paper Has More Patience Than People by Luis Fernando Dos Reis

The Effects of Climate Change on the Archaeological World by Emily Farmer

Lowered Seat Height Does Not Impair Wingate Performance in Untrained Cyclists by Samuel Villa, Robert Allison, …

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 …

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 …