Open Access. Powered by Scholars. Published by Universities.®

Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 1 - 30 of 2270

Full-Text Articles in Mathematics

Hgs-3 The Influence Of A Tandem Cycling Program In The Community On Physical And Functional Health, Therapeutic Bonds, And Quality Of Life For Individuals And Care Partners Coping With Parkinson’S Disease, Leila Djerdjour, Jennifer L. Trilk Apr 2024

Hgs-3 The Influence Of A Tandem Cycling Program In The Community On Physical And Functional Health, Therapeutic Bonds, And Quality Of Life For Individuals And Care Partners Coping With Parkinson’S Disease, Leila Djerdjour, Jennifer L. Trilk

SC Upstate Research Symposium

Purpose Statement: Several studies have shown that aerobic exercise can have a positive impact on alleviating symptoms experienced by individuals with Parkinson's disease (PD). Despite this evidence, the potential benefits of exercise for both PD patients and their care partners (PD dyad) remain unexplored. This research project investigates the effectiveness, therapeutic collaborations, and physical outcomes of a virtual reality (VR) tandem cycling program specifically designed for PD dyads.

Methods: Following approval from the Prisma Health Institutional Review Board, individuals with PD were identified and screened by clinical neurologists. The pre-testing measures for PD dyads (N=9) included emotional and cognitive status …


How Difficult Is It To Comprehend A Program That Has Significant Repetitions: Fuzzy-Related Explanations Of Empirical Results, Christian Servin, Olga Kosheleva, Vladik Kreinovich Apr 2024

How Difficult Is It To Comprehend A Program That Has Significant Repetitions: Fuzzy-Related Explanations Of Empirical Results, Christian Servin, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In teaching computing and in gauging the programmers' productivity, it is important to property estimate how much time it will take to comprehend a program. There are techniques for estimating this time, but these techniques do not take into account that some program segments are similar, and this similarity decreases the time needed to comprehend the second segment. Recently, experiments were performed to describe this decrease. These experiments found an empirical formula for the corresponding decrease. In this paper, we use fuzzy-related ideas to provide commonsense-based theoretical explanation for this empirical formula.


Mcfadden's Discrete Choice And Softmax Under Interval (And Other) Uncertainty: Revisited, Bartlomiej Jacek Kubica, Olga Kosheleva, Vladik Kreinovich Apr 2024

Mcfadden's Discrete Choice And Softmax Under Interval (And Other) Uncertainty: Revisited, Bartlomiej Jacek Kubica, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

Studies of how people actually make decisions have led to an empirical formula that predicts the probability of different decisions based on the utilities of different alternatives. This formula is known as McFadden's formula, after a Nobel prize winning economist who discovered it. A similar formula -- known as softmax -- describes the probability that the classification predicted by a deep neural network is correct, based on the neural network's degrees of confidence in the object belonging to each class. In practice, we usually do not know the exact values of the utilities -- or of the degrees of confidence. …


Why Bernstein Polynomials: Yet Another Explanation, Olga Kosheleva, Vladik Kreinovich Apr 2024

Why Bernstein Polynomials: Yet Another Explanation, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In many computational situations -- in particular, in computations under interval or fuzzy uncertainty -- it is convenient to approximate a function by a polynomial. Usually, a polynomial is represented by coefficients at its monomials. However, in many cases, it turns out more efficient to represent a general polynomial by using a different basis -- of so-called Bernstein polynomials. In this paper, we provide a new explanation for the computational efficiency of this basis.


Somewhat Surprisingly, (Subjective) Fuzzy Technique Can Help To Better Combine Measurement Results And Expert Estimates Into A Model With Guaranteed Accuracy: Digital Twins And Beyond, Niklas Winnewisser, Michael Beer, Olga Kosheleva, Vladik Kreinovich Apr 2024

Somewhat Surprisingly, (Subjective) Fuzzy Technique Can Help To Better Combine Measurement Results And Expert Estimates Into A Model With Guaranteed Accuracy: Digital Twins And Beyond, Niklas Winnewisser, Michael Beer, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

To understand how different factors and different control strategies will affect a system -- be it a plant, an airplane, etc. -- it is desirable to form an accurate digital model of this system. Such models are known as digital twins. To make a digital twin as accurate as possible, it is desirable to incorporate all available knowledge of the system into this model. In many cases, a significant part of this knowledge comes in terms of expert statements, statements that are often formulated by using imprecise ("fuzzy") words from natural language such as "small", "very possible", etc. To translate …


How To Gauge Inequality And Fairness: A Complete Description Of All Decomposable Versions Of Theil Index, Saeid Tizpaz-Niari, Olga Kosheleva, Vladik Kreinovich Apr 2024

How To Gauge Inequality And Fairness: A Complete Description Of All Decomposable Versions Of Theil Index, Saeid Tizpaz-Niari, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In general, in statistics, the most widely used way to describe the difference between different elements of a sample if by using standard deviation. This characteristic has a nice property of being decomposable: e.g., to compute the mean and standard deviation of the income overall the whole US, it is sufficient to compute the number of people, mean, and standard deviation over each state; this state-by-state information is sufficient to uniquely reconstruct the overall standard deviation. However, e.g., for gauging income inequality, standard deviation is not very adequate: it provides too much weight to outliers like billionaires, and thus, does …


Update From Aristotle To Newton, From Sets To Fuzzy Sets, And From Sigmoid To Relu: What Do All These Transitions Have In Common?, Christian Servin, Olga Kosheleva, Vladik Kreinovich Apr 2024

Update From Aristotle To Newton, From Sets To Fuzzy Sets, And From Sigmoid To Relu: What Do All These Transitions Have In Common?, Christian Servin, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In this paper, we show that there is a -- somewhat unexpected -- common trend behind several seemingly unrelated historic transitions: from Aristotelian physics to modern (Newton's) approach, from crisp sets (such as intervals) to fuzzy sets, and from traditional neural networks, with close-to-step-function sigmoid activation functions to modern successful deep neural networks that use a completely different ReLU activation function. In all these cases, the main idea of the corresponding transition can be explained, in mathematical terms, as going from the first order to second order differential equations.


How To Make A Decision Under Interval Uncertainty If We Do Not Know The Utility Function, Jeffrey Escamilla, Vladik Kreinovich Apr 2024

How To Make A Decision Under Interval Uncertainty If We Do Not Know The Utility Function, Jeffrey Escamilla, Vladik Kreinovich

Departmental Technical Reports (CS)

Decision theory describes how to make decisions, in particular, how to make decisions under interval uncertainty. However, this theory's recommendations assume that we know the utility function -- a function that describes the decision maker's preferences. Sometimes, we can make a recommendation even when we do not know the utility function. In this paper, we provide a complete description of all such cases.


Paradox Of Causality And Paradoxes Of Set Theory, Alondra Baquier, Bradley Beltran, Gabriel Miki-Silva, Olga Kosheleva, Vladik Kreinovich Apr 2024

Paradox Of Causality And Paradoxes Of Set Theory, Alondra Baquier, Bradley Beltran, Gabriel Miki-Silva, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

Logical paradoxes show that human reasoning is not always fully captured by the traditional 2-valued logic, that this logic's extensions -- such as multi-valued logics -- are needed. Because of this, the study of paradoxes is important for research on multi-valued logics. In this paper, we focus on paradoxes of set theory. Specifically, we show their analogy with the known paradox of causality, and we use this analogy to come up with similar set-theoretic paradoxes.


Number Representation With Varying Number Of Bits, Anuradha Choudhury, Md Ahsanul Haque, Saeefa Rubaiyet Nowmi, Ahmed Ann Noor Ryen, Sabrina Saika, Vladik Kreinovich Apr 2024

Number Representation With Varying Number Of Bits, Anuradha Choudhury, Md Ahsanul Haque, Saeefa Rubaiyet Nowmi, Ahmed Ann Noor Ryen, Sabrina Saika, Vladik Kreinovich

Departmental Technical Reports (CS)

In a computer, usually, all real numbers are stored by using the same number of bits: usually, 8 bytes, i.e., 64 bits. This amount of bits enables us to represent numbers with high accuracy -- up to 19 decimal digits. However, in most cases -- whether we process measurement results or whether we process expert-generated membership degrees -- we do not need that accuracy, so most bits are wasted. To save space, it is therefore reasonable to consider representations with varying number of bits. This would save space used for representing numbers themselves, but we would also need to store …


Data Fusion Is More Complex Than Data Processing: A Proof, Robert Alvarez, Salvador Ruiz, Martine Ceberio, Vladik Kreinovich Apr 2024

Data Fusion Is More Complex Than Data Processing: A Proof, Robert Alvarez, Salvador Ruiz, Martine Ceberio, Vladik Kreinovich

Departmental Technical Reports (CS)

Empirical data shows that, in general, data fusion takes more computation time than data processing. In this paper, we provide a proof that data fusion is indeed more complex than data processing.


How To Fairly Allocate Safety Benefits Of Self-Driving Cars, Fernando Munoz, Christian Servin, Vladik Kreinovich Apr 2024

How To Fairly Allocate Safety Benefits Of Self-Driving Cars, Fernando Munoz, Christian Servin, Vladik Kreinovich

Departmental Technical Reports (CS)

In this paper, we describe how to fairly allocated safety benefits of self-driving cars between drivers and pedestrians -- so as to minimize the overall harm.


Using Known Relation Between Quantities To Make Measurements More Accurate And More Reliable, Niklas Winnewisser, Felix Mett, Michael Beer, Olga Kosheleva, Vladik Kreinovich Apr 2024

Using Known Relation Between Quantities To Make Measurements More Accurate And More Reliable, Niklas Winnewisser, Felix Mett, Michael Beer, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

Most of our knowledge comes, ultimately, from measurements and from processing measurement results. In this, metrology is very valuable: it teaches us how to gauge the accuracy of the measurement results and of the results of data processing, and how to calibrate the measuring instruments so as to reach the maximum accuracy. However, traditional metrology mostly concentrates on individual measurements. In practice, often, there are also relations between the current values of different quantities. For example, there is usually an known upper bound on the difference between the values of the same quantity at close moments of time or at …


Wang Tilings In Arbitrary Dimensions, Ian Tassin Mar 2024

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 Mar 2024

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 Mar 2024

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.


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

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 …


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

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.


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

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 …


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

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 …


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 Feb 2024

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 …


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

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 Feb 2024

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 Feb 2024

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 Jan 2024

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.


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

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 Jan 2024

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 …


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

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 …


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

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 …


Graph Coloring Reconfiguration, Reem Mahmoud Jan 2024

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 s1 and s2 of a problem, reconfiguration asks whether there exists a sequence of moves which transforms s1 into s2. 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 …