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 364 for “"Convex-hull"”.

  1. CONVEX HULL METHOD FOR SRV ESTIMATION

    … new method for modeling the SRV based on minimum convex hulls. This method was implemented and tested using data from the Dollie Thorell Well in the Barnett shale in North Texas. Results from those tests show that the convex hull method is robust at modeling scattered microseismic event sets of …

    houston Repository record for CONVEX HULL METHOD FOR SRV ESTIMATION (opens in a new tab)

  2. Uncertainty characterization in robust MPC using an approximate convex hull

    … this method is the computation of an approximate convex hull that approximately covers the system uncertainty in a new output prediction mapping. Given the complete uncertainty set, an approximate convex hull is computed to determine an efficient set of extreme points to represent this set. The …

    colo-mines Repository record for Uncertainty characterization in robust MPC using an approximate convex hull (opens in a new tab)

  3. Convex Hull Characterization of Special Polytopes in n-ary Variables

    This paper characterizes the convex hull of the set of n-ary vectors that are lexicographically less than or equal to a given such vector. A polynomial number of facets is shown to be sufficient to describe the convex hull. These facets generalize the family of cover inequalities for the binary …

    clemson Repository record for Convex Hull Characterization of Special Polytopes in n-ary Variables (opens in a new tab)

  4. Fault-tolerant consensus in directed graphs and convex hull consensus

    … • We propose a new consensus problem – convex hull consensus – in which the input is a vector of reals in the d-dimensional space, and the output is a convex polytope contained within the convex hull of all inputs at fault-free nodes. For asynchronous systems, we present an approximate …

    uiuc Repository record for Fault-tolerant consensus in directed graphs and convex hull consensus (opens in a new tab)

  5. A convex hull algorithm optimal for point sets in even dimensions

    Finding the convex hull of a finite set of points is important not only for practical applications but also for theoretical reasons: a number of geometrical problems, such as constructing Voronoi diagrams or intersecting hyperspheres, can be reduced to the convex hull problem, and a fast convex …

    ubc Repository record for A convex hull algorithm optimal for point sets in even dimensions (opens in a new tab) Download PDF for A convex hull algorithm optimal for point sets in even dimensions (opens in a new tab)

  6. Characterizing Image Classification Difficulties through Reduced-Dimension Class Convex Hull Analysis

    The ability to correctly recognize natural terrain is regarded as a critical actor in autonomous path planning success. Following recent promise shown by deep learning algorithms, much research has directed focus towards conveying these successes to visual terrain classification, however the …

    concordia Download PDF for Characterizing Image Classification Difficulties through Reduced-Dimension Class Convex Hull Analysis (opens in a new tab)

  7. Minimum Perimeter Convex Hull of a Set of Line Segments: An Approximation

    The problem of finding the convex hull of a set of points in the plane is one of the fundamental and well-studied problems in Computational Geometry. However, for a set of imprecise points, the convex hull problem has not been thoroughly investigated. By imprecise points, we refer to a region in …

    queens Repository record for Minimum Perimeter Convex Hull of a Set of Line Segments: An Approximation (opens in a new tab)

  8. The Convex Hull of the Highest Weight Orbit and the Carathéodory Orbitope

    … Lie group. We also study the connection of the convex hull of this orbit and the Carathéodory orbitope.

    ottawa-retro Repository record for The Convex Hull of the Highest Weight Orbit and the Carathéodory Orbitope (opens in a new tab)

  9. On topological semigroups with invariant means in the convex hull of multiplicative means

    … multiplicative means on LUC(S), and CoΔ(S) the convex hull of Δ(S). In this thesis we study and characterize topological semigroup S for which (*) LUC(S) has a LIM (left invariant mean) in CoΔ(S). A decomposition theorem for such semigroups has been obtained. We also consider properties that …

    ubc Repository record for On topological semigroups with invariant means in the convex hull of multiplicative means (opens in a new tab) Download PDF for On topological semigroups with invariant means in the convex hull of multiplicative means (opens in a new tab)

  10. Convex Hull Pricing in Energy Markets Minimizing Uplift Payments Accounting for Power Transmission Limits

    … energy costs. The cost curve is said to be convex. Due to the fact that generators have fixed costs like startup and shutdown cost and minimum MW output, when multiple generators are pooled together in a marketplace their aggregated energy costs are not convex. This imposes problems on …

    umn Repository record for Convex Hull Pricing in Energy Markets Minimizing Uplift Payments Accounting for Power Transmission Limits (opens in a new tab)

  11. Bounding the Convex Hull Relaxation of the Unit Commitment Problem with the Shapley-Folkman Theorem

    … bound on the size of fractional solutions of its convex hull relaxation. This result is used to obtain a bound on the optimality gap between the MILP and the convex hull relaxation, which is further tightened using several problem-specific properties of UC. We conduct extensive numerical …

    clemson Repository record for Bounding the Convex Hull Relaxation of the Unit Commitment Problem with the Shapley-Folkman Theorem (opens in a new tab)

  12. Finding convex deficiencies in linear time

    <p>A new algorithm for obtaining the convex deficiencies of an arbitrary 8-connected digital figure in linear time and space is presented. It is shown that the boundary of a digital figure is a closed polygonal curve that belongs to a family of ordered crossing polygons. This family of polygons is …

    ut-knoxville Repository record for Finding convex deficiencies in linear time (opens in a new tab)

  13. Convex Hulls, Relaxations, and Approximations of General Monomials and Multilinear Functions

    … error-analyses: • The derivation of the convex hull representations of large families of symmetric multilinear polynomials (SMPs) that are defined over box constraints through geometrical exploitation of the polytope symmetry and specially designed facet generation method; and • The …

    clemson Repository record for Convex Hulls, Relaxations, and Approximations of General Monomials and Multilinear Functions (opens in a new tab)

  14. Tight Representations of Specially-Structured 0-1 Linear, Quadratic, and Polynomial Programs

    … For the third effort, we provide an explicit convex hull representation for special forms of monomials of binary variables that arise in 0-1 polynomial programs; this convex hull form generalizes a classical linearization result. Relative to the first effort, the TVP is a hybrid between the …

    clemson Repository record for Tight Representations of Specially-Structured 0-1 Linear, Quadratic, and Polynomial Programs (opens in a new tab)

  15. Output-sensitive construction of convex hulls

    The construction of the convex hull of a finite point set in a low-dimensional Euclidean space is a fundamental problem in computational geometry. This thesis investigates efficient algorithms for the convex hull problem, where complexity is measured as a function of both the size of the input …

    ubc Repository record for Output-sensitive construction of convex hulls (opens in a new tab) Download PDF for Output-sensitive construction of convex hulls (opens in a new tab)

  16. A Weak Groethendieck Compactness Principle for Infinite Dimensional Banach Spaces

    … weakly compact set is contained in the closed convex hull of a weakly null sequence. This result complements an old result of Grothendieck (now called the Grothendieck Compactness Principle) stating that every norm compact subset of a Banach space is contained in the closed convex hull of a …

    vcu Repository record for A Weak Groethendieck Compactness Principle for Infinite Dimensional Banach Spaces (opens in a new tab)

  17. Polyhedral and tropical geometry in nonlinear algebra

    … the interaction between tropical and classical convexity, with a focus on the tropical convex hull of convex sets and polyhedral complexes. We describe the tropical convex hull of a line segment and a ray. We show that tropical and ordinary convex hull commute in two dimensions, and we …

    gatech Repository record for Polyhedral and tropical geometry in nonlinear algebra (opens in a new tab)

  18. Algorithms and hardness results for geometric problems on stochastic datasets

    … second set of problems deals with the stochastic convex hull, i.e., the convex hull of a stochastic dataset. This includes computing the expected measures of a stochastic convex hull, such as the expected diameter, width, and combinatorial complexity. The third set of problems considers the …

    umn Repository record for Algorithms and hardness results for geometric problems on stochastic datasets (opens in a new tab)

  19. Sign Matrix Polytopes

    Motivated by the study of polytopes formed as the convex hull of permutation matrices and alternating sign matrices, several new families of polytopes are defined as convex hulls of sign matrices, which are certain {0,1,-1}--matrices in bijection with semistandard Young tableaux. This bijection is …

    ndsu Repository record for Sign Matrix Polytopes (opens in a new tab)

Page 1 of 19