Other Applied Mathematics Commons^™

Triple Non-Negative Matrix Factorization Technique For Sentiment Analysis And Topic Modeling, Alexander A. Waggoner

CMC Senior Theses

Topic modeling refers to the process of algorithmically sorting documents into categories based on some common relationship between the documents. This common relationship between the documents is considered the “topic” of the documents. Sentiment analysis refers to the process of algorithmically sorting a document into a positive or negative category depending whether this document expresses a positive or negative opinion on its respective topic. In this paper, I consider the open problem of document classification into a topic category, as well as a sentiment category. This has a direct application to the retail industry where companies may want to scour …

Network Analytics For The Mirna Regulome And Mirna-Disease Interactions, Joseph Jayakar Nalluri

Theses and Dissertations

miRNAs are non-coding RNAs of approx. 22 nucleotides in length that inhibit gene expression at the post-transcriptional level. By virtue of this gene regulation mechanism, miRNAs play a critical role in several biological processes and patho-physiological conditions, including cancers. miRNA behavior is a result of a multi-level complex interaction network involving miRNA-mRNA, TF-miRNA-gene, and miRNA-chemical interactions; hence the precise patterns through which a miRNA regulates a certain disease(s) are still elusive. Herein, I have developed an integrative genomics methods/pipeline to (i) build a miRNA regulomics and data analytics repository, (ii) create/model these interactions into networks and use optimization techniques, motif …

Neural Network Predictions Of A Simulation-Based Statistical And Graph Theoretic Study Of The Board Game Risk, Jacob Munson

Murray State Theses and Dissertations

We translate the RISK board into a graph which undergoes updates as the game advances. The dissection of the game into a network model in discrete time is a novel approach to examining RISK. A review of the existing statistical findings of skirmishes in RISK is provided. The graphical changes are accompanied by an examination of the statistical properties of RISK. The game is modeled as a discrete time dynamic network graph, with the various features of the game modeled as properties of the network at a given time. As the network is computationally intensive to implement, results are produced …

A Traders Guide To The Predictive Universe- A Model For Predicting Oil Price Targets And Trading On Them, Jimmie Harold Lenz

Doctor of Business Administration Dissertations

At heart every trader loves volatility; this is where return on investment comes from, this is what drives the proverbial “positive alpha.” As a trader, understanding the probabilities related to the volatility of prices is key, however if you could also predict future prices with reliability the world would be your oyster. To this end, I have achieved three goals with this dissertation, to develop a model to predict future short term prices (direction and magnitude), to effectively test this by generating consistent profits utilizing a trading model developed for this purpose, and to write a paper that anyone with …

On The Exchange Property For The Mehler-Fock Transform, Abhishek Singh

Applications and Applied Mathematics: An International Journal (AAM)

The theory of Schwartz Distributions opened up a new area of mathematical research, which in turn has provided an impetus in the development of a number of mathematical disciplines, such as ordinary and partial differential equations, operational calculus, transformation theory and functional analysis. The integral transforms and generalized functions have also shown equivalent association of Boehmians and the integral transforms. The theory of Boehmians, which is a generalization of Schwartz distributions are discussed in this paper. Further, exchange property is defined to construct Mehler-Fock transform of tempered Boehmians. We investigate exchange property for the Mehler-Fock transform by using the theory …

General Equations For Natural Selection Under Complete Dominance, Kasthuri Kannan, Adriana Heguy

Annual Symposium on Biomathematics and Ecology Education and Research

No abstract provided.

Limiting Forms Of Iterated Circular Convolutions Of Planar Polygons, Boyan Kostadinov

Publications and Research

We consider a complex representation of an arbitrary planar polygon P centered at the origin. Let P(1) be the normalized polygon obtained from P by connecting the midpoints of its sides and normalizing the complex vector of vertex coordinates. We say that P(1) is a normalized average of P. We identify this averaging process with a special case of a circular convolution. We show that if the convolution is repeated many times, then for a large class of polygons the vertices of the limiting polygon lie either on an ellipse or on a star-shaped polygon. We derive a complete and …

Cayley Graphs Of Semigroups And Applications To Hashing, Bianca Sosnovski

Dissertations, Theses, and Capstone Projects

In 1994, Tillich and Zemor proposed a scheme for a family of hash functions that uses products of matrices in groups of the form $SL_2(F_{2^n})$. In 2009, Grassl et al. developed an attack to obtain collisions for palindromic bit strings by exploring a connection between the Tillich-Zemor functions and maximal length chains in the Euclidean algorithm for polynomials over $F_2$.

In this work, we present a new proposal for hash functions based on Cayley graphs of semigroups. In our proposed hash function, the noncommutative semigroup of linear functions under composition is considered as platform for the scheme. We will also …

The Evolution Of Cryptology, Gwendolyn Rae Souza

Electronic Theses, Projects, and Dissertations

We live in an age when our most private information is becoming exceedingly difficult to keep private. Cryptology allows for the creation of encryptive barriers that protect this information. Though the information is protected, it is not entirely inaccessible. A recipient may be able to access the information by decoding the message. This possible threat has encouraged cryptologists to evolve and complicate their encrypting methods so that future information can remain safe and become more difficult to decode. There are various methods of encryption that demonstrate how cryptology continues to evolve through time. These methods revolve around different areas of …

Statistics In League Of Legends: Analyzing Runes For Last-Hitting, Brian M. Hook

Mathematics: Student Scholarship & Creative Works

While other sports have statisticians to evaluate players and their stats, in electronic sports there is a need for statisticians to evaluate different parts of the game. League of Legends is the most popular of ESports and is the focus of this discussion. The mechanic of focus here is runes which give boosts to the players stats in-game like being able to do extra damage. We will be finding the effectiveness of these runes by looking at gold efficiency, help with last hitting, and extra damage dealt through the use of Python.

A Computational Investigation Of Large Gaps In Contingency Tables, Noah J. Watson

Senior Honors Projects, 2010-2019

Integer programming can be used to find upper and lower bounds on the cells of a multi-dimensional contingency table using the information from the released margins. The linear relaxation of these programs also provides bounds and the discrepancy between these bounds, the integer programming gap, can be large. While the more notable examples of large gaps have been shown to be rare, here we provide some results on the rarity of large gaps on small tables.

Population Projection And Habitat Preference Modeling Of The Endangered James Spinymussel (Pleurobema Collina), Marisa Draper

Senior Honors Projects, 2010-2019

The James Spinymussel (Pleurobema collina) is an endangered mussel species at the top of Virginia’s conservation list. The James Spinymussel plays a critical role in the environment by filtering and cleaning stream water while providing shelter and food for macroinvertebrates; however, conservation efforts are complicated by the mussels’ burrowing behavior, camouflage, and complex life cycle. The goals of the research conducted were to estimate detection probabilities that could be used to predict species presence and facilitate field work, and to track individually marked mussels to test for habitat preferences. Using existing literature and mark-recapture field data, these goals were accomplished …

Drawing Numbers And Listening To Patterns, Loren Zo Haynes

Honors College Theses

The triangular numbers is a series of number that add the natural numbers. Parabolic shapes emerge when this series is placed on a lattice, or imposed with a limited number of columns that causes the sequence to continue on the next row when it has reached the kth column. We examine these patterns and construct proofs that explain their behavior. We build off of this to see what happens to the patterns when there is not a limited number of columns, and we formulate the graphs as musical patterns on a staff, using each column as a line or space …

Variance Of Clusterings On Graphs, Thomas Vlado Mulc

Mathematical Sciences Technical Reports (MSTR)

Graphs that represent data often have structures or characteristics that can represent some relationships in the data. One of these structures is clusters or community structures. Most clustering algorithms for graphs are deterministic, which means they will output the same clustering each time. We investigated a few stochastic algorithms, and look into the consistency of their clusterings.

Single Valued Neutrosophic Graphs, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea

Branch Mathematics and Statistics Faculty and Staff Publications

The notion of single valued neutrosophic sets is a generalization of fuzzy sets, intuitionistic fuzzy sets. We apply the concept of single valued neutrosophic sets, an instance of neutrosophic sets, to graphs. We introduce certain types of single valued neutrosophic graphs (SVNG) and investigate some of their properties with proofs and examples.

Multiple Problem-Solving Strategies Provide Insight Into Students’ Understanding Of Open-Ended Linear Programming Problems, Marla A. Sole

Publications and Research

Open-ended questions that can be solved using different strategies help students learn and integrate content, and provide teachers with greater insights into students’ unique capabilities and levels of understanding. This article provides a problem that was modified to allow for multiple approaches. Students tended to employ high-powered, complex, familiar solution strategies rather than simpler, more intuitive strategies, which suggests that students might need more experience working with informal solution methods. During the semester, by incorporating open-ended questions, I gained valuable feedback, was able to better model real-world problems, challenge students with different abilities, and strengthen students’ problem solving skills.

Subgroups Of Finite Wreath Product Groups For P=3, Jessica L. Gonda

Williams Honors College, Honors Research Projects

Let M be the additive abelian group of 3-by-3 matrices whose entries are from the ring of integers modulo 9. The problem of determining all the normal subgroups of the regular wreath product group P=Z₉≀(Z₃ × Z₃) that are contained in its base subgroup is equivalent to the problem of determining the subgroups of M that are invariant under two particular endomorphisms of M. In this thesis we give a partial solution to the latter problem by implementing a systematic approach using concepts from group theory and linear algebra.

On The Stability Of A Pexiderized Functional Equation In Intuitionistic Fuzzy Banach Spaces, Nabin C. Kayal, Pratap Mondal, T. K. Samanta

Applications and Applied Mathematics: An International Journal (AAM)

During the last few decades several researchers have been devoted to establishing stability of different kinds of functional equations, differential equations, functional differential equations, fractional differential equations, etc. under different sufficient conditions in different spaces like Banach spaces, Banach modules, fuzzy Banach spaces etc. In this paper, we remain confined in the discussion of stability of functional equations in intuitionistic fuzzy Banach spaces. Ulam was the first person who introduced an open question concerning the stability of a group homomorphism in an international conference. Thereafter several researchers have replied and are still replying to this open question in different contexts. …

Asymptotically Double Lacunary Equivalent Sequences In Topological Groups, Ayhan Esi, M. K. Ozdemir

Applications and Applied Mathematics: An International Journal (AAM)

In this paper we study the concept of asymptotically double lacunary statistical convergent sequences in topological groups and prove some inclusion theorems.

Filters And Matrix Factorization, Myung-Sin Song, Palle E. T. Jorgensen

SIUE Faculty Research, Scholarship, and Creative Activity

We give a number of explicit matrix-algorithms for analysis/synthesis

in multi-phase filtering; i.e., the operation on discrete-time signals which

allow a separation into frequency-band components, one for each of the

ranges of bands, say N , starting with low-pass, and then corresponding

filtering in the other band-ranges. If there are N bands, the individual

filters will be combined into a single matrix action; so a representation of

the combined operation on all N bands by an N x N matrix, where the

corresponding matrix-entries are periodic functions; or their extensions to

functions of a complex variable. Hence our setting entails …

How Does “Collaboration” Occur At All? Remarks On Epistemological Issues Related To Understanding / Working With ‘The Other’, Don Faust, Judith Puncochar

Conference Presentations

Collaboration, if to occur successfully at all, needs to be based on careful representation and communication of each stakeholder’s knowledge. In this paper, we investigate, from a foundational logical and epistemological point of view, how such representation and communication can be accomplished. What we tentatively conclude, based on a careful delineation of the logical technicalities necessarily involved in such representation and communication, is that a complete representation is not possible. This inference, if correct, is of course rather discouraging with regard to what we can hope to achieve in the knowledge representations that we bring to our collaborations. We suggest …

Analysis Of Discrete Fractional Operators And Discrete Fractional Rheological Models, Meltem Uyanik

Masters Theses & Specialist Projects

This thesis is comprised of two main parts: Monotonicity results on discrete fractional operators and discrete fractional rheological constitutive equations. In the first part of the thesis, we introduce and prove new monotonicity concepts in discrete fractional calculus. In the remainder, we carry previous results about fractional rheological models to the discrete fractional case. The discrete method is expected to provide a better understanding of the concept than the continuous case as this has been the case in the past. In the first chapter, we give brief information about the main results. In the second chapter, we present some fundamental …

Bioinformatic Game Theory And Its Application To Cluster Multi-Domain Proteins, Brittney Keel

Department of Mathematics: Dissertations, Theses, and Student Research

The exact evolutionary history of any set of biological sequences is unknown, and all phylogenetic reconstructions are approximations. The problem becomes harder when one must consider a mix of vertical and lateral phylogenetic signals. In this dissertation we propose a game-theoretic approach to clustering biological sequences and analyzing their evolutionary histories. In this context we use the term evolution as a broad descriptor for the entire set of mechanisms driving the inherited characteristics of a population. The key assumption in our development is that evolution tries to accommodate the competing forces of selection, of which the conservation force seeks to …

A Hierarchical Graph For Nucleotide Binding Domain 2, Samuel Kakraba

Electronic Theses and Dissertations

One of the most prevalent inherited diseases is cystic fibrosis. This disease is caused by a mutation in a membrane protein, the cystic fibrosis transmembrane conductance regulator (CFTR). CFTR is known to function as a chloride channel that regulates the viscosity of mucus that lines the ducts of a number of organs. Generally, most of the prevalent mutations of CFTR are located in one of two nucleotide binding domains, namely, the nucleotide binding domain 1 (NBD1). However, some mutations in nucleotide binding domain 2 (NBD2) can equally cause cystic fibrosis. In this work, a hierarchical graph is built for NBD2. …

The Riemann Curvature Tensor, Its Invariants, And Their Use In The Classification Of Spacetimes, Jesse Hicks

Presentations and Publications

The equivalence problem in general relativity is to determine whether two solutions of the Einstein field equations are isometric. Petrov has given a classification of metrics according to their isometry algebras. This talk discusses the use of the Petrov classification scheme, together with the use of scalar curvature invariants, to address the equivalence problem. These are the slides for a presentation at the Mathematics Association of America Spring 2015 conference at Brigham Young University.

Clique Topology Reveals Intrinsic Geometric Structure In Neural Correlations, Chad Giusti, Eva Pastalkova, Carina Curto, Vladimir Itskov

Department of Mathematics: Faculty Publications

Detecting meaningful structure in neural activity and connectivity data is challenging in the presence of hidden nonlinearities, where traditional eigenvalue-based methods may be misleading. We introduce a novel approach to matrix analysis, called clique topology, that extracts features of the data invariant under nonlinear monotone transformations. These features can be used to detect both random and geometric structure, and depend only on the relative ordering of matrix entries. We then analyzed the activity of pyramidal neurons in rat hippocampus, recorded while the animal was exploring a 2D environment, and confirmed that our method is able to detect geometric organization using …

Analysis And Constructions Of Subspace Codes, Carolyn E. Troha

Theses and Dissertations--Mathematics

Random network coding is the most effcient way to send data across a network, but it is very susceptible to errors and erasures. In 2008, Kotter and Kschischang introduced subspace codes as an algebraic approach to error correcting in random network coding. Since this paper, there has been much work in constructing large subspace codes, as well as exploring the properties of such codes. This dissertation explores properties of one particular construction and introduces a new construction for subspace codes. We begin by exploring properties of irreducible cyclic orbit codes, which were introduced in 2011 by Rosenthal et al. As …

The Relationship Among Math Anxiety, Mathematical Performance, And Math Education In Undergraduate Nursing Students, Joshua D. Beall, Troy Roebuck, Paul Penkalsky

Williams Honors College, Honors Research Projects

Although nurses spend up to 40% of their day calculating and administering medication doses, undergraduate nursing students often perform poorly on nursing math exams. The purpose of this study was (a) to examine the relationship among mathematical education, performance, and anxiety and (b) to compare the mathematical education, performance, and anxiety in sophomore and senior baccalaureate nursing students at a public university in the Midwest. This cross-sectional, descriptive study was guided by Bandura's self-efficacy theory. Math performance was measured with an 11-item math instrument, math education was measured with number of math courses, and math anxiety was measured with Fennema–Sherman …

Graphs Of Classroom Networks, Rebecca Holliday

College of Graduate Studies: Theses & Dissertations

In this work, we use the Havel-Hakimi algorithm to visualize data collected from students to investigate classroom networks. The Havel-Hakimi algorithm uses a recursive method to create a simple graph from a graphical degree sequence. In this case, the degree sequence is a representation of the students in a classroom, and we use the number of peers with whom a student studied or collaborated to determine the degree of each. We expand upon the Havel-Hakimi algorithm by coding a program in MATLAB that generates random graphs with the same degree sequence. Then, we run another algorithm to find the isomorphism …

The Neural Ring: Using Algebraic Geometry To Analyze Neural Codes, Nora Youngs

Department of Mathematics: Dissertations, Theses, and Student Research

Neurons in the brain represent external stimuli via neural codes. These codes often arise from stimulus-response maps, associating to each neuron a convex receptive field. An important problem confronted by the brain is to infer properties of a represented stimulus space without knowledge of the receptive fields, using only the intrinsic structure of the neural code. How does the brain do this? To address this question, it is important to determine what stimulus space features can - in principle - be extracted from neural codes. This motivates us to define the neural ring and a related neural ideal, algebraic objects …