WorldWideScience

Sample records for convex manifolds

  1. Strictly convex functions on complete Finsler manifolds

    Indian Academy of Sciences (India)

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

  2. Convex nonnegative matrix factorization with manifold regularization.

    Science.gov (United States)

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

    2015-03-01

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

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

  4. A Combination Theorem for Convex Hyperbolic Manifolds, with Applications to Surfaces in 3-Manifolds

    OpenAIRE

    Baker, Mark; Cooper, Daryl

    2005-01-01

    We prove the convex combination theorem for hyperbolic n-manifolds. Applications are given both in high dimensions and in 3 dimensions. One consequence is that given two geometrically finite subgroups of a discrete group of isometries of hyperbolic n-space, satisfying a natural condition on their parabolic subgroups, there are finite index subgroups which generate a subgroup that is an amalgamated free product. Constructions of infinite volume hyperbolic n-manifolds are described by gluing lo...

  5. Hermitian harmonic maps into convex balls

    International Nuclear Information System (INIS)

    Li Zhenyang; Xi Zhang

    2004-07-01

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

  6. Convexity Adjustments

    DEFF Research Database (Denmark)

    M. Gaspar, Raquel; Murgoci, Agatha

    2010-01-01

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

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

  8. Undergraduate Convexity

    DEFF Research Database (Denmark)

    Lauritzen, Niels

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

  9. Convex analysis

    CERN Document Server

    Rockafellar, Ralph Tyrell

    2015-01-01

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

  10. Undergraduate Convexity

    DEFF Research Database (Denmark)

    Lauritzen, Niels

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

  11. Convex surfaces

    CERN Document Server

    Busemann, Herbert

    2008-01-01

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

  12. Hyperspin manifolds

    International Nuclear Information System (INIS)

    Finkelstein, D.; Finkelstein, S.R.; Holm, C.

    1986-01-01

    Riemannian manifolds are but one of three ways to extrapolate from fourdimensional Minkowskian manifolds to spaces of higher dimension, and not the most plausible. If we take seriously a certain construction of time space from spinors, and replace the underlying binary spinors by N-ary hyperspinors with new ''internal'' components besides the usual two ''external'' ones, this leads to a second line, the hyperspin manifolds /sub n/ and their tangent spaces d/sub n/, different in structure and symmetry group from the Riemannian line, except that the binary spaces d 2 (Minkowski time space) and 2 (Minkowskian manifold) lie on both. d/sub n/ and /sub n/ have dimension n = N 2 . In hyperspin manifolds the energies of modes of motion multiply instead of adding their squares, and the N-ary chronometric form is not quadratic, but N-ic, with determinantal normal form. For the nine-dimensional ternary hyperspin manifold, we construct the trino, trine-Gordon, and trirac equations and their mass spectra in flat time space. It is possible that our four-dimensional time space sits in a hyperspin manifold rather than in a Kaluza-Klein Riemannian manifold. If so, then gauge quanta with spin-3 exist

  13. Smooth manifolds

    CERN Document Server

    Sinha, Rajnikant

    2014-01-01

    This book offers an introduction to the theory of smooth manifolds, helping students to familiarize themselves with the tools they will need for mathematical research on smooth manifolds and differential geometry. The book primarily focuses on topics concerning differential manifolds, tangent spaces, multivariable differential calculus, topological properties of smooth manifolds, embedded submanifolds, Sard’s theorem and Whitney embedding theorem. It is clearly structured, amply illustrated and includes solved examples for all concepts discussed. Several difficult theorems have been broken into many lemmas and notes (equivalent to sub-lemmas) to enhance the readability of the book. Further, once a concept has been introduced, it reoccurs throughout the book to ensure comprehension. Rank theorem, a vital aspect of smooth manifolds theory, occurs in many manifestations, including rank theorem for Euclidean space and global rank theorem. Though primarily intended for graduate students of mathematics, the book ...

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

  15. 3-manifolds

    CERN Document Server

    Hempel, John

    2004-01-01

    A careful and systematic development of the theory of the topology of 3-manifolds, focusing on the critical role of the fundamental group in determining the topological structure of a 3-manifold … self-contained … one can learn the subject from it … would be very appropriate as a text for an advanced graduate course or as a basis for a working seminar. -Mathematical Reviews For many years, John Hempel's book has been a standard text on the topology of 3-manifolds. Even though the field has grown tremendously, the book remains one of the best and most popular introductions to the subject. The t

  16. Pluripotential theory and convex bodies

    Science.gov (United States)

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

    2018-03-01

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

  17. Differential manifolds

    CERN Document Server

    Kosinski, Antoni A

    2007-01-01

    The concepts of differential topology form the center of many mathematical disciplines such as differential geometry and Lie group theory. Differential Manifolds presents to advanced undergraduates and graduate students the systematic study of the topological structure of smooth manifolds. Author Antoni A. Kosinski, Professor Emeritus of Mathematics at Rutgers University, offers an accessible approach to both the h-cobordism theorem and the classification of differential structures on spheres.""How useful it is,"" noted the Bulletin of the American Mathematical Society, ""to have a single, sho

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

  19. Convex Lattice Polygons

    Science.gov (United States)

    Scott, Paul

    2006-01-01

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

  20. Two-convex polygons

    OpenAIRE

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

    2009-01-01

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

  1. Complex manifolds

    CERN Document Server

    Morrow, James

    2006-01-01

    This book, a revision and organization of lectures given by Kodaira at Stanford University in 1965-66, is an excellent, well-written introduction to the study of abstract complex (analytic) manifolds-a subject that began in the late 1940's and early 1950's. It is largely self-contained, except for some standard results about elliptic partial differential equations, for which complete references are given. -D. C. Spencer, MathSciNet The book under review is the faithful reprint of the original edition of one of the most influential textbooks in modern complex analysis and geometry. The classic

  2. Analytic aspects of convexity

    CERN Document Server

    Colesanti, Andrea; Gronchi, Paolo

    2018-01-01

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

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

  4. Convexity and Marginal Vectors

    NARCIS (Netherlands)

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

    2002-01-01

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

  5. Convex Interval Games

    NARCIS (Netherlands)

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

    2008-01-01

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

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

  7. Stereotype locally convex spaces

    International Nuclear Information System (INIS)

    Akbarov, S S

    2000-01-01

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

  8. Stereotype locally convex spaces

    Energy Technology Data Exchange (ETDEWEB)

    Akbarov, S S

    2000-08-31

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

  9. Stereotype locally convex spaces

    Science.gov (United States)

    Akbarov, S. S.

    2000-08-01

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

  10. Generalized Convexity and Inequalities

    OpenAIRE

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

    2007-01-01

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

  11. Graded manifolds and supermanifolds

    International Nuclear Information System (INIS)

    Batchelor, M.

    1984-01-01

    In this paper, a review is presented on graded manifolds and supermanifolds. Many theorems, propositions, corrollaries, etc. are given with proofs or sketch proofs. Graded manifolds, supereuclidian space, Lie supergroups, etc. are dealt with

  12. Toric Vaisman manifolds

    Science.gov (United States)

    Pilca, Mihaela

    2016-09-01

    Vaisman manifolds are strongly related to Kähler and Sasaki geometry. In this paper we introduce toric Vaisman structures and show that this relationship still holds in the toric context. It is known that the so-called minimal covering of a Vaisman manifold is the Riemannian cone over a Sasaki manifold. We show that if a complete Vaisman manifold is toric, then the associated Sasaki manifold is also toric. Conversely, a toric complete Sasaki manifold, whose Kähler cone is equipped with an appropriate compatible action, gives rise to a toric Vaisman manifold. In the special case of a strongly regular compact Vaisman manifold, we show that it is toric if and only if the corresponding Kähler quotient is toric.

  13. Manifolds, Tensors, and Forms

    Science.gov (United States)

    Renteln, Paul

    2013-11-01

    Preface; 1. Linear algebra; 2. Multilinear algebra; 3. Differentiation on manifolds; 4. Homotopy and de Rham cohomology; 5. Elementary homology theory; 6. Integration on manifolds; 7. Vector bundles; 8. Geometric manifolds; 9. The degree of a smooth map; Appendixes; References; Index.

  14. Dynamic Planar Convex Hull

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølfting; Jacob, Rico

    2002-01-01

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

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

  16. Some Aspects of Convexity

    Indian Academy of Sciences (India)

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

  17. Introduction to differentiable manifolds

    CERN Document Server

    Auslander, Louis

    2009-01-01

    The first book to treat manifold theory at an introductory level, this text surveys basic concepts in the modern approach to differential geometry. The first six chapters define and illustrate differentiable manifolds, and the final four chapters investigate the roles of differential structures in a variety of situations.Starting with an introduction to differentiable manifolds and their tangent spaces, the text examines Euclidean spaces, their submanifolds, and abstract manifolds. Succeeding chapters explore the tangent bundle and vector fields and discuss their association with ordinary diff

  18. Convex Optimization in R

    Directory of Open Access Journals (Sweden)

    Roger Koenker

    2014-09-01

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

  19. Splitting Parabolic Manifolds

    OpenAIRE

    Kalka, Morris; Patrizio, Giorgio

    2014-01-01

    We study the geometric properties of complex manifolds possessing a pair of plurisubharmonic functions satisfying Monge-Amp\\`ere type of condition. The results are applied to characterize complex manifolds biholomorphic to $\\C^{N}$ viewed as a product of lower dimensional complex euclidean spaces.

  20. On convex complexity measures

    Czech Academy of Sciences Publication Activity Database

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

    2010-01-01

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

  1. Ensemble manifold regularization.

    Science.gov (United States)

    Geng, Bo; Tao, Dacheng; Xu, Chao; Yang, Linjun; Hua, Xian-Sheng

    2012-06-01

    We propose an automatic approximation of the intrinsic manifold for general semi-supervised learning (SSL) problems. Unfortunately, it is not trivial to define an optimization function to obtain optimal hyperparameters. Usually, cross validation is applied, but it does not necessarily scale up. Other problems derive from the suboptimality incurred by discrete grid search and the overfitting. Therefore, we develop an ensemble manifold regularization (EMR) framework to approximate the intrinsic manifold by combining several initial guesses. Algorithmically, we designed EMR carefully so it 1) learns both the composite manifold and the semi-supervised learner jointly, 2) is fully automatic for learning the intrinsic manifold hyperparameters implicitly, 3) is conditionally optimal for intrinsic manifold approximation under a mild and reasonable assumption, and 4) is scalable for a large number of candidate manifold hyperparameters, from both time and space perspectives. Furthermore, we prove the convergence property of EMR to the deterministic matrix at rate root-n. Extensive experiments over both synthetic and real data sets demonstrate the effectiveness of the proposed framework.

  2. Subordination by convex functions

    Directory of Open Access Journals (Sweden)

    Rosihan M. Ali

    2006-01-01

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

  3. Geometry of mirror manifolds

    International Nuclear Information System (INIS)

    Aspinwall, P.S.; Luetken, C.A.

    1991-01-01

    We analyze the mirror manifold hypothesis in one and three dimensions using the simplest available representations of the N = 2 superconformal algebra. The symmetries of these tensor models can be divided out to give an explicit representation of the mirror, and we give a simple group theoretical algorithm for determining which symmetries should be used. We show that the mirror of a superconformal field theory does not always have a geometrical interpretation, but when it does, deformations of complex structure of one manifold are reflected in deformations of the Kaehler form of the mirror manifold, and we show how the large radius limit of a manifold corresponds to a large complex structure limit in the mirror manifold. The mirror of the Tian-Yau three generation model is constructed both as a conformal field theory and as an algebraic variety with Euler number six. The Hodge numbers of this manifolds are fixed, but the intersection numbes are highly ambiguous, presumably reflected a rich structure of multicritical points in the moduli space of the field theory. (orig.)

  4. Total Variation Regularization for Functions with Values in a Manifold

    KAUST Repository

    Lellmann, Jan; Strekalovskiy, Evgeny; Koetter, Sabrina; Cremers, Daniel

    2013-01-01

    While total variation is among the most popular regularizers for variational problems, its extension to functions with values in a manifold is an open problem. In this paper, we propose the first algorithm to solve such problems which applies to arbitrary Riemannian manifolds. The key idea is to reformulate the variational problem as a multilabel optimization problem with an infinite number of labels. This leads to a hard optimization problem which can be approximately solved using convex relaxation techniques. The framework can be easily adapted to different manifolds including spheres and three-dimensional rotations, and allows to obtain accurate solutions even with a relatively coarse discretization. With numerous examples we demonstrate that the proposed framework can be applied to variational models that incorporate chromaticity values, normal fields, or camera trajectories. © 2013 IEEE.

  5. Total Variation Regularization for Functions with Values in a Manifold

    KAUST Repository

    Lellmann, Jan

    2013-12-01

    While total variation is among the most popular regularizers for variational problems, its extension to functions with values in a manifold is an open problem. In this paper, we propose the first algorithm to solve such problems which applies to arbitrary Riemannian manifolds. The key idea is to reformulate the variational problem as a multilabel optimization problem with an infinite number of labels. This leads to a hard optimization problem which can be approximately solved using convex relaxation techniques. The framework can be easily adapted to different manifolds including spheres and three-dimensional rotations, and allows to obtain accurate solutions even with a relatively coarse discretization. With numerous examples we demonstrate that the proposed framework can be applied to variational models that incorporate chromaticity values, normal fields, or camera trajectories. © 2013 IEEE.

  6. Convex games versus clan games

    NARCIS (Netherlands)

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

    2008-01-01

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

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

  8. Convexity Adjustments for ATS Models

    DEFF Research Database (Denmark)

    Murgoci, Agatha; Gaspar, Raquel M.

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

  9. Nested convex bodies are chaseable

    NARCIS (Netherlands)

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

    2018-01-01

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

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

    Science.gov (United States)

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

    2012-05-08

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

  11. Dynamics on Lorentz manifolds

    CERN Document Server

    Adams, Scot

    2001-01-01

    Within the general framework of the dynamics of "large" groups on geometric spaces, the focus is on the types of groups that can act in complicated ways on Lorentz manifolds, and on the structure of the resulting manifolds and actions. This particular area of dynamics is an active one, and not all the results are in their final form. However, at this point, a great deal can be said about the particular Lie groups that come up in this context. It is impressive that, even assuming very weak recurrence of the action, the list of possible groups is quite restricted. For the most complicated of the

  12. Manifold Regularized Reinforcement Learning.

    Science.gov (United States)

    Li, Hongliang; Liu, Derong; Wang, Ding

    2018-04-01

    This paper introduces a novel manifold regularized reinforcement learning scheme for continuous Markov decision processes. Smooth feature representations for value function approximation can be automatically learned using the unsupervised manifold regularization method. The learned features are data-driven, and can be adapted to the geometry of the state space. Furthermore, the scheme provides a direct basis representation extension for novel samples during policy learning and control. The performance of the proposed scheme is evaluated on two benchmark control tasks, i.e., the inverted pendulum and the energy storage problem. Simulation results illustrate the concepts of the proposed scheme and show that it can obtain excellent performance.

  13. Convex integration theory solutions to the h-principle in geometry and topology

    CERN Document Server

    Spring, David

    1998-01-01

    This book provides a comprehensive study of convex integration theory in immersion-theoretic topology. Convex integration theory, developed originally by M. Gromov, provides general topological methods for solving the h-principle for a wide variety of problems in differential geometry and topology, with applications also to PDE theory and to optimal control theory. Though topological in nature, the theory is based on a precise analytical approximation result for higher order derivatives of functions, proved by M. Gromov. This book is the first to present an exacting record and exposition of all of the basic concepts and technical results of convex integration theory in higher order jet spaces, including the theory of iterated convex hull extensions and the theory of relative h-principles. A second feature of the book is its detailed presentation of applications of the general theory to topics in symplectic topology, divergence free vector fields on 3-manifolds, isometric immersions, totally real embeddings, u...

  14. Maps between Grassmann manifolds

    Indian Academy of Sciences (India)

    Parameswaran Sankaran Institute of Mathematical Sciences Chennai, India sankaran@imsc.res.in Indian Academy of Sciences Platinum Jubilee Meeting Hyderabad

    2009-07-02

    Jul 2, 2009 ... Classification of all manifolds (or maps between them) is an impossible task. The coarser, homotopical classification, is relatively easier–but only relatively! Homotopy is, roughly speaking, the study of properties of spaces and maps invariant under continuous deformations. Denote by [X, Y ] the set of all ...

  15. Lattices in group manifolds

    International Nuclear Information System (INIS)

    Lisboa, P.; Michael, C.

    1982-01-01

    We address the question of designing optimum discrete sets of points to represent numerically a continuous group manifold. We consider subsets which are extensions of the regular discrete subgroups. Applications to Monte Carlo simulation of SU(2) and SU(3) gauge theory are discussed. (orig.)

  16. Dual manifold heat pipe evaporator

    Science.gov (United States)

    Adkins, D.R.; Rawlinson, K.S.

    1994-01-04

    An improved evaporator section is described for a dual manifold heat pipe. Both the upper and lower manifolds can have surfaces exposed to the heat source which evaporate the working fluid. The tubes in the tube bank between the manifolds have openings in their lower extensions into the lower manifold to provide for the transport of evaporated working fluid from the lower manifold into the tubes and from there on into the upper manifold and on to the condenser portion of the heat pipe. A wick structure lining the inner walls of the evaporator tubes extends into both the upper and lower manifolds. At least some of the tubes also have overflow tubes contained within them to carry condensed working fluid from the upper manifold to pass to the lower without spilling down the inside walls of the tubes. 1 figure.

  17. Analytic manifolds in uniform algebras

    International Nuclear Information System (INIS)

    Tonev, T.V.

    1988-12-01

    Here we extend Bear-Hile's result concerning the version of famous Bishop's theorem for one-dimensional analytic structures in two directions: for n-dimensional complex analytic manifolds, n>1, and for generalized analytic manifolds. 14 refs

  18. Holonomy of Einstein Lorentzian manifolds

    International Nuclear Information System (INIS)

    Galaev, Anton S

    2010-01-01

    The classification of all possible holonomy algebras of Einstein and vacuum Einstein Lorentzian manifolds is obtained. It is shown that each such algebra appears as the holonomy algebra of an Einstein (resp. vacuum Einstein) Lorentzian manifold; the direct constructions are given. Also the holonomy algebras of totally Ricci-isotropic Lorentzian manifolds are classified. The classification of the holonomy algebras of Lorentzian manifolds is reviewed and a complete description of the spaces of curvature tensors for these holonomies is given.

  19. Eigenvalue pinching on spinc manifolds

    Science.gov (United States)

    Roos, Saskia

    2017-02-01

    We derive various pinching results for small Dirac eigenvalues using the classification of spinc and spin manifolds admitting nontrivial Killing spinors. For this, we introduce a notion of convergence for spinc manifolds which involves a general study on convergence of Riemannian manifolds with a principal S1-bundle. We also analyze the relation between the regularity of the Riemannian metric and the regularity of the curvature of the associated principal S1-bundle on spinc manifolds with Killing spinors.

  20. θ-convex nonlinear programming problems

    International Nuclear Information System (INIS)

    Emam, T.

    2008-01-01

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

  1. A class of free locally convex spaces

    International Nuclear Information System (INIS)

    Sipacheva, O V

    2003-01-01

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

  2. Geometry of isotropic convex bodies

    CERN Document Server

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

    2014-01-01

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

  3. A new convexity measure for polygons.

    Science.gov (United States)

    Zunic, Jovisa; Rosin, Paul L

    2004-07-01

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

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

  5. Nonsmooth Mechanics and Convex Optimization

    CERN Document Server

    Kanno, Yoshihiro

    2011-01-01

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

  6. Analysis, manifolds and physics

    CERN Document Server

    Choquet-Bruhat, Y

    2000-01-01

    Twelve problems have been added to the first edition; four of them are supplements to problems in the first edition. The others deal with issues that have become important, since the first edition of Volume II, in recent developments of various areas of physics. All the problems have their foundations in volume 1 of the 2-Volume set Analysis, Manifolds and Physics. It would have been prohibitively expensive to insert the new problems at their respective places. They are grouped together at the end of this volume, their logical place is indicated by a number of parenthesis following the title.

  7. Decompositions of manifolds

    CERN Document Server

    Daverman, Robert J

    2007-01-01

    Decomposition theory studies decompositions, or partitions, of manifolds into simple pieces, usually cell-like sets. Since its inception in 1929, the subject has become an important tool in geometric topology. The main goal of the book is to help students interested in geometric topology to bridge the gap between entry-level graduate courses and research at the frontier as well as to demonstrate interrelations of decomposition theory with other parts of geometric topology. With numerous exercises and problems, many of them quite challenging, the book continues to be strongly recommended to eve

  8. Manifold Regularized Correlation Object Tracking

    OpenAIRE

    Hu, Hongwei; Ma, Bo; Shen, Jianbing; Shao, Ling

    2017-01-01

    In this paper, we propose a manifold regularized correlation tracking method with augmented samples. To make better use of the unlabeled data and the manifold structure of the sample space, a manifold regularization-based correlation filter is introduced, which aims to assign similar labels to neighbor samples. Meanwhile, the regression model is learned by exploiting the block-circulant structure of matrices resulting from the augmented translated samples over multiple base samples cropped fr...

  9. Quantum information and convex optimization

    International Nuclear Information System (INIS)

    Reimpell, Michael

    2008-01-01

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

  10. On the Moduli of Convexity

    Czech Academy of Sciences Publication Activity Database

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

    2007-01-01

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

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

  12. Convexity of the effective potential

    International Nuclear Information System (INIS)

    Haymaker, R.W.; Perez-Mercader, J.

    1978-01-01

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

  13. Smooth Maps of a Foliated Manifold in a Symplectic Manifold

    Indian Academy of Sciences (India)

    Let be a smooth manifold with a regular foliation F and a 2-form which induces closed forms on the leaves of F in the leaf topology. A smooth map f : ( M , F ) ⟶ ( N , ) in a symplectic manifold ( N , ) is called a foliated symplectic immersion if restricts to an immersion on each leaf of the foliation and further, the ...

  14. A study of Para-Sasakian manifold

    International Nuclear Information System (INIS)

    Rahman, M.S.

    1995-08-01

    A Para-Sasakian manifold M is viewed in the light of an almost paracontact manifold. The fundamental concepts of M in spirit to Recurrent, Ricci-recurrent, 2-Recurrent and 2-Ricci-recurrent manifolds are presented. An η-Einstein manifold modelled on P-Sasakian manifold is then treated with simplified proofs of some results. (author). 7 refs

  15. Moment-angle manifolds, intersection of quadrics and higher dimensional contact manifolds

    OpenAIRE

    Barreto, Yadira; Verjovsky, Alberto

    2013-01-01

    We construct new examples of contact manifolds in arbitrarily large dimensions. These manifolds which we call quasi moment-angle manifolds, are closely related to the classical moment-angle manifolds.

  16. Diffeomorphisms of elliptic 3-manifolds

    CERN Document Server

    Hong, Sungbok; McCullough, Darryl; Rubinstein, J Hyam

    2012-01-01

    This work concerns the diffeomorphism groups of 3-manifolds, in particular of elliptic 3-manifolds. These are the closed 3-manifolds that admit a Riemannian metric of constant positive curvature, now known to be exactly the closed 3-manifolds that have a finite fundamental group. The (Generalized) Smale Conjecture asserts that for any elliptic 3-manifold M, the inclusion from the isometry group of M to its diffeomorphism group is a homotopy equivalence. The original Smale Conjecture, for the 3-sphere, was proven by J. Cerf and A. Hatcher, and N. Ivanov proved the generalized conjecture for many of the elliptic 3-manifolds that contain a geometrically incompressible Klein bottle. The main results establish the Smale Conjecture for all elliptic 3-manifolds containing geometrically incompressible Klein bottles, and for all lens spaces L(m,q) with m at least 3. Additional results imply that for a Haken Seifert-fibered 3 manifold V, the space of Seifert fiberings has contractible components, and apart from a small...

  17. Manifolds of positive scalar curvature

    Energy Technology Data Exchange (ETDEWEB)

    Stolz, S [Department of Mathematics, University of Notre Dame, Notre Dame (United States)

    2002-08-15

    This lecture gives an survey on the problem of finding a positive scalar curvature metric on a closed manifold. The Gromov-Lawson-Rosenberg conjecture and its relation to the Baum-Connes conjecture are discussed and the problem of finding a positive Ricci curvature metric on a closed manifold is explained.

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

  19. Complex manifolds in relativity

    International Nuclear Information System (INIS)

    Flaherty, E.J. Jr.

    1975-01-01

    Complex manifold theory is applied to the study of certain problems in general relativity. The first half of the work is devoted to the mathematical theory of complex manifold. Then a brief review of general relativity is given. It is shown that any spacetime admits locally an almost Hermitian structure, suitably modified to be compatible with the indefinite metric of spacetime. This structure is integrable if and only if the spacetime admits two geodesic and shearfree null congruences, thus in particular if the spacetime is type D vacuum or electrified. The structure is ''half-integrable'' in a suitable sense if and only if the spacetime admits one geodesic and shearfree null congruence, thus in particular for all algebraically special vacuum spacetimes. Conditions for the modified Hermitian spacetime to be Kahlerian are presented. The most general metric for such a modified Kahlerian spacetime is found. It is shown that the type D vacuum and electrified spacetimes are conformally related to modified Kahlerian spacetimes by a generally complex conformal factor. These latter are shown to possess a very rich structure, including the existence of Killing tensors and Killing vectors. A new ''explanation'' of Newman's complex coordinate transformations is given. It is felt to be superior to previous ''explanations'' on several counts. For example, a physical interpretation in terms of a symmetry group is given. The existence of new complex coordinate transformations is established: Nt is shown that any type D vacuum spacetime is obtainable from either Schwarzschild spacetime or ''C'' spacetime by a complex coordinate transformation. Finally, some related topics are discussed and areas for future work are outlined. (Diss. Abstr. Int., B)

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

  1. Quantum logics and convex geometry

    International Nuclear Information System (INIS)

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

    1985-01-01

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

  2. Learning Convex Inference of Marginals

    OpenAIRE

    Domke, Justin

    2012-01-01

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

  3. Diameter 2 properties and convexity

    Czech Academy of Sciences Publication Activity Database

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

    2016-01-01

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

  4. Pluripotential theory on quaternionic manifolds

    Science.gov (United States)

    Alesker, Semyon

    2012-05-01

    On any quaternionic manifold of dimension greater than 4 a class of plurisubharmonic functions (or, rather, sections of an appropriate line bundle) is introduced. Then a Monge-Ampère operator is defined. It is shown that it satisfies a version of the theorems of A. D. Alexandrov and Chern-Levine-Nirenberg. For more special classes of manifolds analogous results were previously obtained in Alesker (2003) [1] for the flat quaternionic space Hn and in Alesker and Verbitsky (2006) [5] for hypercomplex manifolds. One of the new technical aspects of the present paper is the systematic use of the Baston differential operators, for which we also prove a new multiplicativity property.

  5. Smooth maps of a foliated manifold in a symplectic manifold

    Indian Academy of Sciences (India)

    Abstract. Let M be a smooth manifold with a regular foliation F and a 2-form ω which induces closed forms on the leaves of F in the leaf topology. A smooth map f : (M, F) −→ (N,σ) in a symplectic manifold (N,σ) is called a foliated symplectic immersion if f restricts to an immersion on each leaf of the foliation and further, the.

  6. An introduction to differential manifolds

    CERN Document Server

    Lafontaine, Jacques

    2015-01-01

    This book is an introduction to differential manifolds. It gives solid preliminaries for more advanced topics: Riemannian manifolds, differential topology, Lie theory. It presupposes little background: the reader is only expected to master basic differential calculus, and a little point-set topology. The book covers the main topics of differential geometry: manifolds, tangent space, vector fields, differential forms, Lie groups, and a few more sophisticated topics such as de Rham cohomology, degree theory and the Gauss-Bonnet theorem for surfaces. Its ambition is to give solid foundations. In particular, the introduction of “abstract” notions such as manifolds or differential forms is motivated via questions and examples from mathematics or theoretical physics. More than 150 exercises, some of them easy and classical, some others more sophisticated, will help the beginner as well as the more expert reader. Solutions are provided for most of them. The book should be of interest to various readers: undergra...

  7. Manifold Regularized Correlation Object Tracking.

    Science.gov (United States)

    Hu, Hongwei; Ma, Bo; Shen, Jianbing; Shao, Ling

    2018-05-01

    In this paper, we propose a manifold regularized correlation tracking method with augmented samples. To make better use of the unlabeled data and the manifold structure of the sample space, a manifold regularization-based correlation filter is introduced, which aims to assign similar labels to neighbor samples. Meanwhile, the regression model is learned by exploiting the block-circulant structure of matrices resulting from the augmented translated samples over multiple base samples cropped from both target and nontarget regions. Thus, the final classifier in our method is trained with positive, negative, and unlabeled base samples, which is a semisupervised learning framework. A block optimization strategy is further introduced to learn a manifold regularization-based correlation filter for efficient online tracking. Experiments on two public tracking data sets demonstrate the superior performance of our tracker compared with the state-of-the-art tracking approaches.

  8. Non-Kaehler attracting manifolds

    International Nuclear Information System (INIS)

    Dall'Agata, Gianguido

    2006-01-01

    We observe that the new attractor mechanism describing IIB flux vacua for Calabi-Yau compactifications has a possible extension to the landscape of non-Kaehler vacua that emerge in heterotic compactifications with fluxes. We focus on the effective theories coming from compactifications on generalized half-flat manifolds, showing that the Minkowski 'attractor points' for 3-form fluxes are special-hermitian manifolds

  9. Vector Fields on Product Manifolds

    OpenAIRE

    Kurz, Stefan

    2011-01-01

    This short report establishes some basic properties of smooth vector fields on product manifolds. The main results are: (i) On a product manifold there always exists a direct sum decomposition into horizontal and vertical vector fields. (ii) Horizontal and vertical vector fields are naturally isomorphic to smooth families of vector fields defined on the factors. Vector fields are regarded as derivations of the algebra of smooth functions.

  10. Characteristic manifolds in relativistic hypoelasticity

    Energy Technology Data Exchange (ETDEWEB)

    Giambo, S [Messina Univ. (Italy). Istituto di Matematica

    1978-10-02

    The relativistic hypoelasticity is considered and the characteristic manifolds are determined by using the Cauchy-Kovalevski theorem for the Cauchy problem with analytic initial conditions. Taking into account that the characteristic manifold represents the image of the front-wave in the space-time, it is possible to determine the velocities of propagation. Three wave-species are obtained: material waves, longitudinal waves and transverse waves.

  11. Moduli space of torsional manifolds

    International Nuclear Information System (INIS)

    Becker, Melanie; Tseng, L.-S.; Yau, S.-T.

    2007-01-01

    We characterize the geometric moduli of non-Kaehler manifolds with torsion. Heterotic supersymmetric flux compactifications require that the six-dimensional internal manifold be balanced, the gauge bundle be Hermitian Yang-Mills, and also the anomaly cancellation be satisfied. We perform the linearized variation of these constraints to derive the defining equations for the local moduli. We explicitly determine the metric deformations of the smooth flux solution corresponding to a torus bundle over K3

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

  13. Geometry of Moishezon and 1-convex spaces II: Projectivity of Moishezon spaces and its non-compact version

    International Nuclear Information System (INIS)

    Sitaramayya, M.

    1993-11-01

    After a brief review of the geometry of Moishezon spaces, their relation with l-convex spaces and a reasonable and up to date understanding of the obstructions for projectivity of Moishezon objects both in singular and non-singular case is given. The geometry of l-convex manifolds and with l-dimensional exceptional set is studied and some problems and conjectures are stated. The tools of cohomology vanishing theorems important for the subject are briefly sketched. Compactifications of C 3 and Stein spaces are finally outlined. given. 111 refs, 2 figs

  14. Hazy spaces, tangent spaces, manifolds and groups

    International Nuclear Information System (INIS)

    Dodson, C.T.J.

    1977-03-01

    The results on hazy spaces and the developments leading to hazy manifolds and groups are summarized. Proofs have appeared elsewhere so here examples are considered and some motivation for definitions and constructions in the theorems is analyzed. It is shown that quite simple ideas, intuitively acceptable, lead to remarkable similarity with the theory of differentiable manifolds. Hazy n manifolds have tangent bundles that are hazy 2n manifolds and there are hazy manifold structures for groups. Products and submanifolds are easily constructed and in particular the hazy n-sphere manifolds as submanifolds of the standard hazy manifold Zsup(n+1)

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

  16. The topology of toric origami manifolds

    OpenAIRE

    Holm, Tara; Pires, Ana Rita

    2012-01-01

    A folded symplectic form on a manifold is a closed 2-form with the mildest possible degeneracy along a hypersurface. A special class of folded symplectic manifolds are the origami symplectic manifolds, studied by Cannas da Silva, Guillemin and Pires, who classified toric origami manifolds by combinatorial origami templates. In this paper, we examine the topology of toric origami manifolds that have acyclic origami template and co-orientable folding hypersurface. We prove that the cohomology i...

  17. Reconstruction of convex bodies from moments

    DEFF Research Database (Denmark)

    Hörrmann, Julia; Kousholt, Astrid

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

  18. Principal Curves on Riemannian Manifolds.

    Science.gov (United States)

    Hauberg, Soren

    2016-09-01

    Euclidean statistics are often generalized to Riemannian manifolds by replacing straight-line interpolations with geodesic ones. While these Riemannian models are familiar-looking, they are restricted by the inflexibility of geodesics, and they rely on constructions which are optimal only in Euclidean domains. We consider extensions of Principal Component Analysis (PCA) to Riemannian manifolds. Classic Riemannian approaches seek a geodesic curve passing through the mean that optimizes a criteria of interest. The requirements that the solution both is geodesic and must pass through the mean tend to imply that the methods only work well when the manifold is mostly flat within the support of the generating distribution. We argue that instead of generalizing linear Euclidean models, it is more fruitful to generalize non-linear Euclidean models. Specifically, we extend the classic Principal Curves from Hastie & Stuetzle to data residing on a complete Riemannian manifold. We show that for elliptical distributions in the tangent of spaces of constant curvature, the standard principal geodesic is a principal curve. The proposed model is simple to compute and avoids many of the pitfalls of traditional geodesic approaches. We empirically demonstrate the effectiveness of the Riemannian principal curves on several manifolds and datasets.

  19. Slow manifolds in chemical kinetics

    International Nuclear Information System (INIS)

    Shahzad, M.; Haq, I. U.; Sultan, F.; Wahab, A.; Faizullah, F.; Rahman, G. U.

    2016-01-01

    Modelling the chemical system, especially for complex and higher dimensional problems, gives an easy way to handle the ongoing reaction process with respect to time. Here, we will consider some of the newly developed computational methods commonly used for model reductions in a chemical reaction. An effective (simple) method is planned to measure the low dimensional manifold, which reduces the higher dimensional system in such a way that it may not affect the precision of the whole mechanism. The phase flow of the solution trajectories near the equilibrium point is observed while the initial approximation is measured with the spectral quasi equilibrium manifold, which starts from the equilibrium point. To make it an invariant curve, the approximated curve is first refined a certain number of times using the method of invariant grids. The other way of getting the reduced data in the low dimensional manifold is possible through the intrinsic low dimensional manifold. Then, we compare these two invariant curves given by both the methods. Finally, the idea is extended to the higher dimensional manifold, where more number of progress variables will be added. (author)

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

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

  2. Characterizing Convexity of Games using Marginal Vectors

    NARCIS (Netherlands)

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

    2003-01-01

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

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

  4. Differential analysis of matrix convex functions II

    DEFF Research Database (Denmark)

    Hansen, Frank; Tomiyama, Jun

    2009-01-01

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

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

  6. Convexity of oligopoly games without transferable technologies

    NARCIS (Netherlands)

    Driessen, Theo; Meinhardt, Holger I.

    2005-01-01

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

  7. Convex bodies with many elliptic sections

    OpenAIRE

    Arelio, Isaac; Montejano, Luis

    2014-01-01

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

  8. Stein Manifolds and Holomorphic Mappings

    CERN Document Server

    Forstneric, Franc

    2011-01-01

    The main theme of this book is the homotopy principle for holomorphic mappings from Stein manifolds to the newly introduced class of Oka manifolds. This book contains the first complete account of Oka-Grauert theory and its modern extensions, initiated by Mikhail Gromov and developed in the last decade by the author and his collaborators. Included is the first systematic presentation of the theory of holomorphic automorphisms of complex Euclidean spaces, a survey on Stein neighborhoods, connections between the geometry of Stein surfaces and Seiberg-Witten theory, and a wide variety of applicat

  9. Differential geometry curves, surfaces, manifolds

    CERN Document Server

    Kohnel, Wolfgang

    2002-01-01

    This carefully written book is an introduction to the beautiful ideas and results of differential geometry. The first half covers the geometry of curves and surfaces, which provide much of the motivation and intuition for the general theory. Special topics that are explored include Frenet frames, ruled surfaces, minimal surfaces and the Gauss-Bonnet theorem. The second part is an introduction to the geometry of general manifolds, with particular emphasis on connections and curvature. The final two chapters are insightful examinations of the special cases of spaces of constant curvature and Einstein manifolds. The text is illustrated with many figures and examples. The prerequisites are undergraduate analysis and linear algebra.

  10. Blowup for flat slow manifolds

    DEFF Research Database (Denmark)

    Kristiansen, Kristian Uldall

    2017-01-01

    In this paper, we present a way of extending the blowup method, in the formulation of Krupa and Szmolyan, to flat slow manifolds that lose hyperbolicity beyond any algebraic order. Although these manifolds have infinite co-dimensions, they do appear naturally in certain settings; for example, in (a......) the regularization of piecewise smooth systems by tanh, (b) a particular aircraft landing dynamics model, and finally (c) in a model of earthquake faulting. We demonstrate the approach using a simple model system and the examples (a) and (b)....

  11. Blowup for flat slow manifolds

    Science.gov (United States)

    Kristiansen, K. U.

    2017-05-01

    In this paper, we present a way of extending the blowup method, in the formulation of Krupa and Szmolyan, to flat slow manifolds that lose hyperbolicity beyond any algebraic order. Although these manifolds have infinite co-dimensions, they do appear naturally in certain settings; for example, in (a) the regularization of piecewise smooth systems by \\tanh , (b) a particular aircraft landing dynamics model, and finally (c) in a model of earthquake faulting. We demonstrate the approach using a simple model system and the examples (a) and (b).

  12. Matrix regularization of 4-manifolds

    OpenAIRE

    Trzetrzelewski, M.

    2012-01-01

    We consider products of two 2-manifolds such as S^2 x S^2, embedded in Euclidean space and show that the corresponding 4-volume preserving diffeomorphism algebra can be approximated by a tensor product SU(N)xSU(N) i.e. functions on a manifold are approximated by the Kronecker product of two SU(N) matrices. A regularization of the 4-sphere is also performed by constructing N^2 x N^2 matrix representations of the 4-algebra (and as a byproduct of the 3-algebra which makes the regularization of S...

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

  14. Two generalizations of column-convex polygons

    International Nuclear Information System (INIS)

    Feretic, Svjetlan; Guttmann, Anthony J

    2009-01-01

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

  15. Connections and curvatures on complex Riemannian manifolds

    International Nuclear Information System (INIS)

    Ganchev, G.; Ivanov, S.

    1991-05-01

    Characteristic connection and characteristic holomorphic sectional curvatures are introduced on a complex Riemannian manifold (not necessarily with holomorphic metric). For the class of complex Riemannian manifolds with holomorphic characteristic connection a classification of the manifolds with (pointwise) constant holomorphic characteristic curvature is given. It is shown that the conformal geometry of complex analytic Riemannian manifolds can be naturally developed on the class of locally conformal holomorphic Riemannian manifolds. Complex Riemannian manifolds locally conformal to the complex Euclidean space are characterized with zero conformal fundamental tensor and zero conformal characteristic tensor. (author). 12 refs

  16. Generalized graph manifolds and their effective recognition

    International Nuclear Information System (INIS)

    Matveev, S V

    1998-01-01

    A generalized graph manifold is a three-dimensional manifold obtained by gluing together elementary blocks, each of which is either a Seifert manifold or contains no essential tori or annuli. By a well-known result on torus decomposition each compact three-dimensional manifold with boundary that is either empty or consists of tori has a canonical representation as a generalized graph manifold. A short simple proof of the existence of a canonical representation is presented and a (partial) algorithm for its construction is described. A simple hyperbolicity test for blocks that are not Seifert manifolds is also presented

  17. Nehari manifold for non-local elliptic operator with concave–convex ...

    Indian Academy of Sciences (India)

    Introduction. We consider the following p-fractional Laplace equation ... ators of elliptic type due to concrete real world applications in finance, thin obstacle .... Due to the non-localness of the operator LK, we define the linear space as follows:.

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

    OpenAIRE

    Asaeedi, Saeed; Didehvar, Farzad; Mohades, Ali

    2013-01-01

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

  19. Cayley transform on Stiefel manifolds

    Science.gov (United States)

    Macías-Virgós, Enrique; Pereira-Sáez, María José; Tanré, Daniel

    2018-01-01

    The Cayley transform for orthogonal groups is a well known construction with applications in real and complex analysis, linear algebra and computer science. In this work, we construct Cayley transforms on Stiefel manifolds. Applications to the Lusternik-Schnirelmann category and optimization problems are presented.

  20. Principal Curves on Riemannian Manifolds

    DEFF Research Database (Denmark)

    Hauberg, Søren

    2015-01-01

    Euclidean statistics are often generalized to Riemannian manifolds by replacing straight-line interpolations with geodesic ones. While these Riemannian models are familiar-looking, they are restricted by the inflexibility of geodesics, and they rely on constructions which are optimal only in Eucl...

  1. Collective coordinates on symplectic manifolds

    International Nuclear Information System (INIS)

    Razumov, A.V.; Taranov, A.Yu.

    1981-01-01

    For an arbitrary Lie group of canonical transformations on a symplectic manifold collective coordinates are introduced. They describe a motion of the dynamical system as a whole under the group transformations. Some properties of Lie group of canonical transformations are considered [ru

  2. Obstruction theory on 8-manifolds

    Czech Academy of Sciences Publication Activity Database

    Čadek, M.; Crabb, M.; Vanžura, Jiří

    2008-01-01

    Roč. 127, č. 2 (2008), s. 167-186 ISSN 0025-2611 R&D Projects: GA ČR GA201/05/2117 Institutional research plan: CEZ:AV0Z10190503 Keywords : 8-manifolds * obstruction theory Subject RIV: BA - General Mathematics Impact factor: 0.509, year: 2008

  3. An imbedding of Lorentzian manifolds

    International Nuclear Information System (INIS)

    Kim, Do-Hyung

    2009-01-01

    A new method for imbedding a Lorentzian manifold with a non-compact Cauchy surface is presented. As an application, it is shown that any two-dimensional globally hyperbolic spacetime with a non-compact Cauchy surface can be causally isomorphically imbedded into two-dimensional Minkowski spacetime.

  4. On Kähler–Norden manifolds

    Indian Academy of Sciences (India)

    Abstract. This paper is concerned with the problem of the geometry of Norden manifolds. Some properties of Riemannian curvature tensors and curvature scalars of Kähler–Norden manifolds using the theory of Tachibana operators is presented.

  5. Rank Two Affine Manifolds in Genus 3

    OpenAIRE

    Aulicino, David; Nguyen, Duc-Manh

    2016-01-01

    We complete the classification of rank two affine manifolds in the moduli space of translation surfaces in genus three. Combined with a recent result of Mirzakhani and Wright, this completes the classification of higher rank affine manifolds in genus three.

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

    International Nuclear Information System (INIS)

    Brinkhuis, Ya; Tikhomirov, V M

    2007-01-01

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

  7. Constructions of Calabi-Yau manifolds

    International Nuclear Information System (INIS)

    Hubsch, T.

    1987-01-01

    Among possible compactifications of Superstring Theories (defined in 9+1 dimensional space-time) it is argued that only those in Calabi-Yau manifolds may lead to phenomenologically acceptable models. Thus, constructions of such manifolds are studied and a huge sequence is presented, giving rise to many possibly applicable manifolds

  8. Natural Connections on Riemannian Product Manifolds

    OpenAIRE

    Gribacheva, Dobrinka

    2011-01-01

    A Riemannian almost product manifold with integrable almost product structure is called a Riemannian product manifold. In the present paper the natural connections on such manifolds are studied, i.e. the linear connections preserving the almost product structure and the Riemannian metric.

  9. A viewpoint on nearly conformally symmetric manifold

    International Nuclear Information System (INIS)

    Rahman, M.S.

    1990-06-01

    Some observations, with definition, on Nearly Conformally Symmetric (NCS) manifold are made. A number of theorems concerning conformal change of metric and parallel tensors on NCS manifolds are presented. It is illustrated that a manifold M = R n-1 x R + 1 , endowed with a special metric, is NCS but not of harmonic curvature. (author). 8 refs

  10. Convex sets in probabilistic normed spaces

    International Nuclear Information System (INIS)

    Aghajani, Asadollah; Nourouzi, Kourosh

    2008-01-01

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

  11. Designing Camera Networks by Convex Quadratic Programming

    KAUST Repository

    Ghanem, Bernard; Wonka, Peter; Cao, Yuanhao

    2015-01-01

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

  12. ON THE GENERALIZED CONVEXITY AND CONCAVITY

    Directory of Open Access Journals (Sweden)

    Bhayo B.

    2015-11-01

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

  13. On convexity and Schoenberg's variation diminishing splines

    International Nuclear Information System (INIS)

    Feng, Yuyu; Kozak, J.

    1992-11-01

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

  14. Flexible fuel cell gas manifold system

    Science.gov (United States)

    Cramer, Michael; Shah, Jagdish; Hayes, Richard P.; Kelley, Dana A.

    2005-05-03

    A fuel cell stack manifold system in which a flexible manifold body includes a pan having a central area, sidewall extending outward from the periphery of the central area, and at least one compound fold comprising a central area fold connecting adjacent portions of the central area and extending between opposite sides of the central area, and a sidewall fold connecting adjacent portions of the sidewall. The manifold system further includes a rail assembly for attachment to the manifold body and adapted to receive pins by which dielectric insulators are joined to the manifold assembly.

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

    Energy Technology Data Exchange (ETDEWEB)

    Driessen, T.

    1994-12-31

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

  16. Counting convex polygons in planar point sets

    NARCIS (Netherlands)

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

    1995-01-01

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

  17. Minimal Webs in Riemannian Manifolds

    DEFF Research Database (Denmark)

    Markvorsen, Steen

    2008-01-01

    For a given combinatorial graph $G$ a {\\it geometrization} $(G, g)$ of the graph is obtained by considering each edge of the graph as a $1-$dimensional manifold with an associated metric $g$. In this paper we are concerned with {\\it minimal isometric immersions} of geometrized graphs $(G, g......)$ into Riemannian manifolds $(N^{n}, h)$. Such immersions we call {\\em{minimal webs}}. They admit a natural 'geometric' extension of the intrinsic combinatorial discrete Laplacian. The geometric Laplacian on minimal webs enjoys standard properties such as the maximum principle and the divergence theorems, which...... are of instrumental importance for the applications. We apply these properties to show that minimal webs in ambient Riemannian spaces share several analytic and geometric properties with their smooth (minimal submanifold) counterparts in such spaces. In particular we use appropriate versions of the divergence...

  18. Invariance for Single Curved Manifold

    KAUST Repository

    Castro, Pedro Machado Manhaes de

    2012-01-01

    Recently, it has been shown that, for Lambert illumination model, solely scenes composed by developable objects with a very particular albedo distribution produce an (2D) image with isolines that are (almost) invariant to light direction change. In this work, we provide and investigate a more general framework, and we show that, in general, the requirement for such in variances is quite strong, and is related to the differential geometry of the objects. More precisely, it is proved that single curved manifolds, i.e., manifolds such that at each point there is at most one principal curvature direction, produce invariant is surfaces for a certain relevant family of energy functions. In the three-dimensional case, the associated energy function corresponds to the classical Lambert illumination model with albedo. This result is also extended for finite-dimensional scenes composed by single curved objects. © 2012 IEEE.

  19. Invariance for Single Curved Manifold

    KAUST Repository

    Castro, Pedro Machado Manhaes de

    2012-08-01

    Recently, it has been shown that, for Lambert illumination model, solely scenes composed by developable objects with a very particular albedo distribution produce an (2D) image with isolines that are (almost) invariant to light direction change. In this work, we provide and investigate a more general framework, and we show that, in general, the requirement for such in variances is quite strong, and is related to the differential geometry of the objects. More precisely, it is proved that single curved manifolds, i.e., manifolds such that at each point there is at most one principal curvature direction, produce invariant is surfaces for a certain relevant family of energy functions. In the three-dimensional case, the associated energy function corresponds to the classical Lambert illumination model with albedo. This result is also extended for finite-dimensional scenes composed by single curved objects. © 2012 IEEE.

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

    Science.gov (United States)

    Parekh, Ankit

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

  1. Torsions of 3-dimensional manifolds

    CERN Document Server

    Wurzbacher, T

    2002-01-01

    From the reviews: "This is an excellent exposition about abelian Reidemeister torsions for three-manifolds." ―Zentralblatt Math "This monograph contains a wealth of information many topologists will find very handy. …Many of the new points of view pioneered by Turaev are gradually becoming mainstream and are spreading beyond the pure topology world. This monograph is a timely and very useful addition to the scientific literature." ―Mathematical Reviews

  2. Manifold seal structure for fuel cell stack

    Science.gov (United States)

    Collins, William P.

    1988-01-01

    The seal between the sides of a fuel cell stack and the gas manifolds is improved by adding a mechanical interlock between the adhesive sealing strip and the abutting surface of the manifolds. The adhesive is a material which can flow to some extent when under compression, and the mechanical interlock is formed providing small openings in the portion of the manifold which abuts the adhesive strip. When the manifolds are pressed against the adhesive strips, the latter will flow into and through the manifold openings to form buttons or ribs which mechanically interlock with the manifolds. These buttons or ribs increase the bond between the manifolds and adhesive, which previously relied solely on the adhesive nature of the adhesive.

  3. Anomalies, conformal manifolds, and spheres

    Energy Technology Data Exchange (ETDEWEB)

    Gomis, Jaume [Perimeter Institute for Theoretical Physics,Waterloo, Ontario, N2L 2Y5 (Canada); Hsin, Po-Shen [Department of Physics, Princeton University,Princeton, NJ 08544 (United States); Komargodski, Zohar; Schwimmer, Adam [Weizmann Institute of Science,Rehovot 76100 (Israel); Seiberg, Nathan [School of Natural Sciences, Institute for Advanced Study,Princeton, NJ 08540 (United States); Theisen, Stefan [Max-Planck-Institut für Gravitationsphysik, Albert-Einstein-Institut,14476 Golm (Germany)

    2016-03-04

    The two-point function of exactly marginal operators leads to a universal contribution to the trace anomaly in even dimensions. We study aspects of this trace anomaly, emphasizing its interpretation as a sigma model, whose target space M is the space of conformal field theories (a.k.a. the conformal manifold). When the underlying quantum field theory is supersymmetric, this sigma model has to be appropriately supersymmetrized. As examples, we consider in some detail N=(2,2) and N=(0,2) supersymmetric theories in d=2 and N=2 supersymmetric theories in d=4. This reasoning leads to new information about the conformal manifolds of these theories, for example, we show that the manifold is Kähler-Hodge and we further argue that it has vanishing Kähler class. For N=(2,2) theories in d=2 and N=2 theories in d=4 we also show that the relation between the sphere partition function and the Kähler potential of M follows immediately from the appropriate sigma models that we construct. Along the way we find several examples of potential trace anomalies that obey the Wess-Zumino consistency conditions, but can be ruled out by a more detailed analysis.

  4. Quivers, YBE and 3-manifolds

    Science.gov (United States)

    Yamazaki, Masahito

    2012-05-01

    We study 4d superconformal indices for a large class of {N} = 1 superconformal quiver gauge theories realized combinatorially as a bipartite graph or a set of "zig-zag paths" on a two-dimensional torus T 2. An exchange of loops, which we call a "double Yang-Baxter move", gives the Seiberg duality of the gauge theory, and the invariance of the index under the duality is translated into the Yang-Baxter-type equation of a spin system defined on a "Z-invariant" lattice on T 2. When we compactify the gauge theory to 3d, Higgs the theory and then compactify further to 2d, the superconformal index reduces to an integral of quantum/classical dilogarithm functions. The saddle point of this integral unexpectedly reproduces the hyperbolic volume of a hyperbolic 3-manifold. The 3-manifold is obtained by gluing hyperbolic ideal polyhedra in {{H}^3} , each of which could be thought of as a 3d lift of the faces of the 2d bipartite graph. The same quantity is also related with the thermodynamic limit of the BPS partition function, or equivalently the genus 0 topological string partition function, on a toric Calabi-Yau manifold dual to quiver gauge theories. We also comment on brane realization of our theories. This paper is a companion to another paper summarizing the results [1].

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

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

    Directory of Open Access Journals (Sweden)

    Dragomir SeverS

    2010-01-01

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

  7. Convex Banding of the Covariance Matrix.

    Science.gov (United States)

    Bien, Jacob; Bunea, Florentina; Xiao, Luo

    2016-01-01

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

  8. Cobordism independence of Grassmann manifolds

    Indian Academy of Sciences (India)

    R. Narasimhan (Krishtel eMaging) 1461 1996 Oct 15 13:05:22

    ν(m) divides m. Given a positive integer d, let G(d) denote the set of bordism classes of all non-bounding. Grassmannian manifolds Gk(Fn+k) having real dimension d such that k < n. The restric- tion k

  9. Minimal genera of open 4-manifolds

    OpenAIRE

    Gompf, Robert E.

    2013-01-01

    We study exotic smoothings of open 4-manifolds using the minimal genus function and its analog for end homology. While traditional techniques in open 4-manifold smoothing theory give no control of minimal genera, we make progress by using the adjunction inequality for Stein surfaces. Smoothings can be constructed with much more control of these genus functions than the compact setting seems to allow. As an application, we expand the range of 4-manifolds known to have exotic smoothings (up to ...

  10. Reconstruction of convex bodies from surface tensors

    DEFF Research Database (Denmark)

    Kousholt, Astrid; Kiderlen, Markus

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

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

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

  13. Spectral gaps, inertial manifolds and kinematic dynamos

    Energy Technology Data Exchange (ETDEWEB)

    Nunez, Manuel [Departamento de Analisis Matematico, Universidad de Valladolid, 47005 Valladolid (Spain)]. E-mail: mnjmhd@am.uva.es

    2005-10-17

    Inertial manifolds are desirable objects when ones wishes a dynamical process to behave asymptotically as a finite-dimensional ones. Recently [Physica D 194 (2004) 297] these manifolds are constructed for the kinematic dynamo problem with time-periodic velocity. It turns out, however, that the conditions imposed on the fluid velocity to guarantee the existence of inertial manifolds are too demanding, in the sense that they imply that all the solutions tend exponentially to zero. The inertial manifolds are meaningful because they represent different decay rates, but the classical dynamos where the magnetic field is maintained or grows are not covered by this approach, at least until more refined estimates are found.

  14. Topology of high-dimensional manifolds

    Energy Technology Data Exchange (ETDEWEB)

    Farrell, F T [State University of New York, Binghamton (United States); Goettshe, L [Abdus Salam ICTP, Trieste (Italy); Lueck, W [Westfaelische Wilhelms-Universitaet Muenster, Muenster (Germany)

    2002-08-15

    The School on High-Dimensional Manifold Topology took place at the Abdus Salam ICTP, Trieste from 21 May 2001 to 8 June 2001. The focus of the school was on the classification of manifolds and related aspects of K-theory, geometry, and operator theory. The topics covered included: surgery theory, algebraic K- and L-theory, controlled topology, homology manifolds, exotic aspherical manifolds, homeomorphism and diffeomorphism groups, and scalar curvature. The school consisted of 2 weeks of lecture courses and one week of conference. Thwo-part lecture notes volume contains the notes of most of the lecture courses.

  15. Analysis of mixed mode microwave distribution manifolds

    International Nuclear Information System (INIS)

    White, T.L.

    1982-09-01

    The 28-GHz microwave distribution manifold used in the ELMO Bumpy Torus-Scale (EBT-S) experiments consists of a toroidal metallic cavity, whose dimensions are much greater than a wavelength, fed by a source of microwave power. Equalization of the mixed mode power distribution ot the 24 cavities of EBT-S is accomplished by empirically adjusting the coupling irises which are equally spaced around the manifold. The performance of the manifold to date has been very good, yet no analytical models exist for optimizing manifold transmission efficiency or for scaling this technology to the EBT-P manifold design. The present report develops a general model for mixed mode microwave distribution manifolds based on isotropic plane wave sources of varying amplitudes that are distributed toroidally around the manifold. The calculated manifold transmission efficiency for the most recent EBT-S coupling iris modification is 90%. This agrees with the average measured transmission efficiency. Also, the model predicts the coupling iris areas required to balance the distribution of microwave power while maximizing transmission efficiency, and losses in waveguide feeds connecting the irises to the cavities of EBT are calculated using an approach similar to the calculation of mainfold losses. The model will be used to evaluate EBT-P manifold designs

  16. Holomorphic bundles over elliptic manifolds

    International Nuclear Information System (INIS)

    Morgan, J.W.

    2000-01-01

    In this lecture we shall examine holomorphic bundles over compact elliptically fibered manifolds. We shall examine constructions of such bundles as well as (duality) relations between such bundles and other geometric objects, namely K3-surfaces and del Pezzo surfaces. We shall be dealing throughout with holomorphic principal bundles with structure group GC where G is a compact, simple (usually simply connected) Lie group and GC is the associated complex simple algebraic group. Of course, in the special case G = SU(n) and hence GC = SLn(C), we are considering holomorphic vector bundles with trivial determinant. In the other cases of classical groups, G SO(n) or G = Sympl(2n) we are considering holomorphic vector bundles with trivial determinant equipped with a non-degenerate symmetric, or skew symmetric pairing. In addition to these classical cases there are the finite number of exceptional groups. Amazingly enough, motivated by questions in physics, much interest centres around the group E8 and its subgroups. For these applications it does not suffice to consider only the classical groups. Thus, while often first doing the case of SU(n) or more generally of the classical groups, we shall extend our discussions to the general semi-simple group. Also, we shall spend a good deal of time considering elliptically fibered manifolds of the simplest type, namely, elliptic curves

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

  18. Probing convex polygons with X-rays

    International Nuclear Information System (INIS)

    Edelsbrunner, H.; Skiena, S.S.

    1988-01-01

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

  19. Recovering convexity in non-associated plasticity

    Science.gov (United States)

    Francfort, Gilles A.

    2018-03-01

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

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

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

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

  3. Robust Utility Maximization Under Convex Portfolio Constraints

    International Nuclear Information System (INIS)

    Matoussi, Anis; Mezghani, Hanen; Mnif, Mohamed

    2015-01-01

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

  4. Localized Multiple Kernel Learning A Convex Approach

    Science.gov (United States)

    2016-11-22

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

  5. A generalization of the convex Kakeya problem

    KAUST Repository

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

    2013-01-01

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

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

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

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

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

  10. A generalization of the convex Kakeya problem

    KAUST Repository

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

    2012-01-01

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

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

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

  13. Cost Allocation and Convex Data Envelopment

    DEFF Research Database (Denmark)

    Hougaard, Jens Leth; Tind, Jørgen

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

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

  15. Nonassociative geometry of manifold with trajectories

    International Nuclear Information System (INIS)

    Bouetou, T.B.; Matveev, O.A.

    2004-12-01

    We give some properties of solution of second order differential or system of differential equations on the manifold. It turns out that such manifolds can be seen as quasigroups or loop under certain circumstances. Output of the operations are given and the connection defined. (author)

  16. Harmonic manifolds with minimal horospheres are flat

    Indian Academy of Sciences (India)

    Abstract. In this note we reprove the known theorem: Harmonic manifolds with minimal horospheres are flat. It turns out that our proof is simpler and more direct than the original one. We also reprove the theorem: Ricci flat harmonic manifolds are flat, which is generally affirmed by appealing to Cheeger–Gromov splitting ...

  17. Harmonic Manifolds with Minimal Horospheres are Flat

    Indian Academy of Sciences (India)

    In this note we reprove the known theorem: Harmonic manifolds with minimal horospheres are flat. It turns out that our proof is simpler and more direct than the original one. We also reprove the theorem: Ricci flat harmonic manifolds are flat, which is generally affirmed by appealing to Cheeger–Gromov splitting theorem.

  18. Hirzebruch genera of manifolds with torus action

    International Nuclear Information System (INIS)

    Panov, T E

    2001-01-01

    A quasitoric manifold is a smooth 2n-manifold M 2n with an action of the compact torus T n such that the action is locally isomorphic to the standard action of T n on C n and the orbit space is diffeomorphic, as a manifold with corners, to a simple polytope P n . The name refers to the fact that topological and combinatorial properties of quasitoric manifolds are similar to those of non-singular algebraic toric varieties (or toric manifolds). Unlike toric varieties, quasitoric manifolds may fail to be complex. However, they always admit a stably (or weakly almost) complex structure, and their cobordism classes generate the complex cobordism ring. Buchstaber and Ray have recently shown that the stably complex structure on a quasitoric manifold is determined in purely combinatorial terms, namely, by an orientation of the polytope and a function from the set of codimension-one faces of the polytope to primitive vectors of the integer lattice. We calculate the χ y -genus of a quasitoric manifold with a fixed stably complex structure in terms of the corresponding combinatorial data. In particular, this gives explicit formulae for the classical Todd genus and the signature. We also compare our results with well-known facts in the theory of toric varieties

  19. Transversal lightlike submanifolds of indefinite sasakian manifolds

    OpenAIRE

    YILDIRIM, Cumali; Yıldırım, Cumali; Şahin, Bayram

    2014-01-01

    We study both radical transversal and transversal lightlike submanifolds of indefinite Sasakian manifolds. We give examples, investigate the geometry of distributions and obtain necessary and sufficient conditions for the induced connection on these submanifolds to be metric connection. We also study totally contact umbilical radical transversal and transversal lightlike submanifolds of indefinite Sasakian manifolds and obtain a classification theorem for totally contact umbilical tr...

  20. Transversal lightlike submanifolds of indefinite sasakian manifolds

    OpenAIRE

    YILDIRIM, Cumali

    2010-01-01

    We study both radical transversal and transversal lightlike submanifolds of indefinite Sasakian manifolds. We give examples, investigate the geometry of distributions and obtain necessary and sufficient conditions for the induced connection on these submanifolds to be metric connection. We also study totally contact umbilical radical transversal and transversal lightlike submanifolds of indefinite Sasakian manifolds and obtain a classification theorem for totally contact umbilical tr...

  1. Holomorphic curves in exploded manifolds: Kuranishi structure

    OpenAIRE

    Parker, Brett

    2013-01-01

    This paper constructs a Kuranishi structure for the moduli stack of holomorphic curves in exploded manifolds. To avoid some technicalities of abstract Kuranishi structures, we embed our Kuranishi structure inside a moduli stack of curves. The construction also works for the moduli stack of holomorphic curves in any compact symplectic manifold.

  2. Harmonic space and quaternionic manifolds

    International Nuclear Information System (INIS)

    Galperin, A.; Ogievetsky, O.; Ivanov, E.

    1992-10-01

    A principle of harmonic analyticity underlying the quaternionic (quaternion-Kaehler) geometry is found, and the differential constraints which define this geometry are solved. To this end the original 4n-dimensional quaternionic manifold is extended to a biharmonic space. The latter includes additional harmonic coordinates associated with both the tangent local Sp(1) group and an extra rigid SU(2) group rotating the complex structures. An one-to-one correspondence is established between the quaternionic spaces and off-shell N=2 supersymmetric sigma-models coupled to N=2 supergravity. Coordinates of the analytic subspace are identified with superfields describing N=2 matter hypermultiplets and a compensating hypermultiplet of N=2 supergravity. As an illustration the potentials for the symmetric quaternionic spaces are presented. (K.A.) 22 refs

  3. Moving Manifolds in Electromagnetic Fields

    Directory of Open Access Journals (Sweden)

    David V. Svintradze

    2017-08-01

    Full Text Available We propose dynamic non-linear equations for moving surfaces in an electromagnetic field. The field is induced by a material body with a boundary of the surface. Correspondingly the potential energy, set by the field at the boundary can be written as an addition of four-potential times four-current to a contraction of the electromagnetic tensor. Proper application of the minimal action principle to the system Lagrangian yields dynamic non-linear equations for moving three dimensional manifolds in electromagnetic fields. The equations in different conditions simplify to Maxwell equations for massless three surfaces, to Euler equations for a dynamic fluid, to magneto-hydrodynamic equations and to the Poisson-Boltzmann equation.

  4. Hamiltonian PDEs and Frobenius manifolds

    International Nuclear Information System (INIS)

    Dubrovin, Boris A

    2008-01-01

    In the first part of this paper the theory of Frobenius manifolds is applied to the problem of classification of Hamiltonian systems of partial differential equations depending on a small parameter. Also developed is a deformation theory of integrable hierarchies including the subclass of integrable hierarchies of topological type. Many well-known examples of integrable hierarchies, such as the Korteweg-de Vries, non-linear Schroedinger, Toda, Boussinesq equations, and so on, belong to this subclass that also contains new integrable hierarchies. Some of these new integrable hierarchies may be important for applications. Properties of the solutions to these equations are studied in the second part. Consideration is given to the comparative study of the local properties of perturbed and unperturbed solutions near a point of gradient catastrophe. A Universality Conjecture is formulated describing the various types of critical behaviour of solutions to perturbed Hamiltonian systems near the point of gradient catastrophe of the unperturbed solution.

  5. Hamiltonian PDEs and Frobenius manifolds

    Energy Technology Data Exchange (ETDEWEB)

    Dubrovin, Boris A [Steklov Mathematical Institute, Russian Academy of Sciences, Moscow (Russian Federation)

    2008-12-31

    In the first part of this paper the theory of Frobenius manifolds is applied to the problem of classification of Hamiltonian systems of partial differential equations depending on a small parameter. Also developed is a deformation theory of integrable hierarchies including the subclass of integrable hierarchies of topological type. Many well-known examples of integrable hierarchies, such as the Korteweg-de Vries, non-linear Schroedinger, Toda, Boussinesq equations, and so on, belong to this subclass that also contains new integrable hierarchies. Some of these new integrable hierarchies may be important for applications. Properties of the solutions to these equations are studied in the second part. Consideration is given to the comparative study of the local properties of perturbed and unperturbed solutions near a point of gradient catastrophe. A Universality Conjecture is formulated describing the various types of critical behaviour of solutions to perturbed Hamiltonian systems near the point of gradient catastrophe of the unperturbed solution.

  6. Function theory on symplectic manifolds

    CERN Document Server

    Polterovich, Leonid

    2014-01-01

    This is a book on symplectic topology, a rapidly developing field of mathematics which originated as a geometric tool for problems of classical mechanics. Since the 1980s, powerful methods such as Gromov's pseudo-holomorphic curves and Morse-Floer theory on loop spaces gave rise to the discovery of unexpected symplectic phenomena. The present book focuses on function spaces associated with a symplectic manifold. A number of recent advances show that these spaces exhibit intriguing properties and structures, giving rise to an alternative intuition and new tools in symplectic topology. The book provides an essentially self-contained introduction into these developments along with applications to symplectic topology, algebra and geometry of symplectomorphism groups, Hamiltonian dynamics and quantum mechanics. It will appeal to researchers and students from the graduate level onwards. I like the spirit of this book. It formulates concepts clearly and explains the relationship between them. The subject matter is i...

  7. Conformal manifolds: ODEs from OPEs

    Science.gov (United States)

    Behan, Connor

    2018-03-01

    The existence of an exactly marginal deformation in a conformal field theory is very special, but it is not well understood how this is reflected in the allowed dimensions and OPE coefficients of local operators. To shed light on this question, we compute perturbative corrections to several observables in an abstract CFT, starting with the beta function. This yields a sum rule that the theory must obey in order to be part of a conformal manifold. The set of constraints relating CFT data at different values of the coupling can in principle be written as a dynamical system that allows one to flow arbitrarily far. We begin the analysis of it by finding a simple form for the differential equations when the spacetime and theory space are both one-dimensional. A useful feature we can immediately observe is that our system makes it very difficult for level crossing to occur.

  8. Strongly not relatives Kähler manifolds

    Directory of Open Access Journals (Sweden)

    Zedda Michela

    2017-02-01

    Full Text Available In this paper we study Kähler manifolds that are strongly not relative to any projective Kähler manifold, i.e. those Kähler manifolds that do not share a Kähler submanifold with any projective Kähler manifold even when their metric is rescaled by the multiplication by a positive constant. We prove two results which highlight some relations between this property and the existence of a full Kähler immersion into the infinite dimensional complex projective space. As application we get that the 1-parameter families of Bergman-Hartogs and Fock-Bargmann-Hartogs domains are strongly not relative to projective Kähler manifolds.

  9. Heterotic model building: 16 special manifolds

    International Nuclear Information System (INIS)

    He, Yang-Hui; Lee, Seung-Joo; Lukas, Andre; Sun, Chuang

    2014-01-01

    We study heterotic model building on 16 specific Calabi-Yau manifolds constructed as hypersurfaces in toric four-folds. These 16 manifolds are the only ones among the more than half a billion manifolds in the Kreuzer-Skarke list with a non-trivial first fundamental group. We classify the line bundle models on these manifolds, both for SU(5) and SO(10) GUTs, which lead to consistent supersymmetric string vacua and have three chiral families. A total of about 29000 models is found, most of them corresponding to SO(10) GUTs. These models constitute a starting point for detailed heterotic model building on Calabi-Yau manifolds in the Kreuzer-Skarke list. The data for these models can be downloaded http://www-thphys.physics.ox.ac.uk/projects/CalabiYau/toricdata/index.html.

  10. Differential geometry of quasi-Sasakian manifolds

    International Nuclear Information System (INIS)

    Kirichenko, V F; Rustanov, A R

    2002-01-01

    The full system of structure equations of a quasi-Sasakian structure is obtained. The structure of the main tensors on a quasi-Sasakian manifold (the Riemann-Christoffel tensor, the Ricci tensor, and other tensors) is studied on this basis. Interesting characterizations of quasi-Sasakian Einstein manifolds are obtained. Additional symmetry properties of the Riemann-Christoffel tensor are discovered and used for distinguishing a new class of CR 1 quasi-Sasakian manifolds. An exhaustive description of the local structure of manifolds in this class is given. A complete classification (up to the B-transformation of the metric) is obtained for manifolds in this class having additional properties of the isotropy kind

  11. Fast approximate convex decomposition using relative concavity

    KAUST Repository

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

    2013-01-01

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

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

  13. Schur Convexity of Generalized Heronian Means Involving Two Parameters

    Directory of Open Access Journals (Sweden)

    Bencze Mihály

    2008-01-01

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

  14. A STRONG OPTIMIZATION THEOREM IN LOCALLY CONVEX SPACES

    Institute of Scientific and Technical Information of China (English)

    程立新; 腾岩梅

    2003-01-01

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

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

    KAUST Repository

    Seneci, Tommaso

    2018-01-01

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

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

    Science.gov (United States)

    Perrin, Angie

    2016-12-08

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

  17. Discriminative sparse coding on multi-manifolds

    KAUST Repository

    Wang, J.J.-Y.; Bensmail, H.; Yao, N.; Gao, Xin

    2013-01-01

    Sparse coding has been popularly used as an effective data representation method in various applications, such as computer vision, medical imaging and bioinformatics. However, the conventional sparse coding algorithms and their manifold-regularized variants (graph sparse coding and Laplacian sparse coding), learn codebooks and codes in an unsupervised manner and neglect class information that is available in the training set. To address this problem, we propose a novel discriminative sparse coding method based on multi-manifolds, that learns discriminative class-conditioned codebooks and sparse codes from both data feature spaces and class labels. First, the entire training set is partitioned into multiple manifolds according to the class labels. Then, we formulate the sparse coding as a manifold-manifold matching problem and learn class-conditioned codebooks and codes to maximize the manifold margins of different classes. Lastly, we present a data sample-manifold matching-based strategy to classify the unlabeled data samples. Experimental results on somatic mutations identification and breast tumor classification based on ultrasonic images demonstrate the efficacy of the proposed data representation and classification approach. 2013 The Authors. All rights reserved.

  18. Discriminative sparse coding on multi-manifolds

    KAUST Repository

    Wang, J.J.-Y.

    2013-09-26

    Sparse coding has been popularly used as an effective data representation method in various applications, such as computer vision, medical imaging and bioinformatics. However, the conventional sparse coding algorithms and their manifold-regularized variants (graph sparse coding and Laplacian sparse coding), learn codebooks and codes in an unsupervised manner and neglect class information that is available in the training set. To address this problem, we propose a novel discriminative sparse coding method based on multi-manifolds, that learns discriminative class-conditioned codebooks and sparse codes from both data feature spaces and class labels. First, the entire training set is partitioned into multiple manifolds according to the class labels. Then, we formulate the sparse coding as a manifold-manifold matching problem and learn class-conditioned codebooks and codes to maximize the manifold margins of different classes. Lastly, we present a data sample-manifold matching-based strategy to classify the unlabeled data samples. Experimental results on somatic mutations identification and breast tumor classification based on ultrasonic images demonstrate the efficacy of the proposed data representation and classification approach. 2013 The Authors. All rights reserved.

  19. Harmonic maps of V-manifolds

    International Nuclear Information System (INIS)

    Chiang, Yuan-Jen.

    1989-01-01

    Harmonic maps between manifolds are described as the critical maps of their associated energy functionals. By using Sampson's method [Sam1], the author constructs a Sobolev's chain on a compact V-manifold and obtain Rellich's Theorem (Theorem 3.1), Sobolev's Theorem (Theorem 3.2), the regularity theorem (Theorem 3.3), the property of the eigenspaces for the Laplacian (Theorem 3.5) and the solvability of Laplacian (Theorem 3.6). Then, with these results, he constructs the Green's functions for the Laplacian on a compact V-manifold M in Proposition 4.1; and obtain an orthonormal basis for L 2 (M) formed by the eigenfunctions of the Laplacian corresponding to the eigenvalues in Proposition 4.2. He also estimates the eigenvalues and eigenfunctions of the Laplacian in Theorem 4.3, which is used to construct the heat kernel on a compact V-manifold in Proposition 5.1. Afterwards, he compares the G-invariant heat kernel functions with the G-invariant fundamental solutions of heat equations in the finite V-charts of a compact V-manifold in Theorem 6.1, and then study two integral operators associated to the heat kernel on a compact V-manifold in section 7. With all the preceding results established, in Theorem 8.3 he uses successive approximations to prove the existence of the solutions of parabolic equations on V-manifolds. Finally, he uses Theorem 8.3 to show the existence of harmonic maps from compact V-manifolds into compact Riemannian manifolds in Theorem 9.1 which extends Eells-Sampson's results [E-S

  20. Space time manifolds and contact structures

    Directory of Open Access Journals (Sweden)

    K. L. Duggal

    1990-01-01

    Full Text Available A new class of contact manifolds (carring a global non-vanishing timelike vector field is introduced to establish a relation between spacetime manifolds and contact structures. We show that odd dimensional strongly causal (in particular, globally hyperbolic spacetimes can carry a regular contact structure. As examples, we present a causal spacetime with a non regular contact structure and a physical model [Gödel Universe] of Homogeneous contact manifold. Finally, we construct a model of 4-dimensional spacetime of general relativity as a contact CR-submanifold.

  1. Convexity, gauge-dependence and tunneling rates

    Energy Technology Data Exchange (ETDEWEB)

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

    2016-10-19

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

  2. Reconstruction of convex bodies from surface tensors

    DEFF Research Database (Denmark)

    Kousholt, Astrid; Kiderlen, Markus

    2016-01-01

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

  3. Exact generating function for 2-convex polygons

    International Nuclear Information System (INIS)

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

    2008-01-01

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

  4. Solving ptychography with a convex relaxation

    Science.gov (United States)

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

    2015-05-01

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

  5. Convexity, gauge-dependence and tunneling rates

    International Nuclear Information System (INIS)

    Plascencia, Alexis D.; Tamarit, Carlos

    2016-01-01

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

  6. An easy path to convex analysis and applications

    CERN Document Server

    Mordukhovich, Boris S

    2013-01-01

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

  7. Convex geometry of quantum resource quantification

    Science.gov (United States)

    Regula, Bartosz

    2018-01-01

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

  8. On the convexity of relativistic hydrodynamics

    International Nuclear Information System (INIS)

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

    2013-01-01

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

  9. Dynamic Convex Duality in Constrained Utility Maximization

    OpenAIRE

    Li, Yusong; Zheng, Harry

    2016-01-01

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

  10. Optimal skill distribution under convex skill costs

    Directory of Open Access Journals (Sweden)

    Tin Cheuk Leung

    2018-03-01

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

  11. Path integrals on curved manifolds

    International Nuclear Information System (INIS)

    Grosche, C.; Steiner, F.

    1987-01-01

    A general framework for treating path integrals on curved manifolds is presented. We also show how to perform general coordinate and space-time transformations in path integrals. The main result is that one has to subtract a quantum correction ΔV ∝ ℎ 2 from the classical Lagrangian L, i.e. the correct effective Lagrangian to be used in the path integral is L eff = L-ΔV. A general prescription for calculating the quantum correction ΔV is given. It is based on a canonical approach using Weyl-ordering and the Hamiltonian path integral defined by the midpoint prescription. The general framework is illustrated by several examples: The d-dimensional rotator, i.e. the motion on the sphere S d-1 , the path integral in d-dimensional polar coordinates, the exact treatment of the hydrogen atom in R 2 and R 3 by performing a Kustaanheimo-Stiefel transformation, the Langer transformation and the path integral for the Morse potential. (orig.)

  12. The occipital lobe convexity sulci and gyri.

    Science.gov (United States)

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

    2012-05-01

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

  13. Convex Hull Aided Registration Method (CHARM).

    Science.gov (United States)

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

    2017-09-01

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

  14. Generalized vector calculus on convex domain

    Science.gov (United States)

    Agrawal, Om P.; Xu, Yufeng

    2015-06-01

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

  15. Convexities move because they contain matter.

    Science.gov (United States)

    Barenholtz, Elan

    2010-09-22

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

  16. Discriminative semi-supervised feature selection via manifold regularization.

    Science.gov (United States)

    Xu, Zenglin; King, Irwin; Lyu, Michael Rung-Tsong; Jin, Rong

    2010-07-01

    Feature selection has attracted a huge amount of interest in both research and application communities of data mining. We consider the problem of semi-supervised feature selection, where we are given a small amount of labeled examples and a large amount of unlabeled examples. Since a small number of labeled samples are usually insufficient for identifying the relevant features, the critical problem arising from semi-supervised feature selection is how to take advantage of the information underneath the unlabeled data. To address this problem, we propose a novel discriminative semi-supervised feature selection method based on the idea of manifold regularization. The proposed approach selects features through maximizing the classification margin between different classes and simultaneously exploiting the geometry of the probability distribution that generates both labeled and unlabeled data. In comparison with previous semi-supervised feature selection algorithms, our proposed semi-supervised feature selection method is an embedded feature selection method and is able to find more discriminative features. We formulate the proposed feature selection method into a convex-concave optimization problem, where the saddle point corresponds to the optimal solution. To find the optimal solution, the level method, a fairly recent optimization method, is employed. We also present a theoretic proof of the convergence rate for the application of the level method to our problem. Empirical evaluation on several benchmark data sets demonstrates the effectiveness of the proposed semi-supervised feature selection method.

  17. Nonparametric Information Geometry: From Divergence Function to Referential-Representational Biduality on Statistical Manifolds

    Directory of Open Access Journals (Sweden)

    Jun Zhang

    2013-12-01

    Full Text Available Divergence functions are the non-symmetric “distance” on the manifold, Μθ, of parametric probability density functions over a measure space, (Χ,μ. Classical information geometry prescribes, on Μθ: (i a Riemannian metric given by the Fisher information; (ii a pair of dual connections (giving rise to the family of α-connections that preserve the metric under parallel transport by their joint actions; and (iii a family of divergence functions ( α-divergence defined on Μθ x Μθ, which induce the metric and the dual connections. Here, we construct an extension of this differential geometric structure from Μθ (that of parametric probability density functions to the manifold, Μ, of non-parametric functions on X, removing the positivity and normalization constraints. The generalized Fisher information and α-connections on M are induced by an α-parameterized family of divergence functions, reflecting the fundamental convex inequality associated with any smooth and strictly convex function. The infinite-dimensional manifold, M, has zero curvature for all these α-connections; hence, the generally non-zero curvature of M can be interpreted as arising from an embedding of Μθ into Μ. Furthermore, when a parametric model (after a monotonic scaling forms an affine submanifold, its natural and expectation parameters form biorthogonal coordinates, and such a submanifold is dually flat for α = ± 1, generalizing the results of Amari’s α-embedding. The present analysis illuminates two different types of duality in information geometry, one concerning the referential status of a point (measurable function expressed in the divergence function (“referential duality” and the other concerning its representation under an arbitrary monotone scaling (“representational duality”.

  18. Pseudo-Kaehler quantization on flag manifolds

    International Nuclear Information System (INIS)

    Karabegov, A.V.

    1997-07-01

    A unified approach to geometric, symbol and deformation quantizations on a generalized flag manifold endowed with an invariant pseudo-Kaehler structure is proposed. In particular cases we arrive at Berezin's quantization via covariant and contravariant symbols. (author). 16 refs

  19. The Hodge theory of projective manifolds

    CERN Document Server

    de Cataldo, Mark Andrea

    2007-01-01

    This book is a written-up and expanded version of eight lectures on the Hodge theory of projective manifolds. It assumes very little background and aims at describing how the theory becomes progressively richer and more beautiful as one specializes from Riemannian, to Kähler, to complex projective manifolds. Though the proof of the Hodge Theorem is omitted, its consequences - topological, geometrical and algebraic - are discussed at some length. The special properties of complex projective manifolds constitute an important body of knowledge and readers are guided through it with the help of selected exercises. Despite starting with very few prerequisites, the concluding chapter works out, in the meaningful special case of surfaces, the proof of a special property of maps between complex projective manifolds, which was discovered only quite recently.

  20. Project Development Specification for Valve Pit Manifold

    International Nuclear Information System (INIS)

    MCGREW, D.L.

    2000-01-01

    Establishes the performance, design development, and test requirements for the valve pit manifolds. The system engineering approach was used to develop this document in accordance with the guidelines laid out in the Systems Engineering Management Plan for Project W-314

  1. Moduli space of Calabi-Yau manifolds

    International Nuclear Information System (INIS)

    Candelas, P.; De la Ossa, X.C.

    1991-01-01

    We present an accessible account of the local geometry of the parameter space of Calabi-Yau manifolds. It is shown that the parameter space decomposes, at least locally, into a product with the space of parameters of the complex structure as one factor and a complex extension of the parameter space of the Kaehler class as the other. It is also shown that each of these spaces is itself a Kaehler manifold and is moreover a Kaehler manifold of restricted type. There is a remarkable symmetry in the intrinsic structures of the two parameter spaces and the relevance of this to the conjectured existence of mirror manifolds is discussed. The two parameter spaces behave differently with respect to modular transformations and it is argued that the role of quantum corrections is to restore the symmetry between the two types of parameters so as to enforce modular invariance. (orig.)

  2. On Kähler–Norden manifolds

    Indian Academy of Sciences (India)

    Kähler–Norden manifolds using the theory of Tachibana operators is presented. ... arguments is subject to the action of the affinor structure ϕ. ..... [20] Vishnevskii V V, Integrable affinor structures and their plural interpretations, J. Math. Sci.

  3. Submanifolds of a Finsler manifold - I

    International Nuclear Information System (INIS)

    Rastogi, S.C.

    1986-06-01

    In 1981, Hojo defined a scalar function φ (p) (x,y), where p is a real number (not= 1). He used this function to define a tensor φ ij (p) (x,y) and a c P Γ-connection which reduce to g ij (x,y) and cΓ-connection for p=2. The aim of this paper is to study submanifolds of a Finsler manifold admitting a c P Γ-connection. In this paper I have obtained four kinds of Gauss-Codazzi equations based on various derivatives in a Finsler manifold admitting a c P Γ-connection. The method used in this paper is similar to the one used by the author in obtaining generalized Gauss-Codazzi equations based on congruences of curves in a Finsler manifold. Besides considering some special cases we have also studied the relationship between the Riemannian curvatures and Ricci tensors of the submanifold and the enveloping manifold. (author)

  4. Generalized regular genus for manifolds with boundary

    Directory of Open Access Journals (Sweden)

    Paola Cristofori

    2003-05-01

    Full Text Available We introduce a generalization of the regular genus, a combinatorial invariant of PL manifolds ([10], which is proved to be strictly related, in dimension three, to generalized Heegaard splittings defined in [12].

  5. Polynomial chaos representation of databases on manifolds

    Energy Technology Data Exchange (ETDEWEB)

    Soize, C., E-mail: christian.soize@univ-paris-est.fr [Université Paris-Est, Laboratoire Modélisation et Simulation Multi-Echelle, MSME UMR 8208 CNRS, 5 bd Descartes, 77454 Marne-La-Vallée, Cedex 2 (France); Ghanem, R., E-mail: ghanem@usc.edu [University of Southern California, 210 KAP Hall, Los Angeles, CA 90089 (United States)

    2017-04-15

    Characterizing the polynomial chaos expansion (PCE) of a vector-valued random variable with probability distribution concentrated on a manifold is a relevant problem in data-driven settings. The probability distribution of such random vectors is multimodal in general, leading to potentially very slow convergence of the PCE. In this paper, we build on a recent development for estimating and sampling from probabilities concentrated on a diffusion manifold. The proposed methodology constructs a PCE of the random vector together with an associated generator that samples from the target probability distribution which is estimated from data concentrated in the neighborhood of the manifold. The method is robust and remains efficient for high dimension and large datasets. The resulting polynomial chaos construction on manifolds permits the adaptation of many uncertainty quantification and statistical tools to emerging questions motivated by data-driven queries.

  6. Geometry of superconformal manifolds. Part 1

    International Nuclear Information System (INIS)

    Roslyi, A.A.; Schwarz, A.S.; Voronov, A.A.

    1987-01-01

    The main facts about complex curves are generalized to superconformal manifolds. The results thus obtained are relevant to the dermion string theory and, in particular, they are useful for computation of determinants of superlaplacians which enter the string partition function

  7. Stable harmonic maps from complete manifolds

    International Nuclear Information System (INIS)

    Xin, Y.L.

    1986-01-01

    By choosing distinguished cross-sections in the second variational formula for harmonic maps from manifolds with not too fast volume growth into certain submanifolds in the Euclidean space some Liouville type theorems have been proved in this article. (author)

  8. Noncommutative gauge theory for Poisson manifolds

    Energy Technology Data Exchange (ETDEWEB)

    Jurco, Branislav E-mail: jurco@mpim-bonn.mpg.de; Schupp, Peter E-mail: schupp@theorie.physik.uni-muenchen.de; Wess, Julius E-mail: wess@theorie.physik.uni-muenchen.de

    2000-09-25

    A noncommutative gauge theory is associated to every Abelian gauge theory on a Poisson manifold. The semi-classical and full quantum version of the map from the ordinary gauge theory to the noncommutative gauge theory (Seiberg-Witten map) is given explicitly to all orders for any Poisson manifold in the Abelian case. In the quantum case the construction is based on Kontsevich's formality theorem.

  9. Noncommutative gauge theory for Poisson manifolds

    International Nuclear Information System (INIS)

    Jurco, Branislav; Schupp, Peter; Wess, Julius

    2000-01-01

    A noncommutative gauge theory is associated to every Abelian gauge theory on a Poisson manifold. The semi-classical and full quantum version of the map from the ordinary gauge theory to the noncommutative gauge theory (Seiberg-Witten map) is given explicitly to all orders for any Poisson manifold in the Abelian case. In the quantum case the construction is based on Kontsevich's formality theorem

  10. Sasakian manifolds and M-theory

    International Nuclear Information System (INIS)

    Figueroa-O’Farrill, José; Santi, Andrea

    2016-01-01

    We extend the link between Einstein Sasakian manifolds and Killing spinors to a class of η-Einstein Sasakian manifolds, both in Riemannian and Lorentzian settings, characterizing them in terms of generalized Killing spinors. We propose a definition of supersymmetric M-theory backgrounds on such a geometry and find a new class of such backgrounds, extending previous work of Haupt, Lukas and Stelle. (paper)

  11. Computer calculation of Witten's 3-manifold invariant

    International Nuclear Information System (INIS)

    Freed, D.S.; Gompf, R.E.

    1991-01-01

    Witten's 2+1 dimensional Chern-Simons theory is exactly solvable. We compute the partition function, a topological invariant of 3-manifolds, on generalized Seifert spaces. Thus we test the path integral using the theory of 3-manifolds. In particular, we compare the exact solution with the asymptotic formula predicted by perturbation theory. We conclude that this path integral works as advertised and gives an effective topological invariant. (orig.)

  12. Singular reduction of Nambu-Poisson manifolds

    Science.gov (United States)

    Das, Apurba

    The version of Marsden-Ratiu Poisson reduction theorem for Nambu-Poisson manifolds by a regular foliation have been studied by Ibáñez et al. In this paper, we show that this reduction procedure can be extended to the singular case. Under a suitable notion of Hamiltonian flow on the reduced space, we show that a set of Hamiltonians on a Nambu-Poisson manifold can also be reduced.

  13. Online Manifold Regularization by Dual Ascending Procedure

    OpenAIRE

    Sun, Boliang; Li, Guohui; Jia, Li; Zhang, Hui

    2013-01-01

    We propose a novel online manifold regularization framework based on the notion of duality in constrained optimization. The Fenchel conjugate of hinge functions is a key to transfer manifold regularization from offline to online in this paper. Our algorithms are derived by gradient ascent in the dual function. For practical purpose, we propose two buffering strategies and two sparse approximations to reduce the computational complexity. Detailed experiments verify the utility of our approache...

  14. The manifold model for space-time

    International Nuclear Information System (INIS)

    Heller, M.

    1981-01-01

    Physical processes happen on a space-time arena. It turns out that all contemporary macroscopic physical theories presuppose a common mathematical model for this arena, the so-called manifold model of space-time. The first part of study is an heuristic introduction to the concept of a smooth manifold, starting with the intuitively more clear concepts of a curve and a surface in the Euclidean space. In the second part the definitions of the Csub(infinity) manifold and of certain structures, which arise in a natural way from the manifold concept, are given. The role of the enveloping Euclidean space (i.e. of the Euclidean space appearing in the manifold definition) in these definitions is stressed. The Euclidean character of the enveloping space induces to the manifold local Euclidean (topological and differential) properties. A suggestion is made that replacing the enveloping Euclidean space by a discrete non-Euclidean space would be a correct way towards the quantization of space-time. (author)

  15. Robinson manifolds and Cauchy-Riemann spaces

    CERN Document Server

    Trautman, A

    2002-01-01

    A Robinson manifold is defined as a Lorentz manifold (M, g) of dimension 2n >= 4 with a bundle N subset of C centre dot TM such that the fibres of N are maximal totally null and there holds the integrability condition [Sec N, Sec N] subset of Sec N. The real part of N intersection N-bar is a bundle of null directions tangent to a congruence of null geodesics. This generalizes the notion of a shear-free congruence of null geodesics (SNG) in dimension 4. Under a natural regularity assumption, the set M of all these geodesics has the structure of a Cauchy-Riemann manifold of dimension 2n - 1. Conversely, every such CR manifold lifts to many Robinson manifolds. Three definitions of a CR manifold are described here in considerable detail; they are equivalent under the assumption of real analyticity, but not in the smooth category. The distinctions between these definitions have a bearing on the validity of the Robinson theorem on the existence of null Maxwell fields associated with SNGs. This paper is largely a re...

  16. Optimal image alignment with random projections of manifolds: algorithm and geometric analysis.

    Science.gov (United States)

    Kokiopoulou, Effrosyni; Kressner, Daniel; Frossard, Pascal

    2011-06-01

    This paper addresses the problem of image alignment based on random measurements. Image alignment consists of estimating the relative transformation between a query image and a reference image. We consider the specific problem where the query image is provided in compressed form in terms of linear measurements captured by a vision sensor. We cast the alignment problem as a manifold distance minimization problem in the linear subspace defined by the measurements. The transformation manifold that represents synthesis of shift, rotation, and isotropic scaling of the reference image can be given in closed form when the reference pattern is sparsely represented over a parametric dictionary. We show that the objective function can then be decomposed as the difference of two convex functions (DC) in the particular case where the dictionary is built on Gaussian functions. Thus, the optimization problem becomes a DC program, which in turn can be solved globally by a cutting plane method. The quality of the solution is typically affected by the number of random measurements and the condition number of the manifold that describes the transformations of the reference image. We show that the curvature, which is closely related to the condition number, remains bounded in our image alignment problem, which means that the relative transformation between two images can be determined optimally in a reduced subspace.

  17. Right-angled polyhedra and hyperbolic 3-manifolds

    Science.gov (United States)

    Vesnin, A. Yu.

    2017-04-01

    Hyperbolic 3-manifolds whose fundamental groups are subgroups of finite index in right-angled Coxeter groups are under consideration. The construction of such manifolds is associated with regular colourings of the faces of polyhedra and, in particular, with 4-colourings. The following questions are discussed: the structure of the set of right-angled polytopes in Lobachevskii space; examples of orientable and non-orientable manifolds, including the classical Löbell manifold constructed in 1931; connections between the Hamiltonian property of a polyhedron and the existence of hyperelliptic involutions of manifolds; the volumes and complexity of manifolds; isometry between hyperbolic manifolds constructed from 4-colourings. Bibliography: 89 titles.

  18. On some classes of super quasi-Einstein manifolds

    International Nuclear Information System (INIS)

    Ozguer, Cihan

    2009-01-01

    Quasi-Einstein and generalized quasi-Einstein manifolds are the generalizations of Einstein manifolds. In this study, we consider a super quasi-Einstein manifold, which is another generalization of an Einstein manifold. We find the curvature characterizations of a Ricci-pseudosymmetric and a quasi-conformally flat super quasi-Einstein manifolds. We also consider the condition C ∼ .S=0 on a super quasi-Einstein manifold, where C ∼ and S denote the quasi-conformal curvature tensor and Ricci tensor of the manifold, respectively.

  19. On Riemannian manifolds (Mn, g) of quasi-constant curvature

    International Nuclear Information System (INIS)

    Rahman, M.S.

    1995-07-01

    A Riemannian manifold (M n , g) of quasi-constant curvature is defined. It is shown that an (M n , g) in association with other class of manifolds gives rise, under certain conditions, to a manifold of quasi-constant curvature. Some observations on how a manifold of quasi-constant curvature accounts for a pseudo Ricci-symmetric manifold and quasi-umbilical hypersurface are made. (author). 10 refs

  20. New complete noncompact Spin(7) manifolds

    International Nuclear Information System (INIS)

    Cvetic, M.; Gibbons, G.W.; Lue, H.; Pope, C.N.

    2002-01-01

    We construct new explicit metrics on complete noncompact Riemannian 8-manifolds with holonomy Spin(7). One manifold, which we denote by (A 8 , is topologically R 8 and another, which we denote by B 8 , is the bundle of chiral spinors over S 4 . Unlike the previously-known complete noncompact metric of Spin(7) holonomy, which was also defined on the bundle of chiral spinors over S 4 , our new metrics are asymptotically locally conical (ALC): near infinity they approach a circle bundle with fibres of constant length over a cone whose base is the squashed Einstein metric on CP 3 . We construct the covariantly-constant spinor and calibrating 4-form. We also obtain an L 2 -normalisable harmonic 4-form for the (A)) 8 manifold, and two such 4-forms (of opposite dualities) for the B 8 manifold. We use the metrics to construct new supersymmetric brane solutions in M-theory and string theory. In particular, we construct resolved fractional M2-branes involving the use of the L 2 harmonic 4-forms, and show that for each manifold there is a supersymmetric example. An intriguing feature of the new A 8 and B 8 Spin(7) metrics is that they are actually the same local solution, with the two different complete manifolds corresponding to taking the radial coordinate to be either positive or negative. We make a comparison with the Taub-NUT and Taub-BOLT metrics, which by contrast do not have special holonomy. In we construct the general solution of our first-order equations for Spin(7) holonomy, and obtain further regular metrics that are complete on manifolds B 8 + and B 8 - similar to B 8

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

  2. On conditional independence and log-convexity

    Czech Academy of Sciences Publication Activity Database

    Matúš, František

    2012-01-01

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

  3. Image restoration by the method of convex projections: part 1 theory.

    Science.gov (United States)

    Youla, D C; Webb, H

    1982-01-01

    A projection operator onto a closed convex set in Hilbert space is one of the few examples of a nonlinear map that can be defined in simple abstract terms. Moreover, it minimizes distance and is nonexpansive, and therefore shares two of the more important properties of ordinary linear orthogonal projections onto closed linear manifolds. In this paper, we exploit the properties of these operators to develop several iterative algorithms for image restoration from partial data which permit any number of nonlinear constraints of a certain type to be subsumed automatically. Their common conceptual basis is as follows. Every known property of an original image f is envisaged as restricting it to lie in a well-defined closed convex set. Thus, m such properties place f in the intersection E(0) = E(i) of the corresponding closed convex sets E(1),E(2),...EE(m). Given only the projection operators PE(i) onto the individual E(i)'s, i = 1 --> m, we restore f by recursive means. Clearly, in this approach, the realization of the P(i)'s in a Hilbert space setting is one of the major synthesis problems. Section I describes the geometrical significance of the three main theorems in considerable detail, and most of the underlying ideas are illustrated with the aid of simple diagrams. Section II presents rules for the numerical implementation of 11 specific projection operators which are found to occur frequently in many signal-processing applications, and the Appendix contains proofs of all the major results.

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

    OpenAIRE

    Diamond, Steven; Boyd, Stephen

    2016-01-01

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

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

    Science.gov (United States)

    Diamond, Steven; Boyd, Stephen

    2016-04-01

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

  6. Unsupervised image matching based on manifold alignment.

    Science.gov (United States)

    Pei, Yuru; Huang, Fengchun; Shi, Fuhao; Zha, Hongbin

    2012-08-01

    This paper challenges the issue of automatic matching between two image sets with similar intrinsic structures and different appearances, especially when there is no prior correspondence. An unsupervised manifold alignment framework is proposed to establish correspondence between data sets by a mapping function in the mutual embedding space. We introduce a local similarity metric based on parameterized distance curves to represent the connection of one point with the rest of the manifold. A small set of valid feature pairs can be found without manual interactions by matching the distance curve of one manifold with the curve cluster of the other manifold. To avoid potential confusions in image matching, we propose an extended affine transformation to solve the nonrigid alignment in the embedding space. The comparatively tight alignments and the structure preservation can be obtained simultaneously. The point pairs with the minimum distance after alignment are viewed as the matchings. We apply manifold alignment to image set matching problems. The correspondence between image sets of different poses, illuminations, and identities can be established effectively by our approach.

  7. Convex blind image deconvolution with inverse filtering

    Science.gov (United States)

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

    2018-03-01

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

  8. Effective potential for non-convex potentials

    International Nuclear Information System (INIS)

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

    1983-01-01

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

  9. INdAM Workshop on Analytic Aspects of Convexity

    CERN Document Server

    Colesanti, Andrea; Gronchi, Paolo

    2018-01-01

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

  10. Slow Invariant Manifolds in Chemically Reactive Systems

    Science.gov (United States)

    Paolucci, Samuel; Powers, Joseph M.

    2006-11-01

    The scientific design of practical gas phase combustion devices has come to rely on the use of mathematical models which include detailed chemical kinetics. Such models intrinsically admit a wide range of scales which renders their accurate numerical approximation difficult. Over the past decade, rational strategies, such as Intrinsic Low Dimensional Manifolds (ILDM) or Computational Singular Perturbations (CSP), for equilibrating fast time scale events have been successfully developed, though their computation can be challenging and their accuracy in most cases uncertain. Both are approximations to the preferable slow invariant manifold which best describes how the system evolves in the long time limit. Strategies for computing the slow invariant manifold are examined, and results are presented for practical combustion systems.

  11. Online Manifold Regularization by Dual Ascending Procedure

    Directory of Open Access Journals (Sweden)

    Boliang Sun

    2013-01-01

    Full Text Available We propose a novel online manifold regularization framework based on the notion of duality in constrained optimization. The Fenchel conjugate of hinge functions is a key to transfer manifold regularization from offline to online in this paper. Our algorithms are derived by gradient ascent in the dual function. For practical purpose, we propose two buffering strategies and two sparse approximations to reduce the computational complexity. Detailed experiments verify the utility of our approaches. An important conclusion is that our online MR algorithms can handle the settings where the target hypothesis is not fixed but drifts with the sequence of examples. We also recap and draw connections to earlier works. This paper paves a way to the design and analysis of online manifold regularization algorithms.

  12. Harmonic mappings into manifolds with boundary

    International Nuclear Information System (INIS)

    Chen Yunmei; Musina, R.

    1989-08-01

    In this paper we deal with harmonic maps from a compact Riemannian manifold into a manifold with boundary. In this case, a weak harmonic map is by definition a solution to a differential inclusion. In the first part of the paper we investigate the general properties of weak harmonic maps, which can be seen as solutions to a system of elliptic differential equations. In the second part we concentrate our attention on the heat flow method for harmonic maps. The result we achieve in this context extends a result by Chen and Struwe. (author). 21 refs

  13. Manifolds for pose tracking from monocular video

    Science.gov (United States)

    Basu, Saurav; Poulin, Joshua; Acton, Scott T.

    2015-03-01

    We formulate a simple human-pose tracking theory from monocular video based on the fundamental relationship between changes in pose and image motion vectors. We investigate the natural embedding of the low-dimensional body pose space into a high-dimensional space of body configurations that behaves locally in a linear manner. The embedded manifold facilitates the decomposition of the image motion vectors into basis motion vector fields of the tangent space to the manifold. This approach benefits from the style invariance of image motion flow vectors, and experiments to validate the fundamental theory show reasonable accuracy (within 4.9 deg of the ground truth).

  14. Effective Field Theory on Manifolds with Boundary

    Science.gov (United States)

    Albert, Benjamin I.

    In the monograph Renormalization and Effective Field Theory, Costello made two major advances in rigorous quantum field theory. Firstly, he gave an inductive position space renormalization procedure for constructing an effective field theory that is based on heat kernel regularization of the propagator. Secondly, he gave a rigorous formulation of quantum gauge theory within effective field theory that makes use of the BV formalism. In this work, we extend Costello's renormalization procedure to a class of manifolds with boundary and make preliminary steps towards extending his formulation of gauge theory to manifolds with boundary. In addition, we reorganize the presentation of the preexisting material, filling in details and strengthening the results.

  15. Matrix regularization of embedded 4-manifolds

    International Nuclear Information System (INIS)

    Trzetrzelewski, Maciej

    2012-01-01

    We consider products of two 2-manifolds such as S 2 ×S 2 , embedded in Euclidean space and show that the corresponding 4-volume preserving diffeomorphism algebra can be approximated by a tensor product SU(N)⊗SU(N) i.e. functions on a manifold are approximated by the Kronecker product of two SU(N) matrices. A regularization of the 4-sphere is also performed by constructing N 2 ×N 2 matrix representations of the 4-algebra (and as a byproduct of the 3-algebra which makes the regularization of S 3 also possible).

  16. Multi-Period Trading via Convex Optimization

    DEFF Research Database (Denmark)

    Boyd, Stephen; Busseti, Enzo; Diamond, Steve

    2017-01-01

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

  17. Conditionally exponential convex functions on locally compact groups

    International Nuclear Information System (INIS)

    Okb El-Bab, A.S.

    1992-09-01

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

  18. Approximate convex hull of affine iterated function system attractors

    International Nuclear Information System (INIS)

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

    2012-01-01

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

  19. Entropy coherent and entropy convex measures of risk

    NARCIS (Netherlands)

    Laeven, Roger; Stadje, M.A.

    2010-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Maria Hussain

    2014-07-01

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

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

    DEFF Research Database (Denmark)

    Gardner, Richard; Kiderlen, Markus; Milanfar, Peyman

    2006-01-01

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

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

    Science.gov (United States)

    Saleem, Muhammad Shoaib; Pečarić, Josip; Rehman, Nasir; Khan, Muhammad Wahab; Zahoor, Muhammad Sajid

    2018-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Muhammad Shoaib Saleem

    2018-02-01

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

  4. STRICT CONVEXITY THROUGH EQUIVALENT NORMS IN SEPARABLES BANACH SPACES

    Directory of Open Access Journals (Sweden)

    Willy Zubiaga Vera

    2016-12-01

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

  5. Four-manifolds, geometries and knots

    CERN Document Server

    Hillman, Jonathan A

    2007-01-01

    The goal of this book is to characterize algebraically the closed 4-manifolds that fibre nontrivially or admit geometries in the sense of Thurston, or which are obtained by surgery on 2-knots, and to provide a reference for the topology of such manifolds and knots. The first chapter is purely algebraic. The rest of the book may be divided into three parts: general results on homotopy and surgery (Chapters 2-6), geometries and geometric decompositions (Chapters 7-13), and 2-knots (Chapters 14-18). In many cases the Euler characteristic, fundamental group and Stiefel-Whitney classes together form a complete system of invariants for the homotopy type of such manifolds, and the possible values of the invariants can be described explicitly. The strongest results are characterizations of manifolds which fibre homotopically over S^1 or an aspherical surface (up to homotopy equivalence) and infrasolvmanifolds (up to homeomorphism). As a consequence 2-knots whose groups are poly-Z are determined up to Gluck reconstruc...

  6. M-theory and G2 manifolds

    International Nuclear Information System (INIS)

    Becker, Katrin; Becker, Melanie; Robbins, Daniel

    2015-01-01

    In this talk we report on recent progress in describing compactifications of string theory and M-theory on G 2 and Spin(7) manifolds. We include the infinite set of α’-corrections and describe the entire tower of massless and massive Kaluza–Klein modes resulting from such compactifications. (invited comment)

  7. The Koch curve as a smooth manifold

    International Nuclear Information System (INIS)

    Epstein, Marcelo; Sniatycki, Jedrzej

    2008-01-01

    We show that there exists a homeomorphism between the closed interval [0,1] is contained in R and the Koch curve endowed with the subset topology of R 2 . We use this homeomorphism to endow the Koch curve with the structure of a smooth manifold with boundary

  8. Duality constructions from quantum state manifolds

    Science.gov (United States)

    Kriel, J. N.; van Zyl, H. J. R.; Scholtz, F. G.

    2015-11-01

    The formalism of quantum state space geometry on manifolds of generalised coherent states is proposed as a natural setting for the construction of geometric dual descriptions of non-relativistic quantum systems. These state manifolds are equipped with natural Riemannian and symplectic structures derived from the Hilbert space inner product. This approach allows for the systematic construction of geometries which reflect the dynamical symmetries of the quantum system under consideration. We analyse here in detail the two dimensional case and demonstrate how existing results in the AdS 2 /CF T 1 context can be understood within this framework. We show how the radial/bulk coordinate emerges as an energy scale associated with a regularisation procedure and find that, under quite general conditions, these state manifolds are asymptotically anti-de Sitter solutions of a class of classical dilaton gravity models. For the model of conformal quantum mechanics proposed by de Alfaro et al. [1] the corresponding state manifold is seen to be exactly AdS 2 with a scalar curvature determined by the representation of the symmetry algebra. It is also shown that the dilaton field itself is given by the quantum mechanical expectation values of the dynamical symmetry generators and as a result exhibits dynamics equivalent to that of a conformal mechanical system.

  9. Toric geometry of G2-manifolds

    DEFF Research Database (Denmark)

    Madsen, Thomas Bruun; Swann, Andrew Francis

    We consider G2-manifolds with an effective torus action that is multi-Hamiltonian for one or more of the defining forms. The case of T3-actions is found to be distinguished. For such actions multi-Hamiltonian with respect to both the three- and four-form, we derive a Gibbons-Hawking type ansatz...

  10. Conservative systems with ports on contact manifolds

    NARCIS (Netherlands)

    Eberard, D.; Maschke, B.M.; van der Schaft, Arjan; Piztek, P.

    In this paper we propose an extension of port Hamiltonian systems, called conservative systems with ports, which encompass systems arising from the Irreversible Thermodynamics. Firstly we lift a port Hamiltonian system from its state space manifold to the thermodynamic phase space to a contact

  11. A generalized construction of mirror manifolds

    International Nuclear Information System (INIS)

    Berglund, P.; Huebsch, T.

    1993-01-01

    We generalize the known method for explicit construction of mirror pairs of (2,2)-superconformal field theories, using the formalism of Landau-Ginzburg orbifolds. Geometrically, these theories are realized as Calabi-Yau hypersurfaces in weighted projective spaces. This generalization makes it possible to construct the mirror partners of many manifolds for which the mirror was not previously known. (orig.)

  12. Foliations and the geometry of 3-manifolds

    CERN Document Server

    Calegari, Danny

    2014-01-01

    This unique reference, aimed at research topologists, gives an exposition of the 'pseudo-Anosov' theory of foliations of 3-manifolds. This theory generalizes Thurston's theory of surface automorphisms and reveals an intimate connection between dynamics, geometry and topology in 3 dimensions.

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

  14. The structure of some classes of K-contact manifolds

    Indian Academy of Sciences (India)

    Abstract. We study projective curvature tensor in K-contact and Sasakian manifolds. We prove that (1) if a K-contact manifold is quasi projectively flat then it is Einstein and (2) a K-contact manifold is ξ-projectively flat if and only if it is Einstein Sasakian. Necessary and sufficient conditions for a K-contact manifold to be quasi ...

  15. Zeroth Poisson Homology, Foliated Cohomology and Perfect Poisson Manifolds

    Science.gov (United States)

    Martínez-Torres, David; Miranda, Eva

    2018-01-01

    We prove that, for compact regular Poisson manifolds, the zeroth homology group is isomorphic to the top foliated cohomology group, and we give some applications. In particular, we show that, for regular unimodular Poisson manifolds, top Poisson and foliated cohomology groups are isomorphic. Inspired by the symplectic setting, we define what a perfect Poisson manifold is. We use these Poisson homology computations to provide families of perfect Poisson manifolds.

  16. Hyperbolic manifolds as vacuum solutions in Kaluza-Klein theories

    International Nuclear Information System (INIS)

    Aref'eva, I.Ya.; Volovich, I.V.

    1985-08-01

    The relevance of compact hyperbolic manifolds in the context of Kaluza-Klein theories is discussed. Examples of spontaneous compactification on hyperbolic manifolds including d dimensional (d>=8) Einstein-Yang-Mills gravity and 11-dimensional supergravity are considered. Some mathematical facts about hyperbolic manifolds essential for the physical content of the theory are briefly summarized. Non-linear σ-models based on hyperbolic manifolds are discussed. (author)

  17. Fluid manifold design for a solar energy storage tank

    Science.gov (United States)

    Humphries, W. R.; Hewitt, H. C.; Griggs, E. I.

    1975-01-01

    A design technique for a fluid manifold for use in a solar energy storage tank is given. This analytical treatment generalizes the fluid equations pertinent to manifold design, giving manifold pressures, velocities, and orifice pressure differentials in terms of appropriate fluid and manifold geometry parameters. Experimental results used to corroborate analytical predictions are presented. These data indicate that variations in discharge coefficients due to variations in orifices can cause deviations between analytical predictions and actual performance values.

  18. Some theorems on a class of harmonic manifolds

    International Nuclear Information System (INIS)

    Rahman, M.S.; Chen Weihuan.

    1993-08-01

    A class of harmonic n-manifold, denoted by HM n , is, in fact, focussed on a Riemannian manifold with harmonic curvature. A variety of results, with properties, on HM n is presented in a fair order. Harmonic manifolds are then touched upon manifolds with recurrent Ricci curvature, biRicci-recurrent curvature and recurrent conformal curvature, and, in consequence, a sequence of theorems are deduced. (author). 21 refs

  19. Harmonic Riemannian Maps on Locally Conformal Kaehler Manifolds

    Indian Academy of Sciences (India)

    We study harmonic Riemannian maps on locally conformal Kaehler manifolds ( l c K manifolds). We show that if a Riemannian holomorphic map between l c K manifolds is harmonic, then the Lee vector field of the domain belongs to the kernel of the Riemannian map under a condition. When the domain is Kaehler, we ...

  20. Higher-order Jordan Osserman pseudo-Riemannian manifolds

    International Nuclear Information System (INIS)

    Gilkey, Peter B; Ivanova, Raina; Zhang Tan

    2002-01-01

    We study the higher-order Jacobi operator in pseudo-Riemannian geometry. We exhibit a family of manifolds so that this operator has constant Jordan normal form on the Grassmannian of subspaces of signature (r, s) for certain values of (r, s). These pseudo-Riemannian manifolds are new and non-trivial examples of higher-order Osserman manifolds

  1. Higher-order Jordan Osserman pseudo-Riemannian manifolds

    Energy Technology Data Exchange (ETDEWEB)

    Gilkey, Peter B [Mathematics Department, University of Oregon, Eugene, OR 97403 (United States); Ivanova, Raina [Mathematics Department, University of Hawaii - Hilo, 200 W Kawili St, Hilo, HI 96720 (United States); Zhang Tan [Department of Mathematics and Statistics, Murray State University, Murray, KY 42071 (United States)

    2002-09-07

    We study the higher-order Jacobi operator in pseudo-Riemannian geometry. We exhibit a family of manifolds so that this operator has constant Jordan normal form on the Grassmannian of subspaces of signature (r, s) for certain values of (r, s). These pseudo-Riemannian manifolds are new and non-trivial examples of higher-order Osserman manifolds.

  2. Wave equations on anti self dual (ASD) manifolds

    Science.gov (United States)

    Bashingwa, Jean-Juste; Kara, A. H.

    2017-11-01

    In this paper, we study and perform analyses of the wave equation on some manifolds with non diagonal metric g_{ij} which are of neutral signatures. These include the invariance properties, variational symmetries and conservation laws. In the recent past, wave equations on the standard (space time) Lorentzian manifolds have been performed but not on the manifolds from metrics of neutral signatures.

  3. Decomposability and convex structure of thermal processes

    Science.gov (United States)

    Mazurek, Paweł; Horodecki, Michał

    2018-05-01

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

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

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

    DEFF Research Database (Denmark)

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

    2018-01-01

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

  6. Topological quantum field theory and four manifolds

    CERN Document Server

    Marino, Marcos

    2005-01-01

    The present book is the first of its kind in dealing with topological quantum field theories and their applications to topological aspects of four manifolds. It is not only unique for this reason but also because it contains sufficient introductory material that it can be read by mathematicians and theoretical physicists. On the one hand, it contains a chapter dealing with topological aspects of four manifolds, on the other hand it provides a full introduction to supersymmetry. The book constitutes an essential tool for researchers interested in the basics of topological quantum field theory, since these theories are introduced in detail from a general point of view. In addition, the book describes Donaldson theory and Seiberg-Witten theory, and provides all the details that have led to the connection between these theories using topological quantum field theory. It provides a full account of Witten’s magic formula relating Donaldson and Seiberg-Witten invariants. Furthermore, the book presents some of the ...

  7. Modular categories and 3-manifold invariants

    International Nuclear Information System (INIS)

    Tureav, V.G.

    1992-01-01

    The aim of this paper is to give a concise introduction to the theory of knot invariants and 3-manifold invariants which generalize the Jones polynomial and which may be considered as a mathematical version of the Witten invariants. Such a theory was introduced by N. Reshetikhin and the author on the ground of the theory of quantum groups. here we use more general algebraic objects, specifically, ribbon and modular categories. Such categories in particular arise as the categories of representations of quantum groups. The notion of modular category, interesting in itself, is closely related to the notion of modular tensor category in the sense of G. Moore and N. Seiberg. For simplicity we restrict ourselves in this paper to the case of closed 3-manifolds

  8. Echocardiogram enhancement using supervised manifold denoising.

    Science.gov (United States)

    Wu, Hui; Huynh, Toan T; Souvenir, Richard

    2015-08-01

    This paper presents data-driven methods for echocardiogram enhancement. Existing denoising algorithms typically rely on a single noise model, and do not generalize to the composite noise sources typically found in real-world echocardiograms. Our methods leverage the low-dimensional intrinsic structure of echocardiogram videos. We assume that echocardiogram images are noisy samples from an underlying manifold parametrized by cardiac motion and denoise images via back-projection onto a learned (non-linear) manifold. Our methods incorporate synchronized side information (e.g., electrocardiography), which is often collected alongside the visual data. We evaluate the proposed methods on a synthetic data set and real-world echocardiograms. Quantitative results show improved performance of our methods over recent image despeckling methods and video denoising methods, and a visual analysis of real-world data shows noticeable image enhancement, even in the challenging case of noise due to dropout artifacts. Copyright © 2015 Elsevier B.V. All rights reserved.

  9. Topological anomalies for Seifert 3-manifolds

    Energy Technology Data Exchange (ETDEWEB)

    Imbimbo, Camillo [Dipartimento di Fisica, Università di Genova,Via Dodecaneso 33, 16146 Genova (Italy); INFN - Sezione di Genova,Via Dodecaneso 33, 16146, Genova (Italy); Rosa, Dario [School of Physics and Astronomy andCenter for Theoretical Physics Seoul National University,Seoul 151-747 (Korea, Republic of); Dipartimento di Fisica, Università di Milano-Bicocca,I-20126 Milano (Italy); INFN - Sezione di Milano-Bicocca,I-20126 Milano (Italy)

    2015-07-14

    We study globally supersymmetric 3d gauge theories on curved manifolds by describing the coupling of 3d topological gauge theories, with both Yang-Mills and Chern-Simons terms in the action, to background topological gravity. In our approach, the Seifert condition for manifolds supporting global supersymmetry is elegantly deduced from the BRST transformations of topological gravity. A cohomological characterization of the geometrical moduli which affect the partition function is obtained. In the Seifert context the Chern-Simons topological (framing) anomaly is BRST trivial. We compute explicitly the corresponding local Wess-Zumino functional. As an application, we obtain the dependence on the Seifert moduli of the partition function of 3d supersymmetric gauge theory on the squashed sphere by solving the anomalous topological Ward identities, in a regularization independent way and without the need of evaluating any functional determinant.

  10. Dynamical systems on 2- and 3-manifolds

    CERN Document Server

    Grines, Viacheslav Z; Pochinka, Olga V

    2016-01-01

    This book provides an introduction to the topological classification of smooth structurally stable diffeomorphisms on closed orientable 2- and 3-manifolds.The topological classification is one of the main problems of the theory of dynamical systems and the results presented in this book are mostly for dynamical systems satisfying Smale's Axiom A. The main results on the topological classification of discrete dynamical systems are widely scattered among many papers and surveys. This book presents these results fluidly, systematically, and for the first time in one publication. Additionally, this book discusses the recent results on the topological classification of Axiom A diffeomorphisms focusing on the nontrivial effects of the dynamical systems on 2- and 3-manifolds. The classical methods and approaches which are considered to be promising for the further research are also discussed. < The reader needs to be familiar with the basic concepts of the qualitative theory of dynamical systems which are present...

  11. Sasakian manifolds with purely transversal Bach tensor

    Science.gov (United States)

    Ghosh, Amalendu; Sharma, Ramesh

    2017-10-01

    We show that a (2n + 1)-dimensional Sasakian manifold (M, g) with a purely transversal Bach tensor has constant scalar curvature ≥2 n (2 n +1 ) , equality holding if and only if (M, g) is Einstein. For dimension 3, M is locally isometric to the unit sphere S3. For dimension 5, if in addition (M, g) is complete, then it has positive Ricci curvature and is compact with finite fundamental group π1(M).

  12. CFD simulations for engine intake manifolds

    International Nuclear Information System (INIS)

    Witry, A.; Zhao, A.

    2002-01-01

    This paper attempts to explain a procedure for using Computational Fluid Dynamics (CFD) for product development of engine intake manifolds. The paper uses the development of an intake manifold as an example of such a process. Using the commercial FLUENT solver, its standard wall functions and k-ε model, a four runner intake manifold with an average mesh size of 300, 000 hexa elements created in ICEM-CFD with a maximum skewness of 0.85 produces rapid results for quick product turn-around times. The setup used allows for compressibility and viscous heating effects to be modeled whilst ignoring wall heat transfer due to the high speeds of the air/foil mixture and low residence times. Eight consecutive models were modeled here whilst carrying out continuous enhancements. For every iteration, four different so called 'static' runs with only one runner open at any one time using a steady state assumption were calculated further assuming that only one intake valve is open at any one time. Even flow distributions between the runner are deemed to be 'dynamically' obtained once the pressure drops between the manifold's inlet and runner outlets are equalized. Furthermore, different modifications were attempted to ensure that the fluid's particle tracks show very little particle return tendencies along with excellent nonuniformity indexes at the runners outlets. Confirmation of these results were obtained from test data showing CFD pressure drop predictions to be within 4% error with 67% of any runner's pressure losses being caused in the runner itself due to the small cross sectional area(s). (author)

  13. Fine topology and locally Minkowskian manifolds

    Science.gov (United States)

    Agrawal, Gunjan; Sinha, Soami Pyari

    2018-05-01

    Fine topology is one of the several well-known topologies of physical and mathematical relevance. In the present paper, it is obtained that the nonempty open sets of different dimensional Minkowski spaces with the fine topology are not homeomorphic. This leads to the introduction of a new class of manifolds. It turns out that the technique developed here is also applicable to some other topologies, namely, the s-topology, space topology, f-topology, and A-topology.

  14. On complete manifolds supporting a weighted Sobolev type inequality

    International Nuclear Information System (INIS)

    Adriano, Levi; Xia Changyu

    2011-01-01

    Highlights: → We study manifolds supporting a weighted Sobolev or log-Sobolev inequality. → We investigate manifolds of asymptotically non-negative Ricci curvature. → The constant in the weighted Sobolev inequality on complete manifolds is studied. - Abstract: This paper studies the geometric and topological properties of complete open Riemannian manifolds which support a weighted Sobolev or log-Sobolev inequality. We show that the constant in the weighted Sobolev inequality on a complete open Riemannian manifold should be bigger than or equal to the optimal one on the Euclidean space of the same dimension and that a complete open manifold of asymptotically non-negative Ricci curvature supporting a weighted Sobolev inequality must have large volume growth. We also show that a complete manifold of non-negative Ricci curvature on which the log-Sobolev inequality holds is not very far from the Euclidean space.

  15. Sasaki-Einstein Manifolds and Volume Minimisation

    CERN Document Server

    Martelli, D; Yau, S T; Martelli, Dario; Sparks, James; Yau, Shing-Tung

    2006-01-01

    We study a variational problem whose critical point determines the Reeb vector field for a Sasaki-Einstein manifold. This extends our previous work on Sasakian geometry by lifting the condition that the manifolds are toric. We show that the Einstein-Hilbert action, restricted to a space of Sasakian metrics on a link L in a Calabi-Yau cone M, is the volume functional, which in fact is a function on the space of Reeb vector fields. We relate this function both to the Duistermaat-Heckman formula and also to a limit of a certain equivariant index on M that counts holomorphic functions. Both formulae may be evaluated by localisation. This leads to a general formula for the volume function in terms of topological fixed point data. As a result we prove that the volume of any Sasaki-Einstein manifold, relative to that of the round sphere, is always an algebraic number. In complex dimension n=3 these results provide, via AdS/CFT, the geometric counterpart of a-maximisation in four dimensional superconformal field theo...

  16. Manifold learning in machine vision and robotics

    Science.gov (United States)

    Bernstein, Alexander

    2017-02-01

    Smart algorithms are used in Machine vision and Robotics to organize or extract high-level information from the available data. Nowadays, Machine learning is an essential and ubiquitous tool to automate extraction patterns or regularities from data (images in Machine vision; camera, laser, and sonar sensors data in Robotics) in order to solve various subject-oriented tasks such as understanding and classification of images content, navigation of mobile autonomous robot in uncertain environments, robot manipulation in medical robotics and computer-assisted surgery, and other. Usually such data have high dimensionality, however, due to various dependencies between their components and constraints caused by physical reasons, all "feasible and usable data" occupy only a very small part in high dimensional "observation space" with smaller intrinsic dimensionality. Generally accepted model of such data is manifold model in accordance with which the data lie on or near an unknown manifold (surface) of lower dimensionality embedded in an ambient high dimensional observation space; real-world high-dimensional data obtained from "natural" sources meet, as a rule, this model. The use of Manifold learning technique in Machine vision and Robotics, which discovers a low-dimensional structure of high dimensional data and results in effective algorithms for solving of a large number of various subject-oriented tasks, is the content of the conference plenary speech some topics of which are in the paper.

  17. A survey on locally uniformly A-convex algebras

    International Nuclear Information System (INIS)

    Oudadess, M.

    1984-12-01

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

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

  19. A note on supercyclic operators in locally convex spaces

    OpenAIRE

    Albanese, Angela A.; Jornet, David

    2018-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Haiyan Wang

    2009-10-01

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

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

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

    KAUST Repository

    Seneci, Tommaso

    2018-05-01

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

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

    African Journals Online (AJOL)

    user

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

  4. Surgical treatment of convexity focal epilepsy

    International Nuclear Information System (INIS)

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

    1987-01-01

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

  5. Efficiency and Generalized Convex Duality for Nondifferentiable Multiobjective Programs

    Directory of Open Access Journals (Sweden)

    Bae KwanDeok

    2010-01-01

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

  6. Two examples of non strictly convex large deviations

    OpenAIRE

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

    2016-01-01

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

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

    NARCIS (Netherlands)

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

    2007-01-01

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

  8. Surgery for convexity/parasagittal/falx meningiomas

    International Nuclear Information System (INIS)

    Ochi, Takashi; Saito, Nobuhito

    2013-01-01

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

  9. Monoids of moduli spaces of manifolds

    DEFF Research Database (Denmark)

    Galatius, Søren; Randal-Williams, Oscar

    2010-01-01

    We study categories of d–dimensional cobordisms from the perspective of Tillmann [Invent. Math. 130 (1997) 257–275] and Galatius, Madsen, Tillman and Weiss [Acta Math. 202 (2009) 195–239]. There is a category C¿ of closed smooth (d - 1)–manifolds and smooth d–dimensional cobordisms, equipped...... with generalised orientations specified by a map ¿: X ¿ BO(d). The main result of [Acta Math. 202 (2009) 195–239] is a determination of the homotopy type of the classifying space BC¿. The goal of the present paper is a systematic investigation of subcategories D¿C¿ with the property that BD¿ BC¿, the smaller...

  10. Manifold structure preservative for hyperspectral target detection

    Science.gov (United States)

    Imani, Maryam

    2018-05-01

    A nonparametric method termed as manifold structure preservative (MSP) is proposed in this paper for hyperspectral target detection. MSP transforms the feature space of data to maximize the separation between target and background signals. Moreover, it minimizes the reconstruction error of targets and preserves the topological structure of data in the projected feature space. MSP does not need to consider any distribution for target and background data. So, it can achieve accurate results in real scenarios due to avoiding unreliable assumptions. The proposed MSP detector is compared to several popular detectors and the experiments on a synthetic data and two real hyperspectral images indicate the superior ability of it in target detection.

  11. Rational Homological Stability for Automorphisms of Manifolds

    DEFF Research Database (Denmark)

    Grey, Matthias

    In this thesis we prove rational homological stability for the classifying spaces of the homotopy automorphisms and block di↵eomorphisms of iterated connected sums of products of spheres of a certain connectivity.The results in particular apply to the manifolds       Npg,q  = (#g(Sp x Sq)) - int...... with coefficients in the homology of the universal covering, which is studied using rational homology theory. The result for the block di↵eomorphisms is deduced from the homological stability for the homotopy automorphisms upon using Surgery theory. Themain theorems of this thesis extend the homological stability...

  12. Laplacian embedded regression for scalable manifold regularization.

    Science.gov (United States)

    Chen, Lin; Tsang, Ivor W; Xu, Dong

    2012-06-01

    Semi-supervised learning (SSL), as a powerful tool to learn from a limited number of labeled data and a large number of unlabeled data, has been attracting increasing attention in the machine learning community. In particular, the manifold regularization framework has laid solid theoretical foundations for a large family of SSL algorithms, such as Laplacian support vector machine (LapSVM) and Laplacian regularized least squares (LapRLS). However, most of these algorithms are limited to small scale problems due to the high computational cost of the matrix inversion operation involved in the optimization problem. In this paper, we propose a novel framework called Laplacian embedded regression by introducing an intermediate decision variable into the manifold regularization framework. By using ∈-insensitive loss, we obtain the Laplacian embedded support vector regression (LapESVR) algorithm, which inherits the sparse solution from SVR. Also, we derive Laplacian embedded RLS (LapERLS) corresponding to RLS under the proposed framework. Both LapESVR and LapERLS possess a simpler form of a transformed kernel, which is the summation of the original kernel and a graph kernel that captures the manifold structure. The benefits of the transformed kernel are two-fold: (1) we can deal with the original kernel matrix and the graph Laplacian matrix in the graph kernel separately and (2) if the graph Laplacian matrix is sparse, we only need to perform the inverse operation for a sparse matrix, which is much more efficient when compared with that for a dense one. Inspired by kernel principal component analysis, we further propose to project the introduced decision variable into a subspace spanned by a few eigenvectors of the graph Laplacian matrix in order to better reflect the data manifold, as well as accelerate the calculation of the graph kernel, allowing our methods to efficiently and effectively cope with large scale SSL problems. Extensive experiments on both toy and real

  13. Exact Polynomial Eigenmodes for Homogeneous Spherical 3-Manifolds

    OpenAIRE

    Weeks, Jeffrey R.

    2005-01-01

    Observational data hints at a finite universe, with spherical manifolds such as the Poincare dodecahedral space tentatively providing the best fit. Simulating the physics of a model universe requires knowing the eigenmodes of the Laplace operator on the space. The present article provides explicit polynomial eigenmodes for all globally homogeneous 3-manifolds: the Poincare dodecahedral space S3/I*, the binary octahedral space S3/O*, the binary tetrahedral space S3/T*, the prism manifolds S3/D...

  14. Strong Proximities on Smooth Manifolds and Vorono\\" i Diagrams

    OpenAIRE

    Peters, J. F.; Guadagni, C.

    2015-01-01

    This article introduces strongly near smooth manifolds. The main results are (i) second countability of the strongly hit and far-miss topology on a family $\\mathcal{B}$ of subsets on the Lodato proximity space of regular open sets to which singletons are added, (ii) manifold strong proximity, (iii) strong proximity of charts in manifold atlases implies that the charts have nonempty intersection. The application of these results is given in terms of the nearness of atlases and charts of proxim...

  15. Some problems of dynamical systems on three dimensional manifolds

    International Nuclear Information System (INIS)

    Dong Zhenxie.

    1985-08-01

    It is important to study the dynamical systems on 3-dimensional manifolds, its importance is showing up in its close relation with our life. Because of the complication of topological structure of Dynamical systems on 3-dimensional manifolds, generally speaking, the search for 3-dynamical systems is not easier than 2-dynamical systems. This paper is a summary of the partial result of dynamical systems on 3-dimensional manifolds. (author)

  16. Total Generalized Variation for Manifold-valued Data

    OpenAIRE

    Bredies, K.; Holler, M.; Storath, M.; Weinmann, A.

    2017-01-01

    In this paper we introduce the notion of second-order total generalized variation (TGV) regularization for manifold-valued data. We provide an axiomatic approach to formalize reasonable generalizations of TGV to the manifold setting and present two possible concrete instances that fulfill the proposed axioms. We provide well-posedness results and present algorithms for a numerical realization of these generalizations to the manifold setup. Further, we provide experimental results for syntheti...

  17. CT Image Reconstruction in a Low Dimensional Manifold

    OpenAIRE

    Cong, Wenxiang; Wang, Ge; Yang, Qingsong; Hsieh, Jiang; Li, Jia; Lai, Rongjie

    2017-01-01

    Regularization methods are commonly used in X-ray CT image reconstruction. Different regularization methods reflect the characterization of different prior knowledge of images. In a recent work, a new regularization method called a low-dimensional manifold model (LDMM) is investigated to characterize the low-dimensional patch manifold structure of natural images, where the manifold dimensionality characterizes structural information of an image. In this paper, we propose a CT image reconstruc...

  18. On the trace-manifold generated by the deformations of a body-manifold

    Directory of Open Access Journals (Sweden)

    Boja Nicolae

    2003-01-01

    Full Text Available In this paper, concerned to the study of continuous deformations of material media using some tools of modem differential geometry, a moving frame of Frenet type along the orbits of an one-parameter group acting on a so-called "trace-manifold", M, associated to the deformations, is constructed. The manifold M is defined as an infinite union of non-disjoint compact manifolds, generated by the consecutive positions in the Euclidean affine 3-space of a body-manifold under deformations in a closed time interval. We put in evidence a skew-symmetric band tensor of second order, ω, which describes the deformation in a small neighborhood of any point along the orbits. The non-null components ωi,i+i, (i =1,2, of ω are assimilated as like curvatures at each point of an orbit in the planes generated by the pairs of vectors (ĕi,ĕi+i of a moving frame in M associated to the orbit in a similar way as the Frenet's frame is. Also a formula for the energy of the orbits is given and its relationship with some stiffness matrices is established.

  19. LCD OF AIR INTAKE MANIFOLDS PHASE 2: FORD F250 AIR INTAKE MANIFOLD

    Science.gov (United States)

    The life cycle design methodology was applied to the design analysis of three alternatives for the lower plehum of the air intake manifold for us with a 5.4L F-250 truck engine: a sand cast aluminum, a lost core molded nylon composite, and a vibration welded nylon composite. The ...

  20. Variable area manifolds for ring mirror heat exchangers

    Science.gov (United States)

    Eng, Albert; Senterfitt, Donald R.

    1988-05-01

    A laser ring mirror assembly is disclosed which supports and cools an annular ring mirror of a high powered laser with a cooling manifold which has a coolant flow design which is intended to reduce thermal distortions of the ring mirror by minimizing azimuthal variations in temperature around its circumference. The cooling manifold has complementary pairs of cooling passages each of which conduct coolant in opposite flow directions. The manifold also houses adjusters which vary the depth between the annular ring mirror and each cooling, and which vary the flow area of the cooling passage to produce a control over the cooling characteristics of the cooling manifold.

  1. Totally Contact Umbilical Lightlike Hypersurfaces of Indefinite -Manifolds

    Directory of Open Access Journals (Sweden)

    Rachna Rani

    2013-01-01

    Full Text Available We study totally contact umbilical lightlike hypersurfaces of indefinite -manifolds and prove the nonexistence of totally contact umbilical lightlike hypersurface in indefinite -space form.

  2. Efficient orbit integration by manifold correction methods.

    Science.gov (United States)

    Fukushima, Toshio

    2005-12-01

    Triggered by a desire to investigate, numerically, the planetary precession through a long-term numerical integration of the solar system, we developed a new formulation of numerical integration of orbital motion named manifold correct on methods. The main trick is to rigorously retain the consistency of physical relations, such as the orbital energy, the orbital angular momentum, or the Laplace integral, of a binary subsystem. This maintenance is done by applying a correction to the integrated variables at each integration step. Typical methods of correction are certain geometric transformations, such as spatial scaling and spatial rotation, which are commonly used in the comparison of reference frames, or mathematically reasonable operations, such as modularization of angle variables into the standard domain [-pi, pi). The form of the manifold correction methods finally evolved are the orbital longitude methods, which enable us to conduct an extremely precise integration of orbital motions. In unperturbed orbits, the integration errors are suppressed at the machine epsilon level for an indefinitely long period. In perturbed cases, on the other hand, the errors initially grow in proportion to the square root of time and then increase more rapidly, the onset of which depends on the type and magnitude of the perturbations. This feature is also realized for highly eccentric orbits by applying the same idea as used in KS-regularization. In particular, the introduction of time elements greatly enhances the performance of numerical integration of KS-regularized orbits, whether the scaling is applied or not.

  3. Manifold-Based Visual Object Counting.

    Science.gov (United States)

    Wang, Yi; Zou, Yuexian; Wang, Wenwu

    2018-07-01

    Visual object counting (VOC) is an emerging area in computer vision which aims to estimate the number of objects of interest in a given image or video. Recently, object density based estimation method is shown to be promising for object counting as well as rough instance localization. However, the performance of this method tends to degrade when dealing with new objects and scenes. To address this limitation, we propose a manifold-based method for visual object counting (M-VOC), based on the manifold assumption that similar image patches share similar object densities. Firstly, the local geometry of a given image patch is represented linearly by its neighbors using a predefined patch training set, and the object density of this given image patch is reconstructed by preserving the local geometry using locally linear embedding. To improve the characterization of local geometry, additional constraints such as sparsity and non-negativity are also considered via regularization, nonlinear mapping, and kernel trick. Compared with the state-of-the-art VOC methods, our proposed M-VOC methods achieve competitive performance on seven benchmark datasets. Experiments verify that the proposed M-VOC methods have several favorable properties, such as robustness to the variation in the size of training dataset and image resolution, as often encountered in real-world VOC applications.

  4. Lagrangian descriptors of driven chemical reaction manifolds.

    Science.gov (United States)

    Craven, Galen T; Junginger, Andrej; Hernandez, Rigoberto

    2017-08-01

    The persistence of a transition state structure in systems driven by time-dependent environments allows the application of modern reaction rate theories to solution-phase and nonequilibrium chemical reactions. However, identifying this structure is problematic in driven systems and has been limited by theories built on series expansion about a saddle point. Recently, it has been shown that to obtain formally exact rates for reactions in thermal environments, a transition state trajectory must be constructed. Here, using optimized Lagrangian descriptors [G. T. Craven and R. Hernandez, Phys. Rev. Lett. 115, 148301 (2015)PRLTAO0031-900710.1103/PhysRevLett.115.148301], we obtain this so-called distinguished trajectory and the associated moving reaction manifolds on model energy surfaces subject to various driving and dissipative conditions. In particular, we demonstrate that this is exact for harmonic barriers in one dimension and this verification gives impetus to the application of Lagrangian descriptor-based methods in diverse classes of chemical reactions. The development of these objects is paramount in the theory of reaction dynamics as the transition state structure and its underlying network of manifolds directly dictate reactivity and selectivity.

  5. Convex unwraps its first grown-up supercomputer

    Energy Technology Data Exchange (ETDEWEB)

    Manuel, T.

    1988-03-03

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

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

    Science.gov (United States)

    Peterson, Mary A; Salvagio, Elizabeth

    2008-12-15

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

  7. Dose evaluation from multiple detector outputs using convex optimisation

    International Nuclear Information System (INIS)

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

    2011-01-01

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

  8. Convexity and concavity constants in Lorentz and Marcinkiewicz spaces

    Science.gov (United States)

    Kaminska, Anna; Parrish, Anca M.

    2008-07-01

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

  9. Transient disturbance growth in flows over convex surfaces

    Science.gov (United States)

    Karp, Michael; Hack, M. J. Philipp

    2017-11-01

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

  10. Manifold corrections on spinning compact binaries

    International Nuclear Information System (INIS)

    Zhong Shuangying; Wu Xin

    2010-01-01

    This paper deals mainly with a discussion of three new manifold correction methods and three existing ones, which can numerically preserve or correct all integrals in the conservative post-Newtonian Hamiltonian formulation of spinning compact binaries. Two of them are listed here. One is a new momentum-position scaling scheme for complete consistency of both the total energy and the magnitude of the total angular momentum, and the other is the Nacozy's approach with least-squares correction of the four integrals including the total energy and the total angular momentum vector. The post-Newtonian contributions, the spin effects, and the classification of orbits play an important role in the effectiveness of these six manifold corrections. They are all nearly equivalent to correct the integrals at the level of the machine epsilon for the pure Kepler problem. Once the third-order post-Newtonian contributions are added to the pure orbital part, three of these corrections have only minor effects on controlling the errors of these integrals. When the spin effects are also included, the effectiveness of the Nacozy's approach becomes further weakened, and even gets useless for the chaotic case. In all cases tested, the new momentum-position scaling scheme always shows the optimal performance. It requires a little but not much expensive additional computational cost when the spin effects exist and several time-saving techniques are used. As an interesting case, the efficiency of the correction to chaotic eccentric orbits is generally better than one to quasicircular regular orbits. Besides this, the corrected fast Lyapunov indicators and Lyapunov exponents of chaotic eccentric orbits are large as compared with the uncorrected counterparts. The amplification is a true expression of the original dynamical behavior. With the aid of both the manifold correction added to a certain low-order integration algorithm as a fast and high-precision device and the fast Lyapunov

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

  12. Convex Hull Abstraction in Specialisation of CLP Programs

    DEFF Research Database (Denmark)

    Peralta, J.C.; Gallagher, John Patrick

    2003-01-01

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

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

  14. Distribution functions of sections and projections of convex bodies

    OpenAIRE

    Kim, Jaegil; Yaskin, Vladyslav; Zvavitch, Artem

    2015-01-01

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

  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. Relaxation Methods for Strictly Convex Regularizations of Piecewise Linear Programs

    International Nuclear Information System (INIS)

    Kiwiel, K. C.

    1998-01-01

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

  17. The quantum equivariant cohomology of toric manifolds through mirror symmetry

    OpenAIRE

    Baptista, J. M.

    2008-01-01

    Using mirror symmetry as described by Hori and Vafa, we compute the quantum equivariant cohomology ring of toric manifolds. This ring arises naturally in topological gauged sigma-models and is related to the Hamiltonian Gromov-Witten invariants of the target manifold.

  18. Conformal Vector Fields on Doubly Warped Product Manifolds and Applications

    Directory of Open Access Journals (Sweden)

    H. K. El-Sayied

    2016-01-01

    Full Text Available This article aimed to study and explore conformal vector fields on doubly warped product manifolds as well as on doubly warped spacetime. Then we derive sufficient conditions for matter and Ricci collineations on doubly warped product manifolds. A special attention is paid to concurrent vector fields. Finally, Ricci solitons on doubly warped product spacetime admitting conformal vector fields are considered.

  19. The quantum equivariant cohomology of toric manifolds through mirror symmetry

    NARCIS (Netherlands)

    Baptista, J.M.

    2009-01-01

    Using mirror symmetry as described by Hori and Vafa, we compute the quantum equivariant cohomology ring of toric manifolds. This ring arises naturally in topological gauged sigma-models and is related to the Hamiltonian Gromov-Witten invariants of the target manifold.

  20. Variable volume combustor with nested fuel manifold system

    Science.gov (United States)

    McConnaughhay, Johnie Franklin; Keener, Christopher Paul; Johnson, Thomas Edward; Ostebee, Heath Michael

    2016-09-13

    The present application provides a combustor for use with a gas turbine engine. The combustor may include a number of micro-mixer fuel nozzles, a fuel manifold system in communication with the micro-mixer fuel nozzles to deliver a flow of fuel thereto, and a linear actuator to maneuver the micro-mixer fuel nozzles and the fuel manifold system.

  1. Generalized Transversal Lightlike Submanifolds of Indefinite Sasakian Manifolds

    OpenAIRE

    Yaning Wang; Ximin Liu

    2012-01-01

    We introduce and study generalized transversal lightlike submanifold of indefinite Sasakian manifolds which includes radical and transversal lightlike submanifolds of indefinite Sasakian manifolds as its trivial subcases. A characteristic theorem and a classification theorem of generalized transversal lightlike submanifolds are obtained.

  2. Geometric solitons of Hamiltonian flows on manifolds

    Energy Technology Data Exchange (ETDEWEB)

    Song, Chong, E-mail: songchong@xmu.edu.cn [School of Mathematical Sciences, Xiamen University, Xiamen 361005 (China); Sun, Xiaowei, E-mail: sunxw@cufe.edu.cn [School of Applied Mathematics, Central University of Finance and Economics, Beijing 100081 (China); Wang, Youde, E-mail: wyd@math.ac.cn [Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190 (China)

    2013-12-15

    It is well-known that the LIE (Locally Induction Equation) admit soliton-type solutions and same soliton solutions arise from different and apparently irrelevant physical models. By comparing the solitons of LIE and Killing magnetic geodesics, we observe that these solitons are essentially decided by two families of isometries of the domain and the target space, respectively. With this insight, we propose the new concept of geometric solitons of Hamiltonian flows on manifolds, such as geometric Schrödinger flows and KdV flows for maps. Moreover, we give several examples of geometric solitons of the Schrödinger flow and geometric KdV flow, including magnetic curves as geometric Schrödinger solitons and explicit geometric KdV solitons on surfaces of revolution.

  3. Contact manifolds, Lagrangian Grassmannians and PDEs

    Directory of Open Access Journals (Sweden)

    Eshkobilov Olimjon

    2018-02-01

    Full Text Available In this paper we review a geometric approach to PDEs. We mainly focus on scalar PDEs in n independent variables and one dependent variable of order one and two, by insisting on the underlying (2n + 1-dimensional contact manifold and the so-called Lagrangian Grassmannian bundle over the latter. This work is based on a Ph.D course given by two of the authors (G. M. and G. M.. As such, it was mainly designed as a quick introduction to the subject for graduate students. But also the more demanding reader will be gratified, thanks to the frequent references to current research topics and glimpses of higher-level mathematics, found mostly in the last sections.

  4. Evolutionary global optimization, manifolds and applications

    CERN Document Server

    Aguiar e Oliveira Junior, Hime

    2016-01-01

    This book presents powerful techniques for solving global optimization problems on manifolds by means of evolutionary algorithms, and shows in practice how these techniques can be applied to solve real-world problems. It describes recent findings and well-known key facts in general and differential topology, revisiting them all in the context of application to current optimization problems. Special emphasis is put on game theory problems. Here, these problems are reformulated as constrained global optimization tasks and solved with the help of Fuzzy ASA. In addition, more abstract examples, including minimizations of well-known functions, are also included. Although the Fuzzy ASA approach has been chosen as the main optimizing paradigm, the book suggests that other metaheuristic methods could be used as well. Some of them are introduced, together with their advantages and disadvantages. Readers should possess some knowledge of linear algebra, and of basic concepts of numerical analysis and probability theory....

  5. Transition Manifolds of Complex Metastable Systems

    Science.gov (United States)

    Bittracher, Andreas; Koltai, Péter; Klus, Stefan; Banisch, Ralf; Dellnitz, Michael; Schütte, Christof

    2018-04-01

    We consider complex dynamical systems showing metastable behavior, but no local separation of fast and slow time scales. The article raises the question of whether such systems exhibit a low-dimensional manifold supporting its effective dynamics. For answering this question, we aim at finding nonlinear coordinates, called reaction coordinates, such that the projection of the dynamics onto these coordinates preserves the dominant time scales of the dynamics. We show that, based on a specific reducibility property, the existence of good low-dimensional reaction coordinates preserving the dominant time scales is guaranteed. Based on this theoretical framework, we develop and test a novel numerical approach for computing good reaction coordinates. The proposed algorithmic approach is fully local and thus not prone to the curse of dimension with respect to the state space of the dynamics. Hence, it is a promising method for data-based model reduction of complex dynamical systems such as molecular dynamics.

  6. Manifold Adaptive Label Propagation for Face Clustering.

    Science.gov (United States)

    Pei, Xiaobing; Lyu, Zehua; Chen, Changqing; Chen, Chuanbo

    2015-08-01

    In this paper, a novel label propagation (LP) method is presented, called the manifold adaptive label propagation (MALP) method, which is to extend original LP by integrating sparse representation constraint into regularization framework of LP method. Similar to most LP, first of all, MALP also finds graph edges from given data and gives weights to the graph edges. Our goal is to find graph weights matrix adaptively. The key advantage of our approach is that MALP simultaneously finds graph weights matrix and predicts the label of unlabeled data. This paper also derives efficient algorithm to solve the proposed problem. Extensions of our MALP in kernel space and robust version are presented. The proposed method has been applied to the problem of semi-supervised face clustering using the well-known ORL, Yale, extended YaleB, and PIE datasets. Our experimental evaluations show the effectiveness of our method.

  7. Model Transport: Towards Scalable Transfer Learning on Manifolds

    DEFF Research Database (Denmark)

    Freifeld, Oren; Hauberg, Søren; Black, Michael J.

    2014-01-01

    We consider the intersection of two research fields: transfer learning and statistics on manifolds. In particular, we consider, for manifold-valued data, transfer learning of tangent-space models such as Gaussians distributions, PCA, regression, or classifiers. Though one would hope to simply use...... ordinary Rn-transfer learning ideas, the manifold structure prevents it. We overcome this by basing our method on inner-product-preserving parallel transport, a well-known tool widely used in other problems of statistics on manifolds in computer vision. At first, this straightforward idea seems to suffer...... “commutes” with learning. Consequently, our compact framework, applicable to a large class of manifolds, is not restricted by the size of either the training or test sets. We demonstrate the approach by transferring PCA and logistic-regression models of real-world data involving 3D shapes and image...

  8. Quaternionic Kaehler and hyperkaehler manifolds with torsion and twistor spaces

    International Nuclear Information System (INIS)

    Ivanov, Stefan; Minchev, Ivan

    2001-12-01

    The target space of a (4,0) supersymmetric two-dimensional sigma model with Wess-Zumino term has a connection with totally skew-symmetric torsion and holonomy contained in Sp(n)Sp(l) (resp. Sp(n)), QKT (resp. HKT)-spaces. We study the geometry of QKT, HKT manifold and their twistor spaces. We show that the Swann bundle of a QKT manifold admits a HKT structure with special symmetry if and only if the twistor space of the QKT manifold admits an almost hermitian structure with totally skew-symmetric Nijenhuis tensor, thus connecting two structures arising from quantum field theories and supersymmetric sigma models with Wess- Zumino term. We discovered that a HKT manifold has always co-closed Lee form. Applying this property to compact HKT manifold we get information about the plurigenera. (author)

  9. Investigating performance of microchannel evaporators with different manifold structures

    Energy Technology Data Exchange (ETDEWEB)

    Shi, Junye; Qu, Xiaohua; Qi, Zhaogang; Chen, Jiangping [Institute of Refrigeration and Cryogenics, Shanghai Jiao Tong University, No. 800, Dongchuan Rd, Shanghai 200240 (China)

    2011-01-15

    In this paper, the performances of microchannel evaporators with different manifold structures are experimentally investigated. Eight evaporator samples with 7 different designs of the I/O manifold and 5 different designs of the return manifold are made for this study. The performances of the evaporator samples are tested on a psychometric calorimeter test bench with the refrigerant 134A at a real automotive AC condition. The results on the variations of the cooling capacity and air temperature distribution of the evaporator due to the deflector designs in the I/O manifold and flow hole arrangements in the return manifold are presented and analyzed. By studying the KPI's for the performance of an evaporator, the design trade-off for an evaporator designer is summarized and discussed. (author)

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

    KAUST Repository

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

    2018-01-01

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

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

    KAUST Repository

    Gomes, Diogo A.

    2018-01-26

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

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

  13. 3D surface parameterization using manifold learning for medial shape representation

    Science.gov (United States)

    Ward, Aaron D.; Hamarneh, Ghassan

    2007-03-01

    The choice of 3D shape representation for anatomical structures determines the effectiveness with which segmentation, visualization, deformation, and shape statistics are performed. Medial axis-based shape representations have attracted considerable attention due to their inherent ability to encode information about the natural geometry of parts of the anatomy. In this paper, we propose a novel approach, based on nonlinear manifold learning, to the parameterization of medial sheets and object surfaces based on the results of skeletonization. For each single-sheet figure in an anatomical structure, we skeletonize the figure, and classify its surface points according to whether they lie on the upper or lower surface, based on their relationship to the skeleton points. We then perform nonlinear dimensionality reduction on the skeleton, upper, and lower surface points, to find the intrinsic 2D coordinate system of each. We then center a planar mesh over each of the low-dimensional representations of the points, and map the meshes back to 3D using the mappings obtained by manifold learning. Correspondence between mesh vertices, established in their intrinsic 2D coordinate spaces, is used in order to compute the thickness vectors emanating from the medial sheet. We show results of our algorithm on real brain and musculoskeletal structures extracted from MRI, as well as an artificial multi-sheet example. The main advantages to this method are its relative simplicity and noniterative nature, and its ability to correctly compute nonintersecting thickness vectors for a medial sheet regardless of both the amount of coincident bending and thickness in the object, and of the incidence of local concavities and convexities in the object's surface.

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

    Science.gov (United States)

    Lakhtakia, Akhlesh

    1993-11-01

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

  15. Riemann solvers and undercompressive shocks of convex FPU chains

    International Nuclear Information System (INIS)

    Herrmann, Michael; Rademacher, Jens D M

    2010-01-01

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

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

    NARCIS (Netherlands)

    Musegaas, Marieke; Borm, Peter; Quant, Marieke

    2016-01-01

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

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

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

    CSIR Research Space (South Africa)

    Scholes, RJ

    2003-12-01

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

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

    Directory of Open Access Journals (Sweden)

    Daniel Alpay

    2018-01-01

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

  20. Intracranial Convexity Lipoma with Massive Calcification: Case Report

    Energy Technology Data Exchange (ETDEWEB)

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

    2011-12-15

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

  1. A duality recipe for non-convex variational problems

    Science.gov (United States)

    Bouchitté, Guy; Phan, Minh

    2018-03-01

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

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

    NARCIS (Netherlands)

    Driessen, Theo; Hou, D.

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

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

    Directory of Open Access Journals (Sweden)

    Debora Cores

    2017-01-01

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

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

    NARCIS (Netherlands)

    Koren, B.; Bannink, W.J.

    1984-01-01

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

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

    NARCIS (Netherlands)

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

    2015-01-01

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

  6. Short Run Profit Maximization in a Convex Analysis Framework

    Directory of Open Access Journals (Sweden)

    Ilko Vrankic

    2017-03-01

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

  7. Discriminative clustering on manifold for adaptive transductive classification.

    Science.gov (United States)

    Zhang, Zhao; Jia, Lei; Zhang, Min; Li, Bing; Zhang, Li; Li, Fanzhang

    2017-10-01

    In this paper, we mainly propose a novel adaptive transductive label propagation approach by joint discriminative clustering on manifolds for representing and classifying high-dimensional data. Our framework seamlessly combines the unsupervised manifold learning, discriminative clustering and adaptive classification into a unified model. Also, our method incorporates the adaptive graph weight construction with label propagation. Specifically, our method is capable of propagating label information using adaptive weights over low-dimensional manifold features, which is different from most existing studies that usually predict the labels and construct the weights in the original Euclidean space. For transductive classification by our formulation, we first perform the joint discriminative K-means clustering and manifold learning to capture the low-dimensional nonlinear manifolds. Then, we construct the adaptive weights over the learnt manifold features, where the adaptive weights are calculated through performing the joint minimization of the reconstruction errors over features and soft labels so that the graph weights can be joint-optimal for data representation and classification. Using the adaptive weights, we can easily estimate the unknown labels of samples. After that, our method returns the updated weights for further updating the manifold features. Extensive simulations on image classification and segmentation show that our proposed algorithm can deliver the state-of-the-art performance on several public datasets. Copyright © 2017 Elsevier Ltd. All rights reserved.

  8. Introduction to global analysis minimal surfaces in Riemannian manifolds

    CERN Document Server

    Moore, John Douglas

    2017-01-01

    During the last century, global analysis was one of the main sources of interaction between geometry and topology. One might argue that the core of this subject is Morse theory, according to which the critical points of a generic smooth proper function on a manifold M determine the homology of the manifold. Morse envisioned applying this idea to the calculus of variations, including the theory of periodic motion in classical mechanics, by approximating the space of loops on M by a finite-dimensional manifold of high dimension. Palais and Smale reformulated Morse's calculus of variations in terms of infinite-dimensional manifolds, and these infinite-dimensional manifolds were found useful for studying a wide variety of nonlinear PDEs. This book applies infinite-dimensional manifold theory to the Morse theory of closed geodesics in a Riemannian manifold. It then describes the problems encountered when extending this theory to maps from surfaces instead of curves. It treats critical point theory for closed param...

  9. Piping structural design for the ITER thermal shield manifold

    Energy Technology Data Exchange (ETDEWEB)

    Noh, Chang Hyun, E-mail: chnoh@nfri.re.kr [ITER Korea, National Fusion Research Institute, Daejeon 305-333 (Korea, Republic of); Chung, Wooho, E-mail: whchung@nfri.re.kr [ITER Korea, National Fusion Research Institute, Daejeon 305-333 (Korea, Republic of); Nam, Kwanwoo; Kang, Kyoung-O. [ITER Korea, National Fusion Research Institute, Daejeon 305-333 (Korea, Republic of); Bae, Jing Do; Cha, Jong Kook [Korea Marine Equipment Research Institute, Busan 606-806 (Korea, Republic of); Kim, Kyoung-Kyu [Mecha T& S, Jinju-si 660-843 (Korea, Republic of); Hamlyn-Harris, Craig; Hicks, Robby; Her, Namil; Jun, Chang-Hoon [ITER Organization, Route de Vinon-sur-Verdon, CS 90 046, 13067 St. Paul Lez Durance Cedex (France)

    2015-10-15

    Highlights: • We finalized piping design of ITER thermal shield manifold for procurement. • Support span is determined by stress and deflection limitation. • SQP, which is design optimization method, is used for the pipe design. • Benchmark analysis is performed to verify the analysis software. • Pipe design is verified by structural analyses. - Abstract: The thermal shield (TS) provides the thermal barrier in the ITER tokamak to minimize heat load transferred by thermal radiation from the hot components to the superconducting magnets operating at 4.2 K. The TS is actively cooled by 80 K pressurized helium gas which flows from the cold valve box to the cooling tubes on the TS panels via manifold piping. This paper describes the manifold piping design and analysis for the ITER thermal shield. First, maximum allowable span for the manifold support is calculated based on the simple beam theory. In order to accommodate the thermal contraction in the manifold feeder, a contraction loop is designed and applied. Sequential Quadratic Programming (SQP) method is used to determine the optimized dimensions of the contraction loop to ensure adequate flexibility of manifold pipe. Global structural behavior of the manifold is investigated when the thermal movement of the redundant (un-cooled) pipe is large.

  10. Cohomological rigidity of manifolds defined by 3-dimensional polytopes

    Science.gov (United States)

    Buchstaber, V. M.; Erokhovets, N. Yu.; Masuda, M.; Panov, T. E.; Park, S.

    2017-04-01

    A family of closed manifolds is said to be cohomologically rigid if a cohomology ring isomorphism implies a diffeomorphism for any two manifolds in the family. Cohomological rigidity is established here for large families of 3-dimensional and 6-dimensional manifolds defined by 3-dimensional polytopes. The class \\mathscr{P} of 3-dimensional combinatorial simple polytopes P different from tetrahedra and without facets forming 3- and 4-belts is studied. This class includes mathematical fullerenes, that is, simple 3- polytopes with only 5-gonal and 6-gonal facets. By a theorem of Pogorelov, any polytope in \\mathscr{P} admits in Lobachevsky 3-space a right-angled realisation which is unique up to isometry. Our families of smooth manifolds are associated with polytopes in the class \\mathscr{P}. The first family consists of 3-dimensional small covers of polytopes in \\mathscr{P}, or equivalently, hyperbolic 3-manifolds of Löbell type. The second family consists of 6-dimensional quasitoric manifolds over polytopes in \\mathscr{P}. Our main result is that both families are cohomologically rigid, that is, two manifolds M and M' from either family are diffeomorphic if and only if their cohomology rings are isomorphic. It is also proved that if M and M' are diffeomorphic, then their corresponding polytopes P and P' are combinatorially equivalent. These results are intertwined with classical subjects in geometry and topology such as the combinatorics of 3-polytopes, the Four Colour Theorem, aspherical manifolds, a diffeomorphism classification of 6-manifolds, and invariance of Pontryagin classes. The proofs use techniques of toric topology. Bibliography: 69 titles.

  11. Stochastic development regression on non-linear manifolds

    DEFF Research Database (Denmark)

    Kühnel, Line; Sommer, Stefan Horst

    2017-01-01

    We introduce a regression model for data on non-linear manifolds. The model describes the relation between a set of manifold valued observations, such as shapes of anatomical objects, and Euclidean explanatory variables. The approach is based on stochastic development of Euclidean diffusion...... processes to the manifold. Defining the data distribution as the transition distribution of the mapped stochastic process, parameters of the model, the non-linear analogue of design matrix and intercept, are found via maximum likelihood. The model is intrinsically related to the geometry encoded...

  12. Scientific data interpolation with low dimensional manifold model

    Science.gov (United States)

    Zhu, Wei; Wang, Bao; Barnard, Richard; Hauck, Cory D.; Jenko, Frank; Osher, Stanley

    2018-01-01

    We propose to apply a low dimensional manifold model to scientific data interpolation from regular and irregular samplings with a significant amount of missing information. The low dimensionality of the patch manifold for general scientific data sets has been used as a regularizer in a variational formulation. The problem is solved via alternating minimization with respect to the manifold and the data set, and the Laplace-Beltrami operator in the Euler-Lagrange equation is discretized using the weighted graph Laplacian. Various scientific data sets from different fields of study are used to illustrate the performance of the proposed algorithm on data compression and interpolation from both regular and irregular samplings.

  13. Topological field theory and surgery on three-manifolds

    International Nuclear Information System (INIS)

    Guadagnini, E.; Panicucci, S.

    1992-01-01

    The solution of the SU(2) quantum Chern-Simons field theory defined on a closed, connected and orientable three-manifold is presented. The vacuum expectation values of Wilson line operators, associated with framed links in a generic manifold, are computed in terms of the expectation values of the three-sphere. The method consists of using an operator realization of Dehn surgery. The rules, corresponding to the surgery instructions in the three-sphere, are derived and the three-manifold invariant defined by the Chern-Simons theory is constructed. Several examples are considered and explicit results are reported. (orig.)

  14. Mechanical systems with closed orbits on manifolds of revolution

    International Nuclear Information System (INIS)

    Kudryavtseva, E A; Fedoseev, D A

    2015-01-01

    We study natural mechanical systems describing the motion of a particle on a two-dimensional Riemannian manifold of revolution in the field of a central smooth potential. We obtain a classification of Riemannian manifolds of revolution and central potentials on them that have the strong Bertrand property: any nonsingular (that is, not contained in a meridian) orbit is closed. We also obtain a classification of manifolds of revolution and central potentials on them that have the 'stable' Bertrand property: every parallel is an 'almost stable' circular orbit, and any nonsingular bounded orbit is closed. Bibliography: 14 titles

  15. Geometric transitions, flops and non-Kahler manifolds: I

    International Nuclear Information System (INIS)

    Becker, Melanie; Dasgupta, Keshav; Knauf, Anke; Tatar, Radu

    2004-01-01

    We construct a duality cycle which provides a complete supergravity description of geometric transitions in type II theories via a flop in M-theory. This cycle connects the different supergravity descriptions before and after the geometric transitions. Our construction reproduces many of the known phenomena studied earlier in the literature and allows us to describe some new and interesting aspects in a simple and elegant fashion. A precise supergravity description of new torsional manifolds that appear on the type IIA side with branes and fluxes and the corresponding geometric transition are obtained. A local description of new G2 manifolds that are circle fibrations over non-Kahler manifolds is presented

  16. Scientific data interpolation with low dimensional manifold model

    International Nuclear Information System (INIS)

    Zhu, Wei; Wang, Bao; Barnard, Richard C.; Hauck, Cory D.

    2017-01-01

    Here, we propose to apply a low dimensional manifold model to scientific data interpolation from regular and irregular samplings with a significant amount of missing information. The low dimensionality of the patch manifold for general scientific data sets has been used as a regularizer in a variational formulation. The problem is solved via alternating minimization with respect to the manifold and the data set, and the Laplace–Beltrami operator in the Euler–Lagrange equation is discretized using the weighted graph Laplacian. Various scientific data sets from different fields of study are used to illustrate the performance of the proposed algorithm on data compression and interpolation from both regular and irregular samplings.

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2016-04-18

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

  18. Manifold Regularized Experimental Design for Active Learning.

    Science.gov (United States)

    Zhang, Lining; Shum, Hubert P H; Shao, Ling

    2016-12-02

    Various machine learning and data mining tasks in classification require abundant data samples to be labeled for training. Conventional active learning methods aim at labeling the most informative samples for alleviating the labor of the user. Many previous studies in active learning select one sample after another in a greedy manner. However, this is not very effective because the classification models has to be retrained for each newly labeled sample. Moreover, many popular active learning approaches utilize the most uncertain samples by leveraging the classification hyperplane of the classifier, which is not appropriate since the classification hyperplane is inaccurate when the training data are small-sized. The problem of insufficient training data in real-world systems limits the potential applications of these approaches. This paper presents a novel method of active learning called manifold regularized experimental design (MRED), which can label multiple informative samples at one time for training. In addition, MRED gives an explicit geometric explanation for the selected samples to be labeled by the user. Different from existing active learning methods, our method avoids the intrinsic problems caused by insufficiently labeled samples in real-world applications. Various experiments on synthetic datasets, the Yale face database and the Corel image database have been carried out to show how MRED outperforms existing methods.

  19. Ricci flow and geometrization of 3-manifolds

    CERN Document Server

    Morgan, John W

    2010-01-01

    This book is based on lectures given at Stanford University in 2009. The purpose of the lectures and of the book is to give an introductory overview of how to use Ricci flow and Ricci flow with surgery to establish the Poincar� Conjecture and the more general Geometrization Conjecture for 3-dimensional manifolds. Most of the material is geometric and analytic in nature; a crucial ingredient is understanding singularity development for 3-dimensional Ricci flows and for 3-dimensional Ricci flows with surgery. This understanding is crucial for extending Ricci flows with surgery so that they are defined for all positive time. Once this result is in place, one must study the nature of the time-slices as the time goes to infinity in order to deduce the topological consequences. The goal of the authors is to present the major geometric and analytic results and themes of the subject without weighing down the presentation with too many details. This book can be read as an introduction to more complete treatments of ...

  20. Killing superalgebras for Lorentzian four-manifolds

    International Nuclear Information System (INIS)

    Medeiros, Paul de; Figueroa-O’Farrill, José; Santi, Andrea

    2016-01-01

    We determine the Killing superalgebras underpinning field theories with rigid unextended supersymmetry on Lorentzian four-manifolds by re-interpreting them as filtered deformations of ℤ-graded subalgebras with maximum odd dimension of the N=1 Poincaré superalgebra in four dimensions. Part of this calculation involves computing a Spencer cohomology group which, by analogy with a similar result in eleven dimensions, prescribes a notion of Killing spinor, which we identify with the defining condition for bosonic supersymmetric backgrounds of minimal off-shell supergravity in four dimensions. We prove that such Killing spinors always generate a Lie superalgebra, and that this Lie superalgebra is a filtered deformation of a subalgebra of the N=1 Poincaré superalgebra in four dimensions. Demanding the flatness of the connection defining the Killing spinors, we obtain equations satisfied by the maximally supersymmetric backgrounds. We solve these equations, arriving at the classification of maximally supersymmetric backgrounds whose associated Killing superalgebras are precisely the filtered deformations we classify in this paper.

  1. Killing superalgebras for Lorentzian four-manifolds

    Energy Technology Data Exchange (ETDEWEB)

    Medeiros, Paul de [Department of Mathematics and Natural Sciences, University of Stavanger,4036 Stavanger (Norway); Figueroa-O’Farrill, José; Santi, Andrea [Maxwell Institute and School of Mathematics, The University of Edinburgh,James Clerk Maxwell Building, Peter Guthrie Tait Road, Edinburgh EH9 3FD, Scotland (United Kingdom)

    2016-06-20

    We determine the Killing superalgebras underpinning field theories with rigid unextended supersymmetry on Lorentzian four-manifolds by re-interpreting them as filtered deformations of ℤ-graded subalgebras with maximum odd dimension of the N=1 Poincaré superalgebra in four dimensions. Part of this calculation involves computing a Spencer cohomology group which, by analogy with a similar result in eleven dimensions, prescribes a notion of Killing spinor, which we identify with the defining condition for bosonic supersymmetric backgrounds of minimal off-shell supergravity in four dimensions. We prove that such Killing spinors always generate a Lie superalgebra, and that this Lie superalgebra is a filtered deformation of a subalgebra of the N=1 Poincaré superalgebra in four dimensions. Demanding the flatness of the connection defining the Killing spinors, we obtain equations satisfied by the maximally supersymmetric backgrounds. We solve these equations, arriving at the classification of maximally supersymmetric backgrounds whose associated Killing superalgebras are precisely the filtered deformations we classify in this paper.

  2. Geometric transitions on non-Kaehler manifolds

    International Nuclear Information System (INIS)

    Knauf, A.

    2007-01-01

    We study geometric transitions on the supergravity level using the basic idea of an earlier paper (M. Becker et al., 2004), where a pair of non-Kaehler backgrounds was constructed, which are related by a geometric transition. Here we embed this idea into an orientifold setup. The non-Kaehler backgrounds we obtain in type IIA are non-trivially fibered due to their construction from IIB via T-duality with Neveu-Schwarz flux. We demonstrate that these non-Kaehler manifolds are not half-flat and show that a symplectic structure exists on them at least locally. We also review the construction of new non-Kaehler backgrounds in type I and heterotic theory. They are found by a series of T- and S-duality and can be argued to be related by geometric transitions as well. A local toy model is provided that fulfills the flux equations of motion in IIB and the torsional relation in heterotic theory, and that is consistent with the U-duality relating both theories. For the heterotic theory we also propose a global solution that fulfills the torsional relation because it is similar to the Maldacena-Nunez background. (Abstract Copyright [2007], Wiley Periodicals, Inc.)

  3. Solution path for manifold regularized semisupervised classification.

    Science.gov (United States)

    Wang, Gang; Wang, Fei; Chen, Tao; Yeung, Dit-Yan; Lochovsky, Frederick H

    2012-04-01

    Traditional learning algorithms use only labeled data for training. However, labeled examples are often difficult or time consuming to obtain since they require substantial human labeling efforts. On the other hand, unlabeled data are often relatively easy to collect. Semisupervised learning addresses this problem by using large quantities of unlabeled data with labeled data to build better learning algorithms. In this paper, we use the manifold regularization approach to formulate the semisupervised learning problem where a regularization framework which balances a tradeoff between loss and penalty is established. We investigate different implementations of the loss function and identify the methods which have the least computational expense. The regularization hyperparameter, which determines the balance between loss and penalty, is crucial to model selection. Accordingly, we derive an algorithm that can fit the entire path of solutions for every value of the hyperparameter. Its computational complexity after preprocessing is quadratic only in the number of labeled examples rather than the total number of labeled and unlabeled examples.

  4. Quantization of a symplectic manifold associated to a manifold with projective structure

    International Nuclear Information System (INIS)

    Biswas, Indranil

    2009-01-01

    Let X be a complex manifold equipped with a projective structure P. There is a holomorphic principal C*-bundle L P ' over X associated with P. We show that the holomorphic cotangent bundle of the total space of L P ' equipped with the Liouville symplectic form has a canonical deformation quantization. This generalizes the construction in the work of and Ben-Zvi and Biswas [''A quantization on Riemann surfaces with projective structure,'' Lett. Math. Phys. 54, 73 (2000)] done under the assumption that dim C X=1.

  5. On the construction of inertial manifolds under symmetry constraints II: O(2) constraint and inertial manifolds on thin domains

    International Nuclear Information System (INIS)

    Rodriguez-Bernal, A.

    1993-01-01

    On a model example, the Kuramoto-Velarde equation, which includes the Kuramoto-Sivashin-sky and the Cahn-Hilliard models, and under suitable and reasonable hypothesis, we show the dimension and determining modes of inertial manifolds for several classes of solutions. We also give bounds for the dimensions of inertial manifolds of the full system as a parameter is varied. The results are pointed out to be almost model-independent. The same ideas are also applied to a class of parabolic equations in higher space dimension, obtaining results about inertial manifolds on thin and small domains. (Author). 30 refs

  6. Pseudo-Kähler Quantization on Flag Manifolds

    Science.gov (United States)

    Karabegov, Alexander V.

    A unified approach to geometric, symbol and deformation quantizations on a generalized flag manifold endowed with an invariant pseudo-Kähler structure is proposed. In particular cases we arrive at Berezin's quantization via covariant and contravariant symbols.

  7. Natural differential operations on manifolds: an algebraic approach

    International Nuclear Information System (INIS)

    Katsylo, P I; Timashev, D A

    2008-01-01

    Natural algebraic differential operations on geometric quantities on smooth manifolds are considered. A method for the investigation and classification of such operations is described, the method of IT-reduction. With it the investigation of natural operations reduces to the analysis of rational maps between k-jet spaces, which are equivariant with respect to certain algebraic groups. On the basis of the method of IT-reduction a finite generation theorem is proved: for tensor bundles V,W→M all the natural differential operations D:Γ(V)→Γ(W) of degree at most d can be algebraically constructed from some finite set of such operations. Conceptual proofs of known results on the classification of natural linear operations on arbitrary and symplectic manifolds are presented. A non-existence theorem is proved for natural deformation quantizations on Poisson manifolds and symplectic manifolds. Bibliography: 21 titles.

  8. Stochastic development regression on non-linear manifolds

    DEFF Research Database (Denmark)

    Kühnel, Line; Sommer, Stefan Horst

    2017-01-01

    We introduce a regression model for data on non-linear manifolds. The model describes the relation between a set of manifold valued observations, such as shapes of anatomical objects, and Euclidean explanatory variables. The approach is based on stochastic development of Euclidean diffusion...... processes to the manifold. Defining the data distribution as the transition distribution of the mapped stochastic process, parameters of the model, the non-linear analogue of design matrix and intercept, are found via maximum likelihood. The model is intrinsically related to the geometry encoded...... in the connection of the manifold. We propose an estimation procedure which applies the Laplace approximation of the likelihood function. A simulation study of the performance of the model is performed and the model is applied to a real dataset of Corpus Callosum shapes....

  9. Example-driven manifold priors for image deconvolution.

    Science.gov (United States)

    Ni, Jie; Turaga, Pavan; Patel, Vishal M; Chellappa, Rama

    2011-11-01

    Image restoration methods that exploit prior information about images to be estimated have been extensively studied, typically using the Bayesian framework. In this paper, we consider the role of prior knowledge of the object class in the form of a patch manifold to address the deconvolution problem. Specifically, we incorporate unlabeled image data of the object class, say natural images, in the form of a patch-manifold prior for the object class. The manifold prior is implicitly estimated from the given unlabeled data. We show how the patch-manifold prior effectively exploits the available sample class data for regularizing the deblurring problem. Furthermore, we derive a generalized cross-validation (GCV) function to automatically determine the regularization parameter at each iteration without explicitly knowing the noise variance. Extensive experiments show that this method performs better than many competitive image deconvolution methods.

  10. Partial Synchronization Manifolds for Linearly Time-Delay Coupled Systems

    OpenAIRE

    Steur, Erik; van Leeuwen, Cees; Michiels, Wim

    2014-01-01

    Sometimes a network of dynamical systems shows a form of incomplete synchronization characterized by synchronization of some but not all of its systems. This type of incomplete synchronization is called partial synchronization. Partial synchronization is associated with the existence of partial synchronization manifolds, which are linear invariant subspaces of C, the state space of the network of systems. We focus on partial synchronization manifolds in networks of system...

  11. Two-dimensional manifolds with metrics of revolution

    International Nuclear Information System (INIS)

    Sabitov, I Kh

    2000-01-01

    This is a study of the topological and metric structure of two-dimensional manifolds with a metric that is locally a metric of revolution. In the case of compact manifolds this problem can be thoroughly investigated, and in particular it is explained why there are no closed analytic surfaces of revolution in R 3 other than a sphere and a torus (moreover, in the smoothness class C ∞ such surfaces, understood in a certain generalized sense, exist in any topological class)

  12. Radical Transversal Lightlike Submanifolds of Indefinite Para-Sasakian Manifolds

    OpenAIRE

    Shukla S.S.; Yadav Akhilesh

    2014-01-01

    In this paper, we study radical transversal lightlike submanifolds and screen slant radical transversal lightlike submanifolds of indefinite para-Sasakian manifolds giving some non-trivial examples of these submanifolds. Integrability conditions of distributions D and RadTM on radical transversal lightlike submanifolds and screen slant radical transversal lightlike submanifolds of indefinite para-Sasakian manifolds, have been obtained. We also study totally contact umbilical radical transvers...

  13. Renormalization, unstable manifolds, and the fractal structure of mode locking

    International Nuclear Information System (INIS)

    Cvitanovic, P.; Jensen, M.H.; Kadanoff, L.P.; Procaccia, I.

    1985-01-01

    The apparent universality of the fractal dimension of the set of quasiperiodic windings at the onset of chaos in a wide class of circle maps is described by construction of a universal one-parameter family of maps which lies along the unstable manifold of the renormalization group. The manifold generates a universal ''devil's staircase'' whose dimension agrees with direct numerical calculations. Applications to experiments are discussed

  14. Reduction of Nambu-Poisson Manifolds by Regular Distributions

    Science.gov (United States)

    Das, Apurba

    2018-03-01

    The version of Marsden-Ratiu reduction theorem for Nambu-Poisson manifolds by a regular distribution has been studied by Ibáñez et al. In this paper we show that the reduction is always ensured unless the distribution is zero. Next we extend the more general Falceto-Zambon Poisson reduction theorem for Nambu-Poisson manifolds. Finally, we define gauge transformations of Nambu-Poisson structures and show that these transformations commute with the reduction procedure.

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

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

  17. On the stretch factor of convex Delaunay graphs

    Directory of Open Access Journals (Sweden)

    Prosenjit Bose

    2010-06-01

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

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

    Directory of Open Access Journals (Sweden)

    Pattrawut Chansangiam

    2015-01-01

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

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

    CERN Document Server

    Bildhauer, Michael

    2003-01-01

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

  20. Moduli spaces of convex projective structures on surfaces

    DEFF Research Database (Denmark)

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

    2007-01-01

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

  1. Constrained convex minimization via model-based excessive gap

    OpenAIRE

    Tran Dinh, Quoc; Cevher, Volkan

    2014-01-01

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

  2. Free locally convex spaces with a small base

    Czech Academy of Sciences Publication Activity Database

    Gabriyelyan, S.; Kąkol, Jerzy

    2017-01-01

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

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

  4. Some fixed point theorems on non-convex sets

    Directory of Open Access Journals (Sweden)

    Mohanasundaram Radhakrishnan

    2017-10-01

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

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

    Czech Academy of Sciences Publication Activity Database

    Kočvara, Michal; Stingl, M.

    2003-01-01

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

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

  7. Dimensionality reduction of collective motion by principal manifolds

    Science.gov (United States)

    Gajamannage, Kelum; Butail, Sachit; Porfiri, Maurizio; Bollt, Erik M.

    2015-01-01

    While the existence of low-dimensional embedding manifolds has been shown in patterns of collective motion, the current battery of nonlinear dimensionality reduction methods is not amenable to the analysis of such manifolds. This is mainly due to the necessary spectral decomposition step, which limits control over the mapping from the original high-dimensional space to the embedding space. Here, we propose an alternative approach that demands a two-dimensional embedding which topologically summarizes the high-dimensional data. In this sense, our approach is closely related to the construction of one-dimensional principal curves that minimize orthogonal error to data points subject to smoothness constraints. Specifically, we construct a two-dimensional principal manifold directly in the high-dimensional space using cubic smoothing splines, and define the embedding coordinates in terms of geodesic distances. Thus, the mapping from the high-dimensional data to the manifold is defined in terms of local coordinates. Through representative examples, we show that compared to existing nonlinear dimensionality reduction methods, the principal manifold retains the original structure even in noisy and sparse datasets. The principal manifold finding algorithm is applied to configurations obtained from a dynamical system of multiple agents simulating a complex maneuver called predator mobbing, and the resulting two-dimensional embedding is compared with that of a well-established nonlinear dimensionality reduction method.

  8. Semisupervised Support Vector Machines With Tangent Space Intrinsic Manifold Regularization.

    Science.gov (United States)

    Sun, Shiliang; Xie, Xijiong

    2016-09-01

    Semisupervised learning has been an active research topic in machine learning and data mining. One main reason is that labeling examples is expensive and time-consuming, while there are large numbers of unlabeled examples available in many practical problems. So far, Laplacian regularization has been widely used in semisupervised learning. In this paper, we propose a new regularization method called tangent space intrinsic manifold regularization. It is intrinsic to data manifold and favors linear functions on the manifold. Fundamental elements involved in the formulation of the regularization are local tangent space representations, which are estimated by local principal component analysis, and the connections that relate adjacent tangent spaces. Simultaneously, we explore its application to semisupervised classification and propose two new learning algorithms called tangent space intrinsic manifold regularized support vector machines (TiSVMs) and tangent space intrinsic manifold regularized twin SVMs (TiTSVMs). They effectively integrate the tangent space intrinsic manifold regularization consideration. The optimization of TiSVMs can be solved by a standard quadratic programming, while the optimization of TiTSVMs can be solved by a pair of standard quadratic programmings. The experimental results of semisupervised classification problems show the effectiveness of the proposed semisupervised learning algorithms.

  9. On the de Rham–Wu decomposition for Riemannian and Lorentzian manifolds

    International Nuclear Information System (INIS)

    Galaev, Anton S

    2014-01-01

    It is explained how to find the de Rham decomposition of a Riemannian manifold and the Wu decomposition of a Lorentzian manifold. For that it is enough to find parallel symmetric bilinear forms on the manifold, and do some linear algebra. This result will allow to compute the connected holonomy group of an arbitrary Riemannian or Lorentzian manifold. (paper)

  10. Folding-retraction of chaotic dynamical manifold and the VAK of vacuum fluctuation

    International Nuclear Information System (INIS)

    El-Ghoul, M.; El-Ahmady, A.E.; Rafat, H.

    2004-01-01

    In this paper we introduce the retraction of chaos dynamical manifold. Some properties of chaos dynamical manifold will be deduced. Theorems governing the relation between the folding and retraction of chaos dynamical manifold will be discussed. Some applications of chaos dynamical manifolds and their retractions are achieved in particular high energy particle physics

  11. Stochastic parameterizing manifolds and non-Markovian reduced equations stochastic manifolds for nonlinear SPDEs II

    CERN Document Server

    Chekroun, Mickaël D; Wang, Shouhong

    2015-01-01

    In this second volume, a general approach is developed to provide approximate parameterizations of the "small" scales by the "large" ones for a broad class of stochastic partial differential equations (SPDEs). This is accomplished via the concept of parameterizing manifolds (PMs), which are stochastic manifolds that improve, for a given realization of the noise, in mean square error the partial knowledge of the full SPDE solution when compared to its projection onto some resolved modes. Backward-forward systems are designed to give access to such PMs in practice. The key idea consists of representing the modes with high wave numbers as a pullback limit depending on the time-history of the modes with low wave numbers. Non-Markovian stochastic reduced systems are then derived based on such a PM approach. The reduced systems take the form of stochastic differential equations involving random coefficients that convey memory effects. The theory is illustrated on a stochastic Burgers-type equation.

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

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

    Directory of Open Access Journals (Sweden)

    M. Geravanchizadeh

    2014-12-01

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

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

  15. Measurement system for diffraction efficiency of convex gratings

    Science.gov (United States)

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

    2017-08-01

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

  16. Simulating triangulations. Graphs, manifolds and (quantum) spacetime

    International Nuclear Information System (INIS)

    Krueger, Benedikt

    2016-01-01

    Triangulations, which can intuitively be described as a tessellation of space into simplicial building blocks, are structures that arise in various different branches of physics: They can be used for describing complicated and curved objects in a discretized way, e.g., in foams, gels or porous media, or for discretizing curved boundaries for fluid simulations or dissipative systems. Interpreting triangulations as (maximal planar) graphs makes it possible to use them in graph theory or statistical physics, e.g., as small-world networks, as networks of spins or in biological physics as actin networks. Since one can find an analogue of the Einstein-Hilbert action on triangulations, they can even be used for formulating theories of quantum gravity. Triangulations have also important applications in mathematics, especially in discrete topology. Despite their wide occurrence in different branches of physics and mathematics, there are still some fundamental open questions about triangulations in general. It is a prior unknown how many triangulations there are for a given set of points or a given manifold, or even whether there are exponentially many triangulations or more, a question that relates to a well-defined behavior of certain quantum geometry models. Another major unknown question is whether elementary steps transforming triangulations into each other, which are used in computer simulations, are ergodic. Using triangulations as model for spacetime, it is not clear whether there is a meaningful continuum limit that can be identified with the usual and well-tested theory of general relativity. Within this thesis some of these fundamental questions about triangulations are answered by the use of Markov chain Monte Carlo simulations, which are a probabilistic method for calculating statistical expectation values, or more generally a tool for calculating high-dimensional integrals. Additionally, some details about the Wang-Landau algorithm, which is the primary used

  17. Simulating triangulations. Graphs, manifolds and (quantum) spacetime

    Energy Technology Data Exchange (ETDEWEB)

    Krueger, Benedikt

    2016-07-01

    Triangulations, which can intuitively be described as a tessellation of space into simplicial building blocks, are structures that arise in various different branches of physics: They can be used for describing complicated and curved objects in a discretized way, e.g., in foams, gels or porous media, or for discretizing curved boundaries for fluid simulations or dissipative systems. Interpreting triangulations as (maximal planar) graphs makes it possible to use them in graph theory or statistical physics, e.g., as small-world networks, as networks of spins or in biological physics as actin networks. Since one can find an analogue of the Einstein-Hilbert action on triangulations, they can even be used for formulating theories of quantum gravity. Triangulations have also important applications in mathematics, especially in discrete topology. Despite their wide occurrence in different branches of physics and mathematics, there are still some fundamental open questions about triangulations in general. It is a prior unknown how many triangulations there are for a given set of points or a given manifold, or even whether there are exponentially many triangulations or more, a question that relates to a well-defined behavior of certain quantum geometry models. Another major unknown question is whether elementary steps transforming triangulations into each other, which are used in computer simulations, are ergodic. Using triangulations as model for spacetime, it is not clear whether there is a meaningful continuum limit that can be identified with the usual and well-tested theory of general relativity. Within this thesis some of these fundamental questions about triangulations are answered by the use of Markov chain Monte Carlo simulations, which are a probabilistic method for calculating statistical expectation values, or more generally a tool for calculating high-dimensional integrals. Additionally, some details about the Wang-Landau algorithm, which is the primary used

  18. LIFE CYCLE DESIGN OF AIR INTAKE MANIFOLDS; PHASE I: 2.0 L FORD CONTOUR AIR INTAKE MANIFOLD

    Science.gov (United States)

    The project team applied the life cycle design methodology to the design analysis of three alternative air intake manifolds: a sand cast aluminum, brazed aluminum tubular, and nylon composite. The design analysis included a life cycle inventory analysis, environmental regulatory...

  19. Compactifications of IIA supergravity on SU(2)-structure manifolds

    Energy Technology Data Exchange (ETDEWEB)

    Spanjaard, B.

    2008-07-15

    In this thesis, we study compactifications of type IIA supergravity on six-dimensional manifolds with an SU(2)-structure. A general study of six-dimensional manifolds with SU(2)-structure shows that IIA supergravity compactified on such a manifold should yield a four-dimensional gauged N=4 supergravity. We explicitly derive the bosonic spectrum, gauge transformations and action for IIA supergravity compactified on two different manifolds with SU(2)-structure, one of which also has an H{sup (3)}{sub 10}-flux, and confirm that the resulting four-dimensional theories are indeed N=4 gauged supergravities. In the second chapter, we study an explicit construction of a set of SU(2)-structure manifolds. This construction involves a Scherk-Schwarz duality twist reduction of the half-maximal six-dimensional supergravity obtained by compactifying IIA supergravity on a K3. This reduction results in a gauged N=4 four-dimensional supergravity, where the gaugings can be divided into three classes of parameters. We relate two of the classes to parameters we found before, and argue that the third class of parameters could be interpreted as a mirror flux. (orig.)

  20. Algebras and manifolds: Differential, difference, simplicial and quantum

    International Nuclear Information System (INIS)

    Finkelstein, D.; Rodriguez, E.

    1986-01-01

    Generalized manifolds and Clifford algebras depict the world at levels of resolution ranging from the classical macroscopic to the quantum microscopic. The coarsest picture is a differential manifold and algebra (dm), direct integral of familiar local Clifford algebras of spin operators in curved time-space. Next is a finite difference manifold (Δm) of Regge calculus. This is a subalgebra of the third, a Minkowskian simplicial manifold (Σm). The most detailed description is the quantum manifold (Qm), whose algebra is the free Clifford algebra S of quantum set theory. We surmise that each Σm is a classical 'condensation' of a Qm. Quantum simplices have both integer and half-integer spins in their spectrum. A quantum set theory of nature requires a series of reductions leading from the Qm and a world descriptor W up through the intermediate Σm and Δm to a dm and an action principle. What may be a new algebraic language for topology, classical or quantum, is a by-product of the work. (orig.)

  1. Group manifold approach to gravity and supergravity theories

    International Nuclear Information System (INIS)

    d'Auria, R.; Fre, P.; Regge, T.

    1981-05-01

    Gravity theories are presented from the point of view of group manifold formulation. The differential geometry of groups and supergroups is discussed first; the notion of connection and related Yang-Mills potentials is introduced. Then ordinary Einstein gravity is discussed in the Cartan formulation. This discussion provides a first example which will then be generalized to more complicated theories, in particular supergravity. The distinction between ''pure'' and ''impure' theories is also set forth. Next, the authors develop an axiomatic approach to rheonomic theories related to the concept of Chevalley cohomology on group manifolds, and apply these principles to N = 1 supergravity. Then the panorama of so far constructed pure and impure group manifold supergravities is presented. The pure d = 5 N = 2 case is discussed in some detail, and N = 2 and N = 3 in d = 4 are considered as examples of the impure theories. The way a pure theory becomes impure after dimensional reduction is illustrated. Next, the role of kinematical superspace constraints as a subset of the group-manifold equations of motion is discussed, and the use of this approach to obtain the auxiliary fields is demonstrated. Finally, the application of the group manifold method to supersymmetric Super Yang-Mills theories is addressed

  2. Quasi-Newton Exploration of Implicitly Constrained Manifolds

    KAUST Repository

    Tang, Chengcheng

    2011-08-01

    A family of methods for the efficient update of second order approximations of a constraint manifold is proposed in this thesis. The concept of such a constraint manifold corresponds to an abstract space prescribed by implicit nonlinear constraints, which can be a set of objects satisfying certain desired properties. This concept has a variety of applications, and it has been successfully introduced to fabrication-aware architectural design as a shape space consisting of all the implementable designs. The local approximation of such a manifold can be first order, in the tangent space, or second order, in the osculating surface, with higher precision. For a nonlinearly constrained manifold with rather high dimension and codimension, the computation of second order approximants (osculants) is time consuming. In this thesis, a type of so-called quasi-Newton manifold exploration methods which approximate the new osculants by updating the ones of a neighbor point by 1st-order information is introduced. The procedures are discussed in detail and the examples implemented to visually verify the methods are illustrated.

  3. Enhanced manifold regularization for semi-supervised classification.

    Science.gov (United States)

    Gan, Haitao; Luo, Zhizeng; Fan, Yingle; Sang, Nong

    2016-06-01

    Manifold regularization (MR) has become one of the most widely used approaches in the semi-supervised learning field. It has shown superiority by exploiting the local manifold structure of both labeled and unlabeled data. The manifold structure is modeled by constructing a Laplacian graph and then incorporated in learning through a smoothness regularization term. Hence the labels of labeled and unlabeled data vary smoothly along the geodesics on the manifold. However, MR has ignored the discriminative ability of the labeled and unlabeled data. To address the problem, we propose an enhanced MR framework for semi-supervised classification in which the local discriminative information of the labeled and unlabeled data is explicitly exploited. To make full use of labeled data, we firstly employ a semi-supervised clustering method to discover the underlying data space structure of the whole dataset. Then we construct a local discrimination graph to model the discriminative information of labeled and unlabeled data according to the discovered intrinsic structure. Therefore, the data points that may be from different clusters, though similar on the manifold, are enforced far away from each other. Finally, the discrimination graph is incorporated into the MR framework. In particular, we utilize semi-supervised fuzzy c-means and Laplacian regularized Kernel minimum squared error for semi-supervised clustering and classification, respectively. Experimental results on several benchmark datasets and face recognition demonstrate the effectiveness of our proposed method.

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

    Science.gov (United States)

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

    1999-01-01

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

  5. Blaschke- and Minkowski-endomorphisms of convex bodies

    DEFF Research Database (Denmark)

    Kiderlen, Markus

    2006-01-01

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

  6. Convex models and probabilistic approach of nonlinear fatigue failure

    International Nuclear Information System (INIS)

    Qiu Zhiping; Lin Qiang; Wang Xiaojun

    2008-01-01

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

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

    Czech Academy of Sciences Publication Activity Database

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

    2012-01-01

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

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

  9. Gröbner bases and convex polytopes

    CERN Document Server

    Sturmfels, Bernd

    1995-01-01

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

  10. On the structure of self-affine convex bodies

    Energy Technology Data Exchange (ETDEWEB)

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

    2013-08-31

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

  11. Para-Hermitian and para-quaternionic manifolds

    International Nuclear Information System (INIS)

    Ivanov, S.; Zamkovoy, S.

    2003-10-01

    A set of canonical para-Hermitian connections on an almost para-Hermitian manifold is defined. A Para-hermitian version of the Apostolov-Gauduchon generalization of the Goldberg-Sachs theorem in General Relativity is given. It is proved that the Nijenhuis tensor of a Nearly para-Kaehler manifolds is parallel with respect to the canonical connection. Salamon's twistor construction on quaternionic manifold is adapted to the para-quaternionic case. A locally conformally hyper-para-Kaehler (hypersymplectic) flat structure with parallel Lee form on the Kodaira-Thurston complex surfaces modeled on S 1 x SL (2, R)-tilde is constructed. Anti-self-dual locally conformally hyper-para-Kaehler (hypersymplectic) neutral metrics with non vanishing Weyl tensor are obtained on the Inoe surfaces. An example of anti-self-dual neutral metric which is not locally conformally hyper-para-Kaehler (hypersymplectic) is constructed. (author)

  12. Multiscale singular value manifold for rotating machinery fault diagnosis

    Energy Technology Data Exchange (ETDEWEB)

    Feng, Yi; Lu, BaoChun; Zhang, Deng Feng [School of Mechanical Engineering, Nanjing University of Science and Technology,Nanjing (United States)

    2017-01-15

    Time-frequency distribution of vibration signal can be considered as an image that contains more information than signal in time domain. Manifold learning is a novel theory for image recognition that can be also applied to rotating machinery fault pattern recognition based on time-frequency distributions. However, the vibration signal of rotating machinery in fault condition contains cyclical transient impulses with different phrases which are detrimental to image recognition for time-frequency distribution. To eliminate the effects of phase differences and extract the inherent features of time-frequency distributions, a multiscale singular value manifold method is proposed. The obtained low-dimensional multiscale singular value manifold features can reveal the differences of different fault patterns and they are applicable to classification and diagnosis. Experimental verification proves that the performance of the proposed method is superior in rotating machinery fault diagnosis.

  13. Rigidity of complete noncompact bach-flat n-manifolds

    Science.gov (United States)

    Chu, Yawei; Feng, Pinghua

    2012-11-01

    Let (Mn,g) be a complete noncompact Bach-flat n-manifold with the positive Yamabe constant and constant scalar curvature. Assume that the L2-norm of the trace-free Riemannian curvature tensor R∘m is finite. In this paper, we prove that (Mn,g) is a constant curvature space if the L-norm of R∘m is sufficiently small. Moreover, we get a gap theorem for (Mn,g) with positive scalar curvature. This can be viewed as a generalization of our earlier results of 4-dimensional Bach-flat manifolds with constant scalar curvature R≥0 [Y.W. Chu, A rigidity theorem for complete noncompact Bach-flat manifolds, J. Geom. Phys. 61 (2011) 516-521]. Furthermore, when n>9, we derive a rigidity result for R<0.

  14. Weyl-Euler-Lagrange Equations of Motion on Flat Manifold

    Directory of Open Access Journals (Sweden)

    Zeki Kasap

    2015-01-01

    Full Text Available This paper deals with Weyl-Euler-Lagrange equations of motion on flat manifold. It is well known that a Riemannian manifold is said to be flat if its curvature is everywhere zero. Furthermore, a flat manifold is one Euclidean space in terms of distances. Weyl introduced a metric with a conformal transformation for unified theory in 1918. Classical mechanics is one of the major subfields of mechanics. Also, one way of solving problems in classical mechanics occurs with the help of the Euler-Lagrange equations. In this study, partial differential equations have been obtained for movement of objects in space and solutions of these equations have been generated by using the symbolic Algebra software. Additionally, the improvements, obtained in this study, will be presented.

  15. Schoen manifold with line bundles as resolved magnetized orbifolds

    Energy Technology Data Exchange (ETDEWEB)

    Groot Nibbelink, Stefan [Muenchen Univ. (Germany). Arnold Sommerfeld Center for Theoretical Physics; Vaudrevange, Patrick K.S. [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany)

    2012-12-15

    We give an alternative description of the Schoen manifold as the blow-up of a Z{sub 2} x Z{sub 2} orbifold in which one Z{sub 2} factor acts as a roto-translation. Since for this orbifold the fixed tori are only identified in pairs but not orbifolded, four-dimensional chirality can never be obtained using standard techniques alone. However, chirality is recovered when its tori become magnetized. To exemplify this, we construct an SU(5) GUT on the Schoen manifold with Abelian gauge fluxes, which becomes an MSSM with three generations after an appropriate Wilson line is associated to its freely acting involution. We reproduce this model as a standard orbifold CFT of the (partially) blown down Schoen manifold with a magnetic flux. Finally, in analogy to a proposal for non-perturbative heterotic models by Aldazabal et al. we suggest modifications to the heterotic orbifold spectrum formulae in the presence of magnetized tori.

  16. Pseudo-differential operators on manifolds with singularities

    CERN Document Server

    Schulze, B-W

    1991-01-01

    The analysis of differential equations in domains and on manifolds with singularities belongs to the main streams of recent developments in applied and pure mathematics. The applications and concrete models from engineering and physics are often classical but the modern structure calculus was only possible since the achievements of pseudo-differential operators. This led to deep connections with index theory, topology and mathematical physics. The present book is devoted to elliptic partial differential equations in the framework of pseudo-differential operators. The first chapter contains the Mellin pseudo-differential calculus on R+ and the functional analysis of weighted Sobolev spaces with discrete and continuous asymptotics. Chapter 2 is devoted to the analogous theory on manifolds with conical singularities, Chapter 3 to manifolds with edges. Employed are pseudo-differential operators along edges with cone-operator-valued symbols.

  17. Adaptive Sampling for Nonlinear Dimensionality Reduction Based on Manifold Learning

    DEFF Research Database (Denmark)

    Franz, Thomas; Zimmermann, Ralf; Goertz, Stefan

    2017-01-01

    We make use of the non-intrusive dimensionality reduction method Isomap in order to emulate nonlinear parametric flow problems that are governed by the Reynolds-averaged Navier-Stokes equations. Isomap is a manifold learning approach that provides a low-dimensional embedding space that is approxi...... to detect and fill up gaps in the sampling in the embedding space. The performance of the proposed manifold filling method will be illustrated by numerical experiments, where we consider nonlinear parameter-dependent steady-state Navier-Stokes flows in the transonic regime.......We make use of the non-intrusive dimensionality reduction method Isomap in order to emulate nonlinear parametric flow problems that are governed by the Reynolds-averaged Navier-Stokes equations. Isomap is a manifold learning approach that provides a low-dimensional embedding space...

  18. Para-Hermitian and para-quaternionic manifolds

    Energy Technology Data Exchange (ETDEWEB)

    Ivanov, S [University of Sofia ' St. Kl. Ohridski' , Faculty of Mathematics and Informatics, Sofia (Bulgaria) and Abdus Salam International Centre for Theoretical Physics, Trieste (Italy); Zamkovoy, S [University of Sofia ' St. Kl. Ohridski' , Faculty of Mathematics and Informatics, Sofia (Bulgaria)

    2003-10-01

    A set of canonical para-Hermitian connections on an almost para-Hermitian manifold is defined. A Para-hermitian version of the Apostolov-Gauduchon generalization of the Goldberg-Sachs theorem in General Relativity is given. It is proved that the Nijenhuis tensor of a Nearly para-Kaehler manifolds is parallel with respect to the canonical connection. Salamon's twistor construction on quaternionic manifold is adapted to the para-quaternionic case. A locally conformally hyper-para-Kaehler (hypersymplectic) flat structure with parallel Lee form on the Kodaira-Thurston complex surfaces modeled on S{sup 1} x SL (2, R)-tilde is constructed. Anti-self-dual locally conformally hyper-para-Kaehler (hypersymplectic) neutral metrics with non vanishing Weyl tensor are obtained on the Inoe surfaces. An example of anti-self-dual neutral metric which is not locally conformally hyper-para-Kaehler (hypersymplectic) is constructed. (author)

  19. Unimodularity criteria for Poisson structures on foliated manifolds

    Science.gov (United States)

    Pedroza, Andrés; Velasco-Barreras, Eduardo; Vorobiev, Yury

    2018-03-01

    We study the behavior of the modular class of an orientable Poisson manifold and formulate some unimodularity criteria in the semilocal context, around a (singular) symplectic leaf. Our results generalize some known unimodularity criteria for regular Poisson manifolds related to the notion of the Reeb class. In particular, we show that the unimodularity of the transverse Poisson structure of the leaf is a necessary condition for the semilocal unimodular property. Our main tool is an explicit formula for a bigraded decomposition of modular vector fields of a coupling Poisson structure on a foliated manifold. Moreover, we also exploit the notion of the modular class of a Poisson foliation and its relationship with the Reeb class.

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

    Science.gov (United States)

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

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

  1. Postoperative 3D spine reconstruction by navigating partitioning manifolds

    Energy Technology Data Exchange (ETDEWEB)

    Kadoury, Samuel, E-mail: samuel.kadoury@polymtl.ca [Department of Computer and Software Engineering, Ecole Polytechnique Montreal, Montréal, Québec H3C 3A7 (Canada); Labelle, Hubert, E-mail: hubert.labelle@recherche-ste-justine.qc.ca; Parent, Stefan, E-mail: stefan.parent@umontreal.ca [CHU Sainte-Justine Hospital Research Center, Montréal, Québec H3T 1C5 (Canada)

    2016-03-15

    Purpose: The postoperative evaluation of scoliosis patients undergoing corrective treatment is an important task to assess the strategy of the spinal surgery. Using accurate 3D geometric models of the patient’s spine is essential to measure longitudinal changes in the patient’s anatomy. On the other hand, reconstructing the spine in 3D from postoperative radiographs is a challenging problem due to the presence of instrumentation (metallic rods and screws) occluding vertebrae on the spine. Methods: This paper describes the reconstruction problem by searching for the optimal model within a manifold space of articulated spines learned from a training dataset of pathological cases who underwent surgery. The manifold structure is implemented based on a multilevel manifold ensemble to structure the data, incorporating connections between nodes within a single manifold, in addition to connections between different multilevel manifolds, representing subregions with similar characteristics. Results: The reconstruction pipeline was evaluated on x-ray datasets from both preoperative patients and patients with spinal surgery. By comparing the method to ground-truth models, a 3D reconstruction accuracy of 2.24 ± 0.90 mm was obtained from 30 postoperative scoliotic patients, while handling patients with highly deformed spines. Conclusions: This paper illustrates how this manifold model can accurately identify similar spine models by navigating in the low-dimensional space, as well as computing nonlinear charts within local neighborhoods of the embedded space during the testing phase. This technique allows postoperative follow-ups of spinal surgery using personalized 3D spine models and assess surgical strategies for spinal deformities.

  2. Conservation laws in quantum mechanics on a Riemannian manifold

    International Nuclear Information System (INIS)

    Chepilko, N.M.

    1992-01-01

    In Refs. 1-5 the quantum dynamics of a particle on a Riemannian manifold V n is considered. The advantage of Ref. 5, in comparison with Refs. 1-4, is the fact that in it the differential-geometric character of the theory and the covariant definition (via the known Lagrangian of the particle) of the algebra of quantum-mechanical operators on V n are mutually consistent. However, in Ref. 5 the procedure for calculating the expectation values of operators from the known wave function of the particle is not discussed. In the authors view, this question is problematical and requires special study. The essence of the problem is that integration on a Riemannian manifold V n , unlike that of a Euclidean manifold R n , is uniquely defined only for scalars. For this reason, the calculation of the expectation value of, e.g., the operator of the momentum or angular momentum of a particle on V n is not defined in the usual sense. However, this circumstance was not taken into account by the authors of Refs. 1-4, in which quantum mechanics on a Riemannian manifold V n was studied. In this paper the author considers the conservation laws and a procedure for calculating observable quantities in the classical mechanics (Sec. 2) and quantum mechanics (Sec. 3) of a particle on V n . It is found that a key role here is played by the Killing vectors of the Riemannian manifold V n . It is shown that the proposed approach to the problem satisfies the correspondence principle for both the classical and the quantum mechanics of a particle on a Euclidean manifold R n

  3. Postoperative 3D spine reconstruction by navigating partitioning manifolds

    International Nuclear Information System (INIS)

    Kadoury, Samuel; Labelle, Hubert; Parent, Stefan

    2016-01-01

    Purpose: The postoperative evaluation of scoliosis patients undergoing corrective treatment is an important task to assess the strategy of the spinal surgery. Using accurate 3D geometric models of the patient’s spine is essential to measure longitudinal changes in the patient’s anatomy. On the other hand, reconstructing the spine in 3D from postoperative radiographs is a challenging problem due to the presence of instrumentation (metallic rods and screws) occluding vertebrae on the spine. Methods: This paper describes the reconstruction problem by searching for the optimal model within a manifold space of articulated spines learned from a training dataset of pathological cases who underwent surgery. The manifold structure is implemented based on a multilevel manifold ensemble to structure the data, incorporating connections between nodes within a single manifold, in addition to connections between different multilevel manifolds, representing subregions with similar characteristics. Results: The reconstruction pipeline was evaluated on x-ray datasets from both preoperative patients and patients with spinal surgery. By comparing the method to ground-truth models, a 3D reconstruction accuracy of 2.24 ± 0.90 mm was obtained from 30 postoperative scoliotic patients, while handling patients with highly deformed spines. Conclusions: This paper illustrates how this manifold model can accurately identify similar spine models by navigating in the low-dimensional space, as well as computing nonlinear charts within local neighborhoods of the embedded space during the testing phase. This technique allows postoperative follow-ups of spinal surgery using personalized 3D spine models and assess surgical strategies for spinal deformities

  4. Robust Covariance Estimators Based on Information Divergences and Riemannian Manifold

    Directory of Open Access Journals (Sweden)

    Xiaoqiang Hua

    2018-03-01

    Full Text Available This paper proposes a class of covariance estimators based on information divergences in heterogeneous environments. In particular, the problem of covariance estimation is reformulated on the Riemannian manifold of Hermitian positive-definite (HPD matrices. The means associated with information divergences are derived and used as the estimators. Without resorting to the complete knowledge of the probability distribution of the sample data, the geometry of the Riemannian manifold of HPD matrices is considered in mean estimators. Moreover, the robustness of mean estimators is analyzed using the influence function. Simulation results indicate the robustness and superiority of an adaptive normalized matched filter with our proposed estimators compared with the existing alternatives.

  5. Hamilton's gradient estimate for the heat kernel on complete manifolds

    OpenAIRE

    Kotschwar, Brett

    2007-01-01

    In this paper we extend a gradient estimate of R. Hamilton for positive solutions to the heat equation on closed manifolds to bounded positive solutions on complete, non-compact manifolds with $Rc \\geq -Kg$. We accomplish this extension via a maximum principle of L. Karp and P. Li and a Bernstein-type estimate on the gradient of the solution. An application of our result, together with the bounds of P. Li and S.T. Yau, yields an estimate on the gradient of the heat kernel for complete manifol...

  6. Distributed mean curvature on a discrete manifold for Regge calculus

    International Nuclear Information System (INIS)

    Conboye, Rory; Miller, Warner A; Ray, Shannon

    2015-01-01

    The integrated mean curvature of a simplicial manifold is well understood in both Regge Calculus and Discrete Differential Geometry. However, a well motivated pointwise definition of curvature requires a careful choice of the volume over which to uniformly distribute the local integrated curvature. We show that hybrid cells formed using both the simplicial lattice and its circumcentric dual emerge as a remarkably natural structure for the distribution of this local integrated curvature. These hybrid cells form a complete tessellation of the simplicial manifold, contain a geometric orthonormal basis, and are also shown to give a pointwise mean curvature with a natural interpretation as the fractional rate of change of the normal vector. (paper)

  7. Tops as building blocks for G 2 manifolds

    Science.gov (United States)

    Braun, Andreas P.

    2017-10-01

    A large number of examples of compact G 2 manifolds, relevant to supersymmetric compactifications of M-Theory to four dimensions, can be constructed by forming a twisted connected sum of two building blocks times a circle. These building blocks, which are appropriate K3-fibred threefolds, are shown to have a natural and elegant construction in terms of tops, which parallels the construction of Calabi-Yau manifolds via reflexive polytopes. In particular, this enables us to prove combinatorial formulas for the Hodge numbers and other relevant topological data.

  8. M Theory, G2-manifolds and four dimensional physics

    International Nuclear Information System (INIS)

    Acharya, B.S.

    2003-01-01

    M theory on a manifold of G 2 -holonomy is a natural framework for obtaining vacua with four large spacetime dimensions and N = 1 supersymmetry. In order to obtain, within this framework, the standard features of particle physics, namely non-Abelian gauge groups and chiral fermions, we consider G 2 -manifolds with certain kinds of singularities at which these features reside. The aim of these lectures is to describe in detail how the above picture emerges. Along the way we will see how interesting aspects of strongly coupled gauge theories, such as confinement, receive relatively simple explanations within the context of M theory. (author)

  9. Distributed mean curvature on a discrete manifold for Regge calculus

    Science.gov (United States)

    Conboye, Rory; Miller, Warner A.; Ray, Shannon

    2015-09-01

    The integrated mean curvature of a simplicial manifold is well understood in both Regge Calculus and Discrete Differential Geometry. However, a well motivated pointwise definition of curvature requires a careful choice of the volume over which to uniformly distribute the local integrated curvature. We show that hybrid cells formed using both the simplicial lattice and its circumcentric dual emerge as a remarkably natural structure for the distribution of this local integrated curvature. These hybrid cells form a complete tessellation of the simplicial manifold, contain a geometric orthonormal basis, and are also shown to give a pointwise mean curvature with a natural interpretation as the fractional rate of change of the normal vector.

  10. Gauge groups and topological invariants of vacuum manifolds

    International Nuclear Information System (INIS)

    Golo, V.L.; Monastyrsky, M.I.

    1978-01-01

    The paper is concerned with topological properties of the vacuum manifolds in the theories with the broken gauge symmetry for the groups of the type SO(k) x U(n), SO(k) x SO(p) x U(r). For the Ginsburg-Landau theory of the superfluid 3 He the gauge transformations are discussed. They provide the means to indicate all possible types of the vacuum manifolds, which are likely to correspond to distinct phases of the superfluid 3 He. Conditions on the existence of the minimums of the Ginsburg-Landau functional are discussed

  11. Prescribed curvature tensor in locally conformally flat manifolds

    Science.gov (United States)

    Pina, Romildo; Pieterzack, Mauricio

    2018-01-01

    A global existence theorem for the prescribed curvature tensor problem in locally conformally flat manifolds is proved for a special class of tensors R. Necessary and sufficient conditions for the existence of a metric g ¯ , conformal to Euclidean g, are determined such that R ¯ = R, where R ¯ is the Riemannian curvature tensor of the metric g ¯ . The solution to this problem is given explicitly for special cases of the tensor R, including the case where the metric g ¯ is complete on Rn. Similar problems are considered for locally conformally flat manifolds.

  12. Spontaneous compactification and Ricci-flat manifolds with torsion

    International Nuclear Information System (INIS)

    McInnes, B.

    1985-06-01

    The Freund-Rubin mechanism is based on the equation Rsub(ik)=lambdagsub(ik) (where lambda>0), which, via Myers' Theorem, implies ''spontaneous'' compactification. The difficulties connected with the cosmological constant in this approach can be resolved if torsion is introduced and lambda set equal to zero, but then compactification ''by hand'' is necessary, since the equation Rsub(ik)=0 can be satisfied both on compact and on non-compact manifolds. In this paper we discuss the global geometry of Ricci-flat manifolds with torsion, and suggest ways of restoring the ''spontaneity'' of the compactification. (author)

  13. Markov's theorem and algorithmically non-recognizable combinatorial manifolds

    International Nuclear Information System (INIS)

    Shtan'ko, M A

    2004-01-01

    We prove the theorem of Markov on the existence of an algorithmically non-recognizable combinatorial n-dimensional manifold for every n≥4. We construct for the first time a concrete manifold which is algorithmically non-recognizable. A strengthened form of Markov's theorem is proved using the combinatorial methods of regular neighbourhoods and handle theory. The proofs coincide for all n≥4. We use Borisov's group with insoluble word problem. It has two generators and twelve relations. The use of this group forms the base for proving the strengthened form of Markov's theorem

  14. Rotation vectors for homeomorphisms of non-positively curved manifolds

    International Nuclear Information System (INIS)

    Lessa, Pablo

    2011-01-01

    Rotation vectors, as defined for homeomorphisms of the torus that are isotopic to the identity, are generalized to such homeomorphisms of any complete Riemannian manifold with non-positive sectional curvature. These generalized rotation vectors are shown to exist for almost every orbit of such a dynamical system with respect to any invariant measure with compact support. The concept is then extended to flows and, as an application, it is shown how non-null rotation vectors can be used to construct a measurable semi-conjugacy between a given flow and the geodesic flow of a manifold

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

    OpenAIRE

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

    2012-01-01

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

  16. Sequential Change-Point Detection via Online Convex Optimization

    Directory of Open Access Journals (Sweden)

    Yang Cao

    2018-02-01

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

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

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

    DEFF Research Database (Denmark)

    Fischer, Paul

    1997-01-01

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

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

    Science.gov (United States)

    Briec, Walter; Horvath, Charles

    2008-05-01

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

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

    International Nuclear Information System (INIS)

    Grasmair, Markus

    2010-01-01

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

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

    Science.gov (United States)

    Bertamini, Marco; Wagemans, Johan

    2013-04-01

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

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

  3. The topology of certain 3-Sasakian 7-manifolds

    DEFF Research Database (Denmark)

    A. Hepworth, Richard

    2007-01-01

    We calculate the integer cohomology ring and stable tangent bundle of a family of compact, 3-Sasakian 7-manifolds constructed by Boyer, Galicki, Mann, and Rees. Previously only the rational cohomology ring was known. The most important part of the cohomology ring is a torsion group that we descri...

  4. Conceptual development of the Laser Beam Manifold (LBM)

    Science.gov (United States)

    Campbell, W.; Owen, R. B.

    1979-01-01

    The laser beam manifold, a device for transforming a single, narrow, collimated beam of light into several beams of desired intensity ratios is described. The device consists of a single optical substrate with a metallic coating on both optical surfaces. By changing the entry point, the number of outgoing beams can be varied.

  5. Local gradient estimate for harmonic functions on Finsler manifolds

    OpenAIRE

    Xia, Chao

    2013-01-01

    In this paper, we prove the local gradient estimate for harmonic functions on complete, noncompact Finsler measure spaces under the condition that the weighted Ricci curvature has a lower bound. As applications, we obtain Liouville type theorem on Finsler manifolds with nonnegative Ricci curvature.

  6. Characteristic Lightlike Submanifolds of an Indefinite S-Manifold

    Directory of Open Access Journals (Sweden)

    Jae Won Lee

    2011-01-01

    Full Text Available We study characteristic r-lightlike submanifolds M tangent to the characteristic vector fields in an indefinite metric S-manifold, and we also discuss the existence of characteristic lightlike submanifolds of an indefinite S-space form under suitable hypotheses: (1 M is totally umbilical or (2 its screen distribution S(TM is totally umbilical in M.

  7. Gauge theory and the topology of four-manifolds

    CERN Document Server

    Friedman, Robert Marc

    1998-01-01

    The lectures in this volume provide a perspective on how 4-manifold theory was studied before the discovery of modern-day Seiberg-Witten theory. One reason the progress using the Seiberg-Witten invariants was so spectacular was that those studying SU(2)-gauge theory had more than ten years' experience with the subject. The tools had been honed, the correct questions formulated, and the basic strategies well understood. The knowledge immediately bore fruit in the technically simpler environment of the Seiberg-Witten theory. Gauge theory long predates Donaldson's applications of the subject to 4-manifold topology, where the central concern was the geometry of the moduli space. One reason for the interest in this study is the connection between the gauge theory moduli spaces of a Kähler manifold and the algebro-geometric moduli space of stable holomorphic bundles over the manifold. The extra geometric richness of the SU(2)-moduli spaces may one day be important for purposes beyond the algebraic invariants that ...

  8. Holomorphic two-spheres in complex Grassmann manifold

    Indian Academy of Sciences (India)

    Home; Journals; Proceedings – Mathematical Sciences; Volume 118; Issue 3. Holomorphic Two-Spheres in Complex Grassmann Manifold (2, 4). Xiaowei Xu ... Author Affiliations. Xiaowei Xu1 Xiaoxiang Jiao1. School of Mathematical Sciences, Graduate University of Chinese Academy of Sciences, Beijing 100049, China ...

  9. Stochastic description of supersymmetric fields with values in a manifold

    International Nuclear Information System (INIS)

    Hoba, Z.

    1986-01-01

    This paper discusses the mathematical problem of the imaginary time quantum mechanics of a particle moving in Euclidean space as considered from the theory of diffusion processes. The diffusion process is defined by a stochastic equation; the equation describes the diffusion process as a time evolution of a Brownian particle in a force field. The paper considers a Brownian particle on a Riemannian manifold

  10. Nonparametric Bayes Classification and Hypothesis Testing on Manifolds

    Science.gov (United States)

    Bhattacharya, Abhishek; Dunson, David

    2012-01-01

    Our first focus is prediction of a categorical response variable using features that lie on a general manifold. For example, the manifold may correspond to the surface of a hypersphere. We propose a general kernel mixture model for the joint distribution of the response and predictors, with the kernel expressed in product form and dependence induced through the unknown mixing measure. We provide simple sufficient conditions for large support and weak and strong posterior consistency in estimating both the joint distribution of the response and predictors and the conditional distribution of the response. Focusing on a Dirichlet process prior for the mixing measure, these conditions hold using von Mises-Fisher kernels when the manifold is the unit hypersphere. In this case, Bayesian methods are developed for efficient posterior computation using slice sampling. Next we develop Bayesian nonparametric methods for testing whether there is a difference in distributions between groups of observations on the manifold having unknown densities. We prove consistency of the Bayes factor and develop efficient computational methods for its calculation. The proposed classification and testing methods are evaluated using simulation examples and applied to spherical data applications. PMID:22754028

  11. On equations of motion on complex grassman manifold

    International Nuclear Information System (INIS)

    Berceanu, S.; Gheorghe, A.

    1989-02-01

    We investigate the equations of motion on the 'classical' phase space which corresponds to quantum state space in the case of the complex Grassmann manifold appearing in the Hartree-Fock problem. First and second degree polynomial Hamiltonians in bifermion operators are considered. The 'classical' motion corresponding to linear Hamiltonians is described by a Matrix Riccati equation.(authors)

  12. Riemannian multi-manifold modeling and clustering in brain networks

    Science.gov (United States)

    Slavakis, Konstantinos; Salsabilian, Shiva; Wack, David S.; Muldoon, Sarah F.; Baidoo-Williams, Henry E.; Vettel, Jean M.; Cieslak, Matthew; Grafton, Scott T.

    2017-08-01

    This paper introduces Riemannian multi-manifold modeling in the context of brain-network analytics: Brainnetwork time-series yield features which are modeled as points lying in or close to a union of a finite number of submanifolds within a known Riemannian manifold. Distinguishing disparate time series amounts thus to clustering multiple Riemannian submanifolds. To this end, two feature-generation schemes for brain-network time series are put forth. The first one is motivated by Granger-causality arguments and uses an auto-regressive moving average model to map low-rank linear vector subspaces, spanned by column vectors of appropriately defined observability matrices, to points into the Grassmann manifold. The second one utilizes (non-linear) dependencies among network nodes by introducing kernel-based partial correlations to generate points in the manifold of positivedefinite matrices. Based on recently developed research on clustering Riemannian submanifolds, an algorithm is provided for distinguishing time series based on their Riemannian-geometry properties. Numerical tests on time series, synthetically generated from real brain-network structural connectivity matrices, reveal that the proposed scheme outperforms classical and state-of-the-art techniques in clustering brain-network states/structures.

  13. An algorithmic approach to construct crystallizations of 3-manifolds ...

    Indian Academy of Sciences (India)

    Gagliardi introduced an algorithm to find a presentation of the fundamental group of a closed connected ..... ij is the sum over 1 ≤ imanifold which.

  14. Rigid Body Energy Minimization on Manifolds for Molecular Docking.

    Science.gov (United States)

    Mirzaei, Hanieh; Beglov, Dmitri; Paschalidis, Ioannis Ch; Vajda, Sandor; Vakili, Pirooz; Kozakov, Dima

    2012-11-13

    Virtually all docking methods include some local continuous minimization of an energy/scoring function in order to remove steric clashes and obtain more reliable energy values. In this paper, we describe an efficient rigid-body optimization algorithm that, compared to the most widely used algorithms, converges approximately an order of magnitude faster to conformations with equal or slightly lower energy. The space of rigid body transformations is a nonlinear manifold, namely, a space which locally resembles a Euclidean space. We use a canonical parametrization of the manifold, called the exponential parametrization, to map the Euclidean tangent space of the manifold onto the manifold itself. Thus, we locally transform the rigid body optimization to an optimization over a Euclidean space where basic optimization algorithms are applicable. Compared to commonly used methods, this formulation substantially reduces the dimension of the search space. As a result, it requires far fewer costly function and gradient evaluations and leads to a more efficient algorithm. We have selected the LBFGS quasi-Newton method for local optimization since it uses only gradient information to obtain second order information about the energy function and avoids the far more costly direct Hessian evaluations. Two applications, one in protein-protein docking, and the other in protein-small molecular interactions, as part of macromolecular docking protocols are presented. The code is available to the community under open source license, and with minimal effort can be incorporated into any molecular modeling package.

  15. Discrete method for design of flow distribution in manifolds

    International Nuclear Information System (INIS)

    Wang, Junye; Wang, Hualin

    2015-01-01

    Flow in manifold systems is encountered in designs of various industrial processes, such as fuel cells, microreactors, microchannels, plate heat exchanger, and radial flow reactors. The uniformity of flow distribution in manifold is a key indicator for performance of the process equipment. In this paper, a discrete method for a U-type arrangement was developed to evaluate the uniformity of the flow distribution and the pressure drop and then was used for direct comparisons between the U-type and the Z-type. The uniformity of the U-type is generally better than that of the Z-type in most of cases for small ζ and large M. The U-type and the Z-type approach each other as ζ increases or M decreases. However, the Z-type is more sensitive to structures than the U-type and approaches uniform flow distribution faster than the U-type as M decreases or ζ increases. This provides a simple yet powerful tool for the designers to evaluate and select a flow arrangement and offers practical measures for industrial applications. - Highlights: • Discrete methodology of flow field designs in manifolds with U-type arrangements. • Quantitative comparison between U-type and Z-type arrangements. • Discrete solution of flow distribution with varying flow coefficients. • Practical measures and guideline to design of manifold systems.

  16. Deformations of coisotropic submanifolds in locally conformal symplectic manifolds

    Czech Academy of Sciences Publication Activity Database

    Le, Hong-Van; Oh, Y.-G.

    2016-01-01

    Roč. 20, č. 3 (2016), s. 553-596 ISSN 1093-6106 Institutional support: RVO:67985840 Keywords : locally conformal symplectic manifold * coisotropic submanifold * b-twisted differential * bulk deformation Subject RIV: BA - General Mathematics Impact factor: 0.895, year: 2016 http://intlpress.com/site/pub/pages/journals/items/ajm/content/vols/0020/0003/a007/index.html

  17. Quantum cohomology of flag manifolds and Toda lattices

    International Nuclear Information System (INIS)

    Givental, A.; Kim, B.

    1995-01-01

    We discuss relations of Vafa's quantum cohomology with Floer's homology theory, introduce equivariant quantum cohomology, formulate some conjectures about its general properties and, on the basis of these conjectures, compute quantum cohomology algebras of the flag manifolds. The answer turns out to coincide with the algebra of regular functions on an invariant lagrangian variety of a Toda lattice. (orig.)

  18. Enhancing Low-Rank Subspace Clustering by Manifold Regularization.

    Science.gov (United States)

    Liu, Junmin; Chen, Yijun; Zhang, JiangShe; Xu, Zongben

    2014-07-25

    Recently, low-rank representation (LRR) method has achieved great success in subspace clustering (SC), which aims to cluster the data points that lie in a union of low-dimensional subspace. Given a set of data points, LRR seeks the lowest rank representation among the many possible linear combinations of the bases in a given dictionary or in terms of the data itself. However, LRR only considers the global Euclidean structure, while the local manifold structure, which is often important for many real applications, is ignored. In this paper, to exploit the local manifold structure of the data, a manifold regularization characterized by a Laplacian graph has been incorporated into LRR, leading to our proposed Laplacian regularized LRR (LapLRR). An efficient optimization procedure, which is based on alternating direction method of multipliers (ADMM), is developed for LapLRR. Experimental results on synthetic and real data sets are presented to demonstrate that the performance of LRR has been enhanced by using the manifold regularization.

  19. Robust Semi-Supervised Manifold Learning Algorithm for Classification

    Directory of Open Access Journals (Sweden)

    Mingxia Chen

    2018-01-01

    Full Text Available In the recent years, manifold learning methods have been widely used in data classification to tackle the curse of dimensionality problem, since they can discover the potential intrinsic low-dimensional structures of the high-dimensional data. Given partially labeled data, the semi-supervised manifold learning algorithms are proposed to predict the labels of the unlabeled points, taking into account label information. However, these semi-supervised manifold learning algorithms are not robust against noisy points, especially when the labeled data contain noise. In this paper, we propose a framework for robust semi-supervised manifold learning (RSSML to address this problem. The noisy levels of the labeled points are firstly predicted, and then a regularization term is constructed to reduce the impact of labeled points containing noise. A new robust semi-supervised optimization model is proposed by adding the regularization term to the traditional semi-supervised optimization model. Numerical experiments are given to show the improvement and efficiency of RSSML on noisy data sets.

  20. Manifold regularization for sparse unmixing of hyperspectral images.

    Science.gov (United States)

    Liu, Junmin; Zhang, Chunxia; Zhang, Jiangshe; Li, Huirong; Gao, Yuelin

    2016-01-01

    Recently, sparse unmixing has been successfully applied to spectral mixture analysis of remotely sensed hyperspectral images. Based on the assumption that the observed image signatures can be expressed in the form of linear combinations of a number of pure spectral signatures known in advance, unmixing of each mixed pixel in the scene is to find an optimal subset of signatures in a very large spectral library, which is cast into the framework of sparse regression. However, traditional sparse regression models, such as collaborative sparse regression , ignore the intrinsic geometric structure in the hyperspectral data. In this paper, we propose a novel model, called manifold regularized collaborative sparse regression , by introducing a manifold regularization to the collaborative sparse regression model. The manifold regularization utilizes a graph Laplacian to incorporate the locally geometrical structure of the hyperspectral data. An algorithm based on alternating direction method of multipliers has been developed for the manifold regularized collaborative sparse regression model. Experimental results on both the simulated and real hyperspectral data sets have demonstrated the effectiveness of our proposed model.

  1. Morphological appearance manifolds for group-wise morphometric analysis.

    Science.gov (United States)

    Lian, Nai-Xiang; Davatzikos, Christos

    2011-12-01

    Computational anatomy quantifies anatomical shape based on diffeomorphic transformations of a template. However, different templates warping algorithms, regularization parameters, or templates, lead to different representations of the same exact anatomy, raising a uniqueness issue: variations of these parameters are confounding factors as they give rise to non-unique representations. Recently, it has been shown that learning the equivalence class derived from the multitude of representations of a given anatomy can lead to improved and more stable morphological descriptors. Herein, we follow that approach, by approximating this equivalence class of morphological descriptors by a (nonlinear) morphological appearance manifold fitting to the data via a locally linear model. Our approach parallels work in the computer vision field, in which variations lighting, pose and other parameters lead to image appearance manifolds representing the exact same figure in different ways. The proposed framework is then used for group-wise registration and statistical analysis of biomedical images, by employing a minimum variance criterion to perform manifold-constrained optimization, i.e. to traverse each individual's morphological appearance manifold until group variance is minimal. The hypothesis is that this process is likely to reduce aforementioned confounding effects and potentially lead to morphological representations reflecting purely biological variations, instead of variations introduced by modeling assumptions and parameter settings. Copyright © 2011 Elsevier B.V. All rights reserved.

  2. Deformations of Lagrangian subvarieties of holomorphic symplectic manifolds

    OpenAIRE

    Lehn, Christian

    2011-01-01

    We generalize Voisin's theorem on deformations of pairs of a symplectic manifold and a Lagrangian submanifold to the case of Lagrangian normal crossing subvarieties. Partial results are obtained for arbitrary Lagrangian subvarieties. We apply our results to the study of singular fibers of Lagrangian fibrations.

  3. Geometry and physics of pseudodifferential operators on manifolds

    DEFF Research Database (Denmark)

    Esposito, Giampiero; Napolitano, George M.

    2015-01-01

    A review is made of the basic tools used in mathematics to define a calculus for pseudodifferential operators on Riemannian manifolds endowed with a connection: existence theorem for the function that generalizes the phase; analogue of Taylor's theorem; torsion and curvature terms in the symbolic...

  4. Valve and Manifold considerations for Efficient Digital Hydraulic Machines

    DEFF Research Database (Denmark)

    Roemer, Daniel Beck; Nørgård, Christian; Bech, Michael Møller

    2016-01-01

    strict requirements to the switching valves and the overall manifold design. To investigate this topic, the largest known digital motor (3.5 megawatt) is studied using models and optimization. Based on the limited information available about this motor, a detailed reconstruction of the motor architecture...

  5. Experimental investigation of a manifold heat-pipe heat exchanger

    International Nuclear Information System (INIS)

    Konev, S.V.; Wang Tszin' Lyan'; D'yakov, I.I.

    1995-01-01

    Results of experimental investigations of a heat exchanger on a manifold water heat pipe are given. An analysis is made of the temperature distribution along the heat-transfer agent path as a function of the transferred heat power. The influence of the degree of filling with the heat transfer agent on the operating characteristics of the construction is considered

  6. On some properties of the superposition operator on topological manifolds

    Directory of Open Access Journals (Sweden)

    Janusz Dronka

    2010-01-01

    Full Text Available In this paper the superposition operator in the space of vector-valued, bounded and continuous functions on a topological manifold is considered. The acting conditions and criteria of continuity and compactness are established. As an application, an existence result for the nonlinear Hammerstein integral equation is obtained.

  7. Modeling Diesel engine combustion using pressure dependent Flamelet Generated Manifolds

    NARCIS (Netherlands)

    Bekdemir, C.; Somers, L.M.T.; Goey, de L.P.H.

    2011-01-01

    Flamelet Generated Manifolds (FGMs) are constructed and applied to simulations of a conventional compression ignition engine cycle. To study the influence of pressure and temperature variations on the ignition process after the compression stroke, FGMs with several pressure levels are created. These

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

  9. Quantum invariants of knots and 3-manifolds. 2. rev. ed.

    International Nuclear Information System (INIS)

    Turaev, Vladimir G.

    2010-01-01

    Due to the strong appeal and wide use of this monograph, it is now available in its second revised edition. The monograph gives a systematic treatment of 3-dimensional topological quantum field theories (TQFTs) based on the work of the author with N. Reshetikhin and O. Viro. This subject was inspired by the discovery of the Jones polynomial of knots and the Witten-Chern-Simons field theory. On the algebraic side, the study of 3-dimensional TQFTs has been influenced by the theory of braided categories and the theory of quantum groups. The book is divided into three parts. Part I presents a construction of 3-dimensional TQFTs and 2-dimensional modular functors from so-called modular categories. This gives a vast class of knot invariants and 3-manifold invariants as well as a class of linear representations of the mapping class groups of surfaces. In Part II the technique of 6j-symbols is used to define state sum invariants of 3-manifolds. Their relation to the TQFTs constructed in Part I is established via the theory of shadows. Part III provides constructions of modular categories, based on quantum groups and skein modules of tangles in the 3-space. This fundamental contribution to topological quantum field theory is accessible to graduate students in mathematics and physics with knowledge of basic algebra and topology. It is an indispensable source for everyone who wishes to enter the forefront of this fascinating area at the borderline of mathematics and physics. From the contents: - Invariants of graphs in Euclidean 3-space and of closed 3-manifolds - Foundations of topological quantum field theory - Three-dimensional topological quantum field theory - Two-dimensional modular functors - 6j-symbols - Simplicial state sums on 3-manifolds - Shadows of manifolds and state sums on shadows - Constructions of modular categories. (orig.)

  10. Person-Independent Head Pose Estimation Using Biased Manifold Embedding

    Directory of Open Access Journals (Sweden)

    Sethuraman Panchanathan

    2008-02-01

    Full Text Available Head pose estimation has been an integral problem in the study of face recognition systems and human-computer interfaces, as part of biometric applications. A fine estimate of the head pose angle is necessary and useful for several face analysis applications. To determine the head pose, face images with varying pose angles can be considered to be lying on a smooth low-dimensional manifold in high-dimensional image feature space. However, when there are face images of multiple individuals with varying pose angles, manifold learning techniques often do not give accurate results. In this work, we propose a framework for a supervised form of manifold learning called Biased Manifold Embedding to obtain improved performance in head pose angle estimation. This framework goes beyond pose estimation, and can be applied to all regression applications. This framework, although formulated for a regression scenario, unifies other supervised approaches to manifold learning that have been proposed so far. Detailed studies of the proposed method are carried out on the FacePix database, which contains 181 face images each of 30 individuals with pose angle variations at a granularity of 1∘. Since biometric applications in the real world may not contain this level of granularity in training data, an analysis of the methodology is performed on sparsely sampled data to validate its effectiveness. We obtained up to 2∘ average pose angle estimation error in the results from our experiments, which matched the best results obtained for head pose estimation using related approaches.

  11. Slow Integral Manifolds and Control Problems in Critical and Twice Critical Cases

    International Nuclear Information System (INIS)

    Sobolev, Vladimir

    2016-01-01

    We consider singularly perturbed differential systems in cases where the standard theory to establish a slow integral manifold existence does not work. The theory has traditionally dealt only with perturbation problems near normally hyperbolic manifold of singularities and this manifold is supposed to isolated. Applying transformations we reduce the original singularly perturbed problem to a regularized one such that the existence of slow integral manifolds can be established by means of the standard theory. We illustrate our approach by several examples. (paper)

  12. Nonparametric instrumental regression with non-convex constraints

    International Nuclear Information System (INIS)

    Grasmair, M; Scherzer, O; Vanhems, A

    2013-01-01

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

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

  14. Elastic energy of liquid crystals in convex polyhedra

    International Nuclear Information System (INIS)

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

    2004-01-01

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

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

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

    KAUST Repository

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

    2012-01-01

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

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

  18. Approximating convex Pareto surfaces in multiobjective radiotherapy planning

    International Nuclear Information System (INIS)

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

    2006-01-01

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

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

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

    Science.gov (United States)

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

    2014-03-01

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