WorldWideScience

Sample records for convex mirrors

  1. Transverse-Mode Control of VCSELs With Convex Mirror

    Institute of Scientific and Technical Information of China (English)

    2003-01-01

    We propose the transverse-mode control of vertical-cavity surface-emitting lasers (VCSELs) with a convex mirror. A possibility of improvements on single-mode output power and higher-order mode suppression is presented by optimizing a convex mirror.

  2. Study on optical fabrication and metrology of precise convex aspheric mirror

    Science.gov (United States)

    Wang, Huijun; Xu, Jin; Wang, Peng; Li, Ang; Guo, Wen; Du, Yan

    2016-10-01

    Optical fabrication and metrology technologies are studied in the paper to improve the accuracy of surface figure of a convex aspheric mirror. First, the main specifications of a convex aspheric mirror which is chosen to be the secondary mirror of an optical system are presented. The aperture of the mirror is 400mm. The mirror is made of ultra-low expansion (ULE) glass with honeycomb sandwich structure to get the ideal lightweight requirement. Then the mirror is surfaced by ultrasonic grinding, smart robot lapping and smart robot polishing processes relatively. Large-apertured tool is applied to reduce the mid-frequency surface error. Both the contour measuring method in the grinding and lapping stage and the measuring method with meniscus lens and its calibration mirror in the polishing stage are studied. The final surface figure of the mirror is that the root mean-square value (RMS value) is 0.016λ (λ=632.8nm), which meets the requirement of the optical system. The results show that the forging surfacing processes and measuring methods are accurate and efficient to fabricate the convex aspheric mirror and can be applied in optical fabrication for larger-apertured convex aspheric mirrors.

  3. Reflections on Parmigianino's Self portrait in a convex mirror: a computer graphics reconstruction of the artist's studio

    Science.gov (United States)

    Stork, David G.; Furuichi, Yasuo

    2010-02-01

    We built a full computer graphics model of Parmigianino's studio, including convex mirror, in order to explore the artist's likely working methods during his execution of Self portrait in a convex mirror (1523-4). Our model supports Vasari's record that the radius of curvature of a convex mirror matched the radius of curvature of the wood panel support. We find that the image in the painting is consistent with a simple horizontal rectilinear room drawn from a slightly re-oriented and re-positioned mirror. Our optical analyses lead us to recommend an alteration to the current display arrangement in the Kunsthistorisches Museum.

  4. A generalized electrostatic micro-mirror (GEM) model for a two-axis convex piecewise linear shaped MEMS mirror

    Science.gov (United States)

    Edwards, C. L.; Edwards, M. L.

    2009-05-01

    MEMS micro-mirror technology offers the opportunity to replace larger optical actuators with smaller, faster ones for lidar, network switching, and other beam steering applications. Recent developments in modeling and simulation of MEMS two-axis (tip-tilt) mirrors have resulted in closed-form solutions that are expressed in terms of physical, electrical and environmental parameters related to the MEMS device. The closed-form analytical expressions enable dynamic time-domain simulations without excessive computational overhead and are referred to as the Micro-mirror Pointing Model (MPM). Additionally, these first-principle models have been experimentally validated with in-situ static, dynamic, and stochastic measurements illustrating their reliability. These models have assumed that the mirror has a rectangular shape. Because the corners can limit the dynamic operation of a rectangular mirror, it is desirable to shape the mirror, e.g., mitering the corners. Presented in this paper is the formulation of a generalized electrostatic micromirror (GEM) model with an arbitrary convex piecewise linear shape that is readily implemented in MATLAB and SIMULINK for steady-state and dynamic simulations. Additionally, such a model permits an arbitrary shaped mirror to be approximated as a series of linearly tapered segments. Previously, "effective area" arguments were used to model a non-rectangular shaped mirror with an equivalent rectangular one. The GEM model shows the limitations of this approach and provides a pre-fabrication tool for designing mirror shapes.

  5. Ion beam figuring of Φ520mm convex hyperbolic secondary mirror

    Science.gov (United States)

    Meng, Xiaohui; Wang, Yonggang; Li, Ang; Li, Wenqing

    2016-10-01

    The convex hyperbolic secondary mirror is a Φ520-mm Zerodur lightweight hyperbolic convex mirror. Typically conventional methods like CCOS, stressed-lap polishing are used to manufacture this secondary mirror. Nevertheless, the required surface accuracy cannot be achieved through the use of conventional polishing methods because of the unpredictable behavior of the polishing tools, which leads to an unstable removal rate. Ion beam figuring is an optical fabrication method that provides highly controlled error of previously polished surfaces using a directed, inert and neutralized ion beam to physically sputter material from the optic surface. Several iterations with different ion beam size are selected and optimized to fit different stages of surface figure error and spatial frequency components. Before ion beam figuring, surface figure error of the secondary mirror is 2.5λ p-v, 0.23λ rms, and is improved to 0.12λ p-v, 0.014λ rms in several process iterations. The demonstration clearly shows that ion beam figuring can not only be used to the final correction of aspheric, but also be suitable for polishing the coarse surface of large, complex mirror.

  6. Improved methods for dewarping images in convex mirrors in fine art: applications to van Eyck and Parmigianino

    Science.gov (United States)

    Usami, Yumi; Stork, David G.; Fujiki, Jun; Hino, Hideitsu; Akaho, Shotaro; Murata, Noboru

    2011-03-01

    We derive and demonstrate new methods for dewarping images depicted in convex mirrors in artwork and for estimating the three-dimensional shapes of the mirrors themselves. Previous methods were based on the assumption that mirrors were spherical or paraboloidal, an assumption unlikely to hold for hand-blown glass spheres used in early Renaissance art, such as Johannes van Eyck's Portrait of Giovanni (?) Arnolfini and his wife (1434) and Robert Campin's Portrait of St. John the Baptist and Heinrich von Werl (1438). Our methods are more general than such previous methods in that we assume merely that the mirror is radially symmetric and that there are straight lines (or colinear points) in the actual source scene. We express the mirror's shape as a mathematical series and pose the image dewarping task as that of estimating the coefficients in the series expansion. Central to our method is the plumbline principle: that the optimal coefficients are those that dewarp the mirror image so as to straighten lines that correspond to straight lines in the source scene. We solve for these coefficients algebraically through principal component analysis, PCA. Our method relies on a global figure of merit to balance warping errors throughout the image and it thereby reduces a reliance on the somewhat subjective criterion used in earlier methods. Our estimation can be applied to separate image annuli, which is appropriate if the mirror shape is irregular. Once we have found the optimal image dewarping, we compute the mirror shape by solving a differential equation based on the estimated dewarping function. We demonstrate our methods on the Arnolfini mirror and reveal a dewarped image superior to those found in prior work|an image noticeably more rectilinear throughout and having a more coherent geometrical perspective and vanishing points. Moreover, we find the mirror deviated from spherical and paraboloidal shape; this implies that it would have been useless as a concave

  7. Investigation of Copper Vapor Pulsed Laser with Industrial Active Elements of “Kulon” Series using One Convex Mirror Mode and Its Capabilities for Technological Applications

    Directory of Open Access Journals (Sweden)

    N. A. Lyabin

    2014-01-01

    Full Text Available Within the scope of the given paper spatial, time and energy characteristics of a copper vapor laser (CVL| have been investigated in the mode of one convex mirror using the most powerful industrial sealed-off active elements (AE of “Kulon” series: 15 W GL-206D model and 20 W GL-206I model in order to define the capabilities of using its one-beam radiation for effective microprocessing of materials.The carried out calculations and experimental investigations showed that one can vary the radiation beam divergence within a wide range by changing the radius of curvature of CVL convex mirror; and one can reach values close to diffraction limit at radii of curvature one-two orders lower than the distance from the mirror to AE output aperture. At small radii of mirror curvature (R = 6-30 mm the CVL output radiation beam divergence can only 2-3 times (0.15- 0.35 mrad differ from diffraction limit. At these divergences the peak power density in a focused spot can reach 109…1010 W/cm2 values.With the increase of AE discharge channel length the CVL output radiation beam divergence in one-mirror mode decreases and tends to diffraction limit, while power increases, which in the aggregate leads to the sharp increase of peak power density. Therefore, from practical point of view the industrial AEs “Crystal” GL-205А and GL-205B with 0.93 and 1.23 m discharge channel length and 20 mm diameter are the most effective ones. Besides the formation of one high quality beam, the advantages of one-mirror mode include a high axis stability of directivity pattern of this beam and pulsed energy, which increase the quality of microprocessing of materials.Practical experience of using CVL with one convex mirror shows that 109 W/cm2 peak power density level is sufficient only for efficient microprocessing of foiled materials and solder cutouts (0.02-0.1 мм. The use of this CVL as a driving oscillator (DO in a copper vapor laser system (CVLS of the type: driving

  8. Mirroring

    DEFF Research Database (Denmark)

    Wegener, Gregers

    2016-01-01

    and metaphorical value of mirroring for creativity theory across two different research fields — neuroscience and learning. We engage in a mutual (possibly creative) exploration of mirroring from ‘mirror neurons’ to mirroring in social learning theory. One of the most fascinating aspects of mirroring......Most definitions of creativity emphasise originality. The creative product is recognised as distinct from other products and the creative person as someone who stands out from the crowd. What tend to be overlooked are acts of mirroring as a crucial element of the creative process. The human ability...... to empathise and socialise is partly due to another, more fundamental ability to duplicate the stance of the other (see also Chapter 13). Through mirroring, we attune to other people and thus create resonance and preparedness for mutual creative exploration. In this chapter, we investigate the object...

  9. Convexity Adjustments

    DEFF Research Database (Denmark)

    M. Gaspar, Raquel; Murgoci, Agatha

    2010-01-01

    of particular importance to practitioners: yield convexity adjustments, forward versus futures convexity adjustments, timing and quanto convexity adjustments. We claim that the appropriate way to look into any of these adjustments is as a side effect of a measure change, as proposed by Pelsser (2003...

  10. Undergraduate Convexity

    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...

  11. Subaperture Stitching Interferometry for Large Convex Aspheric Surfaces Project

    Data.gov (United States)

    National Aeronautics and Space Administration — The size and accuracy specifications of telescope mirrors are ever more demanding. This is particularly true for secondary mirrors, as they are convex and thus...

  12. Cubes convexes

    CERN Document Server

    Nedjar, Sebastien; Cicchetti, Rosine; Lakhal, Lotfi; 10.3166/isi.11.6.11-31

    2010-01-01

    In various approaches, data cubes are pre-computed in order to answer efficiently OLAP queries. The notion of data cube has been declined in various ways: iceberg cubes, range cubes or differential cubes. In this paper, we introduce the concept of convex cube which captures all the tuples of a datacube satisfying a constraint combination. It can be represented in a very compact way in order to optimize both computation time and required storage space. The convex cube is not an additional structure appended to the list of cube variants but we propose it as a unifying structure that we use to characterize, in a simple, sound and homogeneous way, the other quoted types of cubes. Finally, we introduce the concept of emerging cube which captures the significant trend inversions. characterizations.

  13. 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...

  14. On Convex Quadratic Approximation

    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

  15. On Convex Quadratic Approximation

    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

  16. Uniformly convex and strictly convex Orlicz spaces

    Science.gov (United States)

    Masta, Al Azhary

    2016-02-01

    In this paper we define the new norm of Orlicz spaces on ℝn through a multiplication operator on an old Orlicz spaces. We obtain some necessary and sufficient conditions that the new norm to be a uniformly convex and strictly convex spaces.

  17. Convex Aspherical Surface Testing Using Catadioptric Partial Compensating System

    Science.gov (United States)

    Wang, Jingxian; Hao, Qun; Hu, Yao; Wang, Shaopu; Li, Tengfei; Tian, Yuhan; Li, Lin

    2016-01-01

    Aspheric optical components are the indispensable part of modern optics systems. With the constant development of aspheric optical fabrication technique, the systems with large aperture convex aspheric optical components are widely used in astronomy and space optics. Thus, the measurement of the figure error of the whole convex aspherical surface with high precision comes to be a challenge in the area of optical surface manufacture, and surface testing method is also very important. This paper presents a new partial compensating system by the combination of a refractive lens and a reflective mirror for testing convex aspherical surface. The refractive lens is used to compensate the aberration of the tested convex asphere partially. The reflective mirror is a spherical mirror which is coaxial to the refractive lens and reflecting the lights reflected by the tested convex asphere back to the convex asphere itself. With the long focal length and large aperture system we can realize a lighter and more compact system than the refractive partial compensating system because the spheric reflective mirror is more easily to realize and can bending the light conveniently.

  18. Bornological Locally Convex Cones

    Directory of Open Access Journals (Sweden)

    Davood Ayaseh

    2014-10-01

    Full Text Available In this paper we define bornological and b-bornological cones and investigate their properties. We give some characterization for these cones. In the special case of locally convex topological vector space both these concepts reduce to the known concept  of bornological spaces. We introduce and investigate the  convex quasiuniform   structures U_{tau}, U_{sigma}(P,P* and \\U_{beta}(P,P* on locally convex cone (P,U.

  19. Uniformly Convex Metric Spaces

    OpenAIRE

    Kell Martin

    2014-01-01

    In this paper the theory of uniformly convex metric spaces is developed. These spaces exhibit a generalized convexity of the metric from a fixed point. Using a (nearly) uniform convexity property a simple proof of reflexivity is presented and a weak topology of such spaces is analyzed. This topology called co-convex topology agrees with the usualy weak topology in Banach spaces. An example of a $CAT(0)$-spaces with weak topology which is not Hausdorff is given. This answers questions raised b...

  20. 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

  1. The heart of a convex body

    CERN Document Server

    Brasco, Lorenzo

    2012-01-01

    We investigate some basic properties of the {\\it heart} $\\heartsuit(\\mathcal{K})$ of a convex set $\\mathcal{K}.$ It is a subset of $\\mathcal{K},$ whose definition is based on mirror reflections of euclidean space, and is a non-local object. The main motivation of our interest for $\\heartsuit(\\mathcal{K})$ is that this gives an estimate of the location of the hot spot in a convex heat conductor with boundary temperature grounded at zero. Here, we investigate on the relation between $\\heartsuit(\\mathcal{K})$ and the mirror symmetries of $\\mathcal{K};$ we show that $\\heartsuit(\\mathcal{K})$ contains many (geometrically and phisically) relevant points of $\\mathcal{K};$ we prove a simple geometrical lower estimate for the diameter of $\\heartsuit(\\mathcal{K});$ we also prove an upper estimate for the area of $\\heartsuit(\\mathcal{K}),$ when $\\mathcal{K}$ is a triangle.

  2. Contraction of Perceived Size and Perceived Depth in Mirrors

    Science.gov (United States)

    Higashiyama, Atsuki; Shimono, Koichi; Zaitsu, Wataru

    2005-01-01

    We investigated how size and depth are perceived in a plane or convex mirror. In Experiment 1, using a plane or convex mirror, 20 observers viewed a separation between two objects that were presented at a constant distance and reproduced it by a separation between other two objects in a natural viewing situation. The mean matches generally…

  3. On convexity in complex networks

    CERN Document Server

    Marc, Tilen

    2016-01-01

    Metric graph properties lie in the heart of the analysis of complex networks, while in this paper we study their convexity. We analyze the expansion of convex subsets of nodes in empirical networks and also convexity of small subgraphs known as graphlets. We demonstrate that convexity is an inherent property of complex networks not present in a random graph. According to our perception of convexity, a convex network is such in which every connected subset of nodes induces a convex subgraph. Especially convex are technological networks and social collaboration graphs, whereas food webs are the only networks studied that are truly non-convex. Many other networks can be divided into a non-convex core surrounded by a convex periphery. We interpret convexity in terms of redundancy of shortest paths in a network and discuss possible applications.

  4. 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....

  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 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. Statistical properties of convex clustering

    OpenAIRE

    Tan, Kean Ming; Witten, Daniela

    2015-01-01

    In this manuscript, we study the statistical properties of convex clustering. We establish that convex clustering is closely related to single linkage hierarchical clustering and $k$-means clustering. In addition, we derive the range of the tuning parameter for convex clustering that yields a non-trivial solution. We also provide an unbiased estimator of the degrees of freedom, and provide a finite sample bound for the prediction error for convex clustering. We compare convex clustering to so...

  7. 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...

  8. Convex Geometry and Stoichiometry

    CERN Document Server

    Jer-Chin,

    2011-01-01

    We demonstrate the benefits of a convex geometric perspective for questions on chemical stoichiometry. We show that the balancing of chemical equations, the use of "mixtures" to explain multiple stoichiometry, and the half-reaction for balancing redox actions all yield nice convex geometric interpretations. We also relate some natural questions on reaction mechanisms with the enumeration of lattice points in polytopes. Lastly, it is known that a given reaction mechanism imposes linear constraints on observed stoichiometries. We consider the inverse question of deducing reaction mechanism consistent with a given set of linear stoichiometric restrictions.

  9. SMOOTHING BY CONVEX QUADRATIC PROGRAMMING

    Institute of Scientific and Technical Information of China (English)

    Bing-sheng He; Yu-mei Wang

    2005-01-01

    In this paper, we study the relaxed smoothing problems with general closed convex constraints. It is pointed out that such problems can be converted to a convex quadratic minimization problem for which there are good programs in software libraries.

  10. Global approximation of convex functions

    CERN Document Server

    Azagra, D

    2011-01-01

    We show that for every (not necessarily bounded) open convex subset $U$ of $\\R^n$, every (not necessarily Lipschitz or strongly) convex function $f:U\\to\\R$ can be approximated by real analytic convex functions, uniformly on all of $U$. In doing so we provide a technique which transfers results on uniform approximation on bounded sets to results on uniform approximation on unbounded sets, in such a way that not only convexity and $C^k$ smoothness, but also local Lipschitz constants, minimizers, order, and strict or strong convexity, are preserved. This transfer method is quite general and it can also be used to obtain new results on approximation of convex functions defined on Riemannian manifolds or Banach spaces. We also provide a characterization of the class of convex functions which can be uniformly approximated on $\\R^n$ by strongly convex functions.

  11. VLT beryllium secondary mirror no. 1: performance review

    Science.gov (United States)

    Cayrel, Marc

    1998-08-01

    The four Very Large Telescope secondary mirrors are 1.2-m Beryllium lightweight convex mirrors. REOSC has been selected for the design and manufacturing of the optics and of their supporting system. The first mirror unit has been delivered in September, 1997. Operating from visible to near infrared, the mirror defines the telescope aperture stop and may be chopped during observation. The optical requirements are tight and a high stiffness, low weight and inertia are requested as well. Using beryllium is a technical challenge for such a large optic manufacturing, in particular regarding its stability. The requirements and design are presented, we review the mirror manufacturing steps: blank production, machining, grinding, Nickel plating, polishing, integration and testing. The optical quality control method, a problem for large convex mirrors control, is detailed. The results of acceptance testing of mirror No. 1 are summarized, we present conclusions about the mirror figure stability. The status of the three additional mirrors manufacturing is presented to conclude.

  12. Egalitarianism in Convex Fuzzy Games

    NARCIS (Netherlands)

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

    2002-01-01

    In this paper the egalitarian solution for convex cooperative fuzzy games is introduced.The classical Dutta-Ray algorithm for finding the constrained egalitarian solution for convex crisp games is adjusted to provide the egalitarian solution of a convex fuzzy game.This adjusted algorithm is also a f

  13. Average Convexity in Communication Situations

    NARCIS (Netherlands)

    Slikker, M.

    1998-01-01

    In this paper we study inheritance properties of average convexity in communication situations. We show that the underlying graph ensures that the graphrestricted game originating from an average convex game is average convex if and only if every subgraph associated with a component of the underlyin

  14. Four-mirror extreme ultraviolet (EUV) lithography projection system

    Science.gov (United States)

    Cohen, Simon J; Jeong, Hwan J; Shafer, David R

    2000-01-01

    The invention is directed to a four-mirror catoptric projection system for extreme ultraviolet (EUV) lithography to transfer a pattern from a reflective reticle to a wafer substrate. In order along the light path followed by light from the reticle to the wafer substrate, the system includes a dominantly hyperbolic convex mirror, a dominantly elliptical concave mirror, spherical convex mirror, and spherical concave mirror. The reticle and wafer substrate are positioned along the system's optical axis on opposite sides of the mirrors. The hyperbolic and elliptical mirrors are positioned on the same side of the system's optical axis as the reticle, and are relatively large in diameter as they are positioned on the high magnification side of the system. The hyperbolic and elliptical mirrors are relatively far off the optical axis and hence they have significant aspherical components in their curvatures. The convex spherical mirror is positioned on the optical axis, and has a substantially or perfectly spherical shape. The spherical concave mirror is positioned substantially on the opposite side of the optical axis from the hyperbolic and elliptical mirrors. Because it is positioned off-axis to a degree, the spherical concave mirror has some asphericity to counter aberrations. The spherical concave mirror forms a relatively large, uniform field on the wafer substrate. The mirrors can be tilted or decentered slightly to achieve further increase in the field size.

  15. Efficient Approximation of Convex Recolorings

    OpenAIRE

    Moran, Shlomo; Snir, Sagi

    2005-01-01

    A coloring of a tree is convex if the vertices that pertain to any color induce a connected subtree; a partial coloring (which assigns colors to some of the vertices) is convex if it can be completed to a convex (total) coloring. Convex coloring of trees arise in areas such as phylogenetics, linguistics, etc. eg, a perfect phylogenetic tree is one in which the states of each character induce a convex coloring of the tree. Research on perfect phylogeny is usually focused on finding a tree so t...

  16. Convex Graph Invariants

    Science.gov (United States)

    2010-12-02

    evaluating the function ΘP (A) for any fixed A,P is equivalent to solving the so-called Quadratic Assignment Problem ( QAP ), and thus we can employ various...tractable linear programming, spectral, and SDP relaxations of QAP [40, 11, 33]. In particular we discuss recent work [14] on exploiting group...symmetry in SDP relaxations of QAP , which is useful for approximately computing elementary convex graph invariants in many interesting cases. Finally in

  17. Advanced Optical Metrology for XRAY Replication Mandrels and Mirrors Project

    Data.gov (United States)

    National Aeronautics and Space Administration — Advanced x-ray observatories such as IXO and GenX will require thousands of thin shell mirror segments produced by replication using convex mandrels. Quality and...

  18. Introducing the Adaptive Convex Enveloping

    CERN Document Server

    Yu, Sheng

    2011-01-01

    Convexity, though extremely important in mathematical programming, has not drawn enough attention in the field of dynamic programming. This paper gives conditions for verifying convexity of the cost-to-go functions, and introduces an accurate, fast and reliable algorithm for solving convex dynamic programs with multivariate continuous states and actions, called Adaptive Convex Enveloping. This is a short introduction of the core technique created and used in my dissertation, so it is less formal, and misses some parts, such as literature review and reference, compared to a full journal paper.

  19. Convex polytopes and quantum states

    Energy Technology Data Exchange (ETDEWEB)

    Wilmott, Colin; Kampermann, Hermann; Bruss, Dagmar [Institut fuer Theoretische Physik III, Heinrich-Heine-Universitaet Duesseldorf (Germany)

    2010-07-01

    A convex polytope is defined as the convex hull of a finite non-empty set of vectors. We present a theorem of Rado (1952) which characterizes the convex hull of the collection of all permutations of a given real d-tuple in terms of the Hardy-Littlewood-Polya spectral order relation prec. We give a necessary and sufficient condition to construct a d-dimensional convex polytope which utilizes Rado's original (d-1)-dimensional characterization, and we describe how the resulting polytope may be placed in a quantum mechanical framework.

  20. 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

  1. Convex Optimization without Projection Steps

    CERN Document Server

    Jaggi, Martin

    2011-01-01

    We study the general problem of minimizing a convex function over a compact convex domain. We will investigate a simple iterative approximation algorithm that does not need projection steps in order to stay inside the optimization domain. Instead of a projection step, the linearized problem defined by a current subgradient is solved, which gives a step direction that will naturally stay in the domain. The approach generalizes the sparse greedy algorithm of Clarkson (and the low-rank SDP solver by Hazan) to arbitrary convex domains, and to using subgradients for the case of non-differentiable convex functions. Analogously, we give a convergence proof guaranteeing {\\epsilon}-small duality gap after O(1/{\\epsilon}) iterations. The framework allows us understand the sparsity of approximate solutions for any l1-regularized convex optimization problem, expressed as a function of the approximation quality. We obtain matching upper and lower bounds of {\\Theta}(1/{\\epsilon}) for the sparsity for l1-problems. The same ...

  2. Einstein's Mirror

    Science.gov (United States)

    Gjurchinovski, Aleksandar; Skeparovski, Aleksandar

    2008-01-01

    Reflection of light from a plane mirror in uniform rectilinear motion is a century-old problem, intimately related to the foundations of special relativity. The problem was first investigated by Einstein in his famous 1905 paper by using the Lorentz transformations to switch from the mirror's rest frame to the frame where the mirror moves at a…

  3. Decision Problems For Convex Languages

    CERN Document Server

    Brzozowski, Janusz; Xu, Zhi

    2008-01-01

    In this paper we examine decision problems associated with various classes of convex languages, studied by Ang and Brzozowski (under the name "continuous languages''). We show that we can decide whether a given language L is prefix-, suffix-, factor-, or subword-convex in polynomial time if L is represented by a DFA, but that the problem is PSPACE-hard if L is represented by an NFA. In the case that a regular language is not convex, we prove tight upper bounds on the length of the shortest words demonstrating this fact, in terms of the number of states of an accepting DFA. Similar results are proved for some subclasses of convex languages: the prefix-, suffix-, factor-, and subword-closed languages, and the prefix-, suffix-, factor-, and subword-free languages.

  4. Covering Numbers for Convex Functions

    CERN Document Server

    Guntuboyina, Adityanand

    2012-01-01

    In this paper we study the covering numbers of the space of convex and uniformly bounded functions in multi-dimension. We find optimal upper and lower bounds for the $\\epsilon$-covering number of $\\C([a, b]^d, B)$, in the $L_p$-metric, $1 \\le p 0$, and $\\C([a,b]^d, B)$ denotes the set of all convex functions on $[a, b]^d$ that are uniformly bounded by $B$. We summarize previously known results on covering numbers for convex functions and also provide alternate proofs of some known results. Our results have direct implications in the study of rates of convergence of empirical minimization procedures as well as optimal convergence rates in the numerous convexity constrained function estimation problems.

  5. Chiral mirrors

    Energy Technology Data Exchange (ETDEWEB)

    Plum, Eric, E-mail: erp@orc.soton.ac.uk [Optoelectronics Research Centre and Centre for Photonic Metamaterials, University of Southampton, Highfield, Southampton SO17 1BJ (United Kingdom); Zheludev, Nikolay I., E-mail: niz@orc.soton.ac.uk [Optoelectronics Research Centre and Centre for Photonic Metamaterials, University of Southampton, Highfield, Southampton SO17 1BJ (United Kingdom); The Photonics Institute and Centre for Disruptive Photonic Technologies, Nanyang Technological University, Singapore 637378 (Singapore)

    2015-06-01

    Mirrors are used in telescopes, microscopes, photo cameras, lasers, satellite dishes, and everywhere else, where redirection of electromagnetic radiation is required making them arguably the most important optical component. While conventional isotropic mirrors will reflect linear polarizations without change, the handedness of circularly polarized waves is reversed upon reflection. Here, we demonstrate a type of mirror reflecting one circular polarization without changing its handedness, while absorbing the other. The polarization-preserving mirror consists of a planar metasurface with a subwavelength pattern that cannot be superimposed with its mirror image without being lifted out of its plane, and a conventional mirror spaced by a fraction of the wavelength from the metasurface. Such mirrors enable circularly polarized lasers and Fabry-Pérot cavities with enhanced tunability, gyroscopic applications, polarization-sensitive detectors of electromagnetic waves, and can be used to enhance spectroscopies of chiral media.

  6. Complex Convexity of Orlicz Modular Sequence Spaces

    Directory of Open Access Journals (Sweden)

    Lili Chen

    2016-01-01

    Full Text Available The concepts of complex extreme points, complex strongly extreme points, complex strict convexity, and complex midpoint locally uniform convexity in general modular spaces are introduced. Then we prove that, for any Orlicz modular sequence space lΦ,ρ, lΦ,ρ is complex midpoint locally uniformly convex. As a corollary, lΦ,ρ is also complex strictly convex.

  7. Uniformly convex-transitive function spaces

    OpenAIRE

    Rambla-Barreno, Fernando; Talponen, Jarno

    2009-01-01

    We introduce a property of Banach spaces called uniform convex-transitivity, which falls between almost transitivity and convex-transitivity. We will provide examples of uniformly convex-transitive spaces. This property behaves nicely in connection with some Banach-valued function spaces. As a consequence, we obtain new examples of convex-transitive Banach spaces.

  8. On Fuzzy Simplex and Fuzzy Convex Hull

    Institute of Scientific and Technical Information of China (English)

    Dong QIU; Wei Quan ZHANG

    2011-01-01

    In this paper,we discuss fuzzy simplex and fuzzy convex hull,and give several representation theorems for fuzzy simplex and fuzzy convex hull.In addition,by giving a new characterization theorem of fuzzy convex hull,we improve some known results about fuzzy convex hull.

  9. The Convex Coordinates of the Symmedian Point

    Science.gov (United States)

    Boyd, J. N.; Raychowdhury, P. N.

    2006-01-01

    In this note, we recall the convex (or barycentric) coordinates of the points of a closed triangular region. We relate the convex and trilinear coordinates of the interior points of the triangular region. We use the relationship between convex and trilinear coordinates to calculate the convex coordinates of the symmedian point of the triangular…

  10. Convexity Adjustments for ATS Models

    DEFF Research Database (Denmark)

    Murgoci, Agatha; Gaspar, Raquel M.

    Practitioners are used to value a broad class of exotic interest rate derivatives simply by preforming for what is known as convexity adjustments (or convexity corrections). We start by exploiting the relations between various interest rate models and their connections to measure changes. As a re......Practitioners are used to value a broad class of exotic interest rate derivatives simply by preforming for what is known as convexity adjustments (or convexity corrections). We start by exploiting the relations between various interest rate models and their connections to measure changes....... 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...... formulas. Concretely for LIBOR in arrears (LIA) contracts, we derive the system of Riccatti ODE-s one needs to compute to obtain the exact adjustment. Based upon the ideas of Schrager and Pelsser (2006) we are also able to derive general swap adjustments useful, in particular, when dealing with constant...

  11. Compactly convex sets in linear topological spaces

    CERN Document Server

    Banakh, T; Ravsky, O

    2012-01-01

    A convex subset X of a linear topological space is called compactly convex if there is a continuous compact-valued map $\\Phi:X\\to exp(X)$ such that $[x,y]\\subset\\Phi(x)\\cup \\Phi(y)$ for all $x,y\\in X$. We prove that each convex subset of the plane is compactly convex. On the other hand, the space $R^3$ contains a convex set that is not compactly convex. Each compactly convex subset $X$ of a linear topological space $L$ has locally compact closure $\\bar X$ which is metrizable if and only if each compact subset of $X$ is metrizable.

  12. Powers of Convex-Cyclic Operators

    Directory of Open Access Journals (Sweden)

    Fernando León-Saavedra

    2014-01-01

    Full Text Available A bounded operator T on a Banach space X is convex cyclic if there exists a vector x such that the convex hull generated by the orbit Tnxn≥0 is dense in X. In this note we study some questions concerned with convex-cyclic operators. We provide an example of a convex-cyclic operator T such that the power Tn fails to be convex cyclic. Using this result we solve three questions posed by Rezaei (2013.

  13. A class of free locally convex spaces

    Science.gov (United States)

    Sipacheva, O. V.

    2003-04-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.

  14. The genealogy of convex solids

    CERN Document Server

    Domokos, Gabor; Szabó, Timea

    2012-01-01

    The shape of homogeneous, smooth convex bodies as described by the Euclidean distance from the center of gravity represents a rather restricted class M_C of Morse-Smale functions on S^2. Here we show that even M_C exhibits the complexity known for general Morse-Smale functions on S^2 by exhausting all combinatorial possibilities: every 2-colored quadrangulation of the sphere is isomorphic to a suitably represented Morse-Smale complex associated with a function in M_C (and vice versa). We prove our claim by an inductive algorithm, starting from the path graph P_2 and generating convex bodies corresponding to quadrangulations with increasing number of vertices by performing each combinatorially possible vertex splitting by a convexity- preserving local manipulation of the surface. Since convex bodies carrying Morse-Smale complexes isomorphic to P_2 exist, this algorithm not only proves our claim but also defines a hierarchical order among convex solids and general- izes the known classification scheme in [35], ...

  15. 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.

  16. Local Routing in Convex Subdivisions

    DEFF Research Database (Denmark)

    Bose, Prosenjit; Durocher, Stephane; Mondal, Debajyoti;

    2015-01-01

    In various wireless networking settings, node locations determine a network’s topology, allowing the network to be modelled by a geometric graph drawn in the plane. Without any additional information, local geometric routing algorithms can guarantee delivery to the target node only in restricted...... classes of geometric graphs, such as triangulations. In order to guarantee delivery on more general classes of geometric graphs (e.g., convex subdivisions or planar subdivisions), previous local geometric routing algorithms required Θ(logn) state bits to be stored and passed with the message. We present...... the first local geometric routing algorithm using only one state bit to guarantee delivery on convex subdivisions and the first local geometric memoryless routing algorithm that guarantees delivery on edge-augmented monotone subdivisions (including all convex subdivisions) when the algorithm has knowledge...

  17. Magic Mirrors

    Science.gov (United States)

    Mills, Allan

    2011-01-01

    "Magic mirrors" were so named because, when they were positioned to throw a reflected patch of sunlight on a nearby wall, this area contained an outline of a design cast on the back of the (bronze) mirror. Investigations begun in the 19th century showed that this was a response to heavy localized pressures exerted on the face of the thin mirror…

  18. Mirror symmetry

    CERN Document Server

    Voisin, Claire

    1999-01-01

    This is the English translation of Professor Voisin's book reflecting the discovery of the mirror symmetry phenomenon. The first chapter is devoted to the geometry of Calabi-Yau manifolds, and the second describes, as motivation, the ideas from quantum field theory that led to the discovery of mirror symmetry. The other chapters deal with more specialized aspects of the subject: the work of Candelas, de la Ossa, Greene, and Parkes, based on the fact that under the mirror symmetry hypothesis, the variation of Hodge structure of a Calabi-Yau threefold determines the Gromov-Witten invariants of its mirror; Batyrev's construction, which exhibits the mirror symmetry phenomenon between hypersurfaces of toric Fano varieties, after a combinatorial classification of the latter; the mathematical construction of the Gromov-Witten potential, and the proof of its crucial property (that it satisfies the WDVV equation), which makes it possible to construct a flat connection underlying a variation of Hodge structure in the ...

  19. 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.)

  20. A Microscopic Convexity Principle for Spacetime Convex Solutions of Fully Nonlinear Parabolic Equations

    Institute of Scientific and Technical Information of China (English)

    Chuan Qiang CHEN; Bo Wen HU

    2013-01-01

    We study microscopic spacetime convexity properties of fully nonlinear parabolic partial differential equations.Under certain general structure condition,we establish a constant rank theorem for the spacetime convex solutions of fully nonlinear parabolic equations.At last,we consider the parabolic convexity of solutions to parabolic equations and the convexity of the spacetime second fundamental form of geometric flows.

  1. Revisiting separation properties of convex fuzzy sets

    Science.gov (United States)

    Separation of convex sets by hyperplanes has been extensively studied on crisp sets. In a seminal paper separability and convexity are investigated, however there is a flaw on the definition of degree of separation. We revisited separation on convex fuzzy sets that have level-wise (crisp) disjointne...

  2. A Note on Permutationally Convex Games

    NARCIS (Netherlands)

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

    2005-01-01

    In this paper we generalise marginal vectors and permutational convexity.We show that if a game is generalised permutationally convex, then the corresponding generalised marginal vector is a core element.Furthermore we refine the concept of permutational convexity and show that this refinement yield

  3. On Uniform Convexity of Banach Spaces

    Institute of Scientific and Technical Information of China (English)

    Qing Jin CHENG; Bo WANG; Cui Ling WANG

    2011-01-01

    This paper gives some relations and properties of several kinds of generalized convexity in Banach spaces. As a result, it proves that every kind of uniform convexity implies the Banach-Sakes property, and several notions of uniform convexity in literature are actually equivalent.

  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 expecte

  5. 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

  6. Generalized geometrically convex functions and inequalities.

    Science.gov (United States)

    Noor, Muhammad Aslam; Noor, Khalida Inayat; Safdar, Farhat

    2017-01-01

    In this paper, we introduce and study a new class of generalized functions, called generalized geometrically convex functions. We establish several basic inequalities related to generalized geometrically convex functions. We also derive several new inequalities of the Hermite-Hadamard type for generalized geometrically convex functions. Several special cases are discussed, which can be deduced from our main results.

  7. Firey linear combinations of convex bodies

    Institute of Scientific and Technical Information of China (English)

    XIONG Ge; XIAO Qi-ming; CHEUNG Wing-Sum

    2009-01-01

    For convex bodies, the Firey linear combinations were introduced and studied in several papers. In this paper the mean width of the Firey linear combinations of convex bodies is studied, and the lower bound of the mean width of the Firey linear combinations of convex body and its polar body is given.

  8. Mirror neurons

    National Research Council Canada - National Science Library

    Rubia Vila, Francisco José

    2011-01-01

    Mirror neurons were recently discovered in frontal brain areas of the monkey. They are activated when the animal makes a specific movement, but also when the animal observes the same movement in another animal...

  9. 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.

  10. Evaluating convex roof entanglement measures.

    Science.gov (United States)

    Tóth, Géza; Moroder, Tobias; Gühne, Otfried

    2015-04-24

    We show a powerful method to compute entanglement measures based on convex roof constructions. In particular, our method is applicable to measures that, for pure states, can be written as low order polynomials of operator expectation values. We show how to compute the linear entropy of entanglement, the linear entanglement of assistance, and a bound on the dimension of the entanglement for bipartite systems. We discuss how to obtain the convex roof of the three-tangle for three-qubit states. We also show how to calculate the linear entropy of entanglement and the quantum Fisher information based on partial information or device independent information. We demonstrate the usefulness of our method by concrete examples.

  11. Mirror, mirror on the wall

    CERN Multimedia

    2005-01-01

    RICH 2, one of the two Ring Imaging Cherenkov detectors of the LHCb experiment, is being prepared to join the other detector elements ready for the first proton-proton collisions at LHC. The mirrors of the RICH2 detector are meticulously assembled in a clean room.In a large dark room, men in white move around an immense structure some 7 metres high, 10 metres wide and nearly 2.5 metres deep. Apparently effortlessly, they are installing the two large high-precision spherical mirrors. These mirrors will focus Cherenkov light, created by the charged particles that will traverse this detector, onto the photon detectors. Each spherical mirror wall is made up of facets like a fly's eye. Twenty-eight individual thin glass mirrors will all point to the same point in space to within a few micro-radians. The development of these mirrors has been technically demanding : Ideally they should be massless, sturdy, precise and have high reflectivity. In practice, though not massless, they are made from a mere 6 mm thin gl...

  12. Convex Hulls of Algebraic Sets

    CERN Document Server

    Gouveia, João

    2010-01-01

    This article describes a method to compute successive convex approximations of the convex hull of a set of points in R^n that are the solutions to a system of polynomial equations over the reals. The method relies on sums of squares of polynomials and the dual theory of moment matrices. The main feature of the technique is that all computations are done modulo the ideal generated by the polynomials defining the set to the convexified. This work was motivated by questions raised by Lov\\'asz concerning extensions of the theta body of a graph to arbitrary real algebraic varieties, and hence the relaxations described here are called theta bodies. The convexification process can be seen as an incarnation of Lasserre's hierarchy of convex relaxations of a semialgebraic set in R^n. When the defining ideal is real radical the results become especially nice. We provide several examples of the method and discuss convergence issues. Finite convergence, especially after the first step of the method, can be described expl...

  13. [Mirror neurons].

    Science.gov (United States)

    Rubia Vila, Francisco José

    2011-01-01

    Mirror neurons were recently discovered in frontal brain areas of the monkey. They are activated when the animal makes a specific movement, but also when the animal observes the same movement in another animal. Some of them also respond to the emotional expression of other animals of the same species. These mirror neurons have also been found in humans. They respond to or "reflect" actions of other individuals in the brain and are thought to represent the basis for imitation and empathy and hence the neurobiological substrate for "theory of mind", the potential origin of language and the so-called moral instinct.

  14. 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

  15. CONVEX CLASS OF STARLIKE FUNCTIONS

    OpenAIRE

    Gupta, V. P.

    1984-01-01

    Let $S$ denote the class of functions of the form $f(z)=z-¥sum_{n=2}^{¥infty}|a_{n}|z^{n}$ that are analytic and univalent in the unit disk $U$. Let $S(¥alpha, ¥beta)$ and $K(¥alpha, ¥beta)$ denote the subclasses of $S$ consisting respectively, of starlike and close-to-convex functions of order $¥alpha(0¥leqq¥alpha

  16. 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.

  17. Uniformly convex subsets of the Hilbert space with modulus of convexity of the second order

    OpenAIRE

    Balashov, Maxim V.; Repovš, Dušan,

    2011-01-01

    We prove that in the Hilbert space every uniformly convex set with modulus of convexity of the second order at zero is an intersection of closed balls of fixed radius. We also obtain an estimate of this radius.

  18. Various Expressions for Modulus of Random Convexity

    Institute of Scientific and Technical Information of China (English)

    Xiao Lin ZENG

    2013-01-01

    We first prove various kinds of expressions for modulus of random convexity by using an Lo(F,R)-valued function's intermediate value theorem and the well known Hahn-Banach theorem for almost surely bounded random linear functionals,then establish some basic properties including continuity for modulus of random convexity.In particular,we express the modulus of random convexity of a special random normed module Lo(F,X) derived from a normed space X by the classical modulus of convexity of X.

  19. What do mirror neurons mirror?

    NARCIS (Netherlands)

    Uithol, S.; Rooij, I.J.E.I. van; Bekkering, H.; Haselager, W.F.G.

    2011-01-01

    Single cell recordings in monkeys provide strong evidence for an important role of the motor system in action understanding. This evidence is backed up by data from studies of the (human) mirror neuron system using neuroimaging or TMS techniques, and behavioral experiments. Although the data acquire

  20. What do mirror neurons mirror?

    NARCIS (Netherlands)

    Uithol, S.; Rooij, I.J.E.I. van; Bekkering, H.; Haselager, W.F.G.

    2011-01-01

    Single cell recordings in monkeys provide strong evidence for an important role of the motor system in action understanding. This evidence is backed up by data from studies of the (human) mirror neuron system using neuroimaging or TMS techniques, and behavioral experiments. Although the data

  1. Analysis of Online Composite Mirror Descent Algorithm.

    Science.gov (United States)

    Lei, Yunwen; Zhou, Ding-Xuan

    2017-03-01

    We study the convergence of the online composite mirror descent algorithm, which involves a mirror map to reflect the geometry of the data and a convex objective function consisting of a loss and a regularizer possibly inducing sparsity. Our error analysis provides convergence rates in terms of properties of the strongly convex differentiable mirror map and the objective function. For a class of objective functions with Hölder continuous gradients, the convergence rates of the excess (regularized) risk under polynomially decaying step sizes have the order [Formula: see text] after [Formula: see text] iterates. Our results improve the existing error analysis for the online composite mirror descent algorithm by avoiding averaging and removing boundedness assumptions, and they sharpen the existing convergence rates of the last iterate for online gradient descent without any boundedness assumptions. Our methodology mainly depends on a novel error decomposition in terms of an excess Bregman distance, refined analysis of self-bounding properties of the objective function, and the resulting one-step progress bounds.

  2. DIFFERENTIABILITY OF CONVEX FUNCTIONS ON SUBLINEAR TOPOLOGICAL SPACES AND VARIATIONAL PRINCIPLES IN LOCALLY CONVEX SPACES

    Institute of Scientific and Technical Information of China (English)

    CHENG LIXIN; TENG YANMEI

    2005-01-01

    This paper presents a type of variational principles for real valued w* lower semicon tinuous functions on certain subsets in duals of locally convex spaces, and resolve a problem concerning differentiability of convex functions on general Banach spaces. They are done through discussing differentiability of convex functions on nonlinear topological spaces and convexification of nonconvex functions on topological linear spaces.

  3. A simple view on convex analysis and its applications

    NARCIS (Netherlands)

    J. Brinkhuis (Jan); V. Tikhomirov

    2005-01-01

    textabstractOur aim is to give a simple view on the basics and applications of convex analysis. The essential feature of this account is the systematic use of the possibility to associate to each convex object---such as a convex set, a convex function or a convex extremal problem--- a cone, without

  4. Entropy coherent and entropy convex measures of risk

    NARCIS (Netherlands)

    Laeven, R.J.A.; Stadje, M.

    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 measur

  5. Stable anisotropic plasma confinement in magnetic configurations with convex-concave field lines

    Science.gov (United States)

    Tsventoukh, M. M.

    2014-02-01

    It is shown that a combination of the convex and the concave part of a field line provides a strong stabilizing action against convective (flute-interchange) plasma instability (Tsventoukh 2011 Nucl. Fusion 51 112002). This results in internal peaking of the stable plasma pressure profile that is calculated from the collisionless kinetic stability criterion for any magnetic confinement system with combination of mirrors and cusps. Connection of the convex and concave field line parts results in a reduction of the space charge that drives the unstable E × B motion, as there is an opposite direction of the particle drift in a non-uniform field at convex and concave field lines. The pressure peaking arises at the minimum of the second adiabatic invariant J that takes place at the ‘middle’ of a tandem mirror-cusp transverse cross-section. The position of the minimum in J varies with the particle pitch angle that results in a shift of the peaking position depending on plasma anisotropy. This allows one to improve a stable peaked pressure profile at a convex-concave field by changing the plasma anisotropy over the trap cross-section. Examples of such anisotropic distribution functions are found that give an additional substantial enhancement in the maximal central pressure. Furthermore, the shape of new calculated stable profiles has a wide central plasma layer instead of a narrow peak.

  6. Mirror monochromator

    Energy Technology Data Exchange (ETDEWEB)

    Mankos, Marian [Electron Optica, Inc., Palo Alto, CA (United States); Shadman, Khashayar [Electron Optica, Inc., Palo Alto, CA (United States)

    2014-12-02

    In this SBIR project, Electron Optica, Inc. (EOI) is developing a mirror electron monochromator (MirrorChrom) attachment to new and retrofitted electron microscopes (EMs) for improving the energy resolution of the EM from the characteristic range of 0.2-0.5 eV to the range of 10-50 meV. This improvement will enhance the characterization of materials by imaging and spectroscopy. In particular, the monochromator will refine the energy spectra characterizing materials, as obtained from transmission EMs [TEMs] fitted with electron spectrometers, and it will increase the spatial resolution of the images of materials taken with scanning EMs (SEMs) operated at low voltages. EOI’s MirrorChrom technology utilizes a magnetic prism to simultaneously deflect the electron beam off the axis of the microscope column by 90° and disperse the electrons in proportional to their energies into a module with an electron mirror and a knife-edge. The knife-edge cuts off the tails of the energy distribution to reduce the energy spread of the electrons that are reflected, and subsequently deflected, back into the microscope column. The knife-edge is less prone to contamination, and thereby charging, than the conventional slits used in existing monochromators, which improves the reliability and stability of the module. The overall design of the MirrorChrom exploits the symmetry inherent in reversing the electron trajectory in order to maintain the beam brightness – a parameter that impacts how well the electron beam can be focused downstream onto a sample. During phase I, EOI drafted a set of candidate monochromator architectures and evaluated the trade-offs between energy resolution and beam current to achieve the optimum design for three particular applications with market potential: increasing the spatial resolution of low voltage SEMs, increasing the energy resolution of low voltage TEMs (beam energy of 5-20 keV), and increasing the energy resolution of conventional TEMs (beam

  7. Mirror systems

    Energy Technology Data Exchange (ETDEWEB)

    Howells, M.R.

    1985-12-01

    The physics of VUV and x-ray reflection is reviewed. The main functions of mirrors in synchrotron beamlines are stated briefly and include deflection, filtration, power absorption, formation of a real image of the source, focusing, and collimation. Methods of fabrication of optical surfaces are described. Types of imperfections are discussed, including, aberrations, surface figure inaccuracy, roughness, and degradation due to use. Calculation of the photon beam thermal load, including computer modelling, is considered. 50 refs., 7 figs. (LEW)

  8. Efficient Line Searching for Convex Functions

    NARCIS (Netherlands)

    den Boef, E.; den Hertog, D.

    2004-01-01

    In this paper we propose two new line search methods for convex functions. These new methods exploit the convexity property of the function, contrary to existing methods.The worst method is an improved version of the golden section method.For the second method it is proven that after two evaluations

  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 re

  10. Stochastic Dominance: Convexity and Some Efficiency Tests

    NARCIS (Netherlands)

    A.M. Lizyayev (Andrey)

    2009-01-01

    textabstractThis paper points out the importance of Stochastic Dominance (SD) efficient sets being convex. We review classic convexity and efficient set characterization results on SD efficiency of a given portfolio relative to a diversified set of assets and generalize them in the following

  11. 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 ...

  12. Polar DuaLs of Convex Bodies

    Science.gov (United States)

    1990-01-01

    to Convex Bodies, Geometriae Dedicata 2" (1973) 225-248. 10. H. Guggenheimer, "The Analytic Geometry of the Unsymmetric Minkowski Plane," Lecture...Mathematics, Vol. 58, No. 2, 1975. 19. E. Lutwak, "On Cross-Sectional Measures of Polar Reciprocal Convex Bodies," Geometriae Dedicata 5, (1976) 79-80

  13. 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 divide...

  14. The Band around a Convex Body

    Science.gov (United States)

    Swanson, David

    2011-01-01

    We give elementary proofs of formulas for the area and perimeter of a planar convex body surrounded by a band of uniform thickness. The primary tool is a integral formula for the perimeter of a convex body which describes the perimeter in terms of the projections of the body onto lines in the plane.

  15. Strictly convex functions on complete Finsler manifolds

    Indian Academy of Sciences (India)

    YOE ITOKAWA; KATSUHIRO SHIOHAMA; BANKTESHWAR TIWARI

    2016-10-01

    The purpose of the present paper is to investigate the influence of strictly convex functions on the metric structures of complete Finsler manifolds. More precisely we discuss the properties of the group of isometries and the exponential maps on a complete Finsler manifold admitting strictly convex functions.

  16. Toric geometry of convex quadrilaterals

    CERN Document Server

    Legendre, Eveline

    2009-01-01

    We provide an explicit resolution of the Abreu equation on convex labeled quadrilaterals. This confirms a conjecture of Donaldson in this particular case and implies a complete classification of the explicit toric K\\"ahler-Einstein and toric Sasaki-Einstein metrics constructed in [6,23,14]. As a byproduct, we obtain a wealth of extremal toric (complex) orbi-surfaces, including K\\"ahler-Einstein ones, and show that for a toric orbi-surface with 4 fixed points of the torus action, the vanishing of the Futaki invariant is a necessary and sufficient condition for the existence of K\\"ahler metric with constant scalar curvature. Our results also provide explicit examples of relative K-unstable toric orbi-surfaces that do not admit extremal metrics.

  17. 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;

  18. Reconstruction of convex bodies from surface tensors

    DEFF Research Database (Denmark)

    Kousholt, Astrid; Kiderlen, Markus

    The set of all surface tensors of a convex body K (Minkowski tensors derived from the surface area measure of K) determine K up to translation, and hereby, the surface tensors of K contain all information on the shape of K. Here, shape means the equivalence class of all convex bodies...... 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....... 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...

  19. Convex functions, monotone operators and differentiability

    CERN Document Server

    Phelps, Robert R

    1993-01-01

    The improved and expanded second edition contains expositions of some major results which have been obtained in the years since the 1st edition. Theaffirmative answer by Preiss of the decades old question of whether a Banachspace with an equivalent Gateaux differentiable norm is a weak Asplund space. The startlingly simple proof by Simons of Rockafellar's fundamental maximal monotonicity theorem for subdifferentials of convex functions. The exciting new version of the useful Borwein-Preiss smooth variational principle due to Godefroy, Deville and Zizler. The material is accessible to students who have had a course in Functional Analysis; indeed, the first edition has been used in numerous graduate seminars. Starting with convex functions on the line, it leads to interconnected topics in convexity, differentiability and subdifferentiability of convex functions in Banach spaces, generic continuity of monotone operators, geometry of Banach spaces and the Radon-Nikodym property, convex analysis, variational princ...

  20. A Note on Upper Convex Density

    Institute of Scientific and Technical Information of China (English)

    YIN JIAN-DONG; ZHOU ZUO-LING

    2010-01-01

    For a self-similar set E satisfying the open set condition,upper convex density is an important concept for the computation of its Hausdorff measure,and it is well known that the set of relative interior points with upper convex density 1has a full Hausdorff measure.But whether the upper convex densities of E at all the relative interior points are equal to 1? In other words,whether there exists a relative interior point of E such that the upper convex density of E at this point is less than 1?In this paper,the authors construct a self-similar set satisfying the open set condition,which has a relative interior point with upper convex density less than 1.Thereby,the above problem is sufficiently answered.

  1. 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...

  2. A plasticity principle of convex quadrilaterals on a complete convex surface of bounded specific curvature

    CERN Document Server

    Zachos, Anastasios

    2010-01-01

    We obtain the plasticity equations for convex quadrilaterals on a complete convex surface with bounded specific curvature and derive a plasticity principle which states that: Given four shortest arcs which meet at the weighted Fermat-Torricelli point P_F and their endpoints form a convex quadrilateral, an increase of the weight that corresponds to a shortest arc causes a decrease to the two weights that correspond to the two neighboring shortest arcs and an increase to the weight that corresponds to the opposite shortest arc. We show a connection between the plasticity of convex quadrilaterals on a complete convex surface with bounded specific curvature with the plasticity of generalized convex quadrilaterals on a manifold which is composed by triangles located on a complete convex surface of bounded specific curvature and triangles located on a two dimensional sphere whose constant Gaussian curvature equals to the infimum or supremum of the specific curvature. Furthermore, we give some cases of geometrizatio...

  3. Non-planar driver's side rearview mirrors: A survey of mirror types and european driver experience and a driver behavior study on the influence of experience and driver age on gap acceptance and vehicle detection (final report)

    NARCIS (Netherlands)

    Vos, A.P. de

    2000-01-01

    Some European drivers have been using different types of convex, driver-side rear-view mirrors which provide a wider field-of-view than flat mirrors, but produce a minified image. With a minified image, some drivers may have difficulty judging distances and approach speeds. To assess the potential b

  4. Quasi-convex Functions in Carnot Groups

    Institute of Scientific and Technical Information of China (English)

    Mingbao SUN; Xiaoping YANG

    2007-01-01

    In this paper, the authors introduce the concept of h-quasiconvex functions on Carnot groups G. It is shown that the notions of h-quasiconvex functions and h-convex sets are equivalent and the L∞ estimates of first derivatives of h-quasiconvex functions are given. For a Carnot group G of step two, it is proved that h-quasiconvex functions are locally bounded from above. Furthermore, the authors obtain that h-convex functions are locally Lipschitz continuous and that an h-convex function is twice differentiable almost everywhere.

  5. On the vertex index of convex bodies

    CERN Document Server

    Bezdek, Karoly

    2011-01-01

    We introduce the vertex index, vein(K), of a given centrally symmetric convex body K, which, in a sense, measures how well K can be inscribed into a convex polytope with small number of vertices. This index is closely connected to the illumination parameter of a body, introduced earlier by the first named author, and, thus, related to the famous conjecture in Convex Geometry about covering of a d-dimensional body by 2^d smaller positively homothetic copies. We provide asymptotically sharp estimates (up to a logarithmic term) of this index in the general case. Also, we provide sharp estimates in dimensions 2 and 3.

  6. Lightweight Metal Mirrors

    Science.gov (United States)

    Gossett, E.; Winslow, P.

    1984-01-01

    Two "eggcrate" halves brazed together. Lightweight flat mirrors fabricated by machining pockets in two plates of beryllium and brazing machined halves together. Mirror less than half weight of same mirror made by previous design.

  7. Improved Mirror Source Method in Roomacoustics

    Science.gov (United States)

    Mechel, F. P.

    2002-10-01

    Most authors in room acoustics qualify the mirror source method (MS-method) as the only exact method to evaluate sound fields in auditoria. But evidently nobody applies it. The reason for this discrepancy is the abundantly high numbers of needed mirror sources which are reported in the literature, although such estimations of needed numbers of mirror sources mostly are used for the justification of more or less heuristic modifications of the MS-method. The present, intentionally tutorial article accentuates the analytical foundations of the MS-method whereby the number of needed mirror sources is reduced already. Further, the task of field evaluation in three-dimensional spaces is reduced to a sequence of tasks in two-dimensional room edges. This not only allows the use of easier geometrical computations in two dimensions, but also the sound field in corner areas can be represented by a single (directional) source sitting on the corner line, so that only this "corner source" must be mirror-reflected in the further process. This procedure gives a drastic reduction of the number of needed equivalent sources. Finally, the traditional MS-method is not applicable in rooms with convex corners (the angle between the corner flanks, measured on the room side, exceeds 180°). In such cases, the MS-method is combined below with the second principle of superposition(PSP). It reduces the scattering task at convex corners to two sub-tasks between one flank and the median plane of the room wedge, i.e., always in concave corner areas where the MS-method can be applied.

  8. Noah, Joseph and Convex Hulls

    Science.gov (United States)

    Watkins, N. W.; Chau, Y.; Chapman, S. C.

    2010-12-01

    The idea of describing animal movement by mathematical models based on diffusion and Brownian motion has a long heritage. It has thus been natural to account for those aspects of motion that depart from the Brownian by the use of models incorporating long memory & subdiffusion (“the Joseph effect”) and/or heavy tails & superdiffusion (“the Noah effect”). My own interest in this problem was originally from a geoscience perspective, and was triggered by the need to model time series in space physics where both effects coincide. Subsequently I have been involved in animal foraging studies [e.g. Edwards et al, Nature, 2007]. I will describe some recent work [Watkins et al, PRE, 2009] which studies how fixed-timestep and variable-timestep formulations of anomalous diffusion are related in the presence of heavy tails and long range memory (stable processes versus the CTRW). Quantities for which different scaling relations are predicted between the two approaches are of particular interest, to aid testability. I will also present some of work in progress on the convex hull of anomalously diffusing walkers, inspired by its possible relevance to the idea of home range in biology, and by Randon-Furling et al’s recent analytical results in the Brownian case [PRL, 2009].

  9. Revising incompletely specified convex probabilistic belief bases

    CSIR Research Space (South Africa)

    Rens, G

    2016-04-01

    Full Text Available International Workshop on Non-Monotonic Reasoning (NMR), 22-24 April 2016, Cape Town, South Africa Revising Incompletely Specified Convex Probabilistic Belief Bases Gavin Rens CAIR_, University of KwaZulu-Natal, School of Mathematics, Statistics...

  10. Relations between Lipschitz functions and convex functions

    Institute of Scientific and Technical Information of China (English)

    RUAN Yingbin

    2005-01-01

    We discuss the relationship between Lipschitz functions and convex functions.By these relations, we give a sufficient condition for the set of points where Lipschitz functions on a Hilbert space is Frechet differentiable to be residual.

  11. Some integral inequalities for logarithmically convex functions

    Directory of Open Access Journals (Sweden)

    Mevlüt Tunç

    2014-07-01

    Full Text Available The main aim of the present note is to establish new Hadamard like integral inequalities involving log-convex function. We also prove some Hadamard-type inequalities, and applications to the special means are given.

  12. Convex analysis and optimization in Hadamard spaces

    CERN Document Server

    Bacak, Miroslav

    2014-01-01

    This book gives a first systematic account on the subject of convex analysis and optimization in Hadamard spaces. It is primarily aimed at both graduate students and researchers in analysis and optimization.

  13. Double arch mirror study

    Science.gov (United States)

    Vukobratovich, D.; Hillman, D.

    1983-01-01

    The development of a method of mounting light weight glass mirrors for astronomical telescopes compatible with the goals of the Shuttle Infrared Telescope Facility (SIRTF) was investigated. A 20 in. diameter double arch lightweight mirror previously fabricated was modified to use a new mount configuration. This mount concept was developed and fabricated. The mounting concept of the double mounting mirror is outlined. The modifications made to the mirror, fabrication of the mirror mount, and room temperature testing of the mirror and mount and the extension of the mirror and mount concept to a full size (40 in. diameter) primary mirror for SIRTF are discussed.

  14. Linearization functors on real convex sets

    OpenAIRE

    Velasco, Mauricio

    2012-01-01

    We prove that linearizing certain families of polynomial optimization problems leads to new functorial operations in real convex sets. We show that under some conditions these operations can be computed or approximated in ways amenable to efficient computation. These operations are convex analogues of Hom functors, tensor products, symmetric powers, exterior powers and general Schur functors on vector spaces and lead to novel constructions even for polyhedra.

  15. Deformation in locally convex topological linear spaces

    Institute of Scientific and Technical Information of China (English)

    DING; Yanheng

    2004-01-01

    We are concerned with a deformation theory in locally convex topological linear spaces. A special "nice" partition of unity is given. This enables us to construct certain vector fields which are locally Lipschitz continuous with respect to the locally convex topology. The existence, uniqueness and continuous dependence of flows associated to the vector fields are established. Deformations related to strongly indefinite functionals are then obtained. Finally, as applications, we prove some abstract critical point theorems.

  16. The convexity radius of a Riemannian manifold

    OpenAIRE

    Dibble, James

    2014-01-01

    The ratio of convexity radius over injectivity radius may be made arbitrarily small within the class of compact Riemannian manifolds of any fixed dimension at least two. This is proved using Gulliver's method of constructing manifolds with focal points but no conjugate points. The approach is suggested by a characterization of the convexity radius that resembles a classical result of Klingenberg about the injectivity radius.

  17. Convexity conditions and normal structure of Banach spaces

    Science.gov (United States)

    Saejung, Satit

    2008-08-01

    We prove that F-convexity, the property dual to P-convexity of Kottman, implies uniform normal structure. Moreover, in the presence of the WORTH property, normal structure follows from a weaker convexity condition than F-convexity. The latter result improves the known fact that every uniformly nonsquare space with the WORTH property has normal structure.

  18. Entropy Coherent and Entropy Convex Measures of Risk

    NARCIS (Netherlands)

    Laeven, R.J.A.; Stadje, M.A.

    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, respe

  19. A further characteristic of abstract convexity structures on topological spaces

    Science.gov (United States)

    Xiang, Shu-Wen; Xia, Shunyou

    2007-11-01

    In this paper, we give a characteristic of abstract convexity structures on topological spaces with selection property. We show that if a convexity structure defined on a topological space has the weak selection property then satisfies H0-condition. Moreover, in a compact convex subset of a topological space with convexity structure, the weak selection property implies the fixed point property.

  20. Exact and Approximate Sizes of Convex Datacubes

    Science.gov (United States)

    Nedjar, Sébastien

    In various approaches, data cubes are pre-computed in order to efficiently answer Olap queries. The notion of data cube has been explored in various ways: iceberg cubes, range cubes, differential cubes or emerging cubes. Previously, we have introduced the concept of convex cube which generalizes all the quoted variants of cubes. More precisely, the convex cube captures all the tuples satisfying a monotone and/or antimonotone constraint combination. This paper is dedicated to a study of the convex cube size. Actually, knowing the size of such a cube even before computing it has various advantages. First of all, free space can be saved for its storage and the data warehouse administration can be improved. However the main interest of this size knowledge is to choose at best the constraints to apply in order to get a workable result. For an aided calibrating of constraints, we propose a sound characterization, based on inclusion-exclusion principle, of the exact size of convex cube as long as an upper bound which can be very quickly yielded. Moreover we adapt the nearly optimal algorithm HyperLogLog in order to provide a very good approximation of the exact size of convex cubes. Our analytical results are confirmed by experiments: the approximated size of convex cubes is really close to their exact size and can be computed quasi immediately.

  1. Optimal convex shapes for concave functionals

    CERN Document Server

    Bucur, Dorin; Lamboley, Jimmy

    2011-01-01

    Motivated by a long-standing conjecture of Polya and Szeg\\"o about the Newtonian capacity of convex bodies, we discuss the role of concavity inequalities in shape optimization, and we provide several counterexamples to the Blaschke-concavity of variational functionals, including capacity. We then introduce a new algebraic structure on convex bodies, which allows to obtain global concavity and indecomposability results, and we discuss their application to isoperimetriclike inequalities. As a byproduct of this approach we also obtain a quantitative version of the Kneser-S\\"uss inequality. Finally, for a large class of functionals involving Dirichlet energies and the surface measure, we perform a local analysis of strictly convex portions of the boundary via second order shape derivatives. This allows in particular to exclude the presence of smooth regions with positive Gauss curvature in an optimal shape for Polya-Szeg\\"o problem.

  2. On the convexity of Relativistic Ideal Magnetohydrodynamics

    CERN Document Server

    Ibáñez, José-María; Aloy, Miguel-Ángel; Martí, José-María; Miralles, Juan-Antonio

    2015-01-01

    We analyze the influence of the magnetic field in the convexity properties of the relativistic magnetohydrodynamics system of equations. To this purpose we use the approach of Lax, based on the analysis of the linearly degenerate/genuinely non-linear nature of the characteristic fields. Degenerate and non-degenerate states are discussed separately and the non-relativistic, unmagnetized limits are properly recovered. The characteristic fields corresponding to the material and Alfv\\'en waves are linearly degenerate and, then, not affected by the convexity issue. The analysis of the characteristic fields associated with the magnetosonic waves reveals, however, a dependence of the convexity condition on the magnetic field. The result is expressed in the form of a generalized fundamental derivative written as the sum of two terms. The first one is the generalized fundamental derivative in the case of purely hydrodynamical (relativistic) flow. The second one contains the effects of the magnetic field. The analysis ...

  3. 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.

  4. Cost Allocation and Convex Data Envelopment

    DEFF Research Database (Denmark)

    Hougaard, Jens Leth; Tind, Jørgen

    This paper considers allocation rules. First, we demonstrate that costs allocated by the Aumann-Shapley and the Friedman-Moulin cost allocation rules are easy to determine in practice using convex envelopment of registered cost data and parametric programming. Second, from the linear programming...... 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...... problems involved it becomes clear that the allocation rules, technically speaking, allocate the non-zero value of the dual variable for a convexity constraint on to the output vector. Hence, the allocation rules can also be used to allocate inefficiencies in non-parametric efficiency measurement models...

  5. 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...

  6. Non-convex onion peeling using a shape hull algorithm

    OpenAIRE

    Fadili, Jalal M.; Melkemi, Mahmoud; Elmoataz, Abderrahim

    2004-01-01

    International audience; The convex onion-peeling of a set of points is the organization of these points into a sequence of interpolating convex polygons. This method is adequate to detect the shape of the “center” of a set of points when this shape is convex. However it reveals inadequate to detect non-convex shapes. Alternatively, we propose an extension of the convex onion-peeling method. It consists in representing a set of points with a sequence of non-convex polylines which are computed ...

  7. Uniform convexity and the splitting problem for selections

    CERN Document Server

    Balashov, Maxim V; 10.1016/j.jmaa.2009.06.045

    2009-01-01

    We continue to investigate cases when the Repov\\v{s}-Semenov splitting problem for selections has an affirmative solution for continuous set-valued mappings. We consider the situation in infinite-dimensional uniformly convex Banach spaces. We use the notion of Polyak of uniform convexity and modulus of uniform convexity for arbitrary convex sets (not necessary balls). We study general geometric properties of uniformly convex sets. We also obtain an affirmative solution of the splitting problem for selections of certain set-valued mappings with uniformly convex images.

  8. 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...

  9. 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...

  10. Cost Allocation and Convex Data Envelopment

    DEFF Research Database (Denmark)

    Hougaard, Jens Leth; Tind, Jørgen

    problems involved it becomes clear that the allocation rules, technically speaking, allocate the non-zero value of the dual variable for a convexity constraint on to the output vector. Hence, the allocation rules can also be used to allocate inefficiencies in non-parametric efficiency measurement models...... 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...

  11. Convex functions and the rolling circle criterion

    OpenAIRE

    1995-01-01

    Given 0≤R1≤R2≤∞, CVG(R1,R2) denotes the class of normalized convex functions f in the unit disc U, for which ∂f(U) satisfies a Blaschke Rolling Circles Criterion with radii R1 and R2. Necessary and sufficient conditions for R1=R2, growth and distortion theorems for CVG(R1,R2) and rotation theorem for the class of convex functions of bounded type, are found.

  12. A Complete Characterization of the Gap between Convexity and SOS-Convexity

    CERN Document Server

    Ahmadi, Amir Ali

    2011-01-01

    Our first contribution in this paper is to prove that three natural sum of squares (sos) based sufficient conditions for convexity of polynomials via the definition of convexity, its first order characterization, and its second order characterization are equivalent. These three equivalent algebraic conditions, henceforth referred to as sos-convexity, can be checked by semidefinite programming whereas deciding convexity is NP-hard. If we denote the set of convex and sos-convex polynomials in $n$ variables of degree $d$ with $\\tilde{C}_{n,d}$ and $\\tilde{\\Sigma C}_{n,d}$ respectively, then our main contribution is to prove that $\\tilde{C}_{n,d}=\\tilde{\\Sigma C}_{n,d}$ if and only if $n=1$ or $d=2$ or $(n,d)=(2,4)$. We also present a complete characterization for forms (homogeneous polynomials) except for the case $(n,d)=(3,4)$ which is joint work with G. Blekherman and is to be published elsewhere. Our result states that the set $C_{n,d}$ of convex forms in $n$ variables of degree $d$ equals the set $\\Sigma C_{...

  13. 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

  14. Tropicalized Lambda Lengths, Measured Laminations and Convexity

    DEFF Research Database (Denmark)

    C. Penner, R.

    cell decomposition of a surface is discovered in the limit. Finally, the tropical analogue of the convex hull construction in Minkowski space is formulated as an explicit algorithm that serially simplifies a triangulation with respect to a fixed lamination and has its own independent applications....

  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

    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.

  17. Robust Utility Maximization Under Convex Portfolio Constraints

    Energy Technology Data Exchange (ETDEWEB)

    Matoussi, Anis, E-mail: anis.matoussi@univ-lemans.fr [Université du Maine, Risk and Insurance institut of Le Mans Laboratoire Manceau de Mathématiques (France); Mezghani, Hanen, E-mail: hanen.mezghani@lamsin.rnu.tn; Mnif, Mohamed, E-mail: mohamed.mnif@enit.rnu.tn [University of Tunis El Manar, Laboratoire de Modélisation Mathématique et Numérique dans les Sciences de l’Ingénieur, ENIT (Tunisia)

    2015-04-15

    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.

  18. 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...

  19. On fixed points and uniformly convex spaces

    OpenAIRE

    Gelander, Tsachik

    2008-01-01

    The purpose of this note is to present two elementary, but useful, facts concerning actions on uniformly convex spaces. We demonstrate how each of them can be used in an alternative proof of the triviality of the first $L_p$-cohomology of higher rank simple Lie groups, proved in [BFGM].

  20. 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...

  1. 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.

  2. 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...

  3. Estimates for oscillatory integrals with convex phase

    Energy Technology Data Exchange (ETDEWEB)

    Chakhkiev, M A [Moscow State Social University, Moscow (Russian Federation)

    2006-02-28

    We consider methods for estimating one-dimensional oscillatory integrals with convex phase and amplitudes of bounded variation or Lipschitz class amplitudes. In particular, we improve the estimate for the Piercey integral with near-caustic parameter values, and also consider estimation methods for n-dimensional oscillatory integrals.

  4. 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.

  5. 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

  6. Convex bodies of states and maps

    Science.gov (United States)

    Grabowski, Janusz; Ibort, Alberto; Kuś, Marek; Marmo, Giuseppe

    2013-10-01

    We give a general solution to the question of when the convex hulls of orbits of quantum states on a finite-dimensional Hilbert space under unitary actions of a compact group have a non-empty interior in the surrounding space of all density operators. The same approach can be applied to study convex combinations of quantum channels. The importance of both problems stems from the fact that, usually, only sets with non-vanishing volumes in the embedding spaces of all states or channels are of practical importance. For the group of local transformations on a bipartite system we characterize maximally entangled states by the properties of a convex hull of orbits through them. We also compare two partial characteristics of convex bodies in terms of the largest balls and maximum volume ellipsoids contained in them and show that, in general, they do not coincide. Separable states, mixed-unitary channels and k-entangled states are also considered as examples of our techniques.

  7. 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...

  8. Subset Selection by Local Convex Approximation

    DEFF Research Database (Denmark)

    Øjelund, Henrik; Sadegh, Payman; Madsen, Henrik

    1999-01-01

    least squares criterion. We propose an optimization technique for the posed probelm based on a modified version of the Newton-Raphson iterations, combined with a backward elimination type algorithm. THe Newton-Raphson modification concerns iterative approximations to the non-convex cost function...

  9. 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...

  10. Mirror Neurons and Mirror-Touch Synesthesia.

    Science.gov (United States)

    Linkovski, Omer; Katzin, Naama; Salti, Moti

    2016-05-30

    Since mirror neurons were introduced to the neuroscientific community more than 20 years ago, they have become an elegant and intuitive account for different cognitive mechanisms (e.g., empathy, goal understanding) and conditions (e.g., autism spectrum disorders). Recently, mirror neurons were suggested to be the mechanism underlying a specific type of synesthesia. Mirror-touch synesthesia is a phenomenon in which individuals experience somatosensory sensations when seeing someone else being touched. Appealing as it is, careful delineation is required when applying this mechanism. Using the mirror-touch synesthesia case, we put forward theoretical and methodological issues that should be addressed before relying on the mirror-neurons account. © The Author(s) 2016.

  11. Durable solar mirror films

    Energy Technology Data Exchange (ETDEWEB)

    O' Neill, Mark B.; Henderson, Andrew J.; Hebrink, Timothy J.; Katare, Rajesh K.; Jing, Naiyong; North, Diane; Peterson, Eric M.

    2017-02-14

    The present disclosure generally relates to durable solar mirror films, methods of making durable solar mirror films, and constructions including durable solar mirror films. In one embodiment, the present disclosure relates to a solar mirror film comprising: a multilayer optical film layer including having a coefficient of hygroscopic expansion of less than about 30 ppm per percent relative humidity; and a reflective layer having a coefficient of hygroscopic expansion.

  12. Relations between Lipschitz functions and convex functions

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

    [1]Zajicek, J., On the differentation of convex functions in finite and infinite dimensional spaces, Czech J. Math.,1979, 29: 340-348.[2]Hu, T. C., Klee, V. L., Larman, D. G., Optimization of globally convex functions, SIAM J. Control Optim., 1989,27: 1026-1047.[3]Cepedello Boiso, M., Approximation of Lipschitz functions by △-convex functions in Banach spaces, Israel J.Math., 1998, 106: 269-284.[4]Asplund, E., Frechet differentiability of convex functions, Acta Math., 1968, 121: 31-47.[5]Johnson, J. A., Lipschitz spaces, Pacific J. Math, 1974, 51: 177-186.[6]Stromberg, T., The operation of infimal convolution, Dissert. Math., (Rozprawy Mat.), 1996, 325: 58.[7]Kadison, R. V., Ringrose, J. R., Fundamentals of the theory of operator algebras, volume Ⅰ: Elementary Theory,Graduate Studies in Math., vol. 15, Amer. Math. Soc., 1997.[8]Phelps, R. R., Convex functions,monotone operators and differentiability, Lect. Notes in Math., vol. 1364,Springer-Verlag, 1977.[9]Lindenstrauss, J., On operators which attain their norm, Israel J. Math., 1963, 1: 139-148.[10]Press, D., Gateaux differentiable functions are somewhere Frechet differentiable, Rend. Circ. Mat. Palermo,1984, 33: 122-133.[11]Press, D., Differentiability of Lipschitz functions on Banach spaces, J. Funct. Anal., 1990, 91:312-345.[12]Lindenstrauss, J., Press, D., On Frechet differentiability of Lipschitz maps between Banach spaces, Annals of Math., 2003, 157: 257-288.[13]Press, D., Gateaux differentiable Lipschitz functions need not be Frechet differentiable on a residual set, Supplemento Rend. Circ. Mat. Palermo, Serie Ⅱ, 1982, 2: 217-222.

  13. 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.

  14. On the convexity of N-Chebyshev sets

    Science.gov (United States)

    Borodin, Petr A.

    2011-10-01

    We define N-Chebyshev sets in a Banach space X for every positive integer N (when N=1, these are ordinary Chebyshev sets) and study conditions that guarantee their convexity. In particular, we prove that all N-Chebyshev sets are convex when N is even and X is uniformly convex or N\\ge 3 is odd and X is smooth uniformly convex.

  15. The Identification of Convex Function on Riemannian Manifold

    Directory of Open Access Journals (Sweden)

    Li Zou

    2014-01-01

    Full Text Available The necessary and sufficient condition of convex function is significant in nonlinear convex programming. This paper presents the identification of convex function on Riemannian manifold by use of Penot generalized directional derivative and the Clarke generalized gradient. This paper also presents a method for judging whether a point is the global minimum point in the inequality constraints. Our objective here is to extend the content and proof the necessary and sufficient condition of convex function to Riemannian manifolds.

  16. ON THE PRODUCT OF GATEAUX DIFFERENTIABILITY LOCALLY CONVEX SPACES

    Institute of Scientific and Technical Information of China (English)

    Shen Xisheng; Cheng Lixin

    2005-01-01

    A locally convex space is said to be a Gateaux differentiability space (GDS)provided every continuous convex function defined on a nonempty convex open subset D of the space is densely Gateaux differentiable in D.This paper shows that the product of a GDS and a family of separable Frechet spaces is a GDS,and that the product of a GDS and an arbitrary locally convex space endowed with the weak topology is a GDS.

  17. The Mirror Oscilloscpoe

    NARCIS (Netherlands)

    Goudriaan, B.

    2003-01-01

    This project is about designing and realizing an oscilloscope based on a laser beam reflected by two mirrors. The ¿Mirror Oscilloscope¿ uses two voice-coils actuators with mounted mirrors to reflect laser light, such that an image of a harmonic signal is projected on a projection screen. For trackin

  18. Allometric relationships between traveltime channel networks, convex hulls, and convexity measures

    Science.gov (United States)

    Tay, Lea Tien; Sagar, B. S. Daya; Chuah, Hean Teik

    2006-06-01

    The channel network (S) is a nonconvex set, while its basin [C(S)] is convex. We remove open-end points of the channel connectivity network iteratively to generate a traveltime sequence of networks (Sn). The convex hulls of these traveltime networks provide an interesting topological quantity, which has not been noted thus far. We compute lengths of shrinking traveltime networks L(Sn) and areas of corresponding convex hulls C(Sn), the ratios of which provide convexity measures CM(Sn) of traveltime networks. A statistically significant scaling relationship is found for a model network in the form L(Sn) ˜ A[C(Sn)]0.57. From the plots of the lengths of these traveltime networks and the areas of their corresponding convex hulls as functions of convexity measures, new power law relations are derived. Such relations for a model network are CM(Sn) ˜ ? and CM(Sn) ˜ ?. In addition to the model study, these relations for networks derived from seven subbasins of Cameron Highlands region of Peninsular Malaysia are provided. Further studies are needed on a large number of channel networks of distinct sizes and topologies to understand the relationships of these new exponents with other scaling exponents that define the scaling structure of river networks.

  19. Reverse convex problems: an approach based on optimality conditions

    Directory of Open Access Journals (Sweden)

    Ider Tseveendorj

    2006-01-01

    Full Text Available We present some results concerning reverse convex problems. Global optimality conditions for the problems with a nonsmooth reverse convex constraint are established and convergence of an algorithm in the case of linear program with an additional quadratic reverse convex constraint is studied.

  20. On Quasi E-Convex Bilevel Programming Problem

    Directory of Open Access Journals (Sweden)

    E. A. Youness

    2005-01-01

    Full Text Available Bilevel programming problems involve two optimization problems where the data of the first one is implicity determined by the solution of the second. This study introduces the notions of E-convexity and quasi E-convexity in bilevel programming problems to generalize quasi convex bilevel programming problems.

  1. Reverse convex problems: an approach based on optimality conditions

    OpenAIRE

    Ider Tseveendorj

    2006-01-01

    We present some results concerning reverse convex problems. Global optimality conditions for the problems with a nonsmooth reverse convex constraint are established and convergence of an algorithm in the case of linear program with an additional quadratic reverse convex constraint is studied.

  2. Water Cooled Mirror Design

    Energy Technology Data Exchange (ETDEWEB)

    Dale, Gregory E. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Holloway, Michael Andrew [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Pulliam, Elias Noel [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

    2015-03-30

    This design is intended to replace the current mirror setup being used for the NorthStar Moly 99 project in order to monitor the target coupon. The existing setup has limited movement for camera alignment and is difficult to align properly. This proposed conceptual design for a water cooled mirror will allow for greater thermal transfer between the mirror and the water block. It will also improve positioning of the mirror by using flexible vacuum hosing and a ball head joint capable of a wide range of motion. Incorporating this design into the target monitoring system will provide more efficient cooling of the mirror which will improve the amount of diffraction caused by the heating of the mirror. The process of aligning the mirror for accurate position will be greatly improved by increasing the range of motion by offering six degrees of freedom.

  3. A Generalization of Uniformly Extremely Convex Banach Spaces

    OpenAIRE

    Suyalatu Wulede; Wurichaihu Bai; Wurina Bao

    2016-01-01

    We discuss a new class of Banach spaces which are the generalization of uniformly extremely convex spaces introduced by Wulede and Ha. We prove that the new class of Banach spaces lies strictly between either the classes of k-uniformly rotund spaces and k-strongly convex spaces or classes of fully k-convex spaces and k-strongly convex spaces and has no inclusive relation with the class of locally k-uniformly convex spaces. We obtain in addition some characterizations and properties of this ne...

  4. Coalescence between two convex liquid surfaces

    Science.gov (United States)

    Yang, Fan; Jian, Zhen; Li, Erqiang; Thoroddsen, S. T.

    2015-11-01

    We study the coalescence of two convex surfaces of the same liquid. One of the convex free surfaces is formed at a circular opening of a closed tank by imposing a negative pressure difference. The other surface is a droplet of larger curvature, which is pendant from a concentric nozzle. The coalescence starts from near-zero velocity, so the configuration can be characterized by two dimensionless numbers: the Ohnesorge number Oh = μ /√{ ργL } and the radius ratio between the two surfaces α =rd /rs . We use high-speed video, PIV and numerical simulations, using the Gerris program, to study the dynamics of the coalescence. Our focus is on the interface shapes, the growth-rate of the neck connecting the two surfaces and the formation of a vortex ring. The growth-rate is compared to earlier models for the coalescence of drops or bubbles.

  5. Convex Modeling of Interactions with Strong Heredity

    Science.gov (United States)

    Haris, Asad; Witten, Daniela; Simon, Noah

    2015-01-01

    We consider the task of fitting a regression model involving interactions among a potentially large set of covariates, in which we wish to enforce strong heredity. We propose FAMILY, a very general framework for this task. Our proposal is a generalization of several existing methods, such as VANISH [Radchenko and James, 2010], hierNet [Bien et al., 2013], the all-pairs lasso, and the lasso using only main effects. It can be formulated as the solution to a convex optimization problem, which we solve using an efficient alternating directions method of multipliers (ADMM) algorithm. This algorithm has guaranteed convergence to the global optimum, can be easily specialized to any convex penalty function of interest, and allows for a straightforward extension to the setting of generalized linear models. We derive an unbiased estimator of the degrees of freedom of FAMILY, and explore its performance in a simulation study and on an HIV sequence data set. PMID:28316461

  6. Convex Arrhenius plots and their interpretation

    Science.gov (United States)

    Truhlar, Donald G.; Kohen, Amnon

    2001-01-01

    This paper draws attention to selected experiments on enzyme-catalyzed reactions that show convex Arrhenius plots, which are very rare, and points out that Tolman's interpretation of the activation energy places a fundamental model-independent constraint on any detailed explanation of these reactions. The analysis presented here shows that in such systems, the rate coefficient as a function of energy is not just increasing more slowly than expected, it is actually decreasing. This interpretation of the data provides a constraint on proposed microscopic models, i.e., it requires that any successful model of a reaction with a convex Arrhenius plot should be consistent with the microcanonical rate coefficient being a decreasing function of energy. The implications and limitations of this analysis to interpreting enzyme mechanisms are discussed. This model-independent conclusion has broad applicability to all fields of kinetics, and we also draw attention to an analogy with diffusion in metastable fluids and glasses. PMID:11158559

  7. On the convexity of Relativistic Hydrodynamics

    CERN Document Server

    Ibáñez, José María; Martí, José María; Miralles, Juan Antonio; 10.1088/0264-9381/30/5/057002

    2013-01-01

    The relativistic hydrodynamic system of equations for a perfect fluid obeying a causal equation of state is hyperbolic (Anile 1989 {\\it 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 Plohr 1989 {\\it Rev. Mod. Phys.} {\\bf 61} 75). The classical limit is recovered.

  8. Coefficient inequalities for starlikeness and convexity

    Directory of Open Access Journals (Sweden)

    Ali Rosihan M.

    2013-06-01

    Full Text Available For an analytic function $f(z=z+\\sum_{n=2}^\\infty a_n z^n$ satisfying the inequality $\\sum_{n=2}^\\infty n(n-1|a_n|\\leq \\beta$, sharp bound on $\\beta$ is determined so that $f$ is either starlike or convex of order $\\alpha$. Several other coefficient inequalities related to certain subclasses are also investigated.

  9. When is multidimensional screening a convex program?

    CERN Document Server

    Figalli, Alessio; McCann, Robert J

    2009-01-01

    A principal wishes to transact business with a multidimensional distribution of agents whose preferences are known only in the aggregate. Assuming a twist (= generalized Spence-Mirrlees single-crossing) hypothesis and that agents can choose only pure strategies, we identify a structural condition on the preference b(x,y) of agent type x for product type y -- and on the principal's costs c(y) -- which is necessary and sufficient for reducing the profit maximization problem faced by the principal to a convex program. This is a key step toward making the principal's problem theoretically and computationally tractable; in particular, it allows us to derive uniqueness and stability of the principal's optimum strategy -- and similarly of the strategy maximizing the expected welfare of the agents when the principal's profitability is constrained. We call this condition non-negative cross-curvature: it is also (i) necessary and sufficient to guarantee convexity of the set of b-convex functions, (ii) invariant under r...

  10. On convex relaxation of graph isomorphism.

    Science.gov (United States)

    Aflalo, Yonathan; Bronstein, Alexander; Kimmel, Ron

    2015-03-10

    We consider the problem of exact and inexact matching of weighted undirected graphs, in which a bijective correspondence is sought to minimize a quadratic weight disagreement. This computationally challenging problem is often relaxed as a convex quadratic program, in which the space of permutations is replaced by the space of doubly stochastic matrices. However, the applicability of such a relaxation is poorly understood. We define a broad class of friendly graphs characterized by an easily verifiable spectral property. We prove that for friendly graphs, the convex relaxation is guaranteed to find the exact isomorphism or certify its inexistence. This result is further extended to approximately isomorphic graphs, for which we develop an explicit bound on the amount of weight disagreement under which the relaxation is guaranteed to find the globally optimal approximate isomorphism. We also show that in many cases, the graph matching problem can be further harmlessly relaxed to a convex quadratic program with only n separable linear equality constraints, which is substantially more efficient than the standard relaxation involving n2 equality and n2 inequality constraints. Finally, we show that our results are still valid for unfriendly graphs if additional information in the form of seeds or attributes is allowed, with the latter satisfying an easy to verify spectral characteristic.

  11. Extreme properties of quermassintegrals of convex bodies

    Institute of Scientific and Technical Information of China (English)

    LENG; Gangsong

    2001-01-01

    [1]Ball,K.,Shadows of convex bodies,Trans.Amer.Math.Soc.,1991,327:891-901.[2]Lutwak,E.,Mixed projection inequalities,Trans.Amer.Math.Soc.,1985,287:92-106.[3]Bourgain,J.,Lindenstrauss,J.,Projection bodies,Israel Seminar (G.A.F.A) 1986-1987,Lecture Notes in Math.Vol.1317,Berlin-New York:Springer-Verlag,1988,250-269.[4]Chakerian,G.D.,Lutwak,E.,Bodies with similar projections,Trans.Amer.Math.Soc.,1997,349:1811-1820.[5]Schneider,R.,Weil,W.,Zonoids and related topics,Convexity and its Applications (eds.Gruber,P.M.,Wills,J.M.),Basel:Birkhuser,1983,296-316.[6]Schneider,R.,Convex Bodies:the Brunn-Minkowski Theory,Cambridge:Cambridge University Press,1993.[7]Schneider,R.,On the determination of convex bodies by projection and girth functions,Result Math.,1998,33:155-160.[8]Thompson,A.C.,Minkowski Geometry,Cambridge:Cambridge University Press,1996.[9]Petty,C.M.,Projection bodies,in Proceedings,Coll Convexity,Copenhagen,1965,Kbenhavns Univ.Mat.Inst.,1967,234-241.[10]Schneider,R.,Zu einem problem von Shephard über die projectionen konvexer kirper,Math.Z.,1967,101:71-81.[11]Ball,K.,Volume ratios and a reverse isoprimetric inequalitity,J.London Math.Soc.,1991,44(2):351-359.[12]Gardner,R.J.,Intersection bodies and the Busemann-Petty problem,Trans.Amer.Math.Soc.,1994,342:435-445.[13]Gardner,R.J.,A positive answer to the Busemann-petty problem in three dimensions,Annals of Math.,1994,140:435-447.[14]Grinberg,E.L.,Isoperimetric inequalities and identities fork-dimensional cross-sections of convex bodies,Math.Ann.,1991,291:75-86.[15]Goodey,P.,Schneider,R.,Weil,W.,On the determination of convex bodies by projection functions,Bull.London Math.Soc.,1997,29:82-88.[16]Lutwak,E.,Intersection bodies and dual mixed volumes,Adv.Math.,1988,71:232-261.[17]Zhang,G.,Centered bodies and dual mixed volumes,Trans.Amer.Soc.,1994,345:777-801.[18]Zhang,G.,Dual Kinematic formulas,Trans.Amer.Soc.,1999,351:985-995.[19

  12. Manufacturing of Lightweight Mirror

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    Fabrication of the lightweight mirror is one of the key techniques for many large optical systems. CAD,CAM and CNC technologies are adopted in designing and manufacturing such mirrors in CIOMP. Better working efficiency and higher lightweight grade have been achieved. The results show that mirrors up to 70% weight reduction and 0.02λ(rms.) surface accuracy or better can be obtained.

  13. Long Focal Length Large Mirror Fabrication System

    Science.gov (United States)

    Bennett, H. E.

    2003-01-01

    The goals of this ambitious program are (1) to develop systems to make large superpolished optical mirrors, (2) to develop low scatter polishing techniques using centrifugal elutriation, (3) to develop a means of measuring scatter at any point on the mirror, (4) to polish a Hindle sphere to measure the optical figure of a one meter diameter convex mandrel, and (5) to fabricate low scatter, large adaptive optic graphite filled, cyanate ester replica transfer mirrors using these mandrels. Deliverables are a 30 cm diameter superpolished composite AO mirror. We fabricated a 1/3rd meter superpolished zerodur flat mandrel and with the support of our major subcontractor, Composite Mirror Applications Inc (CMA) we have demonstrated a 30 cm lightweight cyanate ester mirror with an rms microroughness between 0.6 and 0.8 nm and 8 faceplate influence function of 5 cm. The influence function was chosen to be comparable to the atmospheric correlation coefficient r(sub 0) which is about 5 cm at sea level. There was no print-thru of the graphite fibers in the cyanate ester surface (the bane of many previous efforts to use cyanate ester mirrors). Our subcontractor has devised a means for developing a 30-50 nm thick layer of graphite free pure ester resin on the surface of the mirrors. This graphite fiber filled material has a thermal expansion coefficient in the 10(exp -8) centimeter per Kelvin range (the same range of expansion coefficient as Zerodur and ULE glasses) and does not take up water and swell, so it is a nearly ideal mirror material in these areas. Unfortunately for these 0.8mm thick faceplates, the number of plies is not enough to result in isometric coverage. Isolated figure irregularities can appear, making it necessary to go to thicker faceplates. The influence function will then only approximate the length of r(sub 0), at higher altitudes or longer wavelengths. The influence function goes as the cube of the thickness, so we are now making a faceplate optimized for

  14. A Mean Point Based Convex Hull Computation Algorithm

    Directory of Open Access Journals (Sweden)

    Digvijay Singh

    2016-11-01

    Full Text Available The optimal solution of a Linear Programming problem (LPP is a basic feasible solution and all basic feasible solutions are extreme or boundary points of a convex region formed by the constraint functions of the LPP. In fact, the feasible solution space is not always a convex set so the verification of extreme points for optimality is quite difficult. In order to cover the non-convex feasible points within a convex set, a convex hull is imagined so that the extreme or boundary points may be checked for evaluation of the optimum solution in the decision-making process. In this article a computer assisted convex hull computation algorithm using the Mean Point and Python code verified results of the designed algorithm are discussed.

  15. 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...

  16. On the modulus of U-convexity

    Directory of Open Access Journals (Sweden)

    Satit Saejung

    2005-01-01

    Full Text Available We prove that the moduli of U-convexity, introduced by Gao (1995, of the ultrapower X˜ of a Banach space X and of X itself coincide whenever X is super-reflexive. As a consequence, some known results have been proved and improved. More precisely, we prove that uX(1>0 implies that both X and the dual space X∗ of X have uniform normal structure and hence the “worth” property in Corollary 7 of Mazcuñán-Navarro (2003 can be discarded.

  17. 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.

  18. Width Distributions for Convex Regular Polyhedra

    CERN Document Server

    Finch, Steven R

    2011-01-01

    The mean width is a measure on three-dimensional convex bodies that enjoys equal status with volume and surface area [Rota]. As the phrase suggests, it is the mean of a probability density f. We verify formulas for mean widths of the regular tetrahedron and the cube. Higher-order moments of f_tetra and f_cube have not been examined until now. Assume that each polyhedron has edges of unit length. We deduce that the mean square width of the regular tetrahedron is 1/3+(3+sqrt(3))/(3*pi) and the mean square width of the cube is 1+4/pi.

  19. Measuring Voting Power in Convex Policy Spaces

    Directory of Open Access Journals (Sweden)

    Sascha Kurz

    2014-03-01

    Full Text Available Classical power index analysis considers the individual’s ability to influence the aggregated group decision by changing its own vote, where all decisions and votes are assumed to be binary. In many practical applications we have more options than either “yes” or “no”. Here we generalize three important power indices to continuous convex policy spaces. This allows the analysis of a collection of economic problems like, e.g., tax rates or spending that otherwise would not be covered in binary models.

  20. The mirror box

    Science.gov (United States)

    Thompson, Gene; Mathieson, Don

    2001-11-01

    The mirror box is an old standby in magic shows and an impressive demonstration of the law of reflection for the physics instructor. The box creates the illusion of an object floating in space by the use of a plane mirror.

  1. Corticospinal mirror neurons.

    Science.gov (United States)

    Kraskov, A; Philipp, R; Waldert, S; Vigneswaran, G; Quallo, M M; Lemon, R N

    2014-01-01

    Here, we report the properties of neurons with mirror-like characteristics that were identified as pyramidal tract neurons (PTNs) and recorded in the ventral premotor cortex (area F5) and primary motor cortex (M1) of three macaque monkeys. We analysed the neurons' discharge while the monkeys performed active grasp of either food or an object, and also while they observed an experimenter carrying out a similar range of grasps. A considerable proportion of tested PTNs showed clear mirror-like properties (52% F5 and 58% M1). Some PTNs exhibited 'classical' mirror neuron properties, increasing activity for both execution and observation, while others decreased their discharge during observation ('suppression mirror-neurons'). These experiments not only demonstrate the existence of PTNs as mirror neurons in M1, but also reveal some interesting differences between M1 and F5 mirror PTNs. Although observation-related changes in the discharge of PTNs must reach the spinal cord and will include some direct projections to motoneurons supplying grasping muscles, there was no EMG activity in these muscles during action observation. We suggest that the mirror neuron system is involved in the withholding of unwanted movement during action observation. Mirror neurons are differentially recruited in the behaviour that switches rapidly between making your own movements and observing those of others.

  2. Advanced Mirror Technology Development

    Science.gov (United States)

    Stahl, H. Philip

    2017-01-01

    The Advanced Mirror Technology Development (AMTD) project matures critical technologies required to enable ultra-stable 4-m-or-larger monolithic or segmented ultraviolet, optical, and infrared (UVOIR) space telescope primary-mirror assemblies for general astrophysics and ultra-high-contrast observations of exoplanets.

  3. Trace-Inequalities and Matrix-Convex Functions

    Directory of Open Access Journals (Sweden)

    Ando Tsuyoshi

    2010-01-01

    Full Text Available Abstract A real-valued continuous function on an interval gives rise to a map via functional calculus from the convex set of Hermitian matrices all of whose eigenvalues belong to the interval. Since the subpace of Hermitian matrices is provided with the order structure induced by the cone of positive semidefinite matrices, one can consider convexity of this map. We will characterize its convexity by the following trace-inequalities: for . A related topic will be also discussed.

  4. Recovery of Sparse Probability Measures via Convex Programming

    OpenAIRE

    Pilanci, Mert; El Ghaoui, Laurent; Chandrasekaran, Venkat

    2012-01-01

    We consider the problem of cardinality penalized optimization of a convex function over the probability simplex with additional convex constraints. The classical ℓ_1 regularizer fails to promote sparsity on the probability simplex since ℓ_1 norm on the probability simplex is trivially constant. We propose a direct relaxation of the minimum cardinality problem and show that it can be efficiently solved using convex programming. As a first application we consider recovering a spa...

  5. Lower Bound for Convex Hull Area and Universal Cover Problems

    CERN Document Server

    Khandhawit, Tirasan; Sriswasdi, Sira

    2011-01-01

    In this paper, we provide a lower bound for an area of the convex hull of points and a rectangle in a plane. We then apply this estimate to establish a lower bound for a universal cover problem. We showed that a convex universal cover for a unit length curve has area at least 0.232239. In addition, we show that a convex universal cover for a unit closed curve has area at least 0.0879873.

  6. Approximation of Convex Bodies by Convex Bodies%凸体间的逼近

    Institute of Scientific and Technical Information of China (English)

    国起; Sten Kaijser

    2003-01-01

    For the affine distance d(C,D)between two convex bodies C,D(∈)Rn,which reduces to the Banach-Mazur distance for symmetric convex bodies, the bounds of d(C,D)have been studied for many years. Some well known estimates for the upper-bounds are as follows: F. John proved d(C,D)≤n1/2 if one is an ellipsoid and another is symmetric,d(C,D)≤n if both are symmetric, and fromF. John's result and d(C1,C2)≤d(C1,C3)d(C2,C3) one has d(C,D)≤n2 for general convex bodies;M.Lassak proved d(C,D)≤(2n-1) if one of them is symmetric.In this paper we get an estimate which includes all the results above as special cases and refines some of them in terms of measures of asymmetry for convex bodies.

  7. Error bound results for convex inequality systems via conjugate duality

    CERN Document Server

    Bot, Radu Ioan

    2010-01-01

    The aim of this paper is to implement some new techniques, based on conjugate duality in convex optimization, for proving the existence of global error bounds for convex inequality systems. We deal first of all with systems described via one convex inequality and extend the achieved results, by making use of a celebrated scalarization function, to convex inequality systems expressed by means of a general vector function. We also propose a second approach for guaranteeing the existence of global error bounds of the latter, which meanwhile sharpens the classical result of Robinson.

  8. Long Wave Dynamics along a Convex Bottom

    CERN Document Server

    Didenkulova, Ira; Soomere, Tarmo

    2008-01-01

    Long linear wave transformation in the basin of varying depth is studied for a case of a convex bottom profile in the framework of one-dimensional shallow water equation. The existence of travelling wave solutions in this geometry and the uniqueness of this wave class is established through construction of a 1:1 transformation of the general 1D wave equation to the analogous wave equation with constant coefficients. The general solution of the Cauchy problem consists of two travelling waves propagating in opposite directions. It is found that generally a zone of a weak current is formed between these two waves. Waves are reflected from the coastline so that their profile is inverted with respect to the calm water surface. Long wave runup on a beach with this profile is studied for sine pulse, KdV soliton and N-wave. Shown is that in certain cases the runup height along the convex profile is considerably larger than for beaches with a linear slope. The analysis of wave reflection from the bottom containing a s...

  9. Molecular Graphics of Convex Body Fluids.

    Science.gov (United States)

    Gabriel, Adrian T; Meyer, Timm; Germano, Guido

    2008-03-01

    Coarse-grained modeling of molecular fluids is often based on nonspherical convex rigid bodies like ellipsoids or spherocylinders representing rodlike or platelike molecules or groups of atoms, with site-site interaction potentials depending both on the distance among the particles and the relative orientation. In this category of potentials, the Gay-Berne family has been studied most extensively. However, conventional molecular graphics programs are not designed to visualize such objects. Usually the basic units are atoms displayed as spheres or as vertices in a graph. Atomic aggregates can be highlighted through an increasing amount of stylized representations, e.g., Richardson ribbon diagrams for the secondary structure of proteins, Connolly molecular surfaces, density maps, etc., but ellipsoids and spherocylinders are generally missing, especially as elementary simulation units. We fill this gap providing and discussing a customized OpenGL-based program for the interactive, rendered representation of large ensembles of convex bodies, useful especially in liquid crystal research. We pay particular attention to the performance issues for typical system sizes in this field. The code is distributed as open source.

  10. Space Mirror Alignment System

    Science.gov (United States)

    Jau, Bruno M.; McKinney, Colin; Smythe, Robert F.; Palmer, Dean L.

    2011-01-01

    An optical alignment mirror mechanism (AMM) has been developed with angular positioning accuracy of +/-0.2 arcsec. This requires the mirror s linear positioning actuators to have positioning resolutions of +/-112 nm to enable the mirror to meet the angular tip/tilt accuracy requirement. Demonstrated capabilities are 0.1 arc-sec angular mirror positioning accuracy, which translates into linear positioning resolutions at the actuator of 50 nm. The mechanism consists of a structure with sets of cross-directional flexures that enable the mirror s tip and tilt motion, a mirror with its kinematic mount, and two linear actuators. An actuator comprises a brushless DC motor, a linear ball screw, and a piezoelectric brake that holds the mirror s position while the unit is unpowered. An interferometric linear position sensor senses the actuator s position. The AMMs were developed for an Astrometric Beam Combiner (ABC) optical bench, which is part of an interferometer development. Custom electronics were also developed to accommodate the presence of multiple AMMs within the ABC and provide a compact, all-in-one solution to power and control the AMMs.

  11. Mesmerising mirror neurons.

    Science.gov (United States)

    Heyes, Cecilia

    2010-06-01

    Mirror neurons have been hailed as the key to understanding social cognition. I argue that three currents of thought-relating to evolution, atomism and telepathy-have magnified the perceived importance of mirror neurons. When they are understood to be a product of associative learning, rather than an adaptation for social cognition, mirror neurons are no longer mesmerising, but they continue to raise important questions about both the psychology of science and the neural bases of social cognition. Copyright 2010 Elsevier Inc. All rights reserved.

  12. 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.

  13. Finding sets of points without empty convex 6-gons

    NARCIS (Netherlands)

    Overmars, M.H.

    2001-01-01

    Erdös asked whether every large enough set of points in general position in the plane contains six points that form a convex 6-gon without any points from the set in its interior. In this note we show how a set of 29 points was found that contains no empty convex 6-gon. To this end a fast

  14. Convex bodies in Euclidean and Weil-Petersson geometries

    CERN Document Server

    Yamada, Sumio

    2011-01-01

    On a convex body in a Euclidean space, we introduce a new variational formulation for its Funk metric, a Finsler metric compatible with the tautological Finsler structure of the convex body. We generalize the metric on Teichmuller spaces with the Weil-Petersson distance function. A set of similarities the resulting metric structure shares with Thurston's asymmetric metric is noted.

  15. 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 ...

  16. In-vivo Convex Array Vector Flow Imaging

    DEFF Research Database (Denmark)

    Jensen, Jørgen Arendt; Brandt, Andreas Hjelm; Nielsen, Michael Bachmann

    2014-01-01

    In-vivo VFI scans obtained from the abdomen of a human volunteer using a convex array transducers and trans- verse oscillation vector flow imaging (VFI) are presented. A 3 MHz BK Medical 8820e (Herlev, Denmark) 192-element convex array probe is used with the SARUS experimental ultrasound scanner....

  17. Locally uniformly convex norms in Banach spaces and their duals

    OpenAIRE

    Haydon, Richard

    2006-01-01

    It is shown that a Banach space with locally uniformly convex dual admits an equivalent norm which is itself locally uniformly convex. It follows that on any such space all continuous real-valued functions may be uniformly approximated by C^1 functions.

  18. On a-order-convexity of Fuzzy Syntopogenous Spaces

    Institute of Scientific and Technical Information of China (English)

    WANG Hong

    2007-01-01

    In this paper,we combine L-fuzzy syntopogenous structure on X with algebraic structure on X.First,the *-increasing and *-decreasing spaces have been studied.Second,we define a-order-convexity on syntopogenous structures (X,S,≤).some important properties of a-order-convexity have been obtained.

  19. Infinitesimal nonrigidity of convex surfaces with planar boundary

    Institute of Scientific and Technical Information of China (English)

    LI Chunhe; HONG Jiaxing

    2005-01-01

    In the present paper infinitesimal nonrigidity of a class of convex surfaces with planar boundary is given. This result shows that if the image of the Gauss map of an evolution convex surface with planar boundary covers some hemisphere, this surface may be of infinitesimal nonrigidity for the isometric deformation of planar boundary.

  20. Homotopy Method for Non-convex Programming in Unbonded Set

    Institute of Scientific and Technical Information of China (English)

    徐庆; 于波

    2005-01-01

    In the past few years, much and much attention has been paid to the method for solving non-convex programming. Many convergence results are obtained for bounded sets. In this paper, we get global convergence results for non-convex programming in unbounded sets under suitable conditions.

  1. (Average-) convexity of common pool and oligopoly TU-games

    NARCIS (Netherlands)

    Driessen, T.S.H.; Meinhardt, H.

    2000-01-01

    The paper studies both the convexity and average-convexity properties for a particular class of cooperative TU-games called common pool games. The common pool situation involves a cost function as well as a (weakly decreasing) average joint production function. Firstly, it is shown that, if the rele

  2. Simple sufficient conditions for starlikeness and convexity for meromorphic functions

    Directory of Open Access Journals (Sweden)

    Goswami Pranay

    2016-01-01

    Full Text Available In this paper we investigate some extensions of sufficient conditions for meromorphic multivalent functions in the open unit disk to be meromorphic multivalent starlike and convex of order α. Our results unify and extend some starlikeness and convexity conditions for meromorphic multivalent functions obtained by Xu et al. [2], and some interesting special cases are given.

  3. Minimal Mirror Twin Higgs

    CERN Document Server

    Barbieri, Riccardo; Harigaya, Keisuke

    2016-01-01

    In a Mirror Twin World with a maximally symmetric Higgs sector the little hierarchy of the Standard Model can be significantly mitigated, perhaps displacing the cutoff scale above the LHC reach. We show that consistency with observations requires that the Z2 parity exchanging the Standard Model with its mirror be broken in the Yukawa couplings. A minimal such effective field theory, with this sole Z2 breaking, can generate the Z2 breaking in the Higgs sector necessary for the Twin Higgs mechanism, and has constrained and correlated signals in invisible Higgs decays, direct Dark Matter Detection and Dark Radiation, all within reach of foreseen experiments. For dark matter, both mirror neutrons and a variety of self-interacting mirror atoms are considered. Neutrino mass signals and the effects of a possible additional Z2 breaking from the vacuum expectation values of B-L breaking fields are also discussed.

  4. The Athena Mirror

    Science.gov (United States)

    Wille, Eric

    2016-07-01

    The Athena mission (Advanced Telescope for High Energy Astrophysics) requires lightweight X-ray Wolter optics with a high angular resolution and large effective area. For achieving an effective area of 2 m^2 (at 1 keV) and an angular resolution of below 5 arcsec, the Silicon Pore Optics technology was developed by ESA together with a consortium of European industry. Silicon Pore Optics are made of commercial Si wafers using process technology adapted from the semiconductor industry. We present the current design of the Athena mirror concentrating on the technology development status of the Silicon Pore Optics, ranging from the manufacturing of single mirror plates towards complete focusing mirror modules and their integration into the mirror structure.

  5. Mirror reactor surface study

    Energy Technology Data Exchange (ETDEWEB)

    Hunt, A. L.; Damm, C. C.; Futch, A. H.; Hiskes, J. R.; Meisenheimer, R. G.; Moir, R. W.; Simonen, T. C.; Stallard, B. W.; Taylor, C. E.

    1976-09-01

    A general survey is presented of surface-related phenomena associated with the following mirror reactor elements: plasma first wall, ion sources, neutral beams, director converters, vacuum systems, and plasma diagnostics. A discussion of surface phenomena in possible abnormal reactor operation is included. Several studies which appear to merit immediate attention and which are essential to the development of mirror reactors are abstracted from the list of recommended areas for surface work. The appendix contains a discussion of the fundamentals of particle/surface interactions. The interactions surveyed are backscattering, thermal desorption, sputtering, diffusion, particle ranges in solids, and surface spectroscopic methods. A bibliography lists references in a number of categories pertinent to mirror reactors. Several complete published and unpublished reports on surface aspects of current mirror plasma experiments and reactor developments are also included.

  6. Manufacturing parabolic mirrors

    CERN Multimedia

    CERN PhotoLab

    1975-01-01

    The photo shows the construction of a vertical centrifuge mounted on an air cushion, with a precision of 1/10000 during rotation, used for the manufacture of very high=precision parabolic mirrors. (See Annual Report 1974.)

  7. The inverse moment problem for convex polytopes

    CERN Document Server

    Gravin, Nick; Pasechnik, Dmitrii; Robins, Sinai

    2011-01-01

    The goal of this paper is to present a general and novel approach for the reconstruction of any convex d-dimensional polytope P, from knowledge of its moments. In particular, we show that the vertices of an N-vertex polytope in R^d can be reconstructed from the knowledge of O(DN) axial moments (w.r.t. to an unknown polynomial measure od degree D) in d+1 distinct generic directions. Our approach is based on the collection of moment formulas due to Brion, Lawrence, Khovanskii-Pukhikov, and Barvinok that arise in the discrete geometry of polytopes, and what variously known as Prony's method, or Vandermonde factorization of finite rank Hankel matrices.

  8. Convex functions, monotone operators and differentiability

    CERN Document Server

    Phelps, Robert R

    1989-01-01

    These notes start with an introduction to the differentiability of convex functions on Banach spaces, leading to the study of Asplund spaces and their intriguing relationship to monotone operators (and more general set-values maps) and Banach spaces with the Radon-Nikodym property. While much of this is classical, some of it is presented using streamlined proofs which were not available until recently. Considerable attention is paid to contemporary results on variational principles and perturbed optimization in Banach spaces, exhibiting their close connections with Asplund spaces. An introductory course in functional analysis is adequate background for reading these notes which can serve as the basis for a seminar of a one-term graduate course. There are numerous excercises, many of which form an integral part of the exposition.

  9. non-Lipschitzian mappings without convexity

    Directory of Open Access Journals (Sweden)

    G. Li

    1999-01-01

    real Hilbert space H, and ℑ={Tt:t∈G} a representation of G as asymptotically nonexpansive type mappings of C into itself. Let L(x={z∈H:infs∈Gsupt∈G‖Tts x−z‖=inft∈G‖Tt x−z‖} for each x∈C and L(ℑ=∩x∈C L(x. In this paper, we prove that ∩s∈Gconv¯{Tts x:t∈G}∩L(ℑ is nonempty for each x∈C if and only if there exists a unique nonexpansive retraction P of C into L(ℑ such that PTs=P for all s∈G and P(x∈conv¯{Ts x:s∈G} for every x∈C. Moreover, we prove the ergodic convergence theorem for a semitopological semigroup of non-Lipschitzian mappings without convexity.

  10. DIFFERENTIAL SUBORDINATIONS AND α-CONVEX FUNCTIONS

    Institute of Scientific and Technical Information of China (English)

    Jacek DZIOK; Ravinder Krishna RAINA; Janusz SOK(O)L

    2013-01-01

    This article presents some new results on the class SLMα of functions that are analytic in the open unit discu ={z:[z[< 1} satisfying the conditions that f(0)=0,f'(0)=1,and α (1+ zf"(z)/f'(z)) + (1-α)zf'(z)/f(x) ∈(p)(u)for all z ∈ u,where α is a real number and (p)(z) =1 + τ2z2/ 1-τz-τ2z2 (z ∈ u).The number τ =(1-√5)/2 is such that τ2 =1 + T.The class SLMα introduced by J.Dziok,R.K.Raina,and J.Sokól [3,Appl.Math.Comput.218 (2011),996-1002] is closely related to the classes of starlike and convex functions.The article deals with several ideas and techniques used in geometric function theory and differential subordinations theory.

  11. Quantification of small, convex particles by TEM

    Energy Technology Data Exchange (ETDEWEB)

    Andersen, Sigmund J. [SINTEF Materials and Chemistry, Department of Synthesis and Properties, Material Physics, NO-7465 Trondheim (Norway)], E-mail: sigmund.j.andersen@sintef.no; Holme, Borge [SINTEF Materials and Chemistry, P.O. Box 124, Blindern, NO-0314 Oslo (Norway); Marioara, Calin D. [SINTEF Materials and Chemistry, Department of Synthesis and Properties, Material Physics, NO-7465 Trondheim (Norway)

    2008-07-15

    It is shown how size distributions of arbitrarily oriented, convex, non-overlapping particles extracted from conventional transmission electron microscopy (TEM) images may be determined by a variation of the Schwartz-Saltykov method. In TEM, particles cut at the surfaces have diminished projections, which alter the observed size distribution. We represent this distribution as a vector and multiply it with the inverse of a matrix comprising thickness-dependent Scheil or Schwartz-Saltykov terms. The result is a corrected size distribution of the projections of uncut particles. It is shown how the real (3D) distribution may be estimated when particle shape is considered. Computer code to generate the matrix is given. A log-normal distribution of spheres and a real distribution of pill-box-shaped dispersoids in an Al-Mg-Si alloy are given as examples. The errors are discussed in detail.

  12. Weighted composition operators and locally convex algebras

    Institute of Scientific and Technical Information of China (English)

    Edoardo Vesentini

    2005-01-01

    The Gleason-Kahane-Zelazko theorem characterizes the continuous homomorphism of an associative, locally multiplicatively convex, sequentially complete algebra A into the field C among all linear forms on A. This characterization will be applied along two different directions. In the case in which A is a commutative Banach algebra, the theorem yields the representation of some classes of continuous linear maps A: A → A as weighted composition operators, or as composition operators when A is a continuous algebra endomorphism. The theorem will then be applied to explore the behaviour of continuous linear forms on quasi-regular elements, when A is either the algebra of all Hilbert-Schmidt operators or a Hilbert algebra.

  13. The problem of convexity of Chebyshev sets

    Science.gov (United States)

    Balaganskii, V. S.; Vlasov, L. P.

    1996-12-01

    Contents Introduction §1. Definitions and notation §2. Reference theorems §3. Some results Chapter I. Characterization of Banach spaces by means of the relations between approximation properties of sets §1. Existence, uniqueness §2. Prom approximate compactness to 'sun'-property §3. From 'sun'-property to approximate compactness §4. Differentiability in the direction of the gradient is sufficient for Fréchet and Gâteaux differentiability §5. Sets with convex complement Chapter II. The structure of Chebyshev and related sets §1. The isolated point method §2. Restrictions of the type \\vert\\overline{W}\\vert Klee (discrete Chebyshev set) §4. A survey of some other results Conclusion Bibliography

  14. The obsidian mirror The obsidian mirror

    Directory of Open Access Journals (Sweden)

    Maria do Socorro Reis Amorin

    2008-04-01

    Full Text Available The author James Norman is an American who has always lived in Mexico during the summer. He seems to love Mexican - Indian traditions and he is well acquainted with the pre-historic culture as it is shown in his book: "The Obsidian Mirror". "The Obsidian Mirror" is a mysterious story about an archeologist: Quigley that lives in a small village in Mexico-San Marcos. He is searching for antiques that belong to some tribes of pre-historic Indians in order to find out their mysteries. Quigley becomes so engaged in his work that his mind has reached a stage that is impossible to separate between Quigley the archeologist, and Quigley as an ancient Indian. The culture, the myth, the sensation of Omen - characteristics of the Indians are within himself. As a result, Quigley acts sometimes as a real Indian. The author James Norman is an American who has always lived in Mexico during the summer. He seems to love Mexican - Indian traditions and he is well acquainted with the pre-historic culture as it is shown in his book: "The Obsidian Mirror". "The Obsidian Mirror" is a mysterious story about an archeologist: Quigley that lives in a small village in Mexico-San Marcos. He is searching for antiques that belong to some tribes of pre-historic Indians in order to find out their mysteries. Quigley becomes so engaged in his work that his mind has reached a stage that is impossible to separate between Quigley the archeologist, and Quigley as an ancient Indian. The culture, the myth, the sensation of Omen - characteristics of the Indians are within himself. As a result, Quigley acts sometimes as a real Indian.

  15. Convex Decomposition Based Cluster Labeling Method for Support Vector Clustering

    Institute of Scientific and Technical Information of China (English)

    Yuan Ping; Ying-Jie Tian; Ya-Jian Zhou; Yi-Xian Yang

    2012-01-01

    Support vector clustering (SVC) is an important boundary-based clustering algorithm in multiple applications for its capability of handling arbitrary cluster shapes. However,SVC's popularity is degraded by its highly intensive time complexity and poor label performance.To overcome such problems,we present a novel efficient and robust convex decomposition based cluster labeling (CDCL) method based on the topological property of dataset.The CDCL decomposes the implicit cluster into convex hulls and each one is comprised by a subset of support vectors (SVs).According to a robust algorithm applied in the nearest neighboring convex hulls,the adjacency matrix of convex hulls is built up for finding the connected components; and the remaining data points would be assigned the label of the nearest convex hull appropriately.The approach's validation is guaranteed by geometric proofs.Time complexity analysis and comparative experiments suggest that CDCL improves both the efficiency and clustering quality significantly.

  16. ANALYSIS TO NEYMAN-PEARSON CLASSIFICATION WITH CONVEX LOSS FUNCTION

    Institute of Scientific and Technical Information of China (English)

    Min Han; Dirong Chen; Zhaoxu Sun

    2008-01-01

    Neyman-Pearson classification has been studied in several articles before.But they all proceeded in the classes of indicator functions with indicator function as the loss function,which make the calculation to be difficult.This paper investigates NeymanPearson classification with convex loss function in the arbitrary class of real measurable functions.A general condition is given under which Neyman-Pearson classification with convex loss function has the same classifier as that with indicator loss function.We give analysis to NP-ERM with convex loss function and prove it's performance guarantees.An example of complexity penalty pair about convex loss function risk in terms of Rademacher averages is studied,which produces a tight PAC bound of the NP-ERM with convex loss function.

  17. Introducing convex layers to the Traveling Salesman Problem

    CERN Document Server

    Liew, Sing

    2012-01-01

    In this paper, we will propose convex layers to the Traveling Salesman Problem (TSP). Firstly, we will focus on human performance on the TSP. Experimental data shows that untrained humans appear to have the ability to perform well in the TSP. On the other hand, experimental data also supports the hypothesis of convex hull i.e. human relies on convex hull to search for the optimal tour for the TSP. Secondly, from the paper published by Bonabeau, Dorigo and Theraulaz, social insect behavior would be able to help in some of the optimizing problems, especially the TSP. Thus, we propose convex layers to the TSP based on the argument that, by the analogy to the social insect behavior, untrained humans' cognition should be able to help in the TSP. Lastly, we will use Tour Improvement algorithms on convex layers to search for an optimal tour for a 13-cities problem to demonstrate the idea.

  18. Efficient protocols for point-convex hull inclusion decision problems

    Directory of Open Access Journals (Sweden)

    Yun Ye

    2010-05-01

    Full Text Available Secure Multi-party Computation (SMC is dedicated to solve trust problems in cooperative computing with each participant’s private data. Privacy Preserving Computational Geometry (PPCG is a special area in SMC and being widely researched. In the real world, PPCG theories can be found being used in various occasions such as military cooperation, commercial competitions and so on. Point-convex hull inclusion problem is a practical case in PPCG and has its profound values. This paper firstly investigates the point inclusion problem with static convex hull, and then marches on to the cases of active convex hull, including the parallel moving and rotating ones. To solve the problems above, we propose a secure protocol to determine the relative position of a private point and a private convex hull in the first place. Compared with previous solutions, our protocols perform better in efficiency, especially when the number of the convex hull’s point is large.

  19. Misunderstanding that the Effective Action is Convex under Broken Symmetry

    CERN Document Server

    Asanuma, Nobu-Hiko

    2016-01-01

    The widespread belief that the effective action is convex and has a flat bottom under broken global symmetry is shown to be wrong. We show spontaneous symmetry breaking necessarily accompanies non-convexity in the effective action for quantum field theory, or in the free energy for statistical mechanics, and clarify the magnitude of non-convexity. For quantum field theory, it is also explicitly proved that translational invariance breaks spontaneously when the system is in the non-convex region, and that different vacua of spontaneously broken symmetry cannot be superposed. As applications of non-convexity, we study the first-order phase transition which happens at the zero field limit of spontaneously broken symmetry, and we propose a simple model of phase coexistence which obeys the Born rule.

  20. CPU timing routines for a CONVEX C220 computer system

    Science.gov (United States)

    Bynum, Mary Ann

    1989-01-01

    The timing routines available on the CONVEX C220 computer system in the Structural Mechanics Division (SMD) at NASA Langley Research Center are examined. The function of the timing routines, the use of the timing routines in sequential, parallel, and vector code, and the interpretation of the results from the timing routines with respect to the CONVEX model of computing are described. The timing routines available on the SMD CONVEX fall into two groups. The first group includes standard timing routines generally available with UNIX 4.3 BSD operating systems, while the second group includes routines unique to the SMD CONVEX. The standard timing routines described in this report are /bin/csh time,/bin/time, etime, and ctime. The routines unique to the SMD CONVEX are getinfo, second, cputime, toc, and a parallel profiling package made up of palprof, palinit, and palsum.

  1. 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...

  2. Mirror contamination in space I: mirror modelling

    Science.gov (United States)

    Krijger, J. M.; Snel, R.; van Harten, G.; Rietjens, J. H. H.; Aben, I.

    2014-10-01

    We present a comprehensive model that can be employed to describe and correct for degradation of (scan) mirrors and diffusers in satellite instruments that suffer from changing optical Ultraviolet to visible (UV-VIS) properties during their operational lifetime. As trend studies become more important, so does the importance of understanding and correcting for this degradation. This is the case not only with respect to the transmission of the optical components, but also with respect to wavelength, polarisation, or scan-angle effects. Our hypothesis is that mirrors in flight suffer from the deposition of a thin absorbing layer of contaminant, which slowly builds up over time. We describe this with the Mueller matrix formalism and Fresnel equations for thin multi-layer contamination films. Special care is taken to avoid the confusion often present in earlier publications concerning the Mueller matrix calculus with out-of-plane reflections. The method can be applied to any UV-VIS satellite instrument. We illustrate and verify our approach to the optical behaviour of the multiple scan mirrors of SCIAMACHY (onboard ENVISAT).

  3. IXO glass mirrors development in Europe

    Science.gov (United States)

    Pareschi, G.; Basso, S.; Bavdaz, M.; Citterio, O.; Civitani, M. M.; Conconi, P.; Gallieni, D.; Ghigo, M.; Martelli, F.; Parodi, G.; Proserpio, L.; Sironi, G.; Spiga, D.; Tagliaferri, G.; Tintori, M.; Wille, E.; Zambra, A.

    2011-09-01

    The mirrors of the International X-ray Observatory (IXO) were based on of a large number of high quality segments, aiming at achieving a global spatial resolution better than 5 arcsec (HEW). A study concerning the slumping of thin glass foils for the IXO mirrors is under development in Europe, funded by ESA and led by the Brera Observatory and is continuing even after that the programhas been descoped, in the perspective of using the technology under development for other future missions. After a preliminary trade-off study, we have focused our the effort on the "Direct" slumping approach, based on the use of convex moulds. In this case during the thermal cycle the optical surface of the glass is in direct contact with the mould surface. The thin plates are made of thin glass sheets (0.4 mm thick), with a reflecting area of 200 mm × 200 mm. The adopted integration process foresees the use of reinforcing ribs for bonding together the plates and forming in that way a rigid and stiff stack of segmented mirror shells; the stack is supported by a thick backplane. During the bonding process the plates are constrained to stay in close contact with the surface of the master (i.e. the same mould used for the hot slumping process) by the application of vacuum pump suction. In this way the spring-back deformations and low frequency errors still present on the foil profile after slumping can be corrected. In this paper we will give an overview and a status report of the project.

  4. Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints

    OpenAIRE

    Goberna, Miguel A.; Jeyakumar, Vaithilingam; Li, Guoyin; Linh, Nguyen

    2016-01-01

    The radius of robust feasibility of a convex program with uncertain constraints gives a value for the maximal ‘size’ of an uncertainty set under which robust feasibility can be guaranteed. This paper provides an upper bound for the radius for convex programs with uncertain convex polynomial constraints and exact formulas for convex programs with SOS-convex polynomial constraints (or convex quadratic constraints) under affine data uncertainty. These exact formulas allow the radius to be comput...

  5. Designing null phase screens to test a fast plano-convex aspheric lens

    Science.gov (United States)

    DelOlmo-Márquez, Jesús; Castán-Ricaño, Diana; Avendaño-Alejo, Maximino; Díaz-Uribe, Rufino

    2015-08-01

    We have obtained a formula to represent the wavefront produced by a plano-convex aspheric lens with symmetry of revolution considering a plane wavefront propagating parallel to the optical axis and impinging on the refracting surface, it is called a zero-distance phase front, being it the first wavefront to be out of the optical system. Using a concept of differential geometry called parallel curves it is possible to obtain an analytic formula to represent the wavefront propagated at arbitrary distances through the optical axis. In order to evaluate qualitatively a plano-convex aspheric lens, we have modified slightly an interferometer Tywman-Green as follow: In the reference beam we use a plane mirror and the beam of test we have used a spatial light modulator (SLM) to compensate the phase produced by the lens under test. It will be called a null phase interferometer. The main idea is to recombine both wavefronts in order to get a null interferogram, otherwise we will associate the patterns of the interferogram to deformations of the lens under test. The null phase screens are formed with concentric circumferences assuming different gray levels printed on SLM.

  6. Decomposability of Abstract and Path-Induced Convexities in Hypergraphs

    Directory of Open Access Journals (Sweden)

    Malvestuto Francesco Mario

    2015-08-01

    Full Text Available An abstract convexity space on a connected hypergraph H with vertex set V (H is a family C of subsets of V (H (to be called the convex sets of H such that: (i C contains the empty set and V (H, (ii C is closed under intersection, and (iii every set in C is connected in H. A convex set X of H is a minimal vertex convex separator of H if there exist two vertices of H that are separated by X and are not separated by any convex set that is a proper subset of X. A nonempty subset X of V (H is a cluster of H if in H every two vertices in X are not separated by any convex set. The cluster hypergraph of H is the hypergraph with vertex set V (H whose edges are the maximal clusters of H. A convexity space on H is called decomposable if it satisfies the following three properties:

  7. White Light Focusing Mirror

    Science.gov (United States)

    Johnson, Eric; Lyndaker, Aaron; Deyhim, Alex; Sullivan, Michael; Chance, Mark; Abel, Don; Toomey, John; Hulbert, Steven

    2007-01-01

    The NSLS X28C white-light beamline is being outfitted with a focusing mirror in order to increase, as well as control, the x-ray intensity at the sample position. The new mirror is a 50 mm × 100 mm × 1100 mm single crystal silicon cylindrical 43.1mm radius substrate bendable to a toroid from infinite to 1200 m radius. The unique feature of this mirror system is the dual use of Indalloy 51 as both a mechanism for heat transfer and a buoyant support to negate the effects of gravity. The benefit of the liquid metal support is the ability to correct for minor slope errors that take the form of a parabola. A bobber mechanism is employed to displace the fluid under the mirror +/- 1.5 mm. This allows RMS slope error correction on the order of 2 urad. The unique mounting of the mirror ensures the contributions to slope error from errant mechanical stresses due to machining tolerances are virtually non-existent. After correction, the surface figure error (measured minus ideal) is <= 0.5 urad rms.

  8. Exploiting Symmetry in Integer Convex Optimization using Core Points

    CERN Document Server

    Herr, Katrin; Schürmann, Achill

    2012-01-01

    We consider convex programming problems with integrality constraints that are invariant under a linear symmetry group. We define a core point of such a symmetry group as an integral point for which the convex hull of its orbit does not contain integral points other than the orbit points themselves. These core points allow us to decompose symmetric integer convex programming problems. Especially for symmetric integer linear programs we describe two algorithms based on this decomposition. Using a characterization of core points for direct products of symmetric groups, we show that prototype implementations can compete with state-of-the art commercial solvers and solve an open MIPLIB problem.

  9. Properties of distance functions on convex surfaces and Alexandrov spaces

    CERN Document Server

    Rataj, Jan

    2009-01-01

    If $X$ is a convex surface in a Euclidean space, then the squared (intrinsic) distance function $\\dist^2(x,y)$ is d.c. (DC, delta-convex) on $X\\times X$ in the only natural extrinsic sense. For the proof we use semiconcavity (in an intrinsic sense) of $\\dist^2(x,y)$ on $X \\times X$ if $X$ is an Alexandrov space with nonnegative curvature. Applications concerning $r$-boundaries (distance spheres) and the ambiguous locus (exoskeleton) of a closed subset of a convex surface are given.

  10. Plane geometry and convexity of polynomial stability regions

    CERN Document Server

    Henrion, Didier

    2008-01-01

    The set of controllers stabilizing a linear system is generally non-convex in the parameter space. In the case of two-parameter controller design (e.g. PI control or static output feedback with one input and two outputs), we observe however that quite often for benchmark problem instances, the set of stabilizing controllers seems to be convex. In this note we use elementary techniques from real algebraic geometry (resultants and Bezoutian matrices) to explain this phenomenon. As a byproduct, we derive a convex linear matrix inequality (LMI) formulation of two-parameter fixed-order controller design problem, when possible.

  11. Bubbles, convexity and the Black--Scholes equation

    CERN Document Server

    Ekström, Erik; 10.1214/08-AAP579

    2009-01-01

    A bubble is characterized by the presence of an underlying asset whose discounted price process is a strict local martingale under the pricing measure. In such markets, many standard results from option pricing theory do not hold, and in this paper we address some of these issues. In particular, we derive existence and uniqueness results for the Black--Scholes equation, and we provide convexity theory for option pricing and derive related ordering results with respect to volatility. We show that American options are convexity preserving, whereas European options preserve concavity for general payoffs and convexity only for bounded contracts.

  12. Shape preserving rational cubic spline for positive and convex data

    Directory of Open Access Journals (Sweden)

    Malik Zawwar Hussain

    2011-11-01

    Full Text Available In this paper, the problem of shape preserving C2 rational cubic spline has been proposed. The shapes of the positive and convex data are under discussion of the proposed spline solutions. A C2 rational cubic function with two families of free parameters has been introduced to attain the C2 positive curves from positive data and C2 convex curves from convex data. Simple data dependent constraints are derived on free parameters in the description of rational cubic function to obtain the desired shape of the data. The rational cubic schemes have unique representations.

  13. Quadratic growth and stability in convex programming problems

    OpenAIRE

    Bonnans, J. Frederic; Ioffe, Alexander D.

    1994-01-01

    Projet PROMATH; Given a convex program with $C^2$ functions and a convex set $S$ of solutions to the problem, we give a second order condition which guarantees that the problem does not have solutions outside of $S$. This condition is interpreted as a characterization for the quadratic growth of the cost function. The crucial role in the proofs is played by a theorem describing a certain uniform regularity property of critical cones in smooth convex programs. We apply these results to the dis...

  14. A Note on The Convexity of Chebyshev Sets

    Directory of Open Access Journals (Sweden)

    Sangeeta

    2009-07-01

    Full Text Available Perhaps one of the major unsolved problem in Approximation Theoryis: Whether or not every Chebyshev subset of a Hilbert space must be convex. Many partial answers to this problem are available in the literature. R.R. Phelps[Proc. Amer. Math. Soc. 8 (1957, 790-797] showed that a Chebyshev set in an inner product space (or in a strictly convex normed linear space is convex if the associated metric projection is non-expansive. We extend this result to metricspaces.

  15. Global Optimization Approach to Non-convex Problems

    Institute of Scientific and Technical Information of China (English)

    LU Zi-fang; ZHENG Hui-li

    2004-01-01

    A new approach to find the global optimal solution of the special non-convex problems is proposed in this paper. The non-convex objective problem is first decomposed into two convex sub-problems. Then a generalized gradient is introduced to determine a search direction and the evolution equation is built to obtain a global minimum point. By the approach, we can prevent the search process from some local minima and search a global minimum point. Two numerical examples are given to prove the approach to be effective.

  16. Toward high-dynamic active mirrors for LGS refocusing systems

    Science.gov (United States)

    Hugot, Emmanuel; Madec, Fabrice; Vives, Sébastien; Ferrari, Marc; Le Mignant, David; Cuby, Jean Gabriel

    2010-07-01

    In the frame of the E-ELT-EAGLE instrument phase A studies, we designed a convex VCM able to compensate for the focus variation on the Laser Guide Star (LGS) wavefront sensor, due to the elevation of the telescope and the fixed sodium layer altitude. We present an original optical design including this active convex mirror, providing a large sag variation on a spherical surface with a 120mm clear aperture, with an optical quality better than lambda/5 RMS up to 820μm of sag and better than lambda/4 RMS up to 1000μm of sag. Finite element analysis (FEA) allowed an optimisation of the mirror's variable thickness distribution to compensate for geometrical and material non linearity. Preliminary study of the pre-stressing has also been performed by FEA, showing that a permanent deformation remains after removal of the loads. Results and comparison with the FEA are presented in the article of F.Madec et al (AS10-7736-119, this conference), with an emphasis on the system approach.

  17. Prolonging sensor networks lifetime using convex clusters

    Directory of Open Access Journals (Sweden)

    Payam Salehi

    2013-11-01

    Full Text Available Reducing the energy consumption of nodes in sensor networks and prolonging the network life time has been proposed as one of the most important challenges facing researchers in the field of sensor networks. Therefore, designing an energy-aware protocol to gather data from network level and transmitting it to sink is placed on the agenda at this paper. After presenting an analysis of the processes of clustering in sensory networks and investigating the effect of sending interval on the amount of energy consumption, We have shown that if the use of convex static casters be done such as all the communications within the cluster with the sending distance less than the optimal threshold, it Will help to increase the lifetime of nodes. also have shown that if we create a virtual backbone between cluster heads to transfer far cluster heads data from sink to sink , will has a significant impact on increasing the network lifetime. For this reason, a detailed discussion on how to determine the size of clusters and partitioning of the network environment to them is presented in Chapter 4.Simulation results show considerable improvement of the proposed algorithm.

  18. 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). ​

  19. Flip to Regular Triangulation and Convex Hull.

    Science.gov (United States)

    Gao, Mingcen; Cao, Thanh-Tung; Tan, Tiow-Seng

    2017-02-01

    Flip is a simple and local operation to transform one triangulation to another. It makes changes only to some neighboring simplices, without considering any attribute or configuration global in nature to the triangulation. Thanks to this characteristic, several flips can be independently applied to different small, non-overlapping regions of one triangulation. Such operation is favored when designing algorithms for data-parallel, massively multithreaded hardware, such as the GPU. However, most existing flip algorithms are designed to be executed sequentially, and usually need some restrictions on the execution order of flips, making them hard to be adapted to parallel computation. In this paper, we present an in depth study of flip algorithms in low dimensions, with the emphasis on the flexibility of their execution order. In particular, we propose a series of provably correct flip algorithms for regular triangulation and convex hull in 2D and 3D, with implementations for both CPUs and GPUs. Our experiment shows that our GPU implementation for constructing these structures from a given point set achieves up to two orders of magnitude of speedup over other popular single-threaded CPU implementation of existing algorithms.

  20. Convex weighting criteria for speaking rate estimation

    Science.gov (United States)

    Jiao, Yishan; Berisha, Visar; Tu, Ming; Liss, Julie

    2015-01-01

    Speaking rate estimation directly from the speech waveform is a long-standing problem in speech signal processing. In this paper, we pose the speaking rate estimation problem as that of estimating a temporal density function whose integral over a given interval yields the speaking rate within that interval. In contrast to many existing methods, we avoid the more difficult task of detecting individual phonemes within the speech signal and we avoid heuristics such as thresholding the temporal envelope to estimate the number of vowels. Rather, the proposed method aims to learn an optimal weighting function that can be directly applied to time-frequency features in a speech signal to yield a temporal density function. We propose two convex cost functions for learning the weighting functions and an adaptation strategy to customize the approach to a particular speaker using minimal training. The algorithms are evaluated on the TIMIT corpus, on a dysarthric speech corpus, and on the ICSI Switchboard spontaneous speech corpus. Results show that the proposed methods outperform three competing methods on both healthy and dysarthric speech. In addition, for spontaneous speech rate estimation, the result show a high correlation between the estimated speaking rate and ground truth values. PMID:26167516

  1. Convexity and symmetrization in relativistic theories

    Science.gov (United States)

    Ruggeri, T.

    1990-09-01

    There is a strong motivation for the desire to have symmetric hyperbolic field equations in thermodynamics, because they guarantee well-posedness of Cauchy problems. A generic quasi-linear first order system of balance laws — in the non-relativistic case — can be shown to be symmetric hyperbolic, if the entropy density is concave with respect to the variables. In relativistic thermodynamics this is not so. This paper shows that there exists a scalar quantity in relativistic thermodynamics whose concavity guarantees a symmetric hyperbolic system. But that quantity — we call it —bar h — is not the entropy, although it is closely related to it. It is formed by contracting the entropy flux vector — ha with a privileged time-like congruencebar ξ _α . It is also shown that the convexity of h plus the requirement that all speeds be smaller than the speed of light c provide symmetric hyperbolic field equations for all choices of the direction of time. At this level of generality the physical meaning of —h is unknown. However, in many circumstances it is equal to the entropy. This is so, of course, in the non-relativistic limit but also in the non-dissipative relativistic fluid and even in relativistic extended thermodynamics for a non-degenerate gas.

  2. Surface micromachined scanning mirrors

    DEFF Research Database (Denmark)

    Mattsson, Kent Erik

    1992-01-01

    Both aluminum cantilever and torsional scanning mirrors have been fabricated and their static and dynamic properties are studied experimentally and theoretically. The experiments showed resonance frequencies in the range of 163 k-Hz - 632 kHz for cantilever beams with Q values between 5 and 11....... Torsional mirrors showed resonance frequencies in the range of 410 kHz - 667 kHz with Q values of 10 - 17. All measurements performed at atmospheric pressure. Both types of mechanical structures were deflected electrostatically at large angles (± 5°) more than 1011 times without breaking and without any...

  3. Unification with mirror fermions

    Directory of Open Access Journals (Sweden)

    Triantaphyllou George

    2014-04-01

    Full Text Available We present a new framework unifying interactions in nature by introducing mirror fermions, explaining the hierarchy between the weak scale and the coupling unification scale, which is found to lie close to Planck energies. A novel process leading to the emergence of symmetry is proposed, which not only reduces the arbitrariness of the scenario proposed but is also followed by significant cosmological implications. Phenomenology includes the probability of detection of mirror fermions via the corresponding composite bosonic states and the relevant quantum corrections at the LHC.

  4. A simple convex optimization problem with many applications

    DEFF Research Database (Denmark)

    Vidal, Rene Victor Valqui

    1994-01-01

    This paper presents an algorithm for the solution of a simple convex optimization problem. This problem is a generalization of several other optimization problems which have applications to resource allocation, optimal capacity expansion, and vehicle scheduling. The algorithm is based...

  5. Differential subordination for meromorphic multivalent quasi-convex functions

    OpenAIRE

    R. W. Ibrahim; M. Darus

    2010-01-01

    We introduce new classes of meromorphic multivalent quasi-convex functions and find some sufficient differential subordination theorems for such classes in punctured unit disk with applications in fractional calculus.

  6. Differential subordination for meromorphic multivalent quasi-convex functions

    Directory of Open Access Journals (Sweden)

    R. W. Ibrahim

    2010-02-01

    Full Text Available We introduce new classes of meromorphic multivalent quasi-convex functions and find some sufficient differential subordination theorems for such classes in punctured unit disk with applications in fractional calculus.

  7. Global optimization over linear constraint non-convex programming problem

    Institute of Scientific and Technical Information of China (English)

    ZHANG Gui-Jun; WU Ti-Huan; YE Rong; YANG Hai-qing

    2005-01-01

    A improving Steady State Genetic Algorithm for global optimization over linear constraint non-convex programmin g problem is presented. By convex analyzing, the primal optimal problem can be converted to an equivalent problem, in which only the information of convex extremes of feasible space is included, and is more easy for GAs to solve. For avoiding invalid genetic operators, a redesigned convex crossover operator is also performed in evolving. As a integrality, the quality of two problem is proven, and a method is also given to get all extremes in linear constraint space. Simulation result show that new algorithm not only converges faster, but also can maintain an diversity population, and can get the global optimum of test problem.

  8. 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].

  9. A novel neural network for nonlinear convex programming.

    Science.gov (United States)

    Gao, Xing-Bao

    2004-05-01

    In this paper, we present a neural network for solving the nonlinear convex programming problem in real time by means of the projection method. The main idea is to convert the convex programming problem into a variational inequality problem. Then a dynamical system and a convex energy function are constructed for resulting variational inequality problem. It is shown that the proposed neural network is stable in the sense of Lyapunov and can converge to an exact optimal solution of the original problem. Compared with the existing neural networks for solving the nonlinear convex programming problem, the proposed neural network has no Lipschitz condition, no adjustable parameter, and its structure is simple. The validity and transient behavior of the proposed neural network are demonstrated by some simulation results.

  10. 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.

  11. A Convex Optimization Approach to pMRI Reconstruction

    CERN Document Server

    Zhang, Cishen

    2013-01-01

    In parallel magnetic resonance imaging (pMRI) reconstruction without using estimation of coil sensitivity functions, one group of algorithms reconstruct sensitivity encoded images of the coils first followed by the magnitude only image reconstruction, e.g. GRAPPA, and another group of algorithms jointly compute the image and sensitivity functions by regularized optimization which is a non-convex problem with local only solutions. For the magnitude only image reconstruction, this paper derives a reconstruction formulation, which is linear in the magnitude image, and an associated convex hull in the solution space of the formulated equation containing the magnitude of the image. As a result, the magnitude only image reconstruction for pMRI is formulated into a two-step convex optimization problem, which has a globally optimal solution. An algorithm based on split-bregman and nuclear norm regularized optimizations is proposed to implement the two-step convex optimization and its applications to phantom and in-vi...

  12. Two new definitions on convexity and related inequalities

    CERN Document Server

    Tunc, Mevlut

    2012-01-01

    We have made some new definitions using the inequalities of Young' and Nesbitt'. And we have given some features of these new definitions. After, we established new Hadamard type inequalities for convex functions in the Young and Nesbitt sense.

  13. Mirror neurons and mirror systems in monkeys and humans.

    Science.gov (United States)

    Fabbri-Destro, Maddalena; Rizzolatti, Giacomo

    2008-06-01

    Mirror neurons are a distinct class of neurons that transform specific sensory information into a motor format. Mirror neurons have been originally discovered in the premotor and parietal cortex of the monkey. Subsequent neurophysiological (TMS, EEG, MEG) and brain imaging studies have shown that a mirror mechanism is also present in humans. According to its anatomical locations, mirror mechanism plays a role in action and intention understanding, imitation, speech, and emotion feeling.

  14. Continuity of Extremal Elements in Uniformly Convex Spaces

    OpenAIRE

    Ferguson, Timothy

    2013-01-01

    In this paper, we study the problem of finding the extremal element for a linear functional over a uniformly convex Banach space. We show that a unique extremal element exists and depends continuously on the linear functional, and vice versa. Using this, we simplify and clarify Ryabykh's proof that for any linear functional on a uniformly convex Bergman space with kernel in a certain Hardy space, the extremal functional belongs to the corresponding Hardy space.

  15. Convex games, clan games, and their marginal games

    OpenAIRE

    Branzei , Rodica; Dimitrov, Dinko; Tijs, Stef

    2005-01-01

    We provide characterizations of convex games and total clan games by using properties of their corresponding marginal games. As it turns out, a cooperative game is convex if and only if all its marginal games are superadditive, and a monotonic game satisfying the veto player property with respect to the members of a coalition C is a total clan game (with clan C) if and only if all its C-based marginal games are subadditive.

  16. Gradient of the Value Function in Parametric Convex Optimization Problems

    OpenAIRE

    Baotić, Mato

    2016-01-01

    We investigate the computation of the gradient of the value function in parametric convex optimization problems. We derive general expression for the gradient of the value function in terms of the cost function, constraints and Lagrange multipliers. In particular, we show that for the strictly convex parametric quadratic program the value function is continuously differentiable at every point in the interior of feasible space for which the Linear Independent Constraint Qualification holds.

  17. Rearview Mirror Dimming Function

    Science.gov (United States)

    Layton, William

    2011-01-01

    Students are often unaware of the little tab on a rear-view mirror that is used to dim headlights from the rear. Those who know about this tab are usually interested in knowing how it works. Explanations of the optics involved can be found in Serway and Jewett and Jones and Edge. An alternate explanation is given.

  18. Rearview Mirror Dimming Function

    Science.gov (United States)

    Layton, William

    2011-01-01

    Students are often unaware of the little tab on a rear-view mirror that is used to dim headlights from the rear. Those who know about this tab are usually interested in knowing how it works. Explanations of the optics involved can be found in Serway and Jewett and Jones and Edge. An alternate explanation is given.

  19. Spectral calibration for convex grating imaging spectrometer

    Science.gov (United States)

    Zhou, Jiankang; Chen, Xinhua; Ji, Yiqun; Chen, Yuheng; Shen, Weimin

    2013-12-01

    Spectral calibration of imaging spectrometer plays an important role for acquiring target accurate spectrum. There are two spectral calibration types in essence, the wavelength scanning and characteristic line sampling. Only the calibrated pixel is used for the wavelength scanning methods and he spectral response function (SRF) is constructed by the calibrated pixel itself. The different wavelength can be generated by the monochromator. The SRF is constructed by adjacent pixels of the calibrated one for the characteristic line sampling methods. And the pixels are illuminated by the narrow spectrum line and the center wavelength of the spectral line is exactly known. The calibration result comes from scanning method is precise, but it takes much time and data to deal with. The wavelength scanning method cannot be used in field or space environment. The characteristic line sampling method is simple, but the calibration precision is not easy to confirm. The standard spectroscopic lamp is used to calibrate our manufactured convex grating imaging spectrometer which has Offner concentric structure and can supply high resolution and uniform spectral signal. Gaussian fitting algorithm is used to determine the center position and the Full-Width-Half-Maximum(FWHM)of the characteristic spectrum line. The central wavelengths and FWHMs of spectral pixels are calibrated by cubic polynomial fitting. By setting a fitting error thresh hold and abandoning the maximum deviation point, an optimization calculation is achieved. The integrated calibration experiment equipment for spectral calibration is developed to enhance calibration efficiency. The spectral calibration result comes from spectral lamp method are verified by monochromator wavelength scanning calibration technique. The result shows that spectral calibration uncertainty of FWHM and center wavelength are both less than 0.08nm, or 5.2% of spectral FWHM.

  20. Stochastic convex sparse principal component analysis.

    Science.gov (United States)

    Baytas, Inci M; Lin, Kaixiang; Wang, Fei; Jain, Anil K; Zhou, Jiayu

    2016-12-01

    Principal component analysis (PCA) is a dimensionality reduction and data analysis tool commonly used in many areas. The main idea of PCA is to represent high-dimensional data with a few representative components that capture most of the variance present in the data. However, there is an obvious disadvantage of traditional PCA when it is applied to analyze data where interpretability is important. In applications, where the features have some physical meanings, we lose the ability to interpret the principal components extracted by conventional PCA because each principal component is a linear combination of all the original features. For this reason, sparse PCA has been proposed to improve the interpretability of traditional PCA by introducing sparsity to the loading vectors of principal components. The sparse PCA can be formulated as an ℓ1 regularized optimization problem, which can be solved by proximal gradient methods. However, these methods do not scale well because computation of the exact gradient is generally required at each iteration. Stochastic gradient framework addresses this challenge by computing an expected gradient at each iteration. Nevertheless, stochastic approaches typically have low convergence rates due to the high variance. In this paper, we propose a convex sparse principal component analysis (Cvx-SPCA), which leverages a proximal variance reduced stochastic scheme to achieve a geometric convergence rate. We further show that the convergence analysis can be significantly simplified by using a weak condition which allows a broader class of objectives to be applied. The efficiency and effectiveness of the proposed method are demonstrated on a large-scale electronic medical record cohort.

  1. Fixed Points of Single- and Set-Valued Mappings in Uniformly Convex Metric Spaces with No Metric Convexity

    Directory of Open Access Journals (Sweden)

    Rafa Espínola

    2010-01-01

    Full Text Available We study the existence of fixed points and convergence of iterates for asymptotic pointwise contractions in uniformly convex metric spaces. We also study the existence of fixed points for set-valued nonexpansive mappings in the same class of spaces. Our results do not assume convexity of the metric which makes a big difference when studying the existence of fixed points for set-valued mappings.

  2. A parameter-dependent refinement of the discrete Jensen's inequality for convex and mid-convex functions

    Directory of Open Access Journals (Sweden)

    Horváth László

    2011-01-01

    Full Text Available Abstract In this paper, a new parameter-dependent refinement of the discrete Jensen's inequality is given for convex and mid-convex functions. The convergence of the introduced sequences is also studied. One of the proofs requires an interesting convergence theorem with probability theoretical background. We apply the results to define some new quasi-arithmetic and mixed symmetric means and study their monotonicity and convergence.

  3. Derived Categories of BHK Mirrors

    CERN Document Server

    Favero, David

    2016-01-01

    We prove a derived analogue to the results of Borisov, Clarke, Kelly, and Shoemaker on the birationality of Berglund-Hubsch-Krawitz mirrors. Heavily bootstrapping off work of Seidel and Sheridan, we obtain Homological Mirror Symmetry for Berglund-Hubsch-Krawitz mirror pencils to hypersurfaces in projective space.

  4. Mirror image agnosia.

    Science.gov (United States)

    Chandra, Sadanandavalli Retnaswami; Issac, Thomas Gregor

    2014-10-01

    Gnosis is a modality-specific ability to access semantic knowledge of an object or stimulus in the presence of normal perception. Failure of this is agnosia or disorder of recognition. It can be highly selective within a mode. self-images are different from others as none has seen one's own image except in reflection. Failure to recognize this image can be labeled as mirror image agnosia or Prosopagnosia for reflected self-image. Whereas mirror agnosia is a well-recognized situation where the person while looking at reflected images of other objects in the mirror he imagines that the objects are in fact inside the mirror and not outside. Five patients, four females, and one male presented with failure to recognize reflected self-image, resulting in patients conversing with the image as a friend, fighting because the person in mirror is wearing her nose stud, suspecting the reflected self-image to be an intruder; but did not have prosopagnosia for others faces, non living objects on self and also apraxias except dressing apraxia in one patient. This phenomena is new to our knowledge. Mirror image agnosia is an unique phenomena which is seen in patients with parietal lobe atrophy without specificity to a category of dementing illness and seems to disappear as disease advances. Reflected self-images probably have a specific neural substrate that gets affected very early in posterior dementias specially the ones which predominantly affect the right side. At that phase most patients are mistaken as suffering from psychiatric disorder as cognition is moderately preserved. As disease becomes more widespread this symptom becomes masked. A high degree of suspicion and proper assessment might help physicians to recognize the organic cause of the symptom so that early therapeutic interventions can be initiated. Further assessment of the symptom with FMRI and PET scan is likely to solve the mystery of how brain handles reflected self-images. A new observation involving failure

  5. Mirror image agnosia

    Directory of Open Access Journals (Sweden)

    Sadanandavalli Retnaswami Chandra

    2014-01-01

    Full Text Available Background: Gnosis is a modality-specific ability to access semantic knowledge of an object or stimulus in the presence of normal perception. Failure of this is agnosia or disorder of recognition. It can be highly selective within a mode. self-images are different from others as none has seen one′s own image except in reflection. Failure to recognize this image can be labeled as mirror image agnosia or Prosopagnosia for reflected self-image. Whereas mirror agnosia is a well-recognized situation where the person while looking at reflected images of other objects in the mirror he imagines that the objects are in fact inside the mirror and not outside. Material and Methods:: Five patients, four females, and one male presented with failure to recognize reflected self-image, resulting in patients conversing with the image as a friend, fighting because the person in mirror is wearing her nose stud, suspecting the reflected self-image to be an intruder; but did not have prosopagnosia for others faces, non living objects on self and also apraxias except dressing apraxia in one patient. This phenomena is new to our knowledge. Results: Mirror image agnosia is an unique phenomena which is seen in patients with parietal lobe atrophy without specificity to a category of dementing illness and seems to disappear as disease advances. Discussion: Reflected self-images probably have a specific neural substrate that gets affected very early in posterior dementias specially the ones which predominantly affect the right side. At that phase most patients are mistaken as suffering from psychiatric disorder as cognition is moderately preserved. As disease becomes more widespread this symptom becomes masked. A high degree of suspicion and proper assessment might help physicians to recognize the organic cause of the symptom so that early therapeutic interventions can be initiated. Further assessment of the symptom with FMRI and PET scan is likely to solve the mystery

  6. The Knaster-Kuratowski-Mazurkiewicz theorem and abstract convexities

    Science.gov (United States)

    Cain, George L., Jr.; González, Luis

    2008-02-01

    The Knaster-Kuratowski-Mazurkiewicz covering theorem (KKM), is the basic ingredient in the proofs of many so-called "intersection" theorems and related fixed point theorems (including the famous Brouwer fixed point theorem). The KKM theorem was extended from Rn to Hausdorff linear spaces by Ky Fan. There has subsequently been a plethora of attempts at extending the KKM type results to arbitrary topological spaces. Virtually all these involve the introduction of some sort of abstract convexity structure for a topological space, among others we could mention H-spaces and G-spaces. We have introduced a new abstract convexity structure that generalizes the concept of a metric space with a convex structure, introduced by E. Michael in [E. Michael, Convex structures and continuous selections, Canad. J. MathE 11 (1959) 556-575] and called a topological space endowed with this structure an M-space. In an article by Shie Park and Hoonjoo Kim [S. Park, H. Kim, Coincidence theorems for admissible multifunctions on generalized convex spaces, J. Math. Anal. Appl. 197 (1996) 173-187], the concepts of G-spaces and metric spaces with Michael's convex structure, were mentioned together but no kind of relationship was shown. In this article, we prove that G-spaces and M-spaces are close related. We also introduce here the concept of an L-space, which is inspired in the MC-spaces of J.V. Llinares [J.V. Llinares, Unified treatment of the problem of existence of maximal elements in binary relations: A characterization, J. Math. Econom. 29 (1998) 285-302], and establish relationships between the convexities of these spaces with the spaces previously mentioned.

  7. Bosonization and Mirror Symmetry

    CERN Document Server

    Kachru, Shamit; Torroba, Gonzalo; Wang, Huajia

    2016-01-01

    We study bosonization in 2+1 dimensions using mirror symmetry, a duality that relates pairs of supersymmetric theories. Upon breaking supersymmetry in a controlled way, we dynamically obtain the bosonization duality that equates the theory of a free Dirac fermion to QED3 with a single scalar boson. This duality may be used to demonstrate the bosonization duality relating an $O(2)$-symmetric Wilson-Fisher fixed point to QED3 with a single Dirac fermion, Peskin-Dasgupta-Halperin duality, and the recently conjectured duality relating the theory of a free Dirac fermion to fermionic QED3 with a single flavor. Chern-Simons and BF couplings for both dynamical and background gauge fields play a central role in our approach. In the course of our study, we describe a chiral mirror pair that may be viewed as the minimal supersymmetric generalization of the two bosonization dualities.

  8. Dynamic coherent backscattering mirror

    Energy Technology Data Exchange (ETDEWEB)

    Zeylikovich, I.; Xu, M., E-mail: mxu@fairfield.edu [Physics Department, Fairfield University, Fairfield, CT 06824 (United States)

    2016-02-15

    The phase of multiply scattered light has recently attracted considerable interest. Coherent backscattering is a striking phenomenon of multiple scattered light in which the coherence of light survives multiple scattering in a random medium and is observable in the direction space as an enhancement of the intensity of backscattered light within a cone around the retroreflection direction. Reciprocity also leads to enhancement of backscattering light in the spatial space. The random medium behaves as a reciprocity mirror which robustly converts a diverging incident beam into a converging backscattering one focusing at a conjugate spot in space. Here we first analyze theoretically this coherent backscattering mirror (CBM) phenomenon and then demonstrate the capability of CBM compensating and correcting both static and dynamic phase distortions occurring along the optical path. CBM may offer novel approaches for high speed dynamic phase corrections in optical systems and find applications in sensing and navigation.

  9. Dynamic coherent backscattering mirror

    Science.gov (United States)

    Xu, M.

    2016-01-01

    The phase of multiply scattered light has recently attracted considerable interest. Coherent backscattering is a striking phenomenon of multiple scattered light in which the coherence of light survives multiple scattering in a random medium and is observable in the direction space as an enhancement of the intensity of backscattered light within a cone around the retroreflection direction. Reciprocity also leads to enhancement of backscattering light in the spatial space. The random medium behaves as a reciprocity mirror which robustly converts a diverging incident beam into a converging backscattering one focusing at a conjugate spot in space. Here we first analyze theoretically this coherent backscattering mirror (CBM) phenomenon and then demonstrate the capability of CBM compensating and correcting both static and dynamic phase distortions occurring along the optical path. CBM may offer novel approaches for high speed dynamic phase corrections in optical systems and find applications in sensing and navigation. PMID:26937296

  10. Mirror Principle, 1

    CERN Document Server

    Lian Bong H; Yau, S T

    1997-01-01

    We propose and study the following Mirror Principle: certain sequences of multiplicative equivariant characteristic classes on Kontsevich's stable map moduli spaces can be computed in terms of certain hypergeometric type classes. As applications, we compute the equivariant Euler classes of obstruction bundles induced by any concavex bundles -- including any direct sum of line bundles -- on $\\P^n$. This includes proving the formula of Candelas-de la Ossa-Green-Parkes hence completing the program of Candelas et al, Kontesevich, Manin, and Givental, to compute rigorously the instanton prepotential function for the quintic in $\\P^4$. We derive, among many other examples, the multiple cover formula for Gromov-Witten invariants of $\\P^1$, computed earlier by Morrison-Aspinwall and by Manin in different approaches. We also prove a formula for enumerating Euler classes which arise in the so-called local mirror symmetry for some noncompact Calabi-Yau manifolds. At the end we interprete an infinite dimensional transfor...

  11. Bosonization and mirror symmetry

    Science.gov (United States)

    Kachru, Shamit; Mulligan, Michael; Torroba, Gonzalo; Wang, Huajia

    2016-10-01

    We study bosonization in 2 +1 dimensions using mirror symmetry, a duality that relates pairs of supersymmetric theories. Upon breaking supersymmetry in a controlled way, we dynamically obtain the bosonization duality that equates the theory of a free Dirac fermion to QED3 with a single scalar boson. This duality may be used to demonstrate the bosonization duality relating an O (2 )-symmetric Wilson-Fisher fixed point to QED3 with a single Dirac fermion, Peskin-Dasgupta-Halperin duality, and the recently conjectured duality relating the theory of a free Dirac fermion to fermionic QED3 with a single flavor. Chern-Simons and BF couplings for both dynamical and background gauge fields play a central role in our approach. In the course of our study, we describe a "chiral" mirror pair that may be viewed as the minimal supersymmetric generalization of the two bosonization dualities.

  12. Complex/Symplectic Mirrors

    CERN Document Server

    Chuang, W; Tomasiello, A; Chuang, Wu-yen; Kachru, Shamit; Tomasiello, Alessandro

    2005-01-01

    We construct a class of symplectic non--Kaehler and complex non--Kaehler string theory vacua, extending and providing evidence for an earlier suggestion by Polchinski and Strominger. The class admits a mirror pairing by construction. Comparing hints from a variety of sources, including ten--dimensional supergravity and KK reduction on SU(3)--structure manifolds, suggests a picture in which string theory extends Reid's fantasy to connect classes of both complex non-Kaehler and symplectic non-Kaehler manifolds.

  13. Surface profiling of X-ray mirrors for shaping focused beams.

    Science.gov (United States)

    Laundy, David; Alianelli, Lucia; Sutter, John; Evans, Gwyndaf; Sawhney, Kawal

    2015-01-26

    Grazing incidence mirrors are a standard optic for focusing X-rays. Active mirrors, whose surface profile can be finely adjusted, allow control of beam shape and size at the sample. However, progress towards their routine use for beam shaping has been hampered by the strong striations in reflected beams away from the focal plane. Re-entrant (partly concave and partly convex) surface modifications are proposed for shaping X-ray beams to a top-hat in the focal plane while reducing the striations caused by unavoidable polishing errors. A method for constructing such surfaces with continuous height and slope (but only piecewise continuous curvature) will be provided. Ray tracing and wave propagation calculations confirm its effectiveness. A mirror system is proposed allowing vertical beam sizes in the range 0.5 to 10μm. A prototype will be fabricated and is expected to have applications on many synchrotron X-ray beamlines.

  14. Mirrors for High Resolution X-Ray Optics---Figure Preserving IR/PT Coating

    Science.gov (United States)

    Chan, Kai-Wing; Olsen, Lawrence; Sharpe, Marton; Numata, Ai; McClelland, Ryan; Saha, Timo; Zhang, Will

    2016-01-01

    Coating stress of 10 - 20 nm of Ir is sufficiently high to distort the figure of arc-second thin lightweight mirrors. For iridium: --Stress sigma 4 GPa for 15 nm film implies 60 Nm integrated stress-- Need less than 3 N/m (or stress less than 200 MPa) for sub-arcsecond optics. Basic Approaches for Mitigation. A. Annealing the film-- Glass can be heat up to 400 C without distortion. Silicon is even more resistant.-- It was found that recovery is limited by residual thermal stress from taking the mirror down from high T. B. Coating bi-layer films with compressive stress with tensile stress. C. Front-and-back coating with magnetron sputtering or atomic layer deposition-- Sputtering involve spanning of substrates. Geometric difference in setup (convexness/concaveness of curved mirrors) does not permit precise front-and-back matching-- Atomic layer deposition can provide a uniform deposition front and back simultaneously.

  15. A spectrum of shadowed mirroring.

    Science.gov (United States)

    Wanamaker, Melissa C

    2012-04-01

    The central focus of this paper is to explore and extend Kohut's theory of maternal mirroring and to place it within the current context of psychoanalytic thinking. Kohut believed a child must experience "positive" mirroring from his or her mother in infancy and beyond to ensure development of a healthy self. Kohut alludes, however, to a possible situation in which the mother's face, metaphorically a mirror, can appear "faceless" to her child. From this I have inferred the concept of what I shall call "shadowed mirroring." Clinical and literary examples show that distorted, "shadowed" mirroring appears on a spectrum, with passive mirroring at one end and hostile (either verbal or nonverbal) mirroring on the other; some individuals experience both. I then consider how "shadowed mirroring," especially hostile mirroring, can be understood within the twin contexts of the overall mother-child relationship and present-day Intersubjective/Relational thinking that is both bidirectional and co-constructed. Shadowed mirroring can lead to severe personality dysfunction along the borderline-narcissistic range, as well as to difficulties in the areas of identity formation, failure of self-cohesiveness, and the blunting of certain humane qualities like empathy.

  16. Quantifying the Convexity of Waterfalls Along the Niobrara River, Cherry, Keya Paha, and Brown Counties, Nebraska

    Science.gov (United States)

    Mason, L. J.; Pederson, D. T.; Goble, R. J.

    2003-12-01

    Numerous waterfalls are present along the spring branch canyons of the Niobrara River, downstream of Cornell Dam, Valentine, Nebraska. Although the sizes of the waterfalls are variable, a majority of the waterfall faces have a convex outward geometry. In order to gain a better understanding of the processes responsible for the development of this profile, it is useful to quantify the convexity of the waterfall face. Due to the rugged topography of the spring branch canyon environment, traditional techniques, such as pin-flag and tape measurements are not practical and even dangerous. The waterfall faces are often greater than 3 meters high, steep, and algae covered. The spring branch canyon walls are also steep with actively creeping scree slopes along the bases. Therefore, due to this topography there is no easy way to access the waterfall faces for accurate measurements. The measurement problem was overcome by using a hand-held laser meter mounted on a tripod. A baseline was established below the waterfall face. The length of the baseline was measured using the hand-held laser meter. Measurements were taken on distinct features across the waterfall face and sidewalls from both endpoints of the baseline. The angle of the laser off the baseline and off the horizontal were measured using a compass with mirror. With these measurements, the waterfall faces profile relative to the baseline was reconstructed. A hand-held laser meter is an important tool for measuring waterfalls and other geomorphic features in hazardous environments because measurements can be taken from a safe location. It is possible for one person to take accurate measurements. New baselines can readily be established to measure relative erosion along the waterfall face over time.

  17. Cavitation bubbles collapse characteristics behind a convex body

    Institute of Scientific and Technical Information of China (English)

    李瑶; 许唯临; 张亚磊; 张敬威; 陈春祺; 阿蓉

    2013-01-01

    Cavitation bubbles behind a convex body were experimentally studied by a high speed camera and a hydrophone synch- ronously. The experiments were conducted in a circulating water tunnel with five various contraction ratios:b=0.497,b=0.6,b=0.697,b=0.751, andb=0.799. The distributions of the cavitation bubble collapse positions behind the five different convex bodies were obtained by combining the images taken by the high speed camera. According to the collapse positions, it was found that no cavitation bubble was collapsed in the region near the wall until the ratio of the water head loss over the convex body height was larger than 20, which can be used to predict if the cavitation damage would occur in the tunnel with orifice energy dissipaters.

  18. Trace-Inequalities and Matrix-Convex Functions

    Directory of Open Access Journals (Sweden)

    Tsuyoshi Ando

    2010-01-01

    Full Text Available A real-valued continuous function f(t on an interval (α,β gives rise to a map X↦f(X via functional calculus from the convex set of n×n Hermitian matrices all of whose eigenvalues belong to the interval. Since the subpace of Hermitian matrices is provided with the order structure induced by the cone of positive semidefinite matrices, one can consider convexity of this map. We will characterize its convexity by the following trace-inequalities: Tr(f(B−f(A(C−B≤Tr(f(C−f(B(B−A for A≤B≤C. A related topic will be also discussed.

  19. RESEARCH ANNOUNCEMENTS Helly Type Problems for Some Special Convex Polygons

    Institute of Scientific and Technical Information of China (English)

    苑立平; 丁仁

    2001-01-01

    @@In the combinatorial geometry of convex sets the question of how efficiently a family of convex sets can be pierced by points has led to various problems which may be regarded as extensions of the Helly-type problems. A family of sets is said to be n-pierceable (abbreviated as Пn) if there exists a set of n points such that each member of the family contains at least one of them. A family of sets is said to be Пnk if every subfamily of size k or less is Пn. The famous Helly theorem in combinatorial geometry asserts that for finite families of convex sets in the plane П13 implies П1. In a recent paper by M. Katchalski and D. Nashtir[a] the following conjecture of Griinbaum[2] was mentioned again:

  20. Widths of some classes of convex functions and bodies

    Science.gov (United States)

    Konovalov, V. N.; Maiorov, Vitalii E.

    2010-02-01

    We consider classes of uniformly bounded convex functions defined on convex compact bodies in \\mathbb{R}^d and satisfying a Lipschitz condition and establish the exact orders of their Kolmogorov, entropy, and pseudo-dimension widths in the L_1-metric. We also introduce the notions of pseudo-dimension and pseudo-dimension widths for classes of sets and determine the exact orders of the entropy and pseudo-dimension widths of some classes of convex bodies in \\mathbb{R}^drelative to the pseudo-metric defined as the d-dimensional Lebesgue volume of the symmetric difference of two sets. We also find the exact orders of the entropy and pseudo-dimension widths of the corresponding classes of characteristic functions in L_p-spaces, 1\\le p\\le\\infty.

  1. Convex minorants of random walks and L\\'evy processes

    CERN Document Server

    Abramson, Josh; Ross, Nathan; Bravo, Gerónimo Uribe

    2011-01-01

    This article provides an overview of recent work on descriptions and properties of the convex minorant of random walks and L\\'evy processes which summarize and extend the literature on these subjects. The results surveyed include point process descriptions of the convex minorant of random walks and L\\'evy processes on a fixed finite interval, up to an independent exponential time, and in the infinite horizon case. These descriptions follow from the invariance of these processes under an adequate path transformation. In the case of Brownian motion, we note how further special properties of this process, including time-inversion, imply a sequential description for the convex minorant of the Brownian meander.

  2. Small sets in convex geometry and formal independence over ZFC

    Directory of Open Access Journals (Sweden)

    Menachem Kojman

    2005-01-01

    Full Text Available To each closed subset S of a finite-dimensional Euclidean space corresponds a σ-ideal of sets  (S which is σ-generated over S by the convex subsets of S. The set-theoretic properties of this ideal hold geometric information about the set. We discuss the relation of reducibility between convexity ideals and the connections between convexity ideals and other types of ideals, such as the ideals which are generated over squares of Polish space by graphs and inverses of graphs of continuous self-maps, or Ramsey ideals, which are generated over Polish spaces by the homogeneous sets with respect to some continuous pair coloring. We also attempt to present to nonspecialists the set-theoretic methods for dealing with formal independence as a means of geometric investigations.

  3. Dose evaluation from multiple detector outputs using convex optimisation.

    Science.gov (United States)

    Hashimoto, Makoto; Iimoto, Takeshi; Kosako, Toshiso

    2011-07-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.

  4. Entanglement Quantification Made Easy: Polynomial Measures Invariant under Convex Decomposition.

    Science.gov (United States)

    Regula, Bartosz; Adesso, Gerardo

    2016-02-19

    Quantifying entanglement in composite systems is a fundamental challenge, yet exact results are available in only a few special cases. This is because hard optimization problems are routinely involved, such as finding the convex decomposition of a mixed state with the minimal average pure-state entanglement, the so-called convex roof. We show that under certain conditions such a problem becomes trivial. Precisely, we prove by a geometric argument that polynomial entanglement measures of degree 2 are independent of the choice of pure-state decomposition of a mixed state, when the latter has only one pure unentangled state in its range. This allows for the analytical evaluation of convex roof extended entanglement measures in classes of rank-2 states obeying such a condition. We give explicit examples for the square root of the three-tangle in three-qubit states, and we show that several representative classes of four-qubit pure states have marginals that enjoy this property.

  5. Polyominoes with nearly convex columns: A model with semidirected blocks

    CERN Document Server

    Feretic, Svjetlan

    2009-01-01

    In most of today's exactly solved classes of polyominoes, either all members are convex (in some way), or all members are directed, or both. If the class is neither convex nor directed, the exact solution uses to be elusive. This paper is focused on polyominoes with hexagonal cells. Concretely, we deal with polyominoes whose columns can have either one or two connected components. Those polyominoes (unlike the well-explored column-convex polyominoes) cannot be exactly enumerated by any of the now existing methods. It is therefore appropriate to introduce additional restrictions, thus obtaining solvable subclasses. In our recent paper, published in this same journal, the restrictions just mentioned were semidirectedness and an upper bound on the size of the gap within a column. In this paper, the semidirectedness requirement is made looser. The result is that now the exactly solved subclasses are larger and have greater growth constants. These new polyomino families also have the advantage of being invariant u...

  6. Relating the "mirrorness" of mirror neurons to their origins.

    Science.gov (United States)

    Kilner, James M; Friston, Karl J

    2014-04-01

    Ever since their discovery, mirror neurons have generated much interest and debate. A commonly held view of mirror neuron function is that they transform "visual information into knowledge," thus enabling action understanding and non-verbal social communication between con-specifics (Rizzolatti & Craighero 2004). This functionality is thought to be so important that it has been argued that mirror neurons must be a result of selective pressure.

  7. Point-in-convex polygon and point-in-convex polyhedron algorithms with O(1) complexity using space subdivision

    Science.gov (United States)

    Skala, Vaclav

    2016-06-01

    There are many space subdivision and space partitioning techniques used in many algorithms to speed up computations. They mostly rely on orthogonal space subdivision, resp. using hierarchical data structures, e.g. BSP trees, quadtrees, octrees, kd-trees, bounding volume hierarchies etc. However in some applications a non-orthogonal space subdivision can offer new ways for actual speed up. In the case of convex polygon in E2 a simple Point-in-Polygon test is of the O(N) complexity and the optimal algorithm is of O(log N) computational complexity. In the E3 case, the complexity is O(N) even for the convex polyhedron as no ordering is defined. New Point-in-Convex Polygon and Point-in-Convex Polyhedron algorithms are presented based on space subdivision in the preprocessing stage resulting to O(1) run-time complexity. The presented approach is simple to implement. Due to the principle of duality, dual problems, e.g. line-convex polygon, line clipping, can be solved in a similarly.

  8. Active Mirror Predictive and Requirements Verification Software (AMP-ReVS)

    Science.gov (United States)

    Basinger, Scott A.

    2012-01-01

    This software is designed to predict large active mirror performance at various stages in the fabrication lifecycle of the mirror. It was developed for 1-meter class powered mirrors for astronomical purposes, but is extensible to other geometries. The package accepts finite element model (FEM) inputs and laboratory measured data for large optical-quality mirrors with active figure control. It computes phenomenological contributions to the surface figure error using several built-in optimization techniques. These phenomena include stresses induced in the mirror by the manufacturing process and the support structure, the test procedure, high spatial frequency errors introduced by the polishing process, and other process-dependent deleterious effects due to light-weighting of the mirror. Then, depending on the maturity of the mirror, it either predicts the best surface figure error that the mirror will attain, or it verifies that the requirements for the error sources have been met once the best surface figure error has been measured. The unique feature of this software is that it ties together physical phenomenology with wavefront sensing and control techniques and various optimization methods including convex optimization, Kalman filtering, and quadratic programming to both generate predictive models and to do requirements verification. This software combines three distinct disciplines: wavefront control, predictive models based on FEM, and requirements verification using measured data in a robust, reusable code that is applicable to any large optics for ground and space telescopes. The software also includes state-of-the-art wavefront control algorithms that allow closed-loop performance to be computed. It allows for quantitative trade studies to be performed for optical systems engineering, including computing the best surface figure error under various testing and operating conditions. After the mirror manufacturing process and testing have been completed, the

  9. AN EFFICIENT ALGORITHM FOR THE CONVEX HULL OF PLANAR SCATTERED POINT SET

    Directory of Open Access Journals (Sweden)

    Z. Fu

    2012-07-01

    Full Text Available Computing the convex hull of a point set is requirement in the GIS applications. This paper studies on the problem of minimum convex hull and presents an improved algorithm for the minimum convex hull of planar scattered point set. It adopts approach that dividing the point set into several sub regions to get an initial convex hull boundary firstly. Then the points on the boundary, which cannot be vertices of the minimum convex hull, are removed one by one. Finally the concave points on the boundary, which cannot be vertices of the minimum convex hull, are withdrew. Experimental analysis shows the efficiency of the algorithm compared with other methods.

  10. Nonparametric estimation of a convex bathtub-shaped hazard function.

    Science.gov (United States)

    Jankowski, Hanna K; Wellner, Jon A

    2009-11-01

    In this paper, we study the nonparametric maximum likelihood estimator (MLE) of a convex hazard function. We show that the MLE is consistent and converges at a local rate of n(2/5) at points x(0) where the true hazard function is positive and strictly convex. Moreover, we establish the pointwise asymptotic distribution theory of our estimator under these same assumptions. One notable feature of the nonparametric MLE studied here is that no arbitrary choice of tuning parameter (or complicated data-adaptive selection of the tuning parameter) is required.

  11. Convex Four Body Central Configurations with Some Equal Masses

    CERN Document Server

    Perez-Chavela, Ernest

    2009-01-01

    We prove that there is a unique convex non-collinear central configuration of the planar Newtonian four-body problem when two equal masses are located at opposite vertices of a quadrilateral and, at most, only one of the remaining masses is larger than the equal masses. Such central configuration posses a symmetry line and it is a kite shaped quadrilateral. We also show that there is exactly one convex non-collinear central configuration when the opposite masses are equal. Such central configuration also posses a symmetry line and it is a rhombus.

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

    DEFF Research Database (Denmark)

    Stolpe, Mathias

    2008-01-01

    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.......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...

  13. Finding Convex Hulls Using Quickhull on the GPU

    CERN Document Server

    Tzeng, Stanley

    2012-01-01

    We present a convex hull algorithm that is accelerated on commodity graphics hardware. We analyze and identify the hurdles of writing a recursive divide and conquer algorithm on the GPU and divise a framework for representing this class of problems. Our framework transforms the recursive splitting step into a permutation step that is well-suited for graphics hardware. Our convex hull algorithm of choice is Quickhull. Our parallel Quickhull implementation (for both 2D and 3D cases) achieves an order of magnitude speedup over standard computational geometry libraries.

  14. Convexity and the "Pythagorean" metric of space(-time)

    CERN Document Server

    Kalogeropoulos, Nikos

    2016-01-01

    We address the question about 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 providing the kinematic framework for the statistical or quantum treatments of gravity. We rely on particular moduli of convexity and smoothness which are extremized by Hilbert spaces. In the spirit of the variational principles employed in classical and quantum Physics, such Hilbert spaces dominate in a functional integral approach. The "Pythagorean" metric of space(-time) is then induced by such Hilbert spaces.

  15. 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 π.

  16. Convex Combination of Multiple Statistical Models with Application to VAD

    DEFF Research Database (Denmark)

    Petsatodis, Theodoros; Boukis, Christos; Talantzis, Fotios

    2011-01-01

    This paper proposes a robust Voice Activity Detector (VAD) based on the observation that the distribution of speech captured with far-field microphones is highly varying, depending on the noise and reverberation conditions. The proposed VAD employs a convex combination scheme comprising three...... statistical distributions - a Gaussian, a Laplacian, and a two-sided Gamma - to effectively model captured speech. This scheme shows increased ability to adapt to dynamic acoustic environments. The contribution of each distribution to this convex combination is automatically adjusted based on the statistical...

  17. Nonparametric Least Squares Estimation of a Multivariate Convex Regression Function

    CERN Document Server

    Seijo, Emilio

    2010-01-01

    This paper deals with the consistency of the least squares estimator of a convex regression function when the predictor is multidimensional. We characterize and discuss the computation of such an estimator via the solution of certain quadratic and linear programs. Mild sufficient conditions for the consistency of this estimator and its subdifferentials in fixed and stochastic design regression settings are provided. We also consider a regression function which is known to be convex and componentwise nonincreasing and discuss the characterization, computation and consistency of its least squares estimator.

  18. Closedness type regularity conditions in convex optimization and beyond

    Directory of Open Access Journals (Sweden)

    Sorin-Mihai Grad

    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.

  19. 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....

  20. SXI Prototype mirror mount

    Science.gov (United States)

    1995-01-01

    This final report describes the work performed from June 1993 to January 1995. The purpose of this contract was to provide optomechanical engineering and fabrication support to the Solar X-ray Imager (SXI) program in the areas of mirror, optical bench and camera assemblies of the telescope. The Center for Applied Optics (CAO) worked closely with the Optics and S&E technical staff of MSFC to develop and investigate the most viable and economical options for the design and fabrication of a number of parts for the various telescope assemblies. All the tasks under this delivery order have been successfully completed within budget and schedule.

  1. Look Into the Mirror

    Institute of Scientific and Technical Information of China (English)

    夏文虹

    2007-01-01

    Look into the mirror. Who is that girl I see, staring strange back at me? Is it a true myself or someone I have never known? Who am I? Why am I in this world? What am I going to do? So many times I questioned myself. I could never find a perfect answer. Why do I have to do such a lot of hard work? Why must I have so many exams? Why do I always read and read, write and write? Don't tell me it is the very life. Don't tell me these should be my happiness.

  2. Eavesdropping with a Mirror

    Institute of Scientific and Technical Information of China (English)

    JENNIFER LIM

    1994-01-01

    It was a custom in Yidu that on New Year’s Eve, people eavesdropped outside other people’s homes with a bronze mirror hidden in the bosom after reciting a rhyme to it. People believed that what they had heard would often fortell good or bad luck. A family named Zheng once lived in Yidu. The two sons of this family were both considered intellectuals, But the older son was eager to learn while the younger was lazy and sluggish. Their parents only liked the older son. Because of this, the old couple’s attitudes toward their two daughters-in-law were also

  3. Complex/Symplectic Mirrors

    Energy Technology Data Exchange (ETDEWEB)

    Chuang, Wu-yen; Kachru, Shamit; /Stanford U., ITP /SLAC; Tomasiello, Alessandro; /Stanford U., ITP

    2005-10-28

    We construct a class of symplectic non-Kaehler and complex non-Kaehler string theory vacua, extending and providing evidence for an earlier suggestion by Polchinski and Strominger. The class admits a mirror pairing by construction. Comparing hints from a variety of sources, including ten-dimensional supergravity and KK reduction on SU(3)-structure manifolds, suggests a picture in which string theory extends Reid's fantasy to connect classes of both complex non-Kaehler and symplectic non-Kaehler manifolds.

  4. Mirror symmetry II

    CERN Document Server

    Greene, Brian R

    1997-01-01

    Mirror symmetry has undergone dramatic progress during the last five years. Tremendous insight has been gained on a number of key issues. This volume surveys these results. Some of the contributions in this work have appeared elsewhere, while others were written specifically for this collection. The areas covered are organized into 4 sections, and each presents papers by both physicists and mathematicians. This volume collects the most important developments that have taken place in mathematical physics since 1991. It is an essential reference tool for both mathematics and physics libraries and for students of physics and mathematics.

  5. Ronchi test for flat mirrors

    Energy Technology Data Exchange (ETDEWEB)

    Estrada, N. [Instituto de Fisica, Universidad Autonoma de San Luis Potosi (Mexico); Engelfried, J. [Instituto de Fisica, Universidad Autonoma de San Luis Potosi (Mexico)]. E-mail: jurgen@ifisica.uaslp.mx; Morelos, A. [Instituto de Fisica, Universidad Autonoma de San Luis Potosi (Mexico)

    2005-11-11

    One of the RICHes in the velocity spectrometers of the proposed CKM experiment requires a flat mirror, situated in the high intensity kaon beam. To reduce the interaction background for the experiment, this mirror has to be as thin as possible. First glass prototypes were produced in Mexico. To test the surface quality of these prototypes, we extended the Ronchi method so flat mirrors can also be tested. We present the methods and report on results of our measurements.

  6. Focusing Mirror with Tunable Eccentricity

    CERN Document Server

    Stürmer, Moritz; Brunne, Jens; Wallrabe, Ulrike

    2013-01-01

    We present a new kind of varifocal mirror with independently adjustable curvatures in the major directions. For actuation we use two stacked piezo bending actuators with crossed in-plane polarization. This mirror can be used for example as an off-axis focusing device with tunable focal length and compensation for a variable angle of incidence or for coma correction. We demonstrate the prototype of such a mirror and characterize the mechanical deflection, as well as the focusing capabilities.

  7. 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.

  8. First results of the two square meters multilayer glass composite mirror design proposed for the Cherenkov Telescope Array developed at INFN

    CERN Document Server

    Schultz, C; Lessio, L; Mariotti, M; Rando, R

    2015-01-01

    The Cherenkov Telescope Array (CTA) is a future ground-based gamma-ray astronomy detector that will consist of more than 100 Imaging Atmospheric Cherenkov Telescopes of different sizes. The total reflective surface of roughly 10 000 m$^2$ requires unprecedented technological efforts towards a cost-efficient production of light-weight and reliable mirror substrates at high production rate. We report on a new mirror concept proposed for CTA developed by INFN, which is based on the replication from a spherical convex mold under low pressure. The mirror substrate is an open structure design made by thin glass layers at the mirror's front and rear interspaced by steel cylinders. A first series of nominal size mirrors has been produced, for which we discuss the optical properties in terms of radius of curvature and focusing power.

  9. Mirror development for CTA

    Science.gov (United States)

    Förster, A.; Doro, M.; Brun, P.; Canestrari, R.; Chadwick, P.; Font, L.; Ghigo, M.; Lorenz, E.; Mariotti, M.; Michalowski, J.; Niemiec, J.; Pareschi, G.; Peyaud, B.; Seweryn, K.

    2009-08-01

    The Cherenkov Telescope Array (CTA), currently in its early design phase, is a proposed new project for groundbased gamma-ray astronomy with at least 10 times higher sensitivity than current instruments. CTA is planned to consist of several tens of large Imaging Atmospheric Cherenkov Telescopes (IACTs) with a combined reflective surface of up to 10,000 m2. The challenge for the future CTA array is to develop lightweight and cost efficient mirrors with high production rates, good longterm durability and adequate optical properties. The technologies currently under investigation comprise different methods of carbon fibre/epoxy based substrates, sandwich concepts with cold-slumped surfaces made of thin float glass and different structural materials like aluminum honeycomb, glass foam or PU foam inside, and aluminum sandwich structures with either diamond milled surfaces or reflective foils. The current status of the mirror development for CTA will be summarized together with investigations on the improvement of the reflective surfaces and their protection against degradation.

  10. A capacity scaling algorithm for convex cost submodular flows

    Energy Technology Data Exchange (ETDEWEB)

    Iwata, Satoru [Kyoto Univ. (Japan)

    1996-12-31

    This paper presents a scaling scheme for submodular functions. A small but strictly submodular function is added before scaling so that the resulting functions should be submodular. This scaling scheme leads to a weakly polynomial algorithm to solve minimum cost integral submodular flow problems with separable convex cost functions, provided that an oracle for exchange capacities are available.

  11. Bounds for Minkowski Billiard Trajectories in Convex Bodies

    CERN Document Server

    Artstein-Avidan, Shiri

    2011-01-01

    In this paper we use the Ekeland-Hofer-Zehnder symplectic capacity to provide several bounds and inequalities for the length of the shortest periodic billiard trajectory in a smooth convex body in ${\\mathbb R}^{n}$. Our results hold both for classical billiards, as well as for the more general case of Minkowski billiards.

  12. Schur convexity for a class of symmetric functions

    Institute of Scientific and Technical Information of China (English)

    2010-01-01

    The Schur convexity and concavity of a class of symmetric functions are discussed, and an open problem proposed by Guan in "Some properties of a class of symmetric functions" is answered. As consequences, some inequalities are established by use of the theory of majorization.

  13. Method for solving a convex integer programming problem

    OpenAIRE

    Stefanov, Stefan M.

    2003-01-01

    We consider a convex integer program which is a nonlinear version of the assignment problem. This problem is reformulated as an equivalent problem. An algorithm for solving the original problem is suggested which is based on solving the simple assignment problem via some of known algorithms.

  14. The Projection Neural Network for Solving Convex Nonlinear Programming

    Science.gov (United States)

    Yang, Yongqing; Xu, Xianyun

    In this paper, a projection neural network for solving convex optimization is investigated. Using Lyapunov stability theory and LaSalle invariance principle, the proposed network is showed to be globally stable and converge to exact optimal solution. Two examples show the effectiveness of the proposed neural network model.

  15. ON A GENERALIZED MODULUS OF CONVEXITY AND UNIFORM NORMAL STRUCTURE

    Institute of Scientific and Technical Information of China (English)

    Yang Changsen; Wang Fenghui

    2007-01-01

    In this article, the authors study a generalized modulus of convexity, δ(α)(∈).Certain related geometrical properties of this modulus are analyzed. Their main result is that Banach space X has uniform normal structure if there exists ∈, 0 ≤∈≤1, such that δ(α)(1 + ∈) > (1 - α)∈.

  16. Bounded cohomology with coefficients in uniformly convex Banach spaces

    OpenAIRE

    Bestvina, Mladen; Bromberg, Ken; Fujiwara, Koji

    2013-01-01

    We show that for acylindrically hyperbolic groups $\\Gamma$ (with no nontrivial finite normal subgroups) and arbitrary unitary representation $\\rho$ of $\\Gamma$ in a (nonzero) uniformly convex Banach space the vector space $H^2_b(\\Gamma;\\rho)$ is infinite dimensional. The result was known for the regular representations on $\\ell^p(\\Gamma)$ with $1

  17. Systematization of problems on ball estimates of a convex compactum

    Science.gov (United States)

    Dudov, S. I.

    2015-09-01

    We consider a class of finite-dimensional problems on the estimation of a convex compactum by a ball of an arbitrary norm in the form of extremal problems whose goal function is expressed via the function of the distance to the farthest point of the compactum and the function of the distance to the nearest point of the compactum or its complement. Special attention is devoted to the problem of estimating (approximating) a convex compactum by a ball of fixed radius in the Hausdorff metric. It is proved that this problem plays the role of the canonical problem: solutions of any problem in the class under consideration can be expressed via solutions of this problem for certain values of the radius. Based on studying and using the properties of solutions of this canonical problem, we obtain ranges of values of the radius in which the canonical problem expresses solutions of the problems on inscribed and circumscribed balls, the problem of uniform estimate by a ball in the Hausdorff metric, the problem of asphericity of a convex body, the problems of spherical shells of the least thickness and of the least volume for the boundary of a convex body. This makes it possible to arrange the problems in increasing order of the corresponding values of the radius. Bibliography: 34 titles.

  18. 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.

  19. On a convex combination of solutions to elliptic variational inequalities

    Directory of Open Access Journals (Sweden)

    Sergiu Aizicovici

    2007-02-01

    Full Text Available We consider continuous descent methods for the minimization of convex functions defined on a general Banach space. In our previous work we showed that most of them (in the sense of Baire category converged. In the present paper we show that convergent continuous descent methods are stable under small perturbations.

  20. QUASI-EQUILIBRIA IN MARKETS WITH NON-CONVEX PREFERENCES.

    Science.gov (United States)

    An upper bound is placed on social divergence from general equilibrium , due to non-convexity of the traders’ preference relations. Existence and significance of certain quasi-equilibria are investigated. If there is a sufficiently large number of traders in the market, the existence of a configuration arbitrarily close to equilibrium is demonstrated. (Author)

  1. The fundamental formulas for vertices of convex hull

    Directory of Open Access Journals (Sweden)

    Md. Kazi Salimullah

    2013-07-01

    Full Text Available This paper represents four formulas for solution of convex hull problem. It aims to analyze how many points are vertices out of total input points, how many vertices lie on a horizontal or vertical lines, position of vertices and number of vertices on lower and higher lines(horizontal or vertical.

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

    Directory of Open Access Journals (Sweden)

    José Oswaldo Cadenas

    Full Text Available 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.

  3. 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, ma...

  4. A subclass of close-to-convex functions

    Directory of Open Access Journals (Sweden)

    Zheng- Lv Zhang

    2013-03-01

    Full Text Available In this paper, we introduce and investigate an interesting subclass $\\mathcal {J}_\\alpha(h$ of analytic and close-to-convex function in the open unit disk D. several coefficient inequalities, growth, and distortion theorem for this class are proved. The various results presented here would generalize many know results.

  5. Parametric R-norm directed-divergence convex function

    Science.gov (United States)

    Garg, Dhanesh; Kumar, Satish

    2016-06-01

    In this paper, we define parametric R-norm directed-divergence convex function and discuss their special cases and prove some properties similar to Kullback-Leibler information measure. From R-norm divergence measure new information measures have also been derived and their relations with different measures of entropy have been obtained and give its application in industrial engineering.

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

    DEFF Research Database (Denmark)

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

    2017-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 prob...

  7. Approximation and polynomial convexity in several complex variables

    OpenAIRE

    Ölçücüoğlu, Büke; Olcucuoglu, Buke

    2009-01-01

    This thesis is a survey on selected topics in approximation theory. The topics use either the techniques from the theory of several complex variables or those that arise in the study of the subject. We also go through elementary theory of polynomially convex sets in complex analysis.

  8. 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...

  9. Stochastic level-value approximation for quadratic integer convex programming

    Institute of Scientific and Technical Information of China (English)

    PENG Zheng; WU Dong-hua

    2008-01-01

    We propose a stochastic level value approximation method for a quadratic integer convex minimizing problem in this paper. This method applies an importance sampling technique, and make use of the cross-entropy method to update the sample density functions. We also prove the asymptotic convergence of this algorithm, and re-port some numerical results to illuminate its effectiveness.

  10. Satisfying states of triangulations of a convex n-gon

    CERN Document Server

    Jiménez, Andrea; Loebl, Martin

    2009-01-01

    In this work we count the number of satisfying states of triangulations of a convex n-gon using the transfer matrix method. We show an exponential (in n) lower bound. We also give the exact formula for the number of satisfying states of a strip of triangles.

  11. The Existence Problem for Steiner Networks in Strictly Convex Domains

    Science.gov (United States)

    Freire, Alexandre

    2011-05-01

    We consider the existence problem for `Steiner networks' (trivalent graphs with 2 π/3 angles at each junction) in strictly convex domains, with `Neumann' boundary conditions. For each of the three possible combinatorial possibilities, sufficient conditions on the domain are derived for existence. In addition, in each case explicit examples of nonexistence are given.

  12. 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.

  13. On Certain Subclass of Meromorphic Close-to-Convex Functions

    Directory of Open Access Journals (Sweden)

    Goyal S.P.

    2013-05-01

    Full Text Available In this paper we introduce and investigate a certain subclass of functions which are analytic in the punctured unit disk and meromorphically close-to-convex. The sub-ordination property, inclusion relationship, coefficient inequalities, distortion theorem and a sufficient condition for our subclass of functions are derived. The results presented here would provide extensions of those given in earlier works.

  14. 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 a...

  15. Networked and Distributed Convex Optimization for Design, Estimation, and Verification

    Science.gov (United States)

    2009-10-01

    IEEE Transactions on Automatic Control . 3...to appear in IEEE Transactions on Automatic Control , October 2009. 7. S. Joshi and S. Boyd, “Subspaces that Minimize the Condition Number of a Matrix...Jitter,” IEEE Transactions on Automatic Control , 54(3):652-657, March 2009. 16. A. Magnani and S. Boyd, “Convex Piecewise-Linear

  16. Greedy vs. L1 convex optimization in sparse coding

    DEFF Research Database (Denmark)

    Ren, Huamin; Pan, Hong; Olsen, Søren Ingvor;

    2015-01-01

    , such as face and action recognition, a comparative study of codes in abnormal event detection is less studied and hence no conclusion is gained on the effect of codes in detecting abnormalities. We constrict our comparison in two types of the above L0-norm solutions: greedy algorithms and convex L1-norm...

  17. On the Coefficients Problem of Quasi-convex Mappings and Starlike Mapppings in Cn

    Institute of Scientific and Technical Information of China (English)

    LIUWei-xian; WANGYu-min

    2003-01-01

    Let Bn be the unit ball in Cn, we study quasi-convex mappings and starlike mappings on Bn.The upper bounds of second order item coefficients ofr quasi-convex mappings and starlike mappings are obtained.

  18. Some Hermite–Hadamard Type Inequalities for Geometrically Quasi-Convex Functions

    Indian Academy of Sciences (India)

    Feng Qi; Bo-Yan Xi

    2014-08-01

    In the paper, we introduce a new concept ‘geometrically quasi-convex function’ and establish some Hermite–Hadamard type inequalities for functions whose derivatives are of geometric quasi-convexity.

  19. High precision optical finishing of lightweight silicon carbide aspheric mirror

    Science.gov (United States)

    Kong, John; Young, Kevin

    2010-10-01

    Critical to the deployment of large surveillance optics into the space environment is the generation of high quality optics. Traditionally, aluminum, glass and beryllium have been used; however, silicon carbide becomes of increasing interest and availability due to its high strength. With the hardness of silicon carbide being similar to diamond, traditional polishing methods suffer from slow material removal rates, difficulty in achieving the desired figure and inherent risk of causing catastrophic damage to the lightweight structure. Rather than increasing structural capacity and mass of the substrate, our proprietary sub-aperture aspheric surface forming technology offers higher material removal rates (comparable to that of Zerodur or Fused Silica), a deterministic approach to achieving the desired figure while minimizing contact area and the resulting load on the optical structure. The technology performed on computer-controlled machines with motion control software providing precise and quick convergence of surface figure, as demonstrated by optically finishing lightweight silicon carbide aspheres. At the same time, it also offers the advantage of ideal pitch finish of low surface micro-roughness and low mid-spatial frequency error. This method provides a solution applicable to all common silicon carbide substrate materials, including substrates with CVD silicon carbide cladding, offered by major silicon carbide material suppliers. This paper discusses a demonstration mirror we polished using this novel technology. The mirror is a lightweight silicon carbide substrate with CVD silicon carbide cladding. It is a convex hyperbolic secondary mirror with 104mm diameter and approximately 20 microns aspheric departure from best-fit sphere. The mirror has been finished with surface irregularity of better than 1/50 wave RMS @632.8 nm and surface micro-roughness of under 2 angstroms RMS. The technology has the potential to be scaled up for manufacturing capabilities of

  20. Uniform convexity in every direction and normal structure of closed convex sets in locally convex spaces%局部凸空间的方向一致凸性和闭凸集的正规结构

    Institute of Scientific and Technical Information of China (English)

    武希琳; 国起

    2011-01-01

    Uniform convexity in every direction in locally convex spaces is introduced and several equivalent definitions are given.Every bounded closed convex set in a uniformly convex in every direction space is proved to have a normal structure.%引进了局部凸空间中方向一致凸的概念,给出了相关的几个等价定义,证明了方向一致凸的局部凸空间的任一有界闭凸集具有正规结构。

  1. Construction of convex solutions for the second type of Feigenbaum’s functional equations

    Institute of Scientific and Technical Information of China (English)

    2009-01-01

    In this paper, convex solutions for the second type of Feigenbaum’s equation f (x) = λ1 f (f (λx)), 0 < λ < 1, f (0) = 1, 0 f (x) 1, x ∈ [0, 1] are investigated. Using constructive methods, we discuss the existence and uniqueness of continuous convex solutions, C1-convex solutions and C2-convex solutions of the above equation.

  2. Polishing technique for beryllium mirror

    Science.gov (United States)

    Froechtenigt, J. F.

    1976-01-01

    Performance tests, accomplished by inserting entire X ray telescope and polished mirror into vacuum line 67 m long and taking photographs of an X ray resolution source, indicate that polishing increases mirror efficiency from 0.06 percent for X rays at 0.8 nm and increases resolution from 15 to 3.75 arc-seconds.

  3. APPROXIMATION OF CONVEX TYPE FUNCTION BY PARTIAL SUMS OF FOURIER SERIES

    Institute of Scientific and Technical Information of China (English)

    YuGuohua

    2004-01-01

    The concept of convex type function is introduced in this paper,from which a kind of convex-decomposition approach is proposed. As one of applications of this approach, the approximation of the convex type function by the partial sum of its Fourier series is investigated. Moreover,the order of approximation is described with the 2th continuous modulus.

  4. Curvature morphology of the mandibular dentition and the development of concave-convex vertical stripping instruments.

    Science.gov (United States)

    Ihlow, Dankmar; Kubein-Meesenburg, Dietmar; Hunze, Justus; Dathe, Henning; Planert, Jens; Schwestka-Polly, Rainer; Nägerl, Hans

    2002-07-01

    Radii for concave-convex vertical stripping instruments can be derived from measurements of the natural curvature morphology in the horizontal contact area of the mandibular dentition. The concave-convex adjustment of contacts in the anterior dental arch with a newly developed set of concave-convex stripping instruments should enable orthodontic crowding problems to be alleviated biomechanically.

  5. Mirroring patients – or not

    DEFF Research Database (Denmark)

    Davidsen, Annette Sofie; Fosgerau, Christina Fogtmann

    2015-01-01

    on studies of imitative behaviour within linguistics and psychology, we argue that interactional mirroring is an important aspect of displaying implicit mentalization. We aimed to explore if, and in that case how, mirroring is displayed by general practitioners (GPs) and psychiatrists in consultations...... with patients with depression. We wanted to see how implicit mentalizing unfolds in physician–patient interactions. Consultations were videorecorded and analysed within the framework of conversation analysis. GPs and psychiatrists differed substantially in their propensity to mirror body movements and verbal...... and acoustic features of speech. GPs mirrored their patients more than psychiatrists in all modalities and were more flexible in their interactional behaviour. Psychiatrists seemed more static, regardless of the emotionality displayed by patients. Implicitly mirroring and attuning to patients could signify...

  6. Resonance MEMS mirrors design considerations

    Science.gov (United States)

    Sourani, S.

    2010-02-01

    Resonance MEMS mirrors are widely used today for many applications such as barcode scanners and personalprojectors. bTendo manufactures Personal Projection Engines on two types of mirrors: 1. Resonance mirrors for horizontal scanning 2. Linear mirrors for vertical scanning In this lecture we will discuss the "Energy Balance" and start-up conditions for resonance mirrors. We will derive the conditions for start-up as well as the predicted curve of θ(v): (see manuscript for equation) We will show simulation results in the time domain that prove the validity of the last equation. Finite element simulation could be used to calculate the comb capacitance and to predict the performance of a new structure.

  7. Shell Separation for Mirror Replication

    Science.gov (United States)

    1999-01-01

    NASA's Space Optics Manufacturing Center has been working to expand our view of the universe via sophisticated new telescopes. The Optics Center's goal is to develop low-cost, advanced space optics technologies for the NASA program in the 21st century - including the long-term goal of imaging Earth-like planets in distant solar systems. To reduce the cost of mirror fabrication, Marshall Space Flight Center (MSFC) has developed replication techniques, the machinery, and materials to replicate electro-formed nickel mirrors. Optics replication uses reusable forms, called mandrels, to make telescope mirrors ready for final finishing. MSFC optical physicist Bill Jones monitors a device used to chill a mandrel, causing it to shrink and separate from the telescope mirror without deforming the mirror's precisely curved surface.

  8. Mirror man: a case of skilled deliberate mirror writing.

    Science.gov (United States)

    McIntosh, Robert D; De Lucia, Natascia; Della Sala, Sergio

    2014-01-01

    Mirror writing is a striking behaviour that is common in children and can reemerge in adults following brain damage. Skilled deliberate mirror writing has also been reported, but only anecdotally. We provide the first quantitative study of skilled deliberate mirror writing. K.B. can write forward or backward, vertically upright or inverted, with the hands acting alone or simultaneously. K.B. is predominantly left handed, but writes habitually with his right hand. Of his writing formats, his left hand mirror writing is by far the most similar in style to his normal handwriting. When writing bimanually, he performs better when his two hands make mirror-symmetrical movements to write opposite scripts than if they move in the same direction to write similar scripts. He has no special facility for reading mirrored text. These features are consistent with prior anecdotal cases and support a motor basis for K.B.'s ability, according to which his skilled mirror writing results from the left hand execution of a low-level motor program for a right hand abductive writing action. Our methods offer a novel framework for investigating the sharing of motor representations across effectors.

  9. The minimum-error discrimination via Helstrom family of ensembles and Convex Optimization

    CERN Document Server

    Jafarizadeh, M A; Aali, M

    2009-01-01

    Using the convex optimization method and Helstrom family of ensembles introduced in Ref. [1], we have discussed optimal ambiguous discrimination in qubit systems. We have analyzed the problem of the optimal discrimination of N known quantum states and have obtained maximum success probability and optimal measurement for N known quantum states with equiprobable prior probabilities and equidistant from center of the Bloch ball, not all of which are on the one half of the Bloch ball and all of the conjugate states are pure. An exact solution has also been given for arbitrary three known quantum states. The given examples which use our method include: 1. Diagonal N mixed states; 2. N equiprobable states and equidistant from center of the Bloch ball which their corresponding Bloch vectors are inclined at the equal angle from z axis; 3. Three mirror-symmetric states; 4. States that have been prepared with equal prior probabilities on vertices of a Platonic solid. Keywords: minimum-error discrimination, success prob...

  10. Production of the 4.26 m ZERODUR mirror blank for the Advanced Technology Solar telescope (ATST)

    Science.gov (United States)

    Jedamzik, Ralf; Werner, Thomas; Westerhoff, Thomas

    2014-07-01

    The Daniel K. Inouye Solar Telescope (DKIST, formerly the Advanced Technology Solar Telescope, ATST) will be the most powerful solar telescope in the world. It is currently being built by the Association of Universities for Research in Astronomy (AURA) in a height of 3000 m above sea level on the mountain Haleakala of Maui, Hawaii. The primary mirror blank of diameter 4.26 m is made of the extremely low thermal expansion glass ceramic ZERODUR® of SCHOTT AG Advanced Optics. The DKIST primary mirror design is extremely challenging. With a mirror thickness of only 78 to 85 mm it is the smallest thickness ever machined on a mirror of 4.26 m in diameter. Additionally the glassy ZERODUR® casting is one of the largest in size ever produced for a 4 m class ZERODUR® mirror blank. The off axis aspherical mirror surface required sophisticated grinding procedures to achieve the specified geometrical tolerance. The small thickness of about 80 mm required special measures during processing, lifting and transport. Additionally acid etch treatment was applied to the convex back-surface and the conical shaped outer diameter surface to improve the strength of the blank. This paper reports on the challenging tasks and the achievements on the material property and dimensional specification parameter during the production of the 4.26 m ZERODUR® primary mirror blank for AURA.

  11. Advanced Mirror & Modelling Technology Development

    Science.gov (United States)

    Effinger, Michael; Stahl, H. Philip; Abplanalp, Laura; Maffett, Steven; Egerman, Robert; Eng, Ron; Arnold, William; Mosier, Gary; Blaurock, Carl

    2014-01-01

    The 2020 Decadal technology survey is starting in 2018. Technology on the shelf at that time will help guide selection to future low risk and low cost missions. The Advanced Mirror Technology Development (AMTD) team has identified development priorities based on science goals and engineering requirements for Ultraviolet Optical near-Infrared (UVOIR) missions in order to contribute to the selection process. One key development identified was lightweight mirror fabrication and testing. A monolithic, stacked, deep core mirror was fused and replicated twice to achieve the desired radius of curvature. It was subsequently successfully polished and tested. A recently awarded second phase to the AMTD project will develop larger mirrors to demonstrate the lateral scaling of the deep core mirror technology. Another key development was rapid modeling for the mirror. One model focused on generating optical and structural model results in minutes instead of months. Many variables could be accounted for regarding the core, face plate and back structure details. A portion of a spacecraft model was also developed. The spacecraft model incorporated direct integration to transform optical path difference to Point Spread Function (PSF) and between PSF to modulation transfer function. The second phase to the project will take the results of the rapid mirror modeler and integrate them into the rapid spacecraft modeler.

  12. Convex half-quadratic criteria and interacting auxiliary variables for image restoration.

    Science.gov (United States)

    Idier, J

    2001-01-01

    This paper deals with convex half-quadratic criteria and associated minimization algorithms for the purpose of image restoration. It brings a number of original elements within a unified mathematical presentation based on convex duality. Firstly, the Geman and Yang's and Geman and Reynolds's constructions are revisited, with a view to establishing the convexity properties of the resulting half-quadratic augmented criteria, when the original nonquadratic criterion is already convex. Secondly, a family of convex Gibbsian energies that incorporate interacting auxiliary variables is revealed as a potentially fruitful extension of the Geman and Reynolds's construction.

  13. LSST primary/tertiary monolithic mirror

    Science.gov (United States)

    Sebag, J.; Gressler, W.; Liang, M.; Neill, D.; Araujo-Hauck, C.; Andrew, J.; Angeli, G.; Cho, M.; Claver, C.; Daruich, F.; Gessner, C.; Hileman, E.; Krabbendam, V.; Muller, G.; Poczulp, G.; Repp, R.; Wiecha, O.; Xin, B.; Kenagy, K.; Martin, H. M.; Tuell, M. T.; West, S. C.

    2016-08-01

    At the core of the Large Synoptic Survey Telescope (LSST) three-mirror optical design is the primary/tertiary (M1M3) mirror that combines these two large mirrors onto one monolithic substrate. The M1M3 mirror was spin cast and polished at the Steward Observatory Mirror Lab at The University of Arizona (formerly SOML, now the Richard F. Caris Mirror Lab at the University of Arizona (RFCML)). Final acceptance of the mirror occurred during the year 2015 and the mirror is now in storage while the mirror cell assembly is being fabricated. The M1M3 mirror will be tested at RFCML after integration with its mirror cell before being shipped to Chile.

  14. Tandem mirror and field-reversed mirror experiments

    Energy Technology Data Exchange (ETDEWEB)

    Coensgen, F.H.; Simonen, T.C.; Turner, W.C.

    1979-08-21

    This paper is largely devoted to tandem mirror and field-reversed mirror experiments at the Lawrence Livermore Laboratory (LLL), and briefly summarizes results of experiments in which field-reversal has been achieved. In the tandem experiment, high-energy, high-density plasmas (nearly identical to 2XIIB plasmas) are located at each end of a solenoid where plasma ions are electrostatically confined by the high positive poentials arising in the end plug plasma. End plug ions are magnetically confined, and electrons are electrostatically confined by the overall positive potential of the system. The field-reversed mirror reactor consists of several small field-reversed mirror plasmas linked together for economic reasons. In the LLL Beta II experiment, generation of a field-reversed plasma ring will be investigated using a high-energy plasma gun with a transverse radial magnetic field. This plasma will be further heated and sustained by injection of intense, high-energy neutral beams.

  15. A Generalized Construction of Calabi-Yau Models and Mirror Symmetry

    CERN Document Server

    Berglund, Per

    2016-01-01

    We extend the construction of Calabi-Yau manifolds to hypersurfaces in non-Fano toric varieties, requiring the use of certain Laurent defining polynomials, and explore the phases of the corresponding gauged linear sigma models. The associated non-reflexive and non-convex polytopes provide a generalization of Batyrev's original work, allowing us to construct novel pairs of mirror models. We showcase our proposal for this generalization by examining Calabi-Yau hypersurfaces in Hirzebruch n-folds, focusing on n=3,4 sequences, and outline the more general class of so-defined geometries.

  16. MIRROR MOVEMENT: A CASE REPORT

    Directory of Open Access Journals (Sweden)

    AA. Momen

    2008-11-01

    Full Text Available Mirror movement is an interesting but often overlooked neurological soft sign;these movements are described as simultaneous contralateral, involuntary, identical movements that accompany voluntary movements. This neurologic problem is very rarely seen in children; in familial cases there is a positive history of these movements in parents, diminishing with time. Here, we have presented the case of an 11-year old girl with mirror movements in her upper limbs which interfered with her hand writing. Her neurological examination revealed normal results. In this report, we have tried to explain some of the pathophysiologic mechanisms related to these abnormal movements.Keywords:Mirror Movements, Children, Soft neurologic sign

  17. Theta functions and mirror symmetry

    CERN Document Server

    Gross, Mark

    2012-01-01

    This is a survey covering aspects of varied work of the authors with Mohammed Abouzaid, Paul Hacking, and Sean Keel. While theta functions are traditionally canonical sections of ample line bundles on abelian varieties, we motivate, using mirror symmetry, the idea that theta functions exist in much greater generality. This suggestion originates with the work of the late Andrei Tyurin. We outline how to construct theta functions on the degenerations of varieties constructed in previous work of the authors, and then explain applications of this construction to homological mirror symmetry and constructions of broad classes of mirror varieties.

  18. Edificio Daily Mirror

    Directory of Open Access Journals (Sweden)

    Williams, Owen

    1963-07-01

    Full Text Available The building has 18 levels. The Press occupies the 4 basement floors. The ground floor is taken up with the entrance hall, and an indoor carriage way. A snack bar and the telephone operators are situated on the second floor. The production department and the medical services are located on the third storey, whilst the fourth is occupied by the offices and library. The fifth floor is the beginning of the higher section of the building. This floor and up to including the 11th floor are devoted to office space, except for the 10th storey, which contains the office apartments of the directors and the Council Chamber. Equipment related to various services of the building is housed on the 12th storey. Finally, this tall building constitutes a fine landmark in the London skyline. The Daily Mirror building is outstanding for the appropriate nature, the completeness and the quality of its installations, which thus provide the most widely read paper in the world with outstandingly efficient offices.Este edificio consta de 18 plantas. El cuerpo de Prensa se aloja en los cuatro sótanos; los vestíbulos de entrada y una calzada interior para vehículos se hallan en la planta baja; la primera alberga un snack-bar y centralita telefónica; la segunda, el departamento de producción y centro de asistencia médica, y la tercera, las oficinas y biblioteca principales. La cuarta planta señala el comienzo del bloque alto; esta planta, junto con las quinta, sexta, séptima, octava y décima, están dedicadas a oficinas. La novena contiene las oficinas-apartamentos de los directores y salas de Consejo, y la undécima, la maquinaria para las diversas instalaciones del edificio. La elevada torre constituye un grandioso hito de referencia en esta zona de Londres. El «Daily Mirror» se distingue por el acierto, número y perfección de sus instalaciones, que proporcionan, al periódico de mayor actualidad mundial, las más adecuadas y amplias oficinas modernas.

  19. Evanescent Wave Atomic Mirror

    Science.gov (United States)

    Ghezali, S.; Taleb, A.

    2008-09-01

    A research project at the "Laboratoire d'électronique quantique" consists in a theoretical study of the reflection and diffraction phenomena via an atomic mirror. This poster presents the principle of an atomic mirror. Many groups in the world have constructed this type of atom optics experiments such as in Paris-Orsay-Villetaneuse (France), Stanford-Gaithersburg (USA), Munich-Heidelberg (Germany), etc. A laser beam goes into a prism with an incidence bigger than the critical incidence. It undergoes a total reflection on the plane face of the prism and then exits. The transmitted resulting wave out of the prism is evanescent and repulsive as the frequency detuning of the laser beam compared to the atomic transition δ = ωL-ω0 is positive. The cold atomic sample interacts with this evanescent wave and undergoes one or more elastic bounces by passing into backward points in its trajectory because the atoms' kinetic energy (of the order of the μeV) is less than the maximum of the dipolar potential barrier ℏΩ2/Δ where Ω is the Rabi frequency [1]. In fact, the atoms are cooled and captured in a magneto-optical trap placed at a distance of the order of the cm above the prism surface. The dipolar potential with which interact the slow atoms is obtained for a two level atom in a case of a dipolar electric transition (D2 Rubidium transition at a wavelength of 780nm delivered by a Titane-Saphir laser between a fundamental state Jf = l/2 and an excited state Je = 3/2). This potential is corrected by an attractive Van der Waals term which varies as 1/z3 in the Lennard-Jones approximation (typical atomic distance of the order of λ0/2π where λ0 is the laser wavelength) and in 1/z4 if the distance between the atom and its image in the dielectric is big in front of λ0/2π. This last case is obtained in a quantum electrodynamic calculation by taking into account an orthornormal base [2]. We'll examine the role of spontaneous emission for which the rate is inversely

  20. On curves contained in convex subsets of the plane

    CERN Document Server

    Coppersmith, Don; Ravsky, Alex

    2012-01-01

    If K' and K are convex bodies of the plane such that K' is a subset of K then the perimeter of K' is not greater than the perimeter of K. We obtain the following generalization of this fact. Let K be a convex compact body of the plane with the perimeter p and the diameter d and r>1 be an integer. Let s be the smallest number such that for any curve of length greater than s contained in K there is a straight line intersecting the curve at least in r+1 different points. Then s=rp/2 if r is even and s=(r-1)p/2+d if r is odd.

  1. Efficiency Loss in a Cournot Oligopoly with Convex Market Demand

    CERN Document Server

    Tsitsiklis, John N

    2012-01-01

    We consider a Cournot oligopoly model where multiple suppliers (oligopolists) compete by choosing quantities. We compare the social welfare achieved at a Cournot equilibrium to the maximum possible, for the case where the inverse market demand function is convex. We establish a lower bound on the efficiency of Cournot equilibria in terms of a scalar parameter derived from the inverse demand function, namely, the ratio of the slope of the inverse demand function at the Cournot equilibrium to the average slope of the inverse demand function between the Cournot equilibrium and a social optimum. Also, for the case of a single, monopolistic, profit maximizing supplier, or of multiple suppliers who collude to maximize their total profit, we establish a similar but tighter lower bound on the efficiency of the resulting output. Our results provide nontrivial quantitative bounds on the loss of social welfare for several convex inverse demand functions that appear in the economics literature.

  2. Bouncing dynamics of impact droplets on the convex superhydrophobic surfaces

    Science.gov (United States)

    Shen, Yizhou; Liu, Senyun; Zhu, Chunling; Tao, Jie; Chen, Zhong; Tao, Haijun; Pan, Lei; Wang, Guanyu; Wang, Tao

    2017-05-01

    Bouncing dynamics of impact droplets on solid surfaces intensively appeal to researchers due to the importance in many industrial fields. Here, we found that droplets impacting onto dome convex superhydrophobic surfaces could rapidly bounce off with a 28.5% reduction in the contact time, compared with that on flat superhydrophobic surfaces. This is mainly determined by the retracting process of impact droplets. Under the action of dome convexity, the impact droplet gradually evolves into an annulus shape with a special hydrodynamic distribution. As a consequence, both the inner and external rims of the annulus shape droplet possess a higher retracting velocity under the actions of the inertia force and the surface energy change, respectively. Also, the numerical simulation provides a quantitative evidence to further verify the interpretation on the regimes behind the rapidly detached phenomenon of impact droplets.

  3. Fuzzy Clustering Using the Convex Hull as Geometrical Model

    Directory of Open Access Journals (Sweden)

    Luca Liparulo

    2015-01-01

    Full Text Available A new approach to fuzzy clustering is proposed in this paper. It aims to relax some constraints imposed by known algorithms using a generalized geometrical model for clusters that is based on the convex hull computation. A method is also proposed in order to determine suitable membership functions and hence to represent fuzzy clusters based on the adopted geometrical model. The convex hull is not only used at the end of clustering analysis for the geometric data interpretation but also used during the fuzzy data partitioning within an online sequential procedure in order to calculate the membership function. Consequently, a pure fuzzy clustering algorithm is obtained where clusters are fitted to the data distribution by means of the fuzzy membership of patterns to each cluster. The numerical results reported in the paper show the validity and the efficacy of the proposed approach with respect to other well-known clustering algorithms.

  4. 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.

  5. Intersection patterns of convex sets via simplicial complexes, a survey

    CERN Document Server

    Tancer, Martin

    2011-01-01

    The task of this survey is to present various results on intersection patterns of convex sets. One of main tools for studying intersection patterns is a point of view via simplicial complexes. We recall the definitions of so called $d$-representable, $d$-collapsible and $d$-Leray simplicial complexes which are very useful for this study. We study the differences among these notions and we also focus on computational complexity for recognizing them. A list of Helly-type theorems is presented in the survey and it is also discussed how (important) role play the above mentioned notions for the theorems. We also consider intersection patterns of good covers which generalize collections of convex sets (the sets may be `curvy'; however, their intersections cannot be too complicated). We mainly focus on new results.

  6. Memoryless Routing in Convex Subdivisions: Random Walks are Optimal

    CERN Document Server

    Chen, Dan; Dujmovic, Vida; Morin, Pat

    2009-01-01

    A memoryless routing algorithm is one in which the decision about the next edge on the route to a vertex t for a packet currently located at vertex v is made based only on the coordinates of v, t, and the neighbourhood, N(v), of v. The current paper explores the limitations of such algorithms by showing that, for any (randomized) memoryless routing algorithm A, there exists a convex subdivision on which A takes Omega(n^2) expected time to route a message between some pair of vertices. Since this lower bound is matched by a random walk, this result implies that the geometric information available in convex subdivisions is not helpful for this class of routing algorithms. The current paper also shows the existence of triangulations for which the Random-Compass algorithm proposed by Bose etal (2002,2004) requires 2^{\\Omega(n)} time to route between some pair of vertices.

  7. On the convex hull of symmetric stable processes

    CERN Document Server

    Kampf, Jürgen

    2010-01-01

    Let alpha \\in (1, 2] and X be an R^d-valued alpha-stable process with independent and symmetric components starting in 0. We consider the closure S_t of the path described by X on the interval [0, t] and its convex hull Z_t. The first result of this paper provides a formula for certain mean mixed volumes of Z_t and in particular for the expected first intrinsic volume of Z_t. The second result deals with the asymptotics of the expected volume of the stable sausage Z_t+B (where B is an arbitrary convex body with interior points) as t \\to 0.

  8. Delivering sound energy along an arbitrary convex trajectory.

    Science.gov (United States)

    Zhao, Sipei; Hu, Yuxiang; Lu, Jing; Qiu, Xiaojun; Cheng, Jianchun; Burnett, Ian

    2014-10-15

    Accelerating beams have attracted considerable research interest due to their peculiar properties and various applications. Although there have been numerous research on the generation and application of accelerating light beams, few results have been published on the generation of accelerating acoustic beams. Here we report on the experimental observation of accelerating acoustic beams along arbitrary convex trajectories. The desired trajectory is projected to the spatial phase profile on the boundary which is discretized and sampled spatially. The sound field distribution is formulated with the Green function and the integral equation method. Both the paraxial and the non-paraxial regimes are examined and observed in the experiments. The effect of obstacle scattering in the sound field is also investigated and the results demonstrate that the approach is robust against obstacle scattering. The realization of accelerating acoustic beams will have an impact on various applications where acoustic information and energy are required to be delivered along an arbitrary convex trajectory.

  9. Recognition of Graphs with Convex Quadratic Stability Number

    Science.gov (United States)

    Pacheco, Maria F.; Cardoso, Domingos M.

    2009-09-01

    A stable set of a graph is a set of mutually non-adjacent vertices. The determination of a maximum size stable set, which is called maximum stable set, and the determination of its size, which is called stability number, are central combinatorial optimization problems. However, given a nonnegative integer k, to determine if a graph G has a stable set of size k is NP-complete. In this paper we deal with graphs for which the stability number can be determined by solving a convex quadratic programming problem. Such graphs were introduced in [13] and are called graphs with convex-QP stability number. A few algorithmic techniques for the recognition of this type of graphs in particular families are presented.

  10. A Unified Fixed Point Theory in Generalized Convex Spaces

    Institute of Scientific and Technical Information of China (English)

    Sehie PARK

    2007-01-01

    Let β be the class of 'better' admissible multimaps due to the author.We introduce newconcepts of admissibility (in the sense of Klee) and of Klee approximability for subsets of G-convexuniform spaces and show that any compact closed multimap in β from a G-convex space into itselfwith the Klee approximable range has a fixed point.This new theorem contains a large number ofknown results on topological vector spaces or on various subclasses.of the class of admissible G-convexspaces.Such subclasses are those of C-spaces,sets of the Zima-Hadzic type,locally G-convex spaces,and LG-spaces.Mutual relations among those subclasses and some related results are added.

  11. 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.

  12. The -Curvature Images of Convex Bodies and -Projection Bodies

    Indian Academy of Sciences (India)

    Songjun Lv; Gangsong Leng

    2008-08-01

    Associated with the -curvature image defined by Lutwak, some inequalities for extended mixed -affine surface areas of convex bodies and the support functions of -projection bodies are established. As a natural extension of a result due to Lutwak, an -type affine isoperimetric inequality, whose special cases are -Busemann–Petty centroid inequality and -affine projection inequality, respectively, is established. Some -mixed volume inequalities involving -projection bodies are also established.

  13. A toolbox for robust PID controller tuning using convex optimization

    OpenAIRE

    Sadeghpour, Mehdi; de Oliveira, Vinicius; Karimi, Alireza

    2012-01-01

    A robust PID controller design toolbox for Matlab is presented in this paper. The design is based on linearizing or convexifying the conventional non-convex constraints on the classical robustness margins or H∞ constraints. Then the existing optimization solvers can be used to compute the controller parameters. The software can be used in a wide range of controller design problems, including multi-model systems and gain-scheduled controllers. The models can be parametric or non-parametric whi...

  14. A Partial Differential Equation for the Rank One Convex Envelope

    Science.gov (United States)

    Oberman, Adam M.; Ruan, Yuanlong

    2017-02-01

    A partial differential equation (PDE) for the rank one convex envelope is introduced. The existence and uniqueness of viscosity solutions to the PDE is established. Elliptic finite difference schemes are constructed and convergence of finite difference solutions to the viscosity solution of the PDE is proven. Computational results are presented and laminates are computed from the envelopes. Results include the Kohn-Strang example, the classical four gradient example, and an example with eight gradients which produces nontrivial laminates.

  15. Asymptotically nonexpansive mappings in uniformly convex hyperbolic spaces

    OpenAIRE

    Kohlenbach, Ulrich; Leuştean, Laurentiu

    2007-01-01

    This paper provides a fixed point theorem for asymptotically nonexpansive mappings in uniformly convex hyperbolic spaces as well as new effective results on the Krasnoselski-Mann iterations of such mappings. The latter were found using methods from logic and the paper continues a case study in the general program of extracting effective data from prima-facie ineffective proofs in the fixed point theory of such mappings.

  16. 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

  17. Non-differentiable multiobjective mixed symmetric duality under generalized convexity

    Directory of Open Access Journals (Sweden)

    Li Jueyou

    2011-01-01

    Full Text Available Abstract The objective of this paper is to obtain a mixed symmetric dual model for a class of non-differentiable multiobjective nonlinear programming problems where each of the objective functions contains a pair of support functions. Weak, strong and converse duality theorems are established for the model under some suitable assumptions of generalized convexity. Several special cases are also obtained. MS Classification: 90C32; 90C46.

  18. Design and Implementation of Convex Analysis of Mixtures Software Suite

    OpenAIRE

    Meng, Fan

    2012-01-01

    Various convex analysis of mixtures (CAM) based algorithms have been developed to address real world blind source separation (BSS) problems and proven to have good performances in previous papers. This thesis reported the implementation of a comprehensive software CAM-Java, which contains three different CAM based algorithms, CAM compartment modeling (CAM-CM), CAM non-negative independent component analysis (CAM-nICA), and CAM non-negative well-grounded component analysis (CAM-nWCA). The imp...

  19. 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.

  20. 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.

  1. Convex-Faced Combinatorially Regular Polyhedra of Small Genus

    Directory of Open Access Journals (Sweden)

    Jörg M. Wills

    2011-12-01

    Full Text Available Combinatorially regular polyhedra are polyhedral realizations (embeddings in Euclidean 3-space E3 of regular maps on (orientable closed compact surfaces. They are close analogues of the Platonic solids. A surface of genus g ≥ 2 admits only finitely many regular maps, and generally only a small number of them can be realized as polyhedra with convex faces. When the genus g is small, meaning that g is in the historically motivated range 2 ≤ g ≤ 6, only eight regular maps of genus g are known to have polyhedral realizations, two discovered quite recently. These include spectacular convex-faced polyhedra realizing famous maps of Klein, Fricke, Dyck, and Coxeter. We provide supporting evidence that this list is complete; in other words, we strongly conjecture that in addition to those eight there are no other regular maps of genus g, with 2 ≤ g ≤ 6, admitting realizations as convex-faced polyhedra in E3. For all admissible maps in this range, save Gordan’s map of genus 4, and its dual, we rule out realizability by a polyhedron in E3.

  2. 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:...

  3. Multi-class DTI Segmentation: A Convex Approach.

    Science.gov (United States)

    Xie, Yuchen; Chen, Ting; Ho, Jeffrey; Vemuri, Baba C

    2012-10-01

    In this paper, we propose a novel variational framework for multi-class DTI segmentation based on global convex optimization. The existing variational approaches to the DTI segmentation problem have mainly used gradient-descent type optimization techniques which are slow in convergence and sensitive to the initialization. This paper on the other hand provides a new perspective on the often difficult optimization problem in DTI segmentation by providing a reasonably tight convex approximation (relaxation) of the original problem, and the relaxed convex problem can then be efficiently solved using various methods such as primal-dual type algorithms. To the best of our knowledge, such a DTI segmentation technique has never been reported in literature. We also show that a variety of tensor metrics (similarity measures) can be easily incorporated in the proposed framework. Experimental results on both synthetic and real diffusion tensor images clearly demonstrate the advantages of our method in terms of segmentation accuracy and robustness. In particular, when compared with existing state-of-the-art methods, our results demonstrate convincingly the importance as well as the benefit of using more refined and elaborated optimization method in diffusion tensor MR image segmentation.

  4. A Faster Algorithm for Quasi-convex Integer Polynomial Optimization

    CERN Document Server

    Hildebrand, Robert

    2010-01-01

    We present a faster exponential-time algorithm for integer optimization over quasi-convex polynomials. We study the minimization of a quasi-convex polynomial subject to s quasi-convex polynomial constraints and integrality constraints for all variables. The new algorithm is an improvement upon the best known algorithm due to Heinz (Journal of Complexity, 2005). A lower time complexity is reached through applying a stronger ellipsoid rounding method and applying a recent advancement in the shortest vector problem to give a smaller exponential-time complexity of a Lenstra-type algorithm. For the bounded case, our algorithm attains a time-complexity of s (r l M d)^{O(1)} 2^{2n\\log_2(n) + O(n)} when M is a bound on the number of monomials in each polynomial and r is the binary encoding length of a bound on the feasible region. In the general case, s l^{O(1)} d^{O(n)} 2^{2n\\log_2(n)}. In each we assume d>=2 is a bound on the total degree of the polynomials and l bounds the maximum binary encoding size of the input...

  5. Gauss images of hyperbolic cusps with convex polyhedral boundary

    CERN Document Server

    Fillastre, François

    2009-01-01

    We prove that a 3--dimensional hyperbolic cusp with convex polyhedral boundary is uniquely determined by its Gauss image. Furthermore, any spherical metric on the torus with cone singularities of negative curvature and all closed contractible geodesics of length greater than $2\\pi$ is the metric of the Gauss image of some convex polyhedral cusp. This result is an analog of the Rivin-Hodgson theorem characterizing compact convex hyperbolic polyhedra in terms of their Gauss images. The proof uses a variational method. Namely, a cusp with a given Gauss image is identified with a critical point of a functional on the space of cusps with cone-type singularities along a family of half-lines. The functional is shown to be concave and to attain maximum at an interior point of its domain. As a byproduct, we prove rigidity statements with respect to the Gauss image for cusps with or without cone-type singularities. In a special case, our theorem is equivalent to existence of a circle pattern on the torus, with prescrib...

  6. Constrained spacecraft reorientation using mixed integer convex programming

    Science.gov (United States)

    Tam, Margaret; Glenn Lightsey, E.

    2016-10-01

    A constrained attitude guidance (CAG) system is developed using convex optimization to autonomously achieve spacecraft pointing objectives while meeting the constraints imposed by on-board hardware. These constraints include bounds on the control input and slew rate, as well as pointing constraints imposed by the sensors. The pointing constraints consist of inclusion and exclusion cones that dictate permissible orientations of the spacecraft in order to keep objects in or out of the field of view of the sensors. The optimization scheme drives a body vector towards a target inertial vector along a trajectory that consists solely of permissible orientations in order to achieve the desired attitude for a given mission mode. The non-convex rotational kinematics are handled by discretization, which also ensures that the quaternion stays unity norm. In order to guarantee an admissible path, the pointing constraints are relaxed. Depending on how strict the pointing constraints are, the degree of relaxation is tuneable. The use of binary variables permits the inclusion of logical expressions in the pointing constraints in the case that a set of sensors has redundancies. The resulting mixed integer convex programming (MICP) formulation generates a steering law that can be easily integrated into an attitude determination and control (ADC) system. A sample simulation of the system is performed for the Bevo-2 satellite, including disturbance torques and actuator dynamics which are not modeled by the controller. Simulation results demonstrate the robustness of the system to disturbances while meeting the mission requirements with desirable performance characteristics.

  7. Responder fast steering mirror

    Science.gov (United States)

    Bullard, Andrew; Shawki, Islam

    2013-10-01

    Raytheon Space and Airborne Systems (SAS) has designed, built and tested a 3.3-inch diameter fast steering mirror (FSM) for space application. This 2-axis FSM operates over a large angle (over 10 degree range), has a very high servo bandwidth (over 3.3 Khz closed loop bandwidth), has nanoradian-class noise, and is designed to support microradian class line of sight accuracy. The FSM maintains excellent performance over large temperature ranges (which includes wave front error) and has very high reliability with the help of fully redundant angle sensors and actuator circuits. The FSM is capable of achieving all its design requirements while also being reaction-compensated. The reaction compensation is achieved passively and does not need a separate control loop. The FSM has undergone various environmental testing which include exported forces and torques and thermal vacuum testing that support the FSM design claims. This paper presents the mechanical design and test results of the mechanism which satisfies the rigorous vacuum and space application requirements.

  8. Tinbergen on mirror neurons.

    Science.gov (United States)

    Heyes, Cecilia

    2014-01-01

    Fifty years ago, Niko Tinbergen defined the scope of behavioural biology with his four problems: causation, ontogeny, survival value and evolution. About 20 years ago, there was another highly significant development in behavioural biology-the discovery of mirror neurons (MNs). Here, I use Tinbergen's original four problems (rather than the list that appears in textbooks) to highlight the differences between two prominent accounts of MNs, the genetic and associative accounts; to suggest that the latter provides the defeasible 'best explanation' for current data on the causation and ontogeny of MNs; and to argue that functional analysis, of the kind that Tinbergen identified somewhat misleadingly with studies of 'survival value', should be a high priority for future research. In this kind of functional analysis, system-level theories would assign MNs a small, but potentially important, role in the achievement of action understanding-or another social cognitive function-by a production line of interacting component processes. These theories would be tested by experimental intervention in human and non-human animal samples with carefully documented and controlled developmental histories.

  9. Advanced Mirror Material System Project

    Data.gov (United States)

    National Aeronautics and Space Administration — Peregrine will bring together recent laboratory developments and mature the technology so that complete mirror and telescope assemblies can be reliably and robustly...

  10. Autism: Lost in the Mirror?

    Directory of Open Access Journals (Sweden)

    Alison Barry

    2015-01-01

    Full Text Available When I began my training as an analyst I took up a placement in an early intervention centre for autistic pre-scholars. The school was run on the psychological principles of ABA and children were tutored on a reward system promoting positive behaviors. Whilst working there I noticed that a number of children had a particular fascination for their mirrored image. This fascination was pervasive and many children would do their work primarily for the reward of the mirror. Through the lens of psychoanalysis I found this very interesting and Lacan’s Mirror Phase immediately came to mind and with this it bore the question as to whether or not there was something in the Mirror Phase of development that had an impact on what we see as symptoms of Autism.

  11. Fast Picometer Mirror Mount Project

    Data.gov (United States)

    National Aeronautics and Space Administration — The proposed innovation is a 6DOF controllable mirror mount with high dynamic range and fast tip/tilt capability for space based applications. It will enable the...

  12. Reflections on a Black Mirror

    CERN Document Server

    Good, Michael R R

    2016-01-01

    A black mirror is an accelerated boundary that produces particles in an exact correspondence to an evaporating black hole. We investigate the spectral dynamics of the particle creation during the formation process.

  13. Dielectric Coatings for IACT Mirrors

    CERN Document Server

    Förster, A; Chadwick, P; Held, M

    2013-01-01

    Imaging Atmospheric Cherenkov Telescopes for very-high energy gamma-ray astronomy need mirror with high reflectance roughly in the wavelength between 300 and 550 nm. The current standard reflective layer of such mirrors is aluminum. Being permanently exposed to the environment they show a constant degradation over the years. New and improved dielectric coatings have been developed to enhance their resistance to environmental impact and to extend their possible lifetime. In addition, these customized coatings have an increased reflectance of over 95% and are designed to significantly lower the night-sky background contribution. The development of such coatings for mirrors with areas up to 2 m2 and low application temperatures to suite the composite materials used for the new mirror susbtrates of the Cherenkov Telescope Array (CTA) and the results of extensive durability tests are presented.

  14. Triangulation Algorithm Based on Empty Convex Set Condition

    Directory of Open Access Journals (Sweden)

    Klyachin Vladimir Aleksandrovich

    2015-11-01

    Full Text Available The article is devoted to generalization of Delaunay triangulation. We suggest to consider empty condition for special convex sets. For given finite set P ⊂ Rn we shall say that empty condition for convex set B ⊂ Rn is fullfiled if P ∩ B = P ∩ ∂B. Let Φ = Φα, α ∈ A be a family of compact convex sets with non empty inner. Consider some nondegenerate simplex S ⊂ Rn with vertexes p0,...,pn. We define the girth set B(S ∈ Φ if qi ∈ ∂B(S, i = 0, 1, ..., n. We suppose that the family Φ has the property: for arbitrary nondegenerate simplex S there is only one the girth set B(S. We prove the following main result. Theorem 1. If the family Φ = Φα, α ∈ A of convex sets have the pointed above property then for the girth sets it is true: 1. The set B(S is uniquely determined by any simplex with vertexes on ∂B(S. 2. Let S1, S2 be two nondegenerate simplexes such that B(S1 ≠ B(S2. If the intersection B(S1 ∩ B(S2 is not empty, then the intersection of boundaries B(S1, B(S2 is (n − 2-dimensional convex surface, lying in some hyperplane. 3. If two simplexes S1 and S2 don’t intersect by inner points and have common (n − 1-dimensional face G and A, B are vertexes don’t belong to face G and vertex B of simplex B(S2 such that B ∉ B(S1 then B(S2 does not contain the vertex A of simplex S1. These statements allow us to define Φ-triangulation correctly by the following way. The given triangulation T of finite set P ⊂ Rn is called Φ-triangulation if for all simlex S ∈ T the girth set B(S ∈ Φ is empty. In the paper we give algorithm for construct Φ-triangulation arbitrary finite set P ⊂ Rn. Besides we describe examples of families Φ for which we prove the existence and uniqueness of girth set B(S for arbitrary nondegenerate simplex S.

  15. Polymer glazing for silver mirrors

    Energy Technology Data Exchange (ETDEWEB)

    Neidlinger, H H; Schissel, P

    1985-07-01

    This paper reports on an evaluation and modification of polymeric glazings to protect silver mirrors. The mirrors were made using Corning 7809 glass as a substrate onto which a thin silver film is deposited. The modified polymeric films are then cast from solution onto the silver. The mirrors were characterized by measuring the hemispherical reflectance and the specular reflectance at 660 nm and selected acceptance angles (7.5 mrad or 3.5 mrad). The mirrors were exposed to environmental degradation using accelerated weathering devices and outdoor exposure. Empirical evidence has demonstrated that polymethylmethacrylate is a stable polymer in a terrestrial environment, but the polymer does not provide adequate protection for the silver reflector. The crucial role in degradation played by ultraviolet (uv) light is shown by several experimental results. It has been demonstrated that uv stabilizers added to the polymer improve the weatherability of mirrors. The relative effectiveness of different stabilizers will be discussed in terms of the weathering modes, retention of optical properties, and effectiveness of the additives. The process for silver deposition influences the reflectance of silver mirrors, and the optical properties depend on subtle relationships between the metallization and the dielectric (polymeric) films that are in contact with the silver.

  16. Calibration strategy of the pyramid wavefront sensor module of ERIS with the VLT deformable secondary mirror

    Science.gov (United States)

    Riccardi, A.; Briguglio, R.; Pinna, E.; Agapito, G.; Quiros-Pacheco, F.; Esposito, S.

    2012-07-01

    ERIS is a new Adaptive Optics Instrument for the Adaptive Optics Facility of the VLT that foresees, in its design phase, a Pyramid Wavefront Sensor Module (PWM) to be used with the VLT Deformable Secondary Mirror (VLT-DSM) as corrector. As opposite to the concave secondary mirrors currently in use (e.g. at LBT), VLT-DSM is convex and calibration of the interaction matrix (IM) between the PWM and the DSM is not foreseen on-telescope during day-time. In this paper different options of calibration are evaluated and compared with particular attention on the synthetic evaluation and on-sky calibration of the IM. A trade-off of the calibration options, the optimization techniques and the related validation with numerical simulations are also provided.

  17. Characterizing the convexity of the $n$--dimensional tropical simplex and the six convex classes in $\\R^3$

    CERN Document Server

    Jiménez, A

    2012-01-01

    An $n-1$--dimensional tropical simplex $\\TT_A$ is the set of points tropically spanned by $n$ points in $n-1$--dimensional space, when they are not contained in any tropical hyperplane. The coordinates of the points are written as the columns of an $n\\times n$ real matrix $A$. In theorem \\ref{thm:convexity}, we show that convexity of $\\TT_A$ is equivalent to normality and tropical idempotency of $A$. A description of $\\TT_A$ by $n(n-1)$ linear inequalities is immediate from $A$. Set $n=4$. We study \\textbf{tropical tetrahedra} which are \\textbf{convex} and \\textbf{maximal} (i.e., having the maximal number of extremal points, which is 20, and maximal number of facets, which is 12). By tropicality, the facets in $\\TT_A$ are $m$--gons, with $m=3,4,5,6$. In corollary \\ref{cor:no(0,0,12,0)ni(0,1,10,1)}, we show that a polyhedron $\\TT_A$ combinatorially equivalent to the regular dodecahedron does not occur, i.e., the polygon--vector $(f_3,f_4,f_5,f_6)$ of $\\TT_A$ (with $12=f_3+f_4+f_5+f_6$) cannot be $(0,0,12,0)$. ...

  18. Alignment Mirror Mechanisms for Space Use

    Science.gov (United States)

    Jau, Bruno M.; McKinney, Colin M.; Smythe, Robert F.; Palmer, Dean

    2011-01-01

    The paper describes an optical Alignment Mirror Mechanism (AMM), and discusses its control scheme. The mirror's angular positioning accuracy requirement is +/- 0.2 arc-sec. This requires the mirror's linear positioning actuators to have a positioning accuracy of +/- 109 nm to enable the mirror to meet the angular tip/tilt accuracy requirement. Demonstrated capabilities are +/- 35 nm linear positioning capability at the actuator, which translates into +/- 0.07 arc-sec angular mirror positioning accuracy.

  19. A new algorithm for computing the convex hull of a planar point set

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    When the edges of a convex polygon are traversed along one direction, the interior of the convex polygon is always on the same side of the edges. Based on this characteristic of convex polygons, a new algorithm for computing the convex hull of a simple polygon is proposed in this paper, which is then extended to a new algorithm for computing the convex hull of a planar point set. First, the extreme points of the planar point set are found, and the subsets of point candidate for vertex of the convex hull between extreme points are obtained. Then, the ordered convex hull point sequences between extreme points are constructed separately and concatenated by removing redundant extreme points to get the convex hull. The time complexity of the new planar convex hull algorithm is O(nlogh), which is equal to the time complexity of the best output-sensitive planar convex hull algorithms.Compared with the algorithm having the same complexity, the new algorithm is much faster.

  20. More questions for mirror neurons.

    Science.gov (United States)

    Borg, Emma

    2013-09-01

    The mirror neuron system is widely held to provide direct access to the motor goals of others. This paper critically investigates this idea, focusing on the so-called 'intentional worry'. I explore two answers to the intentional worry: first that the worry is premised on too limited an understanding of mirror neuron behaviour (Sections 2 and 3), second that the appeal made to mirror neurons can be refined in such a way as to avoid the worry (Section 4). I argue that the first response requires an account of the mechanism by which small-scale gestures are supposedly mapped to larger chains of actions but that none of the extant accounts of this mechanism are plausible. Section 4 then briefly examines refinements of the mirror neuron-mindreading hypothesis which avoid the intentional worry. I conclude that these refinements may well be plausible but that they undermine many of the claims standardly made for mirror neurons. Copyright © 2012 Elsevier Inc. All rights reserved.

  1. Metamaterial mirrors in optoelectronic devices

    KAUST Repository

    Esfandyarpour, Majid

    2014-06-22

    The phase reversal that occurs when light is reflected from a metallic mirror produces a standing wave with reduced intensity near the reflective surface. This effect is highly undesirable in optoelectronic devices that use metal films as both electrical contacts and optical mirrors, because it dictates a minimum spacing between the metal and the underlying active semiconductor layers, therefore posing a fundamental limit to the overall thickness of the device. Here, we show that this challenge can be circumvented by using a metamaterial mirror whose reflection phase is tunable from that of a perfect electric mirror († = €) to that of a perfect magnetic mirror († = 0). This tunability in reflection phase can also be exploited to optimize the standing wave profile in planar devices to maximize light-matter interaction. Specifically, we show that light absorption and photocurrent generation in a sub-100 nm active semiconductor layer of a model solar cell can be enhanced by ∼20% over a broad spectral band. © 2014 Macmillan Publishers Limited.

  2. PENGKLASIFIKASIAN DEBITUR DENGAN MENGGUNAKAN ALGORITMA GRAHAM SCAN DALAM PENGAPLIKASIAN CONVEX HULL

    Directory of Open Access Journals (Sweden)

    AGUS EKA ARIESTA

    2014-01-01

    Full Text Available Computational geometry is the mathematical science of computation by using the algorithm analysis to solve the problems of geometry. The problems of computational include polygon triangulations, convex hulls, Voronoi diagrams, and motion planning. Convex hull is the set of points that form a convex polygon that covers the entire set of points. The algorithms for determining the convex hull, among others, Graham Scan, Jarvis March, and Divide and Conquer. In the two-dimensional case, Graham Scan algorithm is highly efficient in the use of time complexity. This article discusses the quest convex hull of the data bank debtors, some of the data used to look at the classification accuracy of the convex hull formed. The coordinates of all the data found by using principal component analysis.After the data are analyzed, we get the accuracy of classification by 74%.

  3. Off-Grid DOA Estimation Based on Analysis of the Convexity of Maximum Likelihood Function

    Science.gov (United States)

    LIU, Liang; WEI, Ping; LIAO, Hong Shu

    Spatial compressive sensing (SCS) has recently been applied to direction-of-arrival (DOA) estimation owing to advantages over conventional ones. However the performance of compressive sensing (CS)-based estimation methods decreases when true DOAs are not exactly on the discretized sampling grid. We solve the off-grid DOA estimation problem using the deterministic maximum likelihood (DML) estimation method. In this work, we analyze the convexity of the DML function in the vicinity of the global solution. Especially under the condition of large array, we search for an approximately convex range around the ture DOAs to guarantee the DML function convex. Based on the convexity of the DML function, we propose a computationally efficient algorithm framework for off-grid DOA estimation. Numerical experiments show that the rough convex range accords well with the exact convex range of the DML function with large array and demonstrate the superior performance of the proposed methods in terms of accuracy, robustness and speed.

  4. 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.

  5. Fluctuations of collective coordinates and convexity theorems for energy surfaces

    CERN Document Server

    Giraud, B G; Sami, T

    2016-01-01

    Constrained energy minimizations of a many-body Hamiltonian return energy landscapes e(b) where b= representes the average value(s) of one (or several) collective operator(s), B, in an "optimized" trial state Phi_b, and e = is the average value of the Hamiltonian in this state Phi_b. It is natural to consider the uncertainty, Delta e, given that Phi_b usually belongs to a restricted set of trial states. However, we demonstrate that the uncertainty, Delta b, must also be considered, acknowledging corrections to theoretical models. We also find a link between fluctuations of collective coordinates and convexity properties of energy surfaces.

  6. Nonlinear Non-convex Optimization of Hydraulic Networks

    DEFF Research Database (Denmark)

    Tahavori, Maryamsadat; Kallesøe, Carsten; Leth, John-Josef

    2013-01-01

    Pressure management in water supply systems is an effective way to reduce the leakage in a system. In this paper, the pressure management and the reduction of power consumption of a water supply system is formulated as an optimization problem. The problem is to minimize the power consumption...... in pumps and also to regulate the pressure at the end-user valves to a desired value. The optimization problem which is solved is a nonlinear and non-convex optimization. The barrier method is used to solve this problem. The modeling framework and the optimization technique which are used are general...

  7. 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.

  8. Vector optimization and monotone operators via convex duality recent advances

    CERN Document Server

    Grad, Sorin-Mihai

    2014-01-01

    This book investigates several duality approaches for vector optimization problems, while also comparing them. Special attention is paid to duality for linear vector optimization problems, for which a vector dual that avoids the shortcomings of the classical ones is proposed. Moreover, the book addresses different efficiency concepts for vector optimization problems. Among the problems that appear when the framework is generalized by considering set-valued functions, an increasing interest is generated by those involving monotone operators, especially now that new methods for approaching them by means of convex analysis have been developed. Following this path, the book provides several results on different properties of sums of monotone operators.

  9. Probabilistic Guidance of Swarms using Sequential Convex Programming

    Science.gov (United States)

    2014-01-01

    as follows (for spacecraft j). Problem 2 (Convex Problem): min uj T−1∑ k=0 ‖uj [k]‖2∆t subject to (12) xj [k + 1] = Axj [k] + Buj [k], k = 0, . . . , T...k]‖2∆t1 + T−1∑ k=k0+TH ‖uj [k]‖2∆t2 (21) subject to xj [k + 1] = Axj [k] + Buj [k], k = k0, . . . , T − 1 (22) ‖uj [k]‖2 ≤ Umax, k = k0, . . . , T − 1

  10. PRECONDITIONED SPECTRAL PROJECTED GRADIENT METHOD ON CONVEX SETS

    Institute of Scientific and Technical Information of China (English)

    Lenys Bello; Marcos Raydan

    2005-01-01

    The spectral gradient method has proved to be effective for solving large-scale unconstrained optimization problems. It has been recently extended and combined with the projected gradient method for solving optimization problems on convex sets. This combination includes the use of nonmonotone line search techniques to preserve the fast local convergence. In this work we further extend the spectral choice of steplength to accept preconditioned directions when a good preconditioner is available. We present an algorithm that combines the spectral projected gradient method with preconditioning strategies to increase the local speed of convergence while keeping the global properties. We discuss implementation details for solving large-scale problems.

  11. Design of convex hull plate forming by pure line heating

    Institute of Scientific and Technical Information of China (English)

    ZHANG Xue-biao; JI Zhuo-shang; LIU Yu-jun

    2004-01-01

    This paper presents a ship-hull plate forming way by pure line heating. The heating lines forming the required bending angle is determined by curvature analysis method. Heating along the calculated heating lines results in bland plate with initial transverse curvature. Then, the plate with desired convex shape can be obtained by heating in the longitudinal edge. This is the whole forming process by pure line heating. This paper presents a method of plane development for ship-hull plate with B-spline surface representation, and provides the shrinkage heating lines in the forming process. This forming way would facilitate temperature control and make plate forming automatically easy.

  12. Left ventricle segmentation in MRI via convex relaxed distribution matching.

    Science.gov (United States)

    Nambakhsh, Cyrus M S; Yuan, Jing; Punithakumar, Kumaradevan; Goela, Aashish; Rajchl, Martin; Peters, Terry M; Ayed, Ismail Ben

    2013-12-01

    A fundamental step in the diagnosis of cardiovascular diseases, automatic left ventricle (LV) segmentation in cardiac magnetic resonance images (MRIs) is still acknowledged to be a difficult problem. Most of the existing algorithms require either extensive training or intensive user inputs. This study investigates fast detection of the left ventricle (LV) endo- and epicardium surfaces in cardiac MRI via convex relaxation and distribution matching. The algorithm requires a single subject for training and a very simple user input, which amounts to a single point (mouse click) per target region (cavity or myocardium). It seeks cavity and myocardium regions within each 3D phase by optimizing two functionals, each containing two distribution-matching constraints: (1) a distance-based shape prior and (2) an intensity prior. Based on a global measure of similarity between distributions, the shape prior is intrinsically invariant with respect to translation and rotation. We further introduce a scale variable from which we derive a fixed-point equation (FPE), thereby achieving scale-invariance with only few fast computations. The proposed algorithm relaxes the need for costly pose estimation (or registration) procedures and large training sets, and can tolerate shape deformations, unlike template (or atlas) based priors. Our formulation leads to a challenging problem, which is not directly amenable to convex-optimization techniques. For each functional, we split the problem into a sequence of sub-problems, each of which can be solved exactly and globally via a convex relaxation and the augmented Lagrangian method. Unlike related graph-cut approaches, the proposed convex-relaxation solution can be parallelized to reduce substantially the computational time for 3D domains (or higher), extends directly to high dimensions, and does not have the grid-bias problem. Our parallelized implementation on a graphics processing unit (GPU) demonstrates that the proposed algorithm

  13. Optimal convex correcting procedures in problems of high dimension

    Science.gov (United States)

    Dokukin, A. A.; Senko, O. V.

    2011-09-01

    The properties of convex correcting procedures (CCPs) over sets of predictors are examined. It is shown that the minimization of the generalized error in a CCP is reduced to a quadratic programming problem. The conditions are studied under which a set of predictors cannot be reduced without degrading the accuracy of the corresponding optimal CCP. Experimental studies of the prognostic properties of CCPs for samples of one-dimensional linear regressions showed that CCP optimization can be an effective tool for regression variable selection.

  14. Sparse Signal Recovery from Quadratic Measurements via Convex Programming

    OpenAIRE

    Li, Xiaodong; Voroninski, Vladislav

    2012-01-01

    In this paper we consider a system of quadratic equations ||^2 = b_j, j = 1, ..., m, where x in R^n is unknown while normal random vectors z_j in R_n and quadratic measurements b_j in R are known. The system is assumed to be underdetermined, i.e., m < n. We prove that if there exists a sparse solution x, i.e., at most k components of x are non-zero, then by solving a convex optimization program, we can solve for x up to a multiplicative constant with high probability, provided that k

  15. Multi-Stage Convex Relaxation Methods for Machine Learning

    Science.gov (United States)

    2013-03-01

    relaxation with Lasso (L1 regularization), the multi-stage convex relaxation method can 3 Initialize v̂ = 1 Repeat the following two steps until convergence...observations using the following sparse regression method: ŵ = arg min w  1 n ‖Xw − y‖22 + λ d∑ j=1 g(|wj |)  , (9) where g(|wj |) is a...estimation problems. Statistical Science, 27:576–593, 2012. Tong Zhang. Some sharp performance bounds for least squares regression with L1

  16. Convexity of Spheres in a Manifold without Conjugate Points

    Indian Academy of Sciences (India)

    Akhil Ranjan; Hemangi Shah

    2002-11-01

    For a non-compact, complete and simply connected manifold without conjugate points, we prove that if the determinant of the second fundamental form of the geodesic spheres in is a radial function, then the geodesic spheres are convex. We also show that if is two or three dimensional and without conjugate points, then, at every point there exists a ray with no focal points on it relative to the initial point of the ray. The proofs use a result from the theory of vector bundles combined with the index lemma.

  17. Reconstructing Shapes with Guarantees by Unions of Convex Sets

    OpenAIRE

    Attali, Dominique; Lieutier, André

    2010-01-01

    33 pages; A simple way to reconstruct a shape $A$ from a sample $P$ is to output an $r$-offset $P + r B$, where $B$ designates the unit Euclidean ball centered at the origin. Recently, it has been proved that the output $P + r B$ is homotopy equivalent to the shape $A$, for a dense enough sample $P$ of $A$ and for a suitable value of the parameter $r$. In this paper, we extend this result and find convex sets $C$, besides the unit Euclidean ball $B$, for which $P + r C$ reconstructs the topol...

  18. Applications of fractional calculus to $ k $-uniformly starlike and $ k $-uniformly convex functions of order $ \\alpha $

    Directory of Open Access Journals (Sweden)

    Ajab Akbarally

    2007-06-01

    Full Text Available A new subclass of analytic functions $ k-SP_\\lambda(\\alpha $ is introduced by applying certain operators of fractional calculus to $k$-uniformly starlike and $ k $-uniformly convex functions of order $ \\alpha $. Some theorems on coefficient bounds and growth and distortion theorems for this subclass are found. The radii of close to convexity, starlikeness and convexity for this subclass is also derived.

  19. Shape Preserving Positive and Convex Data Visualization using Rational Bi-cubic Functions

    Directory of Open Access Journals (Sweden)

    Tahira Sumbal Shaikh

    2012-01-01

    Full Text Available This paper is concerned with the problem of positive and convex data visualization in the form of positive and convex surfaces. A rational bi-cubic partially blended function with eight free parameters in its description is introduced and applied to visualize the shape of positive data and convex data. The developed schemes in this paper have unique representations. Visual models of surfaces attain  smoothness.  

  20. Maximum matching by convex quadratic programming based o an adverse graph conjecture

    OpenAIRE

    Pacheco, Maria F.; Cardoso, Domingos Moreira; Luz, Carlos J.

    2012-01-01

    In this talk, we describe a procedure for determining a maximum stable set in a graph with convex-$QP$ stability number (which is a graph whose stability number can be determined by solving a convex quadratic programming problem) unless there is a subgraph for which neither the optimal value of the convex quadratic program nor the least adjacency eigenvalue changes when the neighborhood of any vertex is deleted. Such a graph is called adverse. Assuming the trueness of the adver...

  1. Collaborative Research: Further Developments in the Global Resolution of Convex Programs with Complementary Contraints

    Science.gov (United States)

    2014-10-31

    constrained quadratic program can be lifted to a convex conic optimization prob- lem. We have shown that a complementarity approach can be used to find sparse...students who were partially supported by this grant have graduated from RPI or UIUC: • Lijie Bai, On convex quadratic programs with complementarity...conferences and universities. In paper [A], we show that any quadratically constrained quadratic program is equivalent to a convex optimization problem

  2. Convex quadratic programming applied to the stability number of a graph

    OpenAIRE

    Pacheco, Maria F.; Cardoso, Domingos Moreira; Luz, Carlos J.

    2012-01-01

    We deal with graphs whose stability number can be determined by a convex quadratic program and describe algorithmic techniques for the determination of maximum stabe sets in such graphs (except there is an induced subgraph with least adjacency eigenvalue and optimal value of the convex quadratic program not changing if the neighbourhood of any vertex is deleted). Such a graph is called adverse. Assuming that every adverse graph has convex-QP stability number, an algorithm for the recognition ...

  3. Further Development in the Global Resolution of Convex Programs with Complementarity Constraints

    Science.gov (United States)

    2014-04-09

    variables, we have investigated the class of convex quadratic programs with complementarity constraints (QPCCs) and be- gun to explore the global...published; all are available from http://www.rpi. edu/~mitchj: • L. Bai, J.E. Mitchell, and J.S. Pang. On convex quadratic programs with linear...relationship of a pair of convex quadratic programs and on a logical Benders scheme, an extreme ray/point generation procedure is developed, which

  4. Topological recursion and mirror curves

    CERN Document Server

    Bouchard, Vincent

    2012-01-01

    We study the constant contributions to the free energies obtained through the topological recursion applied to the complex curves mirror to toric Calabi-Yau threefolds. We show that the recursion reproduces precisely the corresponding Gromov-Witten invariants, which can be encoded in powers of the MacMahon function. As a result, we extend the scope of the "remodeling conjecture" to the full free energies, including the constant contributions. In the process we study how the pair of pants decomposition of the mirror curves plays an important role in the topological recursion. We also show that the free energies are not, strictly speaking, symplectic invariants, and that the recursive construction of the free energies does not commute with certain limits of mirror curves.

  5. Metrology of IXO Mirror Segments

    Science.gov (United States)

    Chan, Kai-Wing

    2011-01-01

    For future x-ray astrophysics mission that demands optics with large throughput and excellent angular resolution, many telescope concepts build around assembling thin mirror segments in a Wolter I geometry, such as that originally proposed for the International X-ray Observatory. The arc-second resolution requirement posts unique challenges not just for fabrication, mounting but also for metrology of these mirror segments. In this paper, we shall discuss the metrology of these segments using normal incidence metrological method with interferometers and null lenses. We present results of the calibration of the metrology systems we are currently using, discuss their accuracy and address the precision in measuring near-cylindrical mirror segments and the stability of the measurements.

  6. Alpha Channeling in Mirror Machines

    Energy Technology Data Exchange (ETDEWEB)

    Fisch N.J.

    2005-10-19

    Because of their engineering simplicity, high-β, and steady-state operation, mirror machines and related open-trap machines such as gas dynamic traps, are an attractive concept for achieving controlled nuclear fusion. In these open-trap machines, the confinement occurs by means of magnetic mirroring, without the magnetic field lines closing upon themselves within the region of particle confinement. Unfortunately, these concepts have not achieved to date very spectacular laboratory results, and their reactor prospects are dimmed by the prospect of a low Q-factor, the ratio of fusion power produced to auxiliary power. Nonetheless, because of its engineering promise, over the years numerous improvements have been proposed to enhance the reactor prospects of mirror fusion, such as tandem designs, end-plugging, and electric potential barriers.

  7. A Generalization on Weighted Means and Convex Functions with respect to the Non-Newtonian Calculus

    Directory of Open Access Journals (Sweden)

    Uğur Kadak

    2016-01-01

    Full Text Available This paper is devoted to investigating some characteristic features of weighted means and convex functions in terms of the non-Newtonian calculus which is a self-contained system independent of any other system of calculus. It is shown that there are infinitely many such useful types of weighted means and convex functions depending on the choice of generating functions. Moreover, some relations between classical weighted mean and its non-Newtonian version are compared and discussed in a table. Also, some geometric interpretations of convex functions are presented with respect to the non-Newtonian slope. Finally, using multiplicative continuous convex functions we give an application.

  8. Blaschke-type conditions in unbounded domains, generalized convexity and applications in perturbation theory

    CERN Document Server

    Favorov, S

    2012-01-01

    We introduce a new geometric characteristic of compact sets on the plane called $r$-convexity, which fits nicely into the concept of generalized convexity and extends essentially the conventional convexity. For a class of subharmonic functions on unbounded domains with $r$-convex compact complement, with the growth governed by the distance to the boundary, we obtain the Blaschke--type condition for their Riesz' measures. The result is applied to the study of the convergence of the discrete spectrum for the Schatten-von Neumann perturbations.

  9. Harmonic Distortion in CMOS Current Mirrors

    DEFF Research Database (Denmark)

    Bruun, Erik

    1998-01-01

    One of the origins of harmonic distortion in CMOS current mirrors is the inevitable mismatch between the MOS transistors involved. In this paper we examine both single current mirrors and complementary class AB current mirrors and develop an analytical model for the mismatch induced harmonic...... distortion. This analytical model is verified through simulations and is used for a discussion of the impact of mismatch on harmonic distortion properties of CMOS current mirrors. It is found that distortion levels somewhat below 1% can be attained by carefully matching the mirror transistors but ultra low...... distortion is not achievable with CMOS current mirrors...

  10. Composite single crystal silicon scan mirror substrates Project

    Data.gov (United States)

    National Aeronautics and Space Administration — Single crystal silicon is a desirable mirror substrate for scan mirrors in space telescopes. As diameters of mirrors become larger, existing manufacturing...

  11. Deformable mirror with thermal actuators.

    Science.gov (United States)

    Vdovin, Gleb; Loktev, Mikhail

    2002-05-01

    Low-cost adaptive optics is applied in lasers, scientific instrumentation, ultrafast sciences, and ophthalmology. These applications demand that the deformable mirrors used be simple, inexpensive, reliable, and efficient. We report a novel type of ultralow-cost deformable mirror with thermal actuators. The device has a response time of ~5 s , an actuator stroke of ~6mum , and temporal stability of ~lambda/10 rms in the visible range and can be used for correction of rather large aberrations with slow-changing amplitude.

  12. NASA CONNECT: Algebra: Mirror, Mirror on the Universe

    Science.gov (United States)

    2000-01-01

    'Algebra: Mirror, Mirror on the Universe' is the last of seven programs in the 1999-2000 NASA CONNECT series. Produced by NASA Langley Research Center's Office of Education, NASA CONNECT is an award-winning series of instructional programs designed to enhance the teaching of math, science and technology concepts in grades 5-8. NASA CONNECT establishes the 'connection' between the mathematics, science, and technology concepts taught in the classroom and NASA research. Each program in the series supports the national mathematics, science, and technology standards; includes a resource-rich teacher guide; and uses a classroom experiment and web-based activity to complement and enhance the math, science, and technology concepts presented in the program. NASA CONNECT is FREE and the programs in the series are in the public domain. Visit our web site and register. http://connect.larc.nasa.gov In 'Algebra: Mirror, Mirror on the Universe', students will learn how algebra is used to explore the universe.

  13. Lightweight ZERODUR: Validation of Mirror Performance and Mirror Modeling Predictions

    Science.gov (United States)

    Hull, Tony; Stahl, H. Philip; Westerhoff, Thomas; Valente, Martin; Brooks, Thomas; Eng, Ron

    2017-01-01

    Upcoming spaceborne missions, both moderate and large in scale, require extreme dimensional stability while relying both upon established lightweight mirror materials, and also upon accurate modeling methods to predict performance under varying boundary conditions. We describe tests, recently performed at NASA's XRCF chambers and laboratories in Huntsville Alabama, during which a 1.2 m diameter, f/1.2988% lightweighted SCHOTT lightweighted ZERODUR(TradeMark) mirror was tested for thermal stability under static loads in steps down to 230K. Test results are compared to model predictions, based upon recently published data on ZERODUR(TradeMark). In addition to monitoring the mirror surface for thermal perturbations in XRCF Thermal Vacuum tests, static load gravity deformations have been measured and compared to model predictions. Also the Modal Response(dynamic disturbance) was measured and compared to model. We will discuss the fabrication approach and optomechanical design of the ZERODUR(TradeMark) mirror substrate by SCHOTT, its optical preparation for test by Arizona Optical Systems (AOS). Summarize the outcome of NASA's XRCF tests and model validations

  14. 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.

  15. Rationally convex sets on the unit sphere in ℂ2

    Science.gov (United States)

    Wermer, John

    2008-04-01

    Let X be a rationally convex compact subset of the unit sphere S in ℂ2, of three-dimensional measure zero. Denote by R( X) the uniform closure on X of the space of functions P/ Q, where P and Q are polynomials and Q≠0 on X. When does R( X)= C( X)? Our work makes use of the kernel function for the bar{δ}b operator on S, introduced by Henkin in [5] and builds on results obtained in Anderson Izzo Wermer [3]. We define a real-valued function ɛ X on the open unit ball int B, with ɛ X ( z, w) tending to 0 as ( z, w) tends to X. We give a growth condition on ɛ X ( z, w) as ( z, w) approaches X, and show that this condition is sufficient for R( X)= C( X) (Theorem 1.1). In Section 4, we consider a class of sets X which are limits of a family of Levi-flat hypersurfaces in int B. For each compact set Y in ℂ2, we denote the rationally convex hull of Y by widehat{Y}. A general reference is Rudin [8] or Aleksandrov [1].

  16. Zone diagrams in compact subsets of uniformly convex normed spaces

    CERN Document Server

    Kopecká, Eva; Reich, Simeon

    2010-01-01

    A zone diagram is a relatively new concept which has emerged in computational geometry and is related to Voronoi diagrams. Formally, it is a fixed point of a certain mapping, and neither its uniqueness nor its existence are obvious in advance. It has been studied by several authors, starting with T. Asano, J. Matousek and T. Tokuyama, who considered the Euclidean plane with singleton sites, and proved the existence and uniqueness of zone diagrams there. In the present paper we prove the existence of zone diagrams with respect to finitely many pairwise disjoint compact sites contained in a compact and convex subset of a uniformly convex normed space. The proof is based on the Schauder fixed point theorem, the Curtis-Schori theorem regarding the Hilbert cube, and on recent results concerning the characterization of Voronoi cells as a collection of line segments and their geometric stability with respect to small changes of the corresponding sites. Along the way we obtain the continuity of the Dom mapping as wel...

  17. Convex foundations for generalized MaxEnt models

    Science.gov (United States)

    Frongillo, Rafael; Reid, Mark D.

    2014-12-01

    We present an approach to maximum entropy models that highlights the convex geometry and duality of generalized exponential families (GEFs) and their connection to Bregman divergences. Using our framework, we are able to resolve a puzzling aspect of the bijection of Banerjee and coauthors between classical exponential families and what they call regular Bregman divergences. Their regularity condition rules out all but Bregman divergences generated from log-convex generators. We recover their bijection and show that a much broader class of divergences correspond to GEFs via two key observations: 1) Like classical exponential families, GEFs have a "cumulant" C whose subdifferential contains the mean: Eo˜pθ[φ(o)]∈∂C(θ) ; 2) Generalized relative entropy is a C-Bregman divergence between parameters: DF(pθ,pθ')= D C(θ,θ') , where DF becomes the KL divergence for F = -H. We also show that every incomplete market with cost function C can be expressed as a complete market, where the prices are constrained to be a GEF with cumulant C. This provides an entirely new interpretation of prediction markets, relating their design back to the principle of maximum entropy.

  18. Timecourse of mirror and counter-mirror effects measured with transcranial magnetic stimulation

    Science.gov (United States)

    Cavallo, Andrea; Heyes, Cecilia; Becchio, Cristina; Bird, Geoffrey

    2014-01-01

    The human mirror system has been the subject of much research over the past two decades, but little is known about the timecourse of mirror responses. In addition, it is unclear whether mirror and counter-mirror effects follow the same timecourse. We used single-pulse transcranial magnetic stimulation to investigate the timecourse of mirror and counter-mirror responses in the human brain. Experiment 1 demonstrated that mirror responses can be measured from around 200 ms after observed action onset. Experiment 2 demonstrated significant effects of counter-mirror sensorimotor training at all timepoints at which a mirror response was found in Experiment 1 (i.e. from 200 ms onward), indicating that mirror and counter-mirror responses follow the same timecourse. By suggesting similarly direct routes for mirror and counter-mirror responses, these results support the associative account of mirror neuron origins whereby mirror responses arise as a result of correlated sensorimotor experience during development. More generally, they contribute to theorizing regarding mirror neuron function by providing some constraints on how quickly mirror responses can influence social cognition. PMID:23709352

  19. [The ontogeny of the mirror neuron system].

    Science.gov (United States)

    Myowa-Yamakoshi, Masako

    2014-06-01

    Abstract Humans utilize the mirror neuron system to understand and predict others' actions. However, the ontogeny of the mirror neuron system remains unknown. Whether mirror neuron function is an innate trait or whether mirror neurons acquire their sensorimotor matching properties ontogenetically remains to be clarified. In this paper, I review the ontogenetic theory of the mirror neuron system. I then discuss the functioning of the mirror neuron system in the context of social cognitive abilities, which are unique to humans. Recently, some researchers argue that it is too early to interpret the function of mirror neurons as an understanding of the underlying psychological states of others. They imply that such functioning would require inferential cognitive processes that are known to involve areas outside the mirror neuron system. Filling in this missing link may be the key to elucidating the unique ability of humans to understand others' actions.

  20. MIRROR THERAPY: A REVIEW OF EVIDENCES

    Directory of Open Access Journals (Sweden)

    Aishath Najiha

    2015-06-01

    Full Text Available The aim of this review was to identify and summarize the existing evidences on mirror box therapy for the management of various musculoskeletal conditions. A systemic literature search was performed to identify studies concerning mirror therapy. The included journal articles were reviewed and assessed for its significance. Fifty one studies were identified and reviewed. Five different patient categories were studied: 24 studies focussed on mirror therapy after stroke, thirteen studies focussed on mirror therapy after an amputation, three studies focussed on mirror therapy with complex regional pain syndrome patients, two studies on mirror therapy for cerebral palsy and one study focussed on mirror therapy after a fracture. The articles reviewed showed a trend that mirror therapy is effective in stroke, phantom limb pain, complex regional pain syndrome, cerebral palsy and fracture rehabilitation.

  1. Mirror with thermally controlled radius of curvature

    Science.gov (United States)

    Neil, George R.; Shinn, Michelle D.

    2010-06-22

    A radius of curvature controlled mirror for controlling precisely the focal point of a laser beam or other light beam. The radius of curvature controlled mirror provides nearly spherical distortion of the mirror in response to differential expansion between the front and rear surfaces of the mirror. The radius of curvature controlled mirror compensates for changes in other optical components due to heating or other physical changes. The radius of curvature controlled mirror includes an arrangement for adjusting the temperature of the front surface and separately adjusting the temperature of the rear surface to control the radius of curvature. The temperature adjustment arrangements can include cooling channels within the mirror body or convection of a gas upon the surface of the mirror. A control system controls the differential expansion between the front and rear surfaces to achieve the desired radius of curvature.

  2. Tiny Mirrors Make TV Magic

    Institute of Scientific and Technical Information of China (English)

    杨仲言

    1994-01-01

    By mounting thousands of miniature mirrors atop a silicon chip, a Texas Instruments engineer has crafted a TV display technology that can produce brighter and larger pictures than ever before. Since their invention, televisions have relied on cathode-ray tubes for their displays. These generate images by spraying electrons onto the back of

  3. Midpoint locally uniformly convexity on locally convex spaces%关于局部凸空间的中点局部一致凸性

    Institute of Scientific and Technical Information of China (English)

    陈利国; 罗成

    2011-01-01

    The notions of(weakly) midpoint locally uniformly convexity on locally convex spaces are introduced.It is proved that the dual property between(weakly) midpoint locally uniformly convexity and(weakly) midpoint locally uniformly smoothness,and disscuss the relationship between them and other convexity.Corresponding notions and results in Banach space is generalized.%给出局部凸空间的(弱)中点局部一致凸性,证明了它与(弱)中点局部一致光滑性具有对偶性质,讨论它们与其它凸性之间的关系,推广了Banach空间相应概念和结果.

  4. Mounting and Alignment of IXO Mirror Segments

    Science.gov (United States)

    Chan, Kai-Wing; Zhang, William; Evans, Tyler; McClelland, Ryan; Hong, Melinda; Mazzarella, James; Saha, Timo; Jalota, Lalit; Olsen, Lawrence; Byron, Glenn

    2010-01-01

    A suspension-mounting scheme is developed for the IXO (International X-ray Observatory) mirror segments in which the figure of the mirror segment is preserved in each stage of mounting. The mirror, first fixed on a thermally compatible strongback, is subsequently transported, aligned and transferred onto its mirror housing. In this paper, we shall outline the requirement, approaches, and recent progress of the suspension mount processes.

  5. The Axisymmetric Tandem Mirror: A Magnetic Mirror Concept Game Changer Magnet Mirror Status Study Group

    Energy Technology Data Exchange (ETDEWEB)

    Simonen, T; Cohen, R; Correll, D; Fowler, K; Post, D; Berk, H; Horton, W; Hooper, E B; Fisch, N; Hassam, A; Baldwin, D; Pearlstein, D; Logan, G; Turner, B; Moir, R; Molvik, A; Ryutov, D; Ivanov, A A; Kesner, J; Cohen, B; McLean, H; Tamano, T; Tang, X Z; Imai, T

    2008-10-24

    Experimental results, theory and innovative ideas now point with increased confidence to the possibility of a Gas Dynamic Trap (GDT) neutron source which would be on the path to an attractively simple Axisymmetric Tandem Mirror (ATM) power plant. Although magnetic mirror research was terminated in the US 20 years ago, experiments continued in Japan (Gamma 10) and Russia (GDT), with a very small US effort. This research has now yielded data, increased understanding, and generated ideas resulting in the new concepts described here. Early mirror research was carried out with circular axisymmetric magnets. These plasmas were MHD unstable due to the unfavorable magnetic curvature near the mid-plane. Then the minimum-B concept emerged in which the field line curvature was everywhere favorable and the plasma was situated in a MHD stable magnetic well (70% average beta in 2XII-B). The Ioffe-bar or baseball-coil became the standard for over 40 years. In the 1980's, driven by success with minimum-B stabilization and the control of ion cyclotron instabilities in PR6 and 2XII-B, mirrors were viewed as a potentially attractive concept with near-term advantages as a lower Q neutron source for applications such as a hybrid fission fuel factory or toxic waste burner. However there are down sides to the minimum-B geometry: coil construction is complex; restraining magnetic forces limit field strength and mirror ratios. Furthermore, the magnetic field lines have geodesic curvature which introduces resonant and neoclassical radial transport as observed in early tandem mirror experiments. So what now leads us to think that simple axisymmetric mirror plasmas can be stable? The Russian GDT experiment achieves on-axis 60% beta by peaking of the kinetic plasma pressure near the mirror throat (where the curvature is favorable) to counter-balance the average unfavorable mid-plane curvature. Then a modest augmentation of plasma pressure in the expander results in stability. The GDT

  6. Mirror movements in progressive hemifacial atrophy

    OpenAIRE

    2015-01-01

    Mirror movements are simultaneous, involuntary, identical movements occurring during contralateral voluntary movements. These movements are considered as soft neurologic signs seen uncommonly in clinical practice. The mirror movements are described in various neurological disorders which include parkinsonism, cranio veretebral junction anamolies, and hemiplegic cerebral palsy. These movements are intriguing and can pose significant disability. However, no such observation regarding mirror mov...

  7. Through the looking-glass: mirror reading.

    Science.gov (United States)

    Duñabeitia, Jon Andoni; Molinaro, Nicola; Carreiras, Manuel

    2011-02-14

    At early stages of object identification we process correctly oriented and mirrored versions of an object similarly. However, in letter and word perception, such tolerance to mirror reversals is harmful for efficient reading. Do readers successfully develop blindness mechanisms for mirror-letters and words? We conducted two masked priming experiments while recording participants' electrophysiological brain responses to briefly presented primes including mirror-letters (Experiment 1) or to shortly presented mirror-words (Experiment 2). Results showed that the human visual word recognition system is not totally blind to mirror-letters and mirror-words, since the early stages of processing mirror-letters and mirror-words produced effects on target word recognition that were highly similar to the effects produced by identical primes (N250 component). In a posterior stage of processing (N400 epoch), the effect of mirror-letters and mirror-words was different from the effect of identical primes, even though reversed primes still elicited N400 priming effects different from unrelated primes. These results demonstrate that readers perceive mirror-letters and words as correct at initial stages of word recognition, and that the visual word recognition system's neural representation is grounded on basic principles that govern object perception.

  8. Light Weight Silicon Mirrors for Space Instrumentation

    Science.gov (United States)

    Bly, Vincent T.; Hill, Peter C.; Hagopian, John G.; Strojay, Carl R.; Miller, Timothy

    2012-01-01

    Each mirror is a monolithic structure from a single crystal of silicon. The mirrors are light weighted after the optical surface is ground and polished. Mirrors made during the initial phase of this work were typically 1/50 lambda or better (RMS at 633 n m)

  9. The mirror neuron system : New frontiers

    NARCIS (Netherlands)

    Keysers, Christian; Fadiga, Luciano

    2008-01-01

    Since the discovery of mirror neurons, much effort has been invested into Studying their location and properties in the human brain. Here we review these original findings and introduce the Main topics of this special issue of Social Neuroscience. What does the mirror system code? How is the mirror

  10. 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

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

    NARCIS (Netherlands)

    Fourie, Zacharias; Ozcan, Mutlu; Sandham, John

    2009-01-01

    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

  12. A simple randomised algorithm for convex optimisation - Application to two-stage stochastic programming.

    NARCIS (Netherlands)

    M. Dyer; R. Kannan; L. Stougie (Leen)

    2014-01-01

    htmlabstractWe consider maximising a concave function over a convex set by a simplerandomised algorithm. The strength of the algorithm is that it requires only approximatefunction evaluations for the concave function and a weak membership oraclefor the convex set. Under smoothness conditions on the

  13. A RANDOM FIXED POINT ITERATION FOR THREE RANDOM OPERATORS ON UNIFORMLY CONVEX BANACH SPACES

    Institute of Scientific and Technical Information of China (English)

    Binayak S. Choudhury

    2003-01-01

    In the present paper we introduce a random iteration scheme for three random operators defined on a closed and convex subset of a uniformly convex Banach space and prove its convergence to a common fixed point of three random operators. The result is also an extension of a known theorem in the corresponding non-random case.

  14. On Convex Hull of Orthogonal Scalar Spectral Functions of a Carleman Operator

    Directory of Open Access Journals (Sweden)

    S. M. Bahri

    2008-11-01

    Full Text Available In this paper we describe the closed convex hull of orthogonal resolvents of an abstract symmetric operator of defect indices (1; 1, then we study the convex hull of orthogonal spectral functions of a Carleman operator in the Hilbert space L^2(X;mu.

  15. Geometric Hardy inequalities for the sub-elliptic Laplacian on convex domains in the Heisenberg group

    Directory of Open Access Journals (Sweden)

    Simon Larson

    2016-04-01

    Full Text Available Abstract We prove geometric $$L^p$$ L p versions of Hardy’s inequality for the sub-elliptic Laplacian on convex domains $$\\Omega $$ Ω in the Heisenberg group $$\\mathbb {H}^n$$ H n , where convex is meant in the Euclidean sense. When $$p=2$$ p = 2 and $$\\Omega $$ Ω is the half-space given by $$\\langle \\xi , \

  16. 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.

  17. Hausdorff methods for approximating the convex Edgeworth-Pareto hull in integer problems with monotone objectives

    Science.gov (United States)

    Pospelov, A. I.

    2016-08-01

    Adaptive methods for the polyhedral approximation of the convex Edgeworth-Pareto hull in multiobjective monotone integer optimization problems are proposed and studied. For these methods, theoretical convergence rate estimates with respect to the number of vertices are obtained. The estimates coincide in order with those for filling and augmentation H-methods intended for the approximation of nonsmooth convex compact bodies.

  18. Inequalities of Hadamard Type for r-Convex Functions in Carnot Groups

    Institute of Scientific and Technical Information of China (English)

    Ming-bao Sun; Xiao-ping Yang

    2004-01-01

    For a Carnot group G,we establish the relationship between extended mean values and r-convex functions which is introduced in this paper,which is a class of inequalities of Hadamard type for r-convex function on G.

  19. 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

  20. Matrix convex functions with applications to weighted centers for semidefinite programming

    NARCIS (Netherlands)

    J. Brinkhuis (Jan); Z-Q. Luo; S. Zhang (Shuzhong)

    2005-01-01

    textabstractIn this paper, we develop various calculus rules for general smooth matrix-valued functions and for the class of matrix convex (or concave) functions first introduced by Loewner and Kraus in 1930s. Then we use these calculus rules and the matrix convex function -log X to study a new

  1. 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

  2. Homotopy formulas and ■-equation on local q- convex domains in Stein manifolds

    Institute of Scientific and Technical Information of China (English)

    钟同德

    1997-01-01

    The homotopy formulas of (r,s) differential forms and the solution of equation of type (r,s) on local q-convex domains in Stein manifolds are obtained.The homotopy formulas on local q-convex domains have important applications in uniform estimates of equation and holomorphic extension of CR-manifolds.

  3. Measures of Asymmetry Dual to Mean Minkowski Measures of Asymmetry for Convex Bo dies

    Institute of Scientific and Technical Information of China (English)

    Yao Dan; Guo Qi

    2016-01-01

    We introduce a family of measures (functions) of asymmetry for convex bodies and discuss their properties. It turns out that this family of measures shares many nice properties with the mean Minkowski measures. As the mean Minkowski measures describe the symmetry of lower dimensional sections of a convex body, these new measures describe the symmetry of lower dimensional orthogonal projections.

  4. 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 reg

  5. Global convergence of a non-convex Douglas-Rachford iteration

    CERN Document Server

    Artacho, Francisco J Aragón

    2012-01-01

    We establish a region of convergence for the proto-typical non-convex Douglas-Rachford iteration which finds a point on the intersection of a line and a circle. Previous work on the non-convex iteration [2] was only able to establish local convergence, and was ineffective in that no explicit region of convergence could be given.

  6. 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...

  7. 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...

  8. Nonlinear Non-convex Optimization of Hydraulic Networks

    DEFF Research Database (Denmark)

    Tahavori, Maryamsadat; Kallesøe, Carsten; Leth, John-Josef

    2013-01-01

    Pressure management in water supply systems is an effective way to reduce the leakage in a system. In this paper, the pressure management and the reduction of power consumption of a water supply system is formulated as an optimization problem. The problem is to minimize the power consumption...... in pumps and also to regulate the pressure at the end-user valves to a desired value. The optimization problem which is solved is a nonlinear and non-convex optimization. The barrier method is used to solve this problem. The modeling framework and the optimization technique which are used are general....... They can be used for a general hydraulic networks to optimize the leakage and energy consumption and to satisfy the demands at the end-users. The results in this paper show that the power consumption of the pumps is reduced....

  9. Optimal placement of convex polygons to maximize point containment

    Energy Technology Data Exchange (ETDEWEB)

    Dickerson, M. [Middlebury College, VT (United States); Scharstein, D. [Cornell Univ., Ithaca, NY (United States)

    1996-12-31

    Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of finding a placement of P that contains the maximum number of points in S. We allow both translation and rotation. Our algorithm is self-contained and utilizes the geometric properties of the containing regions in the parameter space of transformations. The algorithm requires O(nk{sup 2} m{sup 2} log(mk)) time and O(n + m) space, where k is the maximum number of points contained. This provides a linear improvement over the best previously known algorithm when k is large ({Theta}(n)) and a cubic improvement when k is small. We also show that the algorithm can be extended to solve bichromatic and general weighted variants of the problem.

  10. Sharp recovery bounds for convex deconvolution, with applications

    CERN Document Server

    McCoy, Michael B

    2012-01-01

    Deconvolution refers to the challenge of identifying two structured signals given only the sum of the two signals and prior information about their structures. A standard example is the problem of separating a signal that is sparse with respect to one basis from a signal that is sparse with respect to a second basis. Another familiar case is the problem of decomposing an observed matrix into a low-rank matrix plus a sparse matrix. This paper describes and analyzes a framework, based on convex optimization, for solving these deconvolution problems and many others. This work introduces a randomized signal model which ensures that the two structures are incoherent, i.e., generically oriented. For an observation from this model, the calculus of spherical integral geometry provides an exact formula that describes when the optimization problem will succeed (or fail) to deconvolve the two constituent signals with high probability. This approach identifies a summary statistic that reflects the complexity of a particu...

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

    KAUST Repository

    Ahn, Heekap

    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.

  12. 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.

  13. In-vivo evaluation of convex array synthetic aperture imaging

    DEFF Research Database (Denmark)

    Pedersen, Morten Høgholm; Gammelmark, Kim Løkke; Jensen, Jørgen Arendt

    2007-01-01

    This paper presents an in-vivo study of synthetic transmit aperture (STA) imaging in comparison to conventional imaging, evaluating whether STA imaging is feasible in-vivo, and whether the image quality obtained is comparable to traditional scanned imaging in terms of penetration depth, spatial...... resolution, contrast resolution, and artifacts. Acquisition was performed using our research scanner RASMUS and a 5.5 MHz convex array transducer. STA imaging was acquired using circular wave emulation by 33-element subapertures and a 20 us linear FM signal as excitation pulse. For conventional imaging a 64...... element aperture was used in transmit and receive with a 1.5 cycle sinusoid excitation pulse. Conventional and STA images were acquired interleaved ensuring that the exact same anatomical location was scanned. Image sequences were recorded in real-time and processed off-line. Seven male volunteers were...

  14. Hyperspectral image superresolution: An edge-preserving convex formulation

    CERN Document Server

    Simões, Miguel; Almeida, Luis B; Chanussot, Jocelyn

    2014-01-01

    Hyperspectral remote sensing images (HSIs) are characterized by having a low spatial resolution and a high spectral resolution, whereas multispectral images (MSIs) are characterized by low spectral and high spatial resolutions. These complementary characteristics have stimulated active research in the inference of images with high spatial and spectral resolutions from HSI-MSI pairs. In this paper, we formulate this data fusion problem as the minimization of a convex objective function containing two data-fitting terms and an edge-preserving regularizer. The data-fitting terms are quadratic and account for blur, different spatial resolutions, and additive noise; the regularizer, a form of vector Total Variation, promotes aligned discontinuities across the reconstructed hyperspectral bands. The optimization described above is rather hard, owing to its non-diagonalizable linear operators, to the non-quadratic and non-smooth nature of the regularizer, and to the very large size of the image to be inferred. We tac...

  15. Identification of community structure in networks with convex optimization

    CERN Document Server

    Hildebrand, Roland

    2008-01-01

    We reformulate the problem of modularity maximization over the set of partitions of a network as a conic optimization problem over the completely positive cone, converting it from a combinatorial optimization problem to a convex continuous one. A semidefinite relaxation of this conic program then allows to compute upper bounds on the maximum modularity of the network. Based on the solution of the corresponding semidefinite program, we design a randomized algorithm generating partitions of the network with suboptimal modularities. We apply this algorithm to several benchmark networks, demonstrating that it is competitive in accuracy with the best algorithms previously known. We use our method to provide the first proof of optimality of a partition for a real-world network.

  16. 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.

  17. Bankruptcy Problem Allocations and the Core of Convex Games

    Directory of Open Access Journals (Sweden)

    William Olvera-Lopez

    2014-01-01

    Full Text Available A well-known result related to bankruptcy problems establishes that a vector is a bankruptcy allocation if and only if it belongs to the core of the associated O’Neill’s bankruptcy game. In this paper we show that this game is precisely the unique TU-game based on convex functions that satisfies the previous result. In addition, given a bankruptcy problem, we show a way for constructing bankruptcy games such that the set of bankruptcy allocations is a subset of their core or their core is a subset of the set of bankruptcy allocations. Also, we show how these results can be applied for finding new bankruptcy solutions.

  18. Convexity at finite temperature and non-extensive thermodynamics

    Science.gov (United States)

    Alexandre, J.

    2016-09-01

    Assuming that tunnel effect between two degenerate bare minima occurs, in a scalar field theory at finite volume, this article studies the consequences for the effective potential, to all loop orders. Convexity is achieved only if the two bare minima are taken into account in the path integral, and a new derivation of the effective potential is given, in the large volume limit. The effective potential then has a universal form, it is suppressed by the space time volume, and does not feature spontaneous symmetry breaking as long as the volume is finite. The finite temperature analysis leads to surprising thermal properties, following from the non-extensive expression for the free energy. Although the physical relevance of these results is not clear, the potential application to ultra-light scalar particles is discussed.

  19. Convex optimization approach to the fusion of identity information

    Science.gov (United States)

    Li, Lingjie; Luo, Zhi-Quan; Wong, Kon M.; Bosse, Eloi

    1999-03-01

    We consider the problem of identity fusion for a multi- sensor target tracking system whereby sensors generate reports on the target identities. Since the sensor reports are typically fuzzy, 'incomplete' and inconsistent, the fusion approach based on the minimization of inconsistencies between the sensor reports by using a convex Quadratic Programming (QP) and linear programming (LP) formulation. In contrast to the Dempster-Shafer's evidential reasoning approach which suffers from exponentially growing completely, our approach is highly efficient. Moreover, our approach is capable of fusing 'ratio type' sensor reports, thus it is more general than the evidential reasoning theory. When the sensor reports are consistent, the solution generated by the new fusion method can be shown to converge to the true probability distribution. Simulation work shows that our method generates reasonable fusion results, and when only 'Subset type' sensor reports are presented, it produces fusion results similar to that obtained via the evidential reasoning theory.

  20. 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.

  1. Greedy vs. L1 Convex Optimization in Sparse Coding

    DEFF Research Database (Denmark)

    Ren, Huamin; Pan, Hong; Olsen, Søren Ingvor

    Sparse representation has been applied successfully in many image analysis applications, including abnormal event detection, in which a baseline is to learn a dictionary from the training data and detect anomalies from its sparse codes. During this procedure, sparse codes which can be achieved...... and action recognition, a comparative study of codes in abnormal event detection is less studied and hence no conclusion is gained on the effect of codes in detecting abnormalities. We constrict our comparison in two types of the above L0-norm solutions: greedy algorithms and convex L1-norm solutions....... Considering the property of abnormal event detection, i.e., only normal videos are used as training data due to practical reasons, effective codes in classification application may not perform well in abnormality detection. Therefore, we compare the sparse codes and comprehensively evaluate their performance...

  2. 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......-description problem. We finally present the contributions of the thesis. The remaining parts of the thesis consist of five research papers. The first paper addresses non-smooth first-order convex optimization and the trade-off between accuracy and smoothness of the approximating smooth function. The second and third...

  3. Convex preserving scattered data interpolation using bivariate C1 cubic splines

    Science.gov (United States)

    Lai, Ming-Jun

    2000-07-01

    We use bivariate C1 cubic splines to deal with convexity preserving scattered data interpolation problem. Using a necessary and sufficient condition on Bernstein-Bézier polynomials, we set the convexity-preserving interpolation problem into a quadratically constraint quadratic programming problem. We show the existence of convexity preserving interpolatory surfaces under certain conditions on the data. That is, under certain conditions on the data, there always exists a convexity preservation C1 cubic spline interpolation if the triangulation is refined sufficiently many times. We then replace the quadratical constrains by three linear constrains and formulate the problem into linearly constraint quadratic programming problems in order to be able to solve it easily. Certainly, the existence of convexity preserving interpolatory surfaces is equivalent to the feasibility of the linear constrains. We present a numerical experiment to test which of these three linear constraints performs the best.

  4. 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.

  5. Steps toward increasing Q in mirror systems

    Energy Technology Data Exchange (ETDEWEB)

    Post, R.F.

    1979-08-20

    Experiments such as the 2XIIB experiment at Livermore have established the ability of mirror systems to confine high temperature, high density plasmas at central beta values exceeding unity. Given these results the next tasks for the mirror approach are to explore means for increasing the energy gain factor Q and to scale up the plasma volume, both of these requirements deriving from economic constraints. This report discusses means for increasng Q, including recent improvements in the tandem mirror concept and design studies of the field-reversed mirror in the context of upcoming and proposed scaled-up mirror experiments.

  6. 局部凸空间的平均一致凸性的等价刻画%Average Local Uniform Convexity and Average Local Uniform Smoothness in Locally Convex Spaces

    Institute of Scientific and Technical Information of China (English)

    唐献秀; 林尤武; 吴建功

    2011-01-01

    给出局部凸空间平均一致凸性的一些等价刻画与某些凸性的关系.%We obtained some necessary and sufficient conditions for average uniform convexity in locally converx spaces.At the same time,we discussed the relationship between this convexity and some other convexity.

  7. [What mirror neurons have revealed: revisited].

    Science.gov (United States)

    Murata, Akira; Maeda, Kazutaka

    2014-06-01

    The first paper on mirror neurons was published in 1992. In the span of over two decades since then, much knowledge about the relationship between social cognitive function and the motor control system has been accumulated. Direct matching of visual actions and their corresponding motor representations is the most important functional property of mirror neuron. Many studies have emphasized intrinsic simulation as a core concept for mirror neurons. Mirror neurons are thought to play a role in social cognitive function. However, the function of mirror neurons in the macaque remains unclear, because such cognitive functions are limited or lacking in macaque monkeys. It is therefore important to discuss these neurons in the context of motor function. Rizzolatti and colleagues have stressed that the most important function of mirror neurons in macaques is recognition of actions performed by other individuals. I suggest that mirror neurons in the Macaque inferior pariental lobule might be correlated with body schema. In the parieto-premotor network, matching of corollary discharge and actual sensory feedback is an essential neuronal operation. Recently, neurons showing mirror properties were found in some cortical areas outside the mirror neuron system. The current work would revisit the outcomes of mirror neuron studies to discuss the function of mirror neurons in the monkey.

  8. Mirror neurons: their implications for group psychotherapy.

    Science.gov (United States)

    Schermer, Victor L

    2010-10-01

    Recently discovered mirror neurons in the motor cortex of the brain register the actions and intentions of both the organism and others in the environment. As such, they may play a significant role in social behavior and groups. This paper considers the potential implications of mirror neurons and related neural networks for group therapists, proposing that mirror neurons and mirror systems provide "hard-wired" support for the group therapist's belief in the centrality of relationships in the treatment process and exploring their value in accounting for group-as-a-whole phenomena. Mirror neurons further confirm the holistic, social nature of perception, action, and intention as distinct from a stimulus-response behaviorism. The implications of mirror neurons and mirroring processes for the group therapist role, interventions, and training are also discussed.

  9. Design of a rapidly cooled cryogenic mirror

    Science.gov (United States)

    Plummer, Ron; Hsu, Ike

    1993-01-01

    The paper discusses the design, analysis, and testing of a rapidly cooled beryllium cryogenic mirror, which is the primary mirror in the four-element optical system for the Long Wavelength Infrared Advanced Technology Seeker. The mirror is shown to meet the requirement of five minutes for cooling to cryogenic operating temperature; it also maintains its optical figure and vacuum integrity and meets the nuclear specification. Results of a detailed thermal analysis on the mirror showed that, using nitrogen gas at 80 K as coolant, the front face of the mirror can be cooled from an initial temperature of 300 K to less than 90 K within five minutes. In a vacuum chamber, using liquid nitrogen as coolant, the mirror can be cooled to 80 K within 1.5 min. The mirror is well thermally insulated, so that it can be maintained at less than its operating temperature for a long time without active cooling.

  10. Improved cylindrical mirror energy analyzer

    Science.gov (United States)

    Baranova, L. A.

    2017-03-01

    A study has been carried out of the electron-optical properties of improved design of the cylindrical mirror energy analyzer. Both external and internal electrodes of the analyzer are divided into three isolated parts, whereby the potentials on the individual parts can be regulated independently from each other. In symmetric operating mode at identical potentials on the side parts of the electrodes, a significant increase has been obtained in resolving power and light-gathering power of the analyzer compared to the standard design of the cylindrical mirror. In asymmetric operating mode, which is implemented in a linear potential distribution on the external electrode, the conditions have been found under which the linear dispersion of the analyzer increases several times.

  11. Spectral Theory and Mirror Symmetry

    CERN Document Server

    Marino, Marcos

    2015-01-01

    Recent developments in string theory have revealed a surprising connection between spectral theory and local mirror symmetry: it has been found that the quantization of mirror curves to toric Calabi-Yau threefolds leads to trace class operators, whose spectral properties are conjecturally encoded in the enumerative geometry of the Calabi-Yau. This leads to a new, infinite family of solvable spectral problems: the Fredholm determinants of these operators can be found explicitly in terms of Gromov-Witten invariants and their refinements; their spectrum is encoded in exact quantization conditions, and turns out to be determined by the vanishing of a quantum theta function. Conversely, the spectral theory of these operators provides a non-perturbative definition of topological string theory on toric Calabi-Yau threefolds. In particular, their integral kernels lead to matrix integral representations of the topological string partition function, which explain some number-theoretic properties of the periods. In this...

  12. ZERODUR for stress mirror polishing

    Science.gov (United States)

    Jedamzik, Ralf; Kunisch, Clemens; Westerhoff, Thomas

    2011-09-01

    Stress mirror polishing is considered as one of several polishing technologies for the generation of the aspherical shaped primary mirror segments of the thirty meter telescope (TMT). For stress mirror polishing it is essential to precisely know the elastic response of glass ceramic substrate materials under a given deformation load. In the past it was experimentally shown that glass ceramics do not respond instantaneously to loading and unloading conditions, this effect was called "delayed elasticity." Recently SCHOTT has shown that it is possible to use a model to predict the characteristic thermal expansion behaviour of individual ZERODUR® batches for a given temperature profile. A similar approach will be used to predict the delayed elastic behavior of ZERODUR® under time dependent loads. In this presentation the delayed elasticity effect of ZERODUR® is reviewed. The delayed elastic response of the material to load conditions is shown and discussed. First results of a model approach based on experimental results and tools that have been built up for the modelling of the delayed elasticity effect of ZERODUR® will be presented.

  13. Fixed points of reflections of compact convex sets and a characterization of state spaces of Jordan Banach algebras

    CERN Document Server

    Ayupov, Sh A

    2011-01-01

    In the present article we prove a fixed point theorem for reflections of compact convex sets and give a new characterization of state space of JB-algebras among compact convex sets. Namely they are exactly those compact convex sets which are strongly spectral and symmetric.

  14. AN INEQUALITY OF HOMOGENEOUS EXPANSION FOR BIHOLOMORPHIC QUASI-CONVEX MAPPINGS ON THE UNIT POLYDISK AND ITS APPLICATION

    Institute of Scientific and Technical Information of China (English)

    Liu Xiaosong; Liu Taishun

    2009-01-01

    In this article, the authors obtain an inequality of homogeneous expansion for f, where f is a quasi-convex mapping (including quasi-convex mapping of type A and quasi-convex mapping of type B) defined on the open unit polydisk in Cn. Meanwhile, the authors also investigate its application.

  15. Mirror agnosia and the mirrored-self misidentification delusion: a hypnotic analogue.

    Science.gov (United States)

    Connors, Michael H; Cox, Rochelle E; Barnier, Amanda J; Langdon, Robyn; Coltheart, Max

    2012-05-01

    Mirrored-self misidentification is the delusional belief that one's reflection in the mirror is a stranger. Current theories suggest that one pathway to the delusion is mirror agnosia (a deficit in which patients are unable to use mirror knowledge when interacting with mirrors). This study examined whether a hypnotic suggestion for mirror agnosia can recreate features of the delusion. Ten high hypnotisable participants were given either a suggestion to not understand mirrors or to see the mirror as a window. Participants were asked to look into a mirror and describe what they saw. Participants were tested on their understanding of mirrors and received a series of challenges. Participants then received a detailed postexperimental inquiry. Three of five participants given the suggestion to not understand mirrors reported seeing a stranger and maintained this belief when challenged. These participants also showed signs of mirror agnosia. No participants given the suggestion to see a window reported seeing a stranger. Results indicate that a hypnotic suggestion for mirror agnosia can be used to recreate the mirrored-self misidentification delusion. Factors influencing the effectiveness of hypnotic analogues of psychopathology, such as participants' expectations and interpretations, are discussed.

  16. Mirror Metrology Using Nano-Probe Supports

    Science.gov (United States)

    Robinson, David; Hong, Maoling; Byron, Glenn; McClelland, Ryan; Chan, Kai-Wing

    2012-01-01

    Thin, lightweight mirrors are needed for future x-ray space telescopes in order to increase x-ray collecting area while maintaining a reduced mass and volume capable of being launched on existing rockets. However, it is very difficult to determine the undistorted shape of such thin mirrors because the mounting of the mirror during measurement causes distortion. Traditional kinematic mounts have insufficient supports to control the distortion to measurable levels and prevent the mirror from vibrating during measurement. Over-constrained mounts (non-kinematic) result in an unknown force state causing mirror distortion that cannot be determined or analytically removed. In order to measure flexible mirrors, it is necessary to over-constrain the mirror. Over-constraint causes unknown distortions to be applied to the mirror. Even if a kinematic constraint system can be used, necessary imperfections in the kinematic assumption can lead to an unknown force state capable of distorting the mirror. Previously, thicker, stiffer, and heavier mirrors were used to achieve low optical figure distortion. These mirrors could be measured to an acceptable level of precision using traditional kinematic mounts. As lighter weight precision optics have developed, systems such as the whiffle tree or hydraulic supports have been used to provide additional mounting supports while maintaining the kinematic assumption. The purpose of this invention is to over-constrain a mirror for optical measurement without causing unacceptable or unknown distortions. The invention uses force gauges capable of measuring 1/10,000 of a Newton attached to nano-actuators to support a thin x-ray optic with known and controlled forces to allow for figure measurement and knowledge of the undeformed mirror figure. The mirror is hung from strings such that it is minimally distorted and in a known force state. However, the hanging mirror cannot be measured because it is both swinging and vibrating. In order to

  17. Mirror-Symmetric Matrices and Their Application

    Institute of Scientific and Technical Information of China (English)

    李国林; 冯正和

    2002-01-01

    The well-known centrosymmetric matrices correctly reflect mirror-symmetry with no component or only one component on the mirror plane. Mirror-symmetric matrices defined in this paper can represent mirror-symmetric structures with various components on the mirror plane. Some basic properties of mirror-symmetric matrices were studied and applied to interconnection analysis. A generalized odd/even-mode decomposition scheme was developed based on the mirror reflection relationship for mirror-symmetric multiconductor transmission lines (MTLs). The per-unit-length (PUL) impedance matrix Z and admittance matrix Y can be divided into odd-mode and even-mode PUL matrices. Thus the order of the MTL system is reduced from n to k and k+p, where p(≥0)is the conductor number on the mirror plane. The analysis of mirror-symmetric matrices is related to the theory of symmetric group, which is the most effective tool for the study of symmetry.

  18. Statistical Mechanics of Optimal Convex Inference in High Dimensions

    Science.gov (United States)

    Advani, Madhu; Ganguli, Surya

    2016-07-01

    A fundamental problem in modern high-dimensional data analysis involves efficiently inferring a set of P unknown model parameters governing the relationship between the inputs and outputs of N noisy measurements. Various methods have been proposed to regress the outputs against the inputs to recover the P parameters. What are fundamental limits on the accuracy of regression, given finite signal-to-noise ratios, limited measurements, prior information, and computational tractability requirements? How can we optimally combine prior information with measurements to achieve these limits? Classical statistics gives incisive answers to these questions as the measurement density α =(N /P )→∞ . However, these classical results are not relevant to modern high-dimensional inference problems, which instead occur at finite α . We employ replica theory to answer these questions for a class of inference algorithms, known in the statistics literature as M-estimators. These algorithms attempt to recover the P model parameters by solving an optimization problem involving minimizing the sum of a loss function that penalizes deviations between the data and model predictions, and a regularizer that leverages prior information about model parameters. Widely cherished algorithms like maximum likelihood (ML) and maximum-a posteriori (MAP) inference arise as special cases of M-estimators. Our analysis uncovers fundamental limits on the inference accuracy of a subclass of M-estimators corresponding to computationally tractable convex optimization problems. These limits generalize classical statistical theorems like the Cramer-Rao bound to the high-dimensional setting with prior information. We further discover the optimal M-estimator for log-concave signal and noise distributions; we demonstrate that it can achieve our high-dimensional limits on inference accuracy, while ML and MAP cannot. Intriguingly, in high dimensions, these optimal algorithms become computationally simpler than

  19. LR characterization of chirotopes of finite planar families of pairwise disjoint convex bodies

    OpenAIRE

    Habert, Luc; Pocchiola, Michel

    2011-01-01

    We extend the classical LR characterization of chirotopes of finite planar families of points to chirotopes of finite planar families of pairwise disjoint convex bodies: a map \\c{hi} on the set of 3-subsets of a finite set I is a chirotope of finite planar families of pairwise disjoint convex bodies if and only if for every 3-, 4-, and 5-subset J of I the restriction of \\c{hi} to the set of 3-subsets of J is a chirotope of finite planar families of pairwise disjoint convex bodies. Our main to...

  20. GENERALIZED VECTOR QUASI-EQUILIBRIUM PROBLEMS IN LOCALLY G-CONVEX SPACES

    Institute of Scientific and Technical Information of China (English)

    DING Xie-ping

    2005-01-01

    Some classes of generalized vector quasi-equilibrium problems (in short,GVQEP) are introduced and studied in locally G-convex spaces which includes most of generalized vector equilibrium problems, generalized vector variational inequality problems,quasi-equilibrium problems and quasi-variational inequality problems as special cases. First,an equilibrium existence theorem for one person games is proved in locally G-convex spaces.As applications, some new existence theorems of solutions for the GVQEP are established in noncompact locally G-convex spaces. These results and argument methods are new and completely different from that in recent literature.