Other Mathematics Commons^™

Reducing Food Scarcity: The Benefits Of Urban Farming, S.A. Claudell, Emilio Mejia

Journal of Nonprofit Innovation

Urban farming can enhance the lives of communities and help reduce food scarcity. This paper presents a conceptual prototype of an efficient urban farming community that can be scaled for a single apartment building or an entire community across all global geoeconomics regions, including densely populated cities and rural, developing towns and communities. When deployed in coordination with smart crop choices, local farm support, and efficient transportation then the result isn’t just sustainability, but also increasing fresh produce accessibility, optimizing nutritional value, eliminating the use of ‘forever chemicals’, reducing transportation costs, and fostering global environmental benefits.

Imagine Doris, who is …

Reducing Uncertainty In Sea-Level Rise Prediction: A Spatial-Variability-Aware Approach, Subhankar Ghosh, Shuai An, Arun Sharma, Jayant Gupta, Shashi Shekhar, Aneesh Subramanian

I-GUIDE Forum

Given multi-model ensemble climate projections, the goal is to accurately and reliably predict future sea-level rise while lowering the uncertainty. This problem is important because sea-level rise affects millions of people in coastal communities and beyond due to climate change's impacts on polar ice sheets and the ocean. This problem is challenging due to spatial variability and unknowns such as possible tipping points (e.g., collapse of Greenland or West Antarctic ice-shelf), climate feedback loops (e.g., clouds, permafrost thawing), future policy decisions, and human actions. Most existing climate modeling approaches use the same set of weights globally, during either regression or …

Signings Of Graphs And Sign-Symmetric Signed Graphs, Ahmad Asiri

Theses and Dissertations

In this dissertation, we investigate various aspects of signed graphs, with a particular focus on signings and sign-symmetric signed graphs. We begin by examining the complete graph on six vertices with one edge deleted ($K_6$\textbackslash e) and explore the different ways of signing this graph up to switching isomorphism. We determine the frustration index (number) of these signings and investigate the existence of sign-symmetric signed graphs. We then extend our study to the $K_6$\textbackslash 2e graph and the McGee graph with exactly two negative edges. We investigate the distinct ways of signing these graphs up to switching isomorphism and demonstrate …

Novel Architectures And Optimization Algorithms For Training Neural Networks And Applications, Vasily I. Zadorozhnyy

Theses and Dissertations--Mathematics

The two main areas of Deep Learning are Unsupervised and Supervised Learning. Unsupervised Learning studies a class of data processing problems in which only descriptions of objects are known, without label information. Generative Adversarial Networks (GANs) have become among the most widely used unsupervised neural net models. GAN combines two neural nets, generative and discriminative, that work simultaneously. We introduce a new family of discriminator loss functions that adopts a weighted sum of real and fake parts, which we call adaptive weighted loss functions. Using the gradient information, we can adaptively choose weights to train a discriminator in the direction …

The History Of The Enigma Machine, Jenna Siobhan Parkinson

History Publications

The history of the Enigma machine begins with the invention of the rotor-based cipher machine in 1915. Various models for rotor-based cipher machines were developed somewhat simultaneously in different parts of the world. However, the first documented rotor machine was developed by Dutch naval officers in 1915. Nonetheless, the Enigma machine was officially invented following the end of World War I by Arthur Scherbius in 1918 (Faint, 2016).

Academic Hats And Ice Cream: Two Optimization Problems, Valery F. Ochkov, Yulia V. Chudova

Journal of Humanistic Mathematics

This article describes the use of computer software to optimize the design of an academic hat and an ice cream cone!

Using Graph Theoretical Methods And Traceroute To Visually Represent Hidden Networks, Jordan M. Sahs

UNO Student Research and Creative Activity Fair

Within the scope of a Wide Area Network (WAN), a large geographical communication network in which a collection of networking devices communicate data to each other, an example being the spanning communication network, known as the Internet, around continents. Within WANs exists a collection of Routers that transfer network packets to other devices. An issue pertinent to WANs is their immeasurable size and density, as we are not sure of the amount, or the scope, of all the devices that exists within the network. By tracing the routes and transits of data that traverses within the WAN, we can identify …

Implementation Of A Least Squares Method To A Navier-Stokes Solver, Jada P. Lytch, Taylor Boatwright, Ja'nya Breeden

Rose-Hulman Undergraduate Mathematics Journal

The Navier-Stokes equations are used to model fluid flow. Examples include fluid structure interactions in the heart, climate and weather modeling, and flow simulations in computer gaming and entertainment. The equations date back to the 1800s, but research and development of numerical approximation algorithms continues to be an active area. To numerically solve the Navier-Stokes equations we implement a least squares finite element algorithm based on work by Roland Glowinski and colleagues. We use the deal.II academic library , the C++ language, and the Linux operating system to implement the solver. We investigate convergence rates and apply the least squares …

A New Metaphor: How Artificial Intelligence Links Legal Reasoning And Mathematical Thinking, Melissa E. Love Koenig, Colleen Mandell

Marquette Law Review

Artificial intelligence’s (AI’s) impact on the legal community expands exponentially each year. As AI advances, lawyers have more powerful tools to enhance their ability to research and analyze the law, as well as to draft contracts and other legal documents. Lawyers are already using tools powered by AI and are learning to shift their methodologies to take advantage of these enhancements. To continue to grow into their shifting role, lawyers should understand the relationship between AI, mathematics, and legal reasoning.

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 …

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 …

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 …

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.

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 …

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

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

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 …

Contemporary Mathematical Approaches To Computability Theory, Luis Guilherme Mazzali De Almeida

Undergraduate Student Research Internships Conference

In this paper, I present an introduction to computability theory and adopt contemporary mathematical definitions of computable numbers and computable functions to prove important theorems in computability theory. I start by exploring the history of computability theory, as well as Turing Machines, undecidability, partial recursive functions, computable numbers, and computable real functions. I then prove important theorems in computability theory, such that the computable numbers form a field and that the computable real functions are continuous.

Graph-Theoretic Partitioning Of Rnas And Classification Of Pseudoknots-Ii, Louis Petingi

Publications and Research

Dual graphs have been applied to model RNA secondary structures with pseudoknots, or intertwined base pairs. In previous works, a linear-time algorithm was introduced to partition dual graphs into maximally connected components called blocks and determine whether each block contains a pseudoknot or not. As pseudoknots can not be contained into two different blocks, this characterization allow us to efficiently isolate smaller RNA fragments and classify them as pseudoknotted or pseudoknot-free regions, while keeping these sub-structures intact. Moreover we have extended the partitioning algorithm by classifying a pseudoknot as either recursive or non-recursive in order to continue with our research …

Modeling The Spread Of Covid-19 Over Varied Contact Networks, Ryan L. Solorzano

Master's Theses

When attempting to mitigate the spread of an epidemic without the use of a vaccine, many measures may be made to dampen the spread of the disease such as physically distancing and wearing masks. The implementation of an effective test and quarantine strategy on a population has the potential to make a large impact on the spread of the disease as well. Testing and quarantining strategies become difficult when a portion of the population are asymptomatic spreaders of the disease. Additionally, a study has shown that randomly testing a portion of a population for asymptomatic individuals makes a small impact …

Development Of Novel Compound Controllers To Reduce Chattering Of Sliding Mode Control, Mehran Rahmani

Theses and Dissertations

The robotics and dynamic systems constantly encountered with disturbances such as micro electro mechanical systems (MEMS) gyroscope under disturbances result in mechanical coupling terms between two axes, friction forces in exoskeleton robot joints, and unmodelled dynamics of robot manipulator. Sliding mode control (SMC) is a robust controller. The main drawback of the sliding mode controller is that it produces high-frequency control signals, which leads to chattering. The research objective is to reduce chattering, improve robustness, and increase trajectory tracking of SMC. In this research, we developed controllers for three different dynamic systems: (i) MEMS, (ii) an Exoskeleton type robot, and …

Defect Detection In Atomic Resolution Transmission Electron Microscopy Images Using Machine Learning, Philip Cho, Aihua W. Wood, Krishnamurthy Mahalingam, Kurt Eyink

Faculty Publications

Point defects play a fundamental role in the discovery of new materials due to their strong influence on material properties and behavior. At present, imaging techniques based on transmission electron microscopy (TEM) are widely employed for characterizing point defects in materials. However, current methods for defect detection predominantly involve visual inspection of TEM images, which is laborious and poses difficulties in materials where defect related contrast is weak or ambiguous. Recent efforts to develop machine learning methods for the detection of point defects in TEM images have focused on supervised methods that require labeled training data that is generated via …

Optimizing Networking Topologies With Shortest Path Algorithms, Jordan Sahs

UNO Student Research and Creative Activity Fair

Communication networks tend to contain redundant devices and mediums of transmission, thus the need to locate, document, and optimize networks is increasingly becoming necessary. However, many people do not know where to start the optimization progress. What is network topology? What is this “Shortest Path Problem”, and how can it be used to better my network? These questions are presented, taught, and answered within this paper. To supplement the reader’s understanding there are thirty-eight figures in the paper that are used to help convey and compartmentalize the learning process needed to grasp the materials presented in the ending sections.

In …

Group Theory Visualized Through The Rubik's Cube, Ashlyn Okamoto

University Honors Theses

In my thesis, I describe the work done to implement several Group Theory concepts in the context of the Rubik’s cube. A simulation of the cube was constructed using Processing-Java and with help from a YouTube series done by TheCodingTrain. I reflect on the struggles and difficulties that came with creating this program along with the inspiration behind the project. The concepts that are currently implemented at this time are: Identity, Associativity, Order, and Inverses. The functionality of the cube is described as it moves like a regular cube but has extra keypresses that demonstrate the concepts listed. Each concept …

Hamming Codes, Steve Mwangi, Sterling Quinn

Access*: Interdisciplinary Journal of Student Research and Scholarship

We will be looking into the application of Matrix Algebra in forming Hamming Codes. Hamming Codes are essential not just in the detection of errors, but also in the linear concurrent correction of these errors. The matrices we will use, will have entries that are binary units. Binary units are mathematically convenient, and their simplicity permits the representation of many open and closed circuits used in communication systems. The entries in the matrices will represent a message that is meant for transmission or reception, akin to the contemporary application of Hamming Codes in wireless communication. We will use Hamming (7,4) …

Role Of Influence In Complex Networks, Nur Dean

Dissertations, Theses, and Capstone Projects

Game theory is a wide ranging research area; that has attracted researchers from various fields. Scientists have been using game theory to understand the evolution of cooperation in complex networks. However, there is limited research that considers the structure and connectivity patterns in networks, which create heterogeneity among nodes. For example, due to the complex ways most networks are formed, it is common to have some highly “social” nodes, while others are highly isolated. This heterogeneity is measured through metrics referred to as “centrality” of nodes. Thus, the more “social” nodes tend to also have higher centrality.

In this thesis, …

Integrating Data Science Ethics Into An Undergraduate Major, Benjamin Baumer, Randi L. Garcia, Albert Y. Kim, Katherine M. Kinnaird, Miles Q. Ott

Statistical and Data Sciences: Faculty Publications

We present a programmatic approach to incorporating ethics into an undergraduate major in statistical and data sciences. We discuss departmental-level initiatives designed to meet the National Academy of Sciences recommendation for weaving ethics into the curriculum from top-to-bottom as our majors progress from our introductory courses to our senior capstone course, as well as from side-to-side through co-curricular programming. We also provide six examples of data science ethics modules used in five different courses at our liberal arts college, each focusing on a different ethical consideration. The modules are designed to be portable such that they can be flexibly incorporated …

A Mathematical Analysis Of The Game Of Santorini, Carson Clyde Geissler

Senior Independent Study Theses

Santorini is a two player combinatorial board game. Santorini bears resemblance to the graph theory game of Geography, a game of moving and deleting vertices on a graph. We explore Santorini with game theory, complexity theory, and artificial intelligence. We present David Lichtenstein’s proof that Geography is PSPACE-hard and adapt the proof for generalized forms of Santorini. Last, we discuss the development of an AI built for a software implementation of Santorini and present a number of improvements to that AI.

Maximality And Applications Of Subword-Closed Languages, Rhys Davis Jones

UNF Graduate Theses and Dissertations

Characterizing languages D that are maximal with the property that D^* ⊆ S^⊗ is an important problem in formal language theory with applications to coding theory and DNA codewords. Given a finite set of words of a fixed length S, the constraint, we consider its subword closure, S^⊗, the set of words whose subwords of that fixed length are all in the constraint. We investigate these maximal languages and present characterizations for them. These characterizations use strongly connected components of deterministic finite automata and lead to polynomial time algorithms for generating such languages. We prove that …

Remark On Artificial Intelligence, Humanoid And Terminator Scenario: A Neutrosophic Way To Futurology, Victor Christianto, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

This article is an update of our previous article in this SGJ journal, titled: On Gödel's Incompleteness Theorem, Artificial Intelligence & Human Mind [7]. We provide some commentary on the latest developments around AI, humanoid robotics, and future scenario. Basically, we argue that a more thoughtful approach to the future is "technorealism."

Psu At Clef-2020 Arqmath Track: Unsupervised Re-Ranking Using Pretraining, Shaurya Rohatgi, Jian Wu, C. Lee Giles

Computer Science Faculty Publications

This paper elaborates on our submission to the ARQMath track at CLEF 2020. Our primary run for the main Task-1: Question Answering uses a two-stage retrieval technique in which the first stage is a fusion of traditional BM25 scoring and tf-idf with cosine similarity-based retrieval while the second stage is a finer re-ranking technique using contextualized embeddings. For the re-ranking we use a pre-trained robertabase model (110 million parameters) to make the language model more math-aware. Our approach achieves a higher NDCG0 score than the baseline, while our MAP and P@10 scores are competitive, performing better than the best submission …