Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 19 of 19 for “"Combinatorial framework"”.
-
A Combinatorial Framework for Multiple RNA Interaction Prediction
… We formulate multiple RNA interaction as a combinatorial optimization problem. This problem is NP-hard, so we focus on three aspects in our thesis: 1) Design and analyze approximation algorithms for solving the optimization version, 2) Develop enumeration and sampling algorithms to generate …
-
C algebraic Higher Signatures on Non-Witt Spaces
… to hold Poincare duality. Followed by the combinatorial framework developed by Higson and Roe, this dissertation construct the C ∗ -signature on non Witt space with noncommutative geometric methods. In conical singular case, we compare analytical signature of smooth stratified non Witt …
-
Arithmetic Dynamics and Higher Direct Images
… a product of projective spaces. We provide a new combinatorial framework for computing sheaf cohomology using cell complexes. Our method for computing higher direct images makes use of this construction. The algorithm developed is implemented explicitly in the mathematical software Macaulay2.
-
Multishot Capacity of Adversarial Networks
… In 2018, Ravagnani and Kschischang established a combinatorial framework for adversarial networks. The study was recently furthered by Beemer, Kilic and Ravagnani, with particular focus on the one-shot capacity: a measure of the maximum number of symbols that can be transmitted in a single use of …
-
Morphisms, Minors, and Minimal Obstructions to Convexity of Neural Codes
… and closed convex codes from a geometric and combinatorial point of view. We prove constructive geometric results that establish new upper bounds on the open and closed embedding dimensions of intersection complete codes. We introduce a combinatorial framework of morphisms and minors for the …
-
Floer-theoretic and combinatorial approaches to knots
… Using bordered Floer homology, we introduce a combinatorial framework for studying stabilization phenomena under a non-zero linking condition. This yields general stabilization results for extremal knot Floer homology groups, the τ-invariant, and the total dimension of knot Floer homology. …
-
Functional Quantitative Genetics and the Missing Heritability Problem
… Bayesian Learning/Relevance Vector Machine framework. Additionally, we describe a combinatorial framework for decomposing nonlinear genetic effects due to dominance and epistasis, and a method for adjusting the Genomic Relationship Matrix for linkage disequilibrium by SNP selection and …
-
Graph-Theoretic Techniques for Optimizing NISQ Algorithms
… presented in this thesis, which focuses on combinatorial techniques for optimizing NISQ algorithms. With variational algorithms directing the discussion, we investigate methods for reducing Hamiltonians, reducing measurement errors, and reducing entangling gates. All three of these …
-
Combinatorics of Transition Matrices of Symmetric and Polysymmetric Functions
… matrices between bases of $sym$ encode combinatorial and representation-theoretic information. The study of transition matrices of {symmetric functions} is an active research program with a long illustrious history stretching back to work of Newton and Girard. In this thesis, we …
-
Reliable and spectrally efficient encoding and modulation techniques
… In this respect, index modulation (IM) and its combinatorial encoding structure have gained considerable popularity thanks to their attractive advantages, including low-complexity implementation, better error performance, and improved energy/spectral efficiency over conventional modulation and …
-
Overcoming Computational Complexity Barriers for Optimal Transport in Discrete and Semi-Discrete Settings
… and the squared-Euclidean distance. 2. Combinatorial algorithm for semi-discrete OT: We propose a combinatorial framework for the semi-discrete OT, which can be viewed as an extension of the combinatorial framework for the discrete OT but requires several new ideas. We present a new …
-
Steenrod’s Realization Problem and Stanley-Reisner Rings
… Following this, we develop the algebraic and combinatorial framework of simplicial complexes and multicomplexes, extending the classical definition of Stanley—Reisner rings to the broader setting of generalized Stanley—Reisner rings. We examine the results of Trevisan (2011) who introduced the …
-
Computational discrete Morse theory
I propose a purely combinatorial framework that allows to extract the extremal structure of scalar and vector fields defined on discrete manifolds. The extremal structure of a scalar field consists of critical points and separatrices - certain tangential curves of the gradient field that connect …
-
Structural Properties of Reciprocal Generalized Cluster Algebras
… in 2002 in order to provide a concrete combinatorial framework for studying dual canonical bases and total positivity in semisimple groups. Ordinary cluster algebras have since found applications in a wide array of areas, including: the representation theory of quivers, algebraic …
-
A Multi-Agent System and Auction Mechanism for Production Planning over Multiple Facilities in an Advanced Planning and Scheduling System
… system and negotiation protocol based on combinatorial auction framework to solve the given multi-facility planning problem. The output of this research is a software library, which can be used as a multi-agent system model of the multi-product, multi-facility capacity allocation problem. …
-
Associative n-categories
<p>We define novel fully combinatorial models of higher categories. Our definitions are based on a connection of higher categories to "directed spaces". Directed spaces will be locally modelled on manifold diagrams, which are stratifications of the n-cube such that strata are transversal to the …
-
Finiteness Properties And Piecewise Projective Homeomorphisms
… Thurston's work to a, b, c , and use this as a combinatorial framework to show the following: Theorem. The group a, b, c is finitely presented with 3 generators and 9 relations. We also obtain a natural infinite presentation, a normal form, and an algorithm for converting a given word to a word …
-
COMBINATORIAL OPTIMIZATION APPROACHES TO DISCRETE PROBLEMS
… essential in solving many real-world problems. Combinatorial optimization focuses on problems arising from discrete structures such as graphs and polyhedra. This thesis deals with extremal graphs and strings and focuses on two problems: the Erdos' problem on multiplicities of complete subgraphs …
-
3D Image segmentation for modelling the patient-specific anatomy of congenital heart disease
… segmentation to the multiclass setting. Within a combinatorial framework sensitive to the topology of both individual and combined multi-class labels, these expose the differences between a predicted segmentation and a prior specification of topology according to abstract Betti numbers. We …