Mathematics Commons^™

Dialogs Re-Enacted Across Languages, Version 2, Nigel G. Ward, Jonathan E. Avila, Emilia Rivas, Divette Marco

Departmental Technical Reports (CS)

To support machine learning of cross-language prosodic mappings and other ways to improve speech-to-speech translation, we present a protocol for collecting closely matched pairs of utterances across languages, a description of the resulting data collection and its public release, and some observations and musings. This report is intended for:

• people using this corpus
• people extending this corpus
• people designing similar collections of bilingual dialog data.

Change Notes. This version supersedes UTEP-CS-22-108. There is some new information and numerous clarifications, mostly arising from our experiences diversifying our corpus and helping a vendor to use this protocol.

Natural Color Interpretation Of Interval-Valued Fuzzy Degrees, Victor L. Timchenko, Yury P. Kondratenko, Vladik Kreinovich, Olga Kosheleva

Departmental Technical Reports (CS)

Intuitively, interval-values fuzzy degrees are more adequate for representing expert uncertainty than the traditional [0,1]-based ones. Indeed, the very need for fuzzy degrees comes from the fact that experts often cannot describe their opinion not in terms of precise numbers, but by using imprecise ("fuzzy") words from natural language like "small". In such situations, it is strange to expect the same expert to be able to provide an exact number describing his/her degree of certainty; it is more natural to ask this expert to mark the whole interval (or even, more generally, a fuzzy set of possible degrees). In spite …

Logical Inference Inevitably Appears: Fuzzy-Based Explanation, Julio C. Urenda, Olga Kosheleva, Vladik Kreinovich, Orsolya Csiszar

Departmental Technical Reports (CS)

Many thousands years ago, our primitive ancestors did not have the ability to reason logically and to perform logical inference. This ability appeared later. A natural question is: was this appearance inevitable -- or was this a lucky incident that could have been missed? In this paper, we use fuzzy techniques to provide a possible answer to this question. Our answer is: yes, the appearance of logical inference in inevitable.

Is Fully Explainable Ai Even Possible: Fuzzy-Based Analysis, Miroslav Svitek, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

One of the main limitations of many current AI-based decision-making systems is that they do not provide any understandable explanations of how they came up with the produced decision. Taking into account that these systems are not perfect, that their decisions are sometimes far from good, the absence of an explanation makes it difficult to separate good decisions from suspicious ones. Because of this, many researchers are working on making AI explainable. In some applications areas -- e.g., in chess -- practitioners get an impression that there is a limit to understandability, that some decisions remain inhuman -- not explainable. …

Why Fuzzy Control Is Often More Robust (And Smoother): A Theoretical Explanation, Orsolya Csiszar, Gábor Csiszar, Olga Kosheleva, Martine Ceberio, Vladik Kreinovich

Departmental Technical Reports (CS)

In many practical situations, practitioners use easier-to-compute fuzzy control to approximate the more-difficult-co-compute optimal control. As expected, for many characteristics, this approximate control is slightly worse than the optimal control it approximates, However, with respect to robustness or smoothness, the approximating fuzzy control is often better than the original one. In this paper, we provide a theoretical explanation for this somewhat mysterious empirical phenomenon.

Why Softmax? Because It Is The Only Consistent Approach To Probability-Based Classification, Anatole Lokshin, Vladik Kreinovich

Departmental Technical Reports (CS)

In many practical problems, the most effective classification techniques are based on deep learning. In this approach, once the neural network generates values corresponding to different classes, these values are transformed into probabilities by using the softmax formula. Researchers tried other transformation, but they did not work as well as softmax. A natural question is: why is softmax so effective? In this paper, we provide a possible explanation for this effectiveness: namely, we prove that softmax is the only consistent approach to probability-based classification. In precise terms, it is the only approach for which two reasonable probability-based ideas -- Least …

Selecting The Most Adequate Fuzzy Operation For Explainable Ai: Empirical Fact And Its Possible Theoretical Explanation, Orsolya Csiszar, Gábor Csiszar, Martine Ceberio, Vladik Kreinovich

Departmental Technical Reports (CS)

A reasonable way to make AI results explainable is to approximate the corresponding deep-learning-generated function by a simple expression formed by fuzzy operations. Experiments on real data show that out of all easy-to-compute fuzzy operations, the best approximation is attained if we use an operation a + b − 0.5 ( limited to the interval [0,1]$. In this paper, we provide a possible theoretical explanation for this empirical result.

(R2051) Analysis Of Map/Ph1, Ph2/2 Queueing Model With Working Breakdown, Repairs, Optional Service, And Balking, G. Ayyappan, G. Archana

Applications and Applied Mathematics: An International Journal (AAM)

In this paper, a classical queueing system with two types of heterogeneous servers has been considered. The Markovian Arrival Process (MAP) is used for the customer arrival, while phase type distribution (PH) is applicable for the offering of service to customers as well as the repair time of servers. Optional service are provided by the servers to the unsatisfied customers. The server-2 may get breakdown during the busy period of any type of service. Though the server- 2 got breakdown, server-2 has a capacity to provide the service at a slower rate to the current customer who is receiving service …

Deep Learning Recommendations For The Acl2 Interactive Theorem Prover, Robert K. Thompson, Robert K. Thompson

Master's Theses

Due to the difficulty of obtaining formal proofs, there is increasing interest in partially or completely automating proof search in interactive theorem provers. Despite being a theorem prover with an active community and plentiful corpus of 170,000+ theorems, no deep learning system currently exists to help automate theorem proving in ACL2. We have developed a machine learning system that generates recommendations to automatically complete proofs. We show that our system benefits from the copy mechanism introduced in the context of program repair. We make our system directly accessible from within ACL2 and use this interface to evaluate our system in …

A Survey On Online Matching And Ad Allocation, Ryan Lee

Theses

One of the classical problems in graph theory is matching. Given an undirected graph, find a matching which is a set of edges without common vertices. In 1990s, Richard Karp, Umesh Vazirani, and Vijay Vazirani would be the first computer scientists to use matchings for online algorithms [8]. In our domain, an online algorithm operates in the online setting where a bipartite graph is given. On one side of the graph there is a set of advertisers and on the other side we have a set of impressions. During the online phase, multiple impressions will arrive and the objective of …

Using Deep Neural Networks To Classify Astronomical Images, Andrew D. Macpherson

Honors Projects

As the quantity of astronomical data available continues to exceed the resources available for analysis, recent advances in artificial intelligence encourage the development of automated classification tools. This paper lays out a framework for constructing a deep neural network capable of classifying individual astronomical images by describing techniques to extract and label these objects from large images.

Du Undergraduate Showcase: Research, Scholarship, And Creative Works, Caitlyn Aldersea, Justin Bravo, Sam Allen, Anna Block, Connor Block, Emma Buechler, Maria De Los Angeles Bustillos, Arianna Carlson, William Christensen, Olivia Kachulis, Noah Craver, Kate Dillon, Muskan Fatima, Angel Fernandes, Emma Finch, Colleen Cassidy, Amy Fishman, Andrea Francis, Stacia Fritz, Simran Gill, Emma Gries, Rylie Hansen, Shannon Powers, Jacqueline Martinez, Zachary Harker, Ashley Hasty, Mykaela Tanino-Springsteen, Kathleen Hopps, Adelaide Kerenick, Colin Kleckner, Ci Koehring, Elijah Kruger, Braden Krumholz, Maddie Leake, Lyneé Alves, Seraphina Loukas, Yatzari Lozano Vazquez, Haley Maki, Emily Martinez, Sierra Mckinney, Audrey Mitchell, Kipling Newman, Audrey Ng, Megan Lucyshyn, Andrew Nguyen, Stevie Ostman, Casandra Pearson, Alexandra Penney, Julia Gielczynski, Tyler Ball, Anna Rini, Christina Rorres, Simon Ruland, Helayna Schafer, Emma Sellers, Sarah Schuller, Claire Shaver, Kevin Summers, Isabella Shaw, Madison Sinar, Claudia Pena, Apshara Siwakoti, Carter Sorensen, Madi Sousa, Anna Sparling, Alexandra Revier, Brandon Thierry, Dylan Tyree, Maggie Williams, Lauren Wols

DU Undergraduate Research Journal Archive

DU Undergraduate Showcase: Research, Scholarship, and Creative Works

Partitions Of R^N With Maximal Seclusion And Their Applications To Reproducible Computation, Jason Vander Woude

Department of Mathematics: Dissertations, Theses, and Student Research

We introduce and investigate a natural problem regarding unit cube tilings/partitions of Euclidean space and also consider broad generalizations of this problem. The problem fits well within a historical context of similar problems and also has applications to the study of reproducibility in randomized computation.

Given $k\in\mathbb{N}$ and $\epsilon\in(0,\infty)$, we define a $(k,\epsilon)$-secluded unit cube partition of $\mathbb{R}^{d}$ to be a unit cube partition of $\mathbb{R}^{d}$ such that for every point $\vec{p}\in\R^d$, the closed $\ell_{\infty}$ $\epsilon$-ball around $\vec{p}$ intersects at most $k$ cubes. The problem is to construct such partitions for each dimension $d$ with the primary goal of minimizing …

Effects Of Factors On The Market Price Of The Shares Using Design Of Experiment, Amir Ahmad Dar, Mohammad Shahfaraz Khan, Imran Azad, Tanveer Ahmad Tarray, N. Anuradha, Qaiser Farroq Dar

Applied Mathematics & Information Sciences

When the cost of capital, dividends and the price of the share at the beginning is known, Modigliani and Miller’s model can be used to estimate the price of the share at the end of the period. A design of experiment (Taguchi’s orthogonal array) is used in order to investigate the impact of three parameters on the price of the share at the end of the period. The main aim of this research article is to find which parameter is more significant on the price of the share at the end of the period. Taguchi’s methodology of design of the …

Why Inverse Layers In Pavement? Why Zipper Fracking? Why Interleaving In Education? A General Explanation, Edgar Daniel Rodriguez Velasquez, Aaron Velasco, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In many practical situations, if we split our efforts into two disconnected chunks, we get better results: a pavement is stronger if instead of a single strengthening layer, we place two parts of this layer separated by no-so-strong layers; teaching is more effective if instead of concentrating a topic in a single time interval, we split it into two parts separated in time, etc. In this paper, we provide a general explanation for all these phenomena.

Fast -- Asymptotically Optimal -- Methods For Determining The Optimal Number Of Features, Saied Tizpaz-Niari, Luc Longpré, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In machine learning -- and in data processing in general -- it is very important to select the proper number of features. If we select too few, we miss important information and do not get good results, but if we select too many, this will include many irrelevant ones that only bring noise and thus again worsen the results. The usual method of selecting the proper number of features is to add features one by one until the quality stops improving and starts deteriorating again. This method works, but it often takes too much time. In this paper, we propose …

Uconn Baseball Batting Order Optimization, Gavin Rublewski, Gavin Rublewski

Honors Scholar Theses

Challenging conventional wisdom is at the very core of baseball analytics. Using data and statistical analysis, the sets of rules by which coaches make decisions can be justified, or possibly refuted. One of those sets of rules relates to the construction of a batting order. Through data collection, data adjustment, the construction of a baseball simulator, and the use of a Monte Carlo Simulation, I have assessed thousands of possible batting orders to determine the roster-specific strategies that lead to optimal run production for the 2023 UConn baseball team. This paper details a repeatable process in which basic player statistics …

A Brascamp-Lieb–Rary Of Examples, Anina Peersen

Mathematics, Statistics, and Computer Science Honors Projects

This paper focuses on the Brascamp-Lieb inequality and its applications in analysis, fractal geometry, computer science, and more. It provides a beginner-level introduction to the Brascamp-Lieb inequality alongside re- lated inequalities in analysis and explores specific cases of extremizable, simple, and equivalent Brascamp-Lieb data. Connections to computer sci- ence and geometric measure theory are introduced and explained. Finally, the Brascamp-Lieb constant is calculated for a chosen family of linear maps.

Machine Learning-Based Data And Model Driven Bayesian Uncertanity Quantification Of Inverse Problems For Suspended Non-Structural System, Zhiyuan Qin

All Dissertations

Inverse problems involve extracting the internal structure of a physical system from noisy measurement data. In many fields, the Bayesian inference is used to address the ill-conditioned nature of the inverse problem by incorporating prior information through an initial distribution. In the nonparametric Bayesian framework, surrogate models such as Gaussian Processes or Deep Neural Networks are used as flexible and effective probabilistic modeling tools to overcome the high-dimensional curse and reduce computational costs. In practical systems and computer models, uncertainties can be addressed through parameter calibration, sensitivity analysis, and uncertainty quantification, leading to improved reliability and robustness of decision and …

Nviz: Unraveling Neural Networks Through Visualization, Kevin Hoffman

Mathematics, Computer Science & Statistics Presentations

The growing utility of artificial intelligence (AI) is attributed to the development of neural networks. These networks are a class of models that make predictions based on previously observed data. While the inferential power of neural networks is great, the ability to explain their results is difficult because the underlying model is automatically generated. The AI community commonly refers to neural networks as black boxes because the patterns they learn from the data are not easily understood. This project aims to improve the visibility of patterns that neural networks identify in data. Through an interactive web application, NVIZ affords the …

Cie Text Analysis: Narrative Of The Life Of Frederick Douglass, The Declaration Of Independence, And The Declaration Of Sentiments, Arianna Knipe

Mathematics, Computer Science & Statistics Presentations

Our STAT-451 class has worked with analyzing the words from CIE texts and assigning them to a sentiment or feeling and comparing them with one another using RStudio. This project analyzes texts from three sources: The Narrative of the Life of Frederick Douglass, The Declaration of Independence and the Declaration of Sentiments.

Volume 14, Ireland Seagle, Dalton C. Whitby, Cassandra Poole, Rachel Cannon, Heidi Parker-Combes, Devon G. Shifflett, Antonio Harvey

Incite: The Journal of Undergraduate Scholarship

Table of Contents:

• Introduction: Dr. Amorette Barber
• From the Editor: Dr. Larissa "Kat" Tracy
• From the Designers: Rachel English, Rachel Hanson
• Hungry Like the Wolf: The Wolf as Metaphor in Paramount Network’s Yellowstone: Ireland Seagle
• “Floating Cities”: Illustrating the Commercial and Conservation Conflict of Alaskan Cruise Ship Tourism: Dalton C. Whitby
• What Can You Do When Your Genes are the Enemy? Current Applications of Gene Manipulation and the Associated Ethical Considerations: Cassandra Poole
• La doble cara: un tema romántico en las obras de Larra y Hawthorne: Rachel Cannon
• Resolving a Conflict: How to …

The Mceliece Cryptosystem As A Solution To The Post-Quantum Cryptographic Problem, Isaac Hanna

Liberty University Research Week

Undergraduate

Theoretical Proposal

A Graphical User Interface Using Spatiotemporal Interpolation To Determine Fine Particulate Matter Values In The United States, Kelly M. Entrekin

Honors College Theses

Fine particulate matter or PM2.5 can be described as a pollution particle that has a diameter of 2.5 micrometers or smaller. These pollution particle values are measured by monitoring sites installed across the United States throughout the year. While these values are helpful, a lot of areas are not accounted for as scientists are not able to measure all of the United States. Some of these unmeasured regions could be reaching high PM2.5 values over time without being aware of it. These high values can be dangerous by causing or worsening health conditions, such as cardiovascular and lung diseases. Within …

Applying Hallgren’S Algorithm For Solving Pell’S Equation To Finding The Irrational Slope Of The Launch Of A Billiard Ball, Sangheon Choi

Mathematical Sciences Technical Reports (MSTR)

This thesis is an exploration of Quantum Computing applied to Pell’s equation in an attempt to find solutions to the Billiard Ball Problem. Pell’s equation is a Diophantine equation in the form of x² − ny² = 1, where n is a given positive nonsquare integer, and integer solutions are sought for x and y. We will be applying Hallgren’s algorithm for finding irrational periods in functions, in the context of billiard balls and their movement on a friction-less unit square billiard table. Our central research question has been the following: Given the cutting sequence of the billiard …

Causality: Hypergraphs, Matter Of Degree, Foundations Of Cosmology, Cliff Joslyn, Andres Ortiz-Muñoz, Edgar Daniel Rodriguez Velasquez, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

The notion of causality is very important in many applications areas. Because of this importance, there are several formalizations of this notion in physics and in AI. Most of these definitions describe causality as a crisp ("yes"-"no") relation between two events or two processes -- cause and effect. However, such descriptions do not fully capture the intuitive idea of causality: first, often, several conditions are needed to be present for an effect to occur, and, second, the effect is often a matter of degree. In this paper, we show how to modify the current description of causality so as to …

Foundations Of Neural Networks Explain The Empirical Success Of The "Surrogate" Approach To Ordinal Regression -- And Recommend What Next, Salvador Robles, Martine Ceberio, Vladik Kreinovich

Departmental Technical Reports (CS)

Recently, a new efficient semi-heuristic statistical method -- called Surrogate Approach -- has been proposed for dealing with regression problems. How can we explain this empirical success? And since this method is only an approximation to reality, what can we recommend if there is a need for a more accurate approximation? In this paper, we show that this empirical success can be explained by the same arguments that explain the empirical success of neural networks -- and these arguments can also provide us with possible more general techniques (that will hopefully lead to more accurate approximation to real-life phenomena).

Towards Decision Making Under Interval Uncertainty, Juan A. Lopez, Vladik Kreinovich

Departmental Technical Reports (CS)

In many real-life situations, we need to make a decision. In many cases, we know the optimal decision in situations when we know the exact value of the corresponding quantity x. However, often, we do not know the exact value of this quantity, we only know the bounds on the value x -- i.e., we know the interval containing $x$. In this case, we need to select a decision corresponding to some value from this interval. The selected value will, in general, be different from the actual (unknown) value of this quantity. As a result, the quality of our decision …

Low-Probability High-Impact Events Are Even More Important Than It Is Usually Assumed, Aaron Velasco, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

A large proportion of undesirable events like earthquakes, floods, tornados occur in zones where these events are frequent. However, a significant number of such events occur in other zones, where such events are rare. For example, while most major earthquakes occur in a vicinity of major faults, i.e., on the border between two tectonic plates, some strong earthquakes also occur inside plates. We want to mitigate all undesirable events, but our resources are limited. So, to allocate these resources, we need to decide which ones are more important. For this decision, a natural idea is to use the product of …

What Do Goedel's Theorem And Arrow's Theorem Have In Common: A Possible Answer To Arrow's Question, Miroslav Svitek, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

Kenneth Arrow, the renowned author of the Impossibility Theorem that explains the difficulty of group decision making, noticed that there is some commonsense similarity between his result and Goedel's theorem about incompleteness of axiomatic systems. Arrow asked if it is possible to describe this similarity in more precise terms. In this paper, we make the first step towards this description. We show that in both cases, the impossibility result disappears if we take into account probabilities. Namely, we take into account that we can consider probabilistic situations, that we can make probabilistic conclusions, and that we can make probabilistic decisions …