#### Sample records for minimum convex polygon

1. Convex Lattice Polygons

Science.gov (United States)

Scott, Paul

2006-01-01

A "convex" polygon is one with no re-entrant angles. Alternatively one can use the standard convexity definition, asserting that for any two points of the convex polygon, the line segment joining them is contained completely within the polygon. In this article, the author provides a solution to a problem involving convex lattice polygons.

2. Two-convex polygons

OpenAIRE

Aichholzer, Oswin; Aurenhammer, Franz; Hurtado Díaz, Fernando Alfredo; Ramos, Pedro A.; Urrutia, J.

2009-01-01

We introduce a notion of k-convexity and explore some properties of polygons that have this property. In particular, 2-convex polygons can be recognized in O(n log n) time, and k-convex polygons can be triangulated in O(kn) time.

3. Exact generating function for 2-convex polygons

International Nuclear Information System (INIS)

James, W R G; Jensen, I; Guttmann, A J

2008-01-01

Polygons are described as almost-convex if their perimeter differs from the perimeter of their minimum bounding rectangle by twice their 'concavity index', m. Such polygons are called m-convex polygons and are characterized by having up to m indentations in their perimeter. We first describe how we conjectured the (isotropic) generating function for the case m = 2 using a numerical procedure based on series expansions. We then proceed to prove this result for the more general case of the full anisotropic generating function, in which steps in the x and y directions are distinguished. In doing so, we develop tools that would allow for the case m > 2 to be studied

4. Two generalizations of column-convex polygons

International Nuclear Information System (INIS)

Feretic, Svjetlan; Guttmann, Anthony J

2009-01-01

Column-convex polygons were first counted by area several decades ago, and the result was found to be a simple, rational, generating function. In this work we generalize that result. Let a p-column polyomino be a polyomino whose columns can have 1, 2, ..., p connected components. Then column-convex polygons are equivalent to 1-convex polyominoes. The area generating function of even the simplest generalization, namely 2-column polyominoes, is unlikely to be solvable. We therefore define two classes of polyominoes which interpolate between column-convex polygons and 2-column polyominoes. We derive the area generating functions of those two classes, using extensions of existing algorithms. The growth constants of both classes are greater than the growth constant of column-convex polyominoes. Rather tight lower bounds on the growth constants complement a comprehensive asymptotic analysis.

5. Probing convex polygons with X-rays

International Nuclear Information System (INIS)

Edelsbrunner, H.; Skiena, S.S.

1988-01-01

An X-ray probe through a polygon measures the length of intersection between a line and the polygon. This paper considers the properties of various classes of X-ray probes, and shows how they interact to give finite strategies for completely describing convex n-gons. It is shown that (3n/2)+6 probes are sufficient to verify a specified n-gon, while for determining convex polygons (3n-1)/2 X-ray probes are necessary and 5n+O(1) sufficient, with 3n+O(1) sufficient given that a lower bound on the size of the smallest edge of P is known

6. A new convexity measure for polygons.

Science.gov (United States)

Zunic, Jovisa; Rosin, Paul L

2004-07-01

Abstract-Convexity estimators are commonly used in the analysis of shape. In this paper, we define and evaluate a new convexity measure for planar regions bounded by polygons. The new convexity measure can be understood as a "boundary-based" measure and in accordance with this it is more sensitive to measured boundary defects than the so called "area-based" convexity measures. When compared with the convexity measure defined as the ratio between the Euclidean perimeter of the convex hull of the measured shape and the Euclidean perimeter of the measured shape then the new convexity measure also shows some advantages-particularly for shapes with holes. The new convexity measure has the following desirable properties: 1) the estimated convexity is always a number from (0, 1], 2) the estimated convexity is 1 if and only if the measured shape is convex, 3) there are shapes whose estimated convexity is arbitrarily close to 0, 4) the new convexity measure is invariant under similarity transformations, and 5) there is a simple and fast procedure for computing the new convexity measure.

7. Counting convex polygons in planar point sets

NARCIS (Netherlands)

Mitchell, J.S.B.; Rote, G.; Sundaram, Gopalakrishnan; Woeginger, G.J.

1995-01-01

Given a set S of n points in the plane, we compute in time O(n3) the total number of convex polygons whose vertices are a subset of S. We give an O(m · n3) algorithm for computing the number of convex k-gons with vertices in S, for all values k = 3,…, m; previously known bounds were exponential

8. Interpolation Error Estimates for Mean Value Coordinates over Convex Polygons.

Science.gov (United States)

Rand, Alexander; Gillette, Andrew; Bajaj, Chandrajit

2013-08-01

In a similar fashion to estimates shown for Harmonic, Wachspress, and Sibson coordinates in [Gillette et al., AiCM, to appear], we prove interpolation error estimates for the mean value coordinates on convex polygons suitable for standard finite element analysis. Our analysis is based on providing a uniform bound on the gradient of the mean value functions for all convex polygons of diameter one satisfying certain simple geometric restrictions. This work makes rigorous an observed practical advantage of the mean value coordinates: unlike Wachspress coordinates, the gradient of the mean value coordinates does not become large as interior angles of the polygon approach π.

9. Non-convex polygons clustering algorithm

Directory of Open Access Journals (Sweden)

Kruglikov Alexey

2016-01-01

Full Text Available A clustering algorithm is proposed, to be used as a preliminary step in motion planning. It is tightly coupled to the applied problem statement, i.e. uses parameters meaningful only with respect to it. Use of geometrical properties for polygons clustering allows for a better calculation time as opposed to general-purpose algorithms. A special form of map optimized for quick motion planning is constructed as a result.

10. Decompositions, partitions, and coverings with convex polygons and pseudo-triangles

NARCIS (Netherlands)

Aichholzer, O.; Huemer, C.; Kappes, S.; Speckmann, B.; Tóth, Cs.D.

2007-01-01

We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangles. This pseudo-convex decomposition is significantly sparser than either convex decompositions or pseudo-triangulations for planar point sets and simple polygons. We also introduce pseudo-convex

11. Sequential and Parallel Algorithms for Finding a Maximum Convex Polygon

DEFF Research Database (Denmark)

Fischer, Paul

1997-01-01

This paper investigates the problem where one is given a finite set of n points in the plane each of which is labeled either ?positive? or ?negative?. We consider bounded convex polygons, the vertices of which are positive points and which do not contain any negative point. It is shown how...... such a polygon which is maximal with respect to area can be found in time O(n³ log n). With the same running time one can also find such a polygon which contains a maximum number of positive points. If, in addition, the number of vertices of the polygon is restricted to be at most M, then the running time...... becomes O(M n³ log n). It is also shown how to find a maximum convex polygon which contains a given point in time O(n³ log n). Two parallel algorithms for the basic problem are also presented. The first one runs in time O(n log n) using O(n²) processors, the second one has polylogarithmic time but needs O...

12. Computing nonsimple polygons of minimum perimeter

NARCIS (Netherlands)

Fekete, S.P.; Haas, A.; Hemmer, M.; Hoffmann, M.; Kostitsyna, I.; Krupke, D.; Maurer, F.; Mitchell, J.S.B.; Schmidt, A.; Schmidt, C.; Troegel, J.

2018-01-01

We consider the Minimum Perimeter Polygon Problem (MP3): for a given set V of points in the plane, find a polygon P with holes that has vertex set V , such that the total boundary length is smallest possible. The MP3 can be considered a natural geometric generalization of the Traveling Salesman

13. Reachability by paths of bounded curvature in a convex polygon

KAUST Repository

Ahn, Heekap; Cheong, Otfried; Matoušek, Jiřǐ; Vigneron, Antoine E.

2012-01-01

Let B be a point robot moving in the plane, whose path is constrained to forward motions with curvature at most 1, and let P be a convex polygon with n vertices. Given a starting configuration (a location and a direction of travel) for B inside P, we characterize the region of all points of P that can be reached by B, and show that it has complexity O(n). We give an O(n2) time algorithm to compute this region. We show that a point is reachable only if it can be reached by a path of type CCSCS, where C denotes a unit circle arc and S denotes a line segment. © 2011 Elsevier B.V.

14. Convex lattice polygons of fixed area with perimeter-dependent weights.

Science.gov (United States)

Rajesh, R; Dhar, Deepak

2005-01-01

We study fully convex polygons with a given area, and variable perimeter length on square and hexagonal lattices. We attach a weight tm to a convex polygon of perimeter m and show that the sum of weights of all polygons with a fixed area s varies as s(-theta(conv))eK(t)square root(s) for large s and t less than a critical threshold tc, where K(t) is a t-dependent constant, and theta(conv) is a critical exponent which does not change with t. Using heuristic arguments, we find that theta(conv) is 1/4 for the square lattice, but -1/4 for the hexagonal lattice. The reason for this unexpected nonuniversality of theta(conv) is traced to existence of sharp corners in the asymptotic shape of these polygons.

15. linear time algorithm for finding the convex ropes between two vertices of a simple polygon without triangulation

International Nuclear Information System (INIS)

Phan Thanh An

2008-06-01

The convex rope problem, posed by Peshkin and Sanderson in IEEE J. Robotics Automat, 2 (1986) pp. 53-58, is to find the counterclockwise and clockwise convex ropes starting at the vertex a and ending at the vertex b of a simple polygon, where a is on the boundary of the convex hull of the polygon and b is visible from infinity. In this paper, we present a linear time algorithm for solving this problem without resorting to a linear-time triangulation algorithm and without resorting to a convex hull algorithm for the polygon. The counterclockwise (clockwise, respectively) convex rope consists of two polylines obtained in a basic incremental strategy described in convex hull algorithms for the polylines forming the polygon from a to b. (author)

16. Perimeter generating functions for the mean-squared radius of gyration of convex polygons

International Nuclear Information System (INIS)

Jensen, Iwan

2005-01-01

We have derived long series expansions for the perimeter generating functions of the radius of gyration of various polygons with a convexity constraint. Using the series we numerically find simple (algebraic) exact solutions for the generating functions. In all cases the size exponent ν 1. (letter to the editor)

17. On the areas of various bodies in the Euclidean space: The case of irregular convex polygons

International Nuclear Information System (INIS)

Ozoemena, P.C.

1988-11-01

A theorem is proposed for the areas of n-sided irregular convex polygons, of given length of sides. The theorem is illustrated as a simple but powerful one in estimating the areas of irregular polygons, being dependent only on the number of sides n (and not on any of the explicit angles) of the irregular polygon. Finally, because of the global symmetry shown by equilateral triangles, squares and circles under group (gauge) theory, the relationships governing their areas, when they are inscribed or escribed in one another are discussed as riders, and some areas of their applications in graph theory, ratios and maxima and minima problems of differential calculus briefly mentioned. (author). 11 refs, 6 figs, 1 tab

18. Geometry of convex polygons and locally minimal binary trees spanning these polygons

International Nuclear Information System (INIS)

Ivanov, A O; Tuzhilin, A A

1999-01-01

In previous works the authors have obtained an effective classification of planar locally minimal binary trees with convex boundaries. The main aim of the present paper is to find more subtle restrictions on the possible structure of such trees in terms of the geometry of the given boundary set. Special attention is given to the case of quasiregular boundaries (that is, boundaries that are sufficiently close to regular ones in a certain sense). In particular, a series of quasiregular boundaries that cannot be spanned by a locally minimal binary tree is constructed

19. Iterating the Number of Intersection Points of the Diagonals of Irregular Convex Polygons, or C (n, 4) the Hard Way!

Science.gov (United States)

Hathout, Leith

2007-01-01

Counting the number of internal intersection points made by the diagonals of irregular convex polygons where no three diagonals are concurrent is an interesting problem in discrete mathematics. This paper uses an iterative approach to develop a summation relation which tallies the total number of intersections, and shows that this total can be…

20. Symmetric caging formation for convex polygonal object transportation by multiple mobile robots based on fuzzy sliding mode control.

Science.gov (United States)

Dai, Yanyan; Kim, YoonGu; Wee, SungGil; Lee, DongHa; Lee, SukGyu

2016-01-01

In this paper, the problem of object caging and transporting is considered for multiple mobile robots. With the consideration of minimizing the number of robots and decreasing the rotation of the object, the proper points are calculated and assigned to the multiple mobile robots to allow them to form a symmetric caging formation. The caging formation guarantees that all of the Euclidean distances between any two adjacent robots are smaller than the minimal width of the polygonal object so that the object cannot escape. In order to avoid collision among robots, the parameter of the robots radius is utilized to design the caging formation, and the A⁎ algorithm is used so that mobile robots can move to the proper points. In order to avoid obstacles, the robots and the object are regarded as a rigid body to apply artificial potential field method. The fuzzy sliding mode control method is applied for tracking control of the nonholonomic mobile robots. Finally, the simulation and experimental results show that multiple mobile robots are able to cage and transport the polygonal object to the goal position, avoiding obstacles. Copyright © 2015 ISA. Published by Elsevier Ltd. All rights reserved.

1. Convex analysis

CERN Document Server

Rockafellar, Ralph Tyrell

2015-01-01

Available for the first time in paperback, R. Tyrrell Rockafellar's classic study presents readers with a coherent branch of nonlinear mathematical analysis that is especially suited to the study of optimization problems. Rockafellar's theory differs from classical analysis in that differentiability assumptions are replaced by convexity assumptions. The topics treated in this volume include: systems of inequalities, the minimum or maximum of a convex function over a convex set, Lagrange multipliers, minimax theorems and duality, as well as basic results about the structure of convex sets and

2. Affine invariants of convex polygons.

Science.gov (United States)

Flusser, Jan

2002-01-01

In this correspondence, we prove that the affine invariants, for image registration and object recognition, proposed recently by Yang and Cohen (see ibid., vol.8, no.7, p.934-46, July 1999) are algebraically dependent. We show how to select an independent and complete set of the invariants. The use of this new set leads to a significant reduction of the computing complexity without decreasing the discrimination power.

3. Complexity of inheritance of $\\mathcal{F}$-convexity for restricted games induced by minimum partitions

OpenAIRE

Skoda, Alexandre

2016-01-01

Let $G = (N,E,w)$ be a weighted communication graph (with weight function $w$ on $E$). For every subset $A \\subseteq N$, we delete in the subset $E(A)$ of edges with ends in $A$, all edges of minimum weight in $E(A)$. Then the connected components of the corresponding induced subgraph constitute a partition of $A$ that we call $P_{\\min}(A)$. For every game $(N, v)$, we define the $P_{\\min}$-restricted game $(N, \\bar{v})$ by $\\bar{v}(A) = \\sum_{F \\in P_{\\min}(A)} v(F)$ for all $A \\subseteq N$....

4. Metric inequalities for polygons

Directory of Open Access Journals (Sweden)

2013-07-01

Full Text Available Let A1,A2,…,An be the vertices of a polygon with unit perimeter, that is Σi |Ai Ai+1|=1. We derive various tight estimates on the minimum and maximum values of the sum of pairwise distances, and respectively sum of pairwise squared distances among its vertices. In most cases such estimates on these sums in the literature were known only for convex polygons.In the second part, we turn to a problem of Braß  regarding the maximum perimeter of a simplen-gon (n odd contained in a disk of unit radius. The problem was recently solved by Audet et al. 2009, who gave an exact formula. Here we present an alternative simpler proof of this formula. We then examine what happens if the simplicity condition is dropped, and obtain an exact formula for the maximum perimeter in this case as well.

DEFF Research Database (Denmark)

M. Gaspar, Raquel; Murgoci, Agatha

2010-01-01

A convexity adjustment (or convexity correction) in fixed income markets arises when one uses prices of standard (plain vanilla) products plus an adjustment to price nonstandard products. We explain the basic and appealing idea behind the use of convexity adjustments and focus on the situations...

DEFF Research Database (Denmark)

Lauritzen, Niels

-Motzkin elimination, the theory is developed by introducing polyhedra, the double description method and the simplex algorithm, closed convex subsets, convex functions of one and several variables ending with a chapter on convex optimization with the Karush-Kuhn-Tucker conditions, duality and an interior point......Based on undergraduate teaching to students in computer science, economics and mathematics at Aarhus University, this is an elementary introduction to convex sets and convex functions with emphasis on concrete computations and examples. Starting from linear inequalities and Fourier...

DEFF Research Database (Denmark)

Lauritzen, Niels

Based on undergraduate teaching to students in computer science, economics and mathematics at Aarhus University, this is an elementary introduction to convex sets and convex functions with emphasis on concrete computations and examples. Starting from linear inequalities and Fourier-Motzkin elimin......Based on undergraduate teaching to students in computer science, economics and mathematics at Aarhus University, this is an elementary introduction to convex sets and convex functions with emphasis on concrete computations and examples. Starting from linear inequalities and Fourier......-Motzkin elimination, the theory is developed by introducing polyhedra, the double description method and the simplex algorithm, closed convex subsets, convex functions of one and several variables ending with a chapter on convex optimization with the Karush-Kuhn-Tucker conditions, duality and an interior point...... algorithm....

DEFF Research Database (Denmark)

Lauritzen, Niels

Based on undergraduate teaching to students in computer science, economics and mathematics at Aarhus University, this is an elementary introduction to convex sets and convex functions with emphasis on concrete computations and examples. Starting from linear inequalities and Fourier-Motzkin elimin...

9. Approximation algorithms for guarding holey polygons ...

African Journals Online (AJOL)

Guarding edges of polygons is a version of art gallery problem.The goal is finding the minimum number of guards to cover the edges of a polygon. This problem is NP-hard, and to our knowledge there are approximation algorithms just for simple polygons. In this paper we present two approximation algorithms for guarding ...

10. Convex surfaces

CERN Document Server

Busemann, Herbert

2008-01-01

This exploration of convex surfaces focuses on extrinsic geometry and applications of the Brunn-Minkowski theory. It also examines intrinsic geometry and the realization of intrinsic metrics. 1958 edition.

11. Does a point lie inside a polygon

International Nuclear Information System (INIS)

Milgram, M.S.

1988-01-01

A superficially simple problem in computational geometry is that of determining whether a query point P lies in the interior of a polygon if it lies in the polygon's plane. Answering this question is often required when tracking particles in a Monte Carlo program; it is asked frequently and an efficient algorithm is crucial. Littlefield has recently rediscovered Shimrat's algorithm, while in separate works, Wooff, Preparata and Shamos and Mehlhorn, as well as Yamaguchi, give other algorithms. A practical algorithm answering this question when the polygon's plane is skewed in space is not immediately evident from most of these methods. Additionally, all but one fails when two sides extend to infinity (open polygons). In this paper the author review the above methods and present a new, efficient algorithm, valid for all convex polygons, open or closed, and topologically connected in n-dimensional space (n ≥ 2)

12. Frosty Polygons

Science.gov (United States)

2004-01-01

16 January 2004 Looking somewhat like a roadmap, this 3 km (1.9 mi) wide view of a cratered plain in the martian south polar region shows a plethora of cracks that form polygonal patterns. This Mars Global Surveyor (MGS) Mars Orbiter Camera (MOC) image is located near 78.9oS, 357.3oW. Polygons such as these, where they are found on Earth, would be indicators of the presence of subsurface ice. Whether the same is true for Mars is uncertain. What is certain is that modern, seasonal frost on the surface enhances the appearance of the polygons as the frost persists longer in the cracks than on adjacent plains. This southern springtime image is illuminated by sunlight from the upper left.

13. Polar Polygons

Science.gov (United States)

2005-01-01

18 August 2005 This Mars Global Surveyor (MGS) Mars Orbiter Camera (MOC) image shows dark-outlined polygons on a frost-covered surface in the south polar region of Mars. In summer, this surface would not be bright and the polygons would not have dark outlines--these are a product of the presence of seasonal frost. Location near: 77.2oS, 204.8oW Image width: width: 3 km (1.9 mi) Illumination from: upper left Season: Southern Spring

14. Fair partitions of polygons: An elementary introduction

In this paper we discuss only convex polygonal regions with finite number of sides. But we think this property holds ... trivial interest and have updated [9] into the present paper. 2. Proof of the conjecture N = .... surface have a proper intersection if they cut through each other either at a point or after being coincident in a finite ...

15. Generalized polygons

CERN Document Server

Maldeghem, Hendrik

1998-01-01

This book is intended to be an introduction to the fascinating theory ofgeneralized polygons for both the graduate student and the specialized researcher in the field. It gathers together a lot of basic properties (some of which are usually referred to in research papers as belonging to folklore) and very recent and sometimes deep results. I have chosen a fairly strict geometrical approach, which requires some knowledge of basic projective geometry. Yet, it enables one to prove some typically group-theoretical results such as the determination of the automorphism groups of certain Moufang polygons. As such, some basic group-theoretical knowledge is required of the reader. The notion of a generalized polygon is a relatively recent one. But it is one of the most important concepts in incidence geometry. Generalized polygons are the building bricks of Tits buildings. They are the prototypes and precursors of more general geometries such as partial geometries, partial quadrangles, semi-partial ge­ ometries, near...

16. Generalized polygons

CERN Document Server

Van Maldeghem, Hendrik

1998-01-01

Generalized Polygons is the first book to cover, in a coherent manner, the theory of polygons from scratch. In particular, it fills elementary gaps in the literature and gives an up-to-date account of current research in this area, including most proofs, which are often unified and streamlined in comparison to the versions generally known. Generalized Polygons will be welcomed both by the student seeking an introduction to the subject as well as the researcher who will value the work as a reference. In particular, it will be of great value for specialists working in the field of generalized polygons (which are, incidentally, the rank 2 Tits-buildings) or in fields directly related to Tits-buildings, incidence geometry and finite geometry. The approach taken in the book is of geometric nature, but algebraic results are included and proven (in a geometric way!). A noteworthy feature is that the book unifies and generalizes notions, definitions and results that exist for quadrangles, hexagons, octagons - in the ...

17. Convex polytopes

CERN Document Server

Klee, Victor; Ziegler, Günter

2003-01-01

"The appearance of Grünbaum's book Convex Polytopes in 1967 was a moment of grace to geometers and combinatorialists. The special spirit of the book is very much alive even in those chapters where the book's immense influence made them quickly obsolete. Some other chapters promise beautiful unexplored land for future research. The appearance of the new edition is going to be another moment of grace. Kaibel, Klee and Ziegler were able to update the convex polytope saga in a clear, accurate, lively, and inspired way." (Gil Kalai, The Hebrew University of Jerusalem) "The original book of Grünbaum has provided the central reference for work in this active area of mathematics for the past 35 years...I first consulted this book as a graduate student in 1967; yet, even today, I am surprised again and again by what I find there. It is an amazingly complete reference for work on this subject up to that time and continues to be a major influence on research to this day." (Louis J. Billera, Cornell University) "The or...

18. The Polygon

International Nuclear Information System (INIS)

2000-01-01

In Russian, ''The Polygon'' stands for a nuclear test site of 19.000 square kilometers in Kazakhstan, used by the former Soviet Union for hundreds of nuclear tests from 1947 to 1991. This film looks at the legacy of what was once a top secret area, now abandoned, but still sparsely populated, and at the work to be done to detect and map the areas of elevated radiation levels

19. Fat polygonal partitions with applications to visualization and embeddings

Directory of Open Access Journals (Sweden)

Mark de Berg

2013-12-01

Full Text Available Let T be a rooted and weighted tree, where the weight of any node is equal to the sum of the weights of its children. The popular Treemap algorithm visualizes such a tree as a hierarchical partition of a square into rectangles, where the area of the rectangle corresponding to any node in T is equal to the weight of that node. The aspect ratio of the rectangles in such a rectangular partition necessarily depends on the weights and can become arbitrarily high.We introduce a new hierarchical partition scheme, called a polygonal partition, which uses convex polygons rather than just rectangles. We present two methods for constructing polygonal partitions, both having guarantees on the worst-case aspect ratio of the constructed polygons; in particular, both methods guarantee a bound on the aspect ratio that is independent of the weights of the nodes.We also consider rectangular partitions with slack, where the areas of the rectangles may differ slightly from the weights of the corresponding nodes. We show that this makes it possible to obtain partitions with constant aspect ratio. This result generalizes to hyper-rectangular partitions in ℝd. We use these partitions with slack for embedding ultrametrics into d-dimensional Euclidean space:  we give a polylog(Δ-approximation algorithm for embedding n-point ultrametrics into ℝd with minimum distortion, where Δ denotes the spread of the metric. The previously best-known approximation ratio for this problem was polynomial in n. This is the first algorithm for embedding a non-trivial family of weighted-graph metrics into a space of constant dimension that achieves polylogarithmic approximation ratio.

20. Characterizing Convexity of Games using Marginal Vectors

NARCIS (Netherlands)

van Velzen, S.; Hamers, H.J.M.; Norde, H.W.

2003-01-01

In this paper we study the relation between convexity of TU games and marginal vectors.We show that if specfic marginal vectors are core elements, then the game is convex.We characterize sets of marginal vectors satisfying this property, and we derive the formula for the minimum number of marginal

NARCIS (Netherlands)

den Hertog, D.; de Klerk, E.; Roos, J.

2000-01-01

In this paper we prove the counterintuitive result that the quadratic least squares approximation of a multivariate convex function in a finite set of points is not necessarily convex, even though it is convex for a univariate convex function. This result has many consequences both for the field of

2. of polygons

KAUST Repository

Lu, Yanyan; Lien, Jyh-Ming; Ghosh, Mukulika; Amato, Nancy M.

2012-01-01

Decomposing a shape into visually meaningful parts comes naturally to humans, but recreating this fundamental operation in computers has been shown to be difficult. Similar challenges have puzzled researchers in shape reconstruction for decades. In this paper, we recognize the strong connection between shape reconstruction and shape decomposition at a fundamental level and propose a method called α-decomposition. The α-decomposition generates a space of decompositions parameterized by α, the diameter of a circle convolved with the input polygon. As we vary the value of α, some structural features appear and disappear quickly while others persist. Therefore, by analyzing the persistence of the features, we can determine better decompositions that are more robust to both geometrical and topological noises. © 2012 Elsevier Ltd. All rights reserved.

3. of polygons

KAUST Repository

Lu, Yanyan

2012-08-01

Decomposing a shape into visually meaningful parts comes naturally to humans, but recreating this fundamental operation in computers has been shown to be difficult. Similar challenges have puzzled researchers in shape reconstruction for decades. In this paper, we recognize the strong connection between shape reconstruction and shape decomposition at a fundamental level and propose a method called α-decomposition. The α-decomposition generates a space of decompositions parameterized by α, the diameter of a circle convolved with the input polygon. As we vary the value of α, some structural features appear and disappear quickly while others persist. Therefore, by analyzing the persistence of the features, we can determine better decompositions that are more robust to both geometrical and topological noises. © 2012 Elsevier Ltd. All rights reserved.

4. Polygons and Their Circles

Science.gov (United States)

Stephenson, Paul

2009-01-01

In order to find its circumference, Archimedes famously boxed the circle between two polygons. Ending the first of a series of articles (MT179) with an aside, Francis Lopez-Real reverses the situation to ask: Which polygons can be boxed between two circles? (The official term for such polygons is "bicentric".) The sides of these polygons are…

5. QUADRATIC SERENDIPITY FINITE ELEMENTS ON POLYGONS USING GENERALIZED BARYCENTRIC COORDINATES.

Science.gov (United States)

Rand, Alexander; Gillette, Andrew; Bajaj, Chandrajit

2014-01-01

We introduce a finite element construction for use on the class of convex, planar polygons and show it obtains a quadratic error convergence estimate. On a convex n -gon, our construction produces 2 n basis functions, associated in a Lagrange-like fashion to each vertex and each edge midpoint, by transforming and combining a set of n ( n + 1)/2 basis functions known to obtain quadratic convergence. The technique broadens the scope of the so-called 'serendipity' elements, previously studied only for quadrilateral and regular hexahedral meshes, by employing the theory of generalized barycentric coordinates. Uniform a priori error estimates are established over the class of convex quadrilaterals with bounded aspect ratio as well as over the class of convex planar polygons satisfying additional shape regularity conditions to exclude large interior angles and short edges. Numerical evidence is provided on a trapezoidal quadrilateral mesh, previously not amenable to serendipity constructions, and applications to adaptive meshing are discussed.

6. Floating polygon soup

OpenAIRE

Colleu , Thomas; Morin , Luce; Pateux , Stéphane; Labit , Claude

2011-01-01

International audience; This paper presents a new representation called floating polygon soup for applications like 3DTV and FTV (Free Viewpoint Television). This representation is based on 3D polygons and takes as input MVD data. It extends the previously proposed polygon soup representation which is appropriate for both compression, transmission and rendering stages. The floating polygon soup conserves these advantages while also taking into account misalignments at the view synthesis stage...

7. Area of Lattice Polygons

Science.gov (United States)

Scott, Paul

2006-01-01

A lattice is a (rectangular) grid of points, usually pictured as occurring at the intersections of two orthogonal sets of parallel, equally spaced lines. Polygons that have lattice points as vertices are called lattice polygons. It is clear that lattice polygons come in various shapes and sizes. A very small lattice triangle may cover just 3…

8. Recent characterizations of generalized convexity in convexity in cooperative game thoery

Energy Technology Data Exchange (ETDEWEB)

Driessen, T.

1994-12-31

The notion of convexity for a real-valued function on the power set of the finite set N (the so-called cooperative game with player set N) is defined as in other mathematical fields. The study of convexity plays an important role within the field of cooperative game theory because the application of the solution part of game theory to convex games provides elegant results for the solution concepts involved. Especially, the well known solution concept called core is, for convex games, very well characterized. The current paper focuses on a notion of generalized convexity, called k- convexity, for cooperative n-person games. Due to very recent characterizations of convexity for cooperative games, the goal is to provide similar new characterizations of k-convexity. The main characterization states that for the k-convexity of an n-person game it is both necessary and sufficient that half of all the so-called marginal worth vectors belong to the core of the game. Here it is taken into account whether a marginal worth vector corresponds to an even or odd ordering of k elements of the n-person player set N. Another characterization of k-convexity is presented in terms of a so-called finite min-modular decomposition. That is, some specific cover game of a k-convex game can be decomposed as the minimum of a finite number of modular (or additive) games. Finally it is established that the k-convexity of a game can be characterized in terms of the second order partial derivates of the so-called multilinear extension of the game.

9. Ergodicity of polygonal slap maps

International Nuclear Information System (INIS)

Del Magno, Gianluigi; Pedro Gaivão, José; Lopes Dias, João; Duarte, Pedro

2014-01-01

Polygonal slap maps are piecewise affine expanding maps of the interval obtained by projecting the sides of a polygon along their normals onto the perimeter of the polygon. These maps arise in the study of polygonal billiards with non-specular reflection laws. We study the absolutely continuous invariant probabilities (acips) of the slap maps for several polygons, including regular polygons and triangles. We also present a general method for constructing polygons with slap maps with more than one ergodic acip. (paper)

10. Analytic aspects of convexity

CERN Document Server

Colesanti, Andrea; Gronchi, Paolo

2018-01-01

This book presents the proceedings of the international conference Analytic Aspects in Convexity, which was held in Rome in October 2016. It offers a collection of selected articles, written by some of the world’s leading experts in the field of Convex Geometry, on recent developments in this area: theory of valuations; geometric inequalities; affine geometry; and curvature measures. The book will be of interest to a broad readership, from those involved in Convex Geometry, to those focusing on Functional Analysis, Harmonic Analysis, Differential Geometry, or PDEs. The book is a addressed to PhD students and researchers, interested in Convex Geometry and its links to analysis.

11. Theory of convex structures

CERN Document Server

van de Vel, MLJ

1993-01-01

Presented in this monograph is the current state-of-the-art in the theory of convex structures. The notion of convexity covered here is considerably broader than the classic one; specifically, it is not restricted to the context of vector spaces. Classical concepts of order-convex sets (Birkhoff) and of geodesically convex sets (Menger) are directly inspired by intuition; they go back to the first half of this century. An axiomatic approach started to develop in the early Fifties. The author became attracted to it in the mid-Seventies, resulting in the present volume, in which graphs appear si

12. Bypassing the Limits of Ll Regularization: Convex Sparse Signal Processing Using Non-Convex Regularization

Science.gov (United States)

Parekh, Ankit

Sparsity has become the basis of some important signal processing methods over the last ten years. Many signal processing problems (e.g., denoising, deconvolution, non-linear component analysis) can be expressed as inverse problems. Sparsity is invoked through the formulation of an inverse problem with suitably designed regularization terms. The regularization terms alone encode sparsity into the problem formulation. Often, the ℓ1 norm is used to induce sparsity, so much so that ℓ1 regularization is considered to be `modern least-squares'. The use of ℓ1 norm, as a sparsity-inducing regularizer, leads to a convex optimization problem, which has several benefits: the absence of extraneous local minima, well developed theory of globally convergent algorithms, even for large-scale problems. Convex regularization via the ℓ1 norm, however, tends to under-estimate the non-zero values of sparse signals. In order to estimate the non-zero values more accurately, non-convex regularization is often favored over convex regularization. However, non-convex regularization generally leads to non-convex optimization, which suffers from numerous issues: convergence may be guaranteed to only a stationary point, problem specific parameters may be difficult to set, and the solution is sensitive to the initialization of the algorithm. The first part of this thesis is aimed toward combining the benefits of non-convex regularization and convex optimization to estimate sparse signals more effectively. To this end, we propose to use parameterized non-convex regularizers with designated non-convexity and provide a range for the non-convex parameter so as to ensure that the objective function is strictly convex. By ensuring convexity of the objective function (sum of data-fidelity and non-convex regularizer), we can make use of a wide variety of convex optimization algorithms to obtain the unique global minimum reliably. The second part of this thesis proposes a non-linear signal

13. Strongly Normal Sets of Convex Polygons or Polyhedra

National Research Council Canada - National Science Library

Saha, Punam

1997-01-01

...,...,Pn, if each Pi intersects P and I = P1 n...n Pn is nonempty, then I intersects P. The union of the Pi epsilon P that intersect P epsilon P is called the neighborhood of P in P and is denoted by Np(P...

14. Knotting in stretched polygons

International Nuclear Information System (INIS)

Rensburg, E J Janse van; Orlandini, E; Tesi, M C; Whittington, S G

2008-01-01

The knotting in a lattice polygon model of ring polymers is examined when a stretching force is applied to the polygon. By examining the incidence of cut-planes in the polygon, we prove a pattern theorem in the stretching regime for large applied forces. This theorem can be used to examine the incidence of entanglements such as knotting and writhing. In particular, we prove that for arbitrarily large positive, but finite, values of the stretching force, the probability that a stretched polygon is knotted approaches 1 as the length of the polygon increases. In the case of writhing, we prove that for stretched polygons of length n, and for every function f(n)=o(√n), the probability that the absolute value of the mean writhe is less than f(n) approaches 0 as n → ∞, for sufficiently large values of the applied stretching force

15. Convexity and Marginal Vectors

NARCIS (Netherlands)

van Velzen, S.; Hamers, H.J.M.; Norde, H.W.

2002-01-01

In this paper we construct sets of marginal vectors of a TU game with the property that if the marginal vectors from these sets are core elements, then the game is convex.This approach leads to new upperbounds on the number of marginal vectors needed to characterize convexity.An other result is that

16. Convex Interval Games

NARCIS (Netherlands)

Alparslan-Gok, S.Z.; Brânzei, R.; Tijs, S.H.

2008-01-01

In this paper, convex interval games are introduced and some characterizations are given. Some economic situations leading to convex interval games are discussed. The Weber set and the Shapley value are defined for a suitable class of interval games and their relations with the interval core for

17. Atmospheres of polygons and knotted polygons

International Nuclear Information System (INIS)

Janse Rensburg, E J Janse; Rechnitzer, A

2008-01-01

In this paper we define two statistics a + (ω) and a - (ω), the positive and negative atmospheres of a lattice polygon ω of fixed length n. These statistics have the property that (a + (ω))/(a - (ω)) = p n+2 /p n , where p n is the number of polygons of length n, counted modulo translations. We use the pivot algorithm to sample polygons and to compute the corresponding average atmospheres. Using these data, we directly estimate the growth constants of polygons in two and three dimensions. We find that μ=2.63805±0.00012 in two dimensions and μ=4.683980±0.000042±0.000067 in three dimensions, where the error bars are 67% confidence intervals, and the second error bar in the three-dimensional estimate of μ is an estimated systematic error. We also compute atmospheres of polygons of fixed knot type K sampled by the BFACF algorithm. We discuss the implications of our results and show that different knot types have atmospheres which behave dramatically differently at small values of n

18. Homotopic Polygonal Line Simplification

DEFF Research Database (Denmark)

Deleuran, Lasse Kosetski

This thesis presents three contributions to the area of polygonal line simplification, or simply line simplification. A polygonal path, or simply a path is a list of points with line segments between the points. A path can be simplified by morphing it in order to minimize some objective function...

19. Dynamic Planar Convex Hull

DEFF Research Database (Denmark)

Jacob, Riko

We determine the computational complexity of the dynamic convex hull problem in the planar case. We present a data structure that maintains a finite set of n points in the plane under insertion and deletion of points in amortized O(log n) time per operation. The space usage of the data structure...... is O(n). The data structure supports extreme point queries in a given direction, tangent queries through a given point, and queries for the neighboring points on the convex hull in O(log n) time. The extreme point queries can be used to decide whether or not a given line intersects the convex hull......, and the tangent queries to determine whether a given point is inside the convex hull. The space usage of the data structure is O(n). We give a lower bound on the amortized asymptotic time complexity that matches the performance of this data structure....

20. Stereotype locally convex spaces

International Nuclear Information System (INIS)

Akbarov, S S

2000-01-01

We give complete proofs of some previously announced results in the theory of stereotype (that is, reflexive in the sense of Pontryagin duality) locally convex spaces. These spaces have important applications in topological algebra and functional analysis

1. Stereotype locally convex spaces

Energy Technology Data Exchange (ETDEWEB)

Akbarov, S S

2000-08-31

We give complete proofs of some previously announced results in the theory of stereotype (that is, reflexive in the sense of Pontryagin duality) locally convex spaces. These spaces have important applications in topological algebra and functional analysis.

2. Stereotype locally convex spaces

Science.gov (United States)

Akbarov, S. S.

2000-08-01

We give complete proofs of some previously announced results in the theory of stereotype (that is, reflexive in the sense of Pontryagin duality) locally convex spaces. These spaces have important applications in topological algebra and functional analysis.

3. Generalized Convexity and Inequalities

OpenAIRE

Anderson, G. D.; Vamanamurthy, M. K.; Vuorinen, M.

2007-01-01

Let R+ = (0,infinity) and let M be the family of all mean values of two numbers in R+ (some examples are the arithmetic, geometric, and harmonic means). Given m1, m2 in M, we say that a function f : R+ to R+ is (m1,m2)-convex if f(m1(x,y)) < or = m2(f(x),f(y)) for all x, y in R+ . The usual convexity is the special case when both mean values are arithmetic means. We study the dependence of (m1,m2)-convexity on m1 and m2 and give sufficient conditions for (m1,m2)-convexity of functions defined...

4. Polygons on Crater Floor

Science.gov (United States)

2003-01-01

MGS MOC Release No. MOC2-357, 11 May 2003This Mars Global Surveyor (MGS) Mars Orbiter Camera (MOC) picture shows a pattern of polygons on the floor of a northern plains impact crater. These landforms are common on crater floors at high latitudes on Mars. Similar polygons occur in the arctic and antarctic regions of Earth, where they indicate the presence and freeze-thaw cycling of ground ice. Whether the polygons on Mars also indicate water ice in the ground is uncertain. The image is located in a crater at 64.8oN, 292.7oW. Sunlight illuminates the scene from the lower left.

5. Dynamic Planar Convex Hull

DEFF Research Database (Denmark)

Brodal, Gerth Stølfting; Jacob, Rico

2002-01-01

In this paper we determine the computational complexity of the dynamic convex hull problem in the planar case. We present a data structure that maintains a finite set of n points in the plane under insertion and deletion of points in amortized O(log n) time per operation. The space usage of the d......In this paper we determine the computational complexity of the dynamic convex hull problem in the planar case. We present a data structure that maintains a finite set of n points in the plane under insertion and deletion of points in amortized O(log n) time per operation. The space usage...... of the data structure is O(n). The data structure supports extreme point queries in a given direction, tangent queries through a given point, and queries for the neighboring points on the convex hull in O(log n) time. The extreme point queries can be used to decide whether or not a given line intersects...... the convex hull, and the tangent queries to determine whether a given point is inside the convex hull. We give a lower bound on the amortized asymptotic time complexity that matches the performance of this data structure....

6. Polygons near Lyot Crater

Science.gov (United States)

2003-01-01

MGS MOC Release No. MOC2-564, 4 December 2003This Mars Global Surveyor (MGS) Mars Orbiter Camera (MOC) image shows patterned ground, arranged in the form of polygons, on the undulating plains associated with ejecta from the Lyot impact crater on the martian northern plains. This picture was acquired in October 2003 and shows that the polygon margins are ridges with large boulders--shown here as dark dots--on them. On Earth, polygon patterns like this are created in arctic and antarctic regions where there is ice in the ground. The seasonal and longer-term cycles of freezing and thawing of the ice-rich ground cause these features to form over time. Whether the same is true for Mars is unknown. The polygons are located near 54.6oN, 326.6oW. The image covers an area 3 km (1.9 mi) wide and is illuminated from the lower left.

7. High Latitude Polygons

Science.gov (United States)

2005-01-01

26 September 2005 This Mars Global Surveyor (MGS) Mars Orbiter Camera (MOC) image shows polygonal patterned ground on a south high-latitude plain. The outlines of the polygons, like the craters and hills in this region, are somewhat enhanced by the presence of bright frost left over from the previous winter. On Earth, polygons at high latitudes would usually be attributed to the seasonal freezing and thawing cycles of ground ice. The origin of similar polygons on Mars is less certain, but might also be an indicator of ground ice. Location near: 75.3oS, 113.2oW Image width: width: 3 km (1.9 mi) Illumination from: upper left Season: Southern Spring

8. Notions of convexity

CERN Document Server

Hörmander, Lars

1994-01-01

The first two chapters of this book are devoted to convexity in the classical sense, for functions of one and several real variables respectively. This gives a background for the study in the following chapters of related notions which occur in the theory of linear partial differential equations and complex analysis such as (pluri-)subharmonic functions, pseudoconvex sets, and sets which are convex for supports or singular supports with respect to a differential operator. In addition, the convexity conditions which are relevant for local or global existence of holomorphic differential equations are discussed, leading up to Trépreau’s theorem on sufficiency of condition (capital Greek letter Psi) for microlocal solvability in the analytic category. At the beginning of the book, no prerequisites are assumed beyond calculus and linear algebra. Later on, basic facts from distribution theory and functional analysis are needed. In a few places, a more extensive background in differential geometry or pseudodiffer...

9. On reconstruction of an unknown polygonal cavity in a linearized elasticity with one measurement

International Nuclear Information System (INIS)

Ikehata, M; Itou, H

2011-01-01

In this paper we consider a reconstruction problem of an unknown polygonal cavity in a linearized elastic body. For this problem, an extraction formula of the convex hull of the unknown polygonal cavity is established by means of the enclosure method introduced by Ikehata. The advantages of our method are that it needs only a single set of boundary data and we do not require any a priori assumptions for the unknown polygonal cavity and any constraints on boundary data. The theoretical formula may have possibility of application in nondestructive evaluation.

10. Some Aspects of Convexity

for all t E [0,1] and all x, y (in the domain of definition of f). ... Proof: (a) is a consequence of the definition. (b) Define conv(S) ... More generally, a set F is said to be a face of the convex .... and bounded, and assume the validity (for a proof, see.

11. FEMA DFIRM Panel Scheme Polygons

Data.gov (United States)

Minnesota Department of Natural Resources — This layer contains information about the Flood Insurance Rate Map (FIRM) panel areas. The spatial entities representing FIRM panels are polygons. The polygon for...

12. Near polygons and Fischer spaces

NARCIS (Netherlands)

Brouwer, A.E.; Cohen, A.M.; Hall, J.I.; Wilbrink, H.A.

1994-01-01

In this paper we exploit the relations between near polygons with lines of size 3 and Fischer spaces to classify near hexagons with quads and with lines of size three. We also construct some infinite families of near polygons.

13. Polygons and Craters

Science.gov (United States)

2005-01-01

3 September 2005 This Mars Global Surveyor (MGS) Mars Orbiter Camera (MOC) image shows polygons enhanced by subliming seasonal frost in the martian south polar region. Polygons similar to these occur in frozen ground at high latitudes on Earth, suggesting that perhaps their presence on Mars is also a sign that there is or once was ice in the shallow subsurface. The circular features are degraded meteor impact craters. Location near: 72.2oS, 310.3oW Image width: width: 3 km (1.9 mi) Illumination from: upper left Season: Southern Spring

14. Convex Optimization in R

Directory of Open Access Journals (Sweden)

Roger Koenker

2014-09-01

Full Text Available Convex optimization now plays an essential role in many facets of statistics. We briefly survey some recent developments and describe some implementations of these methods in R . Applications of linear and quadratic programming are introduced including quantile regression, the Huber M-estimator and various penalized regression methods. Applications to additively separable convex problems subject to linear equality and inequality constraints such as nonparametric density estimation and maximum likelihood estimation of general nonparametric mixture models are described, as are several cone programming problems. We focus throughout primarily on implementations in the R environment that rely on solution methods linked to R, like MOSEK by the package Rmosek. Code is provided in R to illustrate several of these problems. Other applications are available in the R package REBayes, dealing with empirical Bayes estimation of nonparametric mixture models.

15. On convex complexity measures

Czech Academy of Sciences Publication Activity Database

Hrubeš, P.; Jukna, S.; Kulikov, A.; Pudlák, Pavel

2010-01-01

Roč. 411, 16-18 (2010), s. 1842-1854 ISSN 0304-3975 R&D Projects: GA AV ČR IAA1019401 Institutional research plan: CEZ:AV0Z10190503 Keywords : boolean formula * complexity measure * combinatorial rectangle * convexity Subject RIV: BA - General Mathematics Impact factor: 0.838, year: 2010 http://www.sciencedirect.com/science/article/pii/S0304397510000885

16. Nanopatterning by molecular polygons.

Science.gov (United States)

Jester, Stefan-S; Sigmund, Eva; Höger, Sigurd

2011-07-27

Molecular polygons with three to six sides and binary mixtures thereof form long-range ordered patterns at the TCB/HOPG interface. This includes also the 2D crystallization of pentagons. The results provide an insight into how the symmetry of molecules is translated into periodic structures.

17. Ares Vallis Polygons

Science.gov (United States)

2002-01-01

[figure removed for brevity, see original site] This jumble of eroded ridges and mesas occurs within Ares Vallis, one of the largest catastrophic outflow channels on the planet. Floods raged through this channel, portions of which are up to 25 km wide, pouring out into the Chryse Basin to the north. Close inspection of the THEMIS image reveals polygonal shapes on the floor of the channel system. Polygonal terrain on Mars is fairly common although the variety of forms and scales of the polygons suggests multiple modes of origin. Those in Ares Vallis resemble giant desiccation polygons that form in soils on Earth when a moist layer at depth drys out. While polygons can form in icy soils (permafrost) and even lava flows, their presence in a channel thought to have been carved by flowing water is at least consistent with a mode of origin that involved liquid water.Note: this THEMIS visual image has not been radiometrically nor geometrically calibrated for this preliminary release. An empirical correction has been performed to remove instrumental effects. A linear shift has been applied in the cross-track and down-track direction to approximate spacecraft and planetary motion. Fully calibrated and geometrically projected images will be released through the Planetary Data System in accordance with Project policies at a later time.NASA's Jet Propulsion Laboratory manages the 2001 Mars Odyssey mission for NASA's Office of Space Science, Washington, D.C. The Thermal Emission Imaging System (THEMIS) was developed by Arizona State University, Tempe, in collaboration with Raytheon Santa Barbara Remote Sensing. The THEMIS investigation is led by Dr. Philip Christensen at Arizona State University. Lockheed Martin Astronautics, Denver, is the prime contractor for the Odyssey project, and developed and built the orbiter. Mission operations are conducted jointly from Lockheed Martin and from JPL, a division of the California Institute of Technology in Pasadena.

18. The linking number and the writhe of uniform random walks and polygons in confined spaces

International Nuclear Information System (INIS)

Panagiotou, E; Lambropoulou, S; Millett, K C

2010-01-01

Random walks and polygons are used to model polymers. In this paper we consider the extension of the writhe, self-linking number and linking number to open chains. We then study the average writhe, self-linking and linking number of random walks and polygons over the space of configurations as a function of their length. We show that the mean squared linking number, the mean squared writhe and the mean squared self-linking number of oriented uniform random walks or polygons of length n, in a convex confined space, are of the form O(n 2 ). Moreover, for a fixed simple closed curve in a convex confined space, we prove that the mean absolute value of the linking number between this curve and a uniform random walk or polygon of n edges is of the form O(√n). Our numerical studies confirm those results. They also indicate that the mean absolute linking number between any two oriented uniform random walks or polygons, of n edges each, is of the form O(n). Equilateral random walks and polygons are used to model polymers in θ-conditions. We use numerical simulations to investigate how the self-linking and linking number of equilateral random walks scale with their length.

19. Development of polygon elements based on the scaled boundary finite element method

International Nuclear Information System (INIS)

Chiong, Irene; Song Chongmin

2010-01-01

We aim to extend the scaled boundary finite element method to construct conforming polygon elements. The development of the polygonal finite element is highly anticipated in computational mechanics as greater flexibility and accuracy can be achieved using these elements. The scaled boundary polygonal finite element will enable new developments in mesh generation, better accuracy from a higher order approximation and better transition elements in finite element meshes. Polygon elements of arbitrary number of edges and order have been developed successfully. The edges of an element are discretised with line elements. The displacement solution of the scaled boundary finite element method is used in the development of shape functions. They are shown to be smooth and continuous within the element, and satisfy compatibility and completeness requirements. Furthermore, eigenvalue decomposition has been used to depict element modes and outcomes indicate the ability of the scaled boundary polygonal element to express rigid body and constant strain modes. Numerical tests are presented; the patch test is passed and constant strain modes verified. Accuracy and convergence of the method are also presented and the performance of the scaled boundary polygonal finite element is verified on Cook's swept panel problem. Results show that the scaled boundary polygonal finite element method outperforms a traditional mesh and accuracy and convergence are achieved from fewer nodes. The proposed method is also shown to be truly flexible, and applies to arbitrary n-gons formed of irregular and non-convex polygons.

20. Subordination by convex functions

Directory of Open Access Journals (Sweden)

Rosihan M. Ali

2006-01-01

Full Text Available For a fixed analytic function g(z=z+∑n=2∞gnzn defined on the open unit disk and γ<1, let Tg(γ denote the class of all analytic functions f(z=z+∑n=2∞anzn satisfying ∑n=2∞|angn|≤1−γ. For functions in Tg(γ, a subordination result is derived involving the convolution with a normalized convex function. Our result includes as special cases several earlier works.

1. Mathematics without... Irregular Polygons

Science.gov (United States)

McLeay, Heather

2007-01-01

In this article, the author reflects on her session at the 2006 conference, including the learning styles and strategies she observed. In her session, they explored some of the more unusual aspects of convex polyhedra (with regular faces), including the notions of "valence" and "species". Although the session was about shape and space, there was…

2. Polygon on Mars

Science.gov (United States)

2008-01-01

This image shows a small-scale polygonal pattern in the ground near NASA's Phoenix Mars Lander. This pattern is similar in appearance to polygonal structures in icy ground in the arctic regions of Earth. Phoenix touched down on the Red Planet at 4:53 p.m. Pacific Time (7:53 p.m. Eastern Time), May 25, 2008, in an arctic region called Vastitas Borealis, at 68 degrees north latitude, 234 degrees east longitude. This image was acquired by the Surface Stereo Imager shortly after landing. On the Phoenix mission calendar, landing day is known as Sol 0, the first Martian day of the mission. The Phoenix Mission is led by the University of Arizona, Tucson, on behalf of NASA. Project management of the mission is by NASA's Jet Propulsion Laboratory, Pasadena, Calif. Spacecraft development is by Lockheed Martin Space Systems, Denver.

3. Polygons in Utopia

Science.gov (United States)

2005-01-01

14 April 2005 This Mars Global Surveyor (MGS) Mars Orbiter Camera (MOC) image shows a typical view of polygon-cracked and pitted surfaces unique to western Utopia Planitia. No other place on Mars has this appearance. Some Mars scientists have speculated that ground ice may be responsible for these landforms. Location near: 42.3oN, 275.6oW Image width: 3 km (1.9 mi) Illumination from: lower left Season: Northern Summer

4. Utopia Cracks and Polygons

Science.gov (United States)

2003-01-01

MGS MOC Release No. MOC2-339, 23 April 2003This Mars Global Surveyor (MGS) Mars Orbiter Camera (MOC) image shows a pattern of polygonal cracks and aligned, elliptical pits in western Utopia Planitia. The picture covers an area about 3 km (about 1.9 mi) wide near 44.9oN, 274.7oW. Sunlight illuminates the scene from the left.

5. Preconditioning 2D Integer Data for Fast Convex Hull Computations.

Science.gov (United States)

Cadenas, José Oswaldo; Megson, Graham M; Luengo Hendriks, Cris L

2016-01-01

In order to accelerate computing the convex hull on a set of n points, a heuristic procedure is often applied to reduce the number of points to a set of s points, s ≤ n, which also contains the same hull. We present an algorithm to precondition 2D data with integer coordinates bounded by a box of size p × q before building a 2D convex hull, with three distinct advantages. First, we prove that under the condition min(p, q) ≤ n the algorithm executes in time within O(n); second, no explicit sorting of data is required; and third, the reduced set of s points forms a simple polygonal chain and thus can be directly pipelined into an O(n) time convex hull algorithm. This paper empirically evaluates and quantifies the speed up gained by preconditioning a set of points by a method based on the proposed algorithm before using common convex hull algorithms to build the final hull. A speedup factor of at least four is consistently found from experiments on various datasets when the condition min(p, q) ≤ n holds; the smaller the ratio min(p, q)/n is in the dataset, the greater the speedup factor achieved.

6. Origin of giant Martian polygons

Science.gov (United States)

Mcgill, George E.; Hills, L. S.

1992-01-01

Extensive areas of the Martian northern plains in Utopia and Acidalia planitiae are characterized by 'polygonal terrane'. Polygonal terrane consists of material cut by complex troughs defining a pattern resembling mudcracks, columnar joints, or frost-wedge polygons on earth. However, the Martian polygons are orders of magnitude larger than these potential earth analogues, leading to severe mechanical difficulties for genetic models based on simple analogy arguments. Plate-bending and finite element models indicate that shrinkage of desiccating sediment or cooling volcanics accompanied by differential compaction over buried topography can account for the stresses responsible for polygon troughs as well as the large size of the polygons. Although trough widths and depths relate primarily to shrinkage, the large scale of the polygonl pattern relates to the spacing between topographic elevations on the surface buried beneath polygonal terrane material. Geological relationships favor a sedimentary origin for polygonal terrane material, but our model is not dependent on the specific genesis. Our analysis also suggests that the polygons must have formed at a geologically rapid rate.

7. Convex games versus clan games

NARCIS (Netherlands)

Brânzei, R.; Dimitrov, D.A.; Tijs, S.H.

2008-01-01

In this paper we provide characterizations of convex games and total clan games by using properties of their corresponding marginal games. We show that a "dualize and restrict" procedure transforms total clan games with zero worth for the clan into monotonic convex games. Furthermore, each monotonic

8. Convex Games versus Clan Games

NARCIS (Netherlands)

Brânzei, R.; Dimitrov, D.A.; Tijs, S.H.

2006-01-01

In this paper we provide characterizations of convex games and total clan games by using properties of their corresponding marginal games.We show that a "dualize and restrict" procedure transforms total clan games with zero worth for the clan into monotonic convex games.Furthermore, each monotonic

9. Convexity Adjustments for ATS Models

DEFF Research Database (Denmark)

Murgoci, Agatha; Gaspar, Raquel M.

. As a result we classify convexity adjustments into forward adjustments and swaps adjustments. We, then, focus on affine term structure (ATS) models and, in this context, conjecture convexity adjustments should be related of affine functionals. In the case of forward adjustments, we show how to obtain exact...

10. Nested convex bodies are chaseable

NARCIS (Netherlands)

N. Bansal (Nikhil); M. Böhm (Martin); M. Eliáš (Marek); G. Koumoutsos (Grigorios); S.W. Umboh (Seeun William)

2018-01-01

textabstractIn the Convex Body Chasing problem, we are given an initial point v0 2 Rd and an online sequence of n convex bodies F1; : : : ; Fn. When we receive Fi, we are required to move inside Fi. Our goal is to minimize the total distance traveled. This fundamental online problem was first

11. Polygons in Martian Frost

Science.gov (United States)

2003-01-01

MGS MOC Release No. MOC2-428, 21 July 2003This June 2003 Mars Global Surveyor (MGS) Mars Orbiter Camera (MOC) image shows a polygonal pattern developed in seasonal carbon dioxide frost in the martian southern hemisphere. The frost accumulated during the recent southern winter; it is now spring, and the carbon dioxide frost is subliming away. This image is located near 80.4oS, 200.2oW; it is illuminated by sunlight from the upper left, and covers an area 3 km (1.9 mi) across.

12. Casimir effect in hyperbolic polygons

International Nuclear Information System (INIS)

Ahmedov, H

2007-01-01

Using the point splitting regularization method and the trace formula for the spectra of quantum-mechanical systems in hyperbolic polygons which are the fundamental domains of discrete isometry groups acting in the two-dimensional hyperboloid we calculate the Casimir energy for massless scalar fields in hyperbolic polygons. The dependence of the vacuum energy on the number of vertices is established

13. 137Cs in Research Polygon 'Sumbar'

International Nuclear Information System (INIS)

Skoko, B.; Marovic, G.; Babic, D.; Vickovic, I.

2011-01-01

In 2009, Radiation Protection Unit of the Institute for Medical Reseach and Occupational Health started a radioactivity measurement programme in research polygon ''Sumbar''. The purpose of these investigations is to collect as many data as possible about the contamination of the polygon that is mainly covered by a forest of English oak (Quercus robur) and hornbeam (Carpinus betulus). Once contaminated, forests represent long-term sources of radiation exposure to specific population groups which are using them as a source of foodstuffs. After the Chernobyl accident, researchers have shown that there has been more variability in radionuclide activity concentration in forests than in agricultural ecosystems. In order to carry out a radioactivity screening of the polygon, we randomly chosed three sampling sites for collecting soil, grass and moss samples. Different species of mushrooms were collected over the whole polygon area. The average activity concentration of 137Cs in soil for two sampling sites is (123 @ 9) Bq kg -1 , while the result for the third site is lower by an order of magnitude ((16.1@0.5) Bq kg -1 ). The activity concentration of 137Cs in grass samples ranges from (0.43 @ 0.03) Bq kg -1 to (13.2 @ 0.1) Bq kg -1 , and in moss samples from (8.7 @ 0.2) Bq kg -1 to (57.8 @ 0.3) Bq kg - 1. In five collected mushroom species, the activity of 137Cs is in the range between (4.1 @ 0.5) Bq kg -1 and (610 @ 5) Bq kg -1 , the lowest and the highest values referreing to Clitocybe nebularis and Gymnopus dryophilus, respectively. Parasitic mushrooms exhibit activity below the minimum detection level. Our preliminary results show and confirm variability of the activity concentration of 137Cs in different parts of this ecosystem. (author)

14. Polygons in Seasonal Frost

Science.gov (United States)

2004-01-01

8 February 2004 This Mars Global Surveyor (MGS) Mars Orbiter Camera (MOC) image shows a summertime scene in the south polar region of the red planet. A patch of bright frost--possibly water ice--is seen in the lower third of the image. Polygon patterns that have developed in the ice as it sublimes away can be seen; these are not evident in the defrosted surfaces, so they are thought to have formed in the frost. This image is located near 82.6oS, 352.5oW. Sunlight illuminates this scene from the upper left; the image covers an area 3 km (1.9 mi) wide.

15. θ-convex nonlinear programming problems

International Nuclear Information System (INIS)

Emam, T.

2008-01-01

A class of sets and a class of functions called θ-convex sets and θ-convex functions are introduced by relaxing the definitions of convex sets and operator θ on the sets and domain of definition of the functions. The optimally results for θ-convex programming problems are established.

16. A class of free locally convex spaces

International Nuclear Information System (INIS)

Sipacheva, O V

2003-01-01

Stratifiable spaces are a natural generalization of metrizable spaces for which Dugundji's theorem holds. It is proved that the free locally convex space of a stratifiable space is stratifiable. This means, in particular, that the space of finitely supported probability measures on a stratifiable space is a retract of a locally convex space, and that each stratifiable convex subset of a locally convex space is a retract of a locally convex space

17. Alabama ESI: FISH (Fish Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for marine, estuarine, and freshwater fish species in Alabama. Vector polygons in this data set represent...

18. Maryland ESI: FISH (Fish Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for marine, estuarine, anadromous, and freshwater fish species in Maryland. Vector polygons in this data...

19. Hawaii ESI: FISH (Fish Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for reef, marine, estuarine, and native stream fish species in coastal Hawaii. Vector polygons in this data...

20. Hawaii ESI: INDEX (Index Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector polygons representing the boundaries of the U.S. Geological Survey 1:24,000 topographic maps and other map and digital data boundaries...

1. Alabama ESI: REPTILES (Reptile Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for threatened/endangered and rare reptiles in Alabama. Vector polygons in this data set represent the rare...

2. Alabama ESI: INVERT (Invertebrate Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for marine and estuarine invertebrate species in Alabama. Vector polygons in this data set represent...

3. Virginia ESI: INVERT (Invertebrate Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for marine, estuarine, and rare invertebrate species in Virginia. Vector polygons in this data set...

4. Control Point Generated PLS - polygons

Data.gov (United States)

Minnesota Department of Natural Resources — The Control Point Generated PLS layer contains line and polygon features to the 1/4 of 1/4 PLS section (approximately 40 acres) and government lot level. The layer...

5. Virginia ESI: INDEX (Index Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector polygons representing the boundaries of all hardcopy cartographic products produced as part of the Environmental Sensitivity Index...

6. Louisiana ESI: BIRDS (Bird Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for waterfowl species and shorebirds in coastal Louisiana. Vector polygons in this data set represent...

7. Model for polygonal hydraulic jumps

DEFF Research Database (Denmark)

Martens, Erik Andreas; Watanabe, Shinya; Bohr, Tomas

2012-01-01

We propose a phenomenological model for the polygonal hydraulic jumps discovered by Ellegaard and co-workers [Nature (London) 392, 767 (1998); Nonlinearity 12, 1 (1999); Physica B 228, 1 (1996)], based on the known flow structure for the type-II hydraulic jumps with a "roller" (separation eddy...... nonhydrostatic pressure contributions from surface tension in light of recent observations by Bush and co-workers [J. Fluid Mech. 558, 33 (2006); Phys. Fluids 16, S4 (2004)]. The model can be analyzed by linearization around the circular state, resulting in a parameter relationship for nearly circular polygonal...... states. A truncated but fully nonlinear version of the model can be solved analytically. This simpler model gives rise to polygonal shapes that are very similar to those observed in experiments, even though surface tension is neglected, and the condition for the existence of a polygon with N corners...

8. Virginia ESI: FISH (Fish Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for marine, estuarine, anadromous, and brackishwater fish species in Virginia. Vector polygons in this data...

9. Louisiana ESI: FISH (Fish Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for freshwater (inland) fish species in coastal Louisiana. Vector polygons represent water-bodies and other...

10. Soils - Volusia County Soils (Polygons)

Data.gov (United States)

NSGIC Local Govt | GIS Inventory — Soils: 1:24000 SSURGO Map. Polygon boundaries of Soils in Volusia County, downloaded from SJRWMD and created by NRCS and SJRWMD. This data set is a digital version...

11. Inscribed polygons and Heron polynomials

International Nuclear Information System (INIS)

Varfolomeev, V V

2003-01-01

Heron's well-known formula expressing the area of a triangle in terms of the lengths of its sides is generalized in the following sense to polygons inscribed in a circle: it is proved that the area is an algebraic function of the lengths of the edges of the polygon. Similar results are proved for the diagonals and the radius of the circumscribed circle. The resulting algebraic equations are studied and elementary geometric applications of the algebraic results obtained are presented

12. Geometry of isotropic convex bodies

CERN Document Server

Brazitikos, Silouanos; Valettas, Petros; Vritsiou, Beatrice-Helen

2014-01-01

The study of high-dimensional convex bodies from a geometric and analytic point of view, with an emphasis on the dependence of various parameters on the dimension stands at the intersection of classical convex geometry and the local theory of Banach spaces. It is also closely linked to many other fields, such as probability theory, partial differential equations, Riemannian geometry, harmonic analysis and combinatorics. It is now understood that the convexity assumption forces most of the volume of a high-dimensional convex body to be concentrated in some canonical way and the main question is whether, under some natural normalization, the answer to many fundamental questions should be independent of the dimension. The aim of this book is to introduce a number of well-known questions regarding the distribution of volume in high-dimensional convex bodies, which are exactly of this nature: among them are the slicing problem, the thin shell conjecture and the Kannan-Lov�sz-Simonovits conjecture. This book prov...

13. NP-completeness of weakly convex and convex dominating set decision problems

Directory of Open Access Journals (Sweden)

Joanna Raczek

2004-01-01

Full Text Available The convex domination number and the weakly convex domination number are new domination parameters. In this paper we show that the decision problems of convex and weakly convex dominating sets are \\(NP\\-complete for bipartite and split graphs. Using a modified version of Warshall algorithm we can verify in polynomial time whether a given subset of vertices of a graph is convex or weakly convex.

14. Nonsmooth Mechanics and Convex Optimization

CERN Document Server

Kanno, Yoshihiro

2011-01-01

"This book concerns matter that is intrinsically difficult: convex optimization, complementarity and duality, nonsmooth analysis, linear and nonlinear programming, etc. The author has skillfully introduced these and many more concepts, and woven them into a seamless whole by retaining an easy and consistent style throughout. The book is not all theory: There are many real-life applications in structural engineering, cable networks, frictional contact problems, and plasticity! I recommend it to any reader who desires a modern, authoritative account of nonsmooth mechanics and convex optimiz

15. Zernike-like systems in polygons and polygonal facets.

Science.gov (United States)

Ferreira, Chelo; López, José L; Navarro, Rafael; Sinusía, Ester Pérez

2015-07-20

Zernike polynomials are commonly used to represent the wavefront phase on circular optical apertures, since they form a complete and orthonormal basis on the unit disk. In [Opt. Lett.32, 74 (2007)10.1364/OL.32.000074OPLEDP0146-9592] we introduced a new Zernike basis for elliptic and annular optical apertures based on an appropriate diffeomorphism between the unit disk and the ellipse and the annulus. Here, we present a generalization of this Zernike basis for a variety of important optical apertures, paying special attention to polygons and the polygonal facets present in segmented mirror telescopes. On the contrary to ad hoc solutions, most of them based on the Gram-Smith orthonormalization method, here we consider a piecewise diffeomorphism that transforms the unit disk into the polygon under consideration. We use this mapping to define a Zernike-like orthonormal system over the polygon. We also consider ensembles of polygonal facets that are essential in the design of segmented mirror telescopes. This generalization, based on in-plane warping of the basis functions, provides a unique solution, and what is more important, it guarantees a reasonable level of invariance of the mathematical properties and the physical meaning of the initial basis functions. Both the general form and the explicit expressions for a typical example of telescope optical aperture are provided.

16. Quantum information and convex optimization

International Nuclear Information System (INIS)

Reimpell, Michael

2008-01-01

This thesis is concerned with convex optimization problems in quantum information theory. It features an iterative algorithm for optimal quantum error correcting codes, a postprocessing method for incomplete tomography data, a method to estimate the amount of entanglement in witness experiments, and it gives necessary and sufficient criteria for the existence of retrodiction strategies for a generalized mean king problem. (orig.)

17. On the Moduli of Convexity

Czech Academy of Sciences Publication Activity Database

Guirao, A. J.; Hájek, Petr Pavel

2007-01-01

Roč. 135, č. 10 (2007), s. 3233-3240 ISSN 0002-9939 R&D Projects: GA AV ČR IAA100190502 Institutional research plan: CEZ:AV0Z10190503 Keywords : Banach spaces * moduli of convexity * uniformly rotund norms Subject RIV: BA - General Mathematics Impact factor: 0.520, year: 2007

18. Quantum information and convex optimization

Energy Technology Data Exchange (ETDEWEB)

Reimpell, Michael

2008-07-01

This thesis is concerned with convex optimization problems in quantum information theory. It features an iterative algorithm for optimal quantum error correcting codes, a postprocessing method for incomplete tomography data, a method to estimate the amount of entanglement in witness experiments, and it gives necessary and sufficient criteria for the existence of retrodiction strategies for a generalized mean king problem. (orig.)

19. Convexity of the effective potential

International Nuclear Information System (INIS)

1978-01-01

The effective potential V(phi) in field theories is a convex function of phi. V(lambda phi 1 + (1 - lambda)phi 2 ) less than or equal to lambdaV(phi 1 ) + (1 - lambda)V(phi 2 ), 0 less than or equal to lambda less than or equal to 1, all phi 1 , phi 2 . A linear interpolation of V(phi) is always larger than or equal to V(phi). There are numerous examples in the tree approximation and in perturbation theory for which this is not the case, the most notorious example being the double dip potential. More complete solutions may or may not show this property automatically. However, a non-convex V(phi) simply indicates that an unstable vacuum state was used in implementing the definition of V(phi). A strict definition will instruct one to replace V(phi) with its linear interpolation in such a way as to make it convex. (Alternatively one can just as well take the view that V(phi) is undefined in these domains.) In this note, attention is called to a very simple argument for convexity based on a construction described by H. Callen in his classic book Thermodynamics

20. Deformations of polyhedra and polygons by the unitary group

Energy Technology Data Exchange (ETDEWEB)

Livine, Etera R. [Laboratoire de Physique, ENS Lyon, CNRS-UMR 5672, 46 Allée d' Italie, Lyon 69007, France and Perimeter Institute, 31 Caroline St N, Waterloo, Ontario N2L 2Y5 (Canada)

2013-12-15

We introduce the set of framed (convex) polyhedra with N faces as the symplectic quotient C{sup 2N}//SU(2). A framed polyhedron is then parametrized by N spinors living in C{sup 2} satisfying suitable closure constraints and defines a usual convex polyhedron plus extra U(1) phases attached to each face. We show that there is a natural action of the unitary group U(N) on this phase space, which changes the shape of faces and allows to map any (framed) polyhedron onto any other with the same total (boundary) area. This identifies the space of framed polyhedra to the Grassmannian space U(N)/ (SU(2)×U(N−2)). We show how to write averages of geometrical observables (polynomials in the faces' area and the angles between them) over the ensemble of polyhedra (distributed uniformly with respect to the Haar measure on U(N)) as polynomial integrals over the unitary group and we provide a few methods to compute these integrals systematically. We also use the Itzykson-Zuber formula from matrix models as the generating function for these averages and correlations. In the quantum case, a canonical quantization of the framed polyhedron phase space leads to the Hilbert space of SU(2) intertwiners (or, in other words, SU(2)-invariant states in tensor products of irreducible representations). The total boundary area as well as the individual face areas are quantized as half-integers (spins), and the Hilbert spaces for fixed total area form irreducible representations of U(N). We define semi-classical coherent intertwiner states peaked on classical framed polyhedra and transforming consistently under U(N) transformations. And we show how the U(N) character formula for unitary transformations is to be considered as an extension of the Itzykson-Zuber to the quantum level and generates the traces of all polynomial observables over the Hilbert space of intertwiners. We finally apply the same formalism to two dimensions and show that classical (convex) polygons can be described in

1. Minimum-link paths among obstacles in the plane

NARCIS (Netherlands)

Mitchell, J.S.B.; Rote, G.; Woeginger, G.J.

1992-01-01

Given a set of nonintersecting polygonal obstacles in the plane, thelink distance between two pointss andt is the minimum number of edges required to form a polygonal path connectings tot that avoids all obstacles. We present an algorithm that computes the link distance (and a corresponding

2. Generating realistic roofs over a rectilinear polygon

KAUST Repository

Ahn, Heekap

2011-01-01

Given a simple rectilinear polygon P in the xy-plane, a roof over P is a terrain over P whose faces are supported by planes through edges of P that make a dihedral angle π/4 with the xy-plane. In this paper, we introduce realistic roofs by imposing a few additional constraints. We investigate the geometric and combinatorial properties of realistic roofs, and show a connection with the straight skeleton of P. We show that the maximum possible number of distinct realistic roofs over P is ( ⌊(n-4)/4⌋ (n-4)/2) when P has n vertices. We present an algorithm that enumerates a combinatorial representation of each such roof in O(1) time per roof without repetition, after O(n 4) preprocessing time. We also present an O(n 5)-time algorithm for computing a realistic roof with minimum height or volume. © 2011 Springer-Verlag.

3. Tessellating the Sphere with Regular Polygons

Science.gov (United States)

Soto-Johnson, Hortensia; Bechthold, Dawn

2004-01-01

Tessellations in the Euclidean plane and regular polygons that tessellate the sphere are reviewed. The regular polygons that can possibly tesellate the sphere are spherical triangles, squares and pentagons.

4. Computing farthest neighbors on a convex polytope

NARCIS (Netherlands)

Cheong, O.; Shin, C.S.; Vigneron, A.

2002-01-01

Let N be a set of n points in convex position in R3. The farthest-point Voronoi diagram of N partitions R³ into n convex cells. We consider the intersection G(N) of the diagram with the boundary of the convex hull of N. We give an algorithm that computes an implicit representation of G(N) in

5. Tensor Product of Polygonal Cell Complexes

OpenAIRE

Chien, Yu-Yen

2017-01-01

We introduce the tensor product of polygonal cell complexes, which interacts nicely with the tensor product of link graphs of complexes. We also develop the unique factorization property of polygonal cell complexes with respect to the tensor product, and study the symmetries of tensor products of polygonal cell complexes.

6. A noncommutative convexity in C*-bimodules

Directory of Open Access Journals (Sweden)

Mohsen Kian

2017-02-01

Full Text Available Let A and B be C*-algebras. We consider a noncommutative convexity in Hilbert A-B-bimodules, called A-B-convexity, as a generalization of C*-convexity in C*-algebras. We show that if X is a Hilbert A-B-bimodule, then Mn(X is a Hilbert Mn(A-Mn(B-bimodule and apply it to show that the closed unit ball of every Hilbert A-B-bimodule is A-B-convex. Some properties of this kind of convexity and various examples have been given.

7. Quantum logics and convex geometry

International Nuclear Information System (INIS)

Bunce, L.J.; Wright, J.D.M.

1985-01-01

The main result is a representation theorem which shows that, for a large class of quantum logics, a quantum logic, Q, is isomorphic to the lattice of projective faces in a suitable convex set K. As an application we extend our earlier results, which, subject to countability conditions, gave a geometric characterization of those quantum logics which are isomorphic to the projection lattice of a von Neumann algebra or a JBW-algebra. (orig.)

8. Learning Convex Inference of Marginals

OpenAIRE

Domke, Justin

2012-01-01

Graphical models trained using maximum likelihood are a common tool for probabilistic inference of marginal distributions. However, this approach suffers difficulties when either the inference process or the model is approximate. In this paper, the inference process is first defined to be the minimization of a convex function, inspired by free energy approximations. Learning is then done directly in terms of the performance of the inference process at univariate marginal prediction. The main ...

9. Diameter 2 properties and convexity

Czech Academy of Sciences Publication Activity Database

Abrahamsen, T. A.; Hájek, Petr Pavel; Nygaard, O.; Talponen, J.; Troyanski, S.

2016-01-01

Roč. 232, č. 3 (2016), s. 227-242 ISSN 0039-3223 R&D Projects: GA ČR GA16-07378S Institutional support: RVO:67985840 Keywords : diameter 2 property * midpoint locally uniformly rotund * Daugavet property Subject RIV: BA - General Mathematics Impact factor: 0.535, year: 2016 https://www.impan.pl/pl/wydawnictwa/czasopisma-i-serie-wydawnicze/studia- mathematica /all/232/3/91534/diameter-2-properties-and-convexity

10. High-order polygonal discontinuous Petrov-Galerkin (PolyDPG) methods using ultraweak formulations

Science.gov (United States)

Vaziri Astaneh, Ali; Fuentes, Federico; Mora, Jaime; Demkowicz, Leszek

2018-04-01

This work represents the first endeavor in using ultraweak formulations to implement high-order polygonal finite element methods via the discontinuous Petrov-Galerkin (DPG) methodology. Ultraweak variational formulations are nonstandard in that all the weight of the derivatives lies in the test space, while most of the trial space can be chosen as copies of $L^2$-discretizations that have no need to be continuous across adjacent elements. Additionally, the test spaces are broken along the mesh interfaces. This allows one to construct conforming polygonal finite element methods, termed here as PolyDPG methods, by defining most spaces by restriction of a bounding triangle or box to the polygonal element. The only variables that require nontrivial compatibility across elements are the so-called interface or skeleton variables, which can be defined directly on the element boundaries. Unlike other high-order polygonal methods, PolyDPG methods do not require ad hoc stabilization terms thanks to the crafted stability of the DPG methodology. A proof of convergence of the form $h^p$ is provided and corroborated through several illustrative numerical examples. These include polygonal meshes with $n$-sided convex elements and with highly distorted concave elements, as well as the modeling of discontinuous material properties along an arbitrary interface that cuts a uniform grid. Since PolyDPG methods have a natural a posteriori error estimator a polygonal adaptive strategy is developed and compared to standard adaptivity schemes based on constrained hanging nodes. This work is also accompanied by an open-source $\\texttt{PolyDPG}$ software supporting polygonal and conventional elements.

11. Triangulating and guarding realistic polygons

NARCIS (Netherlands)

Aloupis, G.; Bose, P.; Dujmovic, V.; Gray, C.M.; Langerman, S.; Speckmann, B.

2008-01-01

We propose a new model of realistic input: k-guardable objects. An object is k-guardable if its boundary can be seen by k guards in the interior of the object. In this abstract, we describe a simple algorithm for triangulating k-guardable polygons. Our algorithm, which is easily implementable, takes

12. Triangulating and guarding realistic polygons

NARCIS (Netherlands)

Aloupis, G.; Bose, P.; Dujmovic, V.; Gray, C.M.; Langerman, S.; Speckmann, B.

2014-01-01

We propose a new model of realistic input: k-guardable objects. An object is k-guardable if its boundary can be seen by k guards. We show that k-guardable polygons generalize two previously identified classes of realistic input. Following this, we give two simple algorithms for triangulating

13. Convergence of Wachspress coordinates: from polygons to curved domains

KAUST Repository

Kosinka, Jiří

2014-08-08

Given a smooth, strictly convex planar domain, we investigate point-wise convergence of the sequence of Wachspress coordinates defined over finer and finer inscribed polygonal approximations of the domain. Based on a relation between the discrete Wachspress case and the limit smooth case given by the Wachspress kernel defined by Warren et al., we show that the corresponding sequences of Wachspress interpolants and mappings converge as 𝓞(h2) for a sampling step size h of the boundary curve of the domain as h → 0. Several examples are shown to numerically validate the results and to visualise the behaviour of discrete interpolants and mappings as they converge to their smooth counterparts. Empirically, the same convergence order is observed also for mean value coordinates. Moreover, our numerical tests suggest that the convergence of interpolants and mappings is uniform both in the Wachspress and mean value cases. © 2014 Springer Science+Business Media New York.

14. Convergence of Wachspress coordinates: from polygons to curved domains

KAUST Repository

Kosinka, Jiří ; Barton, Michael

2014-01-01

Given a smooth, strictly convex planar domain, we investigate point-wise convergence of the sequence of Wachspress coordinates defined over finer and finer inscribed polygonal approximations of the domain. Based on a relation between the discrete Wachspress case and the limit smooth case given by the Wachspress kernel defined by Warren et al., we show that the corresponding sequences of Wachspress interpolants and mappings converge as 𝓞(h2) for a sampling step size h of the boundary curve of the domain as h → 0. Several examples are shown to numerically validate the results and to visualise the behaviour of discrete interpolants and mappings as they converge to their smooth counterparts. Empirically, the same convergence order is observed also for mean value coordinates. Moreover, our numerical tests suggest that the convergence of interpolants and mappings is uniform both in the Wachspress and mean value cases. © 2014 Springer Science+Business Media New York.

15. Rotating Polygons on a Fluid Surface

DEFF Research Database (Denmark)

Bohr, Tomas; Jansson, Thomas; Haspang, Martin

spontaneously and the surface can take the shape of a rigidly rotating polygon. With water we have observed polygons with up to 6 corners. The rotation speed of the polygons does not coincide with that of the plate, but it is often mode-locked, such that the polygon rotates by one corner for each complete...... and R. Miraghaie, ”Symmetry breaking in free-surface cylinder flows”, J. Fluid Mech., 502, 99 (2004)). The polygons occur at much larger Reynolds numbers, for water around 500.000. Correspondingly, the dependence on viscosity is rather small....

16. Polygons, Stars, and Clusters; an Investigation of Polygon Displays

Science.gov (United States)

1988-01-01

variables were chosen, nine in each case , to give reasonably complex polygons without being too complex. I have seen no reported studies of the relation...Pont. Catalina C Datsun 210, Toyota Corolla, Dodge Colt, Honda Civic, Mazda GLC, Subaru, Ford Fiesta, Plym. Champ Figure 6. Clusters on the basis of...Merc. Marquis, Pont. Catalina, Pont. Grand Prix C Datsun 210, Toyota Corolla, Dodge Colt, Honda Civic, Mazda GLC, Subaru, Ford Fiesta, Plym. Champ

17. Polygonal patterned peatlands of the White Sea islands

Science.gov (United States)

Kutenkov, S. A.; Kozhin, M. N.; Golovina, E. O.; Kopeina, E. I.; Stoikina, N. V.

2018-03-01

The summits and slopes of some islands along the northeastern and northern coasts of the White Sea are covered with dried out peatlands. The thickness of the peat deposit is 30–80 cm and it is separated by troughs into gently sloping polygonal peat blocks up to 20 m2 in size. On some northern islands the peat blocks have permafrost cores. The main components of the dried out peatlands vegetation are dwarf shrubs and lichens. The peat stratigraphy reveals two stages of peatland development. On the first stage, the islands were covered with wet cottongrass carpets, which repeated the convex relief shape. On the second stage, they were occupied by the xeromorphic vegetation. We suggest that these polygonal patterned peatlands are the remnants of blanket bogs, the formation of which assumes the conditions of a much more humid climate in the historical past. The time of their active development was calculated according to the White Sea level changes and radiocarbon dates from 1000–4000 BP.

18. Finite dimensional convexity and optimization

CERN Document Server

Florenzano, Monique

2001-01-01

The primary aim of this book is to present notions of convex analysis which constitute the basic underlying structure of argumentation in economic theory and which are common to optimization problems encountered in many applications. The intended readers are graduate students, and specialists of mathematical programming whose research fields are applied mathematics and economics. The text consists of a systematic development in eight chapters, with guided exercises containing sometimes significant and useful additional results. The book is appropriate as a class text, or for self-study.

19. Use of Convexity in Ostomy Care

Science.gov (United States)

Salvadalena, Ginger; Pridham, Sue; Droste, Werner; McNichol, Laurie; Gray, Mikel

2017-01-01

Ostomy skin barriers that incorporate a convexity feature have been available in the marketplace for decades, but limited resources are available to guide clinicians in selection and use of convex products. Given the widespread use of convexity, and the need to provide practical guidelines for appropriate use of pouching systems with convex features, an international consensus panel was convened to provide consensus-based guidance for this aspect of ostomy practice. Panelists were provided with a summary of relevant literature in advance of the meeting; these articles were used to generate and reach consensus on 26 statements during a 1-day meeting. Consensus was achieved when 80% of panelists agreed on a statement using an anonymous electronic response system. The 26 statements provide guidance for convex product characteristics, patient assessment, convexity use, and outcomes. PMID:28002174

20. Reconstruction of convex bodies from moments

DEFF Research Database (Denmark)

Hörrmann, Julia; Kousholt, Astrid

We investigate how much information about a convex body can be retrieved from a finite number of its geometric moments. We give a sufficient condition for a convex body to be uniquely determined by a finite number of its geometric moments, and we show that among all convex bodies, those which......- rithm that approximates a convex body using a finite number of its Legendre moments. The consistency of the algorithm is established using the stabil- ity result for Legendre moments. When only noisy measurements of Legendre moments are available, the consistency of the algorithm is established under...

1. Random walks and polygons in tight confinement

International Nuclear Information System (INIS)

Diao, Y; Ernst, C; Ziegler, U

2014-01-01

We discuss the effect of confinement on the topology and geometry of tightly confined random walks and polygons. Here the walks and polygons are confined in a sphere of radius R ≥ 1/2 and the polygons are equilateral with n edges of unit length. We illustrate numerically that for a fixed length of random polygons the knotting probability increases to one as the radius decreases to 1/2. We also demonstrate that for random polygons (walks) the curvature increases to πn (π(n – 1)) as the radius approaches 1/2 and that the torsion decreases to ≈ πn/3 (≈ π(n – 1)/3). In addition we show the effect of length and confinement on the average crossing number of a random polygon

2. Small-scale polygons on Mars

Science.gov (United States)

Lucchitta, B. K.

1984-01-01

Polygonal-fracture patterns on the martian surface were discovered on Viking Orbiter images. The polygons are 2-20 km in diameter, much larger than those of known patterned ground on Earth. New observations show, however, that polygons exist on Mars that have diameters similar to those of ice-wedge polygons on Earth (generally a few meters to more than 100 m). Various explanations for the origin of these crustal features are examined; seasonal desiccation and thermal-contraction cracking in ice-rich ground. It is difficult to ascertain whether the polygons are forming today or are relics from the past. The crispness of some crack suggests a recent origin. On the other hand the absence of upturned edges (indicating actively forming ice wedges), the locally disintegrating ground, and a few possible superposed rayed craters indicate that the polygons are not forming at the present.

3. Entropy coherent and entropy convex measures of risk

NARCIS (Netherlands)

2013-01-01

We introduce two subclasses of convex measures of risk, referred to as entropy coherent and entropy convex measures of risk. Entropy coherent and entropy convex measures of risk are special cases of φ-coherent and φ-convex measures of risk. Contrary to the classical use of coherent and convex

4. Pluripotential theory and convex bodies

Science.gov (United States)

Bayraktar, T.; Bloom, T.; Levenberg, N.

2018-03-01

A seminal paper by Berman and Boucksom exploited ideas from complex geometry to analyze the asymptotics of spaces of holomorphic sections of tensor powers of certain line bundles L over compact, complex manifolds as the power grows. This yielded results on weighted polynomial spaces in weighted pluripotential theory in {C}^d. Here, motivated by a recent paper by the first author on random sparse polynomials, we work in the setting of weighted pluripotential theory arising from polynomials associated to a convex body in ({R}^+)^d. These classes of polynomials need not occur as sections of tensor powers of a line bundle L over a compact, complex manifold. We follow the approach of Berman and Boucksom to obtain analogous results. Bibliography: 16 titles.

5. Convex analysis and global optimization

CERN Document Server

Tuy, Hoang

2016-01-01

This book presents state-of-the-art results and methodologies in modern global optimization, and has been a staple reference for researchers, engineers, advanced students (also in applied mathematics), and practitioners in various fields of engineering. The second edition has been brought up to date and continues to develop a coherent and rigorous theory of deterministic global optimization, highlighting the essential role of convex analysis. The text has been revised and expanded to meet the needs of research, education, and applications for many years to come. Updates for this new edition include: · Discussion of modern approaches to minimax, fixed point, and equilibrium theorems, and to nonconvex optimization; · Increased focus on dealing more efficiently with ill-posed problems of global optimization, particularly those with hard constraints;

6. Convex trace functions of several variables

DEFF Research Database (Denmark)

Hansen, Frank

2002-01-01

We prove that the function (x1,...,xk)¿Tr(f(x1,...,xk)), defined on k-tuples of symmetric matrices of order (n1,...,nk) in the domain of f, is convex for any convex function f of k variables. The matrix f(x1,...,xk) is defined by the functional calculus for functions of several variables, and it ...

7. Differential analysis of matrix convex functions II

DEFF Research Database (Denmark)

Hansen, Frank; Tomiyama, Jun

2009-01-01

We continue the analysis in [F. Hansen, and J. Tomiyama, Differential analysis of matrix convex functions. Linear Algebra Appl., 420:102--116, 2007] of matrix convex functions of a fixed order defined in a real interval by differential methods as opposed to the characterization in terms of divided...

8. Strictly convex functions on complete Finsler manifolds

convex functions on the metric structures of complete Finsler manifolds. More precisely we discuss ... map expp at some point p ∈ M (and hence at every point on M) is defined on the whole tangent space Mp to M at ... The influence of the existence of convex functions on the metric and topology of under- lying manifolds has ...

9. Introduction to Convex and Quasiconvex Analysis

NARCIS (Netherlands)

J.B.G. Frenk (Hans); G. Kassay

2004-01-01

textabstractIn the first chapter of this book the basic results within convex and quasiconvex analysis are presented. In Section 2 we consider in detail the algebraic and topological properties of convex sets within Rn together with their primal and dual representations. In Section 3 we apply the

10. Convexity of oligopoly games without transferable technologies

NARCIS (Netherlands)

Driessen, Theo; Meinhardt, Holger I.

2005-01-01

We present sufficient conditions involving the inverse demand function and the cost functions to establish the convexity of oligopoly TU-games without transferable technologies. For convex TU-games it is well known that the core is relatively large and that it is generically nonempty. The former

11. Convex bodies with many elliptic sections

OpenAIRE

Arelio, Isaac; Montejano, Luis

2014-01-01

{We show in this paper that two normal elliptic sections through every point of the boundary of a smooth convex body essentially characterize an ellipsoid and furthermore, that four different pairwise non-tangent elliptic sections through every point of the $C^2$-differentiable boundary of a convex body also essentially characterize an ellipsoid.

12. Generalized convexity, generalized monotonicity recent results

CERN Document Server

Martinez-Legaz, Juan-Enrique; Volle, Michel

1998-01-01

A function is convex if its epigraph is convex. This geometrical structure has very strong implications in terms of continuity and differentiability. Separation theorems lead to optimality conditions and duality for convex problems. A function is quasiconvex if its lower level sets are convex. Here again, the geo­ metrical structure of the level sets implies some continuity and differentiability properties for quasiconvex functions. Optimality conditions and duality can be derived for optimization problems involving such functions as well. Over a period of about fifty years, quasiconvex and other generalized convex functions have been considered in a variety of fields including economies, man­ agement science, engineering, probability and applied sciences in accordance with the need of particular applications. During the last twenty-five years, an increase of research activities in this field has been witnessed. More recently generalized monotonicity of maps has been studied. It relates to generalized conve...

13. Realistic roofs over a rectilinear polygon

KAUST Repository

Ahn, Heekap

2013-11-01

Given a simple rectilinear polygon P in the xy-plane, a roof over P is a terrain over P whose faces are supported by planes through edges of P that make a dihedral angle π/4 with the xy-plane. According to this definition, some roofs may have faces isolated from the boundary of P or even local minima, which are undesirable for several practical reasons. In this paper, we introduce realistic roofs by imposing a few additional constraints. We investigate the geometric and combinatorial properties of realistic roofs and show that the straight skeleton induces a realistic roof with maximum height and volume. We also show that the maximum possible number of distinct realistic roofs over P is ((n-4)(n-4)/4 /2⌋) when P has n vertices. We present an algorithm that enumerates a combinatorial representation of each such roof in O(1) time per roof without repetition, after O(n4) preprocessing time. We also present an O(n5)-time algorithm for computing a realistic roof with minimum height or volume. © 2013 Elsevier B.V.

14. Parcels and Land Ownership - Volusia County Parcels (Polygons)

Data.gov (United States)

NSGIC Local Govt | GIS Inventory — Parcel Ownership Polygon Layer: Polygons showing property ownership created from the "master" subdivision base map for Volusia County. Multiple lots and parcels...

15. Entanglement complexity of semiflexible lattice polygons

International Nuclear Information System (INIS)

Orlandini, E; Tesi, M C; Whittington, S G

2005-01-01

We use Monte Carlo methods to study knotting in polygons on the simple cubic lattice with a stiffness fugacity. We investigate how the knot probability depends on stiffness and how the relative frequency of trefoils and figure eight knots changes as the stiffness changes. In addition, we examine the effect of stiffness on the writhe of the polygons. (letter to the editor)

16. Kink-free deformations of polygons

NARCIS (Netherlands)

Vegter, Gert

1989-01-01

We consider a discrete version of the Whitney-Graustein theorem concerning regular equivalence of closed curves. Two regular polygons P and P’, i.e. polygons without overlapping adjacent edges, are called regularly equivalent if there is a continuous one-parameter family Ps, 0 ≤ s ≤ 1, of regular

17. Accelerating Generalized Polygon Beams and Their Propagation

International Nuclear Information System (INIS)

Zhang Yun-Tian; Zhang Zhi-Gang; Cheng Teng; Zhang Qing-Chuan; Wu Xiao-Ping

2015-01-01

Accelerating beams with intensity cusps and exotic topological properties are drawing increasing attention as they have extensive uses in many intriguing fields. We investigate the structural features of accelerating polygon beams, show their generalized mathematical form theoretically, and discuss the even-numbered polygon beams. Furthermore, we also carry out the experiment and observe the intensity evolution during their propagation

18. Alpha-Concave Hull, a Generalization of Convex Hull

OpenAIRE

2013-01-01

Bounding hull, such as convex hull, concave hull, alpha shapes etc. has vast applications in different areas especially in computational geometry. Alpha shape and concave hull are generalizations of convex hull. Unlike the convex hull, they construct non-convex enclosure on a set of points. In this paper, we introduce another generalization of convex hull, named alpha-concave hull, and compare this concept with convex hull and alpha shape. We show that the alpha-concave hull is also a general...

19. Perceptually stable regions for arbitrary polygons.

Science.gov (United States)

Rocha, J

2003-01-01

Zou and Yan have recently developed a skeletonization algorithm of digital shapes based on a regularity/singularity analysis; they use the polygon whose vertices are the boundary pixels of the image to compute a constrained Delaunay triangulation (CDT) in order to find local symmetries and stable regions. Their method has produced good results but it is slow since its complexity depends on the number of contour pixels. This paper presents an extension of their technique to handle arbitrary polygons, not only polygons of short edges. Consequently, not only can we achieve results as good as theirs for digital images, but we can also compute skeletons of polygons of any number of edges. Since we can handle polygonal approximations of figures, the skeletons are more resilient to noise and faster to process.

20. Duality and calculus of convex objects (theory and applications)

International Nuclear Information System (INIS)

Brinkhuis, Ya; Tikhomirov, V M

2007-01-01

A new approach to convex calculus is presented, which allows one to treat from a single point of view duality and calculus for various convex objects. This approach is based on the possibility of associating with each convex object (a convex set or a convex function) a certain convex cone without loss of information about the object. From the duality theorem for cones duality theorems for other convex objects are deduced as consequences. The theme 'Duality formulae and the calculus of convex objects' is exhausted (from a certain precisely formulated point of view). Bibliography: 5 titles.

1. Stretched polygons in a lattice tube

Energy Technology Data Exchange (ETDEWEB)

Atapour, M [Department of Mathematics and Statistics, York University, Toronto, ON M3J 1P3 (Canada); Soteros, C E [Department of Mathematics and Statistics, University of Saskatchewan, Saskatoon, SK S7N 5E6 (Canada); Whittington, S G [Department of Chemistry, University of Toronto, Toronto, ON M5S 3H6 (Canada)], E-mail: atapour@mathstat.yorku.ca, E-mail: soteros@math.usask.ca, E-mail: swhittin@chem.utoronto.ca

2009-08-14

We examine the topological entanglements of polygons confined to a lattice tube and under the influence of an external tensile force f. The existence of the limiting free energy for these so-called stretched polygons is proved and then, using transfer matrix arguments, a pattern theorem for stretched polygons is proved. Note that the tube constraint allows us to prove a pattern theorem for any arbitrary value of f, while without the tube constraint it has so far only been proved for large values of f. The stretched polygon pattern theorem is used first to show that the average span per edge of a randomly chosen n-edge stretched polygon approaches a positive value, non-decreasing in f, as n {yields} {infinity}. We then show that the knotting probability of an n-edge stretched polygon confined to a tube goes to one exponentially as n {yields} {infinity}. Thus as n {yields} {infinity} when polygons are influenced by a force f, no matter its strength or direction, topological entanglements, as defined by knotting, occur with high probability. (fast track communication)

2. Stretched polygons in a lattice tube

International Nuclear Information System (INIS)

Atapour, M; Soteros, C E; Whittington, S G

2009-01-01

We examine the topological entanglements of polygons confined to a lattice tube and under the influence of an external tensile force f. The existence of the limiting free energy for these so-called stretched polygons is proved and then, using transfer matrix arguments, a pattern theorem for stretched polygons is proved. Note that the tube constraint allows us to prove a pattern theorem for any arbitrary value of f, while without the tube constraint it has so far only been proved for large values of f. The stretched polygon pattern theorem is used first to show that the average span per edge of a randomly chosen n-edge stretched polygon approaches a positive value, non-decreasing in f, as n → ∞. We then show that the knotting probability of an n-edge stretched polygon confined to a tube goes to one exponentially as n → ∞. Thus as n → ∞ when polygons are influenced by a force f, no matter its strength or direction, topological entanglements, as defined by knotting, occur with high probability. (fast track communication)

3. Convex sets in probabilistic normed spaces

International Nuclear Information System (INIS)

2008-01-01

In this paper we obtain some results on convexity in a probabilistic normed space. We also investigate the concept of CSN-closedness and CSN-compactness in a probabilistic normed space and generalize the corresponding results of normed spaces

4. Designing Camera Networks by Convex Quadratic Programming

KAUST Repository

Ghanem, Bernard; Wonka, Peter; Cao, Yuanhao

2015-01-01

be formulated mathematically as a convex binary quadratic program (BQP) under linear constraints. Moreover, we propose an optimization strategy with a favorable trade-off between speed and solution quality. Our solution

5. ON THE GENERALIZED CONVEXITY AND CONCAVITY

Directory of Open Access Journals (Sweden)

Bhayo B.

2015-11-01

Full Text Available A function ƒ : R+ → R+ is (m1, m2-convex (concave if ƒ(m1(x,y ≤ (≥ m2(ƒ(x, ƒ(y for all x,y Є R+ = (0,∞ and m1 and m2 are two mean functions. Anderson et al. [1] studies the dependence of (m1, m2-convexity (concavity on m1 and m2 and gave the sufficient conditions of (m1, m2-convexity and concavity of a function defined by Maclaurin series. In this paper, we make a contribution to the topic and study the (m1, m2-convexity and concavity of a function where m1 and m2 are identric mean, Alzer mean mean. As well, we prove a conjecture posed by Bruce Ebanks in [2].

6. On convexity and Schoenberg's variation diminishing splines

International Nuclear Information System (INIS)

Feng, Yuyu; Kozak, J.

1992-11-01

In the paper we characterize a convex function by the monotonicity of a particular variation diminishing spline sequence. The result extends the property known for the Bernstein polynomial sequence. (author). 4 refs

7. Hermitian harmonic maps into convex balls

International Nuclear Information System (INIS)

Li Zhenyang; Xi Zhang

2004-07-01

In this paper, we consider Hermitian harmonic maps from Hermitian manifolds into convex balls. We prove that there exist no non-trivial Hermitian harmonic maps from closed Hermitian manifolds into convex balls, and we use the heat flow method to solve the Dirichlet problem for Hermitian harmonic maps when the domain is compact Hermitian manifold with non-empty boundary. The case where the domain manifold is complete(noncompact) is also studied. (author)

8. Polygons on a rotating fluid surface

DEFF Research Database (Denmark)

Jansson, Thomas R.N.; Haspang, Martin P.; Jensen, Kåre H.

2006-01-01

We report a novel and spectacular instability of a fluid surface in a rotating system. In a flow driven by rotating the bottom plate of a partially filled, stationary cylindrical container, the shape of the free surface can spontaneously break the axial symmetry and assume the form of a polygon...... rotating rigidly with a speed different from that of the plate. With water, we have observed polygons with up to 6 corners. It has been known for many years that such flows are prone to symmetry breaking, but apparently the polygonal surface shapes have never been observed. The creation of rotating...

9. BLM National Surface Management Agency: Area Polygons, Withdrawal Area Polygons, and Special Public Purpose Withdrawal Area Polygons

Data.gov (United States)

Federal Geographic Data Committee — The SMA implementation is comprised of one feature dataset, with several polygon feature classes, rather than a single feature class. SurfaceManagementAgency: The...

10. Entropy Coherent and Entropy Convex Measures of Risk

NARCIS (Netherlands)

2011-01-01

We introduce two subclasses of convex measures of risk, referred to as entropy coherent and entropy convex measures of risk. We prove that convex, entropy convex and entropy coherent measures of risk emerge as certainty equivalents under variational, homothetic and multiple priors preferences,

11. On Hadamard-Type Inequalities Involving Several Kinds of Convexity

Directory of Open Access Journals (Sweden)

Dragomir SeverS

2010-01-01

Full Text Available We do not only give the extensions of the results given by Gill et al. (1997 for log-convex functions but also obtain some new Hadamard-type inequalities for log-convex -convex, and -convex functions.

12. Columbia River ESI: INVERT (Invertebrate Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for clams, oysters, crabs, and other invertebrate species in Columbia River. Vector polygons in this data...

13. Louisiana ESI: REPTILES (Reptile and Amphibian Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for reptiles and amphibians in coastal Louisiana. Vector polygons represent reptile and amphibian habitats,...

14. Western Alaska ESI: BIOINDEX (Biological Index Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector polygons representing the boundaries of the 1:250,000 map boundaries used in the creation of the Environmental Sensitivity Index (ESI)...

15. Comic image understanding based on polygon detection

Science.gov (United States)

Li, Luyuan; Wang, Yongtao; Tang, Zhi; Liu, Dong

2013-01-01

Comic image understanding aims to automatically decompose scanned comic page images into storyboards and then identify the reading order of them, which is the key technique to produce digital comic documents that are suitable for reading on mobile devices. In this paper, we propose a novel comic image understanding method based on polygon detection. First, we segment a comic page images into storyboards by finding the polygonal enclosing box of each storyboard. Then, each storyboard can be represented by a polygon, and the reading order of them is determined by analyzing the relative geometric relationship between each pair of polygons. The proposed method is tested on 2000 comic images from ten printed comic series, and the experimental results demonstrate that it works well on different types of comic images.

16. Western Alaska ESI: INDEX (Index Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector polygons representing the boundaries of all the hardcopy cartographic products produced as part of the Environmental Sensitivity Index...

17. Columbia River ESI: FISH (Fish Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for marine, estuarine, anadromous, and freshwater fish species in Columbia River. Vector polygons in this...

18. Infinite genus surfaces and irrational polygonal billiards

OpenAIRE

Valdez, Ferrán

2009-01-01

We prove that the natural invariant surface associated with the billiard game on an irrational polygonal table is homeomorphic to the Loch Ness monster, that is, the only orientable infinite genus topological real surface with exactly one end.

19. Western Alaska ESI: LAKES (Lake Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector polygons representing lakes and land masses used in the creation of the Environmental Sensitivity Index (ESI) for Western Alaska. The...

20. Western Alaska ESI: HYDRO (Land Mass Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector polygons representing coastal hydrography that defines the primary land masses used in the creation of the Environmental Sensitivity...

1. Southeast Alaska ESI: BIRDS (Bird Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains biological resource data for waterfowl in Southeast Alaska. Vector polygons in this data set represent locations of foraging and rafting...

2. Southeast Alaska ESI: MGT (Management Area Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains management area data for National Parks, Wildlife Refuges, and areas designated as Critical Habitat in Southeast Alaska. Vector polygons in...

3. Western Alaska ESI: MGT (Management Area Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains management area data for Designated Critical Habitats, Wildlife Refuges, Wild and Scenic Rivers, and State Parks. Vector polygons in this data...

4. From Newton's bucket to rotating polygons

DEFF Research Database (Denmark)

Bach, B.; Linnartz, E. C.; Vested, Malene Louise Hovgaard

2014-01-01

We present an experimental study of 'polygons' forming on the free surface of a swirling water flow in a partially filled cylindrical container. In our set-up, we rotate the bottom plate and the cylinder wall with separate motors. We thereby vary rotation rate and shear strength independently...... and move from a rigidly rotating 'Newton's bucket' flow to one where bottom and cylinder wall are rotating oppositely and the surface is strongly turbulent but flat on average. Between those two extremes, we find polygonal states for which the rotational symmetry is spontaneously broken. We investigate...... the phase diagram spanned by the two rotational frequencies at a given water filling height and find polygons in a regime, where the two frequencies are sufficiently different and, predominantly, when they have opposite signs. In addition to the extension of the family of polygons found with the stationary...

5. Hawaii ESI: REPTILES (Reptile and Amphibian Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for threatened/endangered sea turtles in coastal Hawaii. Vector polygons in this data set represent sea...

6. Virginia ESI: MGT (Management Area Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains boundaries for management areas, national parks, state and local parks, and wildlife refuges in Virginia. Vector polygons in this data set...

7. Western Alaska ESI: FISH (Fish Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for marine, estuarine, and anadromous fish species in Western Alaska. Vector polygons in this data set...

8. Columbia River ESI: MGT (Management Area Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive human-use data for Wildlife Refuges, National Forests, and State Parks for the Columbia River area. Vector polygons in this data set...

9. Louisiana ESI: MGT (Management Area Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains boundaries for managed lands in coastal Louisiana. Vector polygons in this data set represent the management areas. Location-specific type and...

10. Louisiana ESI: PARISH (Parish Management Area Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains boundaries for parishes in coastal Louisiana. Vector polygons in this data set represent parish management areas. Location-specific type and...

11. Virginia ESI: HYDRO (Hydrography Lines and Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector lines and polygons representing coastal hydrography used in the creation of the Environmental Sensitivity Index (ESI) for Virginia. The...

12. Southeast Alaska ESI: FISH (Fish Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains biological resource data for estuarine, benthic, and pelagic fish in Southeast Alaska. Vector polygons in this data set represent locations of...

13. Anisotropic rectangular metric for polygonal surface remeshing

KAUST Repository

Pellenard, Bertrand

2013-06-18

We propose a new method for anisotropic polygonal surface remeshing. Our algorithm takes as input a surface triangle mesh. An anisotropic rectangular metric, defined at each triangle facet of the input mesh, is derived from both a user-specified normal-based tolerance error and the requirement to favor rectangle-shaped polygons. Our algorithm uses a greedy optimization procedure that adds, deletes and relocates generators so as to match two criteria related to partitioning and conformity.

14. Anisotropic rectangular metric for polygonal surface remeshing

KAUST Repository

Pellenard, Bertrand; Morvan, Jean-Marie; Alliez, Pierre

2013-01-01

We propose a new method for anisotropic polygonal surface remeshing. Our algorithm takes as input a surface triangle mesh. An anisotropic rectangular metric, defined at each triangle facet of the input mesh, is derived from both a user-specified normal-based tolerance error and the requirement to favor rectangle-shaped polygons. Our algorithm uses a greedy optimization procedure that adds, deletes and relocates generators so as to match two criteria related to partitioning and conformity.

15. Generating equilateral random polygons in confinement II

International Nuclear Information System (INIS)

Diao, Y; Ernst, C; Montemayor, A; Ziegler, U

2012-01-01

In this paper we continue an earlier study (Diao et al 2011 J. Phys. A: Math. Theor. 44 405202) on the generation algorithms of random equilateral polygons confined in a sphere. Here, the equilateral random polygons are rooted at the center of the confining sphere and the confining sphere behaves like an absorbing boundary. One way to generate such a random polygon is the accept/reject method in which an unconditioned equilateral random polygon rooted at origin is generated. The polygon is accepted if it is within the confining sphere, otherwise it is rejected and the process is repeated. The algorithm proposed in this paper offers an alternative to the accept/reject method, yielding a faster generation process when the confining sphere is small. In order to use this algorithm effectively, a large, reusable data set needs to be pre-computed only once. We derive the theoretical distribution of the given random polygon model and demonstrate, with strong numerical evidence, that our implementation of the algorithm follows this distribution. A run time analysis and a numerical error estimate are given at the end of the paper. (paper)

16. Control of grinding polygonal surfaces

Directory of Open Access Journals (Sweden)

Юрій Володимирович Петраков

2017-12-01

Full Text Available Grinding of non-round surfaces, in particular polygonal surfaces of dies, is characterized by substantial non stationary. At different sections of the profile, the change in the main characteristic (Material Removal Rate – MRR process reaches tens of times. To stabilize the grinding process, it is recommended to control the spindle speed of the workpiece CNC grinding machine. Created software that allows to design the control program on the basis of mathematical model of the system. The determination of MRR is realized automatically in the simulation of the grinding process which uses the algorithm developed for solving problems in geometric interaction of the workpiece and the wheel. In forming the control program is possible takes into account the limitations on the maximum circumferential force of cutting, and the maximum allowable acceleration of the machine spindle. Practice has shown that full stabilization is not obtained, even though the performance is increased more than 2 times, while ensuring the quality of the surface. The developed block diagram of the grinding process can serve as a basis for further improvement in the solution of dynamic problems.

17. Convex Banding of the Covariance Matrix.

Science.gov (United States)

Bien, Jacob; Bunea, Florentina; Xiao, Luo

2016-01-01

We introduce a new sparse estimator of the covariance matrix for high-dimensional models in which the variables have a known ordering. Our estimator, which is the solution to a convex optimization problem, is equivalently expressed as an estimator which tapers the sample covariance matrix by a Toeplitz, sparsely-banded, data-adaptive matrix. As a result of this adaptivity, the convex banding estimator enjoys theoretical optimality properties not attained by previous banding or tapered estimators. In particular, our convex banding estimator is minimax rate adaptive in Frobenius and operator norms, up to log factors, over commonly-studied classes of covariance matrices, and over more general classes. Furthermore, it correctly recovers the bandwidth when the true covariance is exactly banded. Our convex formulation admits a simple and efficient algorithm. Empirical studies demonstrate its practical effectiveness and illustrate that our exactly-banded estimator works well even when the true covariance matrix is only close to a banded matrix, confirming our theoretical results. Our method compares favorably with all existing methods, in terms of accuracy and speed. We illustrate the practical merits of the convex banding estimator by showing that it can be used to improve the performance of discriminant analysis for classifying sound recordings.

18. Reconstruction of convex bodies from surface tensors

DEFF Research Database (Denmark)

Kousholt, Astrid; Kiderlen, Markus

. The output of the reconstruction algorithm is a polytope P, where the surface tensors of P and K are identical up to rank s. We establish a stability result based on a generalization of Wirtinger’s inequality that shows that for large s, two convex bodies are close in shape when they have identical surface...... that are translates of each other. An algorithm for reconstructing an unknown convex body in R 2 from its surface tensors up to a certain rank is presented. Using the reconstruction algorithm, the shape of an unknown convex body can be approximated when only a finite number s of surface tensors are available...... tensors up to rank s. This is used to establish consistency of the developed reconstruction algorithm....

19. Non-convex multi-objective optimization

CERN Document Server

Pardalos, Panos M; Žilinskas, Julius

2017-01-01

Recent results on non-convex multi-objective optimization problems and methods are presented in this book, with particular attention to expensive black-box objective functions. Multi-objective optimization methods facilitate designers, engineers, and researchers to make decisions on appropriate trade-offs between various conflicting goals. A variety of deterministic and stochastic multi-objective optimization methods are developed in this book. Beginning with basic concepts and a review of non-convex single-objective optimization problems; this book moves on to cover multi-objective branch and bound algorithms, worst-case optimal algorithms (for Lipschitz functions and bi-objective problems), statistical models based algorithms, and probabilistic branch and bound approach. Detailed descriptions of new algorithms for non-convex multi-objective optimization, their theoretical substantiation, and examples for practical applications to the cell formation problem in manufacturing engineering, the process design in...

20. A generalization of the convex Kakeya problem

KAUST Repository

Ahn, Heekap

2012-01-01

We consider the following geometric alignment problem: Given a set of line segments in the plane, find a convex region of smallest area that contains a translate of each input segment. This can be seen as a generalization of Kakeya\\'s problem of finding a convex region of smallest area such that a needle can be turned through 360 degrees within this region. Our main result is an optimal Θ(n log n)-time algorithm for our geometric alignment problem, when the input is a set of n line segments. We also show that, if the goal is to minimize the perimeter of the region instead of its area, then the optimum placement is when the midpoints of the segments coincide. Finally, we show that for any compact convex figure G, the smallest enclosing disk of G is a smallest-perimeter region containing a translate of any rotated copy of G. © 2012 Springer-Verlag Berlin Heidelberg.

1. Reconstruction of convex bodies from surface tensors

DEFF Research Database (Denmark)

Kousholt, Astrid; Kiderlen, Markus

We present two algorithms for reconstruction of the shape of convex bodies in the two-dimensional Euclidean space. The first reconstruction algorithm requires knowledge of the exact surface tensors of a convex body up to rank s for some natural number s. The second algorithm uses harmonic intrinsic...... volumes which are certain values of the surface tensors and allows for noisy measurements. From a generalized version of Wirtinger's inequality, we derive stability results that are utilized to ensure consistency of both reconstruction procedures. Consistency of the reconstruction procedure based...

2. Recovering convexity in non-associated plasticity

Science.gov (United States)

Francfort, Gilles A.

2018-03-01

We quickly review two main non-associated plasticity models, the Armstrong-Frederick model of nonlinear kinematic hardening and the Drucker-Prager cap model. Non-associativity is commonly thought to preclude any kind of variational formulation, be it in a Hencky-type (static) setting, or when considering a quasi-static evolution because non-associativity destroys convexity. We demonstrate that such an opinion is misguided: associativity (and convexity) can be restored at the expense of the introduction of state variable-dependent dissipation potentials.

3. Generating equilateral random polygons in confinement

International Nuclear Information System (INIS)

Diao, Y; Ernst, C; Montemayor, A; Ziegler, U

2011-01-01

One challenging problem in biology is to understand the mechanism of DNA packing in a confined volume such as a cell. It is known that confined circular DNA is often knotted and hence the topology of the extracted (and relaxed) circular DNA can be used as a probe of the DNA packing mechanism. However, in order to properly estimate the topological properties of the confined circular DNA structures using mathematical models, it is necessary to generate large ensembles of simulated closed chains (i.e. polygons) of equal edge lengths that are confined in a volume such as a sphere of certain fixed radius. Finding efficient algorithms that properly sample the space of such confined equilateral random polygons is a difficult problem. In this paper, we propose a method that generates confined equilateral random polygons based on their probability distribution. This method requires the creation of a large database initially. However, once the database has been created, a confined equilateral random polygon of length n can be generated in linear time in terms of n. The errors introduced by the method can be controlled and reduced by the refinement of the database. Furthermore, our numerical simulations indicate that these errors are unbiased and tend to cancel each other in a long polygon. (paper)

4. Minimal knotted polygons in cubic lattices

International Nuclear Information System (INIS)

Van Rensburg, E J Janse; Rechnitzer, A

2011-01-01

In this paper we examine numerically the properties of minimal length knotted lattice polygons in the simple cubic, face-centered cubic, and body-centered cubic lattices by sieving minimal length polygons from a data stream of a Monte Carlo algorithm, implemented as described in Aragão de Carvalho and Caracciolo (1983 Phys. Rev. B 27 1635), Aragão de Carvalho et al (1983 Nucl. Phys. B 215 209) and Berg and Foester (1981 Phys. Lett. B 106 323). The entropy, mean writhe, and mean curvature of minimal length polygons are computed (in some cases exactly). While the minimal length and mean curvature are found to be lattice dependent, the mean writhe is found to be only weakly dependent on the lattice type. Comparison of our results to numerical results for the writhe obtained elsewhere (see Janse van Rensburg et al 1999 Contributed to Ideal Knots (Series on Knots and Everything vol 19) ed Stasiak, Katritch and Kauffman (Singapore: World Scientific), Portillo et al 2011 J. Phys. A: Math. Theor. 44 275004) shows that the mean writhe is also insensitive to the length of a knotted polygon. Thus, while these results for the mean writhe and mean absolute writhe at minimal length are not universal, our results demonstrate that these values are quite close the those of long polygons regardless of the underlying lattice and length

5. Foundations of complex analysis in non locally convex spaces function theory without convexity condition

CERN Document Server

Bayoumi, A

2003-01-01

All the existing books in Infinite Dimensional Complex Analysis focus on the problems of locally convex spaces. However, the theory without convexity condition is covered for the first time in this book. This shows that we are really working with a new, important and interesting field. Theory of functions and nonlinear analysis problems are widespread in the mathematical modeling of real world systems in a very broad range of applications. During the past three decades many new results from the author have helped to solve multiextreme problems arising from important situations, non-convex and

6. Elastic energy of liquid crystals in convex polyhedra

International Nuclear Information System (INIS)

Majumdar, A; Robbins, J M; Zyskin, M

2004-01-01

We consider nematic liquid crystals in a bounded, convex polyhedron described by a director field n(r) subject to tangent boundary conditions. We derive lower bounds for the one-constant elastic energy in terms of topological invariants. For a right rectangular prism and a large class of topologies, we derive upper bounds by introducing test configurations constructed from local conformal solutions of the Euler-Lagrange equation. The ratio of the upper and lower bounds depends only on the aspect ratios of the prism. As the aspect ratios are varied, the minimum-energy conformal state undergoes a sharp transition from being smooth to having singularities on the edges. (letter to the editor)

7. Differential analysis of matrix convex functions

DEFF Research Database (Denmark)

Hansen, Frank; Tomiyama, Jun

2007-01-01

We analyze matrix convex functions of a fixed order defined in a real interval by differential methods as opposed to the characterization in terms of divided differences given by Kraus [F. Kraus, Über konvekse Matrixfunktionen, Math. Z. 41 (1936) 18-42]. We obtain for each order conditions for ma...

8. Conference on Convex Analysis and Global Optimization

CERN Document Server

Pardalos, Panos

2001-01-01

There has been much recent progress in global optimization algo­ rithms for nonconvex continuous and discrete problems from both a theoretical and a practical perspective. Convex analysis plays a fun­ damental role in the analysis and development of global optimization algorithms. This is due essentially to the fact that virtually all noncon­ vex optimization problems can be described using differences of convex functions and differences of convex sets. A conference on Convex Analysis and Global Optimization was held during June 5 -9, 2000 at Pythagorion, Samos, Greece. The conference was honoring the memory of C. Caratheodory (1873-1950) and was en­ dorsed by the Mathematical Programming Society (MPS) and by the Society for Industrial and Applied Mathematics (SIAM) Activity Group in Optimization. The conference was sponsored by the European Union (through the EPEAEK program), the Department of Mathematics of the Aegean University and the Center for Applied Optimization of the University of Florida, by th...

9. Robust Utility Maximization Under Convex Portfolio Constraints

International Nuclear Information System (INIS)

Matoussi, Anis; Mezghani, Hanen; Mnif, Mohamed

2015-01-01

We study a robust maximization problem from terminal wealth and consumption under a convex constraints on the portfolio. We state the existence and the uniqueness of the consumption–investment strategy by studying the associated quadratic backward stochastic differential equation. We characterize the optimal control by using the duality method and deriving a dynamic maximum principle

10. Localized Multiple Kernel Learning A Convex Approach

Science.gov (United States)

2016-11-22

data. All the aforementioned approaches to localized MKL are formulated in terms of non-convex optimization problems, and deep the- oretical...learning. IEEE Transactions on Neural Networks, 22(3):433–446, 2011. Jingjing Yang, Yuanning Li, Yonghong Tian, Lingyu Duan, and Wen Gao. Group-sensitive

11. A generalization of the convex Kakeya problem

KAUST Repository

Ahn, Heekap; Bae, Sangwon; Cheong, Otfried; Gudmundsson, Joachim; Tokuyama, Takeshi; Vigneron, Antoine E.

2013-01-01

segments. We also show that, if the goal is to minimize the perimeter of the region instead of its area, then placing the segments with their midpoint at the origin and taking their convex hull results in an optimal solution. Finally, we show that for any

12. Minimizing convex functions by continuous descent methods

Directory of Open Access Journals (Sweden)

Sergiu Aizicovici

2010-01-01

Full Text Available We study continuous descent methods for minimizing convex functions, defined on general Banach spaces, which are associated with an appropriate complete metric space of vector fields. We show that there exists an everywhere dense open set in this space of vector fields such that each of its elements generates strongly convergent trajectories.

13. Directional Convexity and Finite Optimality Conditions.

Science.gov (United States)

1984-03-01

system, Necessary Conditions for optimality. Work Unit Number 5 (Optimization and Large Scale Systems) *Istituto di Matematica Applicata, Universita...that R(T) is convex would then imply x(u,T) e int R(T). Cletituto di Matematica Applicata, Universita di Padova, 35100 ITALY. Sponsored by the United

14. Convexity properties of Hamiltonian group actions

CERN Document Server

Guillemin, Victor

2005-01-01

This is a monograph on convexity properties of moment mappings in symplectic geometry. The fundamental result in this subject is the Kirwan convexity theorem, which describes the image of a moment map in terms of linear inequalities. This theorem bears a close relationship to perplexing old puzzles from linear algebra, such as the Horn problem on sums of Hermitian matrices, on which considerable progress has been made in recent years following a breakthrough by Klyachko. The book presents a simple local model for the moment polytope, valid in the "generic&rdquo case, and an elementary Morse-theoretic argument deriving the Klyachko inequalities and some of their generalizations. It reviews various infinite-dimensional manifestations of moment convexity, such as the Kostant type theorems for orbits of a loop group (due to Atiyah and Pressley) or a symplectomorphism group (due to Bloch, Flaschka and Ratiu). Finally, it gives an account of a new convexity theorem for moment map images of orbits of a Borel sub...

15. Some Characterizations of Convex Interval Games

NARCIS (Netherlands)

Brânzei, R.; Tijs, S.H.; Alparslan-Gok, S.Z.

2008-01-01

This paper focuses on new characterizations of convex interval games using the notions of exactness and superadditivity. We also relate big boss interval games with concave interval games and obtain characterizations of big boss interval games in terms of exactness and subadditivity.

16. A generalization of the convex Kakeya problem

KAUST Repository

Ahn, Heekap; Bae, Sangwon; Cheong, Otfried; Gudmundsson, Joachim; Tokuyama, Takeshi; Vigneron, Antoine E.

2012-01-01

We consider the following geometric alignment problem: Given a set of line segments in the plane, find a convex region of smallest area that contains a translate of each input segment. This can be seen as a generalization of Kakeya's problem

17. A generalization of the convex Kakeya problem

KAUST Repository

Ahn, Heekap

2013-09-19

Given a set of line segments in the plane, not necessarily finite, what is a convex region of smallest area that contains a translate of each input segment? This question can be seen as a generalization of Kakeya\\'s problem of finding a convex region of smallest area such that a needle can be rotated through 360 degrees within this region. We show that there is always an optimal region that is a triangle, and we give an optimal Θ(nlogn)-time algorithm to compute such a triangle for a given set of n segments. We also show that, if the goal is to minimize the perimeter of the region instead of its area, then placing the segments with their midpoint at the origin and taking their convex hull results in an optimal solution. Finally, we show that for any compact convex figure G, the smallest enclosing disk of G is a smallest-perimeter region containing a translate of every rotated copy of G. © 2013 Springer Science+Business Media New York.

18. Dynamic Matchings in Convex Bipartite Graphs

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Georgiadis, Loukas; Hansen, Kristoffer Arnsfelt

2007-01-01

We consider the problem of maintaining a maximum matching in a convex bipartite graph G = (V,E) under a set of update operations which includes insertions and deletions of vertices and edges. It is not hard to show that it is impossible to maintain an explicit representation of a maximum matching...

19. Cost Allocation and Convex Data Envelopment

DEFF Research Database (Denmark)

Hougaard, Jens Leth; Tind, Jørgen

such as Data Envelopment Analysis (DEA). The convexity constraint of the BCC model introduces a non-zero slack in the objective function of the multiplier problem and we show that the cost allocation rules discussed in this paper can be used as candidates to allocate this slack value on to the input (or output...

20. Tropicalized Lambda Lengths, Measured Laminations and Convexity

DEFF Research Database (Denmark)

C. Penner, R.

This work uncovers the tropical analogue for measured laminations of the convex hull construction of decorated Teichmueller theory, namely, it is a study in coordinates of geometric degeneration to a point of Thurston's boundary for Teichmueller space. This may offer a paradigm for the extension ...

1. Steady state of tapped granular polygons

International Nuclear Information System (INIS)

Carlevaro, Carlos M; Pugnaloni, Luis A

2011-01-01

The steady state packing fraction of a tapped granular bed is studied for different grain shapes via a discrete element method. Grains are monosized regular polygons, from triangles to icosagons. Comparisons with disc packings show that the steady state packing fraction as a function of the tapping intensity presents the same general trends in polygon packings. However, better packing fractions are obtained, as expected, for shapes that can tessellate the plane (triangles, squares and hexagons). In addition, we find a sharp transition for packings of polygons with more than 13 vertices signaled by a discontinuity in the packing fraction at a particular tapping intensity. Density fluctuations for most shapes are consistent with recent experimental findings in disc packing; however, a peculiar behavior is found for triangles and squares

2. Polygons on a rotating fluid surface.

Science.gov (United States)

Jansson, Thomas R N; Haspang, Martin P; Jensen, Kåre H; Hersen, Pascal; Bohr, Tomas

2006-05-05

We report a novel and spectacular instability of a fluid surface in a rotating system. In a flow driven by rotating the bottom plate of a partially filled, stationary cylindrical container, the shape of the free surface can spontaneously break the axial symmetry and assume the form of a polygon rotating rigidly with a speed different from that of the plate. With water, we have observed polygons with up to 6 corners. It has been known for many years that such flows are prone to symmetry breaking, but apparently the polygonal surface shapes have never been observed. The creation of rotating internal waves in a similar setup was observed for much lower rotation rates, where the free surface remains essentially flat [J. M. Lopez, J. Fluid Mech. 502, 99 (2004). We speculate that the instability is caused by the strong azimuthal shear due to the stationary walls and that it is triggered by minute wobbling of the rotating plate.

3. Generating equilateral random polygons in confinement III

International Nuclear Information System (INIS)

Diao, Y; Ernst, C; Montemayor, A; Ziegler, U

2012-01-01

In this paper we continue our earlier studies (Diao et al 2011 J. Phys. A: Math. Theor. 44 405202, Diao et al J. Phys. A: Math. Theor. 45 275203) on the generation methods of random equilateral polygons confined in a sphere. The first half of this paper is concerned with the generation of confined equilateral random walks. We show that if the selection of a vertex is uniform subject to the position of its previous vertex and the confining condition, then the distributions of the vertices are not uniform, although there exists a distribution such that if the initial vertex is selected following this distribution, then all vertices of the random walk follow this same distribution. Thus in order to generate a confined equilateral random walk, the selection of a vertex cannot be uniform subject to the position of its previous vertex and the confining condition. We provide a simple algorithm capable of generating confined equilateral random walks whose vertex distribution is almost uniform in the confinement sphere. In the second half of this paper we show that any process generating confined equilateral random walks can be turned into a process generating confined equilateral random polygons with the property that the vertex distribution of the polygons approaches the vertex distribution of the walks as the polygons get longer and longer. In our earlier studies, the starting point of the confined polygon is fixed at the center of the sphere. The new approach here allows us to move the starting point of the confined polygon off the center of the sphere. (paper)

4. Fast approximate convex decomposition using relative concavity

KAUST Repository

Ghosh, Mukulika; Amato, Nancy M.; Lu, Yanyan; Lien, Jyh-Ming

2013-01-01

Approximate convex decomposition (ACD) is a technique that partitions an input object into approximately convex components. Decomposition into approximately convex pieces is both more efficient to compute than exact convex decomposition and can also generate a more manageable number of components. It can be used as a basis of divide-and-conquer algorithms for applications such as collision detection, skeleton extraction and mesh generation. In this paper, we propose a new method called Fast Approximate Convex Decomposition (FACD) that improves the quality of the decomposition and reduces the cost of computing it for both 2D and 3D models. In particular, we propose a new strategy for evaluating potential cuts that aims to reduce the relative concavity, rather than absolute concavity. As shown in our results, this leads to more natural and smaller decompositions that include components for small but important features such as toes or fingers while not decomposing larger components, such as the torso, that may have concavities due to surface texture. Second, instead of decomposing a component into two pieces at each step, as in the original ACD, we propose a new strategy that uses a dynamic programming approach to select a set of n c non-crossing (independent) cuts that can be simultaneously applied to decompose the component into n c+1 components. This reduces the depth of recursion and, together with a more efficient method for computing the concavity measure, leads to significant gains in efficiency. We provide comparative results for 2D and 3D models illustrating the improvements obtained by FACD over ACD and we compare with the segmentation methods in the Princeton Shape Benchmark by Chen et al. (2009) [31]. © 2012 Elsevier Ltd. All rights reserved.

5. Fast approximate convex decomposition using relative concavity

KAUST Repository

Ghosh, Mukulika

2013-02-01

Approximate convex decomposition (ACD) is a technique that partitions an input object into approximately convex components. Decomposition into approximately convex pieces is both more efficient to compute than exact convex decomposition and can also generate a more manageable number of components. It can be used as a basis of divide-and-conquer algorithms for applications such as collision detection, skeleton extraction and mesh generation. In this paper, we propose a new method called Fast Approximate Convex Decomposition (FACD) that improves the quality of the decomposition and reduces the cost of computing it for both 2D and 3D models. In particular, we propose a new strategy for evaluating potential cuts that aims to reduce the relative concavity, rather than absolute concavity. As shown in our results, this leads to more natural and smaller decompositions that include components for small but important features such as toes or fingers while not decomposing larger components, such as the torso, that may have concavities due to surface texture. Second, instead of decomposing a component into two pieces at each step, as in the original ACD, we propose a new strategy that uses a dynamic programming approach to select a set of n c non-crossing (independent) cuts that can be simultaneously applied to decompose the component into n c+1 components. This reduces the depth of recursion and, together with a more efficient method for computing the concavity measure, leads to significant gains in efficiency. We provide comparative results for 2D and 3D models illustrating the improvements obtained by FACD over ACD and we compare with the segmentation methods in the Princeton Shape Benchmark by Chen et al. (2009) [31]. © 2012 Elsevier Ltd. All rights reserved.

6. Schur Convexity of Generalized Heronian Means Involving Two Parameters

Directory of Open Access Journals (Sweden)

Bencze Mihály

2008-01-01

Full Text Available Abstract The Schur convexity and Schur-geometric convexity of generalized Heronian means involving two parameters are studied, the main result is then used to obtain several interesting and significantly inequalities for generalized Heronian means.

7. A STRONG OPTIMIZATION THEOREM IN LOCALLY CONVEX SPACES

Institute of Scientific and Technical Information of China (English)

程立新; 腾岩梅

2003-01-01

This paper presents a geometric characterization of convex sets in locally convex spaces onwhich a strong optimization theorem of the Stegall-type holds, and gives Collier's theorem ofw* Asplund spaces a localized setting.

8. Displacement Convexity for First-Order Mean-Field Games

KAUST Repository

Seneci, Tommaso

2018-01-01

Finally, we identify a large class of functions, that depend on solutions of MFGs, which are convex in time. Among these, we find several norms. This convexity gives bounds for the density of solutions of the planning problem.

9. Equipartitioning and balancing points of polygons

Directory of Open Access Journals (Sweden)

Shunmugam Pillay

2010-07-01

Full Text Available The centre of mass G of a triangle has the property that the rays to the vertices from G sweep out triangles having equal areas. We show that such points, termed equipartitioning points in this paper, need not exist in other polygons. A necessary and sufficient condition for a quadrilateral to have an equipartitioning point is that one of its diagonals bisects the other. The general theorem, namely, necessary and sufficient conditions for equipartitioning points for arbitrary polygons to exist, is also stated and proved. When this happens, they are in general, distinct from the centre of mass. In parallelograms, and only in them, do the two points coincide.

10. Slow relaxation in weakly open rational polygons.

Science.gov (United States)

Kokshenev, Valery B; Vicentini, Eduardo

2003-07-01

The interplay between the regular (piecewise-linear) and irregular (vertex-angle) boundary effects in nonintegrable rational polygonal billiards (of m equal sides) is discussed. Decay dynamics in polygons (of perimeter P(m) and small opening Delta) is analyzed through the late-time survival probability S(m) approximately equal t(-delta). Two distinct slow relaxation channels are established. The primary universal channel exhibits relaxation of regular sliding orbits, with delta=1. The secondary channel is given by delta>1 and becomes open when m>P(m)/Delta. It originates from vertex order-disorder dual effects and is due to relaxation of chaoticlike excitations.

11. Random packing of regular polygons and star polygons on a flat two-dimensional surface.

Science.gov (United States)

Cieśla, Michał; Barbasz, Jakub

2014-08-01

Random packing of unoriented regular polygons and star polygons on a two-dimensional flat continuous surface is studied numerically using random sequential adsorption algorithm. Obtained results are analyzed to determine the saturated random packing ratio as well as its density autocorrelation function. Additionally, the kinetics of packing growth and available surface function are measured. In general, stars give lower packing ratios than polygons, but when the number of vertexes is large enough, both shapes approach disks and, therefore, properties of their packing reproduce already known results for disks.

12. Convex stoma appliances: an audit of stoma care nurses.

Science.gov (United States)

Perrin, Angie

2016-12-08

This article observes the complexities surrounding the use of convex appliances within the specialist sphere of stoma care. It highlights some of the results taken from a small audit carried out with 24 stoma care nurses examining the general use of convex appliances and how usage of convex products has evolved, along with specialist stoma care practice.

13. Dilation-optimal edge deletion in polygonal cycles

NARCIS (Netherlands)

Ahn, H.K.; Farshi, M.; Knauer, C.; Smid, M.H.M.; Wang, Y.; Tokuyama, T.

2007-01-01

Let C be a polygonal cycle on n vertices in the plane. A randomized algorithm is presented which computes in O(n log3 n) expected time, the edge of C whose removal results in a polygonal path of smallest possible dilation. It is also shown that the edge whose removal gives a polygonal path of

14. Calculating the Areas of Polygons with a Smartphone Light Sensor

Science.gov (United States)

Kapucu, Serkan; Simsek, Mertkan; Öçal, Mehmet Fatih

2017-01-01

This study explores finding the areas of polygons with a smartphone light sensor. A square and an irregular pentagon were chosen as our polygons. During the activity, the LED light was placed at the vertices of our polygons, and the illuminance values of this LED light were detected by the smartphone light sensor. The smartphone was placed on a…

15. Automatically repairing invalid polygons with a constrained triangulation

NARCIS (Netherlands)

Ledoux, H.; Arroyo Ohori, K.; Meijers, M.

2012-01-01

Although the validation of single polygons has received considerable attention, the automatic repair of invalid polygons has not. Automated repair methods can be considered as interpreting ambiguous or ill-defined polygons and giving a coherent and clearly defined output. At this moment, automatic

16. Realistic roofs over a rectilinear polygon

KAUST Repository

Ahn, Heekap; Bae, Sangwon; Knauer, Christian; Lee, Mira; Shin, Chansu; Vigneron, Antoine E.

2013-01-01

Given a simple rectilinear polygon P in the xy-plane, a roof over P is a terrain over P whose faces are supported by planes through edges of P that make a dihedral angle π/4 with the xy-plane. According to this definition, some roofs may have faces

17. Exploring Nonconvex, Crossed and Degenerate Polygons

Science.gov (United States)

Contreras, Jose N.

2004-01-01

An exploration of nonconvex, crossed, and degenerate polygons (NCCDPs) are described with the help of examples with pedagogical tips and recommendations that are found useful when teaching the mathematical process of extending geometric patterns to NCCDPs. The study concludes that investigating such extensions with interactive geometry software…

18. Generating realistic roofs over a rectilinear polygon

KAUST Repository

Ahn, Heekap; Bae, Sangwon; Knauer, Christian; Lee, Mira; Shin, Chansu; Vigneron, Antoine E.

2011-01-01

Given a simple rectilinear polygon P in the xy-plane, a roof over P is a terrain over P whose faces are supported by planes through edges of P that make a dihedral angle π/4 with the xy-plane. In this paper, we introduce realistic roofs by imposing

19. The structure of near polygons with quads

NARCIS (Netherlands)

Brouwer, A.E.; Wilbrink, H.A.

1983-01-01

We develop a structure theory for near polygons with quads. Main results are the existence of sub 2j-gons for 2jd and the nonexistence of regular sporadic 2d-gons for d4 with s>1 and t 2>1 and t 3t 2(t 2+1).

20. Convexity, gauge-dependence and tunneling rates

Energy Technology Data Exchange (ETDEWEB)

Plascencia, Alexis D.; Tamarit, Carlos [Institute for Particle Physics Phenomenology, Durham University,South Road, DH1 3LE (United Kingdom)

2016-10-19

We clarify issues of convexity, gauge-dependence and radiative corrections in relation to tunneling rates. Despite the gauge dependence of the effective action at zero and finite temperature, it is shown that tunneling and nucleation rates remain independent of the choice of gauge-fixing. Taking as a starting point the functional that defines the transition amplitude from a false vacuum onto itself, it is shown that decay rates are exactly determined by a non-convex, false vacuum effective action evaluated at an extremum. The latter can be viewed as a generalized bounce configuration, and gauge-independence follows from the appropriate Nielsen identities. This holds for any election of gauge-fixing that leads to an invertible Faddeev-Popov matrix.

1. Reconstruction of convex bodies from surface tensors

DEFF Research Database (Denmark)

Kousholt, Astrid; Kiderlen, Markus

2016-01-01

We present two algorithms for reconstruction of the shape of convex bodies in the two-dimensional Euclidean space. The first reconstruction algorithm requires knowledge of the exact surface tensors of a convex body up to rank s for some natural number s. When only measurements subject to noise...... of surface tensors are available for reconstruction, we recommend to use certain values of the surface tensors, namely harmonic intrinsic volumes instead of the surface tensors evaluated at the standard basis. The second algorithm we present is based on harmonic intrinsic volumes and allows for noisy...... measurements. From a generalized version of Wirtinger's inequality, we derive stability results that are utilized to ensure consistency of both reconstruction procedures. Consistency of the reconstruction procedure based on measurements subject to noise is established under certain assumptions on the noise...

2. Solving ptychography with a convex relaxation

Science.gov (United States)

Horstmeyer, Roarke; Chen, Richard Y.; Ou, Xiaoze; Ames, Brendan; Tropp, Joel A.; Yang, Changhuei

2015-05-01

Ptychography is a powerful computational imaging technique that transforms a collection of low-resolution images into a high-resolution sample reconstruction. Unfortunately, algorithms that currently solve this reconstruction problem lack stability, robustness, and theoretical guarantees. Recently, convex optimization algorithms have improved the accuracy and reliability of several related reconstruction efforts. This paper proposes a convex formulation of the ptychography problem. This formulation has no local minima, it can be solved using a wide range of algorithms, it can incorporate appropriate noise models, and it can include multiple a priori constraints. The paper considers a specific algorithm, based on low-rank factorization, whose runtime and memory usage are near-linear in the size of the output image. Experiments demonstrate that this approach offers a 25% lower background variance on average than alternating projections, the ptychographic reconstruction algorithm that is currently in widespread use.

3. Convex nonnegative matrix factorization with manifold regularization.

Science.gov (United States)

Hu, Wenjun; Choi, Kup-Sze; Wang, Peiliang; Jiang, Yunliang; Wang, Shitong

2015-03-01

Nonnegative Matrix Factorization (NMF) has been extensively applied in many areas, including computer vision, pattern recognition, text mining, and signal processing. However, nonnegative entries are usually required for the data matrix in NMF, which limits its application. Besides, while the basis and encoding vectors obtained by NMF can represent the original data in low dimension, the representations do not always reflect the intrinsic geometric structure embedded in the data. Motivated by manifold learning and Convex NMF (CNMF), we propose a novel matrix factorization method called Graph Regularized and Convex Nonnegative Matrix Factorization (GCNMF) by introducing a graph regularized term into CNMF. The proposed matrix factorization technique not only inherits the intrinsic low-dimensional manifold structure, but also allows the processing of mixed-sign data matrix. Clustering experiments on nonnegative and mixed-sign real-world data sets are conducted to demonstrate the effectiveness of the proposed method. Copyright © 2014 Elsevier Ltd. All rights reserved.

4. Convexity, gauge-dependence and tunneling rates

International Nuclear Information System (INIS)

Plascencia, Alexis D.; Tamarit, Carlos

2016-01-01

We clarify issues of convexity, gauge-dependence and radiative corrections in relation to tunneling rates. Despite the gauge dependence of the effective action at zero and finite temperature, it is shown that tunneling and nucleation rates remain independent of the choice of gauge-fixing. Taking as a starting point the functional that defines the transition amplitude from a false vacuum onto itself, it is shown that decay rates are exactly determined by a non-convex, false vacuum effective action evaluated at an extremum. The latter can be viewed as a generalized bounce configuration, and gauge-independence follows from the appropriate Nielsen identities. This holds for any election of gauge-fixing that leads to an invertible Faddeev-Popov matrix.

5. An easy path to convex analysis and applications

CERN Document Server

Mordukhovich, Boris S

2013-01-01

Convex optimization has an increasing impact on many areas of mathematics, applied sciences, and practical applications. It is now being taught at many universities and being used by researchers of different fields. As convex analysis is the mathematical foundation for convex optimization, having deep knowledge of convex analysis helps students and researchers apply its tools more effectively. The main goal of this book is to provide an easy access to the most fundamental parts of convex analysis and its applications to optimization. Modern techniques of variational analysis are employed to cl

6. Convex geometry of quantum resource quantification

Science.gov (United States)

Regula, Bartosz

2018-01-01

We introduce a framework unifying the mathematical characterisation of different measures of general quantum resources and allowing for a systematic way to define a variety of faithful quantifiers for any given convex quantum resource theory. The approach allows us to describe many commonly used measures such as matrix norm-based quantifiers, robustness measures, convex roof-based measures, and witness-based quantifiers together in a common formalism based on the convex geometry of the underlying sets of resource-free states. We establish easily verifiable criteria for a measure to possess desirable properties such as faithfulness and strong monotonicity under relevant free operations, and show that many quantifiers obtained in this framework indeed satisfy them for any considered quantum resource. We derive various bounds and relations between the measures, generalising and providing significantly simplified proofs of results found in the resource theories of quantum entanglement and coherence. We also prove that the quantification of resources in this framework simplifies for pure states, allowing us to obtain more easily computable forms of the considered measures, and show that many of them are in fact equal on pure states. Further, we investigate the dual formulation of resource quantifiers, which provide a characterisation of the sets of resource witnesses. We present an explicit application of the results to the resource theories of multi-level coherence, entanglement of Schmidt number k, multipartite entanglement, as well as magic states, providing insight into the quantification of the four resources by establishing novel quantitative relations and introducing new quantifiers, such as a measure of entanglement of Schmidt number k which generalises the convex roof-extended negativity, a measure of k-coherence which generalises the \

7. On the convexity of relativistic hydrodynamics

International Nuclear Information System (INIS)

Ibáñez, José M; Martí, José M; Cordero-Carrión, Isabel; Miralles, Juan A

2013-01-01

The relativistic hydrodynamic system of equations for a perfect fluid obeying a causal equation of state is hyperbolic (Anile 1989 Relativistic Fluids and Magneto-Fluids (Cambridge: Cambridge University Press)). In this report, we derive the conditions for this system to be convex in terms of the fundamental derivative of the equation of state (Menikoff and Plohr1989 Rev. Mod. Phys. 61 75). The classical limit is recovered. Communicated by L Rezzolla (note)

8. Dynamic Convex Duality in Constrained Utility Maximization

OpenAIRE

Li, Yusong; Zheng, Harry

2016-01-01

In this paper, we study a constrained utility maximization problem following the convex duality approach. After formulating the primal and dual problems, we construct the necessary and sufficient conditions for both the primal and dual problems in terms of FBSDEs plus additional conditions. Such formulation then allows us to explicitly characterize the primal optimal control as a function of the adjoint process coming from the dual FBSDEs in a dynamic fashion and vice versa. Moreover, we also...

9. Optimal skill distribution under convex skill costs

Directory of Open Access Journals (Sweden)

Tin Cheuk Leung

2018-03-01

Full Text Available This paper studies optimal distribution of skills in an optimal income tax framework with convex skill constraints. The problem is cast as a social planning problem where a redistributive planner chooses how to distribute a given amount of aggregate skills across people. We find that optimal skill distribution is either perfectly equal or perfectly unequal, but an interior level of skill inequality is never optimal.

10. The occipital lobe convexity sulci and gyri.

Science.gov (United States)

Alves, Raphael V; Ribas, Guilherme C; Párraga, Richard G; de Oliveira, Evandro

2012-05-01

The anatomy of the occipital lobe convexity is so intricate and variable that its precise description is not found in the classic anatomy textbooks, and the occipital sulci and gyri are described with different nomenclatures according to different authors. The aim of this study was to investigate and describe the anatomy of the occipital lobe convexity and clarify its nomenclature. The configurations of sulci and gyri on the lateral surface of the occipital lobe of 20 cerebral hemispheres were examined in order to identify the most characteristic and consistent patterns. The most characteristic and consistent occipital sulci identified in this study were the intraoccipital, transverse occipital, and lateral occipital sulci. The morphology of the transverse occipital sulcus and the intraoccipital sulcus connection was identified as the most important aspect to define the gyral pattern of the occipital lobe convexity. Knowledge of the main features of the occipital sulci and gyri permits the recognition of a basic configuration of the occipital lobe and the identification of its sulcal and gyral variations.

11. Convex Hull Aided Registration Method (CHARM).

Science.gov (United States)

Fan, Jingfan; Yang, Jian; Zhao, Yitian; Ai, Danni; Liu, Yonghuai; Wang, Ge; Wang, Yongtian

2017-09-01

Non-rigid registration finds many applications such as photogrammetry, motion tracking, model retrieval, and object recognition. In this paper we propose a novel convex hull aided registration method (CHARM) to match two point sets subject to a non-rigid transformation. First, two convex hulls are extracted from the source and target respectively. Then, all points of the point sets are projected onto the reference plane through each triangular facet of the hulls. From these projections, invariant features are extracted and matched optimally. The matched feature point pairs are mapped back onto the triangular facets of the convex hulls to remove outliers that are outside any relevant triangular facet. The rigid transformation from the source to the target is robustly estimated by the random sample consensus (RANSAC) scheme through minimizing the distance between the matched feature point pairs. Finally, these feature points are utilized as the control points to achieve non-rigid deformation in the form of thin-plate spline of the entire source point set towards the target one. The experimental results based on both synthetic and real data show that the proposed algorithm outperforms several state-of-the-art ones with respect to sampling, rotational angle, and data noise. In addition, the proposed CHARM algorithm also shows higher computational efficiency compared to these methods.

12. Generalized vector calculus on convex domain

Science.gov (United States)

Agrawal, Om P.; Xu, Yufeng

2015-06-01

In this paper, we apply recently proposed generalized integral and differential operators to develop generalized vector calculus and generalized variational calculus for problems defined over a convex domain. In particular, we present some generalization of Green's and Gauss divergence theorems involving some new operators, and apply these theorems to generalized variational calculus. For fractional power kernels, the formulation leads to fractional vector calculus and fractional variational calculus for problems defined over a convex domain. In special cases, when certain parameters take integer values, we obtain formulations for integer order problems. Two examples are presented to demonstrate applications of the generalized variational calculus which utilize the generalized vector calculus developed in the paper. The first example leads to a generalized partial differential equation and the second example leads to a generalized eigenvalue problem, both in two dimensional convex domains. We solve the generalized partial differential equation by using polynomial approximation. A special case of the second example is a generalized isoperimetric problem. We find an approximate solution to this problem. Many physical problems containing integer order integrals and derivatives are defined over arbitrary domains. We speculate that future problems containing fractional and generalized integrals and derivatives in fractional mechanics will be defined over arbitrary domains, and therefore, a general variational calculus incorporating a general vector calculus will be needed for these problems. This research is our first attempt in that direction.

13. Convexities move because they contain matter.

Science.gov (United States)

Barenholtz, Elan

2010-09-22

Figure-ground assignment to a contour is a fundamental stage in visual processing. The current paper introduces a novel, highly general dynamic cue to figure-ground assignment: "Convex Motion." Across six experiments, subjects showed a strong preference to assign figure and ground to a dynamically deforming contour such that the moving contour segment was convex rather than concave. Experiments 1 and 2 established the preference across two different kinds of deformational motion. Additional experiments determined that this preference was not due to fixation (Experiment 3) or attentional mechanisms (Experiment 4). Experiment 5 found a similar, but reduced bias for rigid-as opposed to deformational-motion, and Experiment 6 demonstrated that the phenomenon depends on the global motion of the effected contour. An explanation of this phenomenon is presented on the basis of typical natural deformational motion, which tends to involve convex contour projections that contain regions consisting of physical "matter," as opposed to concave contour indentations that contain empty space. These results highlight the fundamental relationship between figure and ground, perceived shape, and the inferred physical properties of an object.

14. Neuro-genetic hybrid approach for the solution of non-convex economic dispatch problem

International Nuclear Information System (INIS)

Malik, T.N.; Asar, A.U.

2009-01-01

ED (Economic Dispatch) is non-convex constrained optimization problem, and is used for both on line and offline studies in power system operation. Conventionally, it is solved as convex problem using optimization techniques by approximating generator input/output characteristic. Curves of monotonically increasing nature thus resulting in an inaccurate dispatch. The GA (Genetic Algorithm) has been used for the solution of this problem owing to its inherent ability to address the convex and non-convex problems equally. This approach brings the solution to the global minimum region of search space in a short time and then takes longer time to converge to near optimal results. GA based hybrid approaches are used to fine tune the near optimal results produced by GA. This paper proposes NGH (Neuro Genetic Hybrid) approach to solve the economic dispatch with valve point effect. The proposed approach combines the GA with the ANN (Artificial Neural Network) using SI (Swarm Intelligence) learning rule. The GA acts as a global optimizer and the neural network fine tunes the GA results to the desired targets. Three machines standard test system has been tested for validation of the approach. Comparing the results with GA and NGH model based on back-propagation learning, the proposed approach gives contrast improvements showing the promise of the approach. (author)

15. Some solvable, and as yet unsolvable, polygon and walk models

International Nuclear Information System (INIS)

Guttmann, Anthony J

2006-01-01

One partly solvable and two solvable models of polygons are discussed. Using a simple transfer matrix approach Iwan Jensen has derived very long series expansions for the perimeter generating function of both three-choice polygons and punctured staircase polygons. In both cases it is found that all the terms in the generating function can be reproduced from a linear Fuchsian differential equation of order 8. We report on an analysis of the properties of the differential equations. Recently Enrica Duchi has discussed the problem of so-called prudent self-avoiding walks. We discuss the polygon analogue of this problem, and argue that the generating function for prudent polygons is unlikely to be differentiably finite, though a restricted version of the problem, called prudent polygons of the second type, is likely to be differentiably finite. The exact generating function for prudent polygons of the first type is also found

16. Mimetic finite difference method for the stokes problem on polygonal meshes

Energy Technology Data Exchange (ETDEWEB)

Lipnikov, K [Los Alamos National Laboratory; Beirao Da Veiga, L [DIPARTIMENTO DI MATE; Gyrya, V [PENNSYLVANIA STATE UNIV; Manzini, G [ISTIUTO DI MATEMATICA

2009-01-01

Various approaches to extend the finite element methods to non-traditional elements (pyramids, polyhedra, etc.) have been developed over the last decade. Building of basis functions for such elements is a challenging task and may require extensive geometry analysis. The mimetic finite difference (MFD) method has many similarities with low-order finite element methods. Both methods try to preserve fundamental properties of physical and mathematical models. The essential difference is that the MFD method uses only the surface representation of discrete unknowns to build stiffness and mass matrices. Since no extension inside the mesh element is required, practical implementation of the MFD method is simple for polygonal meshes that may include degenerate and non-convex elements. In this article, we develop a MFD method for the Stokes problem on arbitrary polygonal meshes. The method is constructed for tensor coefficients, which will allow to apply it to the linear elasticity problem. The numerical experiments show the second-order convergence for the velocity variable and the first-order for the pressure.

17. Calculus domains modelled using an original bool algebra based on polygons

Science.gov (United States)

Oanta, E.; Panait, C.; Raicu, A.; Barhalescu, M.; Axinte, T.

2016-08-01

Analytical and numerical computer based models require analytical definitions of the calculus domains. The paper presents a method to model a calculus domain based on a bool algebra which uses solid and hollow polygons. The general calculus relations of the geometrical characteristics that are widely used in mechanical engineering are tested using several shapes of the calculus domain in order to draw conclusions regarding the most effective methods to discretize the domain. The paper also tests the results of several CAD commercial software applications which are able to compute the geometrical characteristics, being drawn interesting conclusions. The tests were also targeting the accuracy of the results vs. the number of nodes on the curved boundary of the cross section. The study required the development of an original software consisting of more than 1700 computer code lines. In comparison with other calculus methods, the discretization using convex polygons is a simpler approach. Moreover, this method doesn't lead to large numbers as the spline approximation did, in that case being required special software packages in order to offer multiple, arbitrary precision. The knowledge resulted from this study may be used to develop complex computer based models in engineering.

18. Environmental protection stability of river bed and banks using convex, concave, and linear bed sills.

Science.gov (United States)

Keshavarzi, Alireza; Noori, Lila Khaje

2010-12-01

River bed scourings are a major environmental problem for fish and aquatic habitat resources. In this study, to prevent river bed and banks from scouring, different types of bed sills including convex, concave and linear patterns were installed in a movable channel bed in a laboratory flume. The bed sills were tested with nine different arrangements and under different flow conditions. To find the most effective bed sill pattern, the scouring depth was measured downstream of the bed sill for a long experimental duration. The scour depth was measured at the middle and at the end of each experimental test for different ratios of the arch radius to the channel width [r/w]. The experimental results indicated that the convex pattern with r/w=0.35 produced minimum bed scouring depth at the center line whereas the concave pattern with r/w=0.23 produced the minimum scour depth at the wall banks. Therefore, the convex pattern was the most effective configuration for prevention of scouring at the center line of the river while the concave pattern was very effective to prevent scouring at the river banks. These findings can be suggested to be used in practical applications.

19. Self-assembly of chiral molecular polygons.

Science.gov (United States)

Jiang, Hua; Lin, Wenbin

2003-07-09

Treatment of 2,2'-diacetyl-1,1'-binaphthyl-6,6'-bis(ethyne), L-H2, with 1 equiv of trans-Pt(PEt3)2Cl2 led to a mixture of different sizes of chiral metallocycles [trans-(PEt3)2Pt(L)]n (n = 3-8, 1-6). Each of the chiral molecular polygons 1-6 was purified by silica gel column chromatography and characterized by 1H, 13C{1H}, and 31P{1H} NMR spectroscopy, MS, IR, UV-vis, and circular dichroism spectroscopies, and microanalysis. The presence of tunable cavities (1.4-4.3 nm) and chiral functionalities in these molecular polygons promises to make them excellent receptors for a variety of guests.

20. Simulating 3D deformation using connected polygons

Science.gov (United States)

Tarigan, J. T.; Jaya, I.; Hardi, S. M.; Zamzami, E. M.

2018-03-01

In modern 3D application, interaction between user and the virtual world is one of an important factor to increase the realism. This interaction can be visualized in many forms; one of them is object deformation. There are many ways to simulate object deformation in virtual 3D world; each comes with different level of realism and performance. Our objective is to present a new method to simulate object deformation by using a graph-connected polygon. In this solution, each object contains multiple level of polygons in different level of volume. The proposed solution focusses on performance rather while maintaining the acceptable level of realism. In this paper, we present the design and implementation of our solution and show that this solution is usable in performance sensitive 3D application such as games and virtual reality.

1. A Novel Shape-Free Plane Quadratic Polygonal Hybrid Stress-Function Element

Directory of Open Access Journals (Sweden)

Pei-Lei Zhou

2015-01-01

Full Text Available A novel plane quadratic shape-free hybrid stress-function (HS-F polygonal element is developed by employing the principle of minimum complementary energy and the fundamental analytical solutions of the Airy stress function. Without construction of displacement interpolation function, the formulations of the new model are much simpler than those of the displacement-based polygonal elements and can be degenerated into triangular or quadrilateral elements directly. In particular, it is quite insensitive to various mesh distortions and even can keep precision when element shape is concave. Furthermore, the element does not show any spurious zero energy modes. Numerical examples show the excellent performance of the new element, denoted by HSF-AP-19β, in both displacement and stress solutions.

2. Convex and Radially Concave Contoured Distributions

Directory of Open Access Journals (Sweden)

Wolf-Dieter Richter

2015-01-01

Full Text Available Integral representations of the locally defined star-generalized surface content measures on star spheres are derived for boundary spheres of balls being convex or radially concave with respect to a fan in Rn. As a result, the general geometric measure representation of star-shaped probability distributions and the general stochastic representation of the corresponding random vectors allow additional specific interpretations in the two mentioned cases. Applications to estimating and testing hypotheses on scaling parameters are presented, and two-dimensional sample clouds are simulated.

3. On conditional independence and log-convexity

Czech Academy of Sciences Publication Activity Database

Matúš, František

2012-01-01

Roč. 48, č. 4 (2012), s. 1137-1147 ISSN 0246-0203 R&D Projects: GA AV ČR IAA100750603; GA ČR GA201/08/0539 Institutional support: RVO:67985556 Keywords : Conditional independence * Markov properties * factorizable distributions * graphical Markov models * log-convexity * Gibbs- Markov equivalence * Markov fields * Gaussian distributions * positive definite matrices * covariance selection model Subject RIV: BA - General Mathematics Impact factor: 0.933, year: 2012 http://library.utia.cas.cz/separaty/2013/MTR/matus-0386229.pdf

4. Convex functions and optimization methods on Riemannian manifolds

CERN Document Server

Udrişte, Constantin

1994-01-01

This unique monograph discusses the interaction between Riemannian geometry, convex programming, numerical analysis, dynamical systems and mathematical modelling. The book is the first account of the development of this subject as it emerged at the beginning of the 'seventies. A unified theory of convexity of functions, dynamical systems and optimization methods on Riemannian manifolds is also presented. Topics covered include geodesics and completeness of Riemannian manifolds, variations of the p-energy of a curve and Jacobi fields, convex programs on Riemannian manifolds, geometrical constructions of convex functions, flows and energies, applications of convexity, descent algorithms on Riemannian manifolds, TC and TP programs for calculations and plots, all allowing the user to explore and experiment interactively with real life problems in the language of Riemannian geometry. An appendix is devoted to convexity and completeness in Finsler manifolds. For students and researchers in such diverse fields as pu...

5. CVXPY: A Python-Embedded Modeling Language for Convex Optimization

OpenAIRE

Diamond, Steven; Boyd, Stephen

2016-01-01

CVXPY is a domain-specific language for convex optimization embedded in Python. It allows the user to express convex optimization problems in a natural syntax that follows the math, rather than in the restrictive standard form required by solvers. CVXPY makes it easy to combine convex optimization with high-level features of Python such as parallelism and object-oriented design. CVXPY is available at http://www.cvxpy.org/ under the GPL license, along with documentation and examples.

6. CVXPY: A Python-Embedded Modeling Language for Convex Optimization.

Science.gov (United States)

Diamond, Steven; Boyd, Stephen

2016-04-01

CVXPY is a domain-specific language for convex optimization embedded in Python. It allows the user to express convex optimization problems in a natural syntax that follows the math, rather than in the restrictive standard form required by solvers. CVXPY makes it easy to combine convex optimization with high-level features of Python such as parallelism and object-oriented design. CVXPY is available at http://www.cvxpy.org/ under the GPL license, along with documentation and examples.

7. Convex blind image deconvolution with inverse filtering

Science.gov (United States)

Lv, Xiao-Guang; Li, Fang; Zeng, Tieyong

2018-03-01

Blind image deconvolution is the process of estimating both the original image and the blur kernel from the degraded image with only partial or no information about degradation and the imaging system. It is a bilinear ill-posed inverse problem corresponding to the direct problem of convolution. Regularization methods are used to handle the ill-posedness of blind deconvolution and get meaningful solutions. In this paper, we investigate a convex regularized inverse filtering method for blind deconvolution of images. We assume that the support region of the blur object is known, as has been done in a few existing works. By studying the inverse filters of signal and image restoration problems, we observe the oscillation structure of the inverse filters. Inspired by the oscillation structure of the inverse filters, we propose to use the star norm to regularize the inverse filter. Meanwhile, we use the total variation to regularize the resulting image obtained by convolving the inverse filter with the degraded image. The proposed minimization model is shown to be convex. We employ the first-order primal-dual method for the solution of the proposed minimization model. Numerical examples for blind image restoration are given to show that the proposed method outperforms some existing methods in terms of peak signal-to-noise ratio (PSNR), structural similarity (SSIM), visual quality and time consumption.

8. Effective potential for non-convex potentials

International Nuclear Information System (INIS)

Fujimoto, Y.; O'Raifeartaigh, L.; Parravicini, G.

1983-01-01

It is shown that the well-known relationship between the effective potential GAMMA and the vacuum graphs μ of scalar QFT follows directly from the translational invariance of the measure, and that it holds for all values of the fields phi if, and only if, the classical potential is convex. In the non-convex case μ appears to become complex for some values of phi, but it is shown that the complexity is only apparent and is due to the failure of the loop expansion. The effective potential actually remains real and well-defined for all phi, and reduces to μ in the neighbourhood of the classical minima. A number of examples are considered, notably potentials which are spontaneously broken. In particular the mechanism by which a spontaneous breakdown may be generated by radiative corrections is re-investigated and some new insights obtained. Finally, it is shown that the renormalization group equations for the parameters may be obtained by inspection from the effective potential, and among the examples considered are SU(n) fields and supermultiplets. In particular, it is shown that for supermultiplets the effective potential is not only real but positive. (orig.)

9. INdAM Workshop on Analytic Aspects of Convexity

CERN Document Server

Colesanti, Andrea; Gronchi, Paolo

2018-01-01

This book presents the proceedings of the international conference Analytic Aspects in Convexity, which was held in Rome in October 2016. It offers a collection of selected articles, written by some of the world’s leading experts in the field of Convex Geometry, on recent developments in this area: theory of valuations; geometric inequalities; affine geometry; and curvature measures. The book will be of interest to a broad readership, from those involved in Convex Geometry, to those focusing on Functional Analysis, Harmonic Analysis, Differential Geometry, or PDEs. The book is a addressed to PhD students and researchers, interested in Convex Geometry and its links to analysis.

10. Generating random walks and polygons with stiffness in confinement

International Nuclear Information System (INIS)

Diao, Y; Ernst, C; Saarinen, S; Ziegler, U

2015-01-01

The purpose of this paper is to explore ways to generate random walks and polygons in confinement with a bias toward stiffness. Here the stiffness refers to the curvature angle between two consecutive edges along the random walk or polygon. The stiffer the walk (polygon), the smaller this angle on average. Thus random walks and polygons with an elevated stiffness have lower than expected curvatures. The authors introduced and studied several generation algorithms with a stiffness parameter s>0 that regulates the expected curvature angle at a given vertex in which the random walks and polygons are generated one edge at a time using conditional probability density functions. Our generating algorithms also allow the generation of unconfined random walks and polygons with any desired mean curvature angle. In the case of random walks and polygons confined in a sphere of fixed radius, we observe that, as expected, stiff random walks or polygons are more likely to be close to the confinement boundary. The methods developed here require that the random walks and random polygons be rooted at the center of the confinement sphere. (paper)

11. The magnetic field generated by a rotating charged polygon

International Nuclear Information System (INIS)

Wan, Songlin; Chen, Xiangyu; Teng, Baohua; Fu, Hao; Li, Yefeng; Wu, Minghe; Wu, Shaoyi; Balfour, E A

2014-01-01

The magnetic field along the symmetry axis of a regular polygon carrying a uniform electric charge on its edges is calculated systematically when the polygon is rotated about this axis of symmetry. A group of circular current-carrying coils arranged concentrically about the axis of the polygon has been designed to simulate the magnetic field characteristics of the rotating charged polygon. The magnetic field of the simulated coils is measured using the PASCO magnetic field sensor. The results show that the theoretical calculation agrees well with the experimental results. (paper)

12. Polygonal-path approximations on the path spaces of quantum-mechanical systems: properties of the polygonal paths

International Nuclear Information System (INIS)

Exner, P.; Kolerov, G.I.

1981-01-01

Properties of the subset of polygonal paths in the Hilbert space H of paths referring to a d-dimensional quantum-mechanical system are examined. Using the reproduction kernel technique we prove that each element of H is approximated by polygonal paths uniformly with respect to the ''norm'' of time-interval partitions. This result will be applied in the second part of the present paper to prove consistency of the uniform polygonal-path extension of the Feynman maps [ru

13. Multi-Period Trading via Convex Optimization

DEFF Research Database (Denmark)

Boyd, Stephen; Busseti, Enzo; Diamond, Steve

2017-01-01

We consider a basic model of multi-period trading, which can be used to evaluate the performance of a trading strategy. We describe a framework for single-period optimization, where the trades in each period are found by solving a convex optimization problem that trades oﬀ expected return, risk......, transaction cost and holding cost such as the borrowing cost for shorting assets. We then describe a multi-period version of the trading method, where optimization is used to plan a sequence of trades, with only the ﬁrst one executed, using estimates of future quantities that are unknown when the trades....... In this paper, we do not address a critical component in a trading algorithm, the predictions or forecasts of future quantities. The methods we describe in this paper can be thought of as good ways to exploit predictions, no matter how they are made. We have also developed a companion open-source software...

14. SU-F-T-340: Direct Editing of Dose Volume Histograms: Algorithms and a Unified Convex Formulation for Treatment Planning with Dose Constraints

Energy Technology Data Exchange (ETDEWEB)

Ungun, B [Stanford University, Stanford, CA (United States); Stanford University School of Medicine, Stanford, CA (United States); Fu, A; Xing, L [Stanford University School of Medicine, Stanford, CA (United States); Boyd, S [Stanford University, Stanford, CA (United States)

2016-06-15

Purpose: To develop a procedure for including dose constraints in convex programming-based approaches to treatment planning, and to support dynamic modification of such constraints during planning. Methods: We present a mathematical approach that allows mean dose, maximum dose, minimum dose and dose volume (i.e., percentile) constraints to be appended to any convex formulation of an inverse planning problem. The first three constraint types are convex and readily incorporated. Dose volume constraints are not convex, however, so we introduce a convex restriction that is related to CVaR-based approaches previously proposed in the literature. To compensate for the conservatism of this restriction, we propose a new two-pass algorithm that solves the restricted problem on a first pass and uses this solution to form exact constraints on a second pass. In another variant, we introduce slack variables for each dose constraint to prevent the problem from becoming infeasible when the user specifies an incompatible set of constraints. We implement the proposed methods in Python using the convex programming package cvxpy in conjunction with the open source convex solvers SCS and ECOS. Results: We show, for several cases taken from the clinic, that our proposed method meets specified constraints (often with margin) when they are feasible. Constraints are met exactly when we use the two-pass method, and infeasible constraints are replaced with the nearest feasible constraint when slacks are used. Finally, we introduce ConRad, a Python-embedded free software package for convex radiation therapy planning. ConRad implements the methods described above and offers a simple interface for specifying prescriptions and dose constraints. Conclusion: This work demonstrates the feasibility of using modifiable dose constraints in a convex formulation, making it practical to guide the treatment planning process with interactively specified dose constraints. This work was supported by the

15. SU-F-T-340: Direct Editing of Dose Volume Histograms: Algorithms and a Unified Convex Formulation for Treatment Planning with Dose Constraints

International Nuclear Information System (INIS)

Ungun, B; Fu, A; Xing, L; Boyd, S

2016-01-01

Purpose: To develop a procedure for including dose constraints in convex programming-based approaches to treatment planning, and to support dynamic modification of such constraints during planning. Methods: We present a mathematical approach that allows mean dose, maximum dose, minimum dose and dose volume (i.e., percentile) constraints to be appended to any convex formulation of an inverse planning problem. The first three constraint types are convex and readily incorporated. Dose volume constraints are not convex, however, so we introduce a convex restriction that is related to CVaR-based approaches previously proposed in the literature. To compensate for the conservatism of this restriction, we propose a new two-pass algorithm that solves the restricted problem on a first pass and uses this solution to form exact constraints on a second pass. In another variant, we introduce slack variables for each dose constraint to prevent the problem from becoming infeasible when the user specifies an incompatible set of constraints. We implement the proposed methods in Python using the convex programming package cvxpy in conjunction with the open source convex solvers SCS and ECOS. Results: We show, for several cases taken from the clinic, that our proposed method meets specified constraints (often with margin) when they are feasible. Constraints are met exactly when we use the two-pass method, and infeasible constraints are replaced with the nearest feasible constraint when slacks are used. Finally, we introduce ConRad, a Python-embedded free software package for convex radiation therapy planning. ConRad implements the methods described above and offers a simple interface for specifying prescriptions and dose constraints. Conclusion: This work demonstrates the feasibility of using modifiable dose constraints in a convex formulation, making it practical to guide the treatment planning process with interactively specified dose constraints. This work was supported by the

16. A simple algorithm for calculating the area of an arbitrary polygon

Directory of Open Access Journals (Sweden)

K.R. Wijeweera

2017-06-01

Full Text Available Computing the area of an arbitrary polygon is a popular problem in pure mathematics. The two methods used are Shoelace Method (SM and Orthogonal Trapezoids Method (OTM. In OTM, the polygon is partitioned into trapezoids by drawing either horizontal or vertical lines through its vertices. The area of each trapezoid is computed and the resultant areas are added up. In SM, a formula which is a generalization of Green’s Theorem for the discrete case is used. The most of the available systems is based on SM. Since an algorithm for OTM is not available in literature, this paper proposes an algorithm for OTM along with efficient implementation. Conversion of a pure mathematical method into an efficient computer program is not straightforward. In order to reduce the run time, minimal computation needs to be achieved. Handling of indeterminate forms and special cases separately can support this. On the other hand, precision error should also be avoided. Salient feature of the proposed algorithm is that it successfully handles these situations achieving minimum run time. Experimental results of the proposed method are compared against that of the existing algorithm. However, the proposed algorithm suggests a way to partition a polygon into orthogonal trapezoids which is not an easy task. Additionally, the proposed algorithm uses only basic mathematical concepts while the Green’s theorem uses complicated mathematical concepts. The proposed algorithm can be used when the simplicity is important than the speed.

17. Conditionally exponential convex functions on locally compact groups

International Nuclear Information System (INIS)

Okb El-Bab, A.S.

1992-09-01

The main results of the thesis are: 1) The construction of a compact base for the convex cone of all conditionally exponential convex functions. 2) The determination of the extreme parts of this cone. Some supplementary lemmas are proved for this purpose. (author). 8 refs

18. Approximate convex hull of affine iterated function system attractors

International Nuclear Information System (INIS)

Mishkinis, Anton; Gentil, Christian; Lanquetin, Sandrine; Sokolov, Dmitry

2012-01-01

Highlights: ► We present an iterative algorithm to approximate affine IFS attractor convex hull. ► Elimination of the interior points significantly reduces the complexity. ► To optimize calculations, we merge the convex hull images at each iteration. ► Approximation by ellipses increases speed of convergence to the exact convex hull. ► We present a method of the output convex hull simplification. - Abstract: In this paper, we present an algorithm to construct an approximate convex hull of the attractors of an affine iterated function system (IFS). We construct a sequence of convex hull approximations for any required precision using the self-similarity property of the attractor in order to optimize calculations. Due to the affine properties of IFS transformations, the number of points considered in the construction is reduced. The time complexity of our algorithm is a linear function of the number of iterations and the number of points in the output approximate convex hull. The number of iterations and the execution time increases logarithmically with increasing accuracy. In addition, we introduce a method to simplify the approximate convex hull without loss of accuracy.

19. Entropy coherent and entropy convex measures of risk

NARCIS (Netherlands)

2010-01-01

We introduce entropy coherent and entropy convex measures of risk and prove a collection of axiomatic characterization and duality results. We show in particular that entropy coherent and entropy convex measures of risk emerge as negative certainty equivalents in (the regular and a generalized

20. Convexity-preserving Bernstein–Bézier quartic scheme

Directory of Open Access Journals (Sweden)

Maria Hussain

2014-07-01

Full Text Available A C1 convex surface data interpolation scheme is presented to preserve the shape of scattered data arranged over a triangular grid. Bernstein–Bézier quartic function is used for interpolation. Lower bound of the boundary and inner Bézier ordinates is determined to guarantee convexity of surface. The developed scheme is flexible and involves more relaxed constraints.

1. Convergence of Algorithms for Reconstructing Convex Bodies and Directional Measures

DEFF Research Database (Denmark)

Gardner, Richard; Kiderlen, Markus; Milanfar, Peyman

2006-01-01

We investigate algorithms for reconstructing a convex body K in Rn from noisy measurements of its support function or its brightness function in k directions u1, . . . , uk. The key idea of these algorithms is to construct a convex polytope Pk whose support function (or brightness function) best...

2. On approximation and energy estimates for delta 6-convex functions.

Science.gov (United States)

2018-01-01

The smooth approximation and weighted energy estimates for delta 6-convex functions are derived in this research. Moreover, we conclude that if 6-convex functions are closed in uniform norm, then their third derivatives are closed in weighted [Formula: see text]-norm.

3. On approximation and energy estimates for delta 6-convex functions

Directory of Open Access Journals (Sweden)

2018-02-01

Full Text Available Abstract The smooth approximation and weighted energy estimates for delta 6-convex functions are derived in this research. Moreover, we conclude that if 6-convex functions are closed in uniform norm, then their third derivatives are closed in weighted L2 $L^{2}$-norm.

4. STRICT CONVEXITY THROUGH EQUIVALENT NORMS IN SEPARABLES BANACH SPACES

Directory of Open Access Journals (Sweden)

Willy Zubiaga Vera

2016-12-01

Full Text Available Let E be a separable Banach space with norm || . ||. In the present work, the objective is to construct a norm || . ||1 that is equivalent to || . || in E, such that || . ||1 is strictly convex. In addition it is shown that its dual conjugate norm is also strictly convex.

5. Fundamentals of convex analysis duality, separation, representation, and resolution

CERN Document Server

Panik, Michael J

1993-01-01

Fundamentals of Convex Analysis offers an in-depth look at some of the fundamental themes covered within an area of mathematical analysis called convex analysis. In particular, it explores the topics of duality, separation, representation, and resolution. The work is intended for students of economics, management science, engineering, and mathematics who need exposure to the mathematical foundations of matrix games, optimization, and general equilibrium analysis. It is written at the advanced undergraduate to beginning graduate level and the only formal preparation required is some familiarity with set operations and with linear algebra and matrix theory. Fundamentals of Convex Analysis is self-contained in that a brief review of the essentials of these tool areas is provided in Chapter 1. Chapter exercises are also provided. Topics covered include: convex sets and their properties; separation and support theorems; theorems of the alternative; convex cones; dual homogeneous systems; basic solutions and comple...

6. Finding the Maximal Area of Bounded Polygons in a Circle

Science.gov (United States)

Rokach, Arie

2005-01-01

The article deals with the area of polygons that are inscribed in a given circle. Naturally, the following question arises: Among all n-polygons that are inscribed in a given circle, which one has the biggest area? Intuitively, it may be guessed that is suitable for secondary students, and without any use id calculus, but only using very…

7. Beam envelope profile of non-centrosymmetric polygonal phase space

International Nuclear Information System (INIS)

Chen Yinbao; Xie Xi

1984-01-01

The general theory of beam envelope profile of non-centrosymmetric polygonal phase space is developed. By means of this theory the beam envelope profile of non-centrosymmetric polygonal phase space can be calculated directly. An example is carried out in detail to show the practical application of the theory

8. Hamiltonian evolutions of twisted polygons in RPn

International Nuclear Information System (INIS)

Beffa, Gloria Marì; Wang, Jing Ping

2013-01-01

In this paper we find a discrete moving frame and their associated invariants along projective polygons in RP n , and we use them to describe invariant evolutions of projective N-gons. We then apply a reduction process to obtain a natural Hamiltonian structure on the space of projective invariants for polygons, establishing a close relationship between the projective N-gon invariant evolutions and the Hamiltonian evolutions on the invariants of the flow. We prove that any Hamiltonian evolution is induced on invariants by an invariant evolution of N-gons—what we call a projective realization—and both evolutions are connected explicitly in a very simple way. Finally, we provide a completely integrable evolution (the Boussinesq lattice related to the lattice W 3 -algebra), its projective realization in RP 2 and its Hamiltonian pencil. We generalize both structures to n-dimensions and we prove that they are Poisson, defining explicitly the n-dimensional generalization of the planar evolution (a discretization of the W n -algebra). We prove that the generalization is completely integrable, and we also give its projective realization, which turns out to be very simple. (paper)

9. Linking of uniform random polygons in confined spaces

Science.gov (United States)

Arsuaga, J.; Blackstone, T.; Diao, Y.; Karadayi, E.; Saito, M.

2007-03-01

In this paper, we study the topological entanglement of uniform random polygons in a confined space. We derive the formula for the mean squared linking number of such polygons. For a fixed simple closed curve in the confined space, we rigorously show that the linking probability between this curve and a uniform random polygon of n vertices is at least 1-O\\big(\\frac{1}{\\sqrt{n}}\\big) . Our numerical study also indicates that the linking probability between two uniform random polygons (in a confined space), of m and n vertices respectively, is bounded below by 1-O\\big(\\frac{1}{\\sqrt{mn}}\\big) . In particular, the linking probability between two uniform random polygons, both of n vertices, is bounded below by 1-O\\big(\\frac{1}{n}\\big) .

10. Linking of uniform random polygons in confined spaces

International Nuclear Information System (INIS)

Arsuaga, J; Blackstone, T; Diao, Y; Karadayi, E; Saito, M

2007-01-01

In this paper, we study the topological entanglement of uniform random polygons in a confined space. We derive the formula for the mean squared linking number of such polygons. For a fixed simple closed curve in the confined space, we rigorously show that the linking probability between this curve and a uniform random polygon of n vertices is at least 1-O(1/√n). Our numerical study also indicates that the linking probability between two uniform random polygons (in a confined space), of m and n vertices respectively, is bounded below by 1-O(1/√(mn)). In particular, the linking probability between two uniform random polygons, both of n vertices, is bounded below by 1-O(1/n)

11. On evolving deformation microstructures in non-convex partially damaged solids

KAUST Repository

Gurses, Ercan

2011-06-01

The paper outlines a relaxation method based on a particular isotropic microstructure evolution and applies it to the model problem of rate independent, partially damaged solids. The method uses an incremental variational formulation for standard dissipative materials. In an incremental setting at finite time steps, the formulation defines a quasi-hyperelastic stress potential. The existence of this potential allows a typical incremental boundary value problem of damage mechanics to be expressed in terms of a principle of minimum incremental work. Mathematical existence theorems of minimizers then induce a definition of the material stability in terms of the sequential weak lower semicontinuity of the incremental functional. As a consequence, the incremental material stability of standard dissipative solids may be defined in terms of weak convexity notions of the stress potential. Furthermore, the variational setting opens up the possibility to analyze the development of deformation microstructures in the post-critical range of unstable inelastic materials based on energy relaxation methods. In partially damaged solids, accumulated damage may yield non-convex stress potentials which indicate instability and formation of fine-scale microstructures. These microstructures can be resolved by use of relaxation techniques associated with the construction of convex hulls. We propose a particular relaxation method for partially damaged solids and investigate it in one- and multi-dimensional settings. To this end, we introduce a new isotropic microstructure which provides a simple approximation of the multi-dimensional rank-one convex hull. The development of those isotropic microstructures is investigated for homogeneous and inhomogeneous numerical simulations. © 2011 Elsevier Ltd. All rights reserved.

12. A formational model for the polygonal terrains of Mars: Taking a crack at the genesis of the Martian polygons

Science.gov (United States)

Wenrich, M. L.; Christensen, P. R.

1993-01-01

The mechanism for the genesis of the polygonal terrains in Acidalia and Utopia Planitia has long been sought: however, no completely satisfying model was put forth that characterizes the evolution of these complexly patterned terrains. The polygons are roughly hexagonal but some are not entirely enclosed by fractures. These polygonal features range in widths from approximately 5 to 20 km. Several origins were proposed that describe the polygon borders as desiccation cracks, columnar jointing in a cooled lava, or frost-wedge features. These tension-induced cracking hypotheses were addressed by Pechmann, who convincingly disputes these mechanisms of formation based on scale magnitude difficulties and morphology. Pechmann suggests instead that the cracks delineating the 5-20-km-wide polygons on the northern plains of Mars are graben resulting from deep-seated, uniform, horizontal tension. The difficulty with this hypothesis is that no analogous polygonal forms are known to have originated by tectonism on Earth. McGill and Hills propose that the polygonal terrains on Mars resulted from either rapid desiccation of sediments or cooling of volcanics coupled with differential compaction of the material over a buried irregular topographic surface. They suggest that fracturing was enhanced over the areas of positive relief and was suppressed above the topographic lows. McGill and Hills suggest that the spacing of the topographic highs primarily controls the size of the Martian polygons and the physics of the shrinkage process is a secondary concern. Ray et. al. conducted a terrestrial study of patterned ground in periglacial areas of the U.S. to determine the process responsible for polygonal ground formation. They developed a model for polygon formation in which convection of seasonal melt water above a permafrost layer, driven by an unstable density stratification, differentially melts the permafrost interface, causing it to become undulatory.

13. Scaling behavior of knotted random polygons and self-avoiding polygons: Topological swelling with enhanced exponent.

Science.gov (United States)

Uehara, Erica; Deguchi, Tetsuo

2017-12-07

We show that the average size of self-avoiding polygons (SAPs) with a fixed knot is much larger than that of no topological constraint if the excluded volume is small and the number of segments is large. We call it topological swelling. We argue an "enhancement" of the scaling exponent for random polygons with a fixed knot. We study them systematically through SAP consisting of hard cylindrical segments with various different values of the radius of segments. Here we mean by the average size the mean-square radius of gyration. Furthermore, we show numerically that the topological balance length of a composite knot is given by the sum of those of all constituent prime knots. Here we define the topological balance length of a knot by such a number of segments that topological entropic repulsions are balanced with the knot complexity in the average size. The additivity suggests the local knot picture.

14. Decomposability and convex structure of thermal processes

Science.gov (United States)

Mazurek, Paweł; Horodecki, Michał

2018-05-01

We present an example of a thermal process (TP) for a system of d energy levels, which cannot be performed without an instant access to the whole energy space. This TP is uniquely connected with a transition between some states of the system, that cannot be performed without access to the whole energy space even when approximate transitions are allowed. Pursuing the question about the decomposability of TPs into convex combinations of compositions of processes acting non-trivially on smaller subspaces, we investigate transitions within the subspace of states diagonal in the energy basis. For three level systems, we determine the set of extremal points of these operations, as well as the minimal set of operations needed to perform an arbitrary TP, and connect the set of TPs with thermomajorization criterion. We show that the structure of the set depends on temperature, which is associated with the fact that TPs cannot increase deterministically extractable work from a state—the conclusion that holds for arbitrary d level system. We also connect the decomposability problem with detailed balance symmetry of an extremal TPs.

15. Designing Camera Networks by Convex Quadratic Programming

KAUST Repository

Ghanem, Bernard

2015-05-04

​In this paper, we study the problem of automatic camera placement for computer graphics and computer vision applications. We extend the problem formulations of previous work by proposing a novel way to incorporate visibility constraints and camera-to-camera relationships. For example, the placement solution can be encouraged to have cameras that image the same important locations from different viewing directions, which can enable reconstruction and surveillance tasks to perform better. We show that the general camera placement problem can be formulated mathematically as a convex binary quadratic program (BQP) under linear constraints. Moreover, we propose an optimization strategy with a favorable trade-off between speed and solution quality. Our solution is almost as fast as a greedy treatment of the problem, but the quality is significantly higher, so much so that it is comparable to exact solutions that take orders of magnitude more computation time. Because it is computationally attractive, our method also allows users to explore the space of solutions for variations in input parameters. To evaluate its effectiveness, we show a range of 3D results on real-world floorplans (garage, hotel, mall, and airport). ​

16. Visualizing Data as Objects by DC (Difference of Convex) Optimization

DEFF Research Database (Denmark)

Carrizosa, Emilio; Guerrero, Vanesa; Morales, Dolores Romero

2018-01-01

In this paper we address the problem of visualizing in a bounded region a set of individuals, which has attached a dissimilarity measure and a statistical value, as convex objects. This problem, which extends the standard Multidimensional Scaling Analysis, is written as a global optimization...... problem whose objective is the difference of two convex functions (DC). Suitable DC decompositions allow us to use the Difference of Convex Algorithm (DCA) in a very efficient way. Our algorithmic approach is used to visualize two real-world datasets....

17. Rotational Fourier tracking of diffusing polygons.

Science.gov (United States)

Mayoral, Kenny; Kennair, Terry P; Zhu, Xiaoming; Milazzo, James; Ngo, Kathy; Fryd, Michael M; Mason, Thomas G

2011-11-01

We use optical microscopy to measure the rotational Brownian motion of polygonal platelets that are dispersed in a liquid and confined by depletion attractions near a wall. The depletion attraction inhibits out-of-plane translational and rotational Brownian fluctuations, thereby facilitating in-plane imaging and video analysis. By taking fast Fourier transforms (FFTs) of the images and analyzing the angular position of rays in the FFTs, we determine an isolated particle's rotational trajectory, independent of its position. The measured in-plane rotational diffusion coefficients are significantly smaller than estimates for the bulk; this difference is likely due to the close proximity of the particles to the wall arising from the depletion attraction.

18. High speed printing with polygon scan heads

Science.gov (United States)

Stutz, Glenn

2016-03-01

To reduce and in many cases eliminate the costs associated with high volume printing of consumer and industrial products, this paper investigates and validates the use of the new generation of high speed pulse on demand (POD) lasers in concert with high speed (HS) polygon scan heads (PSH). Associated costs include consumables such as printing ink and nozzles, provisioning labor, maintenance and repair expense as well as reduction of printing lines due to high through put. Targets that are applicable and investigated include direct printing on plastics, printing on paper/cardboard as well as printing on labels. Market segments would include consumer products (CPG), medical and pharmaceutical products, universal ID (UID), and industrial products. In regards to the POD lasers employed, the wavelengths include UV(355nm), Green (532nm) and IR (1064nm) operating within the repetition range of 180 to 250 KHz.

19. Self-avoiding polygons and walks in slits

International Nuclear Information System (INIS)

Alvarez, J; Whittington, S G; Rensburg, E J Janse van; Soteros, C E

2008-01-01

A polymer in a confined geometry may be modeled by a self-avoiding walk or a self-avoiding polygon confined between two parallel walls. In two dimensions, this model involves self-avoiding walks or self-avoiding polygons in the square lattice between two parallel confining lines. Interactions of the polymer with the confining walls are introduced by energy terms associated with edges in the walk or polygon which are at or near the confining lines. We use transfer-matrix methods to investigate the forces between the walk or polygon and the confining lines, as well as to investigate the effects of the confining slit's width and of the energy terms on the thermodynamic properties of the walks or polygons in several models. The phase diagram found for the self-avoiding walk models is qualitatively similar to the phase diagram of a directed walk model confined between two parallel lines, as was previously conjectured. However, the phase diagram of one of our polygon models is found to be significantly different and we present numerical data to support this. For that particular model we prove that, for any finite values of the energy terms, there are an infinite number of slit widths where a polygon will induce a steric repulsion between the confining lines

20. Definition of a Twelve-Point Polygonal SAA Boundary for the GLAST Mission

International Nuclear Information System (INIS)

Djomehri, Sabra I.; UC, Santa Cruz; SLAC

2007-01-01

The Gamma-Ray Large Area Space Telescope (GLAST), set to launch in early 2008, detects gamma rays within a huge energy range of 100 MeV - 300 GeV. Background cosmic radiation interferes with such detection resulting in confusion over distinguishing cosmic from gamma rays encountered. This quandary is resolved by encasing GLAST's Large Area Telescope (LAT) with an Anti-Coincidence Detector (ACD), a device which identifies and vetoes charged particles. The ACD accomplishes this through plastic scintillator tiles; when cosmic rays strike, photons produced induce currents in Photomultiplier Tubes (PMTs) attached to these tiles. However, as GLAST orbits Earth at altitudes ∼550km and latitudes between -26 degree and 26 degree, it will confront the South Atlantic Anomaly (SAA), a region of high particle flux caused by trapped radiation in the geomagnetic field. Since the SAA flux would degrade the sensitivity of the ACD's PMTs over time, a determined boundary enclosing this region need be attained, signaling when to lower the voltage on the PMTs as a protective measure. The operational constraints on such a boundary require a convex SAA polygon with twelve edges, whose area is minimal ensuring GLAST has maximum observation time. The AP8 and PSB97 models describing the behavior of trapped radiation were used in analyzing the SAA and defining a convex SAA boundary of twelve sides. The smallest possible boundary was found to cover 14.58% of GLAST's observation time. Further analysis of defining a boundary safety margin to account for inaccuracies in the models reveals if the total SAA hull area is increased by ∼20%, the loss of total observational area is < 5%. These twelve coordinates defining the SAA flux region are ready for implementation by the GLAST satellite

1. Conformal array design on arbitrary polygon surface with transformation optics

Energy Technology Data Exchange (ETDEWEB)

Deng, Li, E-mail: dengl@bupt.edu.cn; Hong, Weijun, E-mail: hongwj@bupt.edu.cn; Zhu, Jianfeng; Peng, Biao; Li, Shufang [Beijing Key Laboratory of Network System Architecture and Convergence, School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, 100876 Beijing (China); Wu, Yongle, E-mail: wuyongle138@gmail.com [Beijing Key Laboratory of Work Safety Intelligent Monitoring, School of Electronic Engineering, Beijing University of Posts and Telecommunications, 100876 Beijing (China)

2016-06-15

A transformation-optics based method to design a conformal antenna array on an arbitrary polygon surface is proposed and demonstrated in this paper. This conformal antenna array can be adjusted to behave equivalently as a uniformly spaced linear array by applying an appropriate transformation medium. An typical example of general arbitrary polygon conformal arrays, not limited to circular array, is presented, verifying the proposed approach. In summary, the novel arbitrary polygon surface conformal array can be utilized in array synthesis and beam-forming, maintaining all benefits of linear array.

2. Conformal array design on arbitrary polygon surface with transformation optics

International Nuclear Information System (INIS)

Deng, Li; Hong, Weijun; Zhu, Jianfeng; Peng, Biao; Li, Shufang; Wu, Yongle

2016-01-01

A transformation-optics based method to design a conformal antenna array on an arbitrary polygon surface is proposed and demonstrated in this paper. This conformal antenna array can be adjusted to behave equivalently as a uniformly spaced linear array by applying an appropriate transformation medium. An typical example of general arbitrary polygon conformal arrays, not limited to circular array, is presented, verifying the proposed approach. In summary, the novel arbitrary polygon surface conformal array can be utilized in array synthesis and beam-forming, maintaining all benefits of linear array.

3. A survey on locally uniformly A-convex algebras

International Nuclear Information System (INIS)

1984-12-01

Using a bornological technic of M. Akkar, we reduce the study of classical questions (spectrum, boundedness of characters, functional calculus, etc.) in locally uniformly A-convex algebras to the Banach case. (author)

4. Lipschitz estimates for convex functions with respect to vector fields

Directory of Open Access Journals (Sweden)

Valentino Magnani

2012-12-01

Full Text Available We present Lipschitz continuity estimates for a class of convex functions with respect to Hörmander vector fields. These results have been recently obtained in collaboration with M. Scienza, [22].

5. A note on supercyclic operators in locally convex spaces

OpenAIRE

Albanese, Angela A.; Jornet, David

2018-01-01

We treat some questions related to supercyclicity of continuous linear operators when acting in locally convex spaces. We extend results of Ansari and Bourdon and consider doubly power bounded operators in this general setting. Some examples are given.

6. Convex solutions of systems arising from Monge-Ampere equations

Directory of Open Access Journals (Sweden)

Haiyan Wang

2009-10-01

Full Text Available We establish two criteria for the existence of convex solutions to a boundary value problem for weakly coupled systems arising from the Monge-Ampère equations. We shall use fixed point theorems in a cone.

7. Entropy and convexity for nonlinear partial differential equations.

Science.gov (United States)

Ball, John M; Chen, Gui-Qiang G

2013-12-28

Partial differential equations are ubiquitous in almost all applications of mathematics, where they provide a natural mathematical description of many phenomena involving change in physical, chemical, biological and social processes. The concept of entropy originated in thermodynamics and statistical physics during the nineteenth century to describe the heat exchanges that occur in the thermal processes in a thermodynamic system, while the original notion of convexity is for sets and functions in mathematics. Since then, entropy and convexity have become two of the most important concepts in mathematics. In particular, nonlinear methods via entropy and convexity have been playing an increasingly important role in the analysis of nonlinear partial differential equations in recent decades. This opening article of the Theme Issue is intended to provide an introduction to entropy, convexity and related nonlinear methods for the analysis of nonlinear partial differential equations. We also provide a brief discussion about the content and contributions of the papers that make up this Theme Issue.

8. Displacement Convexity for First-Order Mean-Field Games

KAUST Repository

Seneci, Tommaso

2018-05-01

In this thesis, we consider the planning problem for first-order mean-field games (MFG). These games degenerate into optimal transport when there is no coupling between players. Our aim is to extend the concept of displacement convexity from optimal transport to MFGs. This extension gives new estimates for solutions of MFGs. First, we introduce the Monge-Kantorovich problem and examine related results on rearrangement maps. Next, we present the concept of displacement convexity. Then, we derive first-order MFGs, which are given by a system of a Hamilton-Jacobi equation coupled with a transport equation. Finally, we identify a large class of functions, that depend on solutions of MFGs, which are convex in time. Among these, we find several norms. This convexity gives bounds for the density of solutions of the planning problem.

9. Multi-objective convex programming problem arising in multivariate ...

African Journals Online (AJOL)

user

Multi-objective convex programming problem arising in ... However, although the consideration of multiple objectives may seem a novel concept, virtually any nontrivial ..... Solving multiobjective programming problems by discrete optimization.

10. Surgical treatment of convexity focal epilepsy

International Nuclear Information System (INIS)

Shimizu, Hiroyuki; Ishijima, Buichi; Iio, Masaaki.

1987-01-01

We have hitherto applied PET study in 72 epileptic patients. The main contents of their seizures consists of complex partial in 32, elementary partial in 32, generalized in 6, and others in 3 cases. We administered perorally 10 mCi glucose labeled with C11 produced in the JSW Baby Cyclotron for the study of CMRG(cerebral metabolic rate of glucose). The continuous inhalation method of CO 2 and O 2 labeled with O15 produced in the same cyclotron was also employed for measurement of rCBE(cerebral blood flow) and CMRO 2 (cerebral metabolic rate of oxygen). In both studies, epileptic foci were shown as well demarcated hypometabolic zones with decreased CMRG, rCBF or CMRO 2 . The locations of PET diagnosed foci were not contradictory with the clinical symptoms, scalp EEGs or X-ray CT findings. Of the 32 patients with the convexity epileptic foci, 8 patients underwent surgical treatment. Prior to the surgical intervention, subdural strip electrodes were inserted in the four cases for further assessment of focus locations. Subdural EEG disclosed very active brain activity with high amplitude 4 to 5 times scalp EEG and revealed epileptiform discharges most of which were not detected by scalp recording. PET scans did not characterize epileptogenic nature of a lesion. Subdural recording therefore was useful for detecting the foci responsible for habitual seizures in the cases with multiple PET foci. Ambiguous hypometabolic zones on PECT images also could be confirmed by the subdural technique. Of the 8 operated cases, five patients are seizure free, one is signigicantly improved and two are not improved although the postoperative follow-up is too short for precise evaluation. (J.P.N.)

11. Efficiency and Generalized Convex Duality for Nondifferentiable Multiobjective Programs

Directory of Open Access Journals (Sweden)

Bae KwanDeok

2010-01-01

Full Text Available We introduce nondifferentiable multiobjective programming problems involving the support function of a compact convex set and linear functions. The concept of (properly efficient solutions are presented. We formulate Mond-Weir-type and Wolfe-type dual problems and establish weak and strong duality theorems for efficient solutions by using suitable generalized convexity conditions. Some special cases of our duality results are given.

12. Two examples of non strictly convex large deviations

OpenAIRE

De Marco, Stefano; Jacquier, Antoine; Roome, Patrick

2016-01-01

We present two examples of a large deviations principle where the rate function is not strictly convex. This is motivated by a model used in mathematical finance (the Heston model), and adds a new item to the zoology of non strictly convex large deviations. For one of these examples, we show that the rate function of the Cramer-type of large deviations coincides with that of the Freidlin-Wentzell when contraction principles are applied.

13. Alabama ESI: M_MAMMAL (Marine Mammal Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for dolphins and manatees in Alabama. Vector polygons in this data set represent marine mammal distribution...

14. Western Alaska ESI: M_MAMMAL (Marine Mammal Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for seals, whales, dolphins, walruses, and Steller sea lions in Western Alaska. Vector polygons in this...

15. American Samoa ESI: M_MAMMAL (Marine Mammal Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for whales and dolphins in American Samoa. Vector polygons in this data set represent marine mammal...

16. Columbia River ESI: NWI (National Wetlands Inventory - Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector polygons representing the wetlands of Columbia River classified according to the Environmental Sensitivity Index (ESI) classification...

17. Coastal Resources Atlas: Long Island: FISH (Fish Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for marine, estuarine, anadromous, and freshwater fish species for Long Island, New York. Vector polygons...

18. Coastal Resources Atlas: Long Island: REPTILES (Reptile and Amphibian Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for sea turtles, estuarine turtles, and amphibians for Long Island, New York. Vector polygons in this data...

19. Louisiana ESI: T_MAMMAL (Terrestrial Mammal Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for terrestrial mammals in Louisiana. Vector polygons in this data set represent terrestrial mammal...

20. North Slope, Alaska ESI: T_MAMMAL (Terrestrial Mammal Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for brown bears, caribou, and muskoxen for the North Slope, Alaska. Vector polygons in this data set...

1. Virginia ESI: M_MAMMAL (Marine Mammal Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for dolphin, seals, whales, and porpoise in Virginia. Vector polygons in this data set represent marine...

2. North Slope, Alaska ESI: M_MAMMAL (Marine Mammal Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for whales, seals, walruses, and polar bears for the North Slope of Alaska. Vector polygons in this data...

3. Shinarump Channel Polygons, North Central AUM Region, 1964, USDOE

Data.gov (United States)

U.S. Environmental Protection Agency — This is a polygon shapefile that provides Shinarump channels compiled and mapped by Young and Malan (1964) in the Monument Valley District, San Juan County, Utah,...

4. Cook Inlet and Kenai Peninsula, Alaska ESI: INDEX (Index Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector polygons representing the boundaries used in the creation of the Environmental Sensitivity Index (ESI) for Cook Inlet and Kenai...

5. Southeast Alaska ESI: T_MAMMAL (Terrestrial Mammal Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains biological resource data for brown bears in Southeast Alaska. Vector polygons in this data set represent locations of bear concentrations....

6. American Samoa ESI: REPTILES (Reptile and Amphibian Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for sea turtles in American Samoa. Vector polygons in this data set represent sea turtle nesting and...

7. Columbia River ESI: M_MAMMAL (Marine Mammal Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for Steller sea lions, harbor seals, and California sea lions in Columbia River. Vector polygons in this...

8. Coastal Resources Atlas: Long Island: INVERT (Invertebrate Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for coastal, estuarine, and marine invertebrate species for Long Island, New York. Vector polygons in this...

9. Cook Inlet and Kenai Peninsula, Alaska ESI: INVERT (Invertebrate Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains biological resource data for razor clams in Cook Inlet and Kenai Peninsula, Alaska. Vector polygons in this data set represent locations of...

10. Columbia River ESI: REPTILES (Reptile and Amphibian Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for western pond turtles and western painted turtles in Columbia River. Vector polygons in this data set...

11. Cook Inlet and Kenai Peninsula, Alaska ESI: FISH (Fish Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains biological resource data for herring spawning areas in Cook Inlet and Kenai Peninsula, Alaska. Vector polygons in this data set represent...

12. PNW River Reach Files -- 1:100k Waterbodies (polygons)

Data.gov (United States)

Pacific States Marine Fisheries Commission — This feature class includes the POLYGON waterbody features from the 2001 version of the PNW River Reach files Arc/INFO coverage. Separate, companion feature classes...

13. North Slope, Alaska ESI: BIOINDEX (Biological Index Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector polygons representing the quad boundaries of the 1:250,000 USGS topographic quadrangles. These boundaries represent the extent of the...

14. Louisiana ESI: LG_INDEX (Large Index Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector polygons representing the boundaries of all the hardcopy cartographic products produced as part of the Environmental Sensitivity Index...

15. Structural characterization of the packings of granular regular polygons.

Science.gov (United States)

Wang, Chuncheng; Dong, Kejun; Yu, Aibing

2015-12-01

By using a recently developed method for discrete modeling of nonspherical particles, we simulate the random packings of granular regular polygons with three to 11 edges under gravity. The effects of shape and friction on the packing structures are investigated by various structural parameters, including packing fraction, the radial distribution function, coordination number, Voronoi tessellation, and bond-orientational order. We find that packing fraction is generally higher for geometrically nonfrustrated regular polygons, and can be increased by the increase of edge number and decrease of friction. The changes of packing fraction are linked with those of the microstructures, such as the variations of the translational and orientational orders and local configurations. In particular, the free areas of Voronoi tessellations (which are related to local packing fractions) can be described by log-normal distributions for all polygons. The quantitative analyses establish a clearer picture for the packings of regular polygons.

16. Polygon formation and surface flow on a rotating fluid surface

DEFF Research Database (Denmark)

Bergmann, Raymond; Tophøj, Laust Emil Hjerrild; Homan, T. A. M.

2011-01-01

We present a study of polygons forming on the free surface of a water flow confined to a stationary cylinder and driven by a rotating bottom plate as described by Jansson et al. (Phys. Rev. Lett., vol. 96, 2006, 174502). In particular, we study the case of a triangular structure, either completely...... there the symmetry breaking proceeds like a low-dimensional linear instability. We show that the circular state and the unstable manifold connecting it with the polygon solution are universal in the sense that very different initial conditions lead to the same circular state and unstable manifold. For a wet triangle......, we measure the surface flows by particle image velocimetry (PIV) and show that there are three vortices present, but that the strength of these vortices is far too weak to account for the rotation velocity of the polygon. We show that partial blocking of the surface flow destroys the polygons and re...

17. The unusual asymptotics of three-sided prudent polygons

International Nuclear Information System (INIS)

Beaton, Nicholas R; Guttmann, Anthony J; Flajolet, Philippe

2010-01-01

We have studied the area-generating function of prudent polygons on the square lattice. Exact solutions are obtained for the generating function of two-sided and three-sided prudent polygons, and a functional equation is found for four-sided prudent polygons. This is used to generate series coefficients in polynomial time, and these are analysed to determine the asymptotics numerically. A careful asymptotic analysis of the three-sided polygons produces a most surprising result. A transcendental critical exponent is found, and the leading amplitude is not quite a constant, but is a constant plus a small oscillatory component with an amplitude approximately 10 -8 times that of the leading amplitude. This effect cannot be seen by any standard numerical analysis, but it may be present in other models. If so, it changes our whole view of the asymptotic behaviour of lattice models. (fast track communication)

18. Average size of random polygons with fixed knot topology.

Science.gov (United States)

Matsuda, Hiroshi; Yao, Akihisa; Tsukahara, Hiroshi; Deguchi, Tetsuo; Furuta, Ko; Inami, Takeo

2003-07-01

We have evaluated by numerical simulation the average size R(K) of random polygons of fixed knot topology K=,3(1),3(1) musical sharp 4(1), and we have confirmed the scaling law R(2)(K) approximately N(2nu(K)) for the number N of polygonal nodes in a wide range; N=100-2200. The best fit gives 2nu(K) approximately 1.11-1.16 with good fitting curves in the whole range of N. The estimate of 2nu(K) is consistent with the exponent of self-avoiding polygons. In a limited range of N (N greater, similar 600), however, we have another fit with 2nu(K) approximately 1.01-1.07, which is close to the exponent of random polygons.

19. Bristol Bay, Alaska Subarea ESI: INDEX (Index Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector polygons representing the boundaries of all the hardcopy cartographic products produced as part of the Environmental Sensitivity Index...

20. Maryland ESI: M_MAMMAL (Marine Mammal Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for seals, whales, porpoise, and dolphin in Maryland. Vector polygons in this data set represent marine...

1. Alabama ESI: T_MAMMAL (Terrestrial Mammal Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for Alabama and Perdido Key beach mice in Alabama. Vector polygons in this data set represent the rare...

2. Morphometric analysis of the arteries of Willis Polygon

Directory of Open Access Journals (Sweden)

Canaz Huseyin

2018-03-01

Full Text Available Objective: Willis polygon forms the basis of the arterial circulation of the cerebrum. Willis polygon is a vascular structure whom variations are not rare. Knowledge of the anatomy and preservation of its integrity is crucial for performing neurovascular surgery and intracranial tumour surgery. Because of the important vascular and neurological structures, approaches to this region are considered extremely risky. One of the main variations in-person basis is the diameter differences of the arteries, which forms Willis polygon, between the left and right hemispheres. About structure and variations, studies of Rhoton and Yasargil had formed the touchstone. Our aim is to contribute to the literature and clinical studies, to be done in the future, by comparing our results with previous studies about variations and morphometric features of Willis polygon.

3. Coastal Resources Atlas: Long Island: HYDRO (Hydrography Lines and Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector lines and polygons representing coastal hydrography used in the creation of the Environmental Sensitivity Index (ESI) for Long Island,...

4. North Slope, Alaska ESI: HYDRO (Hydrography Lines and Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector lines and polygons representing coastal hydrography used in the creation of the Environmental Sensitivity Index (ESI) for the North...

5. Columbia River ESI: HYDRO (Hydrography Lines and Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector lines and polygons representing coastal hydrography used in the creation of the Environmental Sensitivity Index (ESI) for Columbia...

6. Bristol Bay, Alaska Subarea ESI: HYDRO (Hydrography Lines and Polygons)

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector lines and polygons representing coastal hydrography used in the creation of the Environmental Sensitivity Index (ESI) for the Bristol...

7. Spectral segmentation of polygonized images with normalized cuts

Energy Technology Data Exchange (ETDEWEB)

Matsekh, Anna [Los Alamos National Laboratory; Skurikhin, Alexei [Los Alamos National Laboratory; Rosten, Edward [UNIV OF CAMBRIDGE

2009-01-01

We analyze numerical behavior of the eigenvectors corresponding to the lowest eigenvalues of the generalized graph Laplacians arising in the Normalized Cuts formulations of the image segmentation problem on coarse polygonal grids.

8. Rotating polygon instability of a swirling free surface flow

DEFF Research Database (Denmark)

Tophøj, Laust Emil Hjerrild; Bohr, Tomas; Mougel, J.

2013-01-01

We explain the rotating polygon instability on a swirling fluid surface [G. H. Vatistas, J. Fluid Mech. 217, 241 (1990)JFLSA70022-1120 and Jansson et al., Phys. Rev. Lett. 96, 174502 (2006)PRLTAO0031-9007] in terms of resonant interactions between gravity waves on the outer part of the surface...... behavior near the corners), and indeed we show that we can obtain the polygons transiently by violently stirring liquid nitrogen in a hot container....

9. Geophysical Features - SILURIAN_REEF_POLYGONS_MM54_IN: Silurian Reef Locations in Indiana (Indiana Geological Survey, 1:500,000, Polygon Shapefile)

Data.gov (United States)

NSGIC State | GIS Inventory — SILURIAN_REEF_POLYGONS_MM54_IN is a polygon shapefile that shows the general locations of Silurian rock reef bank formations in Indiana. These data include two major...

10. Image segmentation by hierarchial agglomeration of polygons using ecological statistics

Science.gov (United States)

2013-04-23

A method for rapid hierarchical image segmentation based on perceptually driven contour completion and scene statistics is disclosed. The method begins with an initial fine-scale segmentation of an image, such as obtained by perceptual completion of partial contours into polygonal regions using region-contour correspondences established by Delaunay triangulation of edge pixels as implemented in VISTA. The resulting polygons are analyzed with respect to their size and color/intensity distributions and the structural properties of their boundaries. Statistical estimates of granularity of size, similarity of color, texture, and saliency of intervening boundaries are computed and formulated into logical (Boolean) predicates. The combined satisfiability of these Boolean predicates by a pair of adjacent polygons at a given segmentation level qualifies them for merging into a larger polygon representing a coarser, larger-scale feature of the pixel image and collectively obtains the next level of polygonal segments in a hierarchy of fine-to-coarse segmentations. The iterative application of this process precipitates textured regions as polygons with highly convolved boundaries and helps distinguish them from objects which typically have more regular boundaries. The method yields a multiscale decomposition of an image into constituent features that enjoy a hierarchical relationship with features at finer and coarser scales. This provides a traversable graph structure from which feature content and context in terms of other features can be derived, aiding in automated image understanding tasks. The method disclosed is highly efficient and can be used to decompose and analyze large images.

11. Aberdeen polygons: computer displays of physiological profiles for intensive care.

Science.gov (United States)

Green, C A; Logie, R H; Gilhooly, K J; Ross, D G; Ronald, A

1996-03-01

The clinician in an intensive therapy unit is presented regularly with a range of information about the current physiological state of the patients under care. This information typically comes from a variety of sources and in a variety of formats. A more integrated form of display incorporating several physiological parameters may be helpful therefore. Three experiments are reported that explored the potential use of analogue, polygon diagrams to display physiological data from patients undergoing intensive therapy. Experiment 1 demonstrated that information can be extracted readily from such diagrams comprising 8- or 10-sided polygons, but with an advantage for simpler polygons and for information displayed at the top of the diagram. Experiment 2 showed that colour coding removed these biases for simpler polygons and the top of the diagram, together with speeding the processing time. Experiment 3 used polygons displaying patterns of physiological data that were consistent with typical conditions observed in the intensive care unit. It was found that physicians can readily learn to recognize these patterns and to diagnose both the nature and severity of the patient's physiological state. These polygon diagrams appear to have some considerable potential for use in providing on-line summary information of a patient's physiological state.

12. Water polygons in high-resolution protein crystal structures.

Science.gov (United States)

Lee, Jonas; Kim, Sung-Hou

2009-07-01

We have analyzed the interstitial water (ISW) structures in 1500 protein crystal structures deposited in the Protein Data Bank that have greater than 1.5 A resolution with less than 90% sequence similarity with each other. We observed varieties of polygonal water structures composed of three to eight water molecules. These polygons may represent the time- and space-averaged structures of "stable" water oligomers present in liquid water, and their presence as well as relative population may be relevant in understanding physical properties of liquid water at a given temperature. On an average, 13% of ISWs are localized enough to be visible by X-ray diffraction. Of those, averages of 78% are water molecules in the first water layer on the protein surface. Of the localized ISWs beyond the first layer, almost half of them form water polygons such as trigons, tetragons, as well as expected pentagons, hexagons, higher polygons, partial dodecahedrons, and disordered networks. Most of the octagons and nanogons are formed by fusion of smaller polygons. The trigons are most commonly observed. We suggest that our observation provides an experimental basis for including these water polygon structures in correlating and predicting various water properties in liquid state.

13. Vigorous convection as the explanation for Pluto's polygonal terrain.

Science.gov (United States)

Trowbridge, A J; Melosh, H J; Steckloff, J K; Freed, A M

2016-06-02

Pluto's surface is surprisingly young and geologically active. One of its youngest terrains is the near-equatorial region informally named Sputnik Planum, which is a topographic basin filled by nitrogen (N2) ice mixed with minor amounts of CH4 and CO ices. Nearly the entire surface of the region is divided into irregular polygons about 20-30 kilometres in diameter, whose centres rise tens of metres above their sides. The edges of this region exhibit bulk flow features without polygons. Both thermal contraction and convection have been proposed to explain this terrain, but polygons formed from thermal contraction (analogous to ice-wedges or mud-crack networks) of N2 are inconsistent with the observations on Pluto of non-brittle deformation within the N2-ice sheet. Here we report a parameterized convection model to compute the Rayleigh number of the N2 ice and show that it is vigorously convecting, making Rayleigh-Bénard convection the most likely explanation for these polygons. The diameter of Sputnik Planum's polygons and the dimensions of the 'floating mountains' (the hills of of water ice along the edges of the polygons) suggest that its N2 ice is about ten kilometres thick. The estimated convection velocity of 1.5 centimetres a year indicates a surface age of only around a million years.

14. Surgery for convexity/parasagittal/falx meningiomas

International Nuclear Information System (INIS)

Ochi, Takashi; Saito, Nobuhito

2013-01-01

Incidence of the complication related with the surgical treatment of meningiomas in the title was reviewed together with consideration of data about progress observation and stereotactic radiosurgery. MEDLINE papers in English were on line searched with keywords contained in above using PubMed System. For the convexity meningioma, 50-141 cases (mean age, 48-58.9 y) with 1.9-3.6 cm or 146.3 mL of the tumor size or volume were reported in 6 literatures (2006-2011), presenting 0% of surgery related death, 1-5.9% of internal medical or 5.5-37.4% of surgical complication, 0-2% of postoperative hemorrhage, 0-15.4% of neurological and 0-15.4% of prolonged/permanent deficits. For the parasagittal/falx meningioma, 46-108 cases (age, 55-58 y) with 1.9-4 cm tumor were reported in 8 literatures (2004-2011), presenting 0-5.7% death, 2-7.4% medical or 5.4-31% surgical complication, 0-3% hemorrhage, 0-15.4 neurologic and 0-15.4% prolonged deficits. For complications after the radiosurgery of the all 3 meningiomas, 41-832 cases (50-60 y) with tumors of 24.7-28 mm or 4.7-7.4 mL were reported in 8 literatures (2003-2012), presenting the incidence of 6.8-26.8% of radiation-related complications like headache, seizures and paralysis necessary for steroid treatment, and 1.20 or 4.80% of permanent morbidity. For the natural history of incidental meningiomas involving tentorium one, 16-144 cases in 6 literatures (2000-2012) revealed the growth rate/y of 1.9-3.9 mm or 0.54-1.15 mL. The outcome of surgical treatment of the meningiomas, a representative benign tumor, was concluded to be rather good as surgery was generally needed only when the disease became symptomatic due to the tumor growth. (T.T.)

15. Bifurcation of self-folded polygonal bilayers

Science.gov (United States)

Abdullah, Arif M.; Braun, Paul V.; Hsia, K. Jimmy

2017-09-01

Motivated by the self-assembly of natural systems, researchers have investigated the stimulus-responsive curving of thin-shell structures, which is also known as self-folding. Self-folding strategies not only offer possibilities to realize complicated shapes but also promise actuation at small length scales. Biaxial mismatch strain driven self-folding bilayers demonstrate bifurcation of equilibrium shapes (from quasi-axisymmetric doubly curved to approximately singly curved) during their stimulus-responsive morphing behavior. Being a structurally instable, bifurcation could be used to tune the self-folding behavior, and hence, a detailed understanding of this phenomenon is appealing from both fundamental and practical perspectives. In this work, we investigated the bifurcation behavior of self-folding bilayer polygons. For the mechanistic understanding, we developed finite element models of planar bilayers (consisting of a stimulus-responsive and a passive layer of material) that transform into 3D curved configurations. Our experiments with cross-linked Polydimethylsiloxane samples that change shapes in organic solvents confirmed our model predictions. Finally, we explored a design scheme to generate gripper-like architectures by avoiding the bifurcation of stimulus-responsive bilayers. Our research contributes to the broad field of self-assembly as the findings could motivate functional devices across multiple disciplines such as robotics, artificial muscles, therapeutic cargos, and reconfigurable biomedical devices.

16. Convex unwraps its first grown-up supercomputer

Energy Technology Data Exchange (ETDEWEB)

Manuel, T.

1988-03-03

Convex Computer Corp.'s new supercomputer family is even more of an industry blockbuster than its first system. At a tenfold jump in performance, it's far from just an incremental upgrade over its first minisupercomputer, the C-1. The heart of the new family, the new C-2 processor, churning at 50 million floating-point operations/s, spawns a group of systems whose performance could pass for some fancy supercomputers-namely those of the Cray Research Inc. family. When added to the C-1, Convex's five new supercomputers create the C series, a six-member product group offering a performance range from 20 to 200 Mflops. They mark an important transition for Convex from a one-product high-tech startup to a multinational company with a wide-ranging product line. It's a tough transition but the Richardson, Texas, company seems to be doing it. The extended product line propels Convex into the upper end of the minisupercomputer class and nudges it into the low end of the big supercomputers. It positions Convex in an uncrowded segment of the market in the $500,000 to$1 million range offering 50 to 200 Mflops of performance. The company is making this move because the minisuper area, which it pioneered, quickly became crowded with new vendors, causing prices and gross margins to drop drastically.

17. Inhibitory competition in figure-ground perception: context and convexity.

Science.gov (United States)

Peterson, Mary A; Salvagio, Elizabeth

2008-12-15

Convexity has long been considered a potent cue as to which of two regions on opposite sides of an edge is the shaped figure. Experiment 1 shows that for a single edge, there is only a weak bias toward seeing the figure on the convex side. Experiments 1-3 show that the bias toward seeing the convex side as figure increases as the number of edges delimiting alternating convex and concave regions increases, provided that the concave regions are homogeneous in color. The results of Experiments 2 and 3 rule out a probability summation explanation for these context effects. Taken together, the results of Experiments 1-3 show that the homogeneity versus heterogeneity of the convex regions is irrelevant. Experiment 4 shows that homogeneity of alternating regions is not sufficient for context effects; a cue that favors the perception of the intervening regions as figures is necessary. Thus homogeneity alone does not alone operate as a background cue. We interpret our results within a model of figure-ground perception in which shape properties on opposite sides of an edge compete for representation and the competitive strength of weak competitors is further reduced when they are homogeneous.

18. Dose evaluation from multiple detector outputs using convex optimisation

International Nuclear Information System (INIS)

Hashimoto, M.; Iimoto, T.; Kosako, T.

2011-01-01

A dose evaluation using multiple radiation detectors can be improved by the convex optimisation method. It enables flexible dose evaluation corresponding to the actual radiation energy spectrum. An application to the neutron ambient dose equivalent evaluation is investigated using a mixed-gas proportional counter. The convex derives the certain neutron ambient dose with certain width corresponding to the true neutron energy spectrum. The range of the evaluated dose is comparable to the error of conventional neutron dose measurement equipments. An application to the neutron individual dose equivalent measurement is also investigated. Convexes of particular dosemeter combinations evaluate the individual dose equivalent better than the dose evaluation of a single dosemeter. The combinations of dosemeters with high orthogonality of their response characteristics tend to provide a good suitability for dose evaluation. (authors)

19. Convexity and concavity constants in Lorentz and Marcinkiewicz spaces

Science.gov (United States)

Kaminska, Anna; Parrish, Anca M.

2008-07-01

We provide here the formulas for the q-convexity and q-concavity constants for function and sequence Lorentz spaces associated to either decreasing or increasing weights. It yields also the formula for the q-convexity constants in function and sequence Marcinkiewicz spaces. In this paper we extent and enhance the results from [G.J.O. Jameson, The q-concavity constants of Lorentz sequence spaces and related inequalities, Math. Z. 227 (1998) 129-142] and [A. Kaminska, A.M. Parrish, The q-concavity and q-convexity constants in Lorentz spaces, in: Banach Spaces and Their Applications in Analysis, Conference in Honor of Nigel Kalton, May 2006, Walter de Gruyter, Berlin, 2007, pp. 357-373].

20. Transient disturbance growth in flows over convex surfaces

Science.gov (United States)

Karp, Michael; Hack, M. J. Philipp

2017-11-01

Flows over curved surfaces occur in a wide range of applications including airfoils, compressor and turbine vanes as well as aerial, naval and ground vehicles. In most of these applications the surface has convex curvature, while concave surfaces are less common. Since monotonic boundary-layer flows over convex surfaces are exponentially stable, they have received considerably less attention than flows over concave walls which are destabilized by centrifugal forces. Non-modal mechanisms may nonetheless enable significant disturbance growth which can make the flow susceptible to secondary instabilities. A parametric investigation of the transient growth and secondary instability of flows over convex surfaces is performed. The specific conditions yielding the maximal transient growth and strongest instability are identified. The effect of wall-normal and spanwise inflection points on the instability process is discussed. Finally, the role and significance of additional parameters, such as the geometry and pressure gradient, is analyzed.

1. Primal-dual convex optimization in large deformation diffeomorphic metric mapping: LDDMM meets robust regularizers

Science.gov (United States)

Hernandez, Monica

2017-12-01

This paper proposes a method for primal-dual convex optimization in variational large deformation diffeomorphic metric mapping problems formulated with robust regularizers and robust image similarity metrics. The method is based on Chambolle and Pock primal-dual algorithm for solving general convex optimization problems. Diagonal preconditioning is used to ensure the convergence of the algorithm to the global minimum. We consider three robust regularizers liable to provide acceptable results in diffeomorphic registration: Huber, V-Huber and total generalized variation. The Huber norm is used in the image similarity term. The primal-dual equations are derived for the stationary and the non-stationary parameterizations of diffeomorphisms. The resulting algorithms have been implemented for running in the GPU using Cuda. For the most memory consuming methods, we have developed a multi-GPU implementation. The GPU implementations allowed us to perform an exhaustive evaluation study in NIREP and LPBA40 databases. The experiments showed that, for all the considered regularizers, the proposed method converges to diffeomorphic solutions while better preserving discontinuities at the boundaries of the objects compared to baseline diffeomorphic registration methods. In most cases, the evaluation showed a competitive performance for the robust regularizers, close to the performance of the baseline diffeomorphic registration methods.

2. A working-set framework for sequential convex approximation methods

DEFF Research Database (Denmark)

Stolpe, Mathias

2008-01-01

We present an active-set algorithmic framework intended as an extension to existing implementations of sequential convex approximation methods for solving nonlinear inequality constrained programs. The framework is independent of the choice of approximations and the stabilization technique used...... to guarantee global convergence of the method. The algorithm works directly on the nonlinear constraints in the convex sub-problems and solves a sequence of relaxations of the current sub-problem. The algorithm terminates with the optimal solution to the sub-problem after solving a finite number of relaxations....

3. Convex Hull Abstraction in Specialisation of CLP Programs

DEFF Research Database (Denmark)

Peralta, J.C.; Gallagher, John Patrick

2003-01-01

We introduce an abstract domain consisting of atomic formulas constrained by linear arithmetic constraints (or convex hulls). This domain is used in an algorithm for specialization of constraint logic programs. The algorithm incorporates in a single phase both top-down goal directed propagation...... and bottom-up answer propagation, and uses a widening on the convex hull domain to ensure termination. We give examples to show the precision gained by this approach over other methods in the literature for specializing constraint logic programs. The specialization method can also be used for ordinary logic...

4. Closedness type regularity conditions in convex optimization and beyond

Directory of Open Access Journals (Sweden)

2016-09-01

Full Text Available The closedness type regularity conditions have proven during the last decade to be viable alternatives to their more restrictive interiority type counterparts, in both convex optimization and different areas where it was successfully applied. In this review article we de- and reconstruct some closedness type regularity conditions formulated by means of epigraphs and subdifferentials, respectively, for general optimization problems in order to stress that they arise naturally when dealing with such problems. The results are then specialized for constrained and unconstrained convex optimization problems. We also hint towards other classes of optimization problems where closedness type regularity conditions were successfully employed and discuss other possible applications of them.

5. Distribution functions of sections and projections of convex bodies

OpenAIRE

2015-01-01

Typically, when we are given the section (or projection) function of a convex body, it means that in each direction we know the size of the central section (or projection) perpendicular to this direction. Suppose now that we can only get the information about the sizes of sections (or projections), and not about the corresponding directions. In this paper we study to what extent the distribution function of the areas of central sections (or projections) of a convex body can be used to derive ...

6. Relaxation Methods for Strictly Convex Regularizations of Piecewise Linear Programs

International Nuclear Information System (INIS)

Kiwiel, K. C.

1998-01-01

We give an algorithm for minimizing the sum of a strictly convex function and a convex piecewise linear function. It extends several dual coordinate ascent methods for large-scale linearly constrained problems that occur in entropy maximization, quadratic programming, and network flows. In particular, it may solve exact penalty versions of such (possibly inconsistent) problems, and subproblems of bundle methods for nondifferentiable optimization. It is simple, can exploit sparsity, and in certain cases is highly parallelizable. Its global convergence is established in the recent framework of B -functions (generalized Bregman functions)

7. The selection problem for discounted Hamilton–Jacobi equations: some non-convex cases

KAUST Repository

Gomes, Diogo A.; Mitake, Hiroyoshi; Tran, Hung V.

2018-01-01

Here, we study the selection problem for the vanishing discount approximation of non-convex, first-order Hamilton–Jacobi equations. While the selection problem is well understood for convex Hamiltonians, the selection problem for non-convex Hamiltonians has thus far not been studied. We begin our study by examining a generalized discounted Hamilton–Jacobi equation. Next, using an exponential transformation, we apply our methods to strictly quasi-convex and to some non-convex Hamilton–Jacobi equations. Finally, we examine a non-convex Hamiltonian with flat parts to which our results do not directly apply. In this case, we establish the convergence by a direct approach.

8. The selection problem for discounted Hamilton–Jacobi equations: some non-convex cases

KAUST Repository

Gomes, Diogo A.

2018-01-26

Here, we study the selection problem for the vanishing discount approximation of non-convex, first-order Hamilton–Jacobi equations. While the selection problem is well understood for convex Hamiltonians, the selection problem for non-convex Hamiltonians has thus far not been studied. We begin our study by examining a generalized discounted Hamilton–Jacobi equation. Next, using an exponential transformation, we apply our methods to strictly quasi-convex and to some non-convex Hamilton–Jacobi equations. Finally, we examine a non-convex Hamiltonian with flat parts to which our results do not directly apply. In this case, we establish the convergence by a direct approach.

9. A QUALITY ASSESSMENT METHOD FOR 3D ROAD POLYGON OBJECTS

Directory of Open Access Journals (Sweden)

L. Gao

2015-08-01

Full Text Available With the development of the economy, the fast and accurate extraction of the city road is significant for GIS data collection and update, remote sensing images interpretation, mapping and spatial database updating etc. 3D GIS has attracted more and more attentions from academics, industries and governments with the increase of requirements for interoperability and integration of different sources of data. The quality of 3D geographic objects is very important for spatial analysis and decision-making. This paper presents a method for the quality assessment of the 3D road polygon objects which is created by integrating 2D Road Polygon data with LiDAR point cloud and other height information such as Spot Height data in Hong Kong Island. The quality of the created 3D road polygon data set is evaluated by the vertical accuracy, geometric and attribute accuracy, connectivity error, undulation error and completeness error and the final results are presented.

10. Long-term repetition priming with symmetrical polygons and words.

Science.gov (United States)

Kersteen-Tucker, Z

1991-01-01

In two different tasks, subjects were asked to make lexical decisions (word or nonword) and symmetry judgments (symmetrical or nonsymmetrical) about two-dimensional polygons. In both tasks, every stimulus was repeated at one of four lags (0, 1, 4, or 8 items interposed between the first and second stimulus presentations). This paradigm, known as repetition priming, revealed comparable short-term priming (Lag 0) and long-term priming (Lags 1, 4, and 8) both for symmetrical polygons and for words. A shorter term component (Lags 0 and 1) of priming was observed for nonwords, and only very short-term priming (Lag 0) was observed for nonsymmetrical polygons. These results indicate that response facilitation accruing from repeated exposure can be observed for stimuli that have no preexisting memory representations and suggest that perceptual factors contribute to repetition-priming effects.

11. An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint

Directory of Open Access Journals (Sweden)

2006-01-01

Full Text Available We consider the problem of minimizing a convex separable logarithmic function over a region defined by a convex inequality constraint or linear equality constraint, and two-sided bounds on the variables (box constraints. Such problems are interesting from both theoretical and practical point of view because they arise in some mathematical programming problems as well as in various practical problems such as problems of production planning and scheduling, allocation of resources, decision making, facility location problems, and so forth. Polynomial algorithms are proposed for solving problems of this form and their convergence is proved. Some examples and results of numerical experiments are also presented.

12. Agency for Toxic Substances and Disease Registry (ATSDR) Hazardous Waste Site Polygon Data, 1996

Data.gov (United States)

National Aeronautics and Space Administration — The Agency for Toxic Substances and Disease Registry (ATSDR) Hazardous Waste Site Polygon Data, 1996 consists of 2042 polygons for selected hazardous waste sites...

13. United States National Grid for New Mexico, UTM 12, (1000m X 1000m polygons )

Data.gov (United States)

Earth Data Analysis Center, University of New Mexico — This is a polygon feature data layer of United States National Grid (1000m x 1000m polygons ) constructed by the Center for Interdisciplinary Geospatial Information...

14. United States National Grid for New Mexico, UTM 13, (1000m X 1000m polygons )

Data.gov (United States)

Earth Data Analysis Center, University of New Mexico — This is a polygon feature data layer of United States National Grid (1000m x 1000m polygons ) constructed by the Center for Interdisciplinary Geospatial Information...

15. On the polarizability dyadics of electrically small, convex objects

Science.gov (United States)

Lakhtakia, Akhlesh

1993-11-01

This communication on the polarizability dyadics of electrically small objects of convex shapes has been prompted by a recent paper published by Sihvola and Lindell on the polarizability dyadic of an electrically gyrotropic sphere. A mini-review of recent work on polarizability dyadics is appended.

16. Riemann solvers and undercompressive shocks of convex FPU chains

International Nuclear Information System (INIS)

Herrmann, Michael; Rademacher, Jens D M

2010-01-01

We consider FPU-type atomic chains with general convex potentials. The naive continuum limit in the hyperbolic space–time scaling is the p-system of mass and momentum conservation. We systematically compare Riemann solutions to the p-system with numerical solutions to discrete Riemann problems in FPU chains, and argue that the latter can be described by modified p-system Riemann solvers. We allow the flux to have a turning point, and observe a third type of elementary wave (conservative shocks) in the atomistic simulations. These waves are heteroclinic travelling waves and correspond to non-classical, undercompressive shocks of the p-system. We analyse such shocks for fluxes with one or more turning points. Depending on the convexity properties of the flux we propose FPU-Riemann solvers. Our numerical simulations confirm that Lax shocks are replaced by so-called dispersive shocks. For convex–concave flux we provide numerical evidence that convex FPU chains follow the p-system in generating conservative shocks that are supersonic. For concave–convex flux, however, the conservative shocks of the p-system are subsonic and do not appear in FPU-Riemann solutions

17. On the Convexity of Step out - Step in Sequencing Games

NARCIS (Netherlands)

Musegaas, Marieke; Borm, Peter; Quant, Marieke

2016-01-01

The main result of this paper is the convexity of Step out - Step in (SoSi) sequencing games, a class of relaxed sequencing games first analyzed by Musegaas, Borm, and Quant (2015). The proof makes use of a polynomial time algorithm determining the value and an optimal processing order for an

18. Convex relationships in ecosystems containing mixtures of trees and grass

CSIR Research Space (South Africa)

Scholes, RJ

2003-12-01

Full Text Available The relationship between grass production and the quantity of trees in mixed tree-grass ecosystems (savannas) is convex for all or most of its range. In other words, the grass production declines more steeply per unit increase in tree quantity...

19. Positive definite functions and dual pairs of locally convex spaces

Directory of Open Access Journals (Sweden)

Daniel Alpay

2018-01-01

Full Text Available Using pairs of locally convex topological vector spaces in duality and topologies defined by directed families of sets bounded with respect to the duality, we prove general factorization theorems and general dilation theorems for operator-valued positive definite functions.

20. Intracranial Convexity Lipoma with Massive Calcification: Case Report

Energy Technology Data Exchange (ETDEWEB)

Kim, Eung Tae; Park, Dong Woo; Ryu, Jeong Ah; Park, Choong Ki; Lee, Young Jun; Lee, Seung Ro [Dept. of Radiology, Hanyang University College of Medicine, Seoul (Korea, Republic of)

2011-12-15

Intracranial lipoma is a rare entity, accounting for less than 0.5% of intracranial tumors, which usually develops in the callosal cisterns. We report a case of lipoma with an unusual location; in the high parietal convexity combined with massive calcification, and no underlying vascular malformation or congenital anomaly.

1. A duality recipe for non-convex variational problems

Science.gov (United States)

Bouchitté, Guy; Phan, Minh

2018-03-01

The aim of this paper is to present a general convexification recipe that can be useful for studying non-convex variational problems. In particular, this allows us to treat such problems by using a powerful primal-dual scheme. Possible further developments and open issues are given. xml:lang="fr"

2. A note on the nucleolus for 2-convex TU games

NARCIS (Netherlands)

Driessen, Theo; Hou, D.

For 2-convex n-person cooperative TU games, the nucleolus is determined as some type of constrained equal award rule. Its proof is based on Maschler, Peleg, and Shapley’s geometrical characterization for the intersection of the prekernel with the core. Pairwise bargaining ranges within the core are

3. A convex optimization approach for solving large scale linear systems

Directory of Open Access Journals (Sweden)

Debora Cores

2017-01-01

Full Text Available The well-known Conjugate Gradient (CG method minimizes a strictly convex quadratic function for solving large-scale linear system of equations when the coefficient matrix is symmetric and positive definite. In this work we present and analyze a non-quadratic convex function for solving any large-scale linear system of equations regardless of the characteristics of the coefficient matrix. For finding the global minimizers, of this new convex function, any low-cost iterative optimization technique could be applied. In particular, we propose to use the low-cost globally convergent Spectral Projected Gradient (SPG method, which allow us to extend this optimization approach for solving consistent square and rectangular linear system, as well as linear feasibility problem, with and without convex constraints and with and without preconditioning strategies. Our numerical results indicate that the new scheme outperforms state-of-the-art iterative techniques for solving linear systems when the symmetric part of the coefficient matrix is indefinite, and also for solving linear feasibility problems.

4. Transonic shock wave. Boundary layer interaction at a convex wall

NARCIS (Netherlands)

Koren, B.; Bannink, W.J.

1984-01-01

A standard finite element procedure has been applied to the problem of transonic shock wave – boundary layer interaction at a convex wall. The method is based on the analytical Bohning-Zierep model, where the boundary layer is perturbed by a weak normal shock wave which shows a singular pressure

5. Computing Convex Coverage Sets for Faster Multi-Objective Coordination

NARCIS (Netherlands)

Roijers, D.M.; Whiteson, S.; Oliehoek, F.A.

2015-01-01

In this article, we propose new algorithms for multi-objective coordination graphs (MO-CoGs). Key to the efficiency of these algorithms is that they compute a convex coverage set (CCS) instead of a Pareto coverage set (PCS). Not only is a CCS a sufficient solution set for a large class of problems,

6. Flat tori in three-dimensional space and convex integration.

Science.gov (United States)

Borrelli, Vincent; Jabrane, Saïd; Lazarus, Francis; Thibert, Boris

2012-05-08

It is well-known that the curvature tensor is an isometric invariant of C(2) Riemannian manifolds. This invariant is at the origin of the rigidity observed in Riemannian geometry. In the mid 1950s, Nash amazed the world mathematical community by showing that this rigidity breaks down in regularity C(1). This unexpected flexibility has many paradoxical consequences, one of them is the existence of C(1) isometric embeddings of flat tori into Euclidean three-dimensional space. In the 1970s and 1980s, M. Gromov, revisiting Nash's results introduced convex integration theory offering a general framework to solve this type of geometric problems. In this research, we convert convex integration theory into an algorithm that produces isometric maps of flat tori. We provide an implementation of a convex integration process leading to images of an embedding of a flat torus. The resulting surface reveals a C(1) fractal structure: Although the tangent plane is defined everywhere, the normal vector exhibits a fractal behavior. Isometric embeddings of flat tori may thus appear as a geometric occurrence of a structure that is simultaneously C(1) and fractal. Beyond these results, our implementation demonstrates that convex integration, a theory still confined to specialists, can produce computationally tractable solutions of partial differential relations.

7. A fast direct sampling algorithm for equilateral closed polygons

International Nuclear Information System (INIS)

Cantarella, Jason; Duplantier, Bertrand; Shonkwiler, Clayton; Uehara, Erica

2016-01-01

Sampling equilateral closed polygons is of interest in the statistical study of ring polymers. Over the past 30 years, previous authors have proposed a variety of simple Markov chain algorithms (but have not been able to show that they converge to the correct probability distribution) and complicated direct samplers (which require extended-precision arithmetic to evaluate numerically unstable polynomials). We present a simple direct sampler which is fast and numerically stable, and analyze its runtime using a new formula for the volume of equilateral polygon space as a Dirichlet-type integral. (paper)

8. Polygons of global undersea features for geographic searches

Science.gov (United States)

Hartwell, Stephen R.; Wingfield, Dana K.; Allwardt, Alan O.; Lightsom, Frances L.; Wong, Florence L.

2018-01-01

A shapefile of 311 undersea features from all major oceans and seas has been created as an aid for retrieving georeferenced information resources. Geospatial information systems with the capability to search user-defined, polygonal geographic areas will be able to utilize this shapefile or secondary products derived from it, such as linked data based on well-known text representations of the individual polygons within the shapefile. Version 1.1 of this report also includes a linked data representation of 299 of these features and their spatial extents.

9. Decomposition of orthogonal polygons in a set of rectanglеs

OpenAIRE

Shestakov, E.; Voronov, A.

2009-01-01

Algorithm for covering orthogonal integrated circuit layout objects is considered. Objects of the research are special single-connected orthogonal polygons which are generated during decomposition of any multiply connected polygon in a set of single-connected orthogonal polygons. Developed algorithm for covering polygons based on the mathematical techinque of logic matrix transformation. Results described in this paper, can be applied in computer geometry and image analysis.

10. Short Run Profit Maximization in a Convex Analysis Framework

Directory of Open Access Journals (Sweden)

Ilko Vrankic

2017-03-01

Full Text Available In this article we analyse the short run profit maximization problem in a convex analysis framework. The goal is to apply the results of convex analysis due to unique structure of microeconomic phenomena on the known short run profit maximization problem where the results from convex analysis are deductively applied. In the primal optimization model the technology in the short run is represented by the short run production function and the normalized profit function, which expresses profit in the output units, is derived. In this approach the choice variable is the labour quantity. Alternatively, technology is represented by the real variable cost function, where costs are expressed in the labour units, and the normalized profit function is derived, this time expressing profit in the labour units. The choice variable in this approach is the quantity of production. The emphasis in these two perspectives of the primal approach is given to the first order necessary conditions of both models which are the consequence of enveloping the closed convex set describing technology with its tangents. The dual model includes starting from the normalized profit function and recovering the production function, and alternatively the real variable cost function. In the first perspective of the dual approach the choice variable is the real wage, and in the second it is the real product price expressed in the labour units. It is shown that the change of variables into parameters and parameters into variables leads to both optimization models which give the same system of labour demand and product supply functions and their inverses. By deductively applying the results of convex analysis the comparative statics results are derived describing the firm's behaviour in the short run.

11. A simple algorithm for computing positively weighted straight skeletons of monotone polygons.

Science.gov (United States)

Biedl, Therese; Held, Martin; Huber, Stefan; Kaaser, Dominik; Palfrader, Peter

2015-02-01

We study the characteristics of straight skeletons of monotone polygonal chains and use them to devise an algorithm for computing positively weighted straight skeletons of monotone polygons. Our algorithm runs in [Formula: see text] time and [Formula: see text] space, where n denotes the number of vertices of the polygon.

12. Spectral analysis of point-vortex dynamics : first application to vortex polygons in a circular domain

NARCIS (Netherlands)

Speetjens, M.F.M.; Meleshko, V.V.; Heijst, van G.J.F.

2014-01-01

The present study addresses the classical problem of the dynamics and stability of a cluster of N point vortices of equal strength arranged in a polygonal configuration ("N-vortex polygons"). In unbounded domains, such N-vortex polygons are unconditionally stable for N

13. Irradiation and contamination owed to nuclear weapons experimentations on the Kazakhstan Semipalatinsk polygon

International Nuclear Information System (INIS)

Chenal, C.

1996-01-01

Semipalatinsk in Kazakhstan was one of the nuclear weapons polygon for atmospheric, excavation and underground tests. After a description of the actual state of the polygon, a dosimetric approach inside and outside the polygon is presented from 1949 to 1989. (A.B.). 5 refs., 3 figs., 5 tabs

14. Patch-based image segmentation of satellite imagery using minimum spanning tree construction

Energy Technology Data Exchange (ETDEWEB)

Skurikhin, Alexei N [Los Alamos National Laboratory

2010-01-01

We present a method for hierarchical image segmentation and feature extraction. This method builds upon the combination of the detection of image spectral discontinuities using Canny edge detection and the image Laplacian, followed by the construction of a hierarchy of segmented images of successively reduced levels of details. These images are represented as sets of polygonized pixel patches (polygons) attributed with spectral and structural characteristics. This hierarchy forms the basis for object-oriented image analysis. To build fine level-of-detail representation of the original image, seed partitions (polygons) are built upon a triangular mesh composed of irregular sized triangles, whose spatial arrangement is adapted to the image content. This is achieved by building the triangular mesh on the top of the detected spectral discontinuities that form a network of constraints for the Delaunay triangulation. A polygonized image is represented as a spatial network in the form of a graph with vertices which correspond to the polygonal partitions and graph edges reflecting pairwise partitions relations. Image graph partitioning is based on the iterative graph oontraction using Boruvka's Minimum Spanning Tree algorithm. An important characteristic of the approach is that the agglomeration of partitions is constrained by the detected spectral discontinuities; thus the shapes of agglomerated partitions are more likely to correspond to the outlines of real-world objects.

15. PolyFit: Polygonal Surface Reconstruction from Point Clouds

KAUST Repository

Nan, Liangliang; Wonka, Peter

2017-01-01

We propose a novel framework for reconstructing lightweight polygonal surfaces from point clouds. Unlike traditional methods that focus on either extracting good geometric primitives or obtaining proper arrangements of primitives, the emphasis of this work lies in intersecting the primitives (planes only) and seeking for an appropriate combination of them to obtain a manifold polygonal surface model without boundary.,We show that reconstruction from point clouds can be cast as a binary labeling problem. Our method is based on a hypothesizing and selection strategy. We first generate a reasonably large set of face candidates by intersecting the extracted planar primitives. Then an optimal subset of the candidate faces is selected through optimization. Our optimization is based on a binary linear programming formulation under hard constraints that enforce the final polygonal surface model to be manifold and watertight. Experiments on point clouds from various sources demonstrate that our method can generate lightweight polygonal surface models of arbitrary piecewise planar objects. Besides, our method is capable of recovering sharp features and is robust to noise, outliers, and missing data.

16. Determination of wave direction from linear and polygonal arrays

Digital Repository Service at National Institute of Oceanography (India)

Fernandes, A.A; Gouveia, A; Nagarajan, R.

documentation of Borgman (1974) in case of linear arrays; and the second issue being the failure of Esteva (1976, 1977) to correctly determine wave directions over the design range 25 to 7 sec of his polygonal array. This paper presents requisite documentation...

17. Vibrational resonances of nonrigid vehicles: Polygonization and ripple patterns

NARCIS (Netherlands)

Dekker, H.

2009-01-01

The well-known phenomenon of ripples on roads has its modern counterpart in ripple patterns on railroads and polygonization of wheels on state-of-the-art lightrail streetcars. Here we study an idealized mechanical suspension model for the vibrational frequency response of a buggy with a nonrigid

18. design chart procedures for polygonal concrete-filled steel columns

African Journals Online (AJOL)

hexagonal and octagonal steel-concrete composite columns subjected to ... This paper also outlines procedures that will enable preparation of ... buildings and in a variety of large-span building ... Likewise, hot-rolled steel tubes are used while ... small moderate large. Fig. 2. Possible arrangement of composite polygonal ...

19. A Teaching Polygon Makes Learning a Community Enterprise

Science.gov (United States)

Colgan, Mark; DeLong, Matt

2015-01-01

In order to strengthen departmental collegiality and improve teaching, our mathematics department instituted a Teaching Polygon. Building on the faculty development idea of Teaching Squares, each member of our department visited one class taught by every other department member in a round-robin fashion during the school year. The visits were…

20. Sub-wavelength resonances in polygonal metamaterial cylinders

DEFF Research Database (Denmark)

Arslanagic, Samel; Breinbjerg, Olav

2008-01-01

It has been shown that the sub-wavelength resonances of circular MTM cylinders also occur for polygonal MTM cylinders. This is the case for lossless and non-dispersive cylinders as well as lossy and dispersive cylinders. The sub-wavelength resonances are thus not limited to structures of canonical...

1. Polygons, Pillars and Pavilions: Discovering Connections between Geometry and Architecture

Science.gov (United States)

2017-01-01

Crowning the second semester of geometry, taught within a Catholic middle school, the author's students explored connections between the geometry of regular polygons and architecture of local buildings. They went on to explore how these principles apply famous buildings around the world such as the monuments of Washington, D.C. and the elliptical…

2. Computing the Fréchet distance between folded polygons

NARCIS (Netherlands)

Cook IV, A.F.; Driemel, A.; Sherette, J.; Wenk, C.

2015-01-01

Computing the Fréchet distance for surfaces is a surprisingly hard problem and the only known polynomial-time algorithm is limited to computing it between flat surfaces. We study the problem of computing the Fréchet distance for a class of non-flat surfaces called folded polygons. We present a

3. PolyFit: Polygonal Surface Reconstruction from Point Clouds

KAUST Repository

Nan, Liangliang

2017-12-25

We propose a novel framework for reconstructing lightweight polygonal surfaces from point clouds. Unlike traditional methods that focus on either extracting good geometric primitives or obtaining proper arrangements of primitives, the emphasis of this work lies in intersecting the primitives (planes only) and seeking for an appropriate combination of them to obtain a manifold polygonal surface model without boundary.,We show that reconstruction from point clouds can be cast as a binary labeling problem. Our method is based on a hypothesizing and selection strategy. We first generate a reasonably large set of face candidates by intersecting the extracted planar primitives. Then an optimal subset of the candidate faces is selected through optimization. Our optimization is based on a binary linear programming formulation under hard constraints that enforce the final polygonal surface model to be manifold and watertight. Experiments on point clouds from various sources demonstrate that our method can generate lightweight polygonal surface models of arbitrary piecewise planar objects. Besides, our method is capable of recovering sharp features and is robust to noise, outliers, and missing data.

4. Hermite-Hadamard type inequality for φ{sub h}-convex stochastic processes

Energy Technology Data Exchange (ETDEWEB)

Sarıkaya, Mehmet Zeki, E-mail: sarikayamz@gmail.com [Department of Mathematics, Faculty of Science and Arts, Düzce University, Düzce (Turkey); Kiriş, Mehmet Eyüp, E-mail: kiris@aku.edu.tr [Department of Mathematics, Institute of Science and Arts, Afyon Kocatepe University, Afyonkarahisar (Turkey); Çelik, Nuri, E-mail: ncelik@bartin.edu.tr [Department of Statistics, Faculty of Science, Bartın University, Bartın-Turkey (Turkey)

2016-04-18

The main aim of the present paper is to introduce φ{sub h}-convex stochastic processes and we investigate main properties of these mappings. Moreover, we prove the Hadamard-type inequalities for φ{sub h}-convex stochastic processes. We also give some new general inequalities for φ{sub h}-convex stochastic processes.

5. Modeling of chromosome intermingling by partially overlapping uniform random polygons.

Science.gov (United States)

Blackstone, T; Scharein, R; Borgo, B; Varela, R; Diao, Y; Arsuaga, J

2011-03-01

During the early phase of the cell cycle the eukaryotic genome is organized into chromosome territories. The geometry of the interface between any two chromosomes remains a matter of debate and may have important functional consequences. The Interchromosomal Network model (introduced by Branco and Pombo) proposes that territories intermingle along their periphery. In order to partially quantify this concept we here investigate the probability that two chromosomes form an unsplittable link. We use the uniform random polygon as a crude model for chromosome territories and we model the interchromosomal network as the common spatial region of two overlapping uniform random polygons. This simple model allows us to derive some rigorous mathematical results as well as to perform computer simulations easily. We find that the probability that one uniform random polygon of length n that partially overlaps a fixed polygon is bounded below by 1 − O(1/√n). We use numerical simulations to estimate the dependence of the linking probability of two uniform random polygons (of lengths n and m, respectively) on the amount of overlapping. The degree of overlapping is parametrized by a parameter [Formula: see text] such that [Formula: see text] indicates no overlapping and [Formula: see text] indicates total overlapping. We propose that this dependence relation may be modeled as f (ε, m, n) = [Formula: see text]. Numerical evidence shows that this model works well when [Formula: see text] is relatively large (ε ≥ 0.5). We then use these results to model the data published by Branco and Pombo and observe that for the amount of overlapping observed experimentally the URPs have a non-zero probability of forming an unsplittable link.

6. A Convex Optimization Model and Algorithm for Retinex

Directory of Open Access Journals (Sweden)

Qing-Nan Zhao

2017-01-01

Full Text Available Retinex is a theory on simulating and explaining how human visual system perceives colors under different illumination conditions. The main contribution of this paper is to put forward a new convex optimization model for Retinex. Different from existing methods, the main idea is to rewrite a multiplicative form such that the illumination variable and the reflection variable are decoupled in spatial domain. The resulting objective function involves three terms including the Tikhonov regularization of the illumination component, the total variation regularization of the reciprocal of the reflection component, and the data-fitting term among the input image, the illumination component, and the reciprocal of the reflection component. We develop an alternating direction method of multipliers (ADMM to solve the convex optimization model. Numerical experiments demonstrate the advantages of the proposed model which can decompose an image into the illumination and the reflection components.

7. Convexity and the Euclidean Metric of Space-Time

Directory of Open Access Journals (Sweden)

Nikolaos Kalogeropoulos

2017-02-01

Full Text Available We address the reasons why the “Wick-rotated”, positive-definite, space-time metric obeys the Pythagorean theorem. An answer is proposed based on the convexity and smoothness properties of the functional spaces purporting to provide the kinematic framework of approaches to quantum gravity. We employ moduli of convexity and smoothness which are eventually extremized by Hilbert spaces. We point out the potential physical significance that functional analytical dualities play in this framework. Following the spirit of the variational principles employed in classical and quantum Physics, such Hilbert spaces dominate in a generalized functional integral approach. The metric of space-time is induced by the inner product of such Hilbert spaces.

8. On the stretch factor of convex Delaunay graphs

Directory of Open Access Journals (Sweden)

Prosenjit Bose

2010-06-01

Full Text Available Let C be a compact and convex set in the plane that contains the origin in its interior, and let S be a finite set of points in the plane. The Delaunay graph DGC(S of S is defined to be the dual of the Voronoi diagram of S with respect to the convex distance function defined by C. We prove that DGC(S is a t-spanner for S, for some constant t that depends only on the shape of the set C. Thus, for any two points p and q in S, the graph DGC(S contains a path between p and q whose Euclidean length is at most t times the Euclidean distance between p and q.

9. A Survey on Operator Monotonicity, Operator Convexity, and Operator Means

Directory of Open Access Journals (Sweden)

Pattrawut Chansangiam

2015-01-01

Full Text Available This paper is an expository devoted to an important class of real-valued functions introduced by Löwner, namely, operator monotone functions. This concept is closely related to operator convex/concave functions. Various characterizations for such functions are given from the viewpoint of differential analysis in terms of matrix of divided differences. From the viewpoint of operator inequalities, various characterizations and the relationship between operator monotonicity and operator convexity are given by Hansen and Pedersen. In the viewpoint of measure theory, operator monotone functions on the nonnegative reals admit meaningful integral representations with respect to Borel measures on the unit interval. Furthermore, Kubo-Ando theory asserts the correspondence between operator monotone functions and operator means.

10. Convex variational problems linear, nearly linear and anisotropic growth conditions

CERN Document Server

Bildhauer, Michael

2003-01-01

The author emphasizes a non-uniform ellipticity condition as the main approach to regularity theory for solutions of convex variational problems with different types of non-standard growth conditions. This volume first focuses on elliptic variational problems with linear growth conditions. Here the notion of a "solution" is not obvious and the point of view has to be changed several times in order to get some deeper insight. Then the smoothness properties of solutions to convex anisotropic variational problems with superlinear growth are studied. In spite of the fundamental differences, a non-uniform ellipticity condition serves as the main tool towards a unified view of the regularity theory for both kinds of problems.

11. Moduli spaces of convex projective structures on surfaces

DEFF Research Database (Denmark)

Fock, V. V.; Goncharov, A. B.

2007-01-01

We introduce explicit parametrisations of the moduli space of convex projective structures on surfaces, and show that the latter moduli space is identified with the higher Teichmüller space for defined in [V.V. Fock, A.B. Goncharov, Moduli spaces of local systems and higher Teichmüller theory, math.......AG/0311149]. We investigate the cluster structure of this moduli space, and define its quantum version....

12. Constrained convex minimization via model-based excessive gap

OpenAIRE

Tran Dinh, Quoc; Cevher, Volkan

2014-01-01

We introduce a model-based excessive gap technique to analyze first-order primal- dual methods for constrained convex minimization. As a result, we construct new primal-dual methods with optimal convergence rates on the objective residual and the primal feasibility gap of their iterates separately. Through a dual smoothing and prox-function selection strategy, our framework subsumes the augmented Lagrangian, and alternating methods as special cases, where our rates apply.

13. Free locally convex spaces with a small base

Czech Academy of Sciences Publication Activity Database

Gabriyelyan, S.; Kąkol, Jerzy

2017-01-01

Roč. 111, č. 2 (2017), s. 575-585 ISSN 1578-7303 R&D Projects: GA ČR GF16-34860L Institutional support: RVO:67985840 Keywords : compact resolution * free locally convex space * G-base Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics Impact factor: 0.690, year: 2016 http://link.springer.com/article/10.1007%2Fs13398-016-0315-1

14. A formulation of combinatorial auction via reverse convex programming

Directory of Open Access Journals (Sweden)

Henry Schellhorn

2005-01-01

of this problem, where orders are aggregated and integrality constraints are relaxed. It was proved that this problem could be solved efficiently in two steps by calculating two fixed points, first the fixed point of a contraction mapping, and then of a set-valued function. In this paper, we generalize the problem to incorporate constraints on maximum price changes between two auction rounds. This generalized problem cannot be solved by the aforementioned methods and necessitates reverse convex programming techniques.

15. Some fixed point theorems on non-convex sets

Directory of Open Access Journals (Sweden)

2017-10-01

Full Text Available In this paper, we prove that if $K$ is a nonempty weakly compact set in a Banach space $X$, $T:K\\to K$ is a nonexpansive map satisfying $\\frac{x+Tx}{2}\\in K$ for all $x\\in K$ and if $X$ is $3-$uniformly convex or $X$ has the Opial property, then $T$ has a fixed point in $K.$

16. PENNON: A code for convex nonlinear and semidefinite programming

Czech Academy of Sciences Publication Activity Database

Kočvara, Michal; Stingl, M.

2003-01-01

Roč. 18, č. 3 (2003), s. 317-333 ISSN 1055-6788 R&D Projects: GA ČR GA201/00/0080 Grant - others:BMBF(DE) 03ZOM3ER Institutional research plan: CEZ:AV0Z1075907 Keywords : convex programming * semidefinite programming * large-scale problems Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 0.306, year: 2003

17. Convex Clustering: An Attractive Alternative to Hierarchical Clustering

Science.gov (United States)

Chen, Gary K.; Chi, Eric C.; Ranola, John Michael O.; Lange, Kenneth

2015-01-01

The primary goal in cluster analysis is to discover natural groupings of objects. The field of cluster analysis is crowded with diverse methods that make special assumptions about data and address different scientific aims. Despite its shortcomings in accuracy, hierarchical clustering is the dominant clustering method in bioinformatics. Biologists find the trees constructed by hierarchical clustering visually appealing and in tune with their evolutionary perspective. Hierarchical clustering operates on multiple scales simultaneously. This is essential, for instance, in transcriptome data, where one may be interested in making qualitative inferences about how lower-order relationships like gene modules lead to higher-order relationships like pathways or biological processes. The recently developed method of convex clustering preserves the visual appeal of hierarchical clustering while ameliorating its propensity to make false inferences in the presence of outliers and noise. The solution paths generated by convex clustering reveal relationships between clusters that are hidden by static methods such as k-means clustering. The current paper derives and tests a novel proximal distance algorithm for minimizing the objective function of convex clustering. The algorithm separates parameters, accommodates missing data, and supports prior information on relationships. Our program CONVEXCLUSTER incorporating the algorithm is implemented on ATI and nVidia graphics processing units (GPUs) for maximal speed. Several biological examples illustrate the strengths of convex clustering and the ability of the proximal distance algorithm to handle high-dimensional problems. CONVEXCLUSTER can be freely downloaded from the UCLA Human Genetics web site at http://www.genetics.ucla.edu/software/ PMID:25965340

18. Numerical modeling of isothermal compositional grading by convex splitting methods

KAUST Repository

Li, Yiteng

2017-04-09

In this paper, an isothermal compositional grading process is simulated based on convex splitting methods with the Peng-Robinson equation of state. We first present a new form of gravity/chemical equilibrium condition by minimizing the total energy which consists of Helmholtz free energy and gravitational potential energy, and incorporating Lagrange multipliers for mass conservation. The time-independent equilibrium equations are transformed into a system of transient equations as our solution strategy. It is proved our time-marching scheme is unconditionally energy stable by the semi-implicit convex splitting method in which the convex part of Helmholtz free energy and its derivative are treated implicitly and the concave parts are treated explicitly. With relaxation factor controlling Newton iteration, our method is able to converge to a solution with satisfactory accuracy if a good initial estimate of mole compositions is provided. More importantly, it helps us automatically split the unstable single phase into two phases, determine the existence of gas-oil contact (GOC) and locate its position if GOC does exist. A number of numerical examples are presented to show the performance of our method.

19. Speech Enhancement by Modified Convex Combination of Fractional Adaptive Filtering

Directory of Open Access Journals (Sweden)

2014-12-01

Full Text Available This paper presents new adaptive filtering techniques used in speech enhancement system. Adaptive filtering schemes are subjected to different trade-offs regarding their steady-state misadjustment, speed of convergence, and tracking performance. Fractional Least-Mean-Square (FLMS is a new adaptive algorithm which has better performance than the conventional LMS algorithm. Normalization of LMS leads to better performance of adaptive filter. Furthermore, convex combination of two adaptive filters improves its performance. In this paper, new convex combinational adaptive filtering methods in the framework of speech enhancement system are proposed. The proposed methods utilize the idea of normalization and fractional derivative, both in the design of different convex mixing strategies and their related component filters. To assess our proposed methods, simulation results of different LMS-based algorithms based on their convergence behavior (i.e., MSE plots and different objective and subjective criteria are compared. The objective and subjective evaluations include examining the results of SNR improvement, PESQ test, and listening tests for dual-channel speech enhancement. The powerful aspects of proposed methods are their low complexity, as expected with all LMS-based methods, along with a high convergence rate.

20. Measures of symmetry for convex sets and stability

CERN Document Server

Toth, Gabor

2015-01-01

This textbook treats two important and related matters in convex geometry: the quantification of symmetry of a convex set—measures of symmetry—and the degree to which convex sets that nearly minimize such measures of symmetry are themselves nearly symmetric—the phenomenon of stability. By gathering the subject’s core ideas and highlights around Grünbaum’s general notion of measure of symmetry, it paints a coherent picture of the subject, and guides the reader from the basics to the state-of-the-art. The exposition takes various paths to results in order to develop the reader’s grasp of the unity of ideas, while interspersed remarks enrich the material with a behind-the-scenes view of corollaries and logical connections, alternative proofs, and allied results from the literature. Numerous illustrations elucidate definitions and key constructions, and over 70 exercises—with hints and references for the more difficult ones—test and sharpen the reader’s comprehension. The presentation includes:...

1. Measurement system for diffraction efficiency of convex gratings

Science.gov (United States)

Liu, Peng; Chen, Xin-hua; Zhou, Jian-kang; Zhao, Zhi-cheng; Liu, Quan; Luo, Chao; Wang, Xiao-feng; Tang, Min-xue; Shen, Wei-min

2017-08-01

A measurement system for diffraction efficiency of convex gratings is designed. The measurement system mainly includes four components as a light source, a front system, a dispersing system that contains a convex grating, and a detector. Based on the definition and measuring principle of diffraction efficiency, the optical scheme of the measurement system is analyzed and the design result is given. Then, in order to validate the feasibility of the designed system, the measurement system is set up and the diffraction efficiency of a convex grating with the aperture of 35 mm, the curvature-radius of 72mm, the blazed angle of 6.4°, the grating period of 2.5μm and the working waveband of 400nm-900nm is tested. Based on GUM (Guide to the Expression of Uncertainty in Measurement), the uncertainties in the measuring results are evaluated. The measured diffraction efficiency data are compared to the theoretical ones, which are calculated based on the grating groove parameters got by an atomic force microscope and Rigorous Couple Wave Analysis, and the reliability of the measurement system is illustrated. Finally, the measurement performance of the system is analyzed and tested. The results show that, the testing accuracy, the testing stability and the testing repeatability are 2.5%, 0.085% and 3.5% , respectively.

2. Formation of Sheeting Joints as a Result of Compression Parallel to Convex Surfaces, With Examples from Yosemite National Park, California

Science.gov (United States)

Martel, S. J.

2008-12-01

downstream curvature promotes the opening of the joints, whereas the compressive stress acting across the U-shaped valley promotes closure of the joints. Apparently the former more than compensates for the latter. Finally, the abundance of sheeting joints on convex ridges, where erosion is a local minimum, coupled with their scarcity in the adjacent concave valleys, where erosion is a local maximum, is consistent with hypothesis 1 but inconsistent with hypothesis 2.

3. Logarithmic solution to the line-polygon intersection problem. 127

International Nuclear Information System (INIS)

Siddon, R.L.; Barth, N.H.

1987-01-01

Algorithmic solution for a special case of the line - polygon intersection problem has been developed. The special case involves repeated solution to the problem where one point on the line is held fixed and the other allowed to vary. In addition, the fixed point on the line must lie outside the rectangle defined by the extrema of the polygon and varying point. In radiotherapy applications, the fixed point corresponds to the source of radiation, whereas the varying points refer to the grid of multiple calculation points. For smooth contours of 100-200 vertices, it is found that the new algorithm results in a CPU savings of approximately a factor of 3-5. 3 refs.; 4 figs

4. Exact moduli space metrics for hyperbolic vortex polygons

International Nuclear Information System (INIS)

Krusch, S.; Speight, J. M.

2010-01-01

Exact metrics on some totally geodesic submanifolds of the moduli space of static hyperbolic N-vortices are derived. These submanifolds, denoted as Σ n,m , are spaces of C n -invariant vortex configurations with n single vortices at the vertices of a regular polygon and m=N-n coincident vortices at the polygon's center. The geometric properties of Σ n,m are investigated, and it is found that Σ n,n-1 is isometric to the hyperbolic plane of curvature -(3πn) -1 . The geodesic flow on Σ n,m and a geometrically natural variant of geodesic flow recently proposed by Collie and Tong ['The dynamics of Chern-Simons vortices', Phys. Rev. D Part. Fields Gravit. Cosmol. 78, 065013 (2008);e-print arXiv:hep-th/0805.0602] are analyzed in detail.

5. Electron localization and optical absorption of polygonal quantum rings

Science.gov (United States)

Sitek, Anna; Serra, Llorenç; Gudmundsson, Vidar; Manolescu, Andrei

2015-06-01

We investigate theoretically polygonal quantum rings and focus mostly on the triangular geometry where the corner effects are maximal. Such rings can be seen as short core-shell nanowires, a generation of semiconductor heterostructures with multiple applications. We show how the geometry of the sample determines the electronic energy spectrum, and also the localization of electrons, with effects on the optical absorption. In particular, we show that irrespective of the ring shape low-energy electrons are always attracted by corners and are localized in their vicinity. The absorption spectrum in the presence of a magnetic field shows only two peaks within the corner-localized state domain, each associated with different circular polarization. This picture may be changed by an external electric field which allows previously forbidden transitions, and thus enables the number of corners to be determined. We show that polygonal quantum rings allow absorption of waves from distant ranges of the electromagnetic spectrum within one sample.

6. Selection of industrial robots using the Polygons area method

Directory of Open Access Journals (Sweden)

Mortaza Honarmande Azimi

2014-08-01

Full Text Available Selection of robots from the several proposed alternatives is a very important and tedious task. Decision makers are not limited to one method and several methods have been proposed for solving this problem. This study presents Polygons Area Method (PAM as a multi attribute decision making method for robot selection problem. In this method, the maximum polygons area obtained from the attributes of an alternative robot on the radar chart is introduced as a decision-making criterion. The results of this method are compared with other typical multiple attribute decision-making methods (SAW, WPM, TOPSIS, and VIKOR by giving two examples. To find similarity in ranking given by different methods, Spearman’s rank correlation coefficients are obtained for different pairs of MADM methods. It was observed that the introduced method is in good agreement with other well-known MADM methods in the robot selection problem.

7. Invariant polygons in systems with grazing-sliding.

Science.gov (United States)

Szalai, R; Osinga, H M

2008-06-01

The paper investigates generic three-dimensional nonsmooth systems with a periodic orbit near grazing-sliding. We assume that the periodic orbit is unstable with complex multipliers so that two dominant frequencies are present in the system. Because grazing-sliding induces a dimension loss and the instability drives every trajectory into sliding, the system has an attractor that consists of forward sliding orbits. We analyze this attractor in a suitably chosen Poincare section using a three-parameter generalized map that can be viewed as a normal form. We show that in this normal form the attractor must be contained in a finite number of lines that intersect in the vertices of a polygon. However the attractor is typically larger than the associated polygon. We classify the number of lines involved in forming the attractor as a function of the parameters. Furthermore, for fixed values of parameters we investigate the one-dimensional dynamics on the attractor.

8. Extending backward polygon beam tracing to glossy scattering surfaces

CSIR Research Space (South Africa)

Duvenhage, B

2011-05-01

Full Text Available to render caustics that could not otherwise be sim- ulated efficiently using the high fidelity forward raytracing and radiosity rendering techniques of the time. Similar to what Heckbert and Hanrahan proposed, Watt [Wat90] used backward polygon beam....: Adaptive radiosity textures for bidi- rectional ray tracing. In SIGGRAPH ?90: Proceedings of the 17th Annual Conference on Computer graphics and Interactive Techniques (New York, NY, USA, 1990), ACM Press, New York, pp. 145?154. [HH84] HECKBERT P. S...

9. Measured Hydrologic Storage Characteristics of Three Major Ice Wedge Polygon Types, Barrow, Alaska

Science.gov (United States)

Chamberlain, A. J.; Liljedahl, A.; Wilson, C. J.; Cable, W.; Romanovsky, V. E.

2014-12-01

Model simulations have suggested that the hydrologic fluxes and stores of Arctic wetlands are constrained by the micro-topographical features of ice wedge polygons, which are abundant in lowland tundra landscapes. Recently observed changes in ice wedge polygon landscapes - in particular, ice wedge degradation and trough formation - emphasize the need to better understand how differing ice wedge polygon morphologies affect the larger hydrologic system. Here we present three seasons of measured end-of-winter snow accumulation, continuous soil moisture and water table elevations, and repeated frost table mapping. Together, these describe the hydrologic characteristics of three main ice wedge polygon types: low centered polygons with limited trough development (representative of a ~500 year old vegetated drained thaw lake basin), and low- and high-centered polygons with well-defined troughs. Dramatic spatiotemporal variability exists both between polygon types and between the features of an individual polygon (e.g. troughs, centers, rims). Landscape-scale end-of-winter snow water equivalent is similar between polygon types, while the sub-polygon scale distribution of the surface water differs, both as snow and as ponded water. Some sub-polygon features appear buffered against large variations in water levels, while others display periods of prolonged recessions and large responses to rain events. Frost table elevations in general mimic the ground surface topography, but with spatiotemporal variability in thaw rate. The studied thaw seasons represented above long-term average rainfall, and in 2014, record high June precipitation. Differing ice wedge polygon types express dramatically different local hydrology, despite nearly identical climate forcing and landscape-scale snow accumulation, making ice wedge polygons an important component when describing the Arctic water, nutrient and energy system.

10. A Novel Polygonal Finite Element Method: Virtual Node Method

Science.gov (United States)

Tang, X. H.; Zheng, C.; Zhang, J. H.

2010-05-01

Polygonal finite element method (PFEM), which can construct shape functions on polygonal elements, provides greater flexibility in mesh generation. However, the non-polynomial form of traditional PFEM, such as Wachspress method and Mean Value method, leads to inexact numerical integration. Since the integration technique for non-polynomial functions is immature. To overcome this shortcoming, a great number of integration points have to be used to obtain sufficiently exact results, which increases computational cost. In this paper, a novel polygonal finite element method is proposed and called as virtual node method (VNM). The features of present method can be list as: (1) It is a PFEM with polynomial form. Thereby, Hammer integral and Gauss integral can be naturally used to obtain exact numerical integration; (2) Shape functions of VNM satisfy all the requirements of finite element method. To test the performance of VNM, intensive numerical tests are carried out. It found that, in standard patch test, VNM can achieve significantly better results than Wachspress method and Mean Value method. Moreover, it is observed that VNM can achieve better results than triangular 3-node elements in the accuracy test.

11. Properties of regular polygons of coupled microring resonators.

Science.gov (United States)

Chremmos, Ioannis; Uzunoglu, Nikolaos

2007-11-01

The resonant properties of a closed and symmetric cyclic array of N coupled microring resonators (coupled-microring resonator regular N-gon) are for the first time determined analytically by applying the transfer matrix approach and Floquet theorem for periodic propagation in cylindrically symmetric structures. By solving the corresponding eigenvalue problem with the field amplitudes in the rings as eigenvectors, it is shown that, for even or odd N, this photonic molecule possesses 1 + N/2 or 1+N resonant frequencies, respectively. The condition for resonances is found to be identical to the familiar dispersion equation of the infinite coupled-microring resonator waveguide with a discrete wave vector. This result reveals the so far latent connection between the two optical structures and is based on the fact that, for a regular polygon, the field transfer matrix over two successive rings is independent of the polygon vertex angle. The properties of the resonant modes are discussed in detail using the illustration of Brillouin band diagrams. Finally, the practical application of a channel-dropping filter based on polygons with an even number of rings is also analyzed.

12. Fast incorporation of optical flow into active polygons.

Science.gov (United States)

Unal, Gozde; Krim, Hamid; Yezzi, Anthony

2005-06-01

In this paper, we first reconsider, in a different light, the addition of a prediction step to active contour-based visual tracking using an optical flow and clarify the local computation of the latter along the boundaries of continuous active contours with appropriate regularizers. We subsequently detail our contribution of computing an optical flow-based prediction step directly from the parameters of an active polygon, and of exploiting it in object tracking. This is in contrast to an explicitly separate computation of the optical flow and its ad hoc application. It also provides an inherent regularization effect resulting from integrating measurements along polygon edges. As a result, we completely avoid the need of adding ad hoc regularizing terms to the optical flow computations, and the inevitably arbitrary associated weighting parameters. This direct integration of optical flow into the active polygon framework distinguishes this technique from most previous contour-based approaches, where regularization terms are theoretically, as well as practically, essential. The greater robustness and speed due to a reduced number of parameters of this technique are additional and appealing features.

13. PolyRES: A polygon-based Richards equation solver

International Nuclear Information System (INIS)

Hills, R.G.

1995-12-01

This document describes the theory, implementation, and use of a software package designed to solve the transient, two-dimensional, Richards equation for water flow in unsaturated-saturated soils. This package was specifically designed to model complex geometries with minimal input from the user and to simulate groundwater flow related to assessment of low-level radioactive waste disposal sites and engineered facilities. The spatial variation of the hydraulic properties can be defined across individual polygon-shaped subdomains, called objects. These objects combine to form a polygon-shaped model domain. Each object can have its own distribution of hydraulic parameters. The resulting model domain and polygon-shaped internal objects are mapped onto a rectangular, finite-volume, computational grid by a preprocessor. This allows the user to specify model geometry independently of the underlying grid and greatly simplifies user input for complex geometries. In addition, this approach significantly reduces the computational requirements since complex geometries are actually modeled on a rectangular grid. This results in well-structured, finite difference-like systems of equations that require minimal storage and are very efficient to solve. The documentation for this software package includes a user's manual, a detailed description of the underlying theory, and a detailed discussion of program flow. Several example problems are presented that show the use and features of the software package. The water flow predictions for several of these example problems are compared to those of another algorithm to test for prediction equivalency

14. A model of anelastic relaxation associated with polygonization boundary

International Nuclear Information System (INIS)

Yan, S.C.

1990-01-01

A model of anelastic relaxation associated with polygonization boundary is proposed in order to explain internal friction peaks and other experimental phenomena observed recently. The model, which is referred to as vacancy-thermal jog model, shows that under conditions of high temperature and low applied stress with lower frequencies of vibration, thermal jog pairs are generated on dislocation segments of the boundaries. These jogs are in saturation with vacancies in the vicinity of them, and the vacancy current due to the concentration gradient of vacancy drifts among the boundaries. As a result, a diffusional creep is produced and a part of energy is dissipated. For vacancy drift, it is required that the thermal jogs emit (absorb) vacancies, which brings climbing bow of segments into operation, and another part of energy is dissipated so that there are two parts of energy dissipated in the strain process connected with polygonization boundary. Based on this point of view, the mathematical expressions of internal friction and modulus defect associated with polygonization boundary were subsequently derived and found to be in satisfactory agreement with experiments. (author). 13 refs, 6 figs

15. Curvature of random walks and random polygons in confinement

International Nuclear Information System (INIS)

Diao, Y; Ernst, C; Montemayor, A; Ziegler, U

2013-01-01

The purpose of this paper is to study the curvature of equilateral random walks and polygons that are confined in a sphere. Curvature is one of several basic geometric properties that can be used to describe random walks and polygons. We show that confinement affects curvature quite strongly, and in the limit case where the confinement diameter equals the edge length the unconfined expected curvature value doubles from π/2 to π. To study curvature a simple model of an equilateral random walk in spherical confinement in dimensions 2 and 3 is introduced. For this simple model we derive explicit integral expressions for the expected value of the total curvature in both dimensions. These expressions are functions that depend only on the radius R of the confinement sphere. We then show that the values obtained by numeric integration of these expressions agrees with numerical average curvature estimates obtained from simulations of random walks. Finally, we compare the confinement effect on curvature of random walks with random polygons. (paper)

16. Electronic properties of carbon nanotubes with polygonized cross sections

International Nuclear Information System (INIS)

Charlier, J.; Lambin, P.; Ebbesen, T.

1996-01-01

The electronic properties of carbon nanotubes having polygonized cross sections instead of purely circular ones, such as recently observed using transmission electron microscopy, are investigated with plane-wave ab initio pseudopotential local-density-functional calculations and simple tight-binding models. Strong σ * -π * hybridization effects occur in zigzag nanotubes due to the high curvature located near the edges of the polygonal cross-section prism. These effects, combined with a lowering of symmetry, dramatically affect the electronic properties of the nanotubes. It is found that modified low-lying conduction-band states are introduced either into the bandgap of insulating nanotubes, or below the degenerate states that form the top of the valence band of metallic nanotubes, leading the corresponding nanostructures to be metals, semimetals, or at least very-small-gap semiconductors. The degree of the polygon representing the cross section of the tube, and the sharpness of the edge angles, are found to be major factors in the hybridization effect, and consequently govern the electronic behavior at the Fermi level. copyright 1996 The American Physical Society

17. The average crossing number of equilateral random polygons

International Nuclear Information System (INIS)

Diao, Y; Dobay, A; Kusner, R B; Millett, K; Stasiak, A

2003-01-01

In this paper, we study the average crossing number of equilateral random walks and polygons. We show that the mean average crossing number ACN of all equilateral random walks of length n is of the form (3/16)n ln n + O(n). A similar result holds for equilateral random polygons. These results are confirmed by our numerical studies. Furthermore, our numerical studies indicate that when random polygons of length n are divided into individual knot types, the for each knot type K can be described by a function of the form = a(n-n 0 )ln(n-n 0 ) + b(n-n 0 ) + c where a, b and c are constants depending on K and n 0 is the minimal number of segments required to form K. The profiles diverge from each other, with more complex knots showing higher than less complex knots. Moreover, the profiles intersect with the profile of all closed walks. These points of intersection define the equilibrium length of K, i.e., the chain length n e (K) at which a statistical ensemble of configurations with given knot type K-upon cutting, equilibration and reclosure to a new knot type K'-does not show a tendency to increase or decrease . This concept of equilibrium length seems to be universal, and applies also to other length-dependent observables for random knots, such as the mean radius of gyration g >

18. Minimum Wages and Poverty

OpenAIRE

Fields, Gary S.; Kanbur, Ravi

2005-01-01

Textbook analysis tells us that in a competitive labor market, the introduction of a minimum wage above the competitive equilibrium wage will cause unemployment. This paper makes two contributions to the basic theory of the minimum wage. First, we analyze the effects of a higher minimum wage in terms of poverty rather than in terms of unemployment. Second, we extend the standard textbook model to allow for incomesharing between the employed and the unemployed. We find that there are situation...

19. The role of convexity in perceptual completion: beyond good continuation.

Science.gov (United States)

Liu, Z; Jacobs, D W; Basri, R

1999-01-01

Since the seminal work of the Gestalt psychologists, there has been great interest in understanding what factors determine the perceptual organization of images. While the Gestaltists demonstrated the significance of grouping cues such as similarity, proximity and good continuation, it has not been well understood whether their catalog of grouping cues is complete--in part due to the paucity of effective methodologies for examining the significance of various grouping cues. We describe a novel, objective method to study perceptual grouping of planar regions separated by an occluder. We demonstrate that the stronger the grouping between two such regions, the harder it will be to resolve their relative stereoscopic depth. We use this new method to call into question many existing theories of perceptual completion (Ullman, S. (1976). Biological Cybernetics, 25, 1-6; Shashua, A., & Ullman, S. (1988). 2nd International Conference on Computer Vision (pp. 321-327); Parent, P., & Zucker, S. (1989). IEEE Transactions on Pattern Analysis and Machine Intelligence, 11, 823-839; Kellman, P. J., & Shipley, T. F. (1991). Cognitive psychology, Liveright, New York; Heitger, R., & von der Heydt, R. (1993). A computational model of neural contour processing, figure-ground segregation and illusory contours. In Internal Conference Computer Vision (pp. 32-40); Mumford, D. (1994). Algebraic geometry and its applications, Springer, New York; Williams, L. R., & Jacobs, D. W. (1997). Neural Computation, 9, 837-858) that are based on Gestalt grouping cues by demonstrating that convexity plays a strong role in perceptual completion. In some cases convexity dominates the effects of the well known Gestalt cue of good continuation. While convexity has been known to play a role in figure/ground segmentation (Rubin, 1927; Kanizsa & Gerbino, 1976), this is the first demonstration of its importance in perceptual completion.

20. Bounds for the minimum step number of knots confined to slabs in the simple cubic lattice

International Nuclear Information System (INIS)

Ishihara, K; Shimokawa, K; Scharein, R; Arsuaga, J; Vazquez, M; Diao, Y

2012-01-01

Volume confinement is a key determinant of the topology and geometry of a polymer. However, the direct relationship between the two is not fully understood. For instance, recent experimental studies have constructed P4 cosmids, i.e. P4 bacteriophages whose genome sequence and length have been artificially engineered and have shown that upon extraction their DNA knot distribution differs from that of wild-type bacteriophage P4. In particular, it was observed that the complexity of the knots decreases sharply with the length of the packed genome. This problem is the motivation of this paper. Here, a polymer is modeled as a self-avoiding polygon on the simple cubic lattice and the confining condition is such that the polygon is bounded between two parallel planes (i.e. bounded within a slab). We estimate the minimum length required for such a polygon to realize a knot type. Our numerical simulations show that in order to realize a prime knot (with up to ten crossings) in a 1-slab (i.e. a slab of height 1), one needs a polygon of length strictly longer than the minimum length needed to realize the same knot when there is no confining condition. In the case of the trefoil knot, we can in fact establish this result analytically by proving that the minimum length required to tie a trefoil in the 1-slab is 26, which is greater than 24, the known minimum length required to tie a trefoil without a confinement condition. Additionally, we find that in the 1-slab not all geometrical realizations of a given knot type are equivalent under BFACF moves. This suggests that in certain confined volumes, knowing the topology of a polymer is not enough to describe all its states. (paper)

1. Blaschke- and Minkowski-endomorphisms of convex bodies

DEFF Research Database (Denmark)

Kiderlen, Markus

2006-01-01

We consider maps of the family of convex bodies in Euclidean d-dimensional space into itself that are compatible with certain structures on this family: A Minkowski-endomorphism is a continuous, Minkowski-additive map that commutes with rotations. For d>2, a representation theorem for such maps......-endomorphisms, where additivity is now understood with respect to Blaschke-addition. Using a special mixed volume, an adjoining operator can be introduced. This operator allows one to identify the class of Blaschke-endomorphisms with the class of weakly monotonic, non-degenerate and translation-covariant Minkowski...

2. Convex models and probabilistic approach of nonlinear fatigue failure

International Nuclear Information System (INIS)

Qiu Zhiping; Lin Qiang; Wang Xiaojun

2008-01-01

This paper is concerned with the nonlinear fatigue failure problem with uncertainties in the structural systems. In the present study, in order to solve the nonlinear problem by convex models, the theory of ellipsoidal algebra with the help of the thought of interval analysis is applied. In terms of the inclusion monotonic property of ellipsoidal functions, the nonlinear fatigue failure problem with uncertainties can be solved. A numerical example of 25-bar truss structures is given to illustrate the efficiency of the presented method in comparison with the probabilistic approach

3. Generalized minimizers of convex integral functionals, Bregman distance, Pythagorean identities

Czech Academy of Sciences Publication Activity Database

Imre, C.; Matúš, František

2012-01-01

Roč. 48, č. 4 (2012), s. 637-689 ISSN 0023-5954 R&D Projects: GA ČR GA201/08/0539; GA ČR GAP202/10/0618 Institutional support: RVO:67985556 Keywords : maximum entropy * moment constraint * generalized primal/dual solutions * normal integrand * convex duality * Bregman projection * inference principles Subject RIV: BA - General Mathematics Impact factor: 0.619, year: 2012 http://library.utia.cas.cz/separaty/2012/MTR/matus-0381750.pdf

4. Iterative Schemes for Convex Minimization Problems with Constraints

Directory of Open Access Journals (Sweden)

Lu-Chuan Ceng

2014-01-01

Full Text Available We first introduce and analyze one implicit iterative algorithm for finding a solution of the minimization problem for a convex and continuously Fréchet differentiable functional, with constraints of several problems: the generalized mixed equilibrium problem, the system of generalized equilibrium problems, and finitely many variational inclusions in a real Hilbert space. We prove strong convergence theorem for the iterative algorithm under suitable conditions. On the other hand, we also propose another implicit iterative algorithm for finding a fixed point of infinitely many nonexpansive mappings with the same constraints, and derive its strong convergence under mild assumptions.

5. Gröbner bases and convex polytopes

CERN Document Server

Sturmfels, Bernd

1995-01-01

This book is about the interplay of computational commutative algebra and the theory of convex polytopes. It centers around a special class of ideals in a polynomial ring: the class of toric ideals. They are characterized as those prime ideals that are generated by monomial differences or as the defining ideals of toric varieties (not necessarily normal). The interdisciplinary nature of the study of Gröbner bases is reflected by the specific applications appearing in this book. These applications lie in the domains of integer programming and computational statistics. The mathematical tools presented in the volume are drawn from commutative algebra, combinatorics, and polyhedral geometry.

6. On the structure of self-affine convex bodies

Energy Technology Data Exchange (ETDEWEB)

Voynov, A S [M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics, Moscow (Russian Federation)

2013-08-31

We study the structure of convex bodies in R{sup d} that can be represented as a union of their affine images with no common interior points. Such bodies are called self-affine. Vallet's conjecture on the structure of self-affine bodies was proved for d = 2 by Richter in 2011. In the present paper we disprove the conjecture for all d≥3 and derive a detailed description of self-affine bodies in R{sup 3}. Also we consider the relation between properties of self-affine bodies and functional equations with a contraction of an argument. Bibliography: 10 titles.

7. Use of Convexity in Ostomy Care: Results of an International Consensus Meeting.

Science.gov (United States)

Hoeflok, Jo; Salvadalena, Ginger; Pridham, Sue; Droste, Werner; McNichol, Laurie; Gray, Mikel

Ostomy skin barriers that incorporate a convexity feature have been available in the marketplace for decades, but limited resources are available to guide clinicians in selection and use of convex products. Given the widespread use of convexity, and the need to provide practical guidelines for appropriate use of pouching systems with convex features, an international consensus panel was convened to provide consensus-based guidance for this aspect of ostomy practice. Panelists were provided with a summary of relevant literature in advance of the meeting; these articles were used to generate and reach consensus on 26 statements during a 1-day meeting. Consensus was achieved when 80% of panelists agreed on a statement using an anonymous electronic response system. The 26 statements provide guidance for convex product characteristics, patient assessment, convexity use, and outcomes.

8. Small-Scale Polygons and the History of Ground Ice on Mars

Science.gov (United States)

Mellon, Michael T.

2000-01-01

This research has laid a foundation for continued study of permafrost polygons on Mars using the models and understanding discussed here. Further study of polygonal patterns on Mars is proceeding (under new funding) which is expected to reveal more results about the origin of observed martian polygons and what information they contain regarding the recent history of tile martian climate and of water ice on Mars.

9. Canonical Primal-Dual Method for Solving Non-convex Minimization Problems

OpenAIRE

Wu, Changzhi; Li, Chaojie; Gao, David Yang

2012-01-01

A new primal-dual algorithm is presented for solving a class of non-convex minimization problems. This algorithm is based on canonical duality theory such that the original non-convex minimization problem is first reformulated as a convex-concave saddle point optimization problem, which is then solved by a quadratically perturbed primal-dual method. %It is proved that the popular SDP method is indeed a special case of the canonical duality theory. Numerical examples are illustrated. Comparing...

10. Material parameters characterization for arbitrary N-sided regular polygonal invisible cloak

International Nuclear Information System (INIS)

Wu Qun; Zhang Kuang; Meng Fanyi; Li Lewei

2009-01-01

Arbitrary N-sided regular polygonal cylindrical cloaks are proposed and designed based on the coordinate transformation theory. First, the general expressions of constitutive tensors of the N-sided regular polygonal cylindrical cloaks are derived, then there are some full-wave simulations of the cloaks that are composed of inhomogeneous and anisotropic metamaterials, which will bend incoming electromagnetic waves and guide them to propagate around the inner region; such electromagnetic waves will return to their original propagation directions without distorting the waves outside the polygonal cloak. The results of full-wave simulations validate the general expressions of constitutive tensors of the N-sided regular polygonal cylindrical cloaks we derived.

11. A numerical investigation of sub-wavelength resonances in polygonal metamaterial cylinders

DEFF Research Database (Denmark)

Arslanagic, Samel; Breinbjerg, Olav

2009-01-01

The sub-wavelength resonances, known to exist in metamaterial radiators and scatterers of circular cylindrical shape, are investigated with the aim of determining if these resonances also exist for polygonal cylinders and, if so, how they are affected by the shape of the polygon. To this end, a set...... of polygonal cylinders excited by a nearby electric line current is analyzed numerically and it is shown, through detailed analysis of the near-field distribution and radiation resistance, that these polygonal cylinders do indeed support sub-wavelength resonances similar to those of the circular cylinders...

12. Sequential Change-Point Detection via Online Convex Optimization

Directory of Open Access Journals (Sweden)

Yang Cao

2018-02-01

Full Text Available Sequential change-point detection when the distribution parameters are unknown is a fundamental problem in statistics and machine learning. When the post-change parameters are unknown, we consider a set of detection procedures based on sequential likelihood ratios with non-anticipating estimators constructed using online convex optimization algorithms such as online mirror descent, which provides a more versatile approach to tackling complex situations where recursive maximum likelihood estimators cannot be found. When the underlying distributions belong to a exponential family and the estimators satisfy the logarithm regret property, we show that this approach is nearly second-order asymptotically optimal. This means that the upper bound for the false alarm rate of the algorithm (measured by the average-run-length meets the lower bound asymptotically up to a log-log factor when the threshold tends to infinity. Our proof is achieved by making a connection between sequential change-point and online convex optimization and leveraging the logarithmic regret bound property of online mirror descent algorithm. Numerical and real data examples validate our theory.

13. A New Interpolation Approach for Linearly Constrained Convex Optimization

KAUST Repository

Espinoza, Francisco

2012-08-01

In this thesis we propose a new class of Linearly Constrained Convex Optimization methods based on the use of a generalization of Shepard\\'s interpolation formula. We prove the properties of the surface such as the interpolation property at the boundary of the feasible region and the convergence of the gradient to the null space of the constraints at the boundary. We explore several descent techniques such as steepest descent, two quasi-Newton methods and the Newton\\'s method. Moreover, we implement in the Matlab language several versions of the method, particularly for the case of Quadratic Programming with bounded variables. Finally, we carry out performance tests against Matab Optimization Toolbox methods for convex optimization and implementations of the standard log-barrier and active-set methods. We conclude that the steepest descent technique seems to be the best choice so far for our method and that it is competitive with other standard methods both in performance and empirical growth order.

14. Nash points, Ky Fan inequality and equilibria of abstract economies in Max-Plus and -convexity

Science.gov (United States)

Briec, Walter; Horvath, Charles

2008-05-01

-convexity was introduced in [W. Briec, C. Horvath, -convexity, Optimization 53 (2004) 103-127]. Separation and Hahn-Banach like theorems can be found in [G. Adilov, A.M. Rubinov, -convex sets and functions, Numer. Funct. Anal. Optim. 27 (2006) 237-257] and [W. Briec, C.D. Horvath, A. Rubinov, Separation in -convexity, Pacific J. Optim. 1 (2005) 13-30]. We show here that all the basic results related to fixed point theorems are available in -convexity. Ky Fan inequality, existence of Nash equilibria and existence of equilibria for abstract economies are established in the framework of -convexity. Monotone analysis, or analysis on Maslov semimodules [V.N. Kolokoltsov, V.P. Maslov, Idempotent Analysis and Its Applications, Math. Appl., volE 401, Kluwer Academic, 1997; V.P. Litvinov, V.P. Maslov, G.B. Shpitz, Idempotent functional analysis: An algebraic approach, Math. Notes 69 (2001) 696-729; V.P. Maslov, S.N. Samborski (Eds.), Idempotent Analysis, Advances in Soviet Mathematics, Amer. Math. Soc., Providence, RI, 1992], is the natural framework for these results. From this point of view Max-Plus convexity and -convexity are isomorphic Maslov semimodules structures over isomorphic semirings. Therefore all the results of this paper hold in the context of Max-Plus convexity.

15. Generalized Bregman distances and convergence rates for non-convex regularization methods

International Nuclear Information System (INIS)

Grasmair, Markus

2010-01-01

We generalize the notion of Bregman distance using concepts from abstract convexity in order to derive convergence rates for Tikhonov regularization with non-convex regularization terms. In particular, we study the non-convex regularization of linear operator equations on Hilbert spaces, showing that the conditions required for the application of the convergence rates results are strongly related to the standard range conditions from the convex case. Moreover, we consider the setting of sparse regularization, where we show that a rate of order δ 1/p holds, if the regularization term has a slightly faster growth at zero than |t| p

16. Processing convexity and concavity along a 2-D contour: figure-ground, structural shape, and attention.

Science.gov (United States)

Bertamini, Marco; Wagemans, Johan

2013-04-01

Interest in convexity has a long history in vision science. For smooth contours in an image, it is possible to code regions of positive (convex) and negative (concave) curvature, and this provides useful information about solid shape. We review a large body of evidence on the role of this information in perception of shape and in attention. This includes evidence from behavioral, neurophysiological, imaging, and developmental studies. A review is necessary to analyze the evidence on how convexity affects (1) separation between figure and ground, (2) part structure, and (3) attention allocation. Despite some broad agreement on the importance of convexity in these areas, there is a lack of consensus on the interpretation of specific claims--for example, on the contribution of convexity to metric depth and on the automatic directing of attention to convexities or to concavities. The focus is on convexity and concavity along a 2-D contour, not convexity and concavity in 3-D, but the important link between the two is discussed. We conclude that there is good evidence for the role of convexity information in figure-ground organization and in parsing, but other, more specific claims are not (yet) well supported.

17. First-order Convex Optimization Methods for Signal and Image Processing

DEFF Research Database (Denmark)

Jensen, Tobias Lindstrøm

2012-01-01

In this thesis we investigate the use of first-order convex optimization methods applied to problems in signal and image processing. First we make a general introduction to convex optimization, first-order methods and their iteration complexity. Then we look at different techniques, which can...... be used with first-order methods such as smoothing, Lagrange multipliers and proximal gradient methods. We continue by presenting different applications of convex optimization and notable convex formulations with an emphasis on inverse problems and sparse signal processing. We also describe the multiple...

18. Investigations into the tensile failure of doubly-convex cylindrical tablets under diametral loading using finite element methodology.

Science.gov (United States)

Podczeck, Fridrun; Drake, Kevin R; Newton, J Michael

2013-09-15

failure by capping or even more complex failure patterns in these exceptional cases. The FEM-results further indicated that in general W/D-ratios between 0.15 and 0.20 are favourable when the overall size and shape of the tablets is modified to give maximum tablet tensile strength. However, the maximum tensile stress of doubly-convex tablets will never exceed that of a flat-face cylindrical tablet of similar W/D-ratio. The lowest tensile stress depends on the W/D-ratio. For the thinnest central cylinder thickness, this minimum stress occurs at D/R=0.50; for W/D-ratios between 0.10 and 0.20 the D/R-ratio for the minimum tensile stress increases to 0.67, and for all other central cylinder thicknesses the minimum tensile stress is found at D/R=1.00. Copyright © 2013 Elsevier B.V. All rights reserved.

19. Minimum critical mass systems

International Nuclear Information System (INIS)

Dam, H. van; Leege, P.F.A. de

1987-01-01

An analysis is presented of thermal systems with minimum critical mass, based on the use of materials with optimum neutron moderating and reflecting properties. The optimum fissile material distributions in the systems are obtained by calculations with standard computer codes, extended with a routine for flat fuel importance search. It is shown that in the minimum critical mass configuration a considerable part of the fuel is positioned in the reflector region. For 239 Pu a minimum critical mass of 87 g is found, which is the lowest value reported hitherto. (author)

20. Engaging student expeditionary units to land work at aerospace polygons

Directory of Open Access Journals (Sweden)

Ирина Жемерова

2016-10-01

Full Text Available To organize the aerospace polygon it is necessary to conduct a large number of measurement and descriptive works. First and foremost is working with the fund and cartographic material. The map of the landfill shows the most important objects and phenomena: quarries, sinkholes, deep ravines, industrial, residential and protected areas. Organization of the aerospace polygon operation involves large labour costs. To train professionals on the ground research of the earth’s cover remote sensing, we have organized a permanent student expedition. Prior to the start of work, students listen to a series of introductory lectures on remote sensing, principles of ground work, methods of statistical evaluation, basic methods of data collection and processing. This article covers one direction of work - collecting and processing of phytometric data of crops and steppe vegetation in the Streletskaya steppe in the Central Chernozem nature reserve. The work is carried out on the test area of Kursk aerospace polygon, organized on the basis of Kursk biospheric station of the Institute of Geography RAS. A generally accepted method of test platforms is used on the routes. The results of measurements and observations are recorded in a field book. Species diversity, plant height, projective cover and crops density are determined on the sample area by the instrumental and visual methods. The rest phytometric indexes are calculated in laboratory conditions. The students can use the resulting material when writing articles, course and degree works. At the site, students acquire skills of working in field conditions with natural objects, collecting and processing of information by various methods, expanding understanding of the need and importance of the earth surface study by remote sensing methods.

1. The Knot Spectrum of Confined Random Equilateral Polygons

Directory of Open Access Journals (Sweden)

Diao Y.

2014-01-01

Full Text Available It is well known that genomic materials (long DNA chains of living organisms are often packed compactly under extreme confining conditions using macromolecular self-assembly processes but the general DNA packing mechanism remains an unsolved problem. It has been proposed that the topology of the packed DNA may be used to study the DNA packing mechanism. For example, in the case of (mutant bacteriophage P4, DNA molecules packed inside the bacteriophage head are considered to be circular since the two sticky ends of the DNA are close to each other. The DNAs extracted from the capsid without separating the two ends can thus preserve the topology of the (circular DNAs. It turns out that the circular DNAs extracted from bacteriophage P4 are non-trivially knotted with very high probability and with a bias toward chiral knots. In order to study this problem using a systematic approach based on mathematical modeling, one needs to introduce a DNA packing model under extreme volume confinement condition and test whether such a model can produce the kind of knot spectrum observed in the experiments. In this paper we introduce and study a model of equilateral random polygons con_ned in a sphere. This model is not meant to generate polygons that model DNA packed in a virus head directly. Instead, the average topological characteristics of this model may serve as benchmark data for totally randomly packed circular DNAs. The difference between the biologically observed topological characteristics and our benchmark data might reveal the bias of DNA packed in the viral capsids and possibly lead to a better understanding of the DNA packing mechanism, at least for the bacteriophage DNA. The purpose of this paper is to provide information about the knot spectrum of equilateral random polygons under such a spherical confinement with length and confinement ratios in a range comparable to circular DNAs packed inside bacteriophage heads.

2. Minimum entropy production principle

Czech Academy of Sciences Publication Activity Database

Maes, C.; Netočný, Karel

2013-01-01

Roč. 8, č. 7 (2013), s. 9664-9677 ISSN 1941-6016 Institutional support: RVO:68378271 Keywords : MINEP Subject RIV: BE - Theoretical Physics http://www.scholarpedia.org/article/Minimum_entropy_production_principle

3. Giant polygons and mounds in the lowlands of Mars: signatures of an ancient ocean?

Science.gov (United States)

Oehler, Dorothy Z; Allen, Carlton C

2012-06-01

This paper presents the hypothesis that the well-known giant polygons and bright mounds of the martian lowlands may be related to a common process-a process of fluid expulsion that results from burial of fine-grained sediments beneath a body of water. Specifically, we hypothesize that giant polygons and mounds in Chryse and Acidalia Planitiae are analogous to kilometer-scale polygons and mud volcanoes in terrestrial, marine basins and that the co-occurrence of masses of these features in Chryse and Acidalia may be the signature of sedimentary processes in an ancient martian ocean. We base this hypothesis on recent data from both Earth and Mars. On Earth, 3-D seismic data illustrate kilometer-scale polygons that may be analogous to the giant polygons on Mars. The terrestrial polygons form in fine-grained sediments that have been deposited and buried in passive-margin, marine settings. These polygons are thought to result from compaction/dewatering, and they are commonly associated with fluid expulsion features, such as mud volcanoes. On Mars, in Chryse and Acidalia Planitiae, orbital data demonstrate that giant polygons and mounds have overlapping spatial distributions. There, each set of features occurs within a geological setting that is seemingly analogous to that of the terrestrial, kilometer-scale polygons (broad basin of deposition, predicted fine-grained sediments, and lack of significant horizontal stress). Regionally, the martian polygons and mounds both show a correlation to elevation, as if their formation were related to past water levels. Although these observations are based on older data with incomplete coverage, a similar correlation to elevation has been established in one local area studied in detail with newer higher-resolution data. Further mapping with the latest data sets should more clearly elucidate the relationship(s) of the polygons and mounds to elevation over the entire Chryse-Acidalia region and thereby provide more insight into this

4. Chance-Constrained Guidance With Non-Convex Constraints

Science.gov (United States)

Ono, Masahiro

2011-01-01

Missions to small bodies, such as comets or asteroids, require autonomous guidance for descent to these small bodies. Such guidance is made challenging by uncertainty in the position and velocity of the spacecraft, as well as the uncertainty in the gravitational field around the small body. In addition, the requirement to avoid collision with the asteroid represents a non-convex constraint that means finding the optimal guidance trajectory, in general, is intractable. In this innovation, a new approach is proposed for chance-constrained optimal guidance with non-convex constraints. Chance-constrained guidance takes into account uncertainty so that the probability of collision is below a specified threshold. In this approach, a new bounding method has been developed to obtain a set of decomposed chance constraints that is a sufficient condition of the original chance constraint. The decomposition of the chance constraint enables its efficient evaluation, as well as the application of the branch and bound method. Branch and bound enables non-convex problems to be solved efficiently to global optimality. Considering the problem of finite-horizon robust optimal control of dynamic systems under Gaussian-distributed stochastic uncertainty, with state and control constraints, a discrete-time, continuous-state linear dynamics model is assumed. Gaussian-distributed stochastic uncertainty is a more natural model for exogenous disturbances such as wind gusts and turbulence than the previously studied set-bounded models. However, with stochastic uncertainty, it is often impossible to guarantee that state constraints are satisfied, because there is typically a non-zero probability of having a disturbance that is large enough to push the state out of the feasible region. An effective framework to address robustness with stochastic uncertainty is optimization with chance constraints. These require that the probability of violating the state constraints (i.e., the probability of

5. Nonparametric instrumental regression with non-convex constraints

International Nuclear Information System (INIS)

Grasmair, M; Scherzer, O; Vanhems, A

2013-01-01

This paper considers the nonparametric regression model with an additive error that is dependent on the explanatory variables. As is common in empirical studies in epidemiology and economics, it also supposes that valid instrumental variables are observed. A classical example in microeconomics considers the consumer demand function as a function of the price of goods and the income, both variables often considered as endogenous. In this framework, the economic theory also imposes shape restrictions on the demand function, such as integrability conditions. Motivated by this illustration in microeconomics, we study an estimator of a nonparametric constrained regression function using instrumental variables by means of Tikhonov regularization. We derive rates of convergence for the regularized model both in a deterministic and stochastic setting under the assumption that the true regression function satisfies a projected source condition including, because of the non-convexity of the imposed constraints, an additional smallness condition. (paper)

6. Nonparametric instrumental regression with non-convex constraints

Science.gov (United States)

Grasmair, M.; Scherzer, O.; Vanhems, A.

2013-03-01

This paper considers the nonparametric regression model with an additive error that is dependent on the explanatory variables. As is common in empirical studies in epidemiology and economics, it also supposes that valid instrumental variables are observed. A classical example in microeconomics considers the consumer demand function as a function of the price of goods and the income, both variables often considered as endogenous. In this framework, the economic theory also imposes shape restrictions on the demand function, such as integrability conditions. Motivated by this illustration in microeconomics, we study an estimator of a nonparametric constrained regression function using instrumental variables by means of Tikhonov regularization. We derive rates of convergence for the regularized model both in a deterministic and stochastic setting under the assumption that the true regression function satisfies a projected source condition including, because of the non-convexity of the imposed constraints, an additional smallness condition.

7. Convex analysis and monotone operator theory in Hilbert spaces

CERN Document Server

Bauschke, Heinz H

2017-01-01

This reference text, now in its second edition, offers a modern unifying presentation of three basic areas of nonlinear analysis: convex analysis, monotone operator theory, and the fixed point theory of nonexpansive operators. Taking a unique comprehensive approach, the theory is developed from the ground up, with the rich connections and interactions between the areas as the central focus, and it is illustrated by a large number of examples. The Hilbert space setting of the material offers a wide range of applications while avoiding the technical difficulties of general Banach spaces. The authors have also drawn upon recent advances and modern tools to simplify the proofs of key results making the book more accessible to a broader range of scholars and users. Combining a strong emphasis on applications with exceptionally lucid writing and an abundance of exercises, this text is of great value to a large audience including pure and applied mathematicians as well as researchers in engineering, data science, ma...

8. Rocking convex array used for 3D synthetic aperture focusing

DEFF Research Database (Denmark)

Andresen, Henrik; Nikolov, Svetoslav; Pedersen, M M

2008-01-01

Volumetric imaging can be performed using 1D arrays in combination with mechanical motion. Outside the elevation focus of the array, the resolution and contrast quickly degrade compared to the azimuth plane, because of the fixed transducer focus. The purpose of this paper is to use synthetic...... aperture focusing (SAF) for enhancing the elevation focusing for a convex rocking array, to obtain a more isotropic point spread function. This paper presents further development of the SAF method, which can be used with curved array combined with a rocking motion. The method uses a virtual source (VS...... Kretztechnik, Zipf, Austria). The array has an elevation focus at 60 mm of depth, and the angular rocking velocity is up to 140deg/s. The scan sequence uses an fprf of 4500 - 7000 Hz allowing up to 15 cm of penetration. The full width at half max (FWHM) and main-lobe to side-lobe ratio (MLSL) is used...

9. Approximating convex Pareto surfaces in multiobjective radiotherapy planning

International Nuclear Information System (INIS)

Craft, David L.; Halabi, Tarek F.; Shih, Helen A.; Bortfeld, Thomas R.

2006-01-01

Radiotherapy planning involves inherent tradeoffs: the primary mission, to treat the tumor with a high, uniform dose, is in conflict with normal tissue sparing. We seek to understand these tradeoffs on a case-to-case basis, by computing for each patient a database of Pareto optimal plans. A treatment plan is Pareto optimal if there does not exist another plan which is better in every measurable dimension. The set of all such plans is called the Pareto optimal surface. This article presents an algorithm for computing well distributed points on the (convex) Pareto optimal surface of a multiobjective programming problem. The algorithm is applied to intensity-modulated radiation therapy inverse planning problems, and results of a prostate case and a skull base case are presented, in three and four dimensions, investigating tradeoffs between tumor coverage and critical organ sparing

10. Convex Relaxations for a Generalized Chan-Vese Model

KAUST Repository

Bae, Egil

2013-01-01

We revisit the Chan-Vese model of image segmentation with a focus on the encoding with several integer-valued labeling functions. We relate several representations with varying amount of complexity and demonstrate the connection to recent relaxations for product sets and to dual maxflow-based formulations. For some special cases, it can be shown that it is possible to guarantee binary minimizers. While this is not true in general, we show how to derive a convex approximation of the combinatorial problem for more than 4 phases. We also provide a method to avoid overcounting of boundaries in the original Chan-Vese model without departing from the efficient product-set representation. Finally, we derive an algorithm to solve the associated discretized problem, and demonstrate that it allows to obtain good approximations for the segmentation problem with various number of regions. © 2013 Springer-Verlag.

11. Neural network for solving convex quadratic bilevel programming problems.

Science.gov (United States)

He, Xing; Li, Chuandong; Huang, Tingwen; Li, Chaojie

2014-03-01

In this paper, using the idea of successive approximation, we propose a neural network to solve convex quadratic bilevel programming problems (CQBPPs), which is modeled by a nonautonomous differential inclusion. Different from the existing neural network for CQBPP, the model has the least number of state variables and simple structure. Based on the theory of nonsmooth analysis, differential inclusions and Lyapunov-like method, the limit equilibrium points sequence of the proposed neural networks can approximately converge to an optimal solution of CQBPP under certain conditions. Finally, simulation results on two numerical examples and the portfolio selection problem show the effectiveness and performance of the proposed neural network. Copyright © 2013 Elsevier Ltd. All rights reserved.

12. Entropies from Coarse-graining: Convex Polytopes vs. Ellipsoids

Directory of Open Access Journals (Sweden)

Nikos Kalogeropoulos

2015-09-01

Full Text Available We examine the Boltzmann/Gibbs/Shannon SBGS and the non-additive Havrda-Charvát/Daróczy/Cressie-Read/Tsallis Sq and the Kaniadakis κ-entropy Sκ from the viewpoint of coarse-graining, symplectic capacities and convexity. We argue that the functional form of such entropies can be ascribed to a discordance in phase-space coarse-graining between two generally different approaches: the Euclidean/Riemannian metric one that reflects independence and picks cubes as the fundamental cells in coarse-graining and the symplectic/canonical one that picks spheres/ellipsoids for this role. Our discussion is motivated by and confined to the behaviour of Hamiltonian systems of many degrees of freedom. We see that Dvoretzky’s theorem provides asymptotic estimates for the minimal dimension beyond which these two approaches are close to each other. We state and speculate about the role that dualities may play in this viewpoint.

13. Path Following in the Exact Penalty Method of Convex Programming.

Science.gov (United States)

Zhou, Hua; Lange, Kenneth

2015-07-01

Classical penalty methods solve a sequence of unconstrained problems that put greater and greater stress on meeting the constraints. In the limit as the penalty constant tends to ∞, one recovers the constrained solution. In the exact penalty method, squared penalties are replaced by absolute value penalties, and the solution is recovered for a finite value of the penalty constant. In practice, the kinks in the penalty and the unknown magnitude of the penalty constant prevent wide application of the exact penalty method in nonlinear programming. In this article, we examine a strategy of path following consistent with the exact penalty method. Instead of performing optimization at a single penalty constant, we trace the solution as a continuous function of the penalty constant. Thus, path following starts at the unconstrained solution and follows the solution path as the penalty constant increases. In the process, the solution path hits, slides along, and exits from the various constraints. For quadratic programming, the solution path is piecewise linear and takes large jumps from constraint to constraint. For a general convex program, the solution path is piecewise smooth, and path following operates by numerically solving an ordinary differential equation segment by segment. Our diverse applications to a) projection onto a convex set, b) nonnegative least squares, c) quadratically constrained quadratic programming, d) geometric programming, and e) semidefinite programming illustrate the mechanics and potential of path following. The final detour to image denoising demonstrates the relevance of path following to regularized estimation in inverse problems. In regularized estimation, one follows the solution path as the penalty constant decreases from a large value.

14. A fast ergodic algorithm for generating ensembles of equilateral random polygons

Science.gov (United States)

Varela, R.; Hinson, K.; Arsuaga, J.; Diao, Y.

2009-03-01

Knotted structures are commonly found in circular DNA and along the backbone of certain proteins. In order to properly estimate properties of these three-dimensional structures it is often necessary to generate large ensembles of simulated closed chains (i.e. polygons) of equal edge lengths (such polygons are called equilateral random polygons). However finding efficient algorithms that properly sample the space of equilateral random polygons is a difficult problem. Currently there are no proven algorithms that generate equilateral random polygons with its theoretical distribution. In this paper we propose a method that generates equilateral random polygons in a 'step-wise uniform' way. We prove that this method is ergodic in the sense that any given equilateral random polygon can be generated by this method and we show that the time needed to generate an equilateral random polygon of length n is linear in terms of n. These two properties make this algorithm a big improvement over the existing generating methods. Detailed numerical comparisons of our algorithm with other widely used algorithms are provided.

15. System and method for the adaptive mapping of matrix data to sets of polygons

Science.gov (United States)

Burdon, David (Inventor)

2003-01-01

A system and method for converting bitmapped data, for example, weather data or thermal imaging data, to polygons is disclosed. The conversion of the data into polygons creates smaller data files. The invention is adaptive in that it allows for a variable degree of fidelity of the polygons. Matrix data is obtained. A color value is obtained. The color value is a variable used in the creation of the polygons. A list of cells to check is determined based on the color value. The list of cells to check is examined in order to determine a boundary list. The boundary list is then examined to determine vertices. The determination of the vertices is based on a prescribed maximum distance. When drawn, the ordered list of vertices create polygons which depict the cell data. The data files which include the vertices for the polygons are much smaller than the corresponding cell data files. The fidelity of the polygon representation can be adjusted by repeating the logic with varying fidelity values to achieve a given maximum file size or a maximum number of vertices per polygon.

16. Origin of the Polygons and Underground Structures in Western Utopia Planitia on Mars

Science.gov (United States)

Yoshikawa, K.

2002-01-01

The area of lower albedo (Hvm) has a higher density of polygonal patterns. These patterns potentially suggest that 1) the polygonal pattern is caused primarily by ground heaving and collapsing, 2) lower albedo materials had higher tensile strength. Additional information is contained in the original extended abstract.

17. Analysis of the Misconceptions of 7th Grade Students on Polygons and Specific Quadrilaterals

Science.gov (United States)

Ozkan, Mustafa; Bal, Ayten Pinar

2017-01-01

Purpose: This study will find out student misconceptions about geometrical figures, particularly polygons and quadrilaterals. Thus, it will offer insights into teaching these concepts. The objective of this study, the question of "What are the misconceptions of seventh grade students on polygons and quadrilaterals?" constitutes the…

18. PET image reconstruction with rotationally symmetric polygonal pixel grid based highly compressible system matrix

International Nuclear Information System (INIS)

Yu Yunhan; Xia Yan; Liu Yaqiang; Wang Shi; Ma Tianyu; Chen Jing; Hong Baoyu

2013-01-01

To achieve a maximum compression of system matrix in positron emission tomography (PET) image reconstruction, we proposed a polygonal image pixel division strategy in accordance with rotationally symmetric PET geometry. Geometrical definition and indexing rule for polygonal pixels were established. Image conversion from polygonal pixel structure to conventional rectangular pixel structure was implemented using a conversion matrix. A set of test images were analytically defined in polygonal pixel structure, converted to conventional rectangular pixel based images, and correctly displayed which verified the correctness of the image definition, conversion description and conversion of polygonal pixel structure. A compressed system matrix for PET image recon was generated by tap model and tested by forward-projecting three different distributions of radioactive sources to the sinogram domain and comparing them with theoretical predictions. On a practical small animal PET scanner, a compress ratio of 12.6:1 of the system matrix size was achieved with the polygonal pixel structure, comparing with the conventional rectangular pixel based tap-mode one. OS-EM iterative image reconstruction algorithms with the polygonal and conventional Cartesian pixel grid were developed. A hot rod phantom was detected and reconstructed based on these two grids with reasonable time cost. Image resolution of reconstructed images was both 1.35 mm. We conclude that it is feasible to reconstruct and display images in a polygonal image pixel structure based on a compressed system matrix in PET image reconstruction. (authors)

19. Hermite-Hadamard type inequalities for GA-s-convex functions

Directory of Open Access Journals (Sweden)

İmdat İşcan

2014-10-01

Full Text Available In this paper, The author introduces the concepts of the GA-s-convex functions in the first sense and second sense and establishes some integral inequalities of Hermite-Hadamard type related to the GA-s-convex functions. Some applications to special means of real numbers are also given.

20. Distributed Topological Convex Hull Estimation of Event Region in Wireless Sensor Networks without Location Information

NARCIS (Netherlands)

Guo, Peng; Cao, Jiannong; Zhang, Kui

2015-01-01

In critical event (e.g., fire or gas) monitoring applications of wireless sensor networks (WSNs), convex hull of the event region is an efficient tool in handling the usual tasks like event report, routes reconstruction and human motion planning. Existing works on estimating convex hull of event

1. On the Lasserre hierarchy of semidefinite programming relaxations of convex polynomial optimization problems

NARCIS (Netherlands)

de Klerk, E.; Laurent, M.

2011-01-01

The Lasserre hierarchy of semidefinite programming approximations to convex polynomial optimization problems is known to converge finitely under some assumptions. [J. B. Lasserre, Convexity in semialgebraic geometry and polynomial optimization, SIAM J. Optim., 19 (2009), pp. 1995–2014]. We give a

2. The Concept of Convexity in Fuzzy Set Theory | Rauf | Journal of the ...

African Journals Online (AJOL)

The notions of convex analysis are indispensable in theoretical and applied Mathematics especially in the study of Calculus where it has a natural generalization for the several variables case. This paper investigates the concept of Fuzzy set theory in relation to the idea of convexity. Some fundamental theorems were ...

3. Effect of dental arch convexity and type of archwire on frictional forces

NARCIS (Netherlands)

Fourie, Zacharias; Ozcan, Mutlu; Sandham, John

Introduction: Friction measurements in orthodontics are often derived from models by using brackets placed on flat models with various straight wires. Dental arches are convex in some areas. The objectives of this study were to compare the frictional forces generated in conventional flat and convex

4. A canonical process for estimation of convex functions : The "invelope" of integrated Brownian motion +t4

NARCIS (Netherlands)

Groeneboom, P.; Jongbloed, G.; Wellner, J.A.

2001-01-01

A process associated with integrated Brownian motion is introduced that characterizes the limit behavior of nonparametric least squares and maximum likelihood estimators of convex functions and convex densities, respectively. We call this process “the invelope” and show that it is an almost surely

5. Origami tubes with reconfigurable polygonal cross-sections.

Science.gov (United States)

Filipov, E T; Paulino, G H; Tachi, T

2016-01-01

Thin sheets can be assembled into origami tubes to create a variety of deployable, reconfigurable and mechanistically unique three-dimensional structures. We introduce and explore origami tubes with polygonal, translational symmetric cross-sections that can reconfigure into numerous geometries. The tubular structures satisfy the mathematical definitions for flat and rigid foldability, meaning that they can fully unfold from a flattened state with deformations occurring only at the fold lines. The tubes do not need to be straight and can be constructed to follow a non-linear curved line when deployed. The cross-section and kinematics of the tubular structures can be reprogrammed by changing the direction of folding at some folds. We discuss the variety of tubular structures that can be conceived and we show limitations that govern the geometric design. We quantify the global stiffness of the origami tubes through eigenvalue and structural analyses and highlight the mechanical characteristics of these systems. The two-scale nature of this work indicates that, from a local viewpoint, the cross-sections of the polygonal tubes are reconfigurable while, from a global viewpoint, deployable tubes of desired shapes are achieved. This class of tubes has potential applications ranging from pipes and micro-robotics to deployable architecture in buildings.

6. Origami tubes with reconfigurable polygonal cross-sections

Science.gov (United States)

Filipov, E. T.; Paulino, G. H.; Tachi, T.

2016-01-01

Thin sheets can be assembled into origami tubes to create a variety of deployable, reconfigurable and mechanistically unique three-dimensional structures. We introduce and explore origami tubes with polygonal, translational symmetric cross-sections that can reconfigure into numerous geometries. The tubular structures satisfy the mathematical definitions for flat and rigid foldability, meaning that they can fully unfold from a flattened state with deformations occurring only at the fold lines. The tubes do not need to be straight and can be constructed to follow a non-linear curved line when deployed. The cross-section and kinematics of the tubular structures can be reprogrammed by changing the direction of folding at some folds. We discuss the variety of tubular structures that can be conceived and we show limitations that govern the geometric design. We quantify the global stiffness of the origami tubes through eigenvalue and structural analyses and highlight the mechanical characteristics of these systems. The two-scale nature of this work indicates that, from a local viewpoint, the cross-sections of the polygonal tubes are reconfigurable while, from a global viewpoint, deployable tubes of desired shapes are achieved. This class of tubes has potential applications ranging from pipes and micro-robotics to deployable architecture in buildings. PMID:26997894

7. Transit Traffic Analysis Zone Delineating Method Based on Thiessen Polygon

Directory of Open Access Journals (Sweden)

Shuwei Wang

2014-04-01

Full Text Available A green transportation system composed of transit, busses and bicycles could be a significant in alleviating traffic congestion. However, the inaccuracy of current transit ridership forecasting methods is imposing a negative impact on the development of urban transit systems. Traffic Analysis Zone (TAZ delineating is a fundamental and essential step in ridership forecasting, existing delineating method in four-step models have some problems in reflecting the travel characteristics of urban transit. This paper aims to come up with a Transit Traffic Analysis Zone delineation method as supplement of traditional TAZs in transit service analysis. The deficiencies of current TAZ delineating methods were analyzed, and the requirements of Transit Traffic Analysis Zone (TTAZ were summarized. Considering these requirements, Thiessen Polygon was introduced into TTAZ delineating. In order to validate its feasibility, Beijing was then taken as an example to delineate TTAZs, followed by a spatial analysis of office buildings within a TTAZ and transit station departure passengers. Analysis result shows that the TTAZs based on Thiessen polygon could reflect the transit travel characteristic and is of in-depth research value.

8. Clastic polygonal networks around Lyot crater, Mars: Possible formation mechanisms from morphometric analysis

Science.gov (United States)

Brooker, L. M.; Balme, M. R.; Conway, S. J.; Hagermann, A.; Barrett, A. M.; Collins, G. S.; Soare, R. J.

2018-03-01

Polygonal networks of patterned ground are a common feature in cold-climate environments. They can form through the thermal contraction of ice-cemented sediment (i.e. formed from fractures), or the freezing and thawing of ground ice (i.e. formed by patterns of clasts, or ground deformation). The characteristics of these landforms provide information about environmental conditions. Analogous polygonal forms have been observed on Mars leading to inferences about environmental conditions. We have identified clastic polygonal features located around Lyot crater, Mars (50°N, 30°E). These polygons are unusually large (>100 m diameter) compared to terrestrial clastic polygons, and contain very large clasts, some of which are up to 15 metres in diameter. The polygons are distributed in a wide arc around the eastern side of Lyot crater, at a consistent distance from the crater rim. Using high-resolution imaging data, we digitised these features to extract morphological information. These data are compared to existing terrestrial and Martian polygon data to look for similarities and differences and to inform hypotheses concerning possible formation mechanisms. Our results show the clastic polygons do not have any morphometric features that indicate they are similar to terrestrial sorted, clastic polygons formed by freeze-thaw processes. They are too large, do not show the expected variation in form with slope, and have clasts that do not scale in size with polygon diameter. However, the clastic networks are similar in network morphology to thermal contraction cracks, and there is a potential direct Martian analogue in a sub-type of thermal contraction polygons located in Utopia Planitia. Based upon our observations, we reject the hypothesis that polygons located around Lyot formed as freeze-thaw polygons and instead an alternative mechanism is put forward: they result from the infilling of earlier thermal contraction cracks by wind-blown material, which then became

9. A Polygon and Point-Based Approach to Matching Geospatial Features

Directory of Open Access Journals (Sweden)

Juan J. Ruiz-Lendínez

2017-12-01

Full Text Available A methodology for matching bidimensional entities is presented in this paper. The matching is proposed for both area and point features extracted from geographical databases. The procedure used to obtain homologous entities is achieved in a two-step process: The first matching, polygon to polygon matching (inter-element matching, is obtained by means of a genetic algorithm that allows the classifying of area features from two geographical databases. After this, we apply a point to point matching (intra-element matching based on the comparison of changes in their turning functions. This study shows that genetic algorithms are suitable for matching polygon features even if these features are quite different. Our results show up to 40% of matched polygons with differences in geometrical attributes. With regards to point matching, the vertex from homologous polygons, the function and threshold values proposed in this paper show a useful method for obtaining precise vertex matching.

10. The spectral positioning algorithm of new spectrum vehicle based on convex programming in wireless sensor network

Science.gov (United States)

Zhang, Yongjun; Lu, Zhixin

2017-10-01

Spectrum resources are very precious, so it is increasingly important to locate interference signals rapidly. Convex programming algorithms in wireless sensor networks are often used as localization algorithms. But in view of the traditional convex programming algorithm is too much overlap of wireless sensor nodes that bring low positioning accuracy, the paper proposed a new algorithm. Which is mainly based on the traditional convex programming algorithm, the spectrum car sends unmanned aerial vehicles (uses) that can be used to record data periodically along different trajectories. According to the probability density distribution, the positioning area is segmented to further reduce the location area. Because the algorithm only increases the communication process of the power value of the unknown node and the sensor node, the advantages of the convex programming algorithm are basically preserved to realize the simple and real-time performance. The experimental results show that the improved algorithm has a better positioning accuracy than the original convex programming algorithm.

11. The average inter-crossing number of equilateral random walks and polygons

International Nuclear Information System (INIS)

Diao, Y; Dobay, A; Stasiak, A

2005-01-01

In this paper, we study the average inter-crossing number between two random walks and two random polygons in the three-dimensional space. The random walks and polygons in this paper are the so-called equilateral random walks and polygons in which each segment of the walk or polygon is of unit length. We show that the mean average inter-crossing number ICN between two equilateral random walks of the same length n is approximately linear in terms of n and we were able to determine the prefactor of the linear term, which is a = 3ln2/8 ∼ 0.2599. In the case of two random polygons of length n, the mean average inter-crossing number ICN is also linear, but the prefactor of the linear term is different from that of the random walks. These approximations apply when the starting points of the random walks and polygons are of a distance ρ apart and ρ is small compared to n. We propose a fitting model that would capture the theoretical asymptotic behaviour of the mean average ICN for large values of ρ. Our simulation result shows that the model in fact works very well for the entire range of ρ. We also study the mean ICN between two equilateral random walks and polygons of different lengths. An interesting result is that even if one random walk (polygon) has a fixed length, the mean average ICN between the two random walks (polygons) would still approach infinity if the length of the other random walk (polygon) approached infinity. The data provided by our simulations match our theoretical predictions very well

Science.gov (United States)

Colleu, T.; Pateux, S.; Morin, L.; Labit, C.

2010-02-01

This paper presents a polygon soup representation for multiview data. Starting from a sequence of multi-view video plus depth (MVD) data, the proposed representation takes into account, in a unified manner, different issues such as compactness, compression, and intermediate view synthesis. The representation is built in two steps. First, a set of 3D quads is extracted using a quadtree decomposition of the depth maps. Second, a selective elimination of the quads is performed in order to reduce inter-view redundancies and thus provide a compact representation. Moreover, the proposed methodology for extracting the representation allows to reduce ghosting artifacts. Finally, an adapted compression technique is proposed that limits coding artifacts. The results presented on two real sequences show that the proposed representation provides a good trade-off between rendering quality and data compactness.

13. PATTERN CLASSIFICATION APPROACHES TO MATCHING BUILDING POLYGONS AT MULTIPLE SCALES

Directory of Open Access Journals (Sweden)

X. Zhang

2012-07-01

Full Text Available Matching of building polygons with different levels of detail is crucial in the maintenance and quality assessment of multi-representation databases. Two general problems need to be addressed in the matching process: (1 Which criteria are suitable? (2 How to effectively combine different criteria to make decisions? This paper mainly focuses on the second issue and views data matching as a supervised pattern classification. Several classifiers (i.e. decision trees, Naive Bayes and support vector machines are evaluated for the matching task. Four criteria (i.e. position, size, shape and orientation are used to extract information for these classifiers. Evidence shows that these classifiers outperformed the weighted average approach.

14. Treks into intuitive geometry the world of polygons and polyhedra

CERN Document Server

Akiyama, Jin

2015-01-01

This book is written in a style that uncovers the mathematical theories buried in our everyday lives such as examples from patterns that appear in nature, art, and traditional crafts, and in mathematical mechanisms in techniques used by architects. The authors believe that through dialogues between students and mathematicians, readers may discover the processes by which the founders of the theories came to their various conclusions―their trials, errors, tribulations, and triumphs. The goal is for readers to refine their mathematical sense of how to find good questions and how to grapple with these problems. Another aim is to provide enjoyment in the process of applying mathematical rules to beautiful art and design by examples that highlight the wonders and mysteries from our daily lives. To fulfill these aims, this book deals with the latest unique and beautiful results in polygons and polyhedra and the dynamism of geometrical research history that can be found around us. The term "intuitive geometry" was ...

15. Vortex breakdown in closed containers with polygonal cross sections

International Nuclear Information System (INIS)

Naumov, I. V.; Dvoynishnikov, S. V.; Kabardin, I. K.; Tsoy, M. A.

2015-01-01

The vortex breakdown bubble in the confined flow generated by a rotating lid in closed containers with polygonal cross sections was analysed both experimentally and numerically for the height/radius aspect ratio equal to 2. The stagnation point locations of the breakdown bubble emergence and the corresponding Reynolds number were determined experimentally and in addition computed numerically by STAR-CCM+ CFD software for square, pentagonal, hexagonal, and octagonal cross section configurations. The flow pattern and the velocity were observed and measured by combining the seeding particle visualization and the temporal accuracy of laser Doppler anemometry. The vortex breakdown size and position on the container axis were determined for Reynolds numbers, ranging from 1450 to 2400. The obtained results were compared with the flow structure in the closed container of cubical and cylindrical configurations. It is shown that the measured evolution of steady vortex breakdown is in close agreement with the numerical results

16. Polygons of differential equations for finding exact solutions

International Nuclear Information System (INIS)

Kudryashov, Nikolai A.; Demina, Maria V.

2007-01-01

A method for finding exact solutions of nonlinear differential equations is presented. Our method is based on the application of polygons corresponding to nonlinear differential equations. It allows one to express exact solutions of the equation studied through solutions of another equation using properties of the basic equation itself. The ideas of power geometry are used and developed. Our approach has a pictorial interpretation, which is illustrative and effective. The method can be also applied for finding transformations between solutions of differential equations. To demonstrate the method application exact solutions of several equations are found. These equations are: the Korteveg-de Vries-Burgers equation, the generalized Kuramoto-Sivashinsky equation, the fourth-order nonlinear evolution equation, the fifth-order Korteveg-de Vries equation, the fifth-order modified Korteveg-de Vries equation and the sixth-order nonlinear evolution equation describing turbulent processes. Some new exact solutions of nonlinear evolution equations are given

17. Generalized Swept Mid-structure for Polygonal Models

KAUST Repository

Martin, Tobias; Chen, Guoning; Musuvathy, Suraj; Cohen, Elaine; Hansen, Charles

2012-01-01

We introduce a novel mid-structure called the generalized swept mid-structure (GSM) of a closed polygonal shape, and a framework to compute it. The GSM contains both curve and surface elements and has consistent sheet-by-sheet topology, versus triangle-by-triangle topology produced by other mid-structure methods. To obtain this structure, a harmonic function, defined on the volume that is enclosed by the surface, is used to decompose the volume into a set of slices. A technique for computing the 1D mid-structures of these slices is introduced. The mid-structures of adjacent slices are then iteratively matched through a boundary similarity computation and triangulated to form the GSM. This structure respects the topology of the input surface model is a hybrid mid-structure representation. The construction and topology of the GSM allows for local and global simplification, used in further applications such as parameterization, volumetric mesh generation and medical applications.

18. Generalized Swept Mid-structure for Polygonal Models

KAUST Repository

Martin, Tobias

2012-05-01

We introduce a novel mid-structure called the generalized swept mid-structure (GSM) of a closed polygonal shape, and a framework to compute it. The GSM contains both curve and surface elements and has consistent sheet-by-sheet topology, versus triangle-by-triangle topology produced by other mid-structure methods. To obtain this structure, a harmonic function, defined on the volume that is enclosed by the surface, is used to decompose the volume into a set of slices. A technique for computing the 1D mid-structures of these slices is introduced. The mid-structures of adjacent slices are then iteratively matched through a boundary similarity computation and triangulated to form the GSM. This structure respects the topology of the input surface model is a hybrid mid-structure representation. The construction and topology of the GSM allows for local and global simplification, used in further applications such as parameterization, volumetric mesh generation and medical applications.

19. An electrophysiological study of the mental rotation of polygons.

Science.gov (United States)

Pierret, A; Peronnet, F; Thevenet, M

1994-05-09

Reaction times and event-related potentials (ERPs) were recorded during a task requiring subjects to decide whether two sequentially presented polygons had the same shape regardless of differences in orientation. Reaction times increased approximately linearly with angular departure from upright orientation, which suggests that mental rotation was involved in the comparison process. The ERPs showed, between 665 and 1055 ms, a late posterior negativity also increasing with angular disparity from upright, which we assumed to reflect mental rotation. Two other activities were exhibited, from 265 to 665 ms, which may be related either to an evaluation of the stimulus or a predetermination of its orientation, and from 1055 to 1600 ms attributed to the decision process.

20. Experimental investigation into the mechanism of the polygonal wear of electric locomotive wheels

Science.gov (United States)

Tao, Gongquan; Wang, Linfeng; Wen, Zefeng; Guan, Qinghua; Jin, Xuesong

2018-06-01

Experiments were conducted at field sites to investigate the mechanism of the polygonal wear of electric locomotive wheels. The polygonal wear rule of electric locomotive wheels was obtained. Moreover, two on-track tests have been carried out to investigate the vibration characteristics of the electric locomotive's key components. The measurement results of wheels out-of-round show that most electric locomotive wheels exhibit polygonal wear. The main centre wavelength in the 1/3 octave bands is 200 mm and/or 160 mm. The test results of vibration characteristics indicate that the dominating frequency of the vertical acceleration measured on the axle box is approximately equal to the passing frequency of a polygonal wheel, and does not vary with the locomotive speed during the acceleration course. The wheelset modal analysis using the finite element method (FEM) indicates that the first bending resonant frequency of the wheelset is quite close to the main vibration frequency of the axle box. The FEM results are verified by the experimental modal analysis of the wheelset. Moreover, different plans were designed to verify whether the braking system and the locomotive's adhesion control have significant influence on the wheel polygon or not. The test results indicate that they are not responsible for the initiation of the wheel polygon. The first bending resonance of the wheelset is easy to be excited in the locomotive operation and it is the root cause of wheel polygon with centre wavelength of 200 mm in the 1/3 octave bands.