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. Strictly convex functions on complete Finsler manifolds

    Indian Academy of Sciences (India)

    minimum set of a super Busemann function contains a soul of M. Clearly, a complete simply connected Riemannian manifold H of non-positive sec- tional curvature, called Hadamard manifold, has the property that the distance function to an arbitrary fixed point is strongly convex exhaustion. Also, the exponential map expp :.

  3. Strictly convex functions on complete Finsler manifolds

    Indian Academy of Sciences (India)

    ... Refresher Courses · Symposia · Live Streaming. Home; Journals; Proceedings – Mathematical Sciences; Volume 126; Issue 4. Strictly convex functions on complete Finsler manifolds. YOE ITOKAWA KATSUHIRO SHIOHAMA BANKTESHWAR TIWARI. Research Article Volume 126 Issue 4 October 2016 pp 623-627 ...

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

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

  6. Convexity of spheres in a manifold without conjugate points

    Indian Academy of Sciences (India)

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

    Abstract. For a non-compact, complete and simply connected manifold M without conjugate points, we prove that if the determinant of the second fundamental form of the geodesic spheres in M is a radial function, then the geodesic spheres are convex. We also show that if M is two or three dimensional and without ...

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

    Indian Academy of Sciences (India)

    –6, 10,. 19–23]. In this work, we use fibering map analysis and Nehari manifold approach to solve the problem (1.1). Our work is .... where p∗ = np(n − pα)−1 is the fractional critical Sobolev exponent. Proof. Let u ∈ X0, then by Lemma 2.1, ...

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

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

  10. Convex analysis

    CERN Document Server

    Krantz, Steven G

    2014-01-01

    Why Convexity?Basic IdeasIntroductionThe Classical TheorySeparation TheoremsApproximationFunctionsDefining FunctionAnalytic DefinitionConvex FunctionsExhaustion FunctionsMore on FunctionsOther CharacterizationsConvexity of Finite OrderExtreme PointsSupport FunctionsApproximation from BelowBumpingApplicationsThe Krein-Milman TheoremThe Minkowski SumBrunn-MinkowskiMore Sophisticated IdeasThe Polar of a SetOptimizationIntroductory

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

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

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

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

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

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

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

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

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

  20. Bornological Locally Convex Cones

    Directory of Open Access Journals (Sweden)

    Davood Ayaseh

    2014-10-01

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

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

  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. Convex Congestion Network Problems

    NARCIS (Netherlands)

    Quant, M.; Reijnierse, J.H.

    2004-01-01

    This paper analyzes convex congestion network problems.It is shown that for network problems with convex congestion costs, an algorithm based on a shortest path algorithm, can be used to find an optimal network for any coalition. Furthermore an easy way of determining if a given network is optimal

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

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

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

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

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

  9. Statistical properties of convex clustering

    OpenAIRE

    Tan, Kean Ming; Witten, Daniela

    2015-01-01

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

  10. Strictly convex renormings

    Czech Academy of Sciences Publication Activity Database

    Moltó, A.; Orihuela, J.; Troyanski, S.; Zizler, Václav

    2007-01-01

    Roč. 75, č. 3 (2007), s. 647-658 ISSN 0024-6107 R&D Projects: GA AV ČR IAA100190502 Institutional research plan: CEZ:AV0Z10190503 Keywords : strictly convex norms * lattice norm * quasi-diagonal sets Subject RIV: BA - General Mathematics Impact factor: 0.733, year: 2007

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

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

  13. Causes for "ghost" manifolds

    Science.gov (United States)

    Borok, S.; Goldfarb, I.; Gol'dshtein, V.

    2009-05-01

    The paper concerns intrinsic low-dimensional manifold (ILDM) method suggested in [Maas U, Pope SB. Simplifying chemical kinetics: intrinsic low-dimensional manifolds in composition space, combustion and flame 1992;88:239-64] for dimension reduction of models describing kinetic processes. It has been shown in a number of publications [Goldfarb I, Gol'dshtein V, Maas U. Comparative analysis of two asymptotic approaches based on integral manifolds. IMA J Appl Math 2004;69:353-74; Kaper HG, Kaper TJ, Asymptotic analysis of two reduction methods for systems of chemical reactions. Phys D 2002;165(1-2):66-93; Rhodes C, Morari M, Wiggins S. Identification of the low order manifolds: validating the algorithm of Maas and Pope. Chaos 1999;9(1):108-23] that the ILDM-method works successfully and the intrinsic low-dimensional manifolds belong to a small vicinity of invariant slow manifolds. The ILDM-method has a number of disadvantages. One of them is appearance of so-called "ghost"-manifolds, which do not have connection to the system dynamics [Borok S, Goldfarb I, Gol'dshtein V. "Ghost" ILDM - manifolds and their discrimination. In: Twentieth Annual Symposium of the Israel Section of the Combustion Institute, Beer-Sheva, Israel; 2004. p. 55-7; Borok S, Goldfarb I, Gol'dshtein V. About non-coincidence of invariant manifolds and intrinsic low-dimensional manifolds (ILDM). CNSNS 2008;71:1029-38; Borok S, Goldfarb I, Gol'dshtein V, Maas U. In: Gorban AN, Kazantzis N, Kevrekidis YG, Ottinger HC, Theodoropoulos C, editors. "Ghost" ILDM-manifolds and their identification: model reduction and coarse-graining approaches for multiscale phenomena. Berlin-Heidelberg-New York: Springer; 2006. p. 55-80; Borok S, Goldfarb I, Gol'dshtein V. On a modified version of ILDM method and its asymptotic analysis. IJPAM 2008; 44(1): 125-50; Bykov V, Goldfarb I, Gol'dshtein V, Maas U. On a modified version of ILDM approach: asymptotic analysis based on integral manifolds. IMA J Appl Math 2006

  14. Convex Optimization in R

    Directory of Open Access Journals (Sweden)

    Roger Koenker

    2014-09-01

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

  15. Some Aspects of Convexity

    Indian Academy of Sciences (India)

    A subset C of an arbitrary vector space. V is called convex .... C c IR n is the set of those points X E IRn for which it is possible to find a sequence {Xk : k = 1, 2 } in C which converges to X (meaning that limk_oo Ilxk - xii = 0).) (3) Prove that if S ..... subject of linear programming which deals with extrema of linear forms subject to.

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

  17. Convex Graph Invariants

    Science.gov (United States)

    2010-12-02

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

  18. 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 ... Regarding self-maps of (complex) Grassmann manifolds the following results are well-known: Parameswaran Sankaran Institute of Mathematical Sciences Chennai, India sankaran@imsc.res.in. Indian Academy of Sciences Platinum Jubilee Meeting Hyderabad. Maps between Grassmann manifolds ...

  19. Manifold Partition Discriminant Analysis.

    Science.gov (United States)

    Yang Zhou; Shiliang Sun

    2017-04-01

    We propose a novel algorithm for supervised dimensionality reduction named manifold partition discriminant analysis (MPDA). It aims to find a linear embedding space where the within-class similarity is achieved along the direction that is consistent with the local variation of the data manifold, while nearby data belonging to different classes are well separated. By partitioning the data manifold into a number of linear subspaces and utilizing the first-order Taylor expansion, MPDA explicitly parameterizes the connections of tangent spaces and represents the data manifold in a piecewise manner. While graph Laplacian methods capture only the pairwise interaction between data points, our method captures both pairwise and higher order interactions (using regional consistency) between data points. This manifold representation can help to improve the measure of within-class similarity, which further leads to improved performance of dimensionality reduction. Experimental results on multiple real-world data sets demonstrate the effectiveness of the proposed method.

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

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

  2. Fuzzy efficiency without convexity

    DEFF Research Database (Denmark)

    Hougaard, Jens Leth; Balezentis, Tomas

    2014-01-01

    In this paper we develop a fuzzy version of the crisp Free Disposal Hull (FDH) method for measuring technical efficiency for samples of similar production units. The FDH-method is basically Data Envelopment Analysis (DEA) without the underlying assumption of convexity of the technology set. Our...... approach builds directly upon the definition of Farrell's indexes of technical efficiency used in crisp FDH. Therefore we do not require the use of fuzzy programming techniques but only utilize ranking probabilities of intervals as well as a related definition of dominance between pairs of intervals. We...

  3. Nonlinear analysis on manifolds

    CERN Document Server

    Hebey, Emmanuel

    2000-01-01

    This volume offers an expanded version of lectures given at the Courant Institute on the theory of Sobolev spaces on Riemannian manifolds. "Several surprising phenomena appear when studying Sobolev spaces on manifolds," according to the author. "Questions that are elementary for Euclidean space become challenging and give rise to sophisticated mathematics, where the geometry of the manifold plays a central role." The volume is organized into nine chapters. Chapter 1 offers a brief introduction to differential and Riemannian geometry. Chapter 2 deals with the general theory of Sobolev spaces fo

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

  5. Convex probe endobronchial ultrasound.

    Science.gov (United States)

    Bade, Brett; Furukawa, Brian; Tanner, Nichole T

    2014-12-01

    Convex probe endobronchial ultrasound (EBUS) is a minimally invasive diagnostic technique that allows real-time sampling of mediastinal and hilar lymph nodes and central pulmonary lesions. Its utility in diagnosing both malignant and nonmalignant diseases has led to an increased uptake and use by pulmonologists over the past decade. Because of the robust evidence supporting its safety and diagnostic yield, EBUS is now the first guideline recommended test for staging in non-small cell lung cancer (NSCLC). It has also a role in providing tissue for molecular analysis, thereby guiding in the selection of agents in the new era of personalized chemotherapies in the treatment of NSCLC. The following review highlights the evidence for EBUS in diagnosing mediastinal pathology and addresses technique, training, and competency and future directions for this technology. Thieme Medical Publishers 333 Seventh Avenue, New York, NY 10001, USA.

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

  7. Convex games versus clan games

    NARCIS (Netherlands)

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

    2008-01-01

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

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

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

  10. Manifold tool guide

    Science.gov (United States)

    Djordjevic, A.

    1982-07-08

    A tool guide that makes possible the insertion of cleaning and/or inspection tools into a manifold pipe that will dislocate and extract the accumulated sediment in such manifold pipes. The tool guide basically comprises a right angled tube (or other angled tube as required) which can be inserted in a large tube and locked into a radially extending cross pipe by adjustable spacer rods and a spring-loaded cone, whereby appropriate cleaning tools can be inserted into to cross pipe for cleaning, inspection, etc.

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

  12. Analyse convexe et quasi-convexe ; applications en optimisation

    OpenAIRE

    DANIILIDIS, Aris

    2002-01-01

    Rapporteurs : R. Deville (Bordeaux) D.T. Luc (Avignon) J.-E. Martinez-Legaz (Barcelone, Espagne) Examinateurs : J.-P. Crouzeix (Clermont-Ferrand) (President du jury) S. Gautier (Pau) N. Hadjisavvas (Samos, Grece) J.-P. Penot (Pau) L. Thibault (Montpellier); This document is a research contribution on Convex Analysis, on Generalized Convexity and on their applications in Optimization Theory. The first part deals with several fundamental questions concerning continuity, differentiability and cr...

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

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

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

  17. The Convex Coordinates of the Symmedian Point

    Science.gov (United States)

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

    2006-01-01

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

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

  19. Manifold Learning of COPD.

    Science.gov (United States)

    Bragman, Felix J S; McClelland, Jamie R; Jacob, Joseph; Hurst, John R; Hawkes, David J

    2017-09-01

    Analysis of CT scans for studying Chronic Obstructive Pulmonary Disease (COPD) is generally limited to mean scores of disease extent. However, the evolution of local pulmonary damage may vary between patients with discordant effects on lung physiology. This limits the explanatory power of mean values in clinical studies. We present local disease and deformation distributions to address this limitation. The disease distribution aims to quantify two aspects of parenchymal damage: locally diffuse/dense disease and global homogeneity/heterogeneity. The deformation distribution links parenchymal damage to local volume change. These distributions are exploited to quantify inter-patient differences. We used manifold learning to model variations of these distributions in 743 patients from the COPDGene study. We applied manifold fusion to combine distinct aspects of COPD into a single model. We demonstrated the utility of the distributions by comparing associations between learned embeddings and measures of severity. We also illustrated the potential to identify trajectories of disease progression in a manifold space of COPD.

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

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

  2. 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...... formulas. Concretely for LIBOR in arrears (LIA) contracts, we derive the system of Riccatti ODE-s one needs to compute to obtain the exact adjustment. Based upon the ideas of Schrager and Pelsser (2006) we are also able to derive general swap adjustments useful, in particular, when dealing with constant...

  3. Multiple positive solutions for Kirchhoff type problems involving concave and convex nonlinearities in R^3

    Directory of Open Access Journals (Sweden)

    Xiaofei Cao

    2016-11-01

    Full Text Available In this article, we consider the multiplicity of positive solutions for a class of Kirchhoff type problems with concave and convex nonlinearities. Under appropriate assumptions, we prove that the problem has at least two positive solutions, moreover, one of which is a positive ground state solution. Our approach is mainly based on the Nehari manifold, Ekeland variational principle and the theory of Lagrange multipliers.

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

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

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

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

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

  9. CONVEX BODIES AND GAUSSIAN PROCESSES

    Directory of Open Access Journals (Sweden)

    Richard A Vitale

    2011-05-01

    Full Text Available For several decades, the topics of the title have had a fruitful interaction. This survey will describe some of these connections, including the GB/GC classification of convex bodies, Ito-Nisio singularities from a geometric viewpoint, Gaussian representation of intrinsic volumes, theWills functional in a Gaussian context, and inequalities.

  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. Morse theory on banach manifolds

    International Nuclear Information System (INIS)

    Wang, T.

    1986-01-01

    The Morse Theory of critical points was extended by Palais and Smale to a certain class of functions on Hilbert manifolds. However, there are many variational problems in a nonlinear setting which for technical reasons are posed not on Hilbert but on Banach manifolds of mappings. This paper introduces a concept of a multivalued gradient vector field for a function defined on a Banach manifold. Using this concept, the Morse theory is generalized to some kind of Banach manifolds. The first chapter gives a definition of nondegeneracy of critical points for a real valued function defined on a reflexive Banach manifold, and then a handle-body decomposition theorem and Morse inequalities for this manifold are obtained. The second chapter proves the existence of solutions for a differential inclusion for a so-called accretive multi-valued mapping on a Finsler manifold. The third chapter introduces a definition of nondegeneracy of critical points for a real valued function defined on a general Banach manifold and, furthermore, generalizes the Morse handle-body decomposition theorem and the Morse inequalities to the Banach manifold

  12. Fixed point theorems for paracompact convex sets

    International Nuclear Information System (INIS)

    Jiang Jiahe.

    1986-08-01

    In the present paper a few fixed point theorems are given for upper hemi-continuous mappings from a paracompact convex set to its embracing space, a real, locally convex, Hausdorff topological vector space. (author)

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

  14. Revisiting separation properties of convex fuzzy sets

    Science.gov (United States)

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

  15. Cobordism independence of Grassmann manifolds

    Indian Academy of Sciences (India)

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

    Introduction. This paper is a continuation of the ongoing study of cobordism of Grassmann manifolds. Let. F denote one of the division rings R of reals, C of complex numbers, or H of quaternions. Let t = dimRF. Then the Grassmannian manifold Gk(Fn+k) is defined to be the set of all k-dimensional (left) subspaces of Fn+k.

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

  18. Attracting manifolds for attitude estimation in flatland and otherlands

    Science.gov (United States)

    Akella, Maruthi R.; Seo, Dongeun; Zanetti, Renato

    2006-12-01

    Non-convex and non-affine parameterizations of uncertainty are intrinsic within every attitude estimation problem given the fact that minimal and/or nonsingular representations of the attitude matrix are invariably nonlinear functions of the unknown attitude variables. Of course, this fact remains true for rotation matrices both in the 2-D plane (flatland) and in higher dimensional spaces (otherlands). Therefore, estimation problems involving minimal nonsingular representations of unknown attitude matrices bring significant challenges to the adaptive estimation community. This paper develops a novel algorithm for attitude estimation. The proposed algorithm relies upon the design of an adaptive update law for the attitude estimate while preserving its inherent orthogonal structure. The underlying approach borrows from the classical Poisson differential equation in rigid-body rotational kinematics and endows certain manifold attractivity features within the adaptive estimation algorithm. Consequently, we are not only able to efficiently handle the non-affine and non-convex nature of the parameter uncertainty, but are also ensured of estimation algorithm stability and robustness under bounded measurement noise. In addition to a rigorous discussion on the overall methodology, the paper provides example simulations that help demonstrate the effectiveness of the attracting manifolds design.

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

  20. Scoliosis convexity and organ anatomy are related.

    Science.gov (United States)

    Schlösser, Tom P C; Semple, Tom; Carr, Siobhán B; Padley, Simon; Loebinger, Michael R; Hogg, Claire; Castelein, René M

    2017-06-01

    Primary ciliary dyskinesia (PCD) is a respiratory syndrome in which 'random' organ orientation can occur; with approximately 46% of patients developing situs inversus totalis at organogenesis. The aim of this study was to explore the relationship between organ anatomy and curve convexity by studying the prevalence and convexity of idiopathic scoliosis in PCD patients with and without situs inversus. Chest radiographs of PCD patients were systematically screened for existence of significant lateral spinal deviation using the Cobb angle. Positive values represented right-sided convexity. Curve convexity and Cobb angles were compared between PCD patients with situs inversus and normal anatomy. A total of 198 PCD patients were screened. The prevalence of scoliosis (Cobb >10°) and significant spinal asymmetry (Cobb 5-10°) was 8 and 23%, respectively. Curve convexity and Cobb angle were significantly different within both groups between situs inversus patients and patients with normal anatomy (P ≤ 0.009). Moreover, curve convexity correlated significantly with organ orientation (P scoliosis (8 situs inversus and 8 normal anatomy), except for one case, matching of curve convexity and orientation of organ anatomy was observed: convexity of the curve was opposite to organ orientation. This study supports our hypothesis on the correlation between organ anatomy and curve convexity in scoliosis: the convexity of the thoracic curve is predominantly to the right in PCD patients that were 'randomized' to normal organ anatomy and to the left in patients with situs inversus totalis.

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

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

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

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

  5. On Kähler–Norden manifolds

    Indian Academy of Sciences (India)

    manifolds. Some properties of Riemannian curvature tensors and curvature scalars of. Kähler–Norden manifolds using the theory of Tachibana operators is presented. Keywords. Kähler–Norden manifold; Norden metric; twin metric; pure tensor; holo- morphic tensor. 1. Introduction. Let M2n be a Riemannian manifold with a ...

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

  7. Hadamard type inequalities for m-convex and (α, m)-convex functions via fractional integrals

    Science.gov (United States)

    Ardıç, Merve Avcı; Ekinci, Alper; Akdemir, Ahmet Ocak; Özdemir, M. Emin

    2018-01-01

    In this paper, we established some new Hadamard-type integral inequalities for functions whose derivatives of absolute values are m-convex and (α, m)-convex functions via Riemann-Liouville fractional integrals.

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

  9. Initially Approximated Quasi Equilibrium Manifold

    International Nuclear Information System (INIS)

    Shahzad, M.; Arif, H.; Gulistan, M.; Sajid, M.

    2015-01-01

    Most commonly, kinetics model reduction techniques are based on exploiting time scale separation into fast and slow reaction processes. Then, a researcher approximates the system dynamically with dimension reduction for slow ones eliminating the fast modes. The main idea behind the construction of the lower dimension manifold is based on finding its initial approximation using Quasi Equilibrium Manifold (QEM). Here, we provide an efficient numerical method, which allow us to calculate low dimensional manifolds of chemical reaction systems. This computation technique is not restricted to our specific complex problem, but it can also be applied to other reacting flows or dynamic systems provided with the condition that a large number of extra (decaying) components can be eliminated from the system. Through computational approach, we approximate low dimensional manifold for a mechanism of six chemical species to simplify complex chemical kinetics. A reduced descriptive form of slow invariant manifold is obtained from dissipative system. This method is applicable for higher dimensions and is applied over an oxidation of CO/Pt. (author)

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

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

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

  13. Differential analysis of matrix convex functions II

    DEFF Research Database (Denmark)

    Hansen, Frank; Tomiyama, Jun

    2009-01-01

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

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

  15. Fivebranes and 3-manifold homology

    Science.gov (United States)

    Gukov, Sergei; Putrov, Pavel; Vafa, Cumrun

    2017-07-01

    Motivated by physical constructions of homological knot invariants, we study their analogs for closed 3-manifolds. We show that fivebrane compactifications provide a universal description of various old and new homological invariants of 3-manifolds. In terms of 3d/3d correspondence, such invariants are given by the Q-cohomology of the Hilbert space of partially topologically twisted 3d N=2 theory T[ M 3] on a Riemann surface with defects. We demonstrate this by concrete and explicit calculations in the case of monopole/Heegaard Floer homology and a 3-manifold analog of Khovanov-Rozansky link homology. The latter gives a categorification of Chern-Simons partition function. Some of the new key elements include the explicit form of the S-transform and a novel connection between categorification and a previously mysterious role of Eichler integrals in Chern-Simons theory.

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

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

  18. 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 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 optimize a criteria of interest. The requirements that the solution both is geodesic and must pass through the mean tend...

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

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

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

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

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

    Indian Academy of Sciences (India)

    125, No. 4, November 2015, pp. 545–558. c Indian Academy of Sciences ... MS received 17 December 2013; revised 26 January 2015. Abstract. In this article, we study the existence ...... [19] Tarantello G, On nonhomogeneous elliptic equations involving critical Sobolev expo- nent, Ann. Inst. H. Poincare Anal. non lineaire 9 ...

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

  5. 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)$ int...

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

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

  8. Minimal surfaces in Riemannian manifolds

    International Nuclear Information System (INIS)

    Ji Min; Wang Guangyin

    1990-10-01

    A multiple solution to the Plateau problem in a Riemannian manifold is established. In S n , the existence of two solutions to this problem is obtained. The Morse-Tompkins-Shiffman theorem is extended to the case when the ambient space admits no minimal sphere. (author). 20 refs

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

  10. The dynamics of slow manifolds

    NARCIS (Netherlands)

    Verhulst, F.; Bakri, T.

    2006-01-01

    Invited lecture at Konferensi Nasional Matematika XIII, Semarang, 24-27 juli, 2006; to be publ. in J. Indones. Math. Soc. (2007) After reviewing a number of results from geometric singular perturbation theory, we discuss several approaches to obtain periodic solutions in a slow manifold.

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

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

  13. Quotient of manifolds by discrete groups

    International Nuclear Information System (INIS)

    Ardalan, F.; Arfaei, H.

    1985-09-01

    Quotient of manifolds by discrete subgroups of their isometry group are considered. In particular, symmetry breaking due to the quotient structure, topological properties and harmonic analysis of the resultant manifolds are discussed and illustrated by two dimensional examples. (author)

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

  15. An integrality theorem for spinc manifolds

    International Nuclear Information System (INIS)

    Seade, J.A.

    1990-04-01

    A spin c manifold M n is an oriented, Riemannian manifold with an associated hermitian live bundle det(M), together with a lifting to B(spin n c ) of the classifying map of the bundle TMxU(1). We prove here an integrality theorem for spin c manifolds. 11 refs

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

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

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

  19. Convex analysis and optimization in Hadamard spaces

    CERN Document Server

    Bacak, Miroslav

    2014-01-01

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

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

  1. Minimum convex partitions and maximum empty polytopes

    Directory of Open Access Journals (Sweden)

    Adrian Dumitrescu

    2014-05-01

    Full Text Available Let S be a set of n points in Rd. A Steiner convex partition is a tiling of conv(S with empty convex bodies. For every integer d, we show that S admits a Steiner convex partition with at most ⌈(n-1/d⌉ tiles. This bound is the best possible for points in general position in the plane, and it is the best possible apart from constant factors in every fixed dimension d≥3. We also give the first constant-factor approximation algorithm for computing a minimum Steiner convex partition of a planar point set in general position.Establishing a tight lower bound for the maximum volume of a tile in a Steiner convex partition of any n points in the unit cube is equivalent to a famous problem of Danzer and Rogers. It is conjectured that the volume of the largest tile is ω(1/n. Here we give a (1-\\epsilon-approximation algorithm for computing the maximum volume of an empty convex body amidst n given points in the d-dimensional unit box [0,1]d.

  2. Higgs bundles and four manifolds

    International Nuclear Information System (INIS)

    Park, Jae-Suk.

    2002-01-01

    It is known that the Seiberg-Witten invariants, derived from supersymmetric Yang-Mill theories in four dimensions, do not distinguish smooth structure of certain non-simply-connected four manifolds. We propose generalizations of Donaldson-Witten and Vafa-Witten theories on a Kaehler manifold based on Higgs bundles. We showed, in particular, that the partition function of our generalized Vafa-Witten theory can be written as the sum of contributions our generalized Donaldson-Witten invariants and generalized Seiberg-Witten invariants. The resulting generalized Seiberg-Witten invariants might have, conjecturally, information on smooth structure beyond the original Seiberg-Witten invariants for non-simply-connected case

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

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

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

  6. Hierarchy of graph matchbox manifolds

    OpenAIRE

    Lukina, Olga

    2011-01-01

    We study a class of graph foliated spaces, or graph matchbox manifolds, initially constructed by Kenyon and Ghys. For graph foliated spaces we introduce a quantifier of dynamical complexity which we call its level. We develop the fusion construction, which allows us to associate to every two graph foliated spaces a third one which contains the former two in its closure. Although the underlying idea of the fusion is simple, it gives us a powerful tool to study graph foliated spaces. Using fusi...

  7. Invariant Bayesian estimation on manifolds

    OpenAIRE

    Jermyn, Ian H.

    2005-01-01

    A frequent and well-founded criticism of the maximum a posteriori (MAP) and minimum mean squared error (MMSE) estimates of a continuous parameter \\gamma taking values in a differentiable manifold \\Gamma is that they are not invariant to arbitrary ``reparameterizations'' of \\Gamma. This paper clarifies the issues surrounding this problem, by pointing out the difference between coordinate invariance, which is a sine qua non for a mathematically well-defined problem, and diffeomorphism invarianc...

  8. Effective forcing with Cantor manifolds

    OpenAIRE

    Kihara, Takayuki

    2017-01-01

    A set $A$ of integers is called total if there is an algorithm which, given an enumeration of $A$, enumerates the complement of $A$, and called cototal if there is an algorithm which, given an enumeration of the complement of $A$, enumerates $A$. Many variants of totality and cototality have been studied in computability theory. In this note, by an effective forcing construction with strongly infinite dimensional Cantor manifolds, which can be viewed as an effectivization of Zapletal's "half-...

  9. On the convexity of N-Chebyshev sets

    International Nuclear Information System (INIS)

    Borodin, Petr A

    2011-01-01

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

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

  11. On superadditivity and convexity for cooperative games with random payoffs

    NARCIS (Netherlands)

    Timmer, Judith B.

    In this paper we study the relations between superadditivity and several types of convexity for cooperative games with random payoffs. The types of convexity considered are marginal convexity (all marginal vectors belong to the core), individual-merge convexity (any individual player is better off

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

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

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

  15. Differential geometry curves, surfaces, manifolds

    CERN Document Server

    Kühnel, Wolfgang

    2015-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. The second part studies the geometry of general manifolds, with particular emphasis on connections and curvature. The text is illustrated with many figures and examples. The prerequisites are undergraduate analysis and linear algebra. This new edition provides many advancements, including more figures and exercises, and-as a new feature-a good number of so

  16. Similarity Learning of Manifold Data.

    Science.gov (United States)

    Chen, Si-Bao; Ding, Chris H Q; Luo, Bin

    2015-09-01

    Without constructing adjacency graph for neighborhood, we propose a method to learn similarity among sample points of manifold in Laplacian embedding (LE) based on adding constraints of linear reconstruction and least absolute shrinkage and selection operator type minimization. Two algorithms and corresponding analyses are presented to learn similarity for mix-signed and nonnegative data respectively. The similarity learning method is further extended to kernel spaces. The experiments on both synthetic and real world benchmark data sets demonstrate that the proposed LE with new similarity has better visualization and achieves higher accuracy in classification.

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

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

  19. Convex Regression with Interpretable Sharp Partitions.

    Science.gov (United States)

    Petersen, Ashley; Simon, Noah; Witten, Daniela

    2016-06-01

    We consider the problem of predicting an outcome variable on the basis of a small number of covariates, using an interpretable yet non-additive model. We propose convex regression with interpretable sharp partitions (CRISP) for this task. CRISP partitions the covariate space into blocks in a data-adaptive way, and fits a mean model within each block. Unlike other partitioning methods, CRISP is fit using a non-greedy approach by solving a convex optimization problem, resulting in low-variance fits. We explore the properties of CRISP, and evaluate its performance in a simulation study and on a housing price data set.

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

  1. Cost Allocation and Convex Data Envelopment

    DEFF Research Database (Denmark)

    Hougaard, Jens Leth; Tind, Jørgen

    This paper considers allocation rules. First, we demonstrate that costs allocated by the Aumann-Shapley and the Friedman-Moulin cost allocation rules are easy to determine in practice using convex envelopment of registered cost data and parametric programming. Second, from the linear programming...... such as Data Envelopment Analysis (DEA). The convexity constraint of the BCC model introduces a non-zero slack in the objective function of the multiplier problem and we show that the cost allocation rules discussed in this paper can be used as candidates to allocate this slack value on to the input (or output...

  2. Recovering convexity in non-associated plasticity

    Science.gov (United States)

    Francfort, Gilles A.

    2018-03-01

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

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

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

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

  6. Robust Utility Maximization Under Convex Portfolio Constraints

    Energy Technology Data Exchange (ETDEWEB)

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

    2015-04-15

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

  7. Differential analysis of matrix convex functions

    DEFF Research Database (Denmark)

    Hansen, Frank; Tomiyama, Jun

    2007-01-01

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

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

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

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

  11. Uniformly convex functions on Banach spaces

    Czech Academy of Sciences Publication Activity Database

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

    2009-01-01

    Roč. 137, č. 3 (2009), s. 1081-1091 ISSN 0002-9939 R&D Projects: GA AV ČR IAA100190502; GA AV ČR IAA100190801 Institutional research plan: CEZ:AV0Z10190503 Keywords : power type 2 * uniform convexity Subject RIV: BA - General Mathematics Impact factor: 0.640, year: 2009

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

  13. Convex Formulations of Learning from Crowds

    Science.gov (United States)

    Kajino, Hiroshi; Kashima, Hisashi

    It has attracted considerable attention to use crowdsourcing services to collect a large amount of labeled data for machine learning, since crowdsourcing services allow one to ask the general public to label data at very low cost through the Internet. The use of crowdsourcing has introduced a new challenge in machine learning, that is, coping with low quality of crowd-generated data. There have been many recent attempts to address the quality problem of multiple labelers, however, there are two serious drawbacks in the existing approaches, that are, (i) non-convexity and (ii) task homogeneity. Most of the existing methods consider true labels as latent variables, which results in non-convex optimization problems. Also, the existing models assume only single homogeneous tasks, while in realistic situations, clients can offer multiple tasks to crowds and crowd workers can work on different tasks in parallel. In this paper, we propose a convex optimization formulation of learning from crowds by introducing personal models of individual crowds without estimating true labels. We further extend the proposed model to multi-task learning based on the resemblance between the proposed formulation and that for an existing multi-task learning model. We also devise efficient iterative methods for solving the convex optimization problems by exploiting conditional independence structures in multiple classifiers.

  14. Toric Geometry of the Regular Convex Polyhedra

    Directory of Open Access Journals (Sweden)

    Fiammetta Battaglia

    2017-01-01

    Full Text Available We describe symplectic and complex toric spaces associated with the five regular convex polyhedra. The regular tetrahedron and the cube are rational and simple, the regular octahedron is not simple, the regular dodecahedron is not rational, and the regular icosahedron is neither simple nor rational. We remark that the last two cases cannot be treated via standard toric geometry.

  15. Similarity measure computation of convex polyhedra revisited

    NARCIS (Netherlands)

    Roerdink, Jos B.T.M.; Bekker, Henk

    2001-01-01

    We study the computation of rotation-invariant similarity measures of convex polyhedra, based on Minkowski’s theory of mixed volumes. To compute the similarity measure, a (mixed) volume functional has to be minimized over a number of critical orientations of these polyhedra. These critical

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

  17. A generalization of the convex Kakeya problem

    KAUST Repository

    Ahn, Heekap

    2013-09-19

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

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

  19. Target manifold formation using a quadratic SDF

    Science.gov (United States)

    Hester, Charles F.; Risko, Kelly K. D.

    2013-05-01

    Synthetic Discriminant Function (SDF) formulation of correlation filters provides constraints for forming target subspaces for a target set. In this paper we extend the SDF formulation to include quadratic constraints and use this solution to form nonlinear manifolds in the target space. The theory for forming these manifolds will be developed and demonstrated with data.

  20. Numerical continuation of normally hyperbolic invariant manifolds

    Science.gov (United States)

    Broer, H. W.; Hagen, A.; Vegter, G.

    2007-06-01

    This paper deals with the numerical continuation of invariant manifolds regardless of the restricted dynamics. Common examples of such manifolds include limit sets, codimension 1 manifolds separating basins of attraction (separatrices), stable/unstable/centre manifolds, nested hierarchies of attracting manifolds in dissipative systems and manifolds appearing in bifurcations. The approach is based on the general principle of normal hyperbolicity, where the graph transform leads to the numerical algorithms. This gives a highly multiple purpose method. The graph transform and linear graph transform compute the perturbed manifold with its hyperbolic splitting. To globally discretize manifolds, a discrete tubular neighbourhood is used, induced by a transverse bundle composed of discrete stable and unstable bundles. This approach allows the development of the discrete graph transform/linear graph transform analogous to the usual smooth case. Convergence results are given. The discrete vector bundle construction and associated local k-plane interpolation may be of independent interest. A practical numerical implementation for solving the global equations underlying the graph transform is proposed. Relevant numerical techniques are discussed and computational tests included. An additional application is the computation of the 'slow-transient' surface of an enzyme reaction.

  1. Integrability conditions on Engel-type manifolds

    Science.gov (United States)

    Calin, Ovidiu; Chang, Der-Chen; Hu, Jishan

    2015-09-01

    We introduce the concept of Engel manifold, as a manifold that resembles locally the Engel group, and find the integrability conditions of the associated sub-elliptic system , . These are given by , . Then an explicit construction of the solution involving an integral representation is provided, which corresponds to a Poincaré-type lemma for the Engel's distribution.

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

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

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

  5. Some comparison theorems for Kahler manifolds

    OpenAIRE

    Tam, Luen-Fai; Yu, Chengjie

    2010-01-01

    In this work, we will verify some comparison results on Kahler manifolds. They are complex Hessian comparison for the distance function from a closed complex submanifold of a Kahler manifold with holomorphic bisectional curvature bounded below by a constant, eigenvalue comparison and volume comparison in terms of scalar curvature. This work is motivated by comparison results of Li and Wang .

  6. On the manifold-mapping optimization technique

    NARCIS (Netherlands)

    D. Echeverria (David); P.W. Hemker (Piet)

    2006-01-01

    textabstractIn this paper, we study in some detail the manifold-mapping optimization technique introduced in an earlier paper. Manifold mapping aims at accelerating optimal design procedures that otherwise require many evaluations of time-expensive cost functions. We give a proof of convergence for

  7. Harmonic manifolds with minimal horospheres are flat

    Indian Academy of Sciences (India)

    spaces and locally rank one symmetric spaces. ... any simply connected harmonic manifold is either flat or a rank one symmetric space. .... constant functions on manifolds. The derivatives ∇. (k) σp···σp ωp can be expressed in terms of the curvature tensor and its covariant derivatives. For example, we have for v ∈ SpM,.

  8. Classical BV theories on manifolds with boundary

    NARCIS (Netherlands)

    Cattaneo, A.S.; Mnev, P.; Reshetikhin, N.

    2014-01-01

    In this paper we extend the classical BV framework to gauge theories on spacetime manifolds with boundary. In particular, we connect the BV construction in the bulk with the BFV construction on the boundary and we develop its extension to strata of higher codimension in the case of manifolds with

  9. Local Convexity-Preserving C 2 Rational Cubic Spline for Convex Data

    Science.gov (United States)

    Abd Majid, Ahmad; Ali, Jamaludin Md.

    2014-01-01

    We present the smooth and visually pleasant display of 2D data when it is convex, which is contribution towards the improvements over existing methods. This improvement can be used to get the more accurate results. An attempt has been made in order to develop the local convexity-preserving interpolant for convex data using C 2 rational cubic spline. It involves three families of shape parameters in its representation. Data dependent sufficient constraints are imposed on single shape parameter to conserve the inherited shape feature of data. Remaining two of these shape parameters are used for the modification of convex curve to get a visually pleasing curve according to industrial demand. The scheme is tested through several numerical examples, showing that the scheme is local, computationally economical, and visually pleasing. PMID:24757421

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

    African Journals Online (AJOL)

    objective convex programming problem. The objective functions are convex and there is a single linear constraint with some upper and lower bounds. We also consider a two dimensional multivariate problem when the cost is minimized. A numerical ...

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

  12. Static traversable wormholes in Lyra manifold

    Science.gov (United States)

    Jahromi, A. Sayahian; Moradpour, H.

    At first, considering the Einstein framework, we introduce some new static traversable wormholes and study the effects of a dark energy-like source on them. Thereinafter, a brief review on Einstein field equations in Lyra manifold is presented, and we address some static traversable wormholes in the Lyra manifold which satisfy the energy conditions. It is also shown that solutions introduced in the Einstein framework may also meet the energy conditions in the Lyra manifold. Finally, we focus on vacuum Lyra manifold and find some traversable asymptotically flat wormholes. In summary, our study shows that it is theoretically possible to find a Lyra displacement vector field in a manner in which traversable wormholes satisfy the energy conditions in a Lyra manifold.

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

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

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

  16. Lyapunov convexity type theorems for non-atomic vector measures ...

    African Journals Online (AJOL)

    atomic, and σ-additive X-valued measure has a convex closure. We give a survey of Lyapunov convexity type theorems pertaining to this problem. We also give a necessary and sufficient condition that will insure the convexity of the closure of the ...

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

  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. Convex Modeling of Interactions with Strong Heredity.

    Science.gov (United States)

    Haris, Asad; Witten, Daniela; Simon, Noah

    2016-01-01

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

  20. Convexity, gauge-dependence and tunneling rates

    Energy Technology Data Exchange (ETDEWEB)

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

    2016-10-19

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

  1. Reconstruction of convex bodies from surface tensors

    DEFF Research Database (Denmark)

    Kousholt, Astrid; Kiderlen, Markus

    2016-01-01

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

  2. Solving ptychography with a convex relaxation

    Science.gov (United States)

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

    2015-05-01

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

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

  4. Regularity in mixed-integer convex representability

    OpenAIRE

    Lubin, Miles; Zadik, Ilias; Vielma, Juan Pablo

    2017-01-01

    Characterizations of the sets with mixed integer programming (MIP) formulations using only rational linear inequalities (rational MILP representable) and those with formulations that use arbitrary closed convex constraints (MICP representable) were given by Jeroslow and Lowe (1984), and Lubin, Zadik and Vielma (2017). The latter also showed that even MICP representable subsets of the natural numbers can be more irregular than rational MILP representable ones, unless certain rationality is imp...

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

  6. A Convex Framework for Fair Regression

    OpenAIRE

    Berk, Richard; Heidari, Hoda; Jabbari, Shahin; Joseph, Matthew; Kearns, Michael; Morgenstern, Jamie; Neel, Seth; Roth, Aaron

    2017-01-01

    We introduce a flexible family of fairness regularizers for (linear and logistic) regression problems. These regularizers all enjoy convexity, permitting fast optimization, and they span the rang from notions of group fairness to strong individual fairness. By varying the weight on the fairness regularizer, we can compute the efficient frontier of the accuracy-fairness trade-off on any given dataset, and we measure the severity of this trade-off via a numerical quantity we call the Price of F...

  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. Stress-Strain diagrams for non-convex particles

    Science.gov (United States)

    Matuttis, Hans-Georg; Nawa, Masaki; Krengel, Dominik

    2017-06-01

    While most granular materials in nature and technology consist of non-convex particles, the majority of discrete element (DEM) codes are still only able to cope with convex particles, due to the complexity of the computational geometry and the occurrence of multiple contacts. We have reengineered a code for convex polygonal particles to model non-convex particles as rigidly connected clusters. Constricting non-convex particles along the symmetry axes by 30% leads to an increase of the materials strength of up to 50%.

  9. Stress-Strain diagrams for non-convex particles

    Directory of Open Access Journals (Sweden)

    Matuttis Hans-Georg

    2017-01-01

    Full Text Available While most granular materials in nature and technology consist of non-convex particles, the majority of discrete element (DEM codes are still only able to cope with convex particles, due to the complexity of the computational geometry and the occurrence of multiple contacts. We have reengineered a code for convex polygonal particles to model non-convex particles as rigidly connected clusters. Constricting non-convex particles along the symmetry axes by 30% leads to an increase of the materials strength of up to 50%.

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

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

  12. On convex relaxation of graph isomorphism

    Science.gov (United States)

    Aflalo, Yonathan; Bronstein, Alexander; Kimmel, Ron

    2015-01-01

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

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

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

  15. Reduction of locally conformal symplectic manifolds with examples of non-Kähler manifolds

    OpenAIRE

    Noda, Tomonori

    2004-01-01

    Let $(M, \\Omega)$ be a locally conformal symplectic manifold. $\\Omega$ is a non-degenerate 2-form on $M$ such that there is a closed 1-form $\\omega$, called the Lee form, satisfing $ d\\Omega=\\omega\\wedge\\Omega$. In this paper we consider Marsden-Weinstein reduction theorem which induces Jacobi-Liouville theorem as a special case. For locally conformal Kähler manifolds, this reduction theorem gives a construction of non-Kähler manifolds in general dimension.

  16. Final design of ITER thermal shield manifold

    Energy Technology Data Exchange (ETDEWEB)

    Kim, Kyung-Kyu [Mecha T& S, Jinju-si 52811 (Korea, Republic of); Noh, Chang Hyun, E-mail: chnoh@nfri.re.kr [National Fusion Research Institute, Daejeon 34133 (Korea, Republic of); Kim, Yun-Kyu; Park, Sungwoo [Mecha T& S, Jinju-si 52811 (Korea, Republic of); Nam, Kwanwoo [National Fusion Research Institute, Daejeon 34133 (Korea, Republic of); Chung, Wooho [Mecha T& S, Jinju-si 52811 (Korea, Republic of); Kang, Dongkwon; Kang, Kyung-O. [National Fusion Research Institute, Daejeon 34133 (Korea, Republic of); Park, Sungmun [SFA Engineering Corporation, Hwaseong-si 10060 (Korea, Republic of); Bae, Jing Do [Korea Marine Equipment Research Institute, Busan 49111 (Korea, Republic of)

    2016-11-01

    Highlights: • Engineering design of thermal shield manifold is finalized. • Pipe routing, support design and flow balance are verified by analysis. • Mock-ups are fabricated to verify the design. - Abstract: The ITER thermal shield is actively cooled by 80 K pressurized helium gas. The helium coolant flows from the cold valve box to the cooling tubes on the TS panels via manifold piping. This paper describes the final design of thermal shield manifold. Pipe design to accommodate the thermal contraction considering interface with adjacent components and detailed design of support structure are presented. R&D for the pipe branch connection is carried out to find a feasible manufacturing method. Global structural behavior and structural integrity of the manifold including pipe supports are investigated by a finite element analysis based on ASME B31.3 code. Flow analyses are performed to check the flow distribution.

  17. Branched standard spines of 3-manifolds

    CERN Document Server

    Benedetti, Riccardo

    1997-01-01

    This book provides a unified combinatorial realization of the categroies of (closed, oriented) 3-manifolds, combed 3-manifolds, framed 3-manifolds and spin 3-manifolds. In all four cases the objects of the realization are finite enhanced graphs, and only finitely many local moves have to be taken into account. These realizations are based on the notion of branched standard spine, introduced in the book as a combination of the notion of branched surface with that of standard spine. The book is intended for readers interested in low-dimensional topology, and some familiarity with the basics is assumed. A list of questions, some of which concerning relations with the theory of quantum invariants, is enclosed.

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

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

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

  1. The "Parity" Anomaly On An Unorientable Manifold

    OpenAIRE

    Witten, Edward

    2016-01-01

    The "parity" anomaly -- more accurately described as an anomaly in time-reversal or reflection symmetry -- arises in certain theories of fermions coupled to gauge fields and/or gravity in a spacetime of odd dimension. This anomaly has traditionally been studied on orientable manifolds only, but recent developments involving topological superconductors have made it clear that one can get more information by asking what happens on an unorientable manifold. In this paper, we give a full descript...

  2. megaman: Manifold Learning for Millions of Points

    Science.gov (United States)

    McQueen, James; Meila, Marina; VanderPlas, Jacob; Zhang, Zhongyue

    2017-11-01

    megaman is a scalable manifold learning package implemented in python. It has a front-end API designed to be familiar to scikit-learn but harnesses the C++ Fast Library for Approximate Nearest Neighbors (FLANN) and the Sparse Symmetric Positive Definite (SSPD) solver Locally Optimal Block Precodition Gradient (LOBPCG) method to scale manifold learning algorithms to large data sets. It is designed for researchers and as such caches intermediary steps and indices to allow for fast re-computation with new parameters.

  3. Minimal contact triangulations of 3-manifolds

    OpenAIRE

    Datta, Basudeb; Kulkarni, Dheeraj

    2016-01-01

    In this paper, we explore minimal contact triangulations on contact 3-manifolds. We give many explicit examples of contact triangulations that are close to minimal ones. The main results of this article say that on any closed oriented 3-manifold the number of vertices for minimal contact triangulations for overtwisted contact structures grows at most linearly with respect to the relative $d^3$ invariant. We conjecture that this bound is optimal. We also discuss, in great details, contact tria...

  4. Layered-triangulations of 3-manifolds

    OpenAIRE

    Jaco, William; Rubinstein, J. Hyam

    2006-01-01

    A family of one-vertex triangulations of 3-manifolds, layered-triangulations, is defined. Layered-triangulations are first described for handlebodies and then extended to all 3-manifolds via Heegaard splittings. A complete and detailed analysis of layered-triangulations is given in the cases of the solid torus and lens spaces, including the classification of all normal and almost normal surfaces in these triangulations. Minimal layered-triangulations of lens spaces provide a common setting fo...

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

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

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

  8. On the embedding of convex spaces in stratified L-convex spaces.

    Science.gov (United States)

    Jin, Qiu; Li, Lingqiang

    2016-01-01

    Consider L being a continuous lattice, two functors from the category of convex spaces (denoted by CS) to the category of stratified L-convex spaces (denoted by SL-CS) are defined. The first functor enables us to prove that the category CS can be embedded in the category SL-CS as a reflective subcategory. The second functor enables us to prove that the category CS can be embedded in the category SL-CS as a coreflective subcategory when L satisfying a multiplicative condition. By comparing the two functors and the well known Lowen functor (between topological spaces and stratified L-topological spaces), we exhibit the difference between (stratified L-)topological spaces and (stratified L-)convex spaces.

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

  10. The Dirichlet problem for the Monge-Ampere equation in convex (but not strictly convex domains

    Directory of Open Access Journals (Sweden)

    David Hartenstine

    2006-10-01

    Full Text Available It is well-known that the Dirichlet problem for the Monge-Amp`ere equation $det D^2 u = mu$ in a bounded strictly convex domain $Omega$ in $mathbb{R}^n$ has a weak solution (in the sense of Aleksandrov for any finite Borel measure $mu$ on $Omega$ and for any continuous boundary data. We consider the Dirichlet problem when $Omega$ is only assumed to be convex, and give a necessary and sufficient condition on the boundary data for solvability.

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

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

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

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

  15. Leadership games with convex strategy sets

    OpenAIRE

    Bernhard von Stengel; Shmuel Zamir

    2010-01-01

    A basic model of commitment is to convert a two-player game in strategic form to a “leadership game” with the same payoffs, where one player, the leader, commits to a strategy, to which the second player always chooses a best reply. This paper studies such leadership games for games with convex strategy sets. We apply them to mixed extensions of finite games, which we analyze completely, including nongeneric games. The main result is that leadership is advantageous in the sense that, as a set...

  16. Localized Multiple Kernel Learning A Convex Approach

    Science.gov (United States)

    2016-11-22

    1/2 . Theorem 9 (CLMKL Generalization Error Bounds) Assume that km(x, x) ≤ B, ∀m ∈ NM , x ∈ X . Suppose the loss function ℓ is L- Lipschitz and...mathematical foundation (e.g., Schölkopf and Smola, 2002). The performance of such algorithms, however, crucially depends on the involved kernel function ...approaches to localized MKL (reviewed in Section 1.1) optimize non-convex objective functions . This puts their generalization ability into doubt. Indeed

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

  18. On the modulus of U-convexity

    Directory of Open Access Journals (Sweden)

    Satit Saejung

    2005-01-01

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

  19. Population monotonic solutions on convex games

    OpenAIRE

    Toru Hokari

    2000-01-01

    The Dutta-Ray solution and the Shapley value are two well-known examples of population-monotonic solutions on the domain of convex games. We provide a new formula for the Dutta-Ray solution from which population-monotonicity immediately follows. Then we define a new family of population-monotonic solutions, which we refer to as "sequential Dutta-Ray solutions." We also show that it is possible to construct several symmetric and population-monotonic solutions by using the solutions in this fam...

  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. Functions with bounded variation in locally convex space

    OpenAIRE

    Duchoň, Miloslav; Debiève, Camille

    2011-01-01

    The present paper is concerned with some properties of functions with values in locally convex vector space, namely functions having bounded variation and generalizations of some theorems for functions with values in locally convex vector spaces replacing Banach spaces, namely Theorem: If X is a sequentially complete locally convex vector space, then the function x(·): [a, b] → X having a bounded variation on the interval [a, b] defines a vector-valued measure m on borelian subsets of [a, b] ...

  2. A Randomized Gossip Consenus Algorithm on Convex Metric Spaces

    Science.gov (United States)

    2012-01-01

    Property (C) are not that rare. Indeed, by Smulian’s Theorem ([3], page 443), every weakly compact convex subset of a Banach space has Property (C...www.isr.umd.edu A randomized gossip consensus algorithm on convex metric spaces Ion Matei, Christoforos Somarakis, John S. Baras ISR TECHNICAL REPORT 2012-02...2. REPORT TYPE 3. DATES COVERED 00-00-2012 to 00-00-2012 4. TITLE AND SUBTITLE A randomized gossip consensus algorithm on convex metric spaces

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

  4. Optimality Certificates for Convex Minimization and Helly Numbers

    Science.gov (United States)

    2016-10-20

    Optimality certificates for convex minimization and Helly numbers Amitabh Basu Michele Conforti Gérard Cornuéjols Robert Weismantel Stefan Weltge...October 20, 2016 Abstract We consider the problem of minimizing a convex function over a subset of Rn that is not necessarily convex ( minimization of a...problem. Moreover, the inner optimization problem (2) of minimizing on the boundary of C can be very hard if C has no structure other than being S-free

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

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

  7. Giant convexity chondroma with meningeal attachment.

    Science.gov (United States)

    Feierabend, Denise; Maksoud, Salah; Lawson McLean, Aaron; Koch, Arend; Kalff, Rolf; Walter, Jan

    2018-03-27

    Intracranial chondroma is a rare and benign tumor with usual onset in young adulthood. The skull base is the most common site of occurrence although, less often, the tumors can appear at the falx cerebri or at the dural convexity. The differentiation of these lesions from meningiomas through imaging is generally difficult. Clinical case presentation and review of the current literature. We report a case of a 25-year-old male patient with a giant convexity chondroma with meningeal attachment in the right frontal lobe that was detected after a first generalized seizure. Based on the putative diagnosis of meningioma, the tumor was completely resected via an osteoplastic parasagittal craniotomy. The postoperative MRI confirmed the complete tumor resection. Histopathological analysis revealed the presence of a chondroma. Intracranial chondromas are a rarity and their preoperative diagnosis based on neuroimaging is difficult. In young patients and those with skeletal disease, the differential diagnosis of a chondroma should be considered. In symptomatic patients, operative resection is sensible. In most cases total removal of the tumor is possible and leads to full recovery. When the finding is merely incidental in older patients, a watchful waiting approach is acceptable, given the benign and slow-growing nature of the lesion. Copyright © 2018 Elsevier B.V. All rights reserved.

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

  9. Harmonic maps of finite energy for Finsler manifolds

    Science.gov (United States)

    Li, Jintang; Wang, Yiling

    2018-03-01

    In this paper, we study some properties of harmonic maps for Finsler manifolds. Some Liouville theorems on harmonic maps for Finsler manifolds are given. Let M be a complete simply connected Riemannian manifold with non-negative Ricci curvature and M bar be a complete Berwald manifold with non-positive flag curvature. The main purpose of this paper is to prove that there exists no non-degenerate harmonic map ϕ from M to M bar with ∫SM e(ϕ) dVSM < ∞, which generalizes the result of Schoen and Yau (1976) from Riemannian manifolds to Berwald manifolds.

  10. 7D supersymmetric Yang-Mills on curved manifolds

    Science.gov (United States)

    Polydorou, Konstantina; Rocén, Andreas; Zabzine, Maxim

    2017-12-01

    We study 7D maximally supersymmetric Yang-Mills theory on curved manifolds that admit Killing spinors. If the manifold admits at least two Killing spinors (Sasaki-Einstein manifolds) we are able to rewrite the supersymmetric theory in terms of a cohomological complex. In principle this cohomological complex makes sense for any K-contact manifold. For the case of toric Sasaki-Einstein manifolds we derive explicitly the perturbative part of the partition function and speculate about the non-perturbative part. We also briefly discuss the case of 3-Sasaki manifolds and suggest a plausible form for the full non-perturbative answer.

  11. Approaching Moons from Resonance via Invariant Manifolds

    Science.gov (United States)

    Anderson, Rodney L.

    2012-01-01

    In this work, the approach phase from the final resonance of the endgame scenario in a tour design is examined within the context of invariant manifolds. Previous analyses have typically solved this problem either by using numerical techniques or by computing a catalog of suitable trajectories. The invariant manifolds of a selected set of libration orbits and unstable resonant orbits are computed here to serve as guides for desirable approach trajectories. The analysis focuses on designing an approach phase that may be tied into the final resonance in the endgame sequence while also targeting desired conditions at the moon.

  12. Unraveling flow patterns through nonlinear manifold learning.

    Science.gov (United States)

    Tauro, Flavia; Grimaldi, Salvatore; Porfiri, Maurizio

    2014-01-01

    From climatology to biofluidics, the characterization of complex flows relies on computationally expensive kinematic and kinetic measurements. In addition, such big data are difficult to handle in real time, thereby hampering advancements in the area of flow control and distributed sensing. Here, we propose a novel framework for unsupervised characterization of flow patterns through nonlinear manifold learning. Specifically, we apply the isometric feature mapping (Isomap) to experimental video data of the wake past a circular cylinder from steady to turbulent flows. Without direct velocity measurements, we show that manifold topology is intrinsically related to flow regime and that Isomap global coordinates can unravel salient flow features.

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

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

  15. Convex Optimization over Classes of Multiparticle Entanglement

    Science.gov (United States)

    Shang, Jiangwei; Gühne, Otfried

    2018-02-01

    A well-known strategy to characterize multiparticle entanglement utilizes the notion of stochastic local operations and classical communication (SLOCC), but characterizing the resulting entanglement classes is difficult. Given a multiparticle quantum state, we first show that Gilbert's algorithm can be adapted to prove separability or membership in a certain entanglement class. We then present two algorithms for convex optimization over SLOCC classes. The first algorithm uses a simple gradient approach, while the other one employs the accelerated projected-gradient method. For demonstration, the algorithms are applied to the likelihood-ratio test using experimental data on bound entanglement of a noisy four-photon Smolin state [Phys. Rev. Lett. 105, 130501 (2010), 10.1103/PhysRevLett.105.130501].

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

  18. New type integral inequalities for convex functions with applications II

    OpenAIRE

    Mehrez, Khaled; Agarwal, Praveen

    2017-01-01

    We have recently established some integral inequalities for convex functions via the Hermite-Hadamard's inequalities. In continuation here, we also establish some interesting new integral inequalities for convex functions via the Hermite--Hadamard's inequalities and Jensen's integral inequality. Useful applications involving special means are also included.

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

  20. On some interpolation properties in locally convex spaces

    Energy Technology Data Exchange (ETDEWEB)

    Pater, Flavius [Department of Mathematics, Politehnica University of Timişoara, 300004 Timişoara (Romania)

    2015-03-10

    The aim of this paper is to introduce the notion of interpolation between locally convex spaces, the real method, and to present some elementary results in this setting. This represents a generalization from the Banach spaces framework to the locally convex spaces sequentially complete one, where the operators acting on them are locally bounded.

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

    CERN Document Server

    Panik, Michael J

    1993-01-01

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

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

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

  4. Cohomology theories on locally conformal symplectic manifolds

    Czech Academy of Sciences Publication Activity Database

    Le, Hong-Van; Vanžura, Jiří

    2015-01-01

    Roč. 19, č. 1 (2015), s. 45-82 ISSN 1093-6106 Institutional support: RVO:67985840 Keywords : locally conformal symplectic manifold * Lichnerowicz-Novikov cohomology * primitive cohomology Subject RIV: BA - General Mathematics Impact factor: 0.722, year: 2015 http://www.intlpress.com/site/pub/pages/journals/items/ajm/content/vols/0019/0001/a003/

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

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

  8. On Kähler–Norden manifolds

    Indian Academy of Sciences (India)

    M ISCAN and A A SALIMOV. Faculty of Arts and Science, Department of Mathematics, Ataturk University, ... This paper is concerned with the problem of the geometry of Norden manifolds. Some properties of ..... function f , then we shall call f a holomorphic (analytic) function and g its associated function [17]. If such a function ...

  9. Classification of framed links in 3-manifolds

    Indian Academy of Sciences (India)

    Classification of framed links in 3-manifolds. MATIJA CENCELJ, DUŠAN REPOVŠ and. MIKHAIL B SKOPENKOV. ∗. Institute for Mathematics, Physics and Mechanics and Faculty of Education, University of Ljubljana, P.O. Box 2964, 1001 Ljubljana, Slovenia. ∗Department of Differential Geometry, Faculty of Mechanics and ...

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

  11. Nonsmoothable involutions on spin 4-manifolds

    Indian Academy of Sciences (India)

    (Math. Sci.) Vol. 121, No. 1, February 2011, pp. 37–44. c Indian Academy of Sciences. Nonsmoothable involutions on spin 4-manifolds. CHANGTAO XUE and ... A group action is said to be pseudofree if each nontrivial group element has a discrete ... For our application, we also need their equivariant handle construction.

  12. Higher order Hessian structures on manifolds

    Indian Academy of Sciences (India)

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

    the bundle of bases for the tangent spaces. When we take a connection ∇XY to be given by Koszul's definition, we see that Hessian structures and symmetric connections can be directly related to each other. Before proceeding further, we state certain results relating to higher order derivatives on manifolds. For m ∈ M, let F.

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

  14. Some functional inequalities on non-reversible Finsler manifolds

    Indian Academy of Sciences (India)

    SHIN-ICHI OHTA

    2017-11-13

    0043, Japan ... The aim of this article is to put forward geometric analysis on possibly non-reversible. Finsler manifolds (in the sense of F(−v) ..... weighted Riemannian manifolds and has many geometric and analytic applications.

  15. Analytic convexity: some comments on an example of de Giorgi and Piccinini

    International Nuclear Information System (INIS)

    Andreotti, A.; Nacinovich, M.

    1976-01-01

    l. Introduction. 2. Csup(infinite) and analytical convexity for a complex of differential equations with constant coefficients. 3. Reduction of the analytic convexity to the Csup(infinite) convexity. 4. The example of de Giorgi-Piccinini. (author)

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

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

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

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

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

  1. Examples and counter-examples of log-symplectic manifolds

    NARCIS (Netherlands)

    Cavalcanti, Gil R.

    We study topological properties of log-symplectic structures and produce examples of compact manifolds with such structures. Notably, we show that several symplectic manifolds do not admit bona fide log-symplectic structures and several bona fide log-symplectic manifolds do not admit symplectic

  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. Three-dimensional group manifold reductions of gravity

    Science.gov (United States)

    Linares, Román

    2005-04-01

    We review the three-dimensional group manifold reductions of pure Einstein gravity and we exhibit a new consistent group manifold reduction of gravity when the compactification group manifold is S3. The new reduction leads to a lower dimensional theory whose gauge group is SU(2).

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

  5. Classification of third-order symmetric Lorentzian manifolds

    OpenAIRE

    Galaev, Anton S.

    2014-01-01

    Third-order symmetric Lorentzian manifolds, i.e. Lorentzian manifold with zero third derivative of the curvature tensor, are classified. These manifolds are exhausted by a special type of pp-waves, they generalize Cahen-Wallach spaces and second-order symmetric Lorentzian spaces.

  6. Learning Convex Regularizers for Optimal Bayesian Denoising

    Science.gov (United States)

    Nguyen, Ha Q.; Bostan, Emrah; Unser, Michael

    2018-02-01

    We propose a data-driven algorithm for the maximum a posteriori (MAP) estimation of stochastic processes from noisy observations. The primary statistical properties of the sought signal is specified by the penalty function (i.e., negative logarithm of the prior probability density function). Our alternating direction method of multipliers (ADMM)-based approach translates the estimation task into successive applications of the proximal mapping of the penalty function. Capitalizing on this direct link, we define the proximal operator as a parametric spline curve and optimize the spline coefficients by minimizing the average reconstruction error for a given training set. The key aspects of our learning method are that the associated penalty function is constrained to be convex and the convergence of the ADMM iterations is proven. As a result of these theoretical guarantees, adaptation of the proposed framework to different levels of measurement noise is extremely simple and does not require any retraining. We apply our method to estimation of both sparse and non-sparse models of L\\'{e}vy processes for which the minimum mean square error (MMSE) estimators are available. We carry out a single training session and perform comparisons at various signal-to-noise ratio (SNR) values. Simulations illustrate that the performance of our algorithm is practically identical to the one of the MMSE estimator irrespective of the noise power.

  7. Almost convex metrics and Peano compactifications

    Directory of Open Access Journals (Sweden)

    R. F. Dickman

    1982-01-01

    Full Text Available Let (X,d denote a locally connected, connected separable metric space. We say the X is S-metrizable provided there is a topologically equivalent metric ρ on X such that (X,ρ has Property S, i.e., for any ϵ>0, X is the union of finitely many connected sets of ρ-diameter less than ϵ. It is well-known that S-metrizable spaces are locally connected and that if ρ is a Property S metric for X, then the usual metric completion (X˜,ρ˜ of (X,ρ is a compact, locally connected, connected metric space; i.e., (X˜,ρ˜ is a Peano compactification of (X,ρ. In an earlier paper, the author conjectured that if a space (X,d has a Peano compactification, then it must be S-metrizable. In this paper, that conjecture is shown to be false; however, the connected spaces which have Peano compactificatons are shown to be exactly those having a totally bounded, almost convex metric. Several related results are given.

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

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

    Directory of Open Access Journals (Sweden)

    Malik Zawwar Hussain

    2011-11-01

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

  10. Lattes-type mappings on compact manifolds

    Science.gov (United States)

    Astola, Laura; Kangaslampi, Riikka; Peltonen, Kirsi

    A uniformly quasiregular mapping acting on a compact Riemannian manifold distorts the metric by a bounded amount, independently of the number of iterates. Such maps are rational with respect to some measurable conformal structure and there is a Fatou-Julia type theory associated with the dynamical system obtained by iterating these mappings. We study a rich subclass of uniformly quasiregular mappings that can be produced using an analogy of classical Lattes' construction of chaotic rational functions acting on the extended plane bar{C} . We show that there is a plenitude of compact manifolds that support these mappings. Moreover, we find that in some cases there are alternative ways to construct this type of mapping with different Julia sets.

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

  12. Heterogeneous massive feature fusion on grassmannian manifold

    Science.gov (United States)

    Huang, Haichao; Liu, Hongning; Kong, Xiaoyun; Lou, Xingdan; Wang, Zepeng

    2017-08-01

    Two issues remain unsolved on utilizing multimodal features for pattern recognition: the missing features and the curse of dimensionality. In this paper, we address the two issues by fusing the multimodal features on the Grassmann manifold. By defining grouping constrains on multimodal features, each multimodal feature vector is grouped into a set of subspaces, and is further represented as a point on the Grassmann manifold. To deal with missing features, L2-Hausdorff distance, a metric to compare multimodal feature vectors with different number of subspaces, is computed, and a kernel matrix can be obtained accordingly. Based on the kernel matrix, two feature selection criterions, one supervised and one unsupervised, are proposed to obtain a few representative features in the kernel space. Thus, the curse of dimensionality is alleviated. Experimental results on three multimodal dataset show the proposed feature fusion can outperforms the state-of -the-art by higher accuracy.

  13. Incremental nonlinear dimensionality reduction by manifold learning.

    Science.gov (United States)

    Law, Martin H C; Jain, Anil K

    2006-03-01

    Understanding the structure of multidimensional patterns, especially in unsupervised cases, is of fundamental importance in data mining, pattern recognition, and machine learning. Several algorithms have been proposed to analyze the structure of high-dimensional data based on the notion of manifold learning. These algorithms have been used to extract the intrinsic characteristics of different types of high-dimensional data by performing nonlinear dimensionality reduction. Most of these algorithms operate in a "batch" mode and cannot be efficiently applied when data are collected sequentially. In this paper, we describe an incremental version of ISOMAP, one of the key manifold learning algorithms. Our experiments on synthetic data as well as real world images demonstrate that our modified algorithm can maintain an accurate low-dimensional representation of the data in an efficient manner.

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

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

  16. New spinor fields on Lorentzian 7-manifolds

    Energy Technology Data Exchange (ETDEWEB)

    Bonora, L. [International School for Advanced Studies (SISSA),Via Bonomea 265, 34136 Trieste (Italy); Rocha, Roldão da [Centro de Matemática, Computação e Cognição, Universidade Federal do ABC,Avenida dos Estados, 5001, Santo André (Brazil)

    2016-01-21

    This paper deals with the classification of spinor fields according to the bilinear covariants in 7 dimensions. The previously investigated Riemannian case is characterized by either one spinor field class, in the real case of Majorana spinors, or three non-trivial classes in the most general complex case. In this paper we show that by imposing appropriate conditions on spinor fields in 7d manifolds with Lorentzian metric, the formerly obtained obstructions for new classes of spinor fields can be circumvented. New spinor fields classes are then explicitly constructed. In particular, on 7-manifolds with asymptotically flat black hole background, these spinors can define a generalized current density which further defines a time Killing vector at the spatial infinity.

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

  18. On complete manifolds supporting a weighted Sobolev type inequality

    Energy Technology Data Exchange (ETDEWEB)

    Adriano, Levi, E-mail: levi@mat.ufg.br [Instituto de Matematica e Estatistica, Universidade Federal de Goias, 74001-900 Goiania, GO (Brazil); Xia Changyu, E-mail: xia@mat.unb.br [Departamento de Matematica, Universidade de Brasilia, 70910-900 Brasilia, DF (Brazil)

    2011-11-15

    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.

  19. Nonsmoothable involutions on spin 4-manifolds

    Indian Academy of Sciences (India)

    [2] Bryan J, Seiberg-Witten theory and Z/2p actions on spin 4-manifolds, Math. Res. Lett. 5. (1998) 165–183. [3] Chen W and Kwasik S, Symmetries and exotic smooth structures on a K3 surface,. J. Topology 1(4) (2008) 923–962. [4] Edmonds A L and Ewing J H, Realizing forms and fixed point data in dimension four,.

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

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

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

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

  4. Towards a Convex-Analytic View of Impossibility Results in ...

    Indian Academy of Sciences (India)

    Ankur A. Kulkarni

    2016-11-05

    Towards a Convex-Analytic View of Impossibility Results in. Stochastic Control and Information Theory. Ankur A. Kulkarni. Systems and Control Engineering. Indian Institute of Technology Bombay. November 5, 2016. 1 / 12 ...

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

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

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

  8. Subaperture Stitching Interferometry for Large Convex Aspheric Surfaces Project

    Data.gov (United States)

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

  9. Subaperture Stitching Interferometry for Large Convex Aspheric Surfaces, Phase II

    Data.gov (United States)

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

  10. A simple convex optimization problem with many applications

    DEFF Research Database (Denmark)

    Vidal, Rene Victor Valqui

    1994-01-01

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

  11. Celestial Walk: A Terminating Oblivious Walk for Convex Subdivisions

    OpenAIRE

    Kuijper, Wouter; Ermolaev, Victor; Devillers, Olivier

    2017-01-01

    We present a new oblivious walking strategy for convex subdivisions. Our walk is faster than the straight walk and more generally applicable than the visibility walk. To prove termination of our walk we use a novel monotonically decreasing distance measure.

  12. Stochastic convex sparse principal component analysis.

    Science.gov (United States)

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

    2016-12-01

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

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

    African Journals Online (AJOL)

    user

    C. XC to. Subject a p j. X a. V. Minimize i i. L i ii. L i i ij j. (5). The objective functions in (equation 5) are convex [see Kokan and Khan (1967)], the single constraint is linear and the bounds are also linear. The problem (5) is, therefore a multi-objective convex programming problem. If some tolerance limits, say j v are given on ...

  14. Non-convex mixed-integer nonlinear programming: a survey

    OpenAIRE

    Burer, S; Letchford, Adam

    2012-01-01

    A wide range of problems arising in practical applications can be formulated as Mixed-Integer Nonlinear Programs (MINLPs). For the case in which the objective and constraint functions are convex, some quite effective exact and heuristic algorithms are available. When nonconvexities are present, however, things become much more difficult, since then even the continuous relaxation is a global optimisation problem. We survey the literature on non-convex MINLP, discussing applications, algorithms...

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

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

    Directory of Open Access Journals (Sweden)

    Horváth László

    2011-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Rafa Espínola

    2010-01-01

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

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

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

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

  1. Homotopy classification of contact foliations on open contact manifolds

    Indian Academy of Sciences (India)

    64

    structures on a closed manifold M, then there exists an isotopy ψt, t ∈ I, of M such that ψt : (M,ξ0) → (M,ξt) is isocontact for all t ∈ I. Remark 2.6. Gray's stability theorem is not valid on non-closed manifolds. We shall see an extension of Theorem 2.5 for such manifolds in Theorem 1.1 which is one of the main results.

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

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

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

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

  6. Geometry of manifolds with non-negative sectional curvature

    CERN Document Server

    Dearricott, Owen; Kennard, Lee; Searle, Catherine; Weingart, Gregor; Ziller, Wolfgang

    2014-01-01

    Providing an up-to-date overview of the geometry of manifolds with non-negative sectional curvature, this volume gives a detailed account of the most recent research in the area. The lectures cover a wide range of topics such as general isometric group actions, circle actions on positively curved four manifolds, cohomogeneity one actions on Alexandrov spaces, isometric torus actions on Riemannian manifolds of maximal symmetry rank, n-Sasakian manifolds, isoparametric hypersurfaces in spheres, contact CR and CR submanifolds, Riemannian submersions and the Hopf conjecture with symmetry. Also included is an introduction to the theory of exterior differential systems.

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

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

  9. The "parity" anomaly on an unorientable manifold

    Science.gov (United States)

    Witten, Edward

    2016-11-01

    The "parity" anomaly—more accurately described as an anomaly in time-reversal or reflection symmetry—arises in certain theories of fermions coupled to gauge fields and/or gravity in a spacetime of odd dimension. This anomaly has traditionally been studied on orientable manifolds only, but recent developments involving topological superconductors have made it clear that one can get more information by asking what happens on an unorientable manifold. In this paper, we give a full description of the "parity" anomaly for fermions coupled to gauge fields and gravity in 2 +1 dimensions on a possibly unorientable spacetime. We consider an application to topological superconductors and another application to M theory. The application to topological superconductors involves using knowledge of the "parity" anomaly as an ingredient in constructing gapped boundary states of these systems and in particular in gapping the boundary of a ν =16 system in a topologically trivial fashion. The application to M theory involves showing the consistency of the path integral of an M theory membrane on a possibly unorientable worldvolume. In the past, this has been done only in the orientable case.

  10. Fuel rod assembly to manifold attachment

    Science.gov (United States)

    Donck, Harry A.; Veca, Anthony R.; Snyder, Jr., Harold J.

    1980-01-01

    A fuel element is formed with a plurality of fuel rod assemblies detachably connected to an overhead support with each of the fuel rod assemblies having a gas tight seal with the support to allow internal fission gaseous products to flow without leakage from the fuel rod assemblies into a vent manifold passageway system on the support. The upper ends of the fuel rod assemblies are located at vertically extending openings in the support and upper threaded members are threaded to the fuel rod assemblies to connect the latter to the support. The preferred threaded members are cap nuts having a dome wall encircling an upper threaded end on the fuel rod assembly and having an upper sealing surface for sealing contact with the support. Another and lower seal is achieved by abutting a sealing surface on each fuel rod assembly with the support. A deformable portion on the cap nut locks the latter against inadvertent turning off the fuel rod assembly. Orienting means on the fuel rod and support primarily locates the fuel rods azimuthally for reception of a deforming tool for the cap nut. A cross port in the fuel rod end plug discharges into a sealed annulus within the support, which serves as a circumferential chamber, connecting the manifold gas passageways in the support.

  11. Smooth manifold structure for extreme channels

    Science.gov (United States)

    Iten, Raban; Colbeck, Roger

    2018-01-01

    A quantum channel from a system A of dimension dA to a system B of dimension dB is a completely positive trace-preserving map from complex dA × dA to dB × dB matrices, and the set of all such maps with Kraus rank r has the structure of a smooth manifold. We describe this set in two ways. First, as a quotient space of (a subset of) the rdB × dA dimensional Stiefel manifold. Second, as the set of all Choi-states of a fixed rank r. These two descriptions are topologically equivalent. This allows us to show that the set of all Choi-states corresponding to extreme channels from system A to system B of a fixed Kraus rank r is a smooth submanifold of dimension 2 r dAdB-dA2-r2 of the set of all Choi-states of rank r. As an application, we derive a lower bound on the number of parameters required for a quantum circuit topology to be able to approximate all extreme channels from A to B arbitrarily well.

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

  13. Projections and residues on manifolds with boundary

    DEFF Research Database (Denmark)

    Gaarde, Anders Borg

    2008-01-01

    It is a well-known result that the noncommutative residue of a pseudodifferential projection is zero on a compact manifold without boundary. Equivalently, the value of the zeta-function of P at zero, ¿¿(P, 0), is independent of ¿ for any elliptic operator P. Here ¿ denotes the angle of a ray where...... the resolvent of P has minimal growth. In this thesis, we consider the analogous questions on a compact manifold with boundary. We show that the noncommutative residue is zero for any projection in Boutet de Monvel’s calculus of pseudodifferential boundary problems. For an elliptic boundary problem {P+ + G, T...... }, with the corresponding realization B = (P + G)T, we de¿ne the sectorial projection ¿¿,¿(B) and the residue of this projection. We discuss whether this residue is always zero, through various analyses of the structure of the pro jection. The question is interesting since ¿¿(B, 0) is independent of ¿ exactly when...

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

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

  16. Trace-Inequalities and Matrix-Convex Functions

    Directory of Open Access Journals (Sweden)

    Tsuyoshi Ando

    2010-01-01

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

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

  18. Stability results for convex bodies in geometric tomography

    DEFF Research Database (Denmark)

    Kiderlen, Markus

    2008-01-01

    improve the Holder exponents of known stability results for these transforms.   The key idea for this improvement is to use the fact that support functions of convex bodies are elements of  any spherical Sobolev space of derivative order less than 3/2. As the analytical representation Q(K,.) may......We consider the question in how far a convex body (non-empty compact convex set)  K in n-dimensional space is determined by tomographic measurements (in a broad sense). Usually these measurements are derived from K by geometrical operations like sections, projections and certain averages of those....... We restrict to tomographic measurements F(K,.) that can be written as function on the unit sphere and depend additively on an analytical representation Q(K,.) of K.  The first main result states that F(K,.) is a multiplier-rotation operator of Q(K,.) whenever the tomographic data depends...

  19. Optimally Convex Controller and Model Reduction for a Dynamic System

    Directory of Open Access Journals (Sweden)

    P. S. KHUNTIA

    2008-07-01

    Full Text Available This paper presents analysis and design of a family of controllers based on numerical convex optimization for an aircraft pitch control system. A design method is proposed here to solve control system design problems in which a set of multiple closed loop performance specifications are simultaneously satisfied. The transfer matrix of the system is determined through the convex combination of the transfer matrices of the plant and the controllers. The present system with optimal convex controller has been tested for stability using Kharitonov’s Stability Criteria. The simulation deals here withthe problem of pitch control system of a BRAVO fighter aircraft which results in higher order close loop transfer function. So the order of the higher order transfer function is reduced to minimize the complexity of the system.

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

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

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

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

  4. Erratum to the paper: Compact hyperkaehler manifolds: basic results

    OpenAIRE

    Huybrechts, Daniel

    2001-01-01

    This is an Erratum to the paper: Compact hyperkaehler manifolds: basic results. (alg-geom/9705025, Inv. math. 135). We give a correct proof of the projectivity criterion for hyperkaehler manifolds. We use a recent result of Demailly and Paun math.AG/0105176.

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

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

  7. Flow and Pressure Distribution in Fuel Cell Manifolds

    DEFF Research Database (Denmark)

    Lebæk, Jesper; Bang, Mads; Kær, Søren Knudsen

    2010-01-01

    The manifold is an essential part of the fuel cell stack. Evidently, evenly distributed reactants are a prerequisite for an efficient fuel cell stack. In this study, the cathode manifold ability to distribute air to the cells of a 70 cell stack is investigated experimentally. By means of 20...

  8. Slant Riemannian maps from almost hermitian manifolds | Sahin ...

    African Journals Online (AJOL)

    As a generalization of holomorphic submersions, anti-invariant submersions and slant submersions, we introduce slant Riemannian maps from almost Hermitian manifolds to Riemannian manifolds. We give examples, obtain the existence conditions of slant Riemannian maps and investigate harmonicity of such maps.

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

  10. Submanifolds in manifolds with metric mixed 3-structures

    OpenAIRE

    Ianus, Stere; Ornea, Liviu; Vilcu, Gabriel Eduard

    2010-01-01

    Mixed 3-structures are odd-dimensional analogues of paraquaternionic structures. They appear naturally on lightlike hypersurfaces of almost paraquaternionic hermitian manifolds. We study invariant and anti-invariant submanifolds in a manifold endowed with a mixed 3-structure and a compatible (semi-Riemannian) metric. Particular attention is given to two cases of ambient space: mixed 3-Sasakian and mixed 3-cosymplectic.

  11. Harmonic Riemannian maps on locally conformal Kaehler manifolds

    Indian Academy of Sciences (India)

    Abstract. We study harmonic Riemannian maps on locally conformal Kaehler mani- folds (lcK manifolds). We show that if a Riemannian holomorphic map between lcK 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, ...

  12. A new proof of the theorem: Harmonic manifolds with minimal ...

    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.

  13. Manifold mapping: a two-level optimization technique

    NARCIS (Netherlands)

    Echeverría, D.; Hemker, P.W.

    2008-01-01

    In this paper, we analyze in some detail the manifold-mapping optimization technique introduced recently [Echeverría and Hemker in space mapping and defect correction. Comput Methods Appl Math 5(2): 107--136, 2005]. Manifold mapping aims at accelerating optimal design procedures that otherwise

  14. Manifold mapping: a two-level optimization technique

    NARCIS (Netherlands)

    D. Echeverria (David); P.W. Hemker (Piet)

    2008-01-01

    textabstractIn this paper, we analyze in some detail the manifold-mapping optimization technique introduced recently [Echeverría and Hemker in space mapping and defect correction. Comput Methods Appl Math 5(2): 107-–136, 2005]. Manifold mapping aims at accelerating optimal design procedures

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

    Indian Academy of Sciences (India)

    metric manifold satisfying the case (1), (2) and (3) is said to be conformally symmetric. [8], ξ-conformally flat [9] and ϕ-conformally flat [3] respectively. In [8], it is proved that a conformally symmetric K-contact manifold is locally isometric to the unit sphere. In ... derivative of ϕ in the characteristic direction ξ vanishes.

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

  17. Instantons on sine-cones over Sasakian manifolds

    Science.gov (United States)

    Bunk, Severin; Ivanova, Tatiana A.; Lechtenfeld, Olaf; Popov, Alexander D.; Sperling, Marcus

    2014-09-01

    We investigate instantons on sine-cones over Sasaki-Einstein and 3-Sasakian manifolds. It is shown that these conical Einstein manifolds are Kähler with torsion (KT) manifolds admitting Hermitian connections with totally antisymmetric torsion. Furthermore, a deformation of the metric on the sine-cone over 3-Sasakian manifolds allows one to introduce a hyper-Kähler with torsion (HKT) structure. In the large-volume limit these KT and HKT spaces become Calabi-Yau and hyper-Kähler conifolds, respectively. We construct gauge connections on complex vector bundles over conical KT and HKT manifolds which solve the instanton equations for Yang-Mills fields in higher dimensions.

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

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

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

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

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

  3. Consistent Pauli reduction on group manifolds

    Science.gov (United States)

    Baguet, A.; Pope, C. N.; Samtleben, H.

    2016-01-01

    We prove an old conjecture by Duff, Nilsson, Pope and Warner asserting that the NSsbnd NS sector of supergravity (and more general the bosonic string) allows for a consistent Pauli reduction on any d-dimensional group manifold G, keeping the full set of gauge bosons of the G × G isometry group of the bi-invariant metric on G. The main tool of the construction is a particular generalised Scherk-Schwarz reduction ansatz in double field theory which we explicitly construct in terms of the group's Killing vectors. Examples include the consistent reduction from ten dimensions on S3 ×S3 and on similar product spaces. The construction is another example of globally geometric non-toroidal compactifications inducing non-geometric fluxes.

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

    Stefan M. Stefanov

    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.

  5. Towards a Convex-Analytic View of Impossibility Results in ...

    Indian Academy of Sciences (India)

    Ankur A. Kulkarni

    2016-11-05

    Nov 5, 2016 ... [Jose and Kulkarni, 2015, IEEE CDC], [Jose and Kulkarni, 2016, IEEE. Trans IT]. Original problem. Optimization over distributions. (Nonconvex! ) min codes. Perror(code, R, n). ⇐⇒ min distributions. Perror(distribution, R, n). ⇓. A particular LP relaxation. Convex relaxation min hyperplanes. Perror(dist, R, n).

  6. The Fatou property in p-convex Banach lattices

    Science.gov (United States)

    Curbera, Guillermo P.; Ricker, Werner J.

    2007-04-01

    New features of the Banach function space , that is, the space of all [nu]-scalarly pth power integrable functions (with 1[less-than-or-equals, slant]pFatou property plays an essential role and leads to a new representation theorem for a large class of abstract p-convex Banach lattices.

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

    DEFF Research Database (Denmark)

    Petsatodis, Theodoros; Boukis, Christos; Talantzis, Fotios

    2011-01-01

    This paper proposes a robust Voice Activity Detector (VAD) based on the observation that the distribution of speech captured with far-field microphones is highly varying, depending on the noise and reverberation conditions. The proposed VAD employs a convex combination scheme comprising three...

  8. Linear inequality and convexity. Lineinye neravenstva i vypuklost

    Energy Technology Data Exchange (ETDEWEB)

    Astaf' ev, N.N.

    1982-01-01

    An examination is made of convex programming within the framework of linear inequality systems which are distinguished by constructivity and computational possibilities. Considerable attention is given to the study of various convergence situations. The book will be of interest to specialists in the field of mathmatical programming and optimization. 17 references.

  9. On moduli of convexity and some applications | Barcenas ...

    African Journals Online (AJOL)

    Abstract. We provide some properties of both moduli of convexity δ and β and derive some applications of the modulus β to the geometry of Banach spaces as well as fixed point theory. Quaestiones Mathematicae 32(2009), 307–319 ...

  10. Dynamical convexity of the Euler problem of two fixed centers

    OpenAIRE

    Kim, Seongchan

    2016-01-01

    We give thorough analysis for the rotation functions of the critical orbits from which one can understand bifurcations of periodic orbits. Moreover, we give explicit formulas of the Conley-Zehnder indices of the interior and exterior collision orbits and show that the universal cover of the regularized energy hypersurface of the Euler problem is dynamically convex for energies below the critical Jacobi energy.

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

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

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

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

  15. Grassmann manifolds and the Grassmann image of submanifolds

    Science.gov (United States)

    Borisenko, A. A.; Nikolaevskii, Yu A.

    1991-04-01

    CONTENTS I. Introduction II. Topology of Grassmann manifolds 1. Local coordinates 2. The cell decomposition and basic topological characteristics 3. Plücker coordinates III. Riemannian geometry of Grassmann manifolds: geometric approach 1. The metric and angles between planes 2. Curvature tensor, sectional curvature, closed geodesics, the limit set 3. More about Plücker embeddings 4. G+(2,n) as a Kähler manifold IV. Grassmann manifolds as symmetric spaces 1. The structure of a symmetric space 2. Totally geodesic and totally umbilical submanifolds 3. Standard embeddings of Grassmann manifolds in Euclidean space 4. Generalization of Grassmann manifolds V. Grassmann image. Intrinsic geometry 1. Induced metric. Homothety 2. Volume of the Grassmann image 3. Grassmann image of minimal surfaces 4. Harmonicity of the Grassmann map VI. Extrinsic geometry of the Grassmann image 1. Curvature of a Grassmann manifold along the Grassmann image of a surface 2. Reconstruction of a surface from the Grassmann image 3. Second fundamental form of the Grassmann image. Surfaces with totally geodesic and totally umbilical Grassmann image VII. Notes References

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

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

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

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

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

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

  2. On the distance between convex-ordered random variables, with applications

    OpenAIRE

    Boutsikas, Michael V.; Vaggelatou, Eutichia

    2002-01-01

    Simple approximation techniques are developed exploiting relationships between generalized convex orders and appropriate probability metrics. In particular, the distance between s-convex ordered random variables is investigated. Results connecting positive or negative dependence concepts and convex ordering are also presented. These results lead to approximations and bounds for the distributions of sums of positively or negatively dependent random variables. Applications and ex...

  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. Polynômes et optimisation convexe en commande robuste

    OpenAIRE

    Henrion, Didier

    2007-01-01

    A l'aide de quelques exemples illustratifs, des pistes sont évoquées pour combiner les méthodes polynomiales (algèbre, géométrie algébrique) et l'optimisation convexe (inégalités matricielles linéaires, LMI) dans le but de développer des outils numériques de résolution de problèmes basiques en automatique, et en particulier pour la commande robuste des systèmes linéaires. Dans le chapitre 2, nous évoquons les liens étroits entre ensembles semi-algébriques convexes et LMI,ainsi que la notion s...

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

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

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

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

  10. Spatial context driven manifold learning for hyperspectral image classification

    CSIR Research Space (South Africa)

    Zhang, Y

    2014-06-01

    Full Text Available Department of Electrical and Computer Engineering, University of Houston. 2 Meraka Institute, Council for Scientific and Industrial Research, South Africa. 3 School of Civil Engineering, Purdue University, US. Abstract Manifold learning techniques have...

  11. Manifold learning based feature extraction for classification of hyperspectral data

    CSIR Research Space (South Africa)

    Lunga, D

    2014-01-01

    Full Text Available of Electrical and Computer Engineering, University of Houston. 3. Schools of Civil Engineering and Electrical and Computer Engineering, Purdue University. Interest in manifold learning for representing the topology of large, high dimensional nonlinear data sets...

  12. 46 CFR 153.285 - Valving for cargo pump manifolds.

    Science.gov (United States)

    2010-10-01

    ... SHIPS CARRYING BULK LIQUID, LIQUEFIED GAS, OR COMPRESSED GAS HAZARDOUS MATERIALS Design and Equipment Piping Systems and Cargo Handling Equipment § 153.285 Valving for cargo pump manifolds. (a) When cargo...

  13. Supervised learning for neural manifold using spatiotemporal brain activity.

    Science.gov (United States)

    Kuo, Po-Chih; Chen, Yong-Sheng; Chen, Li-Fen

    2015-12-01

    Determining the means by which perceived stimuli are compactly represented in the human brain is a difficult task. This study aimed to develop techniques for the construction of the neural manifold as a representation of visual stimuli. We propose a supervised locally linear embedding method to construct the embedded manifold from brain activity, taking into account similarities between corresponding stimuli. In our experiments, photographic portraits were used as visual stimuli and brain activity was calculated from magnetoencephalographic data using a source localization method. The results of 10 × 10-fold cross-validation revealed a strong correlation between manifolds of brain activity and the orientation of faces in the presented images, suggesting that high-level information related to image content can be revealed in the brain responses represented in the manifold. Our experiments demonstrate that the proposed method is applicable to investigation into the inherent patterns of brain activity.

  14. Some functional inequalities on non-reversible Finsler manifolds

    Indian Academy of Sciences (India)

    SHIN-ICHI OHTA

    2017-11-13

    ). Finsler manifolds, based on the Bochner inequality established by Ohta and Sturm. Following the approach of the -calculus of Bakry et al (2014), we show the dimensional versions of the Poincaré–Lichnerowicz inequality, ...

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

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

    CSIR Research Space (South Africa)

    Scholes, RJ

    2003-12-01

    Full Text Available of the copyright owner. Further reproduction prohibited without permission. Convex Relationships in Ecosystems Containing Mixtures of Trees and Grass R.J. Scholes Environmental and Resource Economics; Dec 2003; 26, 4; ABI/INFORM Global pg. 559 Reproduced... with permission of the copyright owner. Further reproduction prohibited without permission. Reproduced with permission of the copyright owner. Further reproduction prohibited without permission. Reproduced with permission of the copyright owner. Further...

  17. Convex Clustering: An Attractive Alternative to Hierarchical Clustering

    Science.gov (United States)

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

    2015-01-01

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

  18. 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...... programs containing arithmetic, as well as constraint logic programs. Assignments, inequalities and equalities with arithmetic expressions can be interpreted as constraints during specialization, thus increasing the amount of specialization that can be achieved....

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

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

  1. Moduli spaces of convex projective structures on surfaces

    DEFF Research Database (Denmark)

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

    2007-01-01

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

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

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

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

    DEFF Research Database (Denmark)

    Fischer, Paul

    1997-01-01

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

  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 Optimization Methods for Graphs and Statistical Modeling

    Science.gov (United States)

    2011-06-01

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

  7. Manopt, a Matlab toolbox for optimization on manifolds

    OpenAIRE

    Boumal, Nicolas; Mishra, Bamdev; Absil, P. -A.; Sepulchre, Rodolphe

    2013-01-01

    Optimization on manifolds is a rapidly developing branch of nonlinear optimization. Its focus is on problems where the smooth geometry of the search space can be leveraged to design effcient numerical algorithms. In particular, optimization on manifolds is well-suited to deal with rank and orthogonality constraints. Such structured constraints appear pervasively in machine learning applications, including low-rank matrix completion, sensor network localization, camera network registration, in...

  8. Ideal triangulations of 3-manifolds II: taut and angle structures

    OpenAIRE

    Kang, Ensil; Rubinstein, J. Hyam

    2005-01-01

    This is the second in a series of papers in which we investigate ideal triangulations of the interiors of compact 3-manifolds with tori or Klein bottle boundaries. Such triangulations have been used with great effect, following the pioneering work of Thurston. Ideal triangulations are the basis of the computer program SNAPPEA of Weeks and the program SNAP of Coulson, Goodman, Hodgson and Neumann. Casson has also written a program to find hyperbolic structures on such 3-manifolds, by solving T...

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

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

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

  12. Structural robust optimization design based on convex model

    Directory of Open Access Journals (Sweden)

    Xuyong Chen

    Full Text Available There exist a great amount of uncertain factors in actual engineering. In order to involve these uncertain factors in analytical model, they have been expressed as the convex variables. In addition, the convex model was further classified into the hyper-ellipsoidal model and the interval model. After pointing out the intrinsic difference between these two kinds of models, the principle for applying which one of the models within the analysis has been indicated according to the available testing points. After standardizing the convex variables, the difference and relation between these two models for the optimization and solution process have been presented. With the analysis mentality available from the hyper-ellipsoidal model, the basic method about the robust optimization for the interval model was emphasized. After classification of the interval variables within the optimization process, the characteristics of the robust optimization were highlighted with different constraint conditions. Using the target-performance-based analytical scheme, the algorithm, the solution step and the convergence criteria for the robust optimization have been also presented with only one reliability index. Numerical examples and engineering problems were used to demonstrate the effectiveness and correctness of the proposed approach. Keywords: Robust optimization, Non-probabilistic reliability, Interval model, Hyper-ellipsoidal model, Probabilistic index

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

  14. Integrated high pressure manifold for thermoplastic microfluidic devices

    Science.gov (United States)

    Aghvami, S. Ali; Fraden, Seth

    2017-11-01

    We introduce an integrated tubing manifold for thermoplastic microfluidic chips that tolerates high pressure. In contrast to easy tubing in PDMS microfluidic devices, tube connection has been challenging for plastic microfluidics. Our integrated manifold connection tolerates 360 psi while conventional PDMS connections fail at 50 psi. Important design considerations are incorporation of a quick-connect, leak-free and high-pressure manifold for the inlets and outlets on the lid and registration marks that allow the precise alignment of the inlets and outlets. In our method, devices are comprised of two molded pieces joined together to create a sealed device. The first piece contains the microfluidic features and the second contains the inlet and outlet manifold, a frame for rigidity and a viewing window. The mold for the lid with integrated manifold is CNC milled from aluminium. A cone shape PDMS component which acts as an O-ring, seals the connection between molded manifold and tubing. The lid piece with integrated inlet and outlets will be a standard piece and can be used for different chips and designs. Sealing the thermoplastic device is accomplished by timed immersion of the lid in a mixture of volatile and non-volatile solvents followed by application of heat and pressure.

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

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

  17. STAR CLUSTERS, GALAXIES, AND THE FUNDAMENTAL MANIFOLD

    International Nuclear Information System (INIS)

    Zaritsky, Dennis; Zabludoff, Ann I.; Gonzalez, Anthony H.

    2011-01-01

    We explore whether global observed properties, specifically half-light radii, mean surface brightness, and integrated stellar kinematics, suffice to unambiguously differentiate galaxies from star clusters, which presumably formed differently and lack dark matter halos. We find that star clusters lie on the galaxy scaling relationship referred to as the fundamental manifold (FM), on the extension of a sequence of compact galaxies, and so conclude that there is no simple way to differentiate star clusters from ultracompact galaxies. By extending the validity of the FM over a larger range of parameter space and a wider set of objects, we demonstrate that the physics that constrains the resulting baryon and dark matter distributions in stellar systems is more general than previously appreciated. The generality of the FM implies (1) that the stellar spatial distribution and kinematics of one type of stellar system do not arise solely from a process particular to that set of systems, such as violent relaxation for elliptical galaxies, but are instead the result of an interplay of all processes responsible for the generic settling of baryons in gravitational potential wells, (2) that the physics of how baryons settle is independent of whether the system is embedded within a dark matter halo, and (3) that peculiar initial conditions at formation or stochastic events during evolution do not ultimately disturb the overall regularity of baryonic settling. We also utilize the relatively simple nature of star clusters to relate deviations from the FM to the age of the stellar population and find that stellar population models systematically and significantly overpredict the mass-to-light ratios of old, metal-rich clusters. We present an empirical calibration of stellar population mass-to-light ratios with age and color. Finally, we use the FM to estimate velocity dispersions for the low surface brightness, outer halo clusters that lack such measurements.

  18. Linearithmic time sparse and convex maximum margin clustering.

    Science.gov (United States)

    Zhang, Xiao-Lei; Wu, Ji

    2012-12-01

    Recently, a new clustering method called maximum margin clustering (MMC) was proposed and has shown promising performances. It was originally formulated as a difficult nonconvex integer problem. To make the MMC problem practical, the researchers either relaxed the original MMC problem to inefficient convex optimization problems or reformulated it to nonconvex optimization problems, which sacrifice the convexity for efficiency. However, no approaches can both hold the convexity and be efficient. In this paper, a new linearithmic time sparse and convex MMC algorithm, called support-vector-regression-based MMC (SVR-MMC), is proposed. Generally, it first uses the SVR as the core of the MMC. Then, it is relaxed as a convex optimization problem, which is iteratively solved by the cutting-plane algorithm. Each cutting-plane subproblem is further decomposed to a serial supervised SVR problem by a new global extended-level method (GELM). Finally, each supervised SVR problem is solved in a linear time complexity by a new sparse-kernel SVR (SKSVR) algorithm. We further extend the SVR-MMC algorithm to the multiple-kernel clustering (MKC) problem and the multiclass MMC (M3C) problem, which are denoted as SVR-MKC and SVR-M3C, respectively. One key point of the algorithms is the utilization of the SVR. It can prevent the MMC and its extensions meeting an integer matrix programming problem. Another key point is the new SKSVR. It provides a linear time interface to the nonlinear kernel scenarios, so that the SVR-MMC and its extensions can keep a linearthmic time complexity in nonlinear kernel scenarios. Our experimental results on various real-world data sets demonstrate the effectiveness and the efficiency of the SVR-MMC and its two extensions. Moreover, the unsupervised application of the SVR-MKC to the voice activity detection (VAD) shows that the SVR-MKC can achieve good performances that are close to its supervised counterpart, meet the real-time demand of the VAD, and need no

  19. The world problem: on the computability of the topology of 4-manifolds

    Science.gov (United States)

    vanMeter, J. R.

    2005-01-01

    Topological classification of the 4-manifolds bridges computation theory and physics. A proof of the undecidability of the homeomorphy problem for 4-manifolds is outlined here in a clarifying way. It is shown that an arbitrary Turing machine with an arbitrary input can be encoded into the topology of a 4-manifold, such that the 4-manifold is homeomorphic to a certain other 4-manifold if and only if the corresponding Turing machine halts on the associated input. Physical implications are briefly discussed.

  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. Hierarchical discriminant manifold learning for dimensionality reduction and image classification

    Science.gov (United States)

    Chen, Weihai; Zhao, Changchen; Ding, Kai; Wu, Xingming; Chen, Peter C. Y.

    2015-09-01

    In the field of image classification, it has been a trend that in order to deliver a reliable classification performance, the feature extraction model becomes increasingly more complicated, leading to a high dimensionality of image representations. This, in turn, demands greater computation resources for image classification. Thus, it is desirable to apply dimensionality reduction (DR) methods for image classification. It is necessary to apply DR methods to relieve the computational burden as well as to improve the classification accuracy. However, traditional DR methods are not compatible with modern feature extraction methods. A framework that combines manifold learning based DR and feature extraction in a deeper way for image classification is proposed. A multiscale cell representation is extracted from the spatial pyramid to satisfy the locality constraints for a manifold learning method. A spectral weighted mean filtering is proposed to eliminate noise in the feature space. A hierarchical discriminant manifold learning is proposed which incorporates both category label and image scale information to guide the DR process. Finally, the image representation is generated by concatenating dimensionality reduced cell representations from the same image. Extensive experiments are conducted to test the proposed algorithm on both scene and object recognition datasets in comparison with several well-established and state-of-the-art methods with respect to classification precision and computational time. The results verify the effectiveness of incorporating manifold learning in the feature extraction procedure and imply that the multiscale cell representations may be distributed on a manifold.

  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. Trajectory design using periapse maps and invariant manifolds

    Science.gov (United States)

    Haapala, Amanda F.

    The invariant manifolds associated with periodic orbits in the vicinity of the collinear libration points in the planar CR3BP have been previously demonstrated as mechanisms for transport. Trajectories that pass between adjoining regions within the zero-velocity curves pass through the invariant manifold tubes. In particular, the invariant manifolds associated with the unstable L1 and L2 periodic libration point orbits may be exploited to construct transit orbits between the interior and exterior regions associated with the zero-velocity curves. In this investigation, periapse Poincare maps are used to display the manifolds and to distinguish regions of escape and, conversely, regions of long-term capture. Manifold periapse structures are employed as a design tool to construct planar trajectories with predetermined characteristics. The strategies that are developed are demonstrated by producing planar trajectories with predetermined behaviors, namely, long-term capture orbits and transit trajectories, as well as heteroclinic and homoclinic connections. Additionally, path approximations are generated for four Jupiter family comets that experience temporary satellite capture. Periapse Poincare maps are also employed to design three-dimensional transit trajectories in the spatial circular restricted three-body problem.

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

  6. Lefschetz Fixed Point Theorem and Lattice Points in Convex Polytopes

    OpenAIRE

    Sardo-Infirri, Sacha

    1993-01-01

    A simple convex lattice polytope $\\Box$ defines a torus-equivariant line bundle $\\LB$ over a toric variety $\\XB.$ Atiyah and Bott's Lefschetz fixed-point theorem is applied to the torus action on the $d''$-complex of $\\LB$ and information is obtained about the lattice points of $\\Box$. In particular an explicit formula is derived, computing the number of lattice points and the volume of $\\Box$ in terms of geometric data at its extreme points. We show this to be equivalent the results of Brion...

  7. Convex optimization in normed spaces theory, methods and examples

    CERN Document Server

    Peypouquet, Juan

    2015-01-01

    This work is intended to serve as a guide for graduate students and researchers who wish to get acquainted with the main theoretical and practical tools for the numerical minimization of convex functions on Hilbert spaces. Therefore, it contains the main tools that are necessary to conduct independent research on the topic. It is also a concise, easy-to-follow and self-contained textbook, which may be useful for any researcher working on related fields, as well as teachers giving graduate-level courses on the topic. It will contain a thorough revision of the extant literature including both classical and state-of-the-art references.

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

  9. A *-mixing convergence theorem for convex set valued processes

    Directory of Open Access Journals (Sweden)

    A. de Korvin

    1987-01-01

    Full Text Available In this paper the concept of a *-mixing process is extended to multivalued maps from a probability space into closed, bounded convex sets of a Banach space. The main result, which requires that the Banach space be separable and reflexive, is a convergence theorem for *-mixing sequences which is analogous to the strong law of large numbers. The impetus for studying this problem is provided by a model from information science involving the utilization of feedback data by a decision maker who is uncertain of his goals. The main result is somewhat similar to a theorem for real valued processes and is of interest in its own right.

  10. A contribution to group representations in locally convex spaces

    International Nuclear Information System (INIS)

    Jurzak, J.P.

    1977-01-01

    Let U be a continuous representation of a (connected) locally compact group G in a separated locally convex space E. It is shown that the study of U is equivalent to the study of a family Usub(i) of continuous representations of G in Frechet spaces Fsub(i). If U is equicontinuous, the Fsub(i) are Banach spaces, and the Usub(i) are realized by isomeric operators. When U is topologically irreducible, it is Naemark equivalent to a Frechet (or isomeric Banach, in the equicontinuous case) continuous representation. Similar results hold for semi-groups. (Auth.)

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

    CERN Document Server

    Grad, Sorin-Mihai

    2014-01-01

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

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

    Science.gov (United States)

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

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

  13. Light transport on path-space manifolds

    Science.gov (United States)

    Jakob, Wenzel Alban

    -stepping limitations of the theory, they often suffer from unusably slow convergence; improvements to this situation have been hampered by the lack of a thorough theoretical understanding. We address these problems by developing a new theory of path-space light transport which, for the first time, cleanly incorporates specular scattering into the standard framework. Most of the results obtained in the analysis of the ideally smooth case can also be generalized to rendering of glossy materials and volumetric scattering so that this dissertation also provides a powerful new set of tools for dealing with them. The basis of our approach is that each specular material interaction locally collapses the dimension of the space of light paths so that all relevant paths lie on a submanifold of path space. We analyze the high-dimensional differential geometry of this submanifold and use the resulting information to construct an algorithm that is able to "walk" around on it using a simple and efficient equation-solving iteration. This manifold walking algorithm then constitutes the key operation of a new type of Markov Chain Monte Carlo (MCMC) rendering method that computes lighting through very general families of paths that can involve arbitrary combinations of specular, near-specular, glossy, and diffuse surface interactions as well as isotropic or highly anisotropic volume scattering. We demonstrate our implementation on a range of challenging scenes and evaluate it against previous methods.

  14. Differential forms and the Wodzicki residue for manifolds with boundary

    Science.gov (United States)

    Wang, Yong

    2006-05-01

    In [A. Connes, Quantized calculus and applications, XIth International Congress of Mathematical Physics (Paris,1994), 15-36, Internat Press, Cambridge, MA, 1995], Connes found a conformal invariant using Wodzicki's 1-density and computed it in the case of 4-dimensional manifold without boundary. In [W. J. Ugalde, Differential forms and the Wodzicki residue, arXiv: Math, DG/0211361], Ugalde generalized the Connes' result to n-dimensional manifold without boundary. In this paper, we generalize the results of [A. Connes, Quantized calculus and applications, XIth International Congress of Mathematical Physics (Paris,1994), 15-36, Internat Press, Cambridge, MA, 1995] and [W. J. Ugalde, Differential forms and the Wodzicki residue, arXiv: Math, DG/0211361] to the case of manifolds with boundary.

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

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

  17. Spherical formulation for diagrammatic evaluations on a manifold with boundary

    CERN Document Server

    Tsoupros, G

    2002-01-01

    The mathematical formalism necessary for the diagrammatic evaluation of quantum corrections to a conformally invariant field theory for a self-interacting scalar field on a curved manifold with boundary is considered. The evaluation of quantum corrections to the effective action past one-loop necessitates diagrammatic techniques. Diagrammatic evaluations and higher loop-order renormalization can be best accomplished on a Riemannian manifold of constant curvature accommodating a boundary of constant extrinsic curvature. In such a context, the stated evaluations can be accomplished through a consistent interpretation of the Feynman rules within the spherical formulation of the theory which the method of images allows. To this effect, the mathematical consequences of such an interpretation are analysed and the spherical formulation of the Feynman rules on the bounded manifold is, as a result, developed.

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

  19. 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......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 approximately isometric to the manifold that is assumed to be formed by the high-fidelity Navier-Stokes flow solutions under smooth variations of the inflow conditions. The focus of the work at hand is the adaptive construction and refinement of the Isomap emulator: We exploit the non-Euclidean Isomap metric...

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

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

  2. Integrable G2 Structures on 7-dimensional 3-Sasakian Manifolds

    Directory of Open Access Journals (Sweden)

    Nülifer ÖZDEMİR

    2017-02-01

    Full Text Available It is known that there exist canonical and nearly parallel $G_2$ structures on 7-dimensional 3-Sasakian manifolds. In this paper, we investigate the existence of $G_2$ structures which are neither canonical nor nearly parallel. We obtain eight new $G_2$ structures on 7-dimensional 3-Sasakian manifolds which are of general type according to the classification of $G_2$ structures by Fernandez and Gray. Then by deforming the metric determined by the $G_2$ structure, we give integrable $G_2$ structures. On a manifold with integrable $G_2$ structure, there exists a uniquely determined metric covariant derivative with anti-symetric torsion. We write torsion tensors corresponding to metric covariant derivatives with skew-symmetric torsion. In addition, we investigate some properties of torsion tensors.

  3. On new inequalities of Hermite-Hadamard-Fejer type for harmonically convex functions via fractional integrals.

    Science.gov (United States)

    Kunt, Mehmet; İşcan, İmdat; Yazıcı, Nazlı; Gözütok, Uğur

    2016-01-01

    In this paper, firstly, new Hermite-Hadamard type inequalities for harmonically convex functions in fractional integral forms are given. Secondly, Hermite-Hadamard-Fejer inequalities for harmonically convex functions in fractional integral forms are built. Finally, an integral identity and some Hermite-Hadamard-Fejer type integral inequalities for harmonically convex functions in fractional integral forms are obtained. Some results presented here provide extensions of others given in earlier works.

  4. The left Rieaman-Liouville fractional Hermite-Hadamard type inequalities for quasi-convex functions

    Directory of Open Access Journals (Sweden)

    Dünya Karapınar

    2017-08-01

    Full Text Available Recently, in [5], with a new approach, the authors obtained a new fractional Hermite-Hadamard type inequality for convex functions by using only the left Riemann-Liouville fractional integral. They also had new equalities to have new fractional trapezoid and midpoint type inequalities for convex functions, In this papers, we will use the same equalities to have new fractional trapezoid and midpoint type inequalities for quasi-convex functions. Our results generalise the study [3].

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

  6. Convex Relaxation For Hard Problem In Data Mining And Sensor Localization

    Science.gov (United States)

    2017-04-13

    AFRL-AFOSR-VA-TR-2017-0085 CONVEX RELAXATION FOR HARD PROBLEM IN DATA MINING AND SENSOR LOCALIZATION Stephen Vavasis UNIVERSITY OF WATERLOO 200...Performance 3. DATES COVERED (From - To) 15 Jun 2012 to 14 Aug 2015 4. TITLE AND SUBTITLE CONVEX RELAXATION FOR HARD PROBLEM IN DATA MINING AND SENSOR...the results. 15. SUBJECT TERMS Convex Relaxation Methods, Data Mining 16. SECURITY CLASSIFICATION OF: 17. LIMITATION OF ABSTRACT UU 18. NUMBER OF

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

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

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

  10. A Deep-Cutting-Plane Technique for Reverse Convex Optimization.

    Science.gov (United States)

    Moshirvaziri, K; Amouzegar, M A

    2011-08-01

    A large number of problems in engineering design and in many areas of social and physical sciences and technology lend themselves to particular instances of problems studied in this paper. Cutting-plane methods have traditionally been used as an effective tool in devising exact algorithms for solving convex and large-scale combinatorial optimization problems. Its utilization in nonconvex optimization has been also promising. A cutting plane, essentially a hyperplane defined by a linear inequality, can be used to effectively reduce the computational efforts in search of a global solution. Each cut is generated in order to eliminate a large portion of the search domain. Thus, a deep cut is intuitively superior in which it will exclude a larger set of extraneous points from consideration. This paper is concerned with the development of deep-cutting-plane techniques applied to reverse-convex programs. An upper bound and a lower bound for the optimal value are found, updated, and improved at each iteration. The algorithm terminates when the two bounds collapse or all the generated subdivisions have been fathomed. Finally, computational considerations and numerical results on a set of test problems are discussed. An illustrative example, walking through the steps of the algorithm and explaining the computational process, is presented.

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

  12. Spectral invariants of operators of Dirac type on partitioned manifolds

    DEFF Research Database (Denmark)

    Booss-Bavnbek, Bernhelm; Bleecker, D.

    2004-01-01

    We review the concepts of the index of a Fredholm operator, the spectral flow of a curve of self-adjoint Fredholm operators, the Maslov index of a curve of Lagrangian subspaces in symplectic Hilbert space, and the eta invariant of operators of Dirac type on closed manifolds and manifolds...... with boundary. We emphasize various (occasionally overlooked) aspects of rigorous definitions and explain the quite different stability properties. Moreover, we utilize the heat equation approach in various settings and show how these topological and spectral invariants are mutually related in the study...

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

  14. The Persistence of a Slow Manifold with Bifurcation

    DEFF Research Database (Denmark)

    Kristiansen, Kristian Uldall; Palmer, P.; Robert, M.

    2012-01-01

    his paper considers the persistence of a slow manifold with bifurcation in a slow-fast two degree of freedom Hamiltonian system. In particular, we consider a system with a supercritical pitchfork bifurcation in the fast space which is unfolded by the slow coordinate. The model system is motivated...... by tethered satellites. It is shown that an almost full measure subset of a neighborhood of the slow manifold's normally elliptic branches persists in an adiabatic sense. We prove this using averaging and a blow-up near the bifurcation....

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

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

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

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

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

  20. Orientifolds of type IIA strings on Calabi-Yau manifolds

    Indian Academy of Sciences (India)

    The advent of D-branes has led to a better understanding of dualities involving strong coupling limits. In particular, Ж = 1 compactifications of the heterotic string (on Calabi-Yau manifolds) are no longer the only string theories of phe- nomenological interest. One such class is furnished by M-theory compactifications.

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

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

  3. Sampling from Determinantal Point Processes for Scalable Manifold Learning.

    Science.gov (United States)

    Wachinger, Christian; Golland, Polina

    2015-01-01

    High computational costs of manifold learning prohibit its application for large datasets. A common strategy to overcome this problem is to perform dimensionality reduction on selected landmarks and to successively embed the entire dataset with the Nyström method. The two main challenges that arise are: (i) the landmarks selected in non-Euclidean geometries must result in a low reconstruction error, (ii) the graph constructed from sparsely sampled landmarks must approximate the manifold well. We propose to sample the landmarks from determinantal distributions on non-Euclidean spaces. Since current determinantal sampling algorithms have the same complexity as those for manifold learning, we present an efficient approximation with linear complexity. Further, we recover the local geometry after the sparsification by assigning each landmark a local covariance matrix, estimated from the original point set. The resulting neighborhood selection .based on the Bhattacharyya distance improves the embedding of sparsely sampled manifolds. Our experiments show a significant performance improvement compared to state-of-the-art landmark selection techniques on synthetic and medical data.

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

  5. Sparse discriminant manifold projections for bearing fault diagnosis

    Science.gov (United States)

    Chen, Gang; Liu, Fenglin; Huang, Wei

    2017-07-01

    The monitored vibration signal of bearing is usually nonlinear and nonstationary, and may be corrupted by background noise. Thus, it is very difficult to accurately extract sensitive and reliable characteristics information from the vibration signal to diagnose bearing health conditions. This paper proposes a novel bearing fault diagnosis method based on sparse discriminant manifold projections (SDMP). The SDMP was developed based on sparsity preserving projections, and sparse manifold clustering and embedding. The SDMP can effectively extract the meaningful low-dimensional intrinsic features that hidden in a high-dimensional feature dataset. After dimensionality reduction with the SDMP, the least squares support vector machine (LS-SVM) is utilized to classify the different low-dimensional feature data for fault recognition. The effectiveness and superiorities of the proposed method are demonstrated through several comparative experiments with other three manifold learning methods. The experimental results validate that the SDMP is more effective than the other three manifold learning methods for implementation bearing fault diagnosis, and it is more robust when deal with noise interference signal.

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

    This paper seeks to shed light on the topic of design and sizing of switching valves and connecting manifolds found in large digital hydraulic motors, also known commercially as Digital Displacement Motors. These motors promise very high operation efficiencies with broad operation ranges, which s...

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

  8. Growth of fundamental group for Finsler manifolds with integral Ricci ...

    Indian Academy of Sciences (India)

    tant to reveal the relationship between the topology and geometry invariants for Finsler manifolds. As for the ... Ricci curvature bound was established and the integral Ricci curvature and topology was studied [13]. .... star-shaped at x ∈ T if for all y ∈ T there exists a minimal geodesic from x to y contained in T . For r > 0, let T ...

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

  10. Analytical and numerical manifolds in a symplectic 4-D map

    Science.gov (United States)

    Delis, N.; Contopoulos, G.

    2016-05-01

    We study analytically the orbits along the asymptotic manifolds from a complex unstable periodic orbit in a symplectic 4-D Froeschlé map. The orbits are given as convergent series. We compare the analytic results by truncating the series at various orders with the corresponding numerical results and we find agreement along a more extended length, as the order of truncation increases. The agreement is improved when the parameters approach those of the stability domain. Along the manifolds no terms with small divisors appear in the series. The same result is found if we use a parametrization method along the asymptotic curves. In the case of orbits starting close to the manifolds small divisors appear, but the orbits remain close to the manifolds for an extended period of time. If the parameters of the map are close to the stable domain the orbits recede and approach the origin several times and remain confined in a certain volume around the origin for a long time before escaping to large distances. For special sets of parameters we see resonance phenomena and the orbits take particular forms near every resonance.

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

    Indian Academy of Sciences (India)

    dimensional hyperbolic space by a subgroup of hyperbolic isometries acting freely ..... from the construction of ˜r as in eq. (2.3) and Definition 2.2. D. DEFINITION 2.8. A crystallization ( , γ ) of a 3-manifold is called minimal with respect to the pair (〈S | R〉 ...

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

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

  14. Curvature Properties of Lorentzian Manifolds with Large Isometry Groups

    Energy Technology Data Exchange (ETDEWEB)

    Batat, Wafaa [Ecole Normale Superieure de L' Enseignement Technique d' Oran, Departement de Mathematiques et Informatique (Algeria)], E-mail: wafa.batat@enset-oran.dz; Calvaruso, Giovanni, E-mail: giovanni.calvaruso@unile.it; Leo, Barbara De [University of Salento, Dipartimento di Matematica ' E. De Giorgi' (Italy)], E-mail: barbara.deleo@unile.it

    2009-08-15

    The curvature of Lorentzian manifolds (M{sup n},g), admitting a group of isometries of dimension at least 1/2n(n - 1) + 1, is completely described. Interesting behaviours are found, in particular as concerns local symmetry, local homogeneity and conformal flatness.

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

  16. Stable Yang-Mills connections on special holonomy manifolds

    Science.gov (United States)

    Huang, Teng

    2017-06-01

    We prove that energy minimizing Yang-Mills connections on a compact G2-manifold has holonomy equal to G2 are G2-instantons, subject to an extra condition on the curvature. Furthermore, we show that energy minimizing connections on a compact Calabi-Yau 3-fold that has holonomy equal to SU(3) subject to a similar condition are holomorphic.

  17. Two new variants of the manifold-mapping technique

    NARCIS (Netherlands)

    D. Echeverria (David)

    2006-01-01

    htmlabstractManifold-mapping is an efficient surrogate-based optimization technique aimed at the acceleration of very time-consuming design problems. In this paper we present two new variants of the original algorithm that make it applicable to a broader range of optimization scenarios. The first

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

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

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

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

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

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

  4. The Geometry of Slow Manifolds near a Folded Node

    NARCIS (Netherlands)

    Desroches, M.; Krauskopf, B.; Osinga, H.M.

    2008-01-01

    This paper is concerned with the geometry of slow manifolds of a dynamical system with one fast and two slow variables. Specifically, we study the dynamics near a folded-node singularity, which is known to give rise to so-called canard solutions. Geometrically, canards are intersection curves of

  5. Invariant Distributionally Scrambled Manifolds for an Annihilation Operator

    Directory of Open Access Journals (Sweden)

    Xinxing Wu

    2014-01-01

    Full Text Available This note proves that the annihilation operator of a quantum harmonic oscillator admits an invariant distributionally ε-scrambled linear manifold for any 0<ε<2. This is a positive answer to Question 1 by Wu and Chen (2013.

  6. Balanced metrics for vector bundles and polarised manifolds

    DEFF Research Database (Denmark)

    Garcia Fernandez, Mario; Ross, Julius

    2012-01-01

    We consider a notion of balanced metrics for triples (X, L, E) which depend on a parameter α, where X is smooth complex manifold with an ample line bundle L and E is a holomorphic vector bundle over X. For generic choice of α, we prove that the limit of a convergent sequence of balanced metrics...

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

  8. Formation of a Chern-Simons cylindrical wormhole during evolution of manifolds

    Science.gov (United States)

    Sepehri, Alireza; Ghaffary, Tooraj; Naimi, Yaghoob; Ghaforyan, Hossein; Ebrahimzadeh, Majid

    In this paper, the formation of cylindrical wormhole during evolution of manifolds is studied. It is shown that this type of wormholes may be produced at two stages and then disappeared very fast at the third stage. First, one N-dimensional is formed by joining point-like manifolds. Then, this manifold is torn and two child manifolds plus one Chern-Simons manifold appeared. Our universe is born on one of the child manifolds and connected to the other one by Chern-Simons manifold. At the third stage, this Chern-Simons manifold-which plays the role of cylindrical wormhole, dissolves into universes and gives its energy to them and causes inflation. Thus, the Chern-Simons cylindrical wormhole is unstable and dissolves in our four-dimensional universes and another universe very fast.

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

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

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

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

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

    Directory of Open Access Journals (Sweden)

    Nikos Kalogeropoulos

    2015-09-01

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

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

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

  16. Greedy vs. L1 Convex Optimization in Sparse Coding

    DEFF Research Database (Denmark)

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

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

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

    KAUST Repository

    Ahn, Heekap

    2012-01-01

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

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

    DEFF Research Database (Denmark)

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

    2008-01-01

    Kretztechnik, Zipf, Austria). The array has an elevation focus at 60 mm of depth, and the angular rocking velocity is up to 140deg/s. The scan sequence uses an fprf of 4500 - 7000 Hz allowing up to 15 cm of penetration. The full width at half max (FWHM) and main-lobe to side-lobe ratio (MLSL) is used.......8% on average by applying 3D SA focusing. In-Vivo measurements show an improvement in C-scans matching what is found in simulations and wire phantoms. The method has shown the ability to improve the elevation focus and contrast for a convex rocking array. This was shown for simulations and for phantom and In...

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

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

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

    Science.gov (United States)

    Zhou, Hua; Lange, Kenneth

    2015-07-01

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

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

    NARCIS (Netherlands)

    Fourie, Zacharias; Ozcan, Mutlu; Sandham, John

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

  3. On some Hermite-Hadamard type inequalities for (s, QC)-convex functions.

    Science.gov (United States)

    Wu, Ying; Qi, Feng

    2016-01-01

    In the paper, the authors introduce a new notion "[Formula: see text]-convex function on the co-ordinates" and establish some Hermite-Hadamard type integral inequalities for [Formula: see text]-convex functions on the co-ordinates.

  4. Sandor Type Inequalities for Sugeno Integral with respect to General α,m,r-Convex Functions

    Directory of Open Access Journals (Sweden)

    Dong-Qing Li

    2015-01-01

    Full Text Available The concept for general α,m,r-convex functions, as a generalization of convex functions, is introduced. Then, Sandor type inequalities for the Sugeno integral based on this kind of function are established. Our work generalizes the previous results in the literature. Finally, some conclusions and problems for further investigations are given.

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

    NARCIS (Netherlands)

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

    2001-01-01

    A process associated with integrated Brownian motion is introduced that characterizes the limit behavior of nonparametric least squares and maximum likelihood estimators of convex functions and convex densities, respectively. We call this process “the invelope” and show that it is an almost surely

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

    African Journals Online (AJOL)

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

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

    African Journals Online (AJOL)

    This paper investigates the concept of Fuzzy set theory in relation to the idea of convexity. Some fundamental theorems were considered. Keywords: Fuzzy Set, Mapping for Fuzzy Set, Convex Set. 2010 Mathematics Subject Classification: 03Exx, 52Axx, 94B75 Journal of the Nigerian Association of Mathematical Physics, ...

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

    Directory of Open Access Journals (Sweden)

    İmdat İşcan

    2014-10-01

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

  9. Optimality Conditions and Duality for DC Programming in Locally Convex Spaces

    Directory of Open Access Journals (Sweden)

    Wang Xianyun

    2009-01-01

    Full Text Available Consider the DC programming problem where and are proper convex functions defined on locally convex Hausdorff topological vector spaces and respectively, and is a linear operator from to . By using the properties of the epigraph of the conjugate functions, the optimality conditions and strong duality of are obtained.

  10. Action-angle variables and a KAM theorem for b-Poisson manifolds

    OpenAIRE

    Kiesenhofer, Anna; Miranda Galcerán, Eva; Scott, Geoffrey

    2015-01-01

    In this article we prove an action-angle theorem for b-integrable systems on b-Poisson manifolds improving the action-angle theorem contained in [14] for general Poisson manifolds in this setting. As an application, we prove a KAM-type theorem for b-Poisson manifolds. (C) 2015 Elsevier Masson SAS. All rights reserved.

  11. 30 CFR 250.444 - What are the choke manifold requirements?

    Science.gov (United States)

    2010-07-01

    ... 30 Mineral Resources 2 2010-07-01 2010-07-01 false What are the choke manifold requirements? 250... Blowout Preventer (bop) System Requirements § 250.444 What are the choke manifold requirements? (a) Your BOP system must include a choke manifold that is suitable for the anticipated surface pressures...

  12. On Hermite-Hadamard Type Inequalities for Riemann-Liouville Fractional Integrals via Two Kinds of Convexity

    Directory of Open Access Journals (Sweden)

    Feixiang Chen

    2014-01-01

    Full Text Available We obtain some Hermite-Hadamard type inequalities for products of two m-convex functions via Riemann-Liouville integrals. The analogous results for (α,m-convex functions are also established.

  13. Birkhoff’s theorem in Lovelock gravity for general base manifolds

    Science.gov (United States)

    Ray, Sourya

    2015-10-01

    We extend the Birkhoff’s theorem in Lovelock gravity for arbitrary base manifolds using an elementary method. In particular, it is shown that any solution of the form of a warped product of a two-dimensional transverse space and an arbitrary base manifold must be static. Moreover, the field equations restrict the base manifold such that all the non-trivial intrinsic Lovelock tensors of the base manifold are constants, which can be chosen arbitrarily, and the metric in the transverse space is determined by a single function of a spacelike coordinate which satisfies an algebraic equation involving the constants characterizing the base manifold along with the coupling constants.

  14. Out-of-sample extrapolation of learned manifolds.

    Science.gov (United States)

    Chin, Tat-Jun; Suter, David

    2008-09-01

    We investigate the problem of extrapolating the embedding of a manifold learned from finite samples to novel out-of-sample data. We concentrate on the manifold learning method called Maximum Variance Unfolding (MVU) for which the extrapolation problem is still largely unsolved. Taking the perspective of MVU learning being equivalent to Kernel PCA, our problem reduces to extending a kernel matrix generated from an unknown kernel function to novel points. Leveraging on previous developments, we propose a novel solution which involves approximating the kernel eigenfunction using Gaussian basis functions. We also show how the width of the Gaussian can be tuned to achieve extrapolation. Experimental results which demonstrate the effectiveness of the proposed approach are also included.

  15. Slow manifold and Hannay angle in the spinning top

    Energy Technology Data Exchange (ETDEWEB)

    Berry, M V [H H Wills Physics Laboratory, Tyndall Avenue, Bristol BS8 1TL (United Kingdom); Shukla, P [Department of Physics, Indian Institute of Technology, Kharagpur (India)

    2011-01-15

    The spin of a top can be regarded as a fast variable, coupled to the motion of the axis which is slow. In pure precession, the rotation of the axis round a cone (without nutation), can be considered as the result of a reaction from the fast spin. The resulting restriction of the total state space of the top is an illustrative example, at graduate-student level, of the general dynamical concept of the slow manifold. For this case, the slow manifold can be calculated exactly, and expanded as a series of reaction forces (of magnetic type) in powers of slowness, corresponding to a modified precession frequency. The forces correspond to a series for the Hannay angle for the fast motion, describing the location of a point on the top.

  16. Manifold: a Custom Analytics Platform to Visualize Research Impact

    Directory of Open Access Journals (Sweden)

    Steven Braun

    2015-10-01

    Full Text Available The use of research impact metrics and analytics has become an integral component to many aspects of institutional assessment. Many platforms currently exist to provide such analytics, both proprietary and open source; however, the functionality of these systems may not always overlap to serve uniquely specific needs. In this paper, I describe a novel web-based platform, named Manifold, that I built to serve custom research impact assessment needs in the University of Minnesota Medical School. Built on a standard LAMP architecture, Manifold automatically pulls publication data for faculty from Scopus through APIs, calculates impact metrics through automated analytics, and dynamically generates report-like profiles that visualize those metrics. Work on this project has resulted in many lessons learned about challenges to sustainability and scalability in developing a system of such magnitude.

  17. Holomorphic Yukawa couplings for complete intersection Calabi-Yau manifolds

    Energy Technology Data Exchange (ETDEWEB)

    Blesneag, Stefan [Rudolf Peierls Centre for Theoretical Physics, Oxford University,1 Keble Road, Oxford, OX1 3NP (United Kingdom); Buchbinder, Evgeny I. [The University of Western Australia,35 Stirling Highway, Crawley WA 6009 (Australia); Lukas, Andre [Rudolf Peierls Centre for Theoretical Physics, Oxford University,1 Keble Road, Oxford, OX1 3NP (United Kingdom)

    2017-01-27

    We develop methods to compute holomorphic Yukawa couplings for heterotic compactifications on complete intersection Calabi-Yau manifolds, generalising results of an earlier paper for Calabi-Yau hypersurfaces. Our methods are based on constructing the required bundle-valued forms explicitly and evaluating the relevant integrals over the projective ambient space. We also show how our approach relates to an earlier, algebraic one to calculate the holomorphic Yukawa couplings. A vanishing theorem, which we prove, implies that certain Yukawa couplings allowed by low-energy symmetries are zero due to topological reasons. To illustrate our methods, we calculate Yukawa couplings for SU(5)-based standard models on a co-dimension two complete intersection manifold.

  18. Lattice Dirac fermions on a simplicial Riemannian manifold

    Science.gov (United States)

    Brower, Richard C.; Weinberg, Evan S.; Fleming, George T.; Gasbarro, Andrew D.; Raben, Timothy G.; Tan, Chung-I.

    2017-06-01

    The lattice Dirac equation is formulated on a simplicial complex which approximates a smooth Riemann manifold by introducing a lattice vierbein on each site and a lattice spin connection on each link. Care is taken so the construction applies to any smooth D-dimensional Riemannian manifold that permits a spin connection. It is tested numerically in 2D for the projective sphere S2 in the limit of an increasingly refined sequence of triangles. The eigenspectrum and eigenvectors are shown to converge rapidly to the exact result in the continuum limit. In addition comparison is made with the continuum Ising conformal field theory on S2. Convergence is tested for the two point, ⟨ɛ (x1)ɛ (x2)⟩, and the four point, ⟨σ (x1)ɛ (x2)ɛ (x3)σ (x4)⟩, correlators for the energy, ɛ (x )=i ψ ¯(x )ψ (x ), and twist operators, σ (x ), respectively.

  19. Laplacian manifold regularization method for fluorescence molecular tomography

    Science.gov (United States)

    He, Xuelei; Wang, Xiaodong; Yi, Huangjian; Chen, Yanrong; Zhang, Xu; Yu, Jingjing; He, Xiaowei

    2017-04-01

    Sparse regularization methods have been widely used in fluorescence molecular tomography (FMT) for stable three-dimensional reconstruction. Generally, ℓ1-regularization-based methods allow for utilizing the sparsity nature of the target distribution. However, in addition to sparsity, the spatial structure information should be exploited as well. A joint ℓ1 and Laplacian manifold regularization model is proposed to improve the reconstruction performance, and two algorithms (with and without Barzilai-Borwein strategy) are presented to solve the regularization model. Numerical studies and in vivo experiment demonstrate that the proposed Gradient projection-resolved Laplacian manifold regularization method for the joint model performed better than the comparative algorithm for ℓ1 minimization method in both spatial aggregation and location accuracy.

  20. Multiview vector-valued manifold regularization for multilabel image classification.

    Science.gov (United States)

    Luo, Yong; Tao, Dacheng; Xu, Chang; Xu, Chao; Liu, Hong; Wen, Yonggang

    2013-05-01

    In computer vision, image datasets used for classification are naturally associated with multiple labels and comprised of multiple views, because each image may contain several objects (e.g., pedestrian, bicycle, and tree) and is properly characterized by multiple visual features (e.g., color, texture, and shape). Currently, available tools ignore either the label relationship or the view complementarily. Motivated by the success of the vector-valued function that constructs matrix-valued kernels to explore the multilabel structure in the output space, we introduce multiview vector-valued manifold regularization (MV(3)MR) to integrate multiple features. MV(3)MR exploits the complementary property of different features and discovers the intrinsic local geometry of the compact support shared by different features under the theme of manifold regularization. We conduct extensive experiments on two challenging, but popular, datasets, PASCAL VOC' 07 and MIR Flickr, and validate the effectiveness of the proposed MV(3)MR for image classification.