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 20 of 44 for “"Convex polytopes."”.
-
Diagrams and transforms applied to convex polytopes
… particularly as applied to problems concerning convex polytopes. An attempt is made to summarize new results (listed below) of M. Perles, G.C. Shephard and P. McMullen. A diagram technique is one of several methods for associating to a finite subset of a finite-dimensional Euclidean space a …
-
Convex polytopes of finite graphs and Ehrhart series
… H., Ehrhart Series of Fractional Stable Set Polytopes of Finite Graphs, Ann. Comb., published 2018, Springer International Publishing AG
-
Comparative Analysis of Geometric Random Walks for Sampling in High-Dimensional Convex Polytopes
… λογισμικού του χώρου (Volesti, PolytopeWalk, PolytopeSampler), με την υποστήριξη εξειδικευμένων εργαλείων προεπεξεργασίας (PolyRound, Dingo). Το πειραματικό πλαίσιο κλιμακώνεται συστηματικά: από θεμελιώδη θεωρητικά σχήματα (πυκνοί υπερκύβοι, simplex και πολύτοπα Birkhoff έως 10^4 διαστάσεων) …
-
Convex polytopes and duality in the geometry of the full Kostant-Toda lattice.
… and the information encoded in their momentum polytopes. The space in which the system evolves is a Poisson manifold which is essentially the dual of a Borel subalgebra of a Lie algebra, and the symplectic leaves are the coadjoint orbits. We extend the results of Ercolani, Flaschka, and Singer …
-
Geometric approximations in 2- and 3-dimensional space
… the study of this problem by considering convex surfaces only, for simplicity, before moving on to non convex surfaces. A first natural step to higher order approximation of convex polytopes is the approximation with spheres or spherical patches. In chapter 3 we can show that deciding the …
-
Connectivity Bounds and S-Partitions for Triangulated Manifolds
Two of the fundamental results in the theory of convex polytopes are Balinski’s Theorem on connectivity and Bruggesser and Mani’s theorem on shellability. Here we present results that attempt to generalize both results to triangulated manifolds. We obtain new connectivity bounds for complexes with …
-
Bounds for Symplectic Capacities of Rotated 4-Polytopes
… all normalized symplectic capacities coincide on convex domains. Even upper bounds for these capacities are not completely understood, and there are many hard computational barriers. The recent work of Chaidez and Hutchings as well as that of Haim-Kislev have yielded results simplifying …
-
Implicit representation of inscribed volumes
… are regular or irregular. We begin with a set of convex polytopes such as 3-D Voronoi diagram cells and compute inscribed volumes bounded by the cells. The cells can be irregular in shape, scale, and topology, and this irregularity transfers to the inscribed volumes, producing natural-looking …
-
An Adaptive Linearization Method for a Constraint Satisfaction Problem in Semiconductor Device Design Optimization
… the orthogonal projection of high-dimensional convex polytopes and propose an output sensitive algorithm for projecting polytopes into two dimensions.
-
High-dimensional polytopes defined by oracles: algorithms, computations and applications
… for problems concerning high-dimensional, convex polytopes, such as convex hull and volume computation and their applications to computational algebraic geometry and optimization. Second, the establishment of combinatorial characterization results for essential polytope families. Third, the …
-
Semi-Analytical and Numerical Approaches to Rigid Body Collision Probability
… test geometric collision between any arbitrary convex polytopes. Representing the rigid bodies as convex hulls, the equations of motion can be applied to the convex hull vertices to create a time-varying SAT collision check. With uncertain initial conditions given by known probability …
-
Local linearity of ReLU neural networks
… of network behavior. ReLU neural networks form convex polytopes in the input space with the network behaving as a simple linear mapping from input to output within each of these polytopes. By exploiting this structure, it is possible to examine locally linear behavior in aggregate to construct …
-
Ανάπτυξη στοχαστικών μοντέλων και ποσοτική ανάλυση στο σχεδιασμό ανθρώπινου δυναμικού
… of these sets and it is proved that they form convex polytopes. Moreover, by adopting the equivalent approach of describing convex polyhedral sets via inequalities, we specify the attainable sets of the model for every time point t. Next, we suggest the corresponding generalized semi Markov …
-
Kostant Convexity for split real and complex Kac-Moody Groups
… of this thesis is a generalization of Kostant’s Convexity Theorem to the class of (split, minimal) real or complex Kac-Moody groups. Originally, this notion refers to an important result in Lie theory that is related to the problem of describing the group multiplication in a semisimple Lie group …
-
Stabilization of Polytopes for Fully Actuated Euler-Lagrange Systems
Given an Euler-Lagrange system and a convex polytope in its output space, we design a switched feedback controller that drives the output to the polytope. On the polytope, the system output tracks assigned trajectories or follows assigned paths. The study of this problem is motivated by industrial …
-
Causal inference with instruments and other supplementary variables
… of (A,B,C). Using an approach based on convex polytopes, bounds are computed here in terms of the pairwise (A,B) and (A,C) distributions, in direct analogy to the classic use but without the linearity assumption. The bounding technique is also adapted to instrumental models with stronger …
-
Causal inference with instruments and other supplementary variables.
… of (A,B,C). Using an approach based on convex polytopes, bounds are computed here in terms of the pairwise (A,B) and (A,C) distributions, in direct analogy to the classic use but without the linearity assumption. The bounding technique is also adapted to instrumental models with stronger …
-
On Proximity Problems In Euclidean Spaces
… new positions. We develop representations of convex polytopes in any (constant) dimension that allow us to perform this intersection test in logarithmic time. In the second part of this work, we turn our attention to facility location problems. In this setting, we are given a set of sites in a …
Page 1 of 3