Open Access. Powered by Scholars. Published by Universities.®
Discrete Mathematics and Combinatorics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Selected Works (12)
- University of New Mexico (4)
- Claremont Colleges (2)
- Air Force Institute of Technology (1)
- Brigham Young University (1)
-
- California Polytechnic State University, San Luis Obispo (1)
- City University of New York (CUNY) (1)
- Georgia Southern University (1)
- Rose-Hulman Institute of Technology (1)
- The University of Akron (1)
- University of Massachusetts Amherst (1)
- University of Pennsylvania Carey Law School (1)
- University of Tennessee, Knoxville (1)
- Western Kentucky University (1)
- Keyword
-
- Integrated optimization methods - Books (3)
- Integrated optimization methods - Papers (3)
- Optimization and decision diagrams (2)
- 00A69 - general applied mathematics (1)
- 05C21 (1)
-
- 05C81 - random walks on graphs (1)
- 1-Nested Networks (1)
- 2-Nested Networks (1)
- 90C31 - sensitivity and stability (1)
- 90C35 (1)
- 94C15 (1)
- Algorithms (1)
- Applications of graph theory (1)
- Babai point (1)
- CFD (1)
- Climate change (1)
- Communication Efficiency (1)
- Control (1)
- Control theory (1)
- Coverings (1)
- Cross-cultural issues (1)
- Cryptography (1)
- Data Structure (1)
- Data storage (1)
- Discrete Mittag- Leffler function (1)
- Distributed Decoding (1)
- Eigenvalues and eigenfunctions (1)
- Electrical grid (1)
- Elimination of Forever Chemicals (1)
- Ethics and philosophy (1)
- Publication Year
- Publication
-
- John Hooker (11)
- Branch Mathematics and Statistics Faculty and Staff Publications (3)
- Doctoral Dissertations (2)
- HMC Senior Theses (2)
- All Faculty Scholarship (1)
-
- Computer Science and Software Engineering (1)
- Journal of Nonprofit Innovation (1)
- Masters Theses & Specialist Projects (1)
- Mathematical Sciences Technical Reports (MSTR) (1)
- Mechanical Engineering ETDs (1)
- Namrata Vaswani (1)
- Publications and Research (1)
- Theory and Applications of Graphs (1)
- Theses and Dissertations (1)
- Williams Honors College, Honors Research Projects (1)
- Publication Type
- File Type
Articles 1 - 29 of 29
Full-Text Articles in Discrete Mathematics and Combinatorics
Reducing Food Scarcity: The Benefits Of Urban Farming, S.A. Claudell, Emilio Mejia
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 …
The Sensitivity Of A Laplacian Family Of Ranking Methods, Claire S. Chang
The Sensitivity Of A Laplacian Family Of Ranking Methods, Claire S. Chang
HMC Senior Theses
Ranking from pairwise comparisons is a particularly rich subset of ranking problems. In this work, we focus on a family of ranking methods for pairwise comparisons which encompasses the well-known Massey, Colley, and Markov methods. We will accomplish two objectives to deepen our understanding of this family. First, we will consider its network diffusion interpretation. Second, we will analyze its sensitivity by studying the "maximal upset" where the direction of an arc between the highest and lowest ranked alternatives is flipped. Through these analyses, we will build intuition to answer the question "What are the characteristics of robust ranking methods?" …
Moving Polygon Methods For Incompressible Fluid Dynamics, Chris Chartrand
Moving Polygon Methods For Incompressible Fluid Dynamics, Chris Chartrand
Doctoral Dissertations
Hybrid particle-mesh numerical approaches are proposed to solve incompressible fluid flows. The methods discussed in this work consist of a collection of particles each wrapped in their own polygon mesh cell, which then move through the domain as the flow evolves. Variables such as pressure, velocity, mass, and momentum are located either on the mesh or on the particles themselves, depending on the specific algorithm described, and each will be shown to have its own advantages and disadvantages. This work explores what is required to obtain local conservation of mass, momentum, and convergence for the velocity and pressure in a …
On Communication For Distributed Babai Point Computation, Maiara F. Bollauf, Vinay A. Vaishampayan, Sueli I.R. Costa
On Communication For Distributed Babai Point Computation, Maiara F. Bollauf, Vinay A. Vaishampayan, Sueli I.R. Costa
Publications and Research
We present a communication-efficient distributed protocol for computing the Babai point, an approximate nearest point for a random vector X∈Rn in a given lattice. We show that the protocol is optimal in the sense that it minimizes the sum rate when the components of X are mutually independent. We then investigate the error probability, i.e. the probability that the Babai point does not coincide with the nearest lattice point, motivated by the fact that for some cases, a distributed algorithm for finding the Babai point is sufficient for finding the nearest lattice point itself. Two different probability models for X …
An Enumeration Of Nested Networks, Nathan Cornelius
An Enumeration Of Nested Networks, Nathan Cornelius
Williams Honors College, Honors Research Projects
Nested networks have several applications in phylogenetics and electrical circuit theory. In many cases, there may exist more than one distinct network which correctly models a given data set. This proposes a combinatorial problem to determine all possible network solutions. In this paper, we partially solve this problem by developing exponential generating functions which enumerate all 1-nested and 2-nested unicyclic networks. We also describe our procedure to directly count all 1-nested and 2-nested networks and provide all 1-nested networks with 7, 8, and 9 terminal nodes.
Target Control Of Networked Systems, Isaac S. Klickstein
Target Control Of Networked Systems, Isaac S. Klickstein
Mechanical Engineering ETDs
The control of complex networks is an emerging field yet it has already garnered interest from across the scientific disciplines, from robotics to sociology. It has quickly been noticed that many of the classical techniques from controls engineering, while applicable, are not as illuminating as they were for single systems of relatively small dimension. Instead, properties borrowed from graph theory provide equivalent but more practical conditions to guarantee controllability, reachability, observability, and other typical properties of interest to the controls engineer when dealing with large networked systems. This manuscript covers three topics investigated in detail by the author: (i) the …
Controllability And Observability Of The Discrete Fractional Linear State-Space Model, Duc M. Nguyen
Controllability And Observability Of The Discrete Fractional Linear State-Space Model, Duc M. Nguyen
Masters Theses & Specialist Projects
This thesis aims to investigate the controllability and observability of the discrete fractional linear time-invariant state-space model. First, we will establish key concepts and properties which are the tools necessary for our task. In the third chapter, we will discuss the discrete state-space model and set up the criteria for these two properties. Then, in the fourth chapter, we will attempt to apply these criteria to the discrete fractional model. The general flow of our objectives is as follows: we start with the first-order linear difference equation, move on to the discrete system, then the fractional difference equation, and finally …
Policy-Preferred Paths In As-Level Internet Topology Graphs, Mehmet Engin Tozal
Policy-Preferred Paths In As-Level Internet Topology Graphs, Mehmet Engin Tozal
Theory and Applications of Graphs
Using Autonomous System (AS) level Internet topology maps to determine accurate AS-level paths is essential for network diagnostics, performance optimization, security enforcement, business policy management and topology-aware application development. One significant drawback that we have observed in many studies is simplifying the AS-level topology map of the Internet to an undirected graph, and then using the hop distance as a means to find the shortest paths between the ASes. A less significant drawback is restricting the shortest paths to only valley-free paths. Both approaches usually inflate the number of paths between ASes; introduce erroneous paths that do not conform to …
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 …
Ns-K-Nn: Neutrosophic Set-Based K-Nearest Neighbors Classifier, Florentin Smarandache, Yaman Akbulut, Abdulkadir Sengur, Yanhui Guo
Ns-K-Nn: Neutrosophic Set-Based K-Nearest Neighbors Classifier, Florentin Smarandache, Yaman Akbulut, Abdulkadir Sengur, Yanhui Guo
Branch Mathematics and Statistics Faculty and Staff Publications
k-nearest neighbors (k-NN), which is known to be a simple and efficient approach, is a non-parametric supervised classifier. It aims to determine the class label of an unknown sample by its k-nearest neighbors that are stored in a training set. The k-nearest neighbors are determined based on some distance functions. Although k-NN produces successful results, there have been some extensions for improving its precision. The neutrosophic set (NS) defines three memberships namely T, I and F. T, I, and F shows the truth membership degree, the false membership degree, and the indeterminacy membership degree, respectively. In this paper, the NS …
Recursive Robust Pca Or Recursive Sparse Recovery In Large But Structured Noise, Chenlu Qiu, Namrata Vaswani, Brian Lois, Leslie Hogben
Recursive Robust Pca Or Recursive Sparse Recovery In Large But Structured Noise, Chenlu Qiu, Namrata Vaswani, Brian Lois, Leslie Hogben
Namrata Vaswani
This paper studies the recursive robust principal components analysis problem. If the outlier is the signal-of-interest, this problem can be interpreted as one of recursively recovering a time sequence of sparse vectors, St, in the presence of large but structured noise, Lt. The structure that we assume on Lt is that Lt is dense and lies in a low-dimensional subspace that is either fixed or changes slowly enough. A key application where this problem occurs is in video surveillance where the goal is to separate a slowly changing background (Lt) from moving foreground objects (St) on-the-fly. To solve the above …
Generalized Interval Valued Neutrosophic Graphs Of First Type, Florentin Smarandache, Said Broumi, Mohamed Talea, Assia Bakali, Ali Hassan
Generalized Interval Valued Neutrosophic Graphs Of First Type, Florentin Smarandache, Said Broumi, Mohamed Talea, Assia Bakali, Ali Hassan
Branch Mathematics and Statistics Faculty and Staff Publications
In this paper, motivated by the notion of generalized single valued neutrosophic graphs of first type, we defined a new neutrosophic graphs named generalized interval valued neutrosophic graphs of first type (GIVNG1) and presented a matrix representation for it and studied few properties of this new concept. The concept of GIVNG1 is an extension of generalized fuzzy graphs (GFG1) and generalized single valued neutrosophic of first type (GSVNG1).
Impacts Of Climate Change On The Evolution Of The Electrical Grid, Melissa Ree Allen
Impacts Of Climate Change On The Evolution Of The Electrical Grid, Melissa Ree Allen
Doctoral Dissertations
Maintaining interdependent infrastructures exposed to a changing climate requires understanding 1) the local impact on power assets; 2) how the infrastructure will evolve as the demand for infrastructure changes location and volume and; 3) what vulnerabilities are introduced by these changing infrastructure topologies. This dissertation attempts to develop a methodology that will a) downscale the climate direct effect on the infrastructure; b) allow population to redistribute in response to increasing extreme events that will increase under climate impacts; and c) project new distributions of electricity demand in the mid-21st century.
The research was structured in three parts. The first …
Distance In Matrices And Their Applications To Fuzzy Models And Neutrosophic Models, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral
Distance In Matrices And Their Applications To Fuzzy Models And Neutrosophic Models, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral
Branch Mathematics and Statistics Faculty and Staff Publications
In this book authors for the first time introduce the notion of distance between any two m n matrices. If the distance is 0 or m n there is nothing interesting. When the distance happens to be a value t; 0 < t < m n the study is both innovating and interesting. The three cases of study which is carried out in this book are 1. If the difference between two square matrices is large, will it imply the eigen values and eigen vectors of those matrices are distinct? Several open conjectures in this direction are given. 2. The difference between parity check matrix and the generator matrix for the same C(n, k) code is studied. This will help in detecting errors in storage systems as well as in cryptography.
Characterizing Forced Communication In Networks, Samuel C. Gutekunst
Characterizing Forced Communication In Networks, Samuel C. Gutekunst
HMC Senior Theses
This thesis studies a problem that has been proposed as a novel way to disrupt communication networks: the load maximization problem. The load on a member of a network represents the amount of communication that the member is forced to be involved in. By maximizing the load on an important member of the network, we hope to increase that member's visibility and susceptibility to capture. In this thesis we characterize load as a combinatorial property of graphs and expose possible connections between load and spectral graph theory. We specifically describe the load and how it changes in several canonical classes …
Decision Diagrams And Dynamic Programming, John Hooker
Decision Diagrams And Dynamic Programming, John Hooker
John Hooker
No abstract provided.
Mixed Integer Programming Vs Logic-Based Benders Decomposition For Planning And Scheduling, John Hooker, Andre Cire
Mixed Integer Programming Vs Logic-Based Benders Decomposition For Planning And Scheduling, John Hooker, Andre Cire
John Hooker
No abstract provided.
Integrated Methods For Optimization, 2nd Ed, John Hooker
Integrated Methods For Optimization, 2nd Ed, John Hooker
John Hooker
No abstract provided.
Toward Unification Of Exact And Heuristic Optimization Methods, John Hooker
Toward Unification Of Exact And Heuristic Optimization Methods, John Hooker
John Hooker
No abstract provided.
Business Ethics As Rational Choice, John Hooker
On The Regulation Of Networks As Complex Systems: A Graph Theory Approach, Daniel F. Spulber, Christopher S. Yoo
On The Regulation Of Networks As Complex Systems: A Graph Theory Approach, Daniel F. Spulber, Christopher S. Yoo
All Faculty Scholarship
The dominant approach to regulating communications networks treats each network component as if it existed in isolation. In so doing, the current approach fails to capture one of the essential characteristics of networks, which is the complex manner in which components interact with one another when combined into an integrated system. In this Essay, Professors Daniel Spulber and Christopher Yoo propose a new regulatory framework based on the discipline of mathematics known as graph theory, which better captures the extent to which networks represent complex systems. They then apply the insights provided by this framework to a number of current …
Constraint Programming, John Hooker
Working Across Cultures, John Hooker
Logic, Optimization And Constraint Programming, John Hooker
Logic, Optimization And Constraint Programming, John Hooker
John Hooker
No abstract provided.
A Group Theoretic Tabu Search Approach To The Traveling Salesman Problem, Shane N. Hall
A Group Theoretic Tabu Search Approach To The Traveling Salesman Problem, Shane N. Hall
Theses and Dissertations
The traveling salesman problem (TSP) is a combinatorial optimization problem that is mathematically modeled as a binary integer program. The TSP is a very important problem for the operations research academician and practitioner. This research demonstrates a Group Theoretic Tabu Search (GTTS) Java algorithm for the TSP. The tabu search metaheuristic continuously finds near-optimal solutions to the TSP under various different implementations. Algebraic group theory offers a more formal mathematical setting to study the TSP providing a theoretical foundation for describing tabu search. Specifically, this thesis uses the Symmetric Group on n letters, S(n), which is the set of all …
Logic-Based Methods For Optimization: Combining Optimization And Constraint Satisfaction, John Hooker
Logic-Based Methods For Optimization: Combining Optimization And Constraint Satisfaction, John Hooker
John Hooker
No abstract provided.
Optimization Methods For Logical Inference, Vijay Chandru, John Hooker
Optimization Methods For Logical Inference, Vijay Chandru, John Hooker
John Hooker
No abstract provided.
Maximally Disjoint Solutions Of The Set Covering Problem, David J. Rader, Peter L. Hammer
Maximally Disjoint Solutions Of The Set Covering Problem, David J. Rader, Peter L. Hammer
Mathematical Sciences Technical Reports (MSTR)
This paper is concerned with finding two solutions of a set covering problem that have a minimum number of variables in common. We show that this problem is NP complete, even in the case where we are only interested in completely disjoint solutions. We describe three heuristic methods based on the standard greedy algorithm for set covering problems. Two of these algorithms find the solutions sequentially, while the third finds them simultaneously. A local search method for reducing the overlap of the two given solutions is then described. This method involves the solution of a reduced set covering problem. Finally, …
Constraint Satisfaction Methods For Generating Valid Cuts, John Hooker
Constraint Satisfaction Methods For Generating Valid Cuts, John Hooker
John Hooker
No abstract provided.