Open Access. Powered by Scholars. Published by Universities.®
Discrete Mathematics and Combinatorics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Graph theory (2)
- Algorithm (1)
- Applied math (1)
- Binary (1)
- Bioinformatics (1)
-
- Bounds (1)
- CFD (1)
- Combinatorial Optimization (1)
- Combinatorics (1)
- Conjecture (1)
- Conjugacy (1)
- Cosine similarity based clustering (1)
- Data Structure (1)
- Decision diagram (1)
- Digits (1)
- Disease (1)
- Fiedler vector (1)
- Ford-Fulkerson (1)
- Genetic Algorithms (1)
- Graph (1)
- Group theory (1)
- Hirsch (1)
- Integer factorization (1)
- Laplacian matrix (1)
- Machine learning (1)
- Marching Cube (1)
- Mathematical modeling (1)
- Mirna regulatory network (1)
- Mirna-diseases (1)
- Network flow (1)
Articles 1 - 8 of 8
Full-Text Articles in Discrete Mathematics and Combinatorics
Optimal Layout For A Component Grid, Michael W. Ebert
Optimal Layout For A Component Grid, Michael W. Ebert
Computer Science and Software Engineering
Several puzzle games include a specific type of optimization problem: given components that produce and consume different resources and a grid of squares, find the optimal way to place the components to maximize output. I developed a method to evaluate potential solutions quickly and automated the solving of the problem using a genetic algorithm.
A High Quality, Eulerian 3d Fluid Solver In C++, Lejon Anthony Mcgowan
A High Quality, Eulerian 3d Fluid Solver In C++, Lejon Anthony Mcgowan
Computer Science and Software Engineering
Fluids are a part of everyday life, yet are one of the hardest elements to properly render in computer graphics. Water is the most obvious entity when thinking of what a fluid simulation can achieve (and it is indeed the focus of this project), but many other aspects of nature, like fog, clouds, and particle effects. Real-time graphics like video games employ many heuristics to approximate these effects, but large-scale renderers aim to simulate these effects as closely as possible.
In this project, I wish to achieve effects of the latter nature. Using the Eulerian technique of discrete grids, I …
Efficiently Representing The Integer Factorization Problem Using Binary Decision Diagrams, David Skidmore
Efficiently Representing The Integer Factorization Problem Using Binary Decision Diagrams, David Skidmore
All Graduate Plan B and other Reports, Spring 1920 to Spring 2023
Let p be a prime positive integer and let α be a positive integer greater than 1. A method is given to reduce the problem of finding a nontrivial factorization of α to the problem of finding a solution to a system of modulo p polynomial congruences where each variable in the system is constrained to the set {0,...,p − 1}. In the case that p = 2 it is shown that each polynomial in the system can be represented by an ordered binary decision diagram with size less than 20.25log2(α)3 + 16.5log2(α)2 + …
Vertex Weighted Spectral Clustering, Mohammad Masum
Vertex Weighted Spectral Clustering, Mohammad Masum
Electronic Theses and Dissertations
Spectral clustering is often used to partition a data set into a specified number of clusters. Both the unweighted and the vertex-weighted approaches use eigenvectors of the Laplacian matrix of a graph. Our focus is on using vertex-weighted methods to refine clustering of observations. An eigenvector corresponding with the second smallest eigenvalue of the Laplacian matrix of a graph is called a Fiedler vector. Coefficients of a Fiedler vector are used to partition vertices of a given graph into two clusters. A vertex of a graph is classified as unassociated if the Fiedler coefficient of the vertex is close to …
Solving Algorithmic Problems In Finitely Presented Groups Via Machine Learning, Jonathan Gryak
Solving Algorithmic Problems In Finitely Presented Groups Via Machine Learning, Jonathan Gryak
Dissertations, Theses, and Capstone Projects
Machine learning and pattern recognition techniques have been successfully applied to algorithmic problems in free groups. In this dissertation, we seek to extend these techniques to finitely presented non-free groups, in particular to polycyclic and metabelian groups that are of interest to non-commutative cryptography.
As a prototypical example, we utilize supervised learning methods to construct classifiers that can solve the conjugacy decision problem, i.e., determine whether or not a pair of elements from a specified group are conjugate. The accuracies of classifiers created using decision trees, random forests, and N-tuple neural network models are evaluated for several non-free groups. …
Network Modeling Of Infectious Disease: Transmission, Control And Prevention, Christina M. Chandler
Network Modeling Of Infectious Disease: Transmission, Control And Prevention, Christina M. Chandler
Honors College Theses
Many factors come into play when it comes to the transmission of infectious diseases. In disease control and prevention, it is inevitable to consider the general population and the relationships between individuals as a whole, which calls for advanced mathematical modeling approaches.
We will use the concept of network flow and the modified Ford-Fulkerson algorithm to demonstrate the transmission of infectious diseases over a given period of time. Through our model one can observe what possible measures should be taken or improved upon in the case of an epidemic. We identify key nodes and edges in the resulted network, which …
Combinatorial Polynomial Hirsch Conjecture, Sam Miller
Combinatorial Polynomial Hirsch Conjecture, Sam Miller
HMC Senior Theses
The Hirsch Conjecture states that for a d-dimensional polytope with n facets, the diameter of the graph of the polytope is at most n-d. This conjecture was disproven in 2010 by Francisco Santos Leal. However, a polynomial bound in n and d on the diameter of a polytope may still exist. Finding a polynomial bound would provide a worst-case scenario runtime for the Simplex Method of Linear Programming. However working only with polytopes in higher dimensions can prove challenging, so other approaches are welcome. There are many equivalent formulations of the Hirsch Conjecture, one of which is the …
Network Analytics For The Mirna Regulome And Mirna-Disease Interactions, Joseph Jayakar Nalluri
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 …