Mathematics Commons^™

Need To Combine Interval And Probabilistic Uncertainty: What Needs To Be Computed, What Can Be Computed, What Can Be Feasibly Computed, And How Physics Can Help, Julio Urenda, Vladik Kreinovich, Olga Kosheleva

Departmental Technical Reports (CS)

In many practical situations, the quantity of interest is difficult to measure directly. In such situations, to estimate this quantity, we measure easier-to-measure quantities which are related to the desired one by a known relation, and we use the results of these measurement to estimate the desired quantity. How accurate is this estimate?

Traditional engineering approach assumes that we know the probability distributions of measurement errors; however, in practice, we often only have partial information about these distributions. In some cases, we only know the upper bounds on the measurement errors; in such cases, the only thing we know about …

Why People Tend To Overestimate Joint Probabilities, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

It is known that, in general, people overestimate the probabilities of joint events. In this paper, we provide an explanation for this phenomenon -- as explanation based on Laplace Indeterminacy Principle and Maximum Entropy approach.

How To Deal With Conflict Of Interest Situations When Selecting The Best Submission, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In many practical situations when we need to select the best submission -- the best paper, the best candidate, etc. -- there are so few experts that we cannot simply dismiss all the experts who have conflict of interest: we do not want them to judge their own submissions, but we would like to take into account their opinions of all other submissions. How can we take these opinions into account? In this paper, we show that a seemingly reasonable idea can actually lead to bias, and we explain how to take these opinions into account without biasing the final …

What Is A Natural Probability Distribution On The Class Of All Continuous Functions: Maximum Entropy Approach Leads To Wiener Measure, Vladik Kreinovich, Saeid Tizpaz-Niari

Departmental Technical Reports (CS)

While many data processing techniques assume that we know the probability distributions, in practice, we often only have a partial information about these probabilities -- so that several different distributions are consistent with our knowledge. Thus, to apply these data processing techniques, we need to select one of the possible probability distributions. There is a reasonable approach for such selection -- the Maximum Entropy approach. This approach selects a uniform distribution if all we know is that the random variable if located in an interval; it selects a normal distribution if all we know is the mean and the variance. …

Macrocausality Implies Lorenz Group: A Physics-Related Comment On Guts's Results, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

It is known that, in the space-time of Special Relativity, causality implies Lorenz group, i.e., if we know which events can causally influence each other, then, based on this information, we can uniquely reconstruct the affine structure of space-time. When the two events are very close, quantum effects, with their probabilistic nature, make it difficult to detect causality. So, the following question naturally arises: can we uniquely reconstruct the affine structure if we only know causality for events which are sufficiently far away from each other? Several positive answers to this question were provided in a recent paper by Alexander …

Local-Global Results On Discrete Structures, Alexander Lewis Stevens

Electronic Theses and Dissertations

Local-global arguments, or those which glean global insights from local information, are central ideas in many areas of mathematics and computer science. For instance, in computer science a greedy algorithm makes locally optimal choices that are guaranteed to be consistent with a globally optimal solution. On the mathematical end, global information on Riemannian manifolds is often implied by (local) curvature lower bounds. Discrete notions of graph curvature have recently emerged, allowing ideas pioneered in Riemannian geometry to be extended to the discrete setting. Bakry- Émery curvature has been one such successful notion of curvature. In this thesis we use combinatorial …

Guide To The Dr. L.S. Dederick Papers, 1908-1956, Undated, Orson Kingsley, Patrick Koetsch

Archives & Special Collections Finding Aids

Louis Serle (L.S.) Dederick was born in Chicago in 1883. He received his Ph.D. in Mathematics from Harvard University in 1909. From 1909 – 1917 he was a professor at Princeton University. From 1917 – 1924 he was professor at the U.S. Naval Academy in Annapolis, Maryland. In 1926 Dederick began working for the U.S. Army, Ordnance. During his time there he was the Associate Director of the Ballistic Research Laboratory at the Aberdeen Proving Grounds in Aberdeen, Maryland where he focused on ballistics research.

While Dederick worked as a mathematician at the Aberdeen Proving Grounds, he was involved with …

A Predictive Model To Predict Cyberattack Using Self-Normalizing Neural Networks, Oluwapelumi Eniodunmo

Theses, Dissertations and Capstones

Cyberattack is a never-ending war that has greatly threatened secured information systems. The development of automated and intelligent systems provides more computing power to hackers to steal information, destroy data or system resources, and has raised global security issues. Statistical and Data mining tools have received continuous research and improvements. These tools have been adopted to create sophisticated intrusion detection systems that help information systems mitigate and defend against cyberattacks. However, the advancement in technology and accessibility of information makes more identifiable elements that can be used to gain unauthorized access to systems and resources. Data mining and classification tools …

Search Under Uncertainty Should Be Randomized: A Lesson From The 2021 Nobel Prize In Medicine, Martine Ceberio, Vladik Kreinovich

Departmental Technical Reports (CS)

In many real-life situations, we know that one of several objects has the desired property, but we do not know which one. To find the desired object, we need to test these objects one by one. In situations when we have no additional information, there is no reason to prefer any testing order and thus, a usual recommendation is to test them in any order. This is usually interpreted as ordering the objects in the increasing value of some seemingly unrelated quantity. A possible drawback of this approach is that it may turn out that the selected quantity is correlated …

Games For One, Games For Two: Computationally Complex Fun For Polynomial-Hierarchical Families, Kye Shi

HMC Senior Theses

In the first half of this thesis, we explore the polynomial-time hierarchy, emphasizing an intuitive perspective that associates decision problems in the polynomial hierarchy to combinatorial games with fixed numbers of turns. Specifically, problems in �� are thought of as 0-turn games, ���� as 1-turn “puzzle” games, and in general ��ₖ�� as ��-turn games, in which decision problems answer the binary question, “can the starting player guarantee a win?” We introduce the formalisms of the polynomial hierarchy through this perspective, alongside definitions of ��-turn CIRCUIT SATISFIABILITY games, whose ��ₖ��-completeness is assumed from prior work (we briefly justify this assumption …

Finding Optimal Cayley Map Embeddings Using Genetic Algorithms, Jacob Buckelew

Honors Program Theses

Genetic algorithms are a commonly used metaheuristic search method aimed at solving complex optimization problems in a variety of fields. These types of algorithms lend themselves to problems that can incorporate stochastic elements, which allows for a wider search across a search space. However, the nature of the genetic algorithm can often cause challenges regarding time-consumption. Although the genetic algorithm may be widely applicable to various domains, it is not guaranteed that the algorithm will outperform other traditional search methods in solving problems specific to particular domains. In this paper, we test the feasibility of genetic algorithms in solving a …

Why Physical Power Laws Usually Have Rational Exponents, Edgar Daniel Rodriguez Velasquez, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

Many physical dependencies are described by power laws y=A*xa, for some exponent a. This makes perfect sense: in many cases, there are no preferred measuring units for the corresponding quantities, so the form of the dependence should not change if we simply replace the original unit with a different one. It is known that such invariance implies a power law. Interestingly, not all exponents are possible in physical dependencies: in most cases, we have power laws with rational exponents. In this paper, we explain the ubiquity of rational exponents by taking into account that in many case, there is also …

Can Physics Attain Its Goals: Extending D'Agostino's Analysis To 21st Century And Beyond, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In his 2000 seminal book, Silvo D'Agostino provided the detailed overview of the history of ideas underlying 19th and 20th century physics. Now that we are two decades into the 21st century, a natural question is: how can we extend his analysis to the 21st century physics -- and, if possible, beyond, to try to predict how physics will change? To perform this analysis, we go beyond an analysis of what happened and focus more on why para-digm changes happened in the history of physics. To better understand these paradigm changes, we analyze now only what were the main ideas …

How To Elicit Complex-Valued Fuzzy Degrees, Laxman Bokati, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In the traditional fuzzy logic, an expert's degree of certainty in a statement is described by a single number from the interval [0,1]. However, there are situations when a single number is not sufficient: e.g., a situation when we know nothing and a situation in which we have a lot of arguments for a given statement and an equal number of arguments against it are both described by the same number 0.5. Several techniques have been proposed to distinguish between such situations. The most widely used is interval-valued technique, where we allow the expert to describe his/her degree of certainty …

Towards Optimal Techniques Intermediate Between Interval And Affine, Affine And Taylor, Martine Ceberio, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In data processing, it is important to gauge how input uncertainty affects the results of data processing. Several techniques have been proposed for this gauging, from interval to affine to Taylor techniques. Some of these techniques result in more accurate estimates but require longer computation time, others' results are less accurate but can be obtained faster. Sometimes, we do not have enough time to use more accurate (but more time-consuming) techniques, but we have more time than needed for less accurate ones. In such cases, it is desirable to come up with intermediate techniques that would utilize the available additional …

Discrete Causality Implies Lorenz Group: Case Of 2-D Space-Times, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

It is known that for Minkowski space-times of dimension larger than 2, any causality-preserving transformation is linear. It is also known that in a 2-D space-time, there are many nonlinear causality-preserving transformations. In this paper, we show that for 2-D space-times, if we restrict ourselves to discrete space-times, then linearity is retained: only linear transformation preserve causality.

There From The Beginning: The Women Of Los Alamos National Laboratory Supporting National And International Nuclear Security, Olga Martin, Laura Mcclellan, Octavio Ramos, Heather Quinn

International Journal of Nuclear Security

From the beginning of the Manhattan Project in the early 1940s, the women of what would become Los Alamos National Laboratory (LANL) worked in technical positions alongside their male counterparts, played a key role as computers, and worked in administrative jobs as secretaries, phone operators, bookkeepers, and on behalf of the U.S. Army in the Women’s Army Corps.

Throughout the history of the Laboratory, women experts at LANL helped establish and lead important national and international security programs, with careers in science, technology, engineering, and mathematics. Over time, the women of Los Alamos have come together under various Employee Resource …

Don’T Beep At Me: Using Google Maps Apis To Reduce Driving Anxiety, Daniel Chechelnitsky

Mathematics, Statistics, and Computer Science Honors Projects

Stress while driving is a significant issue that causes automobile incidents. Along with the physical injuries, there is often baggage and trauma associated with these accidents. Wearable health monitoring technology, like Smartwatches, has a real possibility to help people further understand the stress inducing processes of driving. Thus to help with this issue, I propose a Google Maps app extension called: "Don't Beep At Me". This project creates a map that is layered by heart rate instead of speed limit and has great potential to be useful for reducing driving anxiety.

Stroke Clustering And Fitting In Vector Art, Khandokar Shakib

Senior Independent Study Theses

Vectorization of art involves turning free-hand drawings into vector graphics that can be further scaled and manipulated. In this paper, we explore the concept of vectorization of line drawings and study multiple approaches that attempt to achieve this in the most accurate way possible. We utilize a software called StrokeStrip to discuss the different mathematics behind the parameterization and fitting involved in the drawings.

Highlights Generation For Tennis Matches Using Computer Vision, Natural Language Processing And Audio Analysis, Alon Liberman

Senior Independent Study Theses

This project uses computer vision, natural language processing and audio analysis to automatize the highlights generation task for tennis matches. Computer vision techniques such as camera shot detection, hough transform and neural networks are used to extract the time intervals of the points. To detect the best points, three approaches are used. Point length suggests which points correspond to rallies and aces. The audio waves are analyzed to search for the highest audio peaks, which indicate the moments where the crowd cheers the most. Sentiment analysis, a natural language processing technique, is used to look for points where the commentators …

Decoding Cyclic Codes Via Gröbner Bases, Eduardo Sosa

Honors Theses

In this paper, we analyze the decoding of cyclic codes. First, we introduce linear and cyclic codes, standard decoding processes, and some standard theorems in coding theory. Then, we will introduce Gr¨obner Bases, and describe their connection to the decoding of cyclic codes. Finally, we go in-depth into how we decode cyclic codes using the key equation, and how a breakthrough by A. Brinton Cooper on decoding BCH codes using Gr¨obner Bases gave rise to the search for a polynomial-time algorithm that could someday decode any cyclic code. We discuss the different approaches taken toward developing such an algorithm and …

Investigation Of Neutrophil-Like Hl-60 Cell Migration In A 3d Collagen Matrix, Pouye Sedighian

CGU Theses & Dissertations

It is known that cell migration in innate and adaptive immune system plays a fundamental role in human health. Among the immune cells, neutrophils are one of the most essential cells in protecting the body against invading pathogens. In the presence of chemoattractants, these cells are the first responders that start a directed migration toward the injured area. As neutrophils approach the site of infection, they transmigrate to the tissue and follow the chemoattractant concentration gradient to locate and eliminate the invading pathogens. Understanding the patterns and mechanism of neutrophil migration in the presence of chemoattractants could possibly play an …

Rankings Of Mma Fighters, Michael Schaefer

All Graduate Theses, Dissertations, and Other Capstone Projects

Ranking is an essential process that allows sporting authorities to determine the relative performance of athletes. While ranking is straightforward in some sports, it is more complicated in MMA (mixed martial arts), where competition is often fragmented. This paper describes the mathematics behind four existing ranking algorithms: Elo’s System, Massey’s Method, Colley’s Method, and Google’s PageRank, and shows how to adapt them to rank MMA fighters in the UFC (Ultimate Fighting Championship). We also provide a performance analysis for each ranking method.

Matrix Interpretations And Tools For Investigating Even Functionals, Benjamin Stringer

Theses and Dissertations--Computer Science

Even functionals are a set of polynomials evaluated on the terms of hollow symmetric matrices. Their properties lend themselves to applications such as counting subgraph embeddings in generic (weighted or unweighted) host graphs and computing moments of binary quadratic forms, which occur in combinatorial optimization. This research focuses primarily on counting subgraph embeddings, which is traditionally accomplished with brute-force algorithms or algorithms curated for special types of graphs. Even functionals provide a method for counting subgraphs algebraically in time proportional to matrix multiplication and is not restricted to particular graph types. Counting subgraph embeddings can be accomplished by evaluating a …

A Comparison Of Stacking Methods To Estimate Survival Using Residual Lifetime Data From Prevalent Cohort Studies, Zhaoheng Li

Mathematics, Statistics, and Computer Science Honors Projects

Prevalent cohort studies are widely used for their cost-efficiency and convenience. However, in such studies, only the residual lifetime can be observed. Traditionally, researchers rely on self-reported onset times to infer the underlying survival distribution, which may introduce additional bias that confounds downstream analysis. This study compares two stacking procedures and one mixture model approach that uses only residual lifetime data while leveraging the strengths of different estimators. Our simulation results show that the two stacked estimators outperform the nonparametric maximum likelihood estimator (NPMLE) and the mixture model, allowing robust and accurate estimations for underlying survival distributions.

Realtime Event Detection In Sports Sensor Data With Machine Learning, Mallory Cashman

Honors Theses and Capstones

Machine learning models can be trained to classify time series based sports motion data, without reliance on assumptions about the capabilities of the users or sensors. This can be applied to predict the count of occurrences of an event in a time period. The experiment for this research uses lacrosse data, collected in partnership with SPAITR - a UNH undergraduate startup developing motion tracking devices for lacrosse. Decision Tree and Support Vector Machine (SVM) models are trained and perform with high success rates. These models improve upon previous work in human motion event detection and can be used a reference …

Reinforcement Learning: Low Discrepancy Action Selection For Continuous States And Actions, Jedidiah Lindborg

College of Graduate Studies: Theses & Dissertations

In reinforcement learning the process of selecting an action during the exploration or exploitation stage is difficult to optimize. The purpose of this thesis is to create an action selection process for an agent by employing a low discrepancy action selection (LDAS) method. This should allow the agent to quickly determine the utility of its actions by prioritizing actions that are dissimilar to ones that it has already picked. In this way the learning process should be faster for the agent and result in more optimal policies.

Exo-Sir: An Epidemiological Model To Analyze The Impact Of Exogenous Spread Of Infection, Nirmal Kumar Sivaraman, Manas Gaur, Shivansh Baijal, Sakthi Balan Muthiah, Amit Sheth

Publications

Epidemics like Covid-19 and Ebola have impacted people's lives significantly. The impact of mobility of people across the countries or states in the spread of epidemics has been significant. The spread of disease due to factors local to the population under consideration is termed the endogenous spread. The spread due to external factors like migration, mobility, etc. is called the exogenous spread. In this paper, we introduce the Exo-SIR model, an extension of the popular SIR model and a few variants of the model. The novelty in our model is that it captures both the exogenous and endogenous spread of …

Lasso: Listing All Subset Sums Obediently For Evaluating Unbounded Subset Sums, Christopher N. Burgoyne, Travis J. Wheeler

Graduate Student Theses, Dissertations, & Professional Papers

In this study we present a novel algorithm, LASSO, for solving the unbounded and bounded subset sum problem. The LASSO algorithm was designed to solve the unbounded SSP quickly and to return all subsets summing to a target sum. As speed was the highest priority, we benchmarked the run time performance of LASSO against implementations of some common approaches to the bounded SSP, as well as the only comparable implementation for solving the unbounded SSP that we could find. In solving the bounded SSP, our algorithm had a significantly faster run time than the competing algorithms when the target sum …

Sufficient Condition For The Possibility Of Completing The Pursuit, Nodirbek Umrzaqov

Scientific Bulletin. Physical and Mathematical Research

In this paper, the problem of chase is represented by a system of linear differential equations of motion dynamics. In this case, there is an integral limit to the control parameter of the evader, and a geometric limit to the control parameter of the pursuer. The pursuer is allowed to use the control that the fugitive has used so far to build his control. There are enough conditions for the game to end even if it starts from any starting point. An algorithm for constructing the control function of the pursuer is defined. It should also be noted that the …