Convex sets in probabilistic normed spaces
International Nuclear Information System (INIS)
Aghajani, Asadollah; Nourouzi, Kourosh
2008-01-01
In this paper we obtain some results on convexity in a probabilistic normed space. We also investigate the concept of CSN-closedness and CSN-compactness in a probabilistic normed space and generalize the corresponding results of normed spaces
STRICT CONVEXITY THROUGH EQUIVALENT NORMS IN SEPARABLES BANACH SPACES
Directory of Open Access Journals (Sweden)
Willy Zubiaga Vera
2016-12-01
Full Text Available Let E be a separable Banach space with norm || . ||. In the present work, the objective is to construct a norm || . ||1 that is equivalent to || . || in E, such that || . ||1 is strictly convex. In addition it is shown that its dual conjugate norm is also strictly convex.
On asphericity of convex bodies in linear normed spaces.
Faried, Nashat; Morsy, Ahmed; Hussein, Aya M
2018-01-01
In 1960, Dvoretzky proved that in any infinite dimensional Banach space X and for any [Formula: see text] there exists a subspace L of X of arbitrary large dimension ϵ -iometric to Euclidean space. A main tool in proving this deep result was some results concerning asphericity of convex bodies. In this work, we introduce a simple technique and rigorous formulas to facilitate calculating the asphericity for each set that has a nonempty boundary set with respect to the flat space generated by it. We also give a formula to determine the center and the radius of the smallest ball containing a nonempty nonsingleton set K in a linear normed space, and the center and the radius of the largest ball contained in it provided that K has a nonempty boundary set with respect to the flat space generated by it. As an application we give lower and upper estimations for the asphericity of infinite and finite cross products of these sets in certain spaces, respectively.
The canonical partial metric and the uniform convexity on normed spaces
Directory of Open Access Journals (Sweden)
S. Oltra
2005-10-01
Full Text Available In this paper we introduce the notion of canonical partial metric associated to a norm to study geometric properties of normed spaces. In particular, we characterize strict convexity and uniform convexity of normed spaces in terms of the canonical partial metric defined by its norm. We prove that these geometric properties can be considered, in this sense, as topological properties that appear when we compare the natural metric topology of the space with the non translation invariant topology induced by the canonical partial metric in the normed space.
Stereotype locally convex spaces
International Nuclear Information System (INIS)
Akbarov, S S
2000-01-01
We give complete proofs of some previously announced results in the theory of stereotype (that is, reflexive in the sense of Pontryagin duality) locally convex spaces. These spaces have important applications in topological algebra and functional analysis
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.
Stereotype locally convex spaces
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.
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
Barrelled locally convex spaces
PÃ©rez Carreras, P
1987-01-01
This book is a systematic treatment of barrelled spaces, and of structures in which barrelledness conditions are significant. It is a fairly self-contained study of the structural theory of those spaces, concentrating on the basic phenomena in the theory, and presenting a variety of functional-analytic techniques.Beginning with some basic and important results in different branches of Analysis, the volume deals with Baire spaces, presents a variety of techniques, and gives the necessary definitions, exploring conditions on discs to ensure that they are absorbed by the barrels of the sp
A STRONG OPTIMIZATION THEOREM IN LOCALLY CONVEX SPACES
Institute of Scientific and Technical Information of China (English)
程立新; 腾岩梅
2003-01-01
This paper presents a geometric characterization of convex sets in locally convex spaces onwhich a strong optimization theorem of the Stegall-type holds, and gives Collier's theorem ofw* Asplund spaces a localized setting.
Uniform estimate of a compact convex set by a ball in an arbitrary norm
International Nuclear Information System (INIS)
Dudov, S I; Zlatorunskaya, I V
2000-01-01
The problem of the best uniform approximation of a compact convex set by a ball with respect to an arbitrary norm in the Hausdorff metric corresponding to that norm is considered. The question is reduced to a convex programming problem, which can be studied by means of convex analysis. Necessary and sufficient conditions for the solubility of this problem are obtained and several properties of its solution are described. It is proved, in particular, that the centre of at least one ball of best approximation lies in the compact set under consideration; in addition, conditions ensuring that the centres of all balls of best approximation lie in this compact set and a condition for unique solubility are obtained
Branching geodesics in normed spaces
International Nuclear Information System (INIS)
Ivanov, A O; Tuzhilin, A A
2002-01-01
We study branching extremals of length functionals on normed spaces. This is a natural generalization of the Steiner problem in normed spaces. We obtain criteria for a network to be extremal under deformations that preserve the topology of networks as well as under deformations with splitting. We discuss the connection between locally shortest networks and extremal networks. In the important particular case of the Manhattan plane, we get a criterion for a locally shortest network to be extremal
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
A note on supercyclic operators in locally convex spaces
Albanese, Angela A.; Jornet, David
2018-01-01
We treat some questions related to supercyclicity of continuous linear operators when acting in locally convex spaces. We extend results of Ansari and Bourdon and consider doubly power bounded operators in this general setting. Some examples are given.
Convexity and concavity constants in Lorentz and Marcinkiewicz spaces
Kaminska, Anna; Parrish, Anca M.
2008-07-01
We provide here the formulas for the q-convexity and q-concavity constants for function and sequence Lorentz spaces associated to either decreasing or increasing weights. It yields also the formula for the q-convexity constants in function and sequence Marcinkiewicz spaces. In this paper we extent and enhance the results from [G.J.O. Jameson, The q-concavity constants of Lorentz sequence spaces and related inequalities, Math. Z. 227 (1998) 129-142] and [A. Kaminska, A.M. Parrish, The q-concavity and q-convexity constants in Lorentz spaces, in: Banach Spaces and Their Applications in Analysis, Conference in Honor of Nigel Kalton, May 2006, Walter de Gruyter, Berlin, 2007, pp. 357-373].
Moduli spaces of convex projective structures on surfaces
DEFF Research Database (Denmark)
Fock, V. V.; Goncharov, A. B.
2007-01-01
We introduce explicit parametrisations of the moduli space of convex projective structures on surfaces, and show that the latter moduli space is identified with the higher Teichmüller space for defined in [V.V. Fock, A.B. Goncharov, Moduli spaces of local systems and higher Teichmüller theory, math.......AG/0311149]. We investigate the cluster structure of this moduli space, and define its quantum version....
Convexity and the Euclidean Metric of Space-Time
Directory of Open Access Journals (Sweden)
Nikolaos Kalogeropoulos
2017-02-01
Full Text Available We address the reasons why the “Wick-rotated”, positive-definite, space-time metric obeys the Pythagorean theorem. An answer is proposed based on the convexity and smoothness properties of the functional spaces purporting to provide the kinematic framework of approaches to quantum gravity. We employ moduli of convexity and smoothness which are eventually extremized by Hilbert spaces. We point out the potential physical significance that functional analytical dualities play in this framework. Following the spirit of the variational principles employed in classical and quantum Physics, such Hilbert spaces dominate in a generalized functional integral approach. The metric of space-time is induced by the inner product of such Hilbert spaces.
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.
Statistical convergence on intuitionistic fuzzy normed spaces
International Nuclear Information System (INIS)
Karakus, S.; Demirci, K.; Duman, O.
2008-01-01
Saadati and Park [Saadati R, Park JH, Chaos, Solitons and Fractals 2006;27:331-44] has recently introduced the notion of intuitionistic fuzzy normed space. In this paper, we study the concept of statistical convergence on intuitionistic fuzzy normed spaces. Then we give a useful characterization for statistically convergent sequences. Furthermore, we display an example such that our method of convergence is stronger than the usual convergence on intuitionistic fuzzy normed spaces
Flat tori in three-dimensional space and convex integration.
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.
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
Convex analysis and monotone operator theory in Hilbert spaces
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...
Multipliers on Generalized Mixed Norm Sequence Spaces
Directory of Open Access Journals (Sweden)
Oscar Blasco
2014-01-01
Full Text Available Given 1≤p,q≤∞ and sequences of integers (nkk and (nk′k such that nk≤nk′≤nk+1, the generalized mixed norm space ℓℐ(p,q is defined as those sequences (ajj such that ((∑j∈Ik|aj|p1/pk∈ℓq where Ik={j∈ℕ0 s.t. nk≤j
Differential calculus in normed linear spaces
Mukherjea, Kalyan
2007-01-01
This book presents Advanced Calculus from a geometric point of view: instead of dealing with partial derivatives of functions of several variables, the derivative of the function is treated as a linear transformation between normed linear spaces. Not only does this lead to a simplified and transparent exposition of "difficult" results like the Inverse and Implicit Function Theorems but also permits, without any extra effort, a discussion of the Differential Calculus of functions defined on infinite dimensional Hilbert or Banach spaces.The prerequisites demanded of the reader are modest: a sound understanding of convergence of sequences and series of real numbers, the continuity and differentiability properties of functions of a real variable and a little Linear Algebra should provide adequate background for understanding the book. The first two chapters cover much of the more advanced background material on Linear Algebra (like dual spaces, multilinear functions and tensor products.) Chapter 3 gives an ab ini...
Convergence theorems for quasi-contractive maps in uniformly convex spaces
International Nuclear Information System (INIS)
Chidume, C.E.; Osilike, M.O.
1992-04-01
Let K be a nonempty closed convex and bounded subset of a real uniformly convex Banach space E of modulus of convexity of power type q≥2. Let T by a quasi-contractive mapping of K into itself. It is proved that each of two well known fixed point iteration methods (the Mann and the Ishikawa iteration methods) converges strongly, without any compactness assumption on the domain of the map, to the unique fixed point of T in K. Our theorems generalize important known results. (author). 22 refs
A common fixed point for operators in probabilistic normed spaces
International Nuclear Information System (INIS)
Ghaemi, M.B.; Lafuerza-Guillen, Bernardo; Razani, A.
2009-01-01
Probabilistic Metric spaces was introduced by Karl Menger. Alsina, Schweizer and Sklar gave a general definition of probabilistic normed space based on the definition of Menger [Alsina C, Schweizer B, Sklar A. On the definition of a probabilistic normed spaces. Aequationes Math 1993;46:91-8]. Here, we consider the equicontinuity of a class of linear operators in probabilistic normed spaces and finally, a common fixed point theorem is proved. Application to quantum Mechanic is considered.
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
Intuitionistic fuzzy 2-normed space and some related concepts
International Nuclear Information System (INIS)
Mursaleen, M.; Danish Lohani, Q.M.
2009-01-01
Motivated by the notion of 2-norm due to Gaehler [Gaehler S. Lineare 2-normietre Raeume. Math Nachr 28;1965:1-43], in this paper we define the concept of intuitionistic fuzzy 2-normed space which is a generalization of the notion of intuitionistic fuzzy normed space due to Saadati and Park [Saadati R, Park JH, On the intuitionistic fuzzy topological spaces. Chaos Solitons and Fractals 2006;27:331-44]. Further we establish some topological results in this new set up.
Mathematical methods linear algebra normed spaces distributions integration
Korevaar, Jacob
1968-01-01
Mathematical Methods, Volume I: Linear Algebra, Normed Spaces, Distributions, Integration focuses on advanced mathematical tools used in applications and the basic concepts of algebra, normed spaces, integration, and distributions.The publication first offers information on algebraic theory of vector spaces and introduction to functional analysis. Discussions focus on linear transformations and functionals, rectangular matrices, systems of linear equations, eigenvalue problems, use of eigenvectors and generalized eigenvectors in the representation of linear operators, metric and normed vector
Convexity Of Inversion For Positive Operators On A Hilbert Space
International Nuclear Information System (INIS)
Sangadji
2001-01-01
This paper discusses and proves three theorems for positive invertible operators on a Hilbert space. The first theorem gives a comparison of the generalized arithmetic mean, generalized geometric mean, and generalized harmonic mean for positive invertible operators on a Hilbert space. For the second and third theorems each gives three inequalities for positive invertible operators on a Hilbert space that are mutually equivalent
Fourier Multipliers on Anisotropic Mixed-Norm Spaces of Distributions
DEFF Research Database (Denmark)
Cleanthous, Galatia; Georgiadis, Athanasios; Nielsen, Morten
2018-01-01
A new general Hormander type condition involving anisotropies and mixed norms is introduced, and boundedness results for Fourier multi- pliers on anisotropic Besov and Triebel-Lizorkin spaces of distributions with mixed Lebesgue norms are obtained. As an application, the continuity of such operat......A new general Hormander type condition involving anisotropies and mixed norms is introduced, and boundedness results for Fourier multi- pliers on anisotropic Besov and Triebel-Lizorkin spaces of distributions with mixed Lebesgue norms are obtained. As an application, the continuity...
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
Statistical convergence of double sequences in intuitionistic fuzzy normed spaces
International Nuclear Information System (INIS)
Mursaleen, M.; Mohiuddine, S.A.
2009-01-01
Recently, the concept of intuitionistic fuzzy normed spaces was introduced by Saadati and Park [Saadati R, Park JH. Chaos, Solitons and Fractals 2006;27:331-44]. Karakus et al. [Karakus S, Demirci K, Duman O. Chaos, Solitons and Fractals 2008;35:763-69] have quite recently studied the notion of statistical convergence for single sequences in intuitionistic fuzzy normed spaces. In this paper, we study the concept of statistically convergent and statistically Cauchy double sequences in intuitionistic fuzzy normed spaces. Furthermore, we construct an example of a double sequence to show that in IFNS statistical convergence does not imply convergence and our method of convergence even for double sequences is stronger than the usual convergence in intuitionistic fuzzy normed space.
Invariant and semi-invariant probabilistic normed spaces
Energy Technology Data Exchange (ETDEWEB)
Ghaemi, M.B. [School of Mathematics Iran, University of Science and Technology, Narmak, Tehran (Iran, Islamic Republic of)], E-mail: mghaemi@iust.ac.ir; Lafuerza-Guillen, B. [Departamento de Estadistica y Matematica Aplicada, Universidad de Almeria, Almeria E-04120 (Spain)], E-mail: blafuerz@ual.es; Saiedinezhad, S. [School of Mathematics Iran, University of Science and Technology, Narmak, Tehran (Iran, Islamic Republic of)], E-mail: ssaiedinezhad@yahoo.com
2009-10-15
Probabilistic metric spaces were introduced by Karl Menger. Alsina, Schweizer and Sklar gave a general definition of probabilistic normed space based on the definition of Menger . We introduce the concept of semi-invariance among the PN spaces. In this paper we will find a sufficient condition for some PN spaces to be semi-invariant. We will show that PN spaces are normal spaces. Urysohn's lemma, and Tietze extension theorem for them are proved.
Uniqueness of a pre-generator for $C_0$-semigroup on a general locally convex vector space
Lemle, Ludovic Dan; Wu, Liming
2007-01-01
The main purpose is to generalize a theorem of Arendt about uniqueness of $C_0$-semigroups from Banach space setting to the general locally convex vector spaces, more precisely, we show that cores are the only domains of uniqueness for $C_0$-semigroups on locally convex spaces. As an application, we find a necessary and sufficient condition for that the mass transport equation has one unique $L^1(\\R^d,dx)$ weak solution.
Functional equations in matrix normed spaces
Indian Academy of Sciences (India)
The abstract characterization given for linear spaces of bounded Hilbert space operators in terms of ... effect on operator algebra theory (see [12]). .... of functional equations for the proof of new fixed point theorems with applications. By.
Botelho, Fabio
2014-01-01
This book introduces the basic concepts of real and functional analysis. It presents the fundamentals of the calculus of variations, convex analysis, duality, and optimization that are necessary to develop applications to physics and engineering problems. The book includes introductory and advanced concepts in measure and integration, as well as an introduction to Sobolev spaces. The problems presented are nonlinear, with non-convex variational formulation. Notably, the primal global minima may not be attained in some situations, in which cases the solution of the dual problem corresponds to an appropriate weak cluster point of minimizing sequences for the primal one. Indeed, the dual approach more readily facilitates numerical computations for some of the selected models. While intended primarily for applied mathematicians, the text will also be of interest to engineers, physicists, and other researchers in related fields.
Frechet differentiation of nonlinear operators between fuzzy normed spaces
International Nuclear Information System (INIS)
Yilmaz, Yilmaz
2009-01-01
By the rapid advances in linear theory of fuzzy normed spaces and fuzzy bounded linear operators it is natural idea to set and improve its nonlinear peer. We aimed in this work to realize this idea by introducing fuzzy Frechet derivative based on the fuzzy norm definition in Bag and Samanta [Bag T, Samanta SK. Finite dimensional fuzzy normed linear spaces. J Fuzzy Math 2003;11(3):687-705]. The definition is divided into two part as strong and weak fuzzy Frechet derivative so that it is compatible with strong and weak fuzzy continuity of operators. Also we restate fuzzy compact operator definition of Lael and Nouroizi [Lael F, Nouroizi K. Fuzzy compact linear operators. Chaos, Solitons and Fractals 2007;34(5):1584-89] as strongly and weakly fuzzy compact by taking into account the compatibility. We prove also that weak Frechet derivative of a nonlinear weakly fuzzy compact operator is also weakly fuzzy compact.
Stability of Jensen functional equation in intuitionistic fuzzy normed space
International Nuclear Information System (INIS)
Mohiuddine, S.A.
2009-01-01
In this paper, we determine some stability results concerning the Jensen functional equation 2f((x+y)/2)=f(x)+f(y) in intuitionistic fuzzy normed spaces (IFNS). We define the intuitionistic fuzzy continuity of the Jensen mappings and prove that the existence of a solution for any approximately Jensen mapping implies the completeness of IFNS.
A Convex Formulation for Magnetic Particle Imaging X-Space Reconstruction.
Konkle, Justin J; Goodwill, Patrick W; Hensley, Daniel W; Orendorff, Ryan D; Lustig, Michael; Conolly, Steven M
2015-01-01
Magnetic Particle Imaging (mpi) is an emerging imaging modality with exceptional promise for clinical applications in rapid angiography, cell therapy tracking, cancer imaging, and inflammation imaging. Recent publications have demonstrated quantitative mpi across rat sized fields of view with x-space reconstruction methods. Critical to any medical imaging technology is the reliability and accuracy of image reconstruction. Because the average value of the mpi signal is lost during direct-feedthrough signal filtering, mpi reconstruction algorithms must recover this zero-frequency value. Prior x-space mpi recovery techniques were limited to 1d approaches which could introduce artifacts when reconstructing a 3d image. In this paper, we formulate x-space reconstruction as a 3d convex optimization problem and apply robust a priori knowledge of image smoothness and non-negativity to reduce non-physical banding and haze artifacts. We conclude with a discussion of the powerful extensibility of the presented formulation for future applications.
Some normed binomial difference sequence spaces related to the [Formula: see text] spaces.
Song, Meimei; Meng, Jian
2017-01-01
The aim of this paper is to introduce the normed binomial sequence spaces [Formula: see text] by combining the binomial transformation and difference operator, where [Formula: see text]. We prove that these spaces are linearly isomorphic to the spaces [Formula: see text] and [Formula: see text], respectively. Furthermore, we compute Schauder bases and the α -, β - and γ -duals of these sequence spaces.
A note on 'Some results on the IF-normed spaces'
International Nuclear Information System (INIS)
Saadati, Reza
2009-01-01
Recently, Lael and Nourouzi [Some results on the IF-normed spaces. Chaos, Solitons and Fractals 2006; doi:10.1016/j.chaos.2006.10.019] introduced and studied a new notation of IF-normed spaces by using the idea of intuitionistic fuzzy normed spaces due to Saadati and Park [On the intuitionistic fuzzy topological spaces. Chaos, Solitons and Fractals 2006;27:331-44], a special continuous t-norm i.e. min and a special continuous s-norm i.e. max. In this note, we consider the modified definition of IF-normed space i.e. LF-normed spaces and prove the open mapping and closed graph theorems for this space using arbitrary continuous t-norm.
Alabiso, Carlo
2015-01-01
This book is an introduction to the theory of Hilbert space, a fundamental tool for non-relativistic quantum mechanics. Linear, topological, metric, and normed spaces are all addressed in detail, in a rigorous but reader-friendly fashion. The rationale for an introduction to the theory of Hilbert space, rather than a detailed study of Hilbert space theory itself, resides in the very high mathematical difficulty of even the simplest physical case. Within an ordinary graduate course in physics there is insufficient time to cover the theory of Hilbert spaces and operators, as well as distribution theory, with sufficient mathematical rigor. Compromises must be found between full rigor and practical use of the instruments. The book is based on the author's lessons on functional analysis for graduate students in physics. It will equip the reader to approach Hilbert space and, subsequently, rigged Hilbert space, with a more practical attitude. With respect to the original lectures, the mathematical flavor in all sub...
On nonlinear stability in various random normed spaces
Directory of Open Access Journals (Sweden)
Saadati Reza
2011-01-01
Full Text Available Abstract In this article, we prove the nonlinear stability of the quartic functional equation 1 6 f ( x + 4 y + f ( 4 x - y = 3 0 6 9 f x + y 3 + f ( x + 2 y (1 + 1 3 6 f ( x - y - 1 3 9 4 f ( x + y + 4 2 5 f ( y - 1 5 3 0 f ( x (2 (3 in the setting of random normed spaces Furthermore, the interdisciplinary relation among the theory of random spaces, the theory of non-Archimedean space, the theory of fixed point theory, the theory of intuitionistic spaces and the theory of functional equations are also presented in the article.
Directory of Open Access Journals (Sweden)
Meng Wen
2012-01-01
Full Text Available We introduce a new iterative scheme with Meir-Keeler contractions for an asymptotically nonexpansive mapping in -uniformly smooth and strictly convex Banach spaces. We also proved the strong convergence theorems of implicit and explicit schemes. The results obtained in this paper extend and improve many recent ones announced by many others.
Directory of Open Access Journals (Sweden)
Gurucharan Singh Saluja
2010-01-01
Full Text Available In this paper, we give some necessary and sufficient conditions for an implicit iteration process with errors for a finite family of asymptotically quasi-nonexpansive mappings converging to a common fixed of the mappings in convex metric spaces. Our results extend and improve some recent results of Sun, Wittmann, Xu and Ori, and Zhou and Chang.
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
Anisotropic, Mixed-Norm Lizorkin-Triebel Spaces and Diffeomorphic Maps
DEFF Research Database (Denmark)
Johnsen, Jon; Hansen, Sabrina Munch; Sickel, Winfried
2014-01-01
This paper gives general results on invariance of anisotropic Lizorkin-Triebel spaces with mixed norms under coordinate transformations on Euclidean space, open sets, and cylindrical domains.......This paper gives general results on invariance of anisotropic Lizorkin-Triebel spaces with mixed norms under coordinate transformations on Euclidean space, open sets, and cylindrical domains....
International Nuclear Information System (INIS)
Loria Meneses, Luis Guillermo
2012-01-01
Related studies with the presence of NORMs in Costa Rica were developed. CICANUM has had equipment and personnel to perform analysis using gamma spectroscopy (for solid and liquid samples), beta spectroscopy (for liquid milk samples and water), alpha spectroscopy (water samples). These techniques are frequently used in the analysis for food purchased from stores, monitoring, export (safety certicates), directly from the farm (research and projects ARCAL), several matrices (meristems, iron, etc..). The CICANUM supported by the Universidad de Costa Rica and the Laboratorio de Espectroscopia Gamma has participated in various projects by the IAEA, in research on food, marine species, quality assurance, development of reference material. The term NORMs is used to distinguish natural radioactive elements of radioactive elements of anthropogenic origin, among which are those produced by: terrestrial, mediums cosmogenic and industrial. One conclusion is that human activity has been responsible for increasing exposure of people to ionizing radiation. This increase has resulted of the production of coal, natural gas, mining and fossil fuels, and the use of fertilizers. Radon trapped in the rocks is released when performing scans or during extraction. (author) [es
DEFF Research Database (Denmark)
M. Gaspar, Raquel; Murgoci, Agatha
2010-01-01
A convexity adjustment (or convexity correction) in fixed income markets arises when one uses prices of standard (plain vanilla) products plus an adjustment to price nonstandard products. We explain the basic and appealing idea behind the use of convexity adjustments and focus on the situations...
DEFF Research Database (Denmark)
Lauritzen, Niels
-Motzkin elimination, the theory is developed by introducing polyhedra, the double description method and the simplex algorithm, closed convex subsets, convex functions of one and several variables ending with a chapter on convex optimization with the Karush-Kuhn-Tucker conditions, duality and an interior point......Based on undergraduate teaching to students in computer science, economics and mathematics at Aarhus University, this is an elementary introduction to convex sets and convex functions with emphasis on concrete computations and examples. Starting from linear inequalities and Fourier...
DEFF Research Database (Denmark)
Lauritzen, Niels
Based on undergraduate teaching to students in computer science, economics and mathematics at Aarhus University, this is an elementary introduction to convex sets and convex functions with emphasis on concrete computations and examples. Starting from linear inequalities and Fourier-Motzkin elimin......Based on undergraduate teaching to students in computer science, economics and mathematics at Aarhus University, this is an elementary introduction to convex sets and convex functions with emphasis on concrete computations and examples. Starting from linear inequalities and Fourier......-Motzkin elimination, the theory is developed by introducing polyhedra, the double description method and the simplex algorithm, closed convex subsets, convex functions of one and several variables ending with a chapter on convex optimization with the Karush-Kuhn-Tucker conditions, duality and an interior point...... algorithm....
Parthood and Convexity as the Basic Notions of a Theory of Space
DEFF Research Database (Denmark)
Robering, Klaus
A deductive system of geometry is presented which is based on atomistic mereology ("mereology with points'') and the notion of convexity. The system is formulated in a liberal many-sorted logic which makes use of class-theoretic notions without however adopting any comprehension axioms. The geome...
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
Stability of Pexiderized Quadratic Functional Equation in Random 2-Normed Spaces
Directory of Open Access Journals (Sweden)
Mohammed A. Alghamdi
2015-01-01
Full Text Available The aim of this paper is to investigate the stability of Hyers-Ulam-Rassias type theorems by considering the pexiderized quadratic functional equation in the setting of random 2-normed spaces (RTNS, while the concept of random 2-normed space has been recently studied by Goleţ (2005.
Fixed Point of Generalized Eventual Cyclic Gross in Fuzzy Norm Spaces for Contractive Mappings
Directory of Open Access Journals (Sweden)
S. A. M. Mohsenialhosseini
2015-01-01
Full Text Available We define generalized eventual cyclic gross contractive mapping in fuzzy norm spaces, which is a generalization of the eventual cyclic gross contractions. Also we prove the existence of a fixed point for this type of contractive mapping on fuzzy norm spaces.
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...
DEFF Research Database (Denmark)
Jacob, Riko
We determine the computational complexity of the dynamic convex hull problem in the planar case. We present a data structure that maintains a finite set of n points in the plane under insertion and deletion of points in amortized O(log n) time per operation. The space usage of the data structure...... is O(n). The data structure supports extreme point queries in a given direction, tangent queries through a given point, and queries for the neighboring points on the convex hull in O(log n) time. The extreme point queries can be used to decide whether or not a given line intersects the convex hull......, and the tangent queries to determine whether a given point is inside the convex hull. The space usage of the data structure is O(n). We give a lower bound on the amortized asymptotic time complexity that matches the performance of this data structure....
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.
Displacement Convexity for First-Order Mean-Field Games
Seneci, Tommaso
2018-01-01
Finally, we identify a large class of functions, that depend on solutions of MFGs, which are convex in time. Among these, we find several norms. This convexity gives bounds for the density of solutions of the planning problem.
On the areas of various bodies in the Euclidean space: The case of irregular convex polygons
International Nuclear Information System (INIS)
Ozoemena, P.C.
1988-11-01
A theorem is proposed for the areas of n-sided irregular convex polygons, of given length of sides. The theorem is illustrated as a simple but powerful one in estimating the areas of irregular polygons, being dependent only on the number of sides n (and not on any of the explicit angles) of the irregular polygon. Finally, because of the global symmetry shown by equilateral triangles, squares and circles under group (gauge) theory, the relationships governing their areas, when they are inscribed or escribed in one another are discussed as riders, and some areas of their applications in graph theory, ratios and maxima and minima problems of differential calculus briefly mentioned. (author). 11 refs, 6 figs, 1 tab
International Nuclear Information System (INIS)
Chavet, I.
1987-01-01
A plasma source fitted with a circular orifice and emitting a space charge limited ion current can be made to operate with a convex spherical plasma boundary (meniscus) by appropriately adjusting its extraction parameters. In this case, the diameter of the virtual source behind the meniscus is much smaller than the orifice diameter. The effective value of this virtual source diameter depends significantly on various practical factors that are more or less controllable. Its lower ideal limit, however, depends only on the radio δ of the interelectrode distance to the meniscus curvature radius and on the ratio ω of the initial to final ion energy. This ideal limit is given for the ranges 0.1 ≤ δ ≤ 10 and 10 -7 ≤ ω ≤ 10 -3 . Preliminary experimental results are reported. (orig.)
DEFF Research Database (Denmark)
Brodal, Gerth Stølfting; Jacob, Rico
2002-01-01
In this paper we determine the computational complexity of the dynamic convex hull problem in the planar case. We present a data structure that maintains a finite set of n points in the plane under insertion and deletion of points in amortized O(log n) time per operation. The space usage of the d......In this paper we determine the computational complexity of the dynamic convex hull problem in the planar case. We present a data structure that maintains a finite set of n points in the plane under insertion and deletion of points in amortized O(log n) time per operation. The space usage...... of the data structure is O(n). The data structure supports extreme point queries in a given direction, tangent queries through a given point, and queries for the neighboring points on the convex hull in O(log n) time. The extreme point queries can be used to decide whether or not a given line intersects...... the convex hull, and the tangent queries to determine whether a given point is inside the convex hull. We give a lower bound on the amortized asymptotic time complexity that matches the performance of this data structure....
Probabilistic n-normed spaces, D-n-compact sets and D-n-bounded sets
International Nuclear Information System (INIS)
Pourmoslemi, A.; Salimi, M.
2009-01-01
In this paper, first we define and study the probabilistic n-normed spaces and D-n-compactness, also we prove some theorems and inequalities. In the next section we define D-n-boundedness and prove some results in relation between D-n-compact and D-n-bounded sets in these spaces.
Energy Technology Data Exchange (ETDEWEB)
Sasaki, Makoto [Iwate Medical University, Department of Radiology, Morioka (Japan); Honda, Satoshi [St. Luke' s International Hospital, Department of Radiology, Tokyo (Japan); Yuasa, Tatsuhiko; Iwamura, Akihide [Kohnodai Hospital, National Center of Neurology and Psychiatry, Department of Neurology, Ichikawa (Japan); Shibata, Eri [Iwate Medical University, Department of Neuropsychiatry, Morioka (Japan); Ohba, Hideki [Iwate Medical University, Department of Neurology, Morioka (Japan)
2008-02-15
The aim of this study was to determine the performance of axial and coronal magnetic resonance imaging (MRI) in detecting the narrowing of the cerebrospinal fluid (CSF) space at the high convexity and high midline areas, which is speculated to be one of the clinical characteristics of idiopathic normal pressure hydrocephalus (iNPH). We retrospectively examined axial and coronal T1-weighted images of 14 iNPH patients and 12 age-matched controls. The narrowness of the CSF space at the high convexity/midline was blindly evaluated by five raters using a continuous confidence rating scale for receiver operating characteristic (ROC) analysis. Axial and coronal imaging accurately determined the presence of the narrow cisterns/sulci at the high convexity/midline and was capable of predicting probable/definite iNPH with a high degree of accuracy. there were also no significant differences in the detection of this finding between the axial and coronal images. Both axial and coronal T1-weighted MRI can detect the narrow CSF space at the high convexity/midline accurately and may therefore facilitate clinicians in choosing a management strategy for iNPH patients. (orig.)
International Nuclear Information System (INIS)
Sasaki, Makoto; Honda, Satoshi; Yuasa, Tatsuhiko; Iwamura, Akihide; Shibata, Eri; Ohba, Hideki
2008-01-01
The aim of this study was to determine the performance of axial and coronal magnetic resonance imaging (MRI) in detecting the narrowing of the cerebrospinal fluid (CSF) space at the high convexity and high midline areas, which is speculated to be one of the clinical characteristics of idiopathic normal pressure hydrocephalus (iNPH). We retrospectively examined axial and coronal T1-weighted images of 14 iNPH patients and 12 age-matched controls. The narrowness of the CSF space at the high convexity/midline was blindly evaluated by five raters using a continuous confidence rating scale for receiver operating characteristic (ROC) analysis. Axial and coronal imaging accurately determined the presence of the narrow cisterns/sulci at the high convexity/midline and was capable of predicting probable/definite iNPH with a high degree of accuracy. there were also no significant differences in the detection of this finding between the axial and coronal images. Both axial and coronal T1-weighted MRI can detect the narrow CSF space at the high convexity/midline accurately and may therefore facilitate clinicians in choosing a management strategy for iNPH patients. (orig.)
Deformation quantization and Borel´s theorem in locally convex spaces
Czech Academy of Sciences Publication Activity Database
Engliš, Miroslav; Taskinen, J.
2007-01-01
Roč. 180, č. 1 (2007), s. 77-93 ISSN 0039-3223 R&D Projects: GA ČR GA201/03/0041 Institutional research plan: CEZ:AV0Z10190503 Keywords : Berezin-Toeplitz quantization * Borel theorem * Frechet space Subject RIV: BA - General Mathematics Impact factor: 0.568, year: 2007
Directory of Open Access Journals (Sweden)
Tong-Huei Chang
2009-01-01
Full Text Available We use a concept of abstract convexity to define the almost S-KKM𝒞 property, al-S-KKM𝒞(X,Y family, and almost Φ-spaces. We get some new approximate fixed point theorems and fixed point theorems in almost Φ-spaces. Our results extend some results of other authors.
International Nuclear Information System (INIS)
Vu Ngoc Phat; Jong Yeoul Park
1995-10-01
The paper studies a class of set-values operators with emphasis on properties of their adjoints and existence of eigenvalues and eigenvectors of infinite-dimensional convex closed set-valued operators. Sufficient conditions for existence of eigenvalues and eigenvectors of set-valued convex closed operators are derived. These conditions specify possible features of control problems. The results are applied to some constrained control problems of infinite-dimensional systems described by discrete-time inclusions whose right-hand-sides are convex closed set- valued functions. (author). 8 refs
On approximation and energy estimates for delta 6-convex functions.
Saleem, Muhammad Shoaib; Pečarić, Josip; Rehman, Nasir; Khan, Muhammad Wahab; Zahoor, Muhammad Sajid
2018-01-01
The smooth approximation and weighted energy estimates for delta 6-convex functions are derived in this research. Moreover, we conclude that if 6-convex functions are closed in uniform norm, then their third derivatives are closed in weighted [Formula: see text]-norm.
On approximation and energy estimates for delta 6-convex functions
Directory of Open Access Journals (Sweden)
Muhammad Shoaib Saleem
2018-02-01
Full Text Available Abstract The smooth approximation and weighted energy estimates for delta 6-convex functions are derived in this research. Moreover, we conclude that if 6-convex functions are closed in uniform norm, then their third derivatives are closed in weighted L2 $L^{2}$-norm.
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...
Contractive maps on normed linear spaces and their applications to nonlinear matrix equations.
Reurings, M.C.B.
2017-01-01
In this paper the author gives necessary and sufficient conditions under which a map is a contraction on a certain subset of a normed linear space. These conditions are already well known for maps on intervals in R. Using the conditions and Banach's fixed point theorem a fixed point theorem can be
Negative norm states in de Sitter space and QFT without renormalization procedure
International Nuclear Information System (INIS)
Takook, M.V.
2002-01-01
In recent papers, 1,2 it has been shown that the presence of negative norm states or negative frequency solutions are indispensable for a fully covariant quantization of the minimally coupled scalar field in de Sitter space. Their presence, while leaving unchanged the physical content of the theory, offers the advantage of eliminating any ultraviolet divergence in the vacuum energy 2 and infrared divergence in the two point function. 3 We attempt here to extend this method to the interacting quantum field in Minkowski space-time. As an illustration of the procedure, we consider the λϕ 4 theory in Minkowski space-time. The mathematical consequences of this method is the disappearance of the ultraviolet divergence to the one-loop approximation. This means, the effect of these auxiliary negative norm states is to allow an automatic renormalization of the theory in this approximation. (author)
Fixed point theorems in locally convex spacesÃ¢Â€Â”the Schauder mapping method
Directory of Open Access Journals (Sweden)
S. Cobzaş
2006-03-01
Full Text Available In the appendix to the book by F. F. Bonsal, Lectures on Some Fixed Point Theorems of Functional Analysis (Tata Institute, Bombay, 1962 a proof by Singbal of the Schauder-Tychonoff fixed point theorem, based on a locally convex variant of Schauder mapping method, is included. The aim of this note is to show that this method can be adapted to yield a proof of Kakutani fixed point theorem in the locally convex case. For the sake of completeness we include also the proof of Schauder-Tychonoff theorem based on this method. As applications, one proves a theorem of von Neumann and a minimax result in game theory.
The Role of Familiarity for Representations in Norm-Based Face Space.
Faerber, Stella J; Kaufmann, Jürgen M; Leder, Helmut; Martin, Eva Maria; Schweinberger, Stefan R
2016-01-01
According to the norm-based version of the multidimensional face space model (nMDFS, Valentine, 1991), any given face and its corresponding anti-face (which deviates from the norm in exactly opposite direction as the original face) should be equidistant to a hypothetical prototype face (norm), such that by definition face and anti-face should bear the same level of perceived typicality. However, it has been argued that familiarity affects perceived typicality and that representations of familiar faces are qualitatively different (e.g., more robust and image-independent) from those for unfamiliar faces. Here we investigated the role of face familiarity for rated typicality, using two frequently used operationalisations of typicality (deviation-based: DEV), and distinctiveness (face in the crowd: FITC) for faces of celebrities and their corresponding anti-faces. We further assessed attractiveness, likeability and trustworthiness ratings of the stimuli, which are potentially related to typicality. For unfamiliar faces and their corresponding anti-faces, in line with the predictions of the nMDFS, our results demonstrate comparable levels of perceived typicality (DEV). In contrast, familiar faces were perceived much less typical than their anti-faces. Furthermore, familiar faces were rated higher than their anti-faces in distinctiveness, attractiveness, likability and trustworthiness. These findings suggest that familiarity strongly affects the distribution of facial representations in norm-based face space. Overall, our study suggests (1) that familiarity needs to be considered in studies of mental representations of faces, and (2) that familiarity, general distance-to-norm and more specific vector directions in face space make different and interactive contributions to different types of facial evaluations.
The Role of Familiarity for Representations in Norm-Based Face Space.
Directory of Open Access Journals (Sweden)
Stella J Faerber
Full Text Available According to the norm-based version of the multidimensional face space model (nMDFS, Valentine, 1991, any given face and its corresponding anti-face (which deviates from the norm in exactly opposite direction as the original face should be equidistant to a hypothetical prototype face (norm, such that by definition face and anti-face should bear the same level of perceived typicality. However, it has been argued that familiarity affects perceived typicality and that representations of familiar faces are qualitatively different (e.g., more robust and image-independent from those for unfamiliar faces. Here we investigated the role of face familiarity for rated typicality, using two frequently used operationalisations of typicality (deviation-based: DEV, and distinctiveness (face in the crowd: FITC for faces of celebrities and their corresponding anti-faces. We further assessed attractiveness, likeability and trustworthiness ratings of the stimuli, which are potentially related to typicality. For unfamiliar faces and their corresponding anti-faces, in line with the predictions of the nMDFS, our results demonstrate comparable levels of perceived typicality (DEV. In contrast, familiar faces were perceived much less typical than their anti-faces. Furthermore, familiar faces were rated higher than their anti-faces in distinctiveness, attractiveness, likability and trustworthiness. These findings suggest that familiarity strongly affects the distribution of facial representations in norm-based face space. Overall, our study suggests (1 that familiarity needs to be considered in studies of mental representations of faces, and (2 that familiarity, general distance-to-norm and more specific vector directions in face space make different and interactive contributions to different types of facial evaluations.
Parekh, Ankit
Sparsity has become the basis of some important signal processing methods over the last ten years. Many signal processing problems (e.g., denoising, deconvolution, non-linear component analysis) can be expressed as inverse problems. Sparsity is invoked through the formulation of an inverse problem with suitably designed regularization terms. The regularization terms alone encode sparsity into the problem formulation. Often, the ℓ1 norm is used to induce sparsity, so much so that ℓ1 regularization is considered to be `modern least-squares'. The use of ℓ1 norm, as a sparsity-inducing regularizer, leads to a convex optimization problem, which has several benefits: the absence of extraneous local minima, well developed theory of globally convergent algorithms, even for large-scale problems. Convex regularization via the ℓ1 norm, however, tends to under-estimate the non-zero values of sparse signals. In order to estimate the non-zero values more accurately, non-convex regularization is often favored over convex regularization. However, non-convex regularization generally leads to non-convex optimization, which suffers from numerous issues: convergence may be guaranteed to only a stationary point, problem specific parameters may be difficult to set, and the solution is sensitive to the initialization of the algorithm. The first part of this thesis is aimed toward combining the benefits of non-convex regularization and convex optimization to estimate sparse signals more effectively. To this end, we propose to use parameterized non-convex regularizers with designated non-convexity and provide a range for the non-convex parameter so as to ensure that the objective function is strictly convex. By ensuring convexity of the objective function (sum of data-fidelity and non-convex regularizer), we can make use of a wide variety of convex optimization algorithms to obtain the unique global minimum reliably. The second part of this thesis proposes a non-linear signal
Hao, Xiao-Hu; Zhang, Gui-Jun; Zhou, Xiao-Gen; Yu, Xu-Feng
2016-01-01
To address the searching problem of protein conformational space in ab-initio protein structure prediction, a novel method using abstract convex underestimation (ACUE) based on the framework of evolutionary algorithm was proposed. Computing such conformations, essential to associate structural and functional information with gene sequences, is challenging due to the high-dimensionality and rugged energy surface of the protein conformational space. As a consequence, the dimension of protein conformational space should be reduced to a proper level. In this paper, the high-dimensionality original conformational space was converted into feature space whose dimension is considerably reduced by feature extraction technique. And, the underestimate space could be constructed according to abstract convex theory. Thus, the entropy effect caused by searching in the high-dimensionality conformational space could be avoided through such conversion. The tight lower bound estimate information was obtained to guide the searching direction, and the invalid searching area in which the global optimal solution is not located could be eliminated in advance. Moreover, instead of expensively calculating the energy of conformations in the original conformational space, the estimate value is employed to judge if the conformation is worth exploring to reduce the evaluation time, thereby making computational cost lower and the searching process more efficient. Additionally, fragment assembly and the Monte Carlo method are combined to generate a series of metastable conformations by sampling in the conformational space. The proposed method provides a novel technique to solve the searching problem of protein conformational space. Twenty small-to-medium structurally diverse proteins were tested, and the proposed ACUE method was compared with It Fix, HEA, Rosetta and the developed method LEDE without underestimate information. Test results show that the ACUE method can more rapidly and more
On Convex Quadratic Approximation
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
Scott, Paul
2006-01-01
A "convex" polygon is one with no re-entrant angles. Alternatively one can use the standard convexity definition, asserting that for any two points of the convex polygon, the line segment joining them is contained completely within the polygon. In this article, the author provides a solution to a problem involving convex lattice polygons.
Niemi, Antti H.; Collier, Nathan; Calo, Victor M.
2013-01-01
We investigate the application of the discontinuous Petrov-Galerkin (DPG) finite element framework to stationary convection-diffusion problems. In particular, we demonstrate how the quasi-optimal test space norm improves the robustness of the DPG method with respect to vanishing diffusion. We numerically compare coarse-mesh accuracy of the approximation when using the quasi-optimal norm, the standard norm, and the weighted norm. Our results show that the quasi-optimal norm leads to more accurate results on three benchmark problems in two spatial dimensions. We address the problems associated to the resolution of the optimal test functions with respect to the quasi-optimal norm by studying their convergence numerically. In order to facilitate understanding of the method, we also include a detailed explanation of the methodology from the algorithmic point of view. © 2013 Elsevier Ltd. All rights reserved.
Niemi, Antti H.
2013-12-01
We investigate the application of the discontinuous Petrov-Galerkin (DPG) finite element framework to stationary convection-diffusion problems. In particular, we demonstrate how the quasi-optimal test space norm improves the robustness of the DPG method with respect to vanishing diffusion. We numerically compare coarse-mesh accuracy of the approximation when using the quasi-optimal norm, the standard norm, and the weighted norm. Our results show that the quasi-optimal norm leads to more accurate results on three benchmark problems in two spatial dimensions. We address the problems associated to the resolution of the optimal test functions with respect to the quasi-optimal norm by studying their convergence numerically. In order to facilitate understanding of the method, we also include a detailed explanation of the methodology from the algorithmic point of view. © 2013 Elsevier Ltd. All rights reserved.
DEFF Research Database (Denmark)
Johnsen, Jon
The article deals with a simplified proof of the Sobolev embedding theorem for Triebel-Lizorkin spaces (that contain the $L_p$-Sobolev spaces $H^s_p$ as special cases). The method extends to a proof of the corresponding fact for general Triebel–Lizorkin spaces based on mixed $L_p$-norms...
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 ...
Aichholzer, Oswin; Aurenhammer, Franz; Hurtado Díaz, Fernando Alfredo; Ramos, Pedro A.; Urrutia, J.
2009-01-01
We introduce a notion of k-convexity and explore some properties of polygons that have this property. In particular, 2-convex polygons can be recognized in O(n log n) time, and k-convex polygons can be triangulated in O(kn) time.
Indian Academy of Sciences (India)
general setting of the space CL(X, Y ) of all continuous linear mappings from a normed cone (X, p) to a normed cone (Y, q), extending several well-known results related to open continuous linear mappings between normed linear spaces. Keywords. Normed cone; extended quasi-metric; continuous linear mapping; bicom-.
Geometry of isotropic convex bodies
Brazitikos, Silouanos; Valettas, Petros; Vritsiou, Beatrice-Helen
2014-01-01
The study of high-dimensional convex bodies from a geometric and analytic point of view, with an emphasis on the dependence of various parameters on the dimension stands at the intersection of classical convex geometry and the local theory of Banach spaces. It is also closely linked to many other fields, such as probability theory, partial differential equations, Riemannian geometry, harmonic analysis and combinatorics. It is now understood that the convexity assumption forces most of the volume of a high-dimensional convex body to be concentrated in some canonical way and the main question is whether, under some natural normalization, the answer to many fundamental questions should be independent of the dimension. The aim of this book is to introduce a number of well-known questions regarding the distribution of volume in high-dimensional convex bodies, which are exactly of this nature: among them are the slicing problem, the thin shell conjecture and the Kannan-Lov�sz-Simonovits conjecture. This book prov...
Niemi, Antti; Collier, Nathan; Calo, Victor M.
2013-01-01
We revisit the finite element analysis of convection-dominated flow problems within the recently developed Discontinuous Petrov-Galerkin (DPG) variational framework. We demonstrate how test function spaces that guarantee numerical stability can be computed automatically with respect to the optimal test space norm. This makes the DPG method not only stable but also robust, that is, uniformly stable with respect to the Péclet number in the current application. We employ discontinuous piecewise Bernstein polynomials as trial functions and construct a subgrid discretization that accounts for the singular perturbation character of the problem to resolve the corresponding optimal test functions. We also show that a smooth B-spline basis has certain computational advantages in the subgrid discretization. The overall effectiveness of the algorithm is demonstrated on two problems for the linear advection-diffusion equation. © 2011 Elsevier B.V.
Niemi, Antti
2013-05-01
We revisit the finite element analysis of convection-dominated flow problems within the recently developed Discontinuous Petrov-Galerkin (DPG) variational framework. We demonstrate how test function spaces that guarantee numerical stability can be computed automatically with respect to the optimal test space norm. This makes the DPG method not only stable but also robust, that is, uniformly stable with respect to the Péclet number in the current application. We employ discontinuous piecewise Bernstein polynomials as trial functions and construct a subgrid discretization that accounts for the singular perturbation character of the problem to resolve the corresponding optimal test functions. We also show that a smooth B-spline basis has certain computational advantages in the subgrid discretization. The overall effectiveness of the algorithm is demonstrated on two problems for the linear advection-diffusion equation. © 2011 Elsevier B.V.
Nezir, Veysel; Mustafa, Nizami
2017-04-01
In 2008, P.K. Lin provided the first example of a nonreflexive space that can be renormed to have fixed point property for nonexpansive mappings. This space was the Banach space of absolutely summable sequences l1 and researchers aim to generalize this to c0, Banach space of null sequences. Before P.K. Lin's intriguing result, in 1979, Goebel and Kuczumow showed that there is a large class of non-weak* compact closed, bounded, convex subsets of l1 with fixed point property for nonexpansive mappings. Then, P.K. Lin inspired by Goebel and Kuczumow's ideas to give his result. Similarly to P.K. Lin's study, Hernández-Linares worked on L1 and in his Ph.D. thesis, supervisored under Maria Japón, showed that L1 can be renormed to have fixed point property for affine nonexpansive mappings. Then, related questions for c0 have been considered by researchers. Recently, Nezir constructed several equivalent norms on c0 and showed that there are non-weakly compact closed, bounded, convex subsets of c0 with fixed point property for affine nonexpansive mappings. In this study, we construct a family of equivalent norms containing those developed by Nezir as well and show that there exists a large class of non-weakly compact closed, bounded, convex subsets of c0 with fixed point property for affine nonexpansive mappings.
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.
Convexity and Marginal Vectors
van Velzen, S.; Hamers, H.J.M.; Norde, H.W.
2002-01-01
In this paper we construct sets of marginal vectors of a TU game with the property that if the marginal vectors from these sets are core elements, then the game is convex.This approach leads to new upperbounds on the number of marginal vectors needed to characterize convexity.An other result is that
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
Amemiya norm equals Orlicz norm in general
Hudzik, Henryk; Maligranda, Lech
2000-01-01
The authors present a proof that in Orlicz spaces the Amemiya norm and the Orlicz norm coincide for any Orlicz function $\\varphi$. This gives the answer for an open problem. They also give a description of the Amemiya type for the Mazur-Orlicz $F$-norm.
Salt-body Inversion with Minimum Gradient Support and Sobolev Space Norm Regularizations
Kazei, Vladimir
2017-05-26
Full-waveform inversion (FWI) is a technique which solves the ill-posed seismic inversion problem of fitting our model data to the measured ones from the field. FWI is capable of providing high-resolution estimates of the model, and of handling wave propagation of arbitrary complexity (visco-elastic, anisotropic); yet, it often fails to retrieve high-contrast geological structures, such as salt. One of the reasons for the FWI failure is that the updates at earlier iterations are too smooth to capture the sharp edges of the salt boundary. We compare several regularization approaches, which promote sharpness of the edges. Minimum gradient support (MGS) regularization focuses the inversion on blocky models, even more than the total variation (TV) does. However, both approaches try to invert undesirable high wavenumbers in the model too early for a model of complex structure. Therefore, we apply the Sobolev space norm as a regularizing term in order to maintain a balance between sharp and smooth updates in FWI. We demonstrate the application of these regularizations on a Marmousi model, enriched by a chunk of salt. The model turns out to be too complex in some parts to retrieve its full velocity distribution, yet the salt shape and contrast are retrieved.
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.
Convex Banding of the Covariance Matrix.
Bien, Jacob; Bunea, Florentina; Xiao, Luo
2016-01-01
We introduce a new sparse estimator of the covariance matrix for high-dimensional models in which the variables have a known ordering. Our estimator, which is the solution to a convex optimization problem, is equivalently expressed as an estimator which tapers the sample covariance matrix by a Toeplitz, sparsely-banded, data-adaptive matrix. As a result of this adaptivity, the convex banding estimator enjoys theoretical optimality properties not attained by previous banding or tapered estimators. In particular, our convex banding estimator is minimax rate adaptive in Frobenius and operator norms, up to log factors, over commonly-studied classes of covariance matrices, and over more general classes. Furthermore, it correctly recovers the bandwidth when the true covariance is exactly banded. Our convex formulation admits a simple and efficient algorithm. Empirical studies demonstrate its practical effectiveness and illustrate that our exactly-banded estimator works well even when the true covariance matrix is only close to a banded matrix, confirming our theoretical results. Our method compares favorably with all existing methods, in terms of accuracy and speed. We illustrate the practical merits of the convex banding estimator by showing that it can be used to improve the performance of discriminant analysis for classifying sound recordings.
Generalized Convexity and Inequalities
Anderson, G. D.; Vamanamurthy, M. K.; Vuorinen, M.
2007-01-01
Let R+ = (0,infinity) and let M be the family of all mean values of two numbers in R+ (some examples are the arithmetic, geometric, and harmonic means). Given m1, m2 in M, we say that a function f : R+ to R+ is (m1,m2)-convex if f(m1(x,y)) < or = m2(f(x),f(y)) for all x, y in R+ . The usual convexity is the special case when both mean values are arithmetic means. We study the dependence of (m1,m2)-convexity on m1 and m2 and give sufficient conditions for (m1,m2)-convexity of functions defined...
Niemi, Antti
2011-05-14
We revisit the finite element analysis of convection dominated flow problems within the recently developed Discontinuous Petrov-Galerkin (DPG) variational framework. We demonstrate how test function spaces that guarantee numerical stability can be computed automatically with respect to the so called optimal test space norm by using an element subgrid discretization. This should make the DPG method not only stable but also robust, that is, uniformly stable with respect to the Ṕeclet number in the current application. The e_ectiveness of the algorithm is demonstrated on two problems for the linear advection-di_usion equation.
Hörmander, Lars
1994-01-01
The first two chapters of this book are devoted to convexity in the classical sense, for functions of one and several real variables respectively. This gives a background for the study in the following chapters of related notions which occur in the theory of linear partial differential equations and complex analysis such as (pluri-)subharmonic functions, pseudoconvex sets, and sets which are convex for supports or singular supports with respect to a differential operator. In addition, the convexity conditions which are relevant for local or global existence of holomorphic differential equations are discussed, leading up to Trépreau’s theorem on sufficiency of condition (capital Greek letter Psi) for microlocal solvability in the analytic category. At the beginning of the book, no prerequisites are assumed beyond calculus and linear algebra. Later on, basic facts from distribution theory and functional analysis are needed. In a few places, a more extensive background in differential geometry or pseudodiffer...
A note on convex renorming and fragmentability
Indian Academy of Sciences (India)
R. Narasimhan (Krishtel eMaging) 1461 1996 Oct 15 13:05:22
Abstract. Using the game approach to fragmentability, we give new and simpler proofs of the following known results: (a) If the Banach space admits an equivalent. Kadec norm, then its weak topology is fragmented by a metric which is stronger than the norm topology. (b) If the Banach space admits an equivalent rotund ...
Indian Academy of Sciences (India)
for all t E [0,1] and all x, y (in the domain of definition of f). ... Proof: (a) is a consequence of the definition. (b) Define conv(S) ... More generally, a set F is said to be a face of the convex .... and bounded, and assume the validity (for a proof, see.
Displacement Convexity for First-Order Mean-Field Games
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.
Tropicalized Lambda Lengths, Measured Laminations and Convexity
DEFF Research Database (Denmark)
C. Penner, R.
This work uncovers the tropical analogue for measured laminations of the convex hull construction of decorated Teichmueller theory, namely, it is a study in coordinates of geometric degeneration to a point of Thurston's boundary for Teichmueller space. This may offer a paradigm for the extension ...
Pluripotential theory and convex bodies
Bayraktar, T.; Bloom, T.; Levenberg, N.
2018-03-01
A seminal paper by Berman and Boucksom exploited ideas from complex geometry to analyze the asymptotics of spaces of holomorphic sections of tensor powers of certain line bundles L over compact, complex manifolds as the power grows. This yielded results on weighted polynomial spaces in weighted pluripotential theory in {C}^d. Here, motivated by a recent paper by the first author on random sparse polynomials, we work in the setting of weighted pluripotential theory arising from polynomials associated to a convex body in ({R}^+)^d. These classes of polynomials need not occur as sections of tensor powers of a line bundle L over a compact, complex manifold. We follow the approach of Berman and Boucksom to obtain analogous results. Bibliography: 16 titles.
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...
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.
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
DEFF Research Database (Denmark)
Cleanthous, Galatia; Georgiadis, Athanasios; Nielsen, Morten
2018-01-01
. Molecular decompositions for all the considered spaces are derived with the help of the algebra of almost diagonal operators. As an application, we obtain boundedness results on the considered spaces for Fourier multipliers and for pseudodifferential operators with suitable adapted homogeneous symbols using...
Characteristic of monotonicity of Orlicz function spaces equipped with the Orlicz norm
Czech Academy of Sciences Publication Activity Database
Foralewski, P.; Hudzik, H.; Kaczmarek, R.; Krbec, Miroslav
2013-01-01
Roč. 53, č. 2 (2013), s. 421-432 ISSN 0373-8299 R&D Projects: GA ČR GAP201/10/1920 Institutional support: RVO:67985840 Keywords : Orlicz space * Köthe space * characteristic of monotonicity Subject RIV: BA - General Mathematics
Normed Orlicz function spaces which can be quasi-renormed with easily calculable quasinorms
Czech Academy of Sciences Publication Activity Database
Foralewski, P.; Hudzik, H.; Kaczmarek, R.; Krbec, Miroslav
2017-01-01
Roč. 11, č. 3 (2017), s. 636-660 ISSN 1735-8787 Institutional support: RVO:67985840 Keywords : embeddings into Lebesgue and weighted Lebesgue spaces * Orlicz spaces * quasinorms Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics Impact factor: 0.833, year: 2016 http://projecteuclid.org/euclid.bjma/1496973700
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.
Convex geometry of quantum resource quantification
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 \
Equivalence of norms of Riesz potential and fractional maximal function in generalized Morrey spaces
Czech Academy of Sciences Publication Activity Database
Gogatishvili, Amiran; Mustafayev, R.Ch.
2012-01-01
Roč. 63, č. 1 (2012), s. 11-28 ISSN 0010-0757 R&D Projects: GA ČR GA201/08/0383 Institutional research plan: CEZ:AV0Z10190503 Keywords : generalized Morrey spaces * Riesz potential * fractional maximal operator Subject RIV: BA - General Mathematics Impact factor: 0.786, year: 2012 http://www.springerlink.com/content/w71502055j266878/
Convex games versus clan games
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
Convex Games versus Clan Games
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
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...
Nested convex bodies are chaseable
N. Bansal (Nikhil); M. Böhm (Martin); M. Eliáš (Marek); G. Koumoutsos (Grigorios); S.W. Umboh (Seeun William)
2018-01-01
textabstractIn the Convex Body Chasing problem, we are given an initial point v0 2 Rd and an online sequence of n convex bodies F1; : : : ; Fn. When we receive Fi, we are required to move inside Fi. Our goal is to minimize the total distance traveled. This fundamental online problem was first
Directory of Open Access Journals (Sweden)
Ayhan Esi
2013-01-01
Full Text Available In this article, we have introduced the idea of statistically convergent generalized difference lacunary double sequence spaces [¯w2 (M, Δn, p,q]θ, [¯w2 (M, Δn, p,q]θ and defined over a semi norm space (X, q. Also we have study some basic properties and obtained some inclusion relations between them.
Weidemaier, P.
2005-06-01
The trace problem on the hypersurface y_n=0 is investigated for a function u=u(y,t) \\in L_q(0,T;W_{\\underline p}^{\\underline m}(\\mathbb R_+^n)) with \\partial_t u \\in L_q(0,T; L_{\\underline p}(\\mathbb R_+^n)), that is, Sobolev spaces with mixed Lebesgue norm L_{\\underline p,q}(\\mathbb R^n_+\\times(0,T))=L_q(0,T;L_{\\underline p}(\\mathbb R_+^n)) are considered; here \\underline p=(p_1,\\dots,p_n) is a vector and \\mathbb R^n_+=\\mathbb R^{n-1} \\times (0,\\infty). Such function spaces are useful in the context of parabolic equations. They allow, in particular, different exponents of summability in space and time. It is shown that the sharp regularity of the trace in the time variable is characterized by the Lizorkin-Triebel space F_{q,p_n}^{1-1/(p_nm_n)}(0,T;L_{\\widetilde{\\underline p}}(\\mathbb R^{n-1})), \\underline p=(\\widetilde{\\underline p},p_n). A similar result is established for first order spatial derivatives of u. These results allow one to determine the exact spaces for the data in the inhomogeneous Dirichlet and Neumann problems for parabolic equations of the second order if the solution is in the space L_q(0,T; W_p^2(\\Omega)) \\cap W_q^1(0,T;L_p(\\Omega)) with p \\le q.
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...
Convex blind image deconvolution with inverse filtering
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.
Modern methods in topological vector spaces
Wilansky, Albert
2013-01-01
Designed for a one-year course in topological vector spaces, this text is geared toward advanced undergraduates and beginning graduate students of mathematics. The subjects involve properties employed by researchers in classical analysis, differential and integral equations, distributions, summability, and classical Banach and Frechét spaces. Optional problems with hints and references introduce non-locally convex spaces, Köthe-Toeplitz spaces, Banach algebra, sequentially barrelled spaces, and norming subspaces.Extensive introductory chapters cover metric ideas, Banach space, topological vect
Pattern Discovery in Brain Imaging Genetics via SCCA Modeling with a Generic Non-convex Penalty.
Du, Lei; Liu, Kefei; Yao, Xiaohui; Yan, Jingwen; Risacher, Shannon L; Han, Junwei; Guo, Lei; Saykin, Andrew J; Shen, Li
2017-10-25
Brain imaging genetics intends to uncover associations between genetic markers and neuroimaging quantitative traits. Sparse canonical correlation analysis (SCCA) can discover bi-multivariate associations and select relevant features, and is becoming popular in imaging genetic studies. The L1-norm function is not only convex, but also singular at the origin, which is a necessary condition for sparsity. Thus most SCCA methods impose [Formula: see text]-norm onto the individual feature or the structure level of features to pursuit corresponding sparsity. However, the [Formula: see text]-norm penalty over-penalizes large coefficients and may incurs estimation bias. A number of non-convex penalties are proposed to reduce the estimation bias in regression tasks. But using them in SCCA remains largely unexplored. In this paper, we design a unified non-convex SCCA model, based on seven non-convex functions, for unbiased estimation and stable feature selection simultaneously. We also propose an efficient optimization algorithm. The proposed method obtains both higher correlation coefficients and better canonical loading patterns. Specifically, these SCCA methods with non-convex penalties discover a strong association between the APOE e4 rs429358 SNP and the hippocampus region of the brain. They both are Alzheimer's disease related biomarkers, indicating the potential and power of the non-convex methods in brain imaging genetics.
θ-convex nonlinear programming problems
International Nuclear Information System (INIS)
Emam, T.
2008-01-01
A class of sets and a class of functions called θ-convex sets and θ-convex functions are introduced by relaxing the definitions of convex sets and operator θ on the sets and domain of definition of the functions. The optimally results for θ-convex programming problems are established.
Convexities move because they contain matter.
Barenholtz, Elan
2010-09-22
Figure-ground assignment to a contour is a fundamental stage in visual processing. The current paper introduces a novel, highly general dynamic cue to figure-ground assignment: "Convex Motion." Across six experiments, subjects showed a strong preference to assign figure and ground to a dynamically deforming contour such that the moving contour segment was convex rather than concave. Experiments 1 and 2 established the preference across two different kinds of deformational motion. Additional experiments determined that this preference was not due to fixation (Experiment 3) or attentional mechanisms (Experiment 4). Experiment 5 found a similar, but reduced bias for rigid-as opposed to deformational-motion, and Experiment 6 demonstrated that the phenomenon depends on the global motion of the effected contour. An explanation of this phenomenon is presented on the basis of typical natural deformational motion, which tends to involve convex contour projections that contain regions consisting of physical "matter," as opposed to concave contour indentations that contain empty space. These results highlight the fundamental relationship between figure and ground, perceived shape, and the inferred physical properties of an object.
A new convexity measure for polygons.
Zunic, Jovisa; Rosin, Paul L
2004-07-01
Abstract-Convexity estimators are commonly used in the analysis of shape. In this paper, we define and evaluate a new convexity measure for planar regions bounded by polygons. The new convexity measure can be understood as a "boundary-based" measure and in accordance with this it is more sensitive to measured boundary defects than the so called "area-based" convexity measures. When compared with the convexity measure defined as the ratio between the Euclidean perimeter of the convex hull of the measured shape and the Euclidean perimeter of the measured shape then the new convexity measure also shows some advantages-particularly for shapes with holes. The new convexity measure has the following desirable properties: 1) the estimated convexity is always a number from (0, 1], 2) the estimated convexity is 1 if and only if the measured shape is convex, 3) there are shapes whose estimated convexity is arbitrarily close to 0, 4) the new convexity measure is invariant under similarity transformations, and 5) there is a simple and fast procedure for computing the new convexity measure.
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.
Nonsmooth Mechanics and Convex Optimization
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
High-Dimensional Analysis of Convex Optimization-Based Massive MIMO Decoders
Ben Atitallah, Ismail
2017-04-01
A wide range of modern large-scale systems relies on recovering a signal from noisy linear measurements. In many applications, the useful signal has inherent properties, such as sparsity, low-rankness, or boundedness, and making use of these properties and structures allow a more efficient recovery. Hence, a significant amount of work has been dedicated to developing and analyzing algorithms that can take advantage of the signal structure. Especially, since the advent of Compressed Sensing (CS) there has been significant progress towards this direction. Generally speaking, the signal structure can be harnessed by solving an appropriate regularized or constrained M-estimator. In modern Multi-input Multi-output (MIMO) communication systems, all transmitted signals are drawn from finite constellations and are thus bounded. Besides, most recent modulation schemes such as Generalized Space Shift Keying (GSSK) or Generalized Spatial Modulation (GSM) yield signals that are inherently sparse. In the recovery procedure, boundedness and sparsity can be promoted by using the ℓ1 norm regularization and by imposing an ℓ∞ norm constraint respectively. In this thesis, we propose novel optimization algorithms to recover certain classes of structured signals with emphasis on MIMO communication systems. The exact analysis permits a clear characterization of how well these systems perform. Also, it allows an automatic tuning of the parameters. In each context, we define the appropriate performance metrics and we analyze them exactly in the High Dimentional Regime (HDR). The framework we use for the analysis is based on Gaussian process inequalities; in particular, on a new strong and tight version of a classical comparison inequality (due to Gordon, 1988) in the presence of additional convexity assumptions. The new framework that emerged from this inequality is coined as Convex Gaussian Min-max Theorem (CGMT).
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.)
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.)
Convexity of the effective potential
International Nuclear Information System (INIS)
Haymaker, R.W.; Perez-Mercader, J.
1978-01-01
The effective potential V(phi) in field theories is a convex function of phi. V(lambda phi 1 + (1 - lambda)phi 2 ) less than or equal to lambdaV(phi 1 ) + (1 - lambda)V(phi 2 ), 0 less than or equal to lambda less than or equal to 1, all phi 1 , phi 2 . A linear interpolation of V(phi) is always larger than or equal to V(phi). There are numerous examples in the tree approximation and in perturbation theory for which this is not the case, the most notorious example being the double dip potential. More complete solutions may or may not show this property automatically. However, a non-convex V(phi) simply indicates that an unstable vacuum state was used in implementing the definition of V(phi). A strict definition will instruct one to replace V(phi) with its linear interpolation in such a way as to make it convex. (Alternatively one can just as well take the view that V(phi) is undefined in these domains.) In this note, attention is called to a very simple argument for convexity based on a construction described by H. Callen in his classic book Thermodynamics
Generalized Bregman distances and convergence rates for non-convex regularization methods
International Nuclear Information System (INIS)
Grasmair, Markus
2010-01-01
We generalize the notion of Bregman distance using concepts from abstract convexity in order to derive convergence rates for Tikhonov regularization with non-convex regularization terms. In particular, we study the non-convex regularization of linear operator equations on Hilbert spaces, showing that the conditions required for the application of the convergence rates results are strongly related to the standard range conditions from the convex case. Moreover, we consider the setting of sparse regularization, where we show that a rate of order δ 1/p holds, if the regularization term has a slightly faster growth at zero than |t| p
Computing farthest neighbors on a convex polytope
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
Directory of Open Access Journals (Sweden)
Tian Zhou Xu
2010-01-01
Full Text Available Using the fixed point methods, we prove the generalized Hyers-Ulam stability of the general mixed additive-quadratic-cubic-quartic functional equation f(x+ky+f(x−ky=k2f(x+y+k2f(x−y+2(1−k2f(x+((k4−k2/12[f(2y+f(−2y−4f(y−4f(−y] for a fixed integer k with k≠0,±1 in non-Archimedean normed spaces.
Mixed-norm estimates for the M/EEG inverse problem using accelerated gradient methods.
Gramfort, Alexandre; Kowalski, Matthieu; Hämäläinen, Matti
2012-04-07
Magneto- and electroencephalography (M/EEG) measure the electromagnetic fields produced by the neural electrical currents. Given a conductor model for the head, and the distribution of source currents in the brain, Maxwell's equations allow one to compute the ensuing M/EEG signals. Given the actual M/EEG measurements and the solution of this forward problem, one can localize, in space and in time, the brain regions that have produced the recorded data. However, due to the physics of the problem, the limited number of sensors compared to the number of possible source locations, and measurement noise, this inverse problem is ill-posed. Consequently, additional constraints are needed. Classical inverse solvers, often called minimum norm estimates (MNE), promote source estimates with a small ℓ₂ norm. Here, we consider a more general class of priors based on mixed norms. Such norms have the ability to structure the prior in order to incorporate some additional assumptions about the sources. We refer to such solvers as mixed-norm estimates (MxNE). In the context of M/EEG, MxNE can promote spatially focal sources with smooth temporal estimates with a two-level ℓ₁/ℓ₂ mixed-norm, while a three-level mixed-norm can be used to promote spatially non-overlapping sources between different experimental conditions. In order to efficiently solve the optimization problems of MxNE, we introduce fast first-order iterative schemes that for the ℓ₁/ℓ₂ norm give solutions in a few seconds making such a prior as convenient as the simple MNE. Furthermore, thanks to the convexity of the optimization problem, we can provide optimality conditions that guarantee global convergence. The utility of the methods is demonstrated both with simulations and experimental MEG data.
A noncommutative convexity in C*-bimodules
Directory of Open Access Journals (Sweden)
Mohsen Kian
2017-02-01
Full Text Available Let A and B be C*-algebras. We consider a noncommutative convexity in Hilbert A-B-bimodules, called A-B-convexity, as a generalization of C*-convexity in C*-algebras. We show that if X is a Hilbert A-B-bimodule, then Mn(X is a Hilbert Mn(A-Mn(B-bimodule and apply it to show that the closed unit ball of every Hilbert A-B-bimodule is A-B-convex. Some properties of this kind of convexity and various examples have been given.
Quantum logics and convex geometry
International Nuclear Information System (INIS)
Bunce, L.J.; Wright, J.D.M.
1985-01-01
The main result is a representation theorem which shows that, for a large class of quantum logics, a quantum logic, Q, is isomorphic to the lattice of projective faces in a suitable convex set K. As an application we extend our earlier results, which, subject to countability conditions, gave a geometric characterization of those quantum logics which are isomorphic to the projection lattice of a von Neumann algebra or a JBW-algebra. (orig.)
Learning Convex Inference of Marginals
Domke, Justin
2012-01-01
Graphical models trained using maximum likelihood are a common tool for probabilistic inference of marginal distributions. However, this approach suffers difficulties when either the inference process or the model is approximate. In this paper, the inference process is first defined to be the minimization of a convex function, inspired by free energy approximations. Learning is then done directly in terms of the performance of the inference process at univariate marginal prediction. The main ...
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
A simple proof to an extension of a theorem of A. Pazy in Hilbert space
International Nuclear Information System (INIS)
Djafari Rouhani, B.
1990-08-01
We prove that if (x n ) n≥0 is a non expansive sequence in a Hilbert space H, the sequence ( n x n ) n≥1 converges strongly in H to the element of minimum norm in the closed convex hull of the sequence (x n+1 -x n ) n≥0 . This result was previously proved; the proof we give here is even much simpler and can be extended to a Banach space. 29 refs
Energy Technology Data Exchange (ETDEWEB)
Gray, P. [ed.
1997-02-01
The author reviews the question of regulation for naturally occuring radioactive material (NORM), and the factors that have made this a more prominent concern today. Past practices have been very relaxed, and have often involved very poor records, the involvment of contractors, and the disposition of contaminated equipment back into commercial service. The rationale behind the establishment of regulations is to provide worker protection, to exempt low risk materials, to aid in scrap recycling, to provide direction for remediation and to examine disposal options. The author reviews existing regulations at federal and state levels, impending legislation, and touches on the issue of site remediation and potential liabilities affecting the release of sites contaminated by NORM.
Finite dimensional convexity and optimization
Florenzano, Monique
2001-01-01
The primary aim of this book is to present notions of convex analysis which constitute the basic underlying structure of argumentation in economic theory and which are common to optimization problems encountered in many applications. The intended readers are graduate students, and specialists of mathematical programming whose research fields are applied mathematics and economics. The text consists of a systematic development in eight chapters, with guided exercises containing sometimes significant and useful additional results. The book is appropriate as a class text, or for self-study.
Use of Convexity in Ostomy Care
Salvadalena, Ginger; Pridham, Sue; Droste, Werner; McNichol, Laurie; Gray, Mikel
2017-01-01
Ostomy skin barriers that incorporate a convexity feature have been available in the marketplace for decades, but limited resources are available to guide clinicians in selection and use of convex products. Given the widespread use of convexity, and the need to provide practical guidelines for appropriate use of pouching systems with convex features, an international consensus panel was convened to provide consensus-based guidance for this aspect of ostomy practice. Panelists were provided with a summary of relevant literature in advance of the meeting; these articles were used to generate and reach consensus on 26 statements during a 1-day meeting. Consensus was achieved when 80% of panelists agreed on a statement using an anonymous electronic response system. The 26 statements provide guidance for convex product characteristics, patient assessment, convexity use, and outcomes. PMID:28002174
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...
Niemi, Antti; Collier, Nathan; Calo, Victor M.
2011-01-01
We revisit the finite element analysis of convection dominated flow problems within the recently developed Discontinuous Petrov-Galerkin (DPG) variational framework. We demonstrate how test function spaces that guarantee numerical stability can
Belbachir, H.; Mirzavaziri, M.; Moslehian, M. S.
2005-01-01
Replacing the triangle inequality, in the definition of a norm, by $|x + y| ^{q}\\leq 2^{q-1}(|x| ^{q} + |y| ^{q}) $, we introduce the notion of a q-norm. We establish that every q-norm is a norm in the usual sense, and that the converse is true as well.
Entropy coherent and entropy convex measures of risk
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
Convex analysis and global optimization
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;
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.$
Characterizing Convexity of Games using Marginal Vectors
van Velzen, S.; Hamers, H.J.M.; Norde, H.W.
2003-01-01
In this paper we study the relation between convexity of TU games and marginal vectors.We show that if specfic marginal vectors are core elements, then the game is convex.We characterize sets of marginal vectors satisfying this property, and we derive the formula for the minimum number of marginal
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 ...
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...
Introduction to Convex and Quasiconvex Analysis
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
Convexity of oligopoly games without transferable technologies
Driessen, Theo; Meinhardt, Holger I.
2005-01-01
We present sufficient conditions involving the inverse demand function and the cost functions to establish the convexity of oligopoly TU-games without transferable technologies. For convex TU-games it is well known that the core is relatively large and that it is generically nonempty. The former
Convex bodies with many elliptic sections
Arelio, Isaac; Montejano, Luis
2014-01-01
{We show in this paper that two normal elliptic sections through every point of the boundary of a smooth convex body essentially characterize an ellipsoid and furthermore, that four different pairwise non-tangent elliptic sections through every point of the $C^2$-differentiable boundary of a convex body also essentially characterize an ellipsoid.
Generalized convexity, generalized monotonicity recent results
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...
Two generalizations of column-convex polygons
International Nuclear Information System (INIS)
Feretic, Svjetlan; Guttmann, Anthony J
2009-01-01
Column-convex polygons were first counted by area several decades ago, and the result was found to be a simple, rational, generating function. In this work we generalize that result. Let a p-column polyomino be a polyomino whose columns can have 1, 2, ..., p connected components. Then column-convex polygons are equivalent to 1-convex polyominoes. The area generating function of even the simplest generalization, namely 2-column polyominoes, is unlikely to be solvable. We therefore define two classes of polyominoes which interpolate between column-convex polygons and 2-column polyominoes. We derive the area generating functions of those two classes, using extensions of existing algorithms. The growth constants of both classes are greater than the growth constant of column-convex polyominoes. Rather tight lower bounds on the growth constants complement a comprehensive asymptotic analysis.
Decomposability and convex structure of thermal processes
Mazurek, Paweł; Horodecki, Michał
2018-05-01
We present an example of a thermal process (TP) for a system of d energy levels, which cannot be performed without an instant access to the whole energy space. This TP is uniquely connected with a transition between some states of the system, that cannot be performed without access to the whole energy space even when approximate transitions are allowed. Pursuing the question about the decomposability of TPs into convex combinations of compositions of processes acting non-trivially on smaller subspaces, we investigate transitions within the subspace of states diagonal in the energy basis. For three level systems, we determine the set of extremal points of these operations, as well as the minimal set of operations needed to perform an arbitrary TP, and connect the set of TPs with thermomajorization criterion. We show that the structure of the set depends on temperature, which is associated with the fact that TPs cannot increase deterministically extractable work from a state—the conclusion that holds for arbitrary d level system. We also connect the decomposability problem with detailed balance symmetry of an extremal TPs.
Alpha-Concave Hull, a Generalization of Convex Hull
Asaeedi, Saeed; Didehvar, Farzad; Mohades, Ali
2013-01-01
Bounding hull, such as convex hull, concave hull, alpha shapes etc. has vast applications in different areas especially in computational geometry. Alpha shape and concave hull are generalizations of convex hull. Unlike the convex hull, they construct non-convex enclosure on a set of points. In this paper, we introduce another generalization of convex hull, named alpha-concave hull, and compare this concept with convex hull and alpha shape. We show that the alpha-concave hull is also a general...
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.
Sparse signals recovered by non-convex penalty in quasi-linear systems.
Cui, Angang; Li, Haiyang; Wen, Meng; Peng, Jigen
2018-01-01
The goal of compressed sensing is to reconstruct a sparse signal under a few linear measurements far less than the dimension of the ambient space of the signal. However, many real-life applications in physics and biomedical sciences carry some strongly nonlinear structures, and the linear model is no longer suitable. Compared with the compressed sensing under the linear circumstance, this nonlinear compressed sensing is much more difficult, in fact also NP-hard, combinatorial problem, because of the discrete and discontinuous nature of the [Formula: see text]-norm and the nonlinearity. In order to get a convenience for sparse signal recovery, we set the nonlinear models have a smooth quasi-linear nature in this paper, and study a non-convex fraction function [Formula: see text] in this quasi-linear compressed sensing. We propose an iterative fraction thresholding algorithm to solve the regularization problem [Formula: see text] for all [Formula: see text]. With the change of parameter [Formula: see text], our algorithm could get a promising result, which is one of the advantages for our algorithm compared with some state-of-art algorithms. Numerical experiments show that our method performs much better than some state-of-the-art methods.
Designing Camera Networks by Convex Quadratic Programming
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).
Designing Camera Networks by Convex Quadratic Programming
Ghanem, Bernard; Wonka, Peter; Cao, Yuanhao
2015-01-01
be formulated mathematically as a convex binary quadratic program (BQP) under linear constraints. Moreover, we propose an optimization strategy with a favorable trade-off between speed and solution quality. Our solution
ON THE GENERALIZED CONVEXITY AND CONCAVITY
Directory of Open Access Journals (Sweden)
Bhayo B.
2015-11-01
Full Text Available A function ƒ : R+ → R+ is (m1, m2-convex (concave if ƒ(m1(x,y ≤ (≥ m2(ƒ(x, ƒ(y for all x,y Є R+ = (0,∞ and m1 and m2 are two mean functions. Anderson et al. [1] studies the dependence of (m1, m2-convexity (concavity on m1 and m2 and gave the sufficient conditions of (m1, m2-convexity and concavity of a function defined by Maclaurin series. In this paper, we make a contribution to the topic and study the (m1, m2-convexity and concavity of a function where m1 and m2 are identric mean, Alzer mean mean. As well, we prove a conjecture posed by Bruce Ebanks in [2].
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
Czech Academy of Sciences Publication Activity Database
Engliš, Miroslav; Hänninen, T.; Taskinen, J.
2006-01-01
Roč. 32, č. 2 (2006), s. 253-275 ISSN 0362-1588 R&D Projects: GA ČR(CZ) GA201/03/0041; GA AV ČR(CZ) IAA1019304 Institutional research plan: CEZ:AV0Z10190503 Keywords : Bergman projection * weighted supremum norms * locally convex space Subject RIV: BA - General Mathematics Impact factor: 0.354, year: 2006
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.
Hermitian harmonic maps into convex balls
International Nuclear Information System (INIS)
Li Zhenyang; Xi Zhang
2004-07-01
In this paper, we consider Hermitian harmonic maps from Hermitian manifolds into convex balls. We prove that there exist no non-trivial Hermitian harmonic maps from closed Hermitian manifolds into convex balls, and we use the heat flow method to solve the Dirichlet problem for Hermitian harmonic maps when the domain is compact Hermitian manifold with non-empty boundary. The case where the domain manifold is complete(noncompact) is also studied. (author)
Counting convex polygons in planar point sets
Mitchell, J.S.B.; Rote, G.; Sundaram, Gopalakrishnan; Woeginger, G.J.
1995-01-01
Given a set S of n points in the plane, we compute in time O(n3) the total number of convex polygons whose vertices are a subset of S. We give an O(m · n3) algorithm for computing the number of convex k-gons with vertices in S, for all values k = 3,…, m; previously known bounds were exponential
Convex integration theory solutions to the h-principle in geometry and topology
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...
Entropy Coherent and Entropy Convex Measures of Risk
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,
On Hadamard-Type Inequalities Involving Several Kinds of Convexity
Directory of Open Access Journals (Sweden)
Dragomir SeverS
2010-01-01
Full Text Available We do not only give the extensions of the results given by Gill et al. (1997 for log-convex functions but also obtain some new Hadamard-type inequalities for log-convex -convex, and -convex functions.
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...
Iterative Schemes for Convex Minimization Problems with Constraints
Directory of Open Access Journals (Sweden)
Lu-Chuan Ceng
2014-01-01
Full Text Available We first introduce and analyze one implicit iterative algorithm for finding a solution of the minimization problem for a convex and continuously Fréchet differentiable functional, with constraints of several problems: the generalized mixed equilibrium problem, the system of generalized equilibrium problems, and finitely many variational inclusions in a real Hilbert space. We prove strong convergence theorem for the iterative algorithm under suitable conditions. On the other hand, we also propose another implicit iterative algorithm for finding a fixed point of infinitely many nonexpansive mappings with the same constraints, and derive its strong convergence under mild assumptions.
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....
Non-convex multi-objective optimization
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...
A generalization of the convex Kakeya problem
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.
From Norm Adoption to Norm Internalization
Conte, Rosaria; Andrighetto, Giulia; Villatoro, Daniel
In this presentation, advances in modeling the mental dynamics of norms will be presented. In particular, the process from norm-adoption, possibly yielding new normative goals, to different forms of norm compliance will be focused upon, including norm internalization, which is at study in social-behavioral sciences and moral philosophy since long. Of late, the debate was revamped within the rationality approach pointing to the role of norm internalization as a less costly and more reliable enforcement system than social control. So far, poor attention was paid to the mental underpinnings of internalization. In this presentation, a rich cognitive model of different types, degrees and factors of internalization is shown. The initial implementation of this model on EMIL-A, a normative agent architecture developed and applied to the.
Probing convex polygons with X-rays
International Nuclear Information System (INIS)
Edelsbrunner, H.; Skiena, S.S.
1988-01-01
An X-ray probe through a polygon measures the length of intersection between a line and the polygon. This paper considers the properties of various classes of X-ray probes, and shows how they interact to give finite strategies for completely describing convex n-gons. It is shown that (3n/2)+6 probes are sufficient to verify a specified n-gon, while for determining convex polygons (3n-1)/2 X-ray probes are necessary and 5n+O(1) sufficient, with 3n+O(1) sufficient given that a lower bound on the size of the smallest edge of P is known
Recovering convexity in non-associated plasticity
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.
Directory of Open Access Journals (Sweden)
Yves Biollay
1979-01-01
Full Text Available We show in this paper that the sequence {max|uk|}, where the uk are the eigenfunctions of the problem Δu+λu=0 in D⊂Rn and u=0 on ∂D, is not bounded generally if one imposes the norm ∫Du2p(xdx=1, p=(1,2,3,…. The same holds with the norm ∫D|gradu|2pdx=1 when n>4p−1. On the other hand, if D⊂R2, resp. R3 the norm ∫D|gradu|2dx=1 implies max|uk|→k→∞0, resp. max|uk|=0(1.
Learning Sparse Visual Representations with Leaky Capped Norm Regularizers
Wangni, Jianqiao; Lin, Dahua
2017-01-01
Sparsity inducing regularization is an important part for learning over-complete visual representations. Despite the popularity of $\\ell_1$ regularization, in this paper, we investigate the usage of non-convex regularizations in this problem. Our contribution consists of three parts. First, we propose the leaky capped norm regularization (LCNR), which allows model weights below a certain threshold to be regularized more strongly as opposed to those above, therefore imposes strong sparsity and...
NORM - practical guide; NORM - guia pratico
Energy Technology Data Exchange (ETDEWEB)
Reis, Rocio dos (ed.)
2016-07-01
The experience of the authors and a literature review on the evaluation of national and international regulatory guides are presented. The objective is to help understand the need to implement the best practices for NORM management in the industries that produce the NORM wastes. The book should act as a reference point, basic, friendly and useful to assist the reader in NORM management activities. The reader should be warned that management requires consultation and involvement of a significant number of stakeholders, in addition to the approval of competent authorities. A list and the technical biography of the authors are also described.
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...
Conference on Convex Analysis and Global Optimization
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...
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
Localized Multiple Kernel Learning A Convex Approach
2016-11-22
data. All the aforementioned approaches to localized MKL are formulated in terms of non-convex optimization problems, and deep the- oretical...learning. IEEE Transactions on Neural Networks, 22(3):433–446, 2011. Jingjing Yang, Yuanning Li, Yonghong Tian, Lingyu Duan, and Wen Gao. Group-sensitive
A generalization of the convex Kakeya problem
Ahn, Heekap; Bae, Sangwon; Cheong, Otfried; Gudmundsson, Joachim; Tokuyama, Takeshi; Vigneron, Antoine E.
2013-01-01
segments. We also show that, if the goal is to minimize the perimeter of the region instead of its area, then placing the segments with their midpoint at the origin and taking their convex hull results in an optimal solution. Finally, we show that for any
Directional Convexity and Finite Optimality Conditions.
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
Convexity properties of Hamiltonian group actions
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...
Some Characterizations of Convex Interval Games
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.
A generalization of the convex Kakeya problem
Ahn, Heekap; Bae, Sangwon; Cheong, Otfried; Gudmundsson, Joachim; Tokuyama, Takeshi; Vigneron, Antoine E.
2012-01-01
We consider the following geometric alignment problem: Given a set of line segments in the plane, find a convex region of smallest area that contains a translate of each input segment. This can be seen as a generalization of Kakeya's problem
A generalization of the convex Kakeya problem
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.
Dynamic Matchings in Convex Bipartite Graphs
DEFF Research Database (Denmark)
Brodal, Gerth Stølting; Georgiadis, Loukas; Hansen, Kristoffer Arnsfelt
2007-01-01
We consider the problem of maintaining a maximum matching in a convex bipartite graph G = (V,E) under a set of update operations which includes insertions and deletions of vertices and edges. It is not hard to show that it is impossible to maintain an explicit representation of a maximum matching...
Cost Allocation and Convex Data Envelopment
DEFF Research Database (Denmark)
Hougaard, Jens Leth; Tind, Jørgen
such as Data Envelopment Analysis (DEA). The convexity constraint of the BCC model introduces a non-zero slack in the objective function of the multiplier problem and we show that the cost allocation rules discussed in this paper can be used as candidates to allocate this slack value on to the input (or output...
Weighted semiconvex spaces of measurable functions
International Nuclear Information System (INIS)
Olaleru, J.O.
2001-12-01
Semiconvex spaces are intermediates between locally convex spaces and the non locally convex topological vector spaces. They include all locally convex spaces; hence it is a generalization of locally convex spaces. In this article, we make a study of weighted semiconvex spaces parallel to weighted locally convex spaces where continuous functions are replaced with measurable functions and N p family replaces Nachbin family on a locally compact space X. Among others, we examine the Hausdorffness, completeness, inductive limits, barrelledness and countably barrelledness of weighted semiconvex spaces. New results are obtained while we have a more elegant proofs of old results. Furthermore, we get extensions of some of the old results. It is observed that the technique of proving theorems in weighted locally convex spaces can be adapted to that of weighted semicovex spaces of measurable functions in most cases. (author)
Fast approximate convex decomposition using relative concavity
Ghosh, Mukulika; Amato, Nancy M.; Lu, Yanyan; Lien, Jyh-Ming
2013-01-01
Approximate convex decomposition (ACD) is a technique that partitions an input object into approximately convex components. Decomposition into approximately convex pieces is both more efficient to compute than exact convex decomposition and can also generate a more manageable number of components. It can be used as a basis of divide-and-conquer algorithms for applications such as collision detection, skeleton extraction and mesh generation. In this paper, we propose a new method called Fast Approximate Convex Decomposition (FACD) that improves the quality of the decomposition and reduces the cost of computing it for both 2D and 3D models. In particular, we propose a new strategy for evaluating potential cuts that aims to reduce the relative concavity, rather than absolute concavity. As shown in our results, this leads to more natural and smaller decompositions that include components for small but important features such as toes or fingers while not decomposing larger components, such as the torso, that may have concavities due to surface texture. Second, instead of decomposing a component into two pieces at each step, as in the original ACD, we propose a new strategy that uses a dynamic programming approach to select a set of n c non-crossing (independent) cuts that can be simultaneously applied to decompose the component into n c+1 components. This reduces the depth of recursion and, together with a more efficient method for computing the concavity measure, leads to significant gains in efficiency. We provide comparative results for 2D and 3D models illustrating the improvements obtained by FACD over ACD and we compare with the segmentation methods in the Princeton Shape Benchmark by Chen et al. (2009) [31]. © 2012 Elsevier Ltd. All rights reserved.
Fast approximate convex decomposition using relative concavity
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.
Schur Convexity of Generalized Heronian Means Involving Two Parameters
Directory of Open Access Journals (Sweden)
Bencze Mihály
2008-01-01
Full Text Available Abstract The Schur convexity and Schur-geometric convexity of generalized Heronian means involving two parameters are studied, the main result is then used to obtain several interesting and significantly inequalities for generalized Heronian means.
Linearization of Euclidean Norm Dependent Inequalities Applied to Multibeam Satellites Design
Camino , Jean-Thomas; Artigues , Christian; Houssin , Laurent; Mourgues , Stéphane
2016-01-01
Euclidean norm computations over continuous variables appear naturally in the constraints or in the objective of many problems in the optimization literature, possibly defining non-convex feasible regions or cost functions. When some other variables have discrete domains, it positions the problem in the challenging Mixed Integer Nonlinear Programming (MINLP) class. For any MINLP where the nonlinearity is only present in the form of inequality constraints involving the Euclidean norm, we propo...
Extreme points of the convex set of joint probability distributions with ...
Indian Academy of Sciences (India)
Here we address the following problem: If G is a standard ... convex set of all joint probability distributions on the product Borel space (X1 ×X2, F1 ⊗. F2) which .... cannot be identically zero when X and Y vary in A1 and u and v vary in H2. Thus.
Convex stoma appliances: an audit of stoma care nurses.
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.
Convex relaxations of spectral sparsity for robust super-resolution and line spectrum estimation
Chi, Yuejie
2017-08-01
We consider recovering the amplitudes and locations of spikes in a point source signal from its low-pass spectrum that may suffer from missing data and arbitrary outliers. We first review and provide a unified view of several recently proposed convex relaxations that characterize and capitalize the spectral sparsity of the point source signal without discretization under the framework of atomic norms. Next we propose a new algorithm when the spikes are known a priori to be positive, motivated by applications such as neural spike sorting and fluorescence microscopy imaging. Numerical experiments are provided to demonstrate the effectiveness of the proposed approach.
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.
Exact generating function for 2-convex polygons
International Nuclear Information System (INIS)
James, W R G; Jensen, I; Guttmann, A J
2008-01-01
Polygons are described as almost-convex if their perimeter differs from the perimeter of their minimum bounding rectangle by twice their 'concavity index', m. Such polygons are called m-convex polygons and are characterized by having up to m indentations in their perimeter. We first describe how we conjectured the (isotropic) generating function for the case m = 2 using a numerical procedure based on series expansions. We then proceed to prove this result for the more general case of the full anisotropic generating function, in which steps in the x and y directions are distinguished. In doing so, we develop tools that would allow for the case m > 2 to be studied
Solving ptychography with a convex relaxation
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.
Convex nonnegative matrix factorization with manifold regularization.
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.
Convexity, gauge-dependence and tunneling rates
International Nuclear Information System (INIS)
Plascencia, Alexis D.; Tamarit, Carlos
2016-01-01
We clarify issues of convexity, gauge-dependence and radiative corrections in relation to tunneling rates. Despite the gauge dependence of the effective action at zero and finite temperature, it is shown that tunneling and nucleation rates remain independent of the choice of gauge-fixing. Taking as a starting point the functional that defines the transition amplitude from a false vacuum onto itself, it is shown that decay rates are exactly determined by a non-convex, false vacuum effective action evaluated at an extremum. The latter can be viewed as a generalized bounce configuration, and gauge-independence follows from the appropriate Nielsen identities. This holds for any election of gauge-fixing that leads to an invertible Faddeev-Popov matrix.
A New Interpolation Approach for Linearly Constrained Convex Optimization
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.
An easy path to convex analysis and applications
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
On the convexity of relativistic hydrodynamics
International Nuclear Information System (INIS)
Ibáñez, José M; Martí, José M; Cordero-Carrión, Isabel; Miralles, Juan A
2013-01-01
The relativistic hydrodynamic system of equations for a perfect fluid obeying a causal equation of state is hyperbolic (Anile 1989 Relativistic Fluids and Magneto-Fluids (Cambridge: Cambridge University Press)). In this report, we derive the conditions for this system to be convex in terms of the fundamental derivative of the equation of state (Menikoff and Plohr1989 Rev. Mod. Phys. 61 75). The classical limit is recovered. Communicated by L Rezzolla (note)
Dynamic Convex Duality in Constrained Utility Maximization
Li, Yusong; Zheng, Harry
2016-01-01
In this paper, we study a constrained utility maximization problem following the convex duality approach. After formulating the primal and dual problems, we construct the necessary and sufficient conditions for both the primal and dual problems in terms of FBSDEs plus additional conditions. Such formulation then allows us to explicitly characterize the primal optimal control as a function of the adjoint process coming from the dual FBSDEs in a dynamic fashion and vice versa. Moreover, we also...
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.
The occipital lobe convexity sulci and gyri.
Alves, Raphael V; Ribas, Guilherme C; Párraga, Richard G; de Oliveira, Evandro
2012-05-01
The anatomy of the occipital lobe convexity is so intricate and variable that its precise description is not found in the classic anatomy textbooks, and the occipital sulci and gyri are described with different nomenclatures according to different authors. The aim of this study was to investigate and describe the anatomy of the occipital lobe convexity and clarify its nomenclature. The configurations of sulci and gyri on the lateral surface of the occipital lobe of 20 cerebral hemispheres were examined in order to identify the most characteristic and consistent patterns. The most characteristic and consistent occipital sulci identified in this study were the intraoccipital, transverse occipital, and lateral occipital sulci. The morphology of the transverse occipital sulcus and the intraoccipital sulcus connection was identified as the most important aspect to define the gyral pattern of the occipital lobe convexity. Knowledge of the main features of the occipital sulci and gyri permits the recognition of a basic configuration of the occipital lobe and the identification of its sulcal and gyral variations.
Convex Hull Aided Registration Method (CHARM).
Fan, Jingfan; Yang, Jian; Zhao, Yitian; Ai, Danni; Liu, Yonghuai; Wang, Ge; Wang, Yongtian
2017-09-01
Non-rigid registration finds many applications such as photogrammetry, motion tracking, model retrieval, and object recognition. In this paper we propose a novel convex hull aided registration method (CHARM) to match two point sets subject to a non-rigid transformation. First, two convex hulls are extracted from the source and target respectively. Then, all points of the point sets are projected onto the reference plane through each triangular facet of the hulls. From these projections, invariant features are extracted and matched optimally. The matched feature point pairs are mapped back onto the triangular facets of the convex hulls to remove outliers that are outside any relevant triangular facet. The rigid transformation from the source to the target is robustly estimated by the random sample consensus (RANSAC) scheme through minimizing the distance between the matched feature point pairs. Finally, these feature points are utilized as the control points to achieve non-rigid deformation in the form of thin-plate spline of the entire source point set towards the target one. The experimental results based on both synthetic and real data show that the proposed algorithm outperforms several state-of-the-art ones with respect to sampling, rotational angle, and data noise. In addition, the proposed CHARM algorithm also shows higher computational efficiency compared to these methods.
Generalized vector calculus on convex domain
Agrawal, Om P.; Xu, Yufeng
2015-06-01
In this paper, we apply recently proposed generalized integral and differential operators to develop generalized vector calculus and generalized variational calculus for problems defined over a convex domain. In particular, we present some generalization of Green's and Gauss divergence theorems involving some new operators, and apply these theorems to generalized variational calculus. For fractional power kernels, the formulation leads to fractional vector calculus and fractional variational calculus for problems defined over a convex domain. In special cases, when certain parameters take integer values, we obtain formulations for integer order problems. Two examples are presented to demonstrate applications of the generalized variational calculus which utilize the generalized vector calculus developed in the paper. The first example leads to a generalized partial differential equation and the second example leads to a generalized eigenvalue problem, both in two dimensional convex domains. We solve the generalized partial differential equation by using polynomial approximation. A special case of the second example is a generalized isoperimetric problem. We find an approximate solution to this problem. Many physical problems containing integer order integrals and derivatives are defined over arbitrary domains. We speculate that future problems containing fractional and generalized integrals and derivatives in fractional mechanics will be defined over arbitrary domains, and therefore, a general variational calculus incorporating a general vector calculus will be needed for these problems. This research is our first attempt in that direction.
Adaptation and perceptual norms
Webster, Michael A.; Yasuda, Maiko; Haber, Sara; Leonard, Deanne; Ballardini, Nicole
2007-02-01
We used adaptation to examine the relationship between perceptual norms--the stimuli observers describe as psychologically neutral, and response norms--the stimulus levels that leave visual sensitivity in a neutral or balanced state. Adapting to stimuli on opposite sides of a neutral point (e.g. redder or greener than white) biases appearance in opposite ways. Thus the adapting stimulus can be titrated to find the unique adapting level that does not bias appearance. We compared these response norms to subjectively defined neutral points both within the same observer (at different retinal eccentricities) and between observers. These comparisons were made for visual judgments of color, image focus, and human faces, stimuli that are very different and may depend on very different levels of processing, yet which share the property that for each there is a well defined and perceptually salient norm. In each case the adaptation aftereffects were consistent with an underlying sensitivity basis for the perceptual norm. Specifically, response norms were similar to and thus covaried with the perceptual norm, and under common adaptation differences between subjectively defined norms were reduced. These results are consistent with models of norm-based codes and suggest that these codes underlie an important link between visual coding and visual experience.
Manger hors norme, respecter les normes
Régnier, Faustine
2007-01-01
Fondée sur un corpus de près de 10 000 recettes de cuisine de la presse féminine française et allemande (1930‑2000), cette contribution met en évidence la façon dont l’exotisme permet de manger hors norme tout en restant dans les normes. Les pratiques culinaires étrangères ne peuvent être adoptées qu’au terme d’un travail de normalisation. Elles sont modifiées de manière à ce que soient respectées les normes du pays d’accueil, par là même mises en œuvre. Elles sont donc conçues comme un ensem...
Submonotone mappings in Banach spaces and applications
International Nuclear Information System (INIS)
Georgiev, P.G.
1995-11-01
The notions 'submonotone' and 'strictly submonotone' mapping, introduced by J. Spingarn in R n , are extended in a natural way to arbitrary Banach spaces. Several results about monotone operators are proved for submonotone and strictly submonotone ones: Rockafellar's result about local boundedness of monotone operators; Kenderov's result about single-valuedness and upper-semicontinuity almost everywhere of monotone operators in Asplund spaces; minimality (as w * - cusco mappings) of maximal strictly submonotone mappings, etc. It is shown that subdifferentials of various classes non-convex functions defined as pointwise suprema of quasi-differentiable functions possess submonotone properties. Results about generic differentiability of such functions are obtained (among them are new generalizations of an Ekeland and Lebourg's theorem). Applications are given to the properties of the distance function in a Banach space with uniformly Gateaux differentiable norm. (author). 29 refs
A two-layer recurrent neural network for nonsmooth convex optimization problems.
Qin, Sitian; Xue, Xiaoping
2015-06-01
In this paper, a two-layer recurrent neural network is proposed to solve the nonsmooth convex optimization problem subject to convex inequality and linear equality constraints. Compared with existing neural network models, the proposed neural network has a low model complexity and avoids penalty parameters. It is proved that from any initial point, the state of the proposed neural network reaches the equality feasible region in finite time and stays there thereafter. Moreover, the state is unique if the initial point lies in the equality feasible region. The equilibrium point set of the proposed neural network is proved to be equivalent to the Karush-Kuhn-Tucker optimality set of the original optimization problem. It is further proved that the equilibrium point of the proposed neural network is stable in the sense of Lyapunov. Moreover, from any initial point, the state is proved to be convergent to an equilibrium point of the proposed neural network. Finally, as applications, the proposed neural network is used to solve nonlinear convex programming with linear constraints and L1 -norm minimization problems.
'Global' norms and 'local' agency
DEFF Research Database (Denmark)
Björkdahl, Annika; Gusic, Ivan
2015-01-01
This article explores how the 'liberal democratic peace package' is received in post-conflict spaces. As such, it is part of a critical peace research agenda that raises critical questions concerning the quality of peace in many post-conflict societies. A close reading of the peace-building process...... in post-conflict Kosovo provides the backdrop for the theoretical discussion that identifies friction in norm diffusion processes and the different agencies that are generated through encounters between global norms and local practices. We unpack the interplay between the 'global' and the 'local......' in peacebuilding and, through the lens of friction, we reveal the diverse and unequal encounters that produce new power relations. By foregrounding agency, we theorise different agentive subjects in the post-conflict setting, and map local agency from various segments of society that may localise, co-opt or reject...
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.
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.
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
The personal norm of reciprocity
Perugini, M.; Gallucci, M.; Presaghi, F.; Ercolani, A.P.
2002-01-01
Reciprocity is here considered as an internalized social norm, and a questionnaire to measure individual differences in the internalized norm of reciprocity is presented. The questionnaire, Personal Norm of Reciprocity (PNR), measures three aspects of reciprocity: positive reciprocity, negative
Convex functions and optimization methods on Riemannian manifolds
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...
Convex-based void filling method for CAD-based Monte Carlo geometry modeling
International Nuclear Information System (INIS)
Yu, Shengpeng; Cheng, Mengyun; Song, Jing; Long, Pengcheng; Hu, Liqin
2015-01-01
Highlights: • We present a new void filling method named CVF for CAD based MC geometry modeling. • We describe convex based void description based and quality-based space subdivision. • The results showed improvements provided by CVF for both modeling and MC calculation efficiency. - Abstract: CAD based automatic geometry modeling tools have been widely applied to generate Monte Carlo (MC) calculation geometry for complex systems according to CAD models. Automatic void filling is one of the main functions in the CAD based MC geometry modeling tools, because the void space between parts in CAD models is traditionally not modeled while MC codes such as MCNP need all the problem space to be described. A dedicated void filling method, named Convex-based Void Filling (CVF), is proposed in this study for efficient void filling and concise void descriptions. The method subdivides all the problem space into disjointed regions using Quality based Subdivision (QS) and describes the void space in each region with complementary descriptions of the convex volumes intersecting with that region. It has been implemented in SuperMC/MCAM, the Multiple-Physics Coupling Analysis Modeling Program, and tested on International Thermonuclear Experimental Reactor (ITER) Alite model. The results showed that the new method reduced both automatic modeling time and MC calculation time
CVXPY: A Python-Embedded Modeling Language for Convex Optimization
Diamond, Steven; Boyd, Stephen
2016-01-01
CVXPY is a domain-specific language for convex optimization embedded in Python. It allows the user to express convex optimization problems in a natural syntax that follows the math, rather than in the restrictive standard form required by solvers. CVXPY makes it easy to combine convex optimization with high-level features of Python such as parallelism and object-oriented design. CVXPY is available at http://www.cvxpy.org/ under the GPL license, along with documentation and examples.
CVXPY: A Python-Embedded Modeling Language for Convex Optimization.
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.
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.)
INdAM Workshop on Analytic Aspects of Convexity
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.
Singh, M.P.; Arrott, M.; Balke, T.; Chopra, A.; Christiaanse, R.M.J.; Cranefield, S.; Dignum, F.; Eynard, D.; Farcas, E.; Fornare, N.; Gandon, F.; Governatori, G.; Dam, H.K.; Hulstijn, J.; Krueger, I.; Lam, H.P.; Meisinger, M.; Noriega, P.; Tony, B.; Savarimuthu, R.; Tadanki, K.; Verhagen, H.; Villata, S.
2013-01-01
This chapter presents a variety of applications of norms. These applications include governance in sociotechnical systems, data licensing and data collection, understanding software development teams, requirements engineering, assurance, natural resource allocation, wireless grids, autonomous
U.S. Department of Health & Human Services — RxNorm provides normalized names for clinical drugs and links its names to many of the drug vocabularies commonly used in pharmacy management and drug interaction...
Bundles of Norms About Teen Sex and Pregnancy.
Mollborn, Stefanie; Sennott, Christie
2015-09-01
Teen pregnancy is a cultural battleground in struggles over morality, education, and family. At its heart are norms about teen sex, contraception, pregnancy, and abortion. Analyzing 57 interviews with college students, we found that "bundles" of related norms shaped the messages teens hear. Teens did not think their communities encouraged teen sex or pregnancy, but normative messages differed greatly, with either moral or practical rationalizations. Teens readily identified multiple norms intended to regulate teen sex, contraception, abortion, childbearing, and the sanctioning of teen parents. Beyond influencing teens' behavior, norms shaped teenagers' public portrayals and post hoc justifications of their behavior. Although norm bundles are complex to measure, participants could summarize them succinctly. These bundles and their conflicting behavioral prescriptions create space for human agency in negotiating normative pressures. The norm bundles concept has implications for teen pregnancy prevention policies and can help revitalize social norms for understanding health behaviors. © The Author(s) 2014.
Neuro-genetic hybrid approach for the solution of non-convex economic dispatch problem
International Nuclear Information System (INIS)
Malik, T.N.; Asar, A.U.
2009-01-01
ED (Economic Dispatch) is non-convex constrained optimization problem, and is used for both on line and offline studies in power system operation. Conventionally, it is solved as convex problem using optimization techniques by approximating generator input/output characteristic. Curves of monotonically increasing nature thus resulting in an inaccurate dispatch. The GA (Genetic Algorithm) has been used for the solution of this problem owing to its inherent ability to address the convex and non-convex problems equally. This approach brings the solution to the global minimum region of search space in a short time and then takes longer time to converge to near optimal results. GA based hybrid approaches are used to fine tune the near optimal results produced by GA. This paper proposes NGH (Neuro Genetic Hybrid) approach to solve the economic dispatch with valve point effect. The proposed approach combines the GA with the ANN (Artificial Neural Network) using SI (Swarm Intelligence) learning rule. The GA acts as a global optimizer and the neural network fine tunes the GA results to the desired targets. Three machines standard test system has been tested for validation of the approach. Comparing the results with GA and NGH model based on back-propagation learning, the proposed approach gives contrast improvements showing the promise of the approach. (author)
Extending the Mertonian Norms: Scientists' Subscription to Norms of Research
Anderson, Melissa S.; Ronning, Emily A.; De Vries, Raymond; Martinson, Brian C.
2010-01-01
This analysis, based on focus groups and a national survey, assesses scientists' subscription to the Mertonian norms of science and associated counternorms. It also supports extension of these norms to governance (as opposed to administration), as a norm of decision-making, and quality (as opposed to quantity), as an evaluative norm. (Contains 1…
Bolt, Josef; Coecke, Bob; Genovese, Fabrizio; Lewis, Martha; Marsden, Daniel; Piedeleu, Robin
2016-01-01
We propose applying the categorical compositional scheme of [6] to conceptual space models of cognition. In order to do this we introduce the category of convex relations as a new setting for categorical compositional semantics, emphasizing the convex structure important to conceptual space applications. We show how conceptual spaces for composite types such as adjectives and verbs can be constructed. We illustrate this new model on detailed examples.
The Mackey convergence condition for spaces with webs
Directory of Open Access Journals (Sweden)
Thomas E. Gilsdorf
1988-01-01
Full Text Available If each sequence converging to 0 in a locally convex space is also Mackey convergent to 0, that space is said to satisfy the Mackey convergence condition. The problem of characterizing those locally convex spaces with this property is still open. In this paper, spaces with compatible webs are used to construct both a necessary and a sufficient condition for a locally convex space to satisfy the Mackey convergence condition.
Multi-Period Trading via Convex Optimization
DEFF Research Database (Denmark)
Boyd, Stephen; Busseti, Enzo; Diamond, Steve
2017-01-01
We consider a basic model of multi-period trading, which can be used to evaluate the performance of a trading strategy. We describe a framework for single-period optimization, where the trades in each period are found by solving a convex optimization problem that trades oﬀ expected return, risk......, transaction cost and holding cost such as the borrowing cost for shorting assets. We then describe a multi-period version of the trading method, where optimization is used to plan a sequence of trades, with only the ﬁrst one executed, using estimates of future quantities that are unknown when the trades....... In this paper, we do not address a critical component in a trading algorithm, the predictions or forecasts of future quantities. The methods we describe in this paper can be thought of as good ways to exploit predictions, no matter how they are made. We have also developed a companion open-source software...
A Combination Theorem for Convex Hyperbolic Manifolds, with Applications to Surfaces in 3-Manifolds
Baker, Mark; Cooper, Daryl
2005-01-01
We prove the convex combination theorem for hyperbolic n-manifolds. Applications are given both in high dimensions and in 3 dimensions. One consequence is that given two geometrically finite subgroups of a discrete group of isometries of hyperbolic n-space, satisfying a natural condition on their parabolic subgroups, there are finite index subgroups which generate a subgroup that is an amalgamated free product. Constructions of infinite volume hyperbolic n-manifolds are described by gluing lo...
Conditionally exponential convex functions on locally compact groups
International Nuclear Information System (INIS)
Okb El-Bab, A.S.
1992-09-01
The main results of the thesis are: 1) The construction of a compact base for the convex cone of all conditionally exponential convex functions. 2) The determination of the extreme parts of this cone. Some supplementary lemmas are proved for this purpose. (author). 8 refs
Approximate convex hull of affine iterated function system attractors
International Nuclear Information System (INIS)
Mishkinis, Anton; Gentil, Christian; Lanquetin, Sandrine; Sokolov, Dmitry
2012-01-01
Highlights: ► We present an iterative algorithm to approximate affine IFS attractor convex hull. ► Elimination of the interior points significantly reduces the complexity. ► To optimize calculations, we merge the convex hull images at each iteration. ► Approximation by ellipses increases speed of convergence to the exact convex hull. ► We present a method of the output convex hull simplification. - Abstract: In this paper, we present an algorithm to construct an approximate convex hull of the attractors of an affine iterated function system (IFS). We construct a sequence of convex hull approximations for any required precision using the self-similarity property of the attractor in order to optimize calculations. Due to the affine properties of IFS transformations, the number of points considered in the construction is reduced. The time complexity of our algorithm is a linear function of the number of iterations and the number of points in the output approximate convex hull. The number of iterations and the execution time increases logarithmically with increasing accuracy. In addition, we introduce a method to simplify the approximate convex hull without loss of accuracy.
Entropy coherent and entropy convex measures of risk
Laeven, Roger; Stadje, M.A.
2010-01-01
We introduce entropy coherent and entropy convex measures of risk and prove a collection of axiomatic characterization and duality results. We show in particular that entropy coherent and entropy convex measures of risk emerge as negative certainty equivalents in (the regular and a generalized
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.
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...
The Iterative Reweighted Mixed-Norm Estimate for Spatio-Temporal MEG/EEG Source Reconstruction.
Strohmeier, Daniel; Bekhti, Yousra; Haueisen, Jens; Gramfort, Alexandre
2016-10-01
Source imaging based on magnetoencephalography (MEG) and electroencephalography (EEG) allows for the non-invasive analysis of brain activity with high temporal and good spatial resolution. As the bioelectromagnetic inverse problem is ill-posed, constraints are required. For the analysis of evoked brain activity, spatial sparsity of the neuronal activation is a common assumption. It is often taken into account using convex constraints based on the l 1 -norm. The resulting source estimates are however biased in amplitude and often suboptimal in terms of source selection due to high correlations in the forward model. In this work, we demonstrate that an inverse solver based on a block-separable penalty with a Frobenius norm per block and a l 0.5 -quasinorm over blocks addresses both of these issues. For solving the resulting non-convex optimization problem, we propose the iterative reweighted Mixed Norm Estimate (irMxNE), an optimization scheme based on iterative reweighted convex surrogate optimization problems, which are solved efficiently using a block coordinate descent scheme and an active set strategy. We compare the proposed sparse imaging method to the dSPM and the RAP-MUSIC approach based on two MEG data sets. We provide empirical evidence based on simulations and analysis of MEG data that the proposed method improves on the standard Mixed Norm Estimate (MxNE) in terms of amplitude bias, support recovery, and stability.
Roest, Sander A; Visser, Tessa A; Zeelenberg, René
2018-04-01
This article provides norms for general taboo, personal taboo, insult, valence, and arousal for 672 Dutch words, including 202 taboo words. Norms were collected using a 7-point Likert scale and based on ratings by psychology students from the Erasmus University Rotterdam in The Netherlands. The sample consisted of 87 psychology students (58 females, 29 males). We obtained high reliability based on split-half analyses. Our norms show high correlations with arousal and valence ratings collected by another Dutch word-norms study (Moors et al.,, Behavior Research Methods, 45, 169-177, 2013). Our results show that the previously found quadratic relation (i.e., U-shaped pattern) between valence and arousal also holds when only taboo words are considered. Additionally, words rated high on taboo tended to be rated low on valence, but some words related to sex rated high on both taboo and valence. Words that rated high on taboo rated high on insult, again with the exception of words related to sex many of which rated low on insult. Finally, words rated high on taboo and insult rated high on arousal. The Dutch Taboo Norms (DTN) database is a useful tool for researchers interested in the effects of taboo words on cognitive processing. The data associated with this paper can be accessed via the Open Science Framework ( https://osf.io/vk782/ ).
Directory of Open Access Journals (Sweden)
Yanhui Li
2014-01-01
Full Text Available This paper investigates the Hankel norm filter design problem for stochastic time-delay systems, which are represented by Takagi-Sugeno (T-S fuzzy model. Motivated by the parallel distributed compensation (PDC technique, a novel filtering error system is established. The objective is to design a suitable filter that guarantees the corresponding filtering error system to be mean-square asymptotically stable and to have a specified Hankel norm performance level γ. Based on the Lyapunov stability theory and the Itô differential rule, the Hankel norm criterion is first established by adopting the integral inequality method, which can make some useful efforts in reducing conservativeness. The Hankel norm filtering problem is casted into a convex optimization problem with a convex linearization approach, which expresses all the conditions for the existence of admissible Hankel norm filter as standard linear matrix inequalities (LMIs. The effectiveness of the proposed method is demonstrated via a numerical example.
Fundamentals of convex analysis duality, separation, representation, and resolution
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...
International Nuclear Information System (INIS)
Chapman, C.
1994-05-01
Vitrification of wastes is a relatively new application of none of man's oldest manufacturing processes. During the past 25 years it has been developed and accepted internationally for immobilizing the most highly radioactive wastes from spent nuclear fuel. By the year 2005, there will be nine operating high-level radioactive vitrification plants. Many of the technical ''lessons learned'' from this international program can be applied to much less hazardous materials such as naturally occurring radioactive material (NORM). With the deployment of low capital and operating cost systems, vitrification should become a broadly applied process for treating a large variety of wastes. In many situations, the wastes can be transformed into marketable products. This paper will present a general description of waste vitrification, summarize some of its key advantages, provide some test data for a small sample of one NORM, and suggest how this process may be applied to NORM
Modeling exogenous moral norms
Directory of Open Access Journals (Sweden)
Ross A. Tippit
2014-11-01
Full Text Available This paper considers the possibility of a robust and general formulation of a model of choice for the representation of a variety of moral norms. It starts by reviewing several recent models of deontological (or rule-based norms that retain the basic elements of the economic model of choice. It briefly examines the achievements and drawbacks of each model, and while no model is identified as the most accurate or robust, the most appealing aspects of each model contribute to the construction of a tout-ensemble utility function proposed in the final section. This representation of preferences aims to incorporate the most common qualities of both consequentialist and deontological moral norms in order to represent decision making under their influence.
Mollborn, Stefanie; Domingue, Benjamin W.; Boardman, Jason D.
2014-01-01
Researchers seeking to understand teen sexual behaviors often turn to age norms, but they are difficult to measure quantitatively. Previous work has usually inferred norms from behavioral patterns or measured group-level norms at the individual level, ignoring multiple reference groups. Capitalizing on the multilevel design of the Add Health survey, we measure teen pregnancy norms perceived by teenagers, as well as average norms at the school and peer network levels. School norms predict boys’ perceived norms, while peer network norms predict girls’ perceived norms. Peer network and individually perceived norms against teen pregnancy independently and negatively predict teens’ likelihood of sexual intercourse. Perceived norms against pregnancy predict increased likelihood of contraception among sexually experienced girls, but sexually experienced boys’ contraceptive behavior is more complicated: When both the boy and his peers or school have stronger norms against teen pregnancy he is more likely to contracept, and in the absence of school or peer norms against pregnancy, boys who are embarrassed are less likely to contracept. We conclude that: (1) patterns of behavior cannot adequately operationalize teen pregnancy norms, (2) norms are not simply linked to behaviors through individual perceptions, and (3) norms at different levels can operate independently of each other, interactively, or in opposition. This evidence creates space for conceptualizations of agency, conflict, and change that can lead to progress in understanding age norms and sexual behaviors. PMID:25104920
Mollborn, Stefanie; Domingue, Benjamin W; Boardman, Jason D
2014-06-01
Researchers seeking to understand teen sexual behaviors often turn to age norms, but they are difficult to measure quantitatively. Previous work has usually inferred norms from behavioral patterns or measured group-level norms at the individual level, ignoring multiple reference groups. Capitalizing on the multilevel design of the Add Health survey, we measure teen pregnancy norms perceived by teenagers, as well as average norms at the school and peer network levels. School norms predict boys' perceived norms, while peer network norms predict girls' perceived norms. Peer network and individually perceived norms against teen pregnancy independently and negatively predict teens' likelihood of sexual intercourse. Perceived norms against pregnancy predict increased likelihood of contraception among sexually experienced girls, but sexually experienced boys' contraceptive behavior is more complicated: When both the boy and his peers or school have stronger norms against teen pregnancy he is more likely to contracept, and in the absence of school or peer norms against pregnancy, boys who are embarrassed are less likely to contracept. We conclude that: (1) patterns of behavior cannot adequately operationalize teen pregnancy norms, (2) norms are not simply linked to behaviors through individual perceptions, and (3) norms at different levels can operate independently of each other, interactively, or in opposition. This evidence creates space for conceptualizations of agency, conflict, and change that can lead to progress in understanding age norms and sexual behaviors.
International Nuclear Information System (INIS)
2013-06-01
The IAEA attaches great importance to the dissemination of information that can assist Member States in the development, implementation, maintenance and continuous improvement of systems, programmes and activities that support the nuclear fuel cycle and nuclear applications, and that address the legacy of past practices and accidents. However, radioactive residues are found not only in nuclear fuel cycle activities, but also in a range of other industrial activities, including: - Mining and milling of metalliferous and non-metallic ores; - Production of non-nuclear fuels, including coal, oil and gas; - Extraction and purification of water (e.g. in the generation of geothermal energy, as drinking and industrial process water; in paper and pulp manufacturing processes); - Production of industrial minerals, including phosphate, clay and building materials; - Use of radionuclides, such as thorium, for properties other than their radioactivity. Naturally occurring radioactive material (NORM) may lead to exposures at some stage of these processes and in the use or reuse of products, residues or wastes. Several IAEA publications address NORM issues with a special focus on some of the more relevant industrial operations. This publication attempts to provide guidance on managing residues arising from different NORM type industries, and on pertinent residue management strategies and technologies, to help Member States gain perspectives on the management of NORM residues
McBreen, J.; Tosto, Di G.; Dignum, F.; Hofstede, G.J.
2011-01-01
The goal of this paper is to propose a method of modelling the evolution of social norms in different cultural settings. We analyse the role of culture in shaping agents' normative reasoning and hence their behaviour. The general notion of 'value' is discussed from the perspective of the BDI
Directory of Open Access Journals (Sweden)
Edward L. Rubin
2017-06-01
Full Text Available Objective to revisit the debate about rational choice theory from the legal cultural and historical perspectives. Methods dialectic approach to the cognition of social phenomena allowing to analyze them in their historical development and functioning in the context of the integrity of subjective and objective factors this determines the choice of the research methods systemicstructural formallegal and comparative. Results The first part of this chapter will explain the way in which people in societies different from our own were subject to other motivations in situations where selfinterest would tend to dominate in our society. The reasoning is based on three examples one drawn from the history of Ancient Rome one from the High Middle Ages of the European society and one from a contemporary nonWestern culture. The second part of the chapter analyzes the reason why material selfinterest maximizing became a dominant motivation in the modern Western society. The works on historical sociology attribute this development to Calvinism but this hypothesis suffers from some serious defects. In the article we prove that the modern sensibility resulted from much longeracting trends specifically secularization urbanization and commercialization. The final section of the chapter explores the relationship between the Westrsquos prevailing norm of selfinterest maximization and the particular norms that have been discussed in microeconomic theory. It argues that some of these norms are internal to the prevailing one and are thus explicable in terms of material selfinterest but that others reflect additional norms in the general society that exist alongside and sometimes in competition with the prevailing norm of selfinterest maximization. The historicallybased view that selfinterest maximizing is a prevailing norm rather than a human universal allows these other norms to be acknowledged in a plausible and realistic manner rather than being explained away by a
Main industries generating NORM; Principais industrias geradoras de NORM
Energy Technology Data Exchange (ETDEWEB)
Lauria, Dejanira da Costa; Mazzilli, Barbara Paci; Feliciano, Vanusa Maria Delage; Borges, Flavia Luiza Soares; Cruz, Paulo Roberto; Matta, Luiz Ernesto Santos de Carvalho
2016-07-01
This chapter 5 the industrial activities related to NORM question is presented. Besides, some industries that in Brazil have higher probability of occurrence de NORM are covered. Economic activities related to mining and its processing are listed.
Directory of Open Access Journals (Sweden)
Ryan Wen Liu
2017-03-01
Full Text Available Dynamic magnetic resonance imaging (MRI has been extensively utilized for enhancing medical living environment visualization, however, in clinical practice it often suffers from long data acquisition times. Dynamic imaging essentially reconstructs the visual image from raw (k,t-space measurements, commonly referred to as big data. The purpose of this work is to accelerate big medical data acquisition in dynamic MRI by developing a non-convex minimization framework. In particular, to overcome the inherent speed limitation, both non-convex low-rank and sparsity constraints were combined to accelerate the dynamic imaging. However, the non-convex constraints make the dynamic reconstruction problem difficult to directly solve through the commonly-used numerical methods. To guarantee solution efficiency and stability, a numerical algorithm based on Alternating Direction Method of Multipliers (ADMM is proposed to solve the resulting non-convex optimization problem. ADMM decomposes the original complex optimization problem into several simple sub-problems. Each sub-problem has a closed-form solution or could be efficiently solved using existing numerical methods. It has been proven that the quality of images reconstructed from fewer measurements can be significantly improved using non-convex minimization. Numerous experiments have been conducted on two in vivo cardiac datasets to compare the proposed method with several state-of-the-art imaging methods. Experimental results illustrated that the proposed method could guarantee the superior imaging performance in terms of quantitative and visual image quality assessments.
Visualizing Data as Objects by DC (Difference of Convex) Optimization
DEFF Research Database (Denmark)
Carrizosa, Emilio; Guerrero, Vanesa; Morales, Dolores Romero
2018-01-01
In this paper we address the problem of visualizing in a bounded region a set of individuals, which has attached a dissimilarity measure and a statistical value, as convex objects. This problem, which extends the standard Multidimensional Scaling Analysis, is written as a global optimization...... problem whose objective is the difference of two convex functions (DC). Suitable DC decompositions allow us to use the Difference of Convex Algorithm (DCA) in a very efficient way. Our algorithmic approach is used to visualize two real-world datasets....
Dynamic Planar Convex Hull with Optimal Query Time and O(log n · log log n ) Update Time
DEFF Research Database (Denmark)
Brodal, Gerth Stølting; Jakob, Riko
2000-01-01
The dynamic maintenance of the convex hull of a set of points in the plane is one of the most important problems in computational geometry. We present a data structure supporting point insertions in amortized O(log n · log log log n) time, point deletions in amortized O(log n · log log n) time......, and various queries about the convex hull in optimal O(log n) worst-case time. The data structure requires O(n) space. Applications of the new dynamic convex hull data structure are improved deterministic algorithms for the k-level problem and the red-blue segment intersection problem where all red and all...
Hernandez, Monica
2017-12-01
This paper proposes a method for primal-dual convex optimization in variational large deformation diffeomorphic metric mapping problems formulated with robust regularizers and robust image similarity metrics. The method is based on Chambolle and Pock primal-dual algorithm for solving general convex optimization problems. Diagonal preconditioning is used to ensure the convergence of the algorithm to the global minimum. We consider three robust regularizers liable to provide acceptable results in diffeomorphic registration: Huber, V-Huber and total generalized variation. The Huber norm is used in the image similarity term. The primal-dual equations are derived for the stationary and the non-stationary parameterizations of diffeomorphisms. The resulting algorithms have been implemented for running in the GPU using Cuda. For the most memory consuming methods, we have developed a multi-GPU implementation. The GPU implementations allowed us to perform an exhaustive evaluation study in NIREP and LPBA40 databases. The experiments showed that, for all the considered regularizers, the proposed method converges to diffeomorphic solutions while better preserving discontinuities at the boundaries of the objects compared to baseline diffeomorphic registration methods. In most cases, the evaluation showed a competitive performance for the robust regularizers, close to the performance of the baseline diffeomorphic registration methods.
Soft-tissue cephalometric norms for the Lambada population in Telangana Region of Andhra Pradesh
Directory of Open Access Journals (Sweden)
Mayuri Thomas
2012-01-01
Conclusion: Although established Caucasian norms are applicable to the Lambada ethnic tribe, few parameters like basic upper lip thickness (ULT and upper lip strain (ULS, skeletal convexity, inferior sulcus to H line (LS-H were significantly different. The male group exhibited straighter profile, thicker lips, prominent nose, deep mentolabial sulcus, and a prominent chin than females. The differences could be considered in diagnosis and treatment planning for orthodontic practice and for orthognathic surgery.
Combining norms to prove termination
DEFF Research Database (Denmark)
Genaim, S.; Codish, M.; Gallagher, John Patrick
2002-01-01
Automatic termination analysers typically measure the size of terms applying norms which are mappings from terms to the natural numbers. This paper illustrates howt o enable the use of size functions defined as tuples of these simpler norm functions. This approach enables us to simplify the probl...... of the recursive data-types in the program, is often a suitable choice. We first demonstrate the power of combining norm functions and then the adequacy of combining norms based on regular types....
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)
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].
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.
Entropy and convexity for nonlinear partial differential equations.
Ball, John M; Chen, Gui-Qiang G
2013-12-28
Partial differential equations are ubiquitous in almost all applications of mathematics, where they provide a natural mathematical description of many phenomena involving change in physical, chemical, biological and social processes. The concept of entropy originated in thermodynamics and statistical physics during the nineteenth century to describe the heat exchanges that occur in the thermal processes in a thermodynamic system, while the original notion of convexity is for sets and functions in mathematics. Since then, entropy and convexity have become two of the most important concepts in mathematics. In particular, nonlinear methods via entropy and convexity have been playing an increasingly important role in the analysis of nonlinear partial differential equations in recent decades. This opening article of the Theme Issue is intended to provide an introduction to entropy, convexity and related nonlinear methods for the analysis of nonlinear partial differential equations. We also provide a brief discussion about the content and contributions of the papers that make up this Theme Issue.
Multi-objective convex programming problem arising in multivariate ...
African Journals Online (AJOL)
user
Multi-objective convex programming problem arising in ... However, although the consideration of multiple objectives may seem a novel concept, virtually any nontrivial ..... Solving multiobjective programming problems by discrete optimization.
Strict topoligies in non-Archimedean function spaces
Directory of Open Access Journals (Sweden)
A. K. Katsaras
1984-01-01
Full Text Available Let F be a non-trivial complete non-Archimedean valued field. Some locally F-convex topologies, on the space Cb(X,E of all bounded continuous functions from a zero-dimensional topological space X to a non-Archimedean locally F-convex space E, are studied. The corresponding dual spaces are also investigated.
Variation, structure and norms
DEFF Research Database (Denmark)
Harder, Peter
2014-01-01
in linguistics: those that see linguistic norms as antithetical to a descriptive and variational linguistics. Once such a re-evaluation has taken place, however, the social recontextualization of cognition will enable linguistics (including sociolinguistics as an integral part), to eliminate the cracks...... that an evolutionary account can reintegrate the opposed fragments into a whole picture that puts each of them in their ‘ecological position’ with respect to each other. Empirical usage facts should be seen in the context of operational norms in relation to which actual linguistic choices represent adaptations....... Variational patterns should be seen in the context of structural categories without which there would be only ‘differences’ rather than variation. And emergence, individual choice, and flux should be seen in the context of the individual’s dependence on lineages of community practice sustained by collective...
Italian Word Association Norms.
1966-07-01
and Russell, VI.A. Systematic changes in word association norms: 1910-1952. Journal of Abnormal and Social Psychology, 19C0, 60, 293-303. lilb Kurez, I...Acsorbento, Cartone, Celluloee, Compiti, Disegno, !)o- cuwe-m~to, Gnibinetto, Gihills, Goinma, Lete, Licer~ .a, l!ateri.Ble, Notp, Penna, Problema ...Ostiflato, flifatto, Ruvido, Seno, Somaro, Studio, Tavolo FACILITA’( 42,31) 36 Difficolth 7 Difficile, Semplicit~. 5 Problema 2 Grande, Impossibile
DEFF Research Database (Denmark)
Hahonou, Eric Komlavi
2015-01-01
The chapter investigates the inhospitality of Nigerien hospitals. Based on participant observation with the National Hospital of Niamey, the author describes the daily functioning of the emergency services. He points out the crucial role played by the patients' attendants in oiling the functionin...... of health facilities and the provision of care. The article explores how medical staff interact with patients and how they both contribute in producing the practical norms that shape the functioning of the emergency service....
Surgical treatment of convexity focal epilepsy
International Nuclear Information System (INIS)
Shimizu, Hiroyuki; Ishijima, Buichi; Iio, Masaaki.
1987-01-01
We have hitherto applied PET study in 72 epileptic patients. The main contents of their seizures consists of complex partial in 32, elementary partial in 32, generalized in 6, and others in 3 cases. We administered perorally 10 mCi glucose labeled with C11 produced in the JSW Baby Cyclotron for the study of CMRG(cerebral metabolic rate of glucose). The continuous inhalation method of CO 2 and O 2 labeled with O15 produced in the same cyclotron was also employed for measurement of rCBE(cerebral blood flow) and CMRO 2 (cerebral metabolic rate of oxygen). In both studies, epileptic foci were shown as well demarcated hypometabolic zones with decreased CMRG, rCBF or CMRO 2 . The locations of PET diagnosed foci were not contradictory with the clinical symptoms, scalp EEGs or X-ray CT findings. Of the 32 patients with the convexity epileptic foci, 8 patients underwent surgical treatment. Prior to the surgical intervention, subdural strip electrodes were inserted in the four cases for further assessment of focus locations. Subdural EEG disclosed very active brain activity with high amplitude 4 to 5 times scalp EEG and revealed epileptiform discharges most of which were not detected by scalp recording. PET scans did not characterize epileptogenic nature of a lesion. Subdural recording therefore was useful for detecting the foci responsible for habitual seizures in the cases with multiple PET foci. Ambiguous hypometabolic zones on PECT images also could be confirmed by the subdural technique. Of the 8 operated cases, five patients are seizure free, one is signigicantly improved and two are not improved although the postoperative follow-up is too short for precise evaluation. (J.P.N.)
Efficiency and Generalized Convex Duality for Nondifferentiable Multiobjective Programs
Directory of Open Access Journals (Sweden)
Bae KwanDeok
2010-01-01
Full Text Available We introduce nondifferentiable multiobjective programming problems involving the support function of a compact convex set and linear functions. The concept of (properly efficient solutions are presented. We formulate Mond-Weir-type and Wolfe-type dual problems and establish weak and strong duality theorems for efficient solutions by using suitable generalized convexity conditions. Some special cases of our duality results are given.
Two examples of non strictly convex large deviations
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.
Mutational analysis a joint framework for Cauchy problems in and beyond vector spaces
Lorenz, Thomas
2010-01-01
Ordinary differential equations play a central role in science and have been extended to evolution equations in Banach spaces. For many applications, however, it is difficult to specify a suitable normed vector space. Shapes without a priori restrictions, for example, do not have an obvious linear structure. This book generalizes ordinary differential equations beyond the borders of vector spaces with a focus on the well-posed Cauchy problem in finite time intervals. Here are some of the examples: - Feedback evolutions of compact subsets of the Euclidean space - Birth-and-growth processes of random sets (not necessarily convex) - Semilinear evolution equations - Nonlocal parabolic differential equations - Nonlinear transport equations for Radon measures - A structured population model - Stochastic differential equations with nonlocal sample dependence and how they can be coupled in systems immediately - due to the joint framework of Mutational Analysis. Finally, the book offers new tools for modelling.
Decompositions, partitions, and coverings with convex polygons and pseudo-triangles
Aichholzer, O.; Huemer, C.; Kappes, S.; Speckmann, B.; Tóth, Cs.D.
2007-01-01
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangles. This pseudo-convex decomposition is significantly sparser than either convex decompositions or pseudo-triangulations for planar point sets and simple polygons. We also introduce pseudo-convex
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.)
Norms for environmentally responsible behaviour
DEFF Research Database (Denmark)
Thøgersen, John
The currently used concept of personal or moral norms is ambiguous with regard to its motivational content. Therefore, a revision of the norm taxonomy is suggested, implying a distinction between three types of personal norms, called introjected, identified, and integrated norms. A preliminary as...... is also supported, with the reservation that the different behavioural references are more than just different methods of measuring the same latent construct(s). People evidently hold different norms for different environmentally responsible behaviours.......The currently used concept of personal or moral norms is ambiguous with regard to its motivational content. Therefore, a revision of the norm taxonomy is suggested, implying a distinction between three types of personal norms, called introjected, identified, and integrated norms. A preliminary...... assessment of the taxonomy is carried out based of a survey of a random sample of Danish residents 18 years or older. A range of norm constructs were measured with regard to four environmentally relevant behaviours: buying organic milk, buying energy saving light bulbs, source-separating compostable kitchen...
DEFF Research Database (Denmark)
Hahonou, Eric Komlavi
2017-01-01
The article shows that care in developing countries is a complex matter that cannot be reduced to corrupt practices. The literature on informal payments highlights the role played by corrupt practices in the health sector and tends to attribute corruption to a so-called ‘endemic culture of gifts’...... to the fabrication of the practical norms that regulate the daily functioning of health facilities and shape people’s behaviour.......’. However, as the case of the emergency service of Niamey National Hospital suggests the interactions between civil servants and users in health facilities have little to do with a traditional culture. They are better understood through the lens of practical norms. Furthermore, as the authors demonstrates...... of the services provided by the medical staff, it also depends on the qualifications of the persons (relatives, friends) accompanying the patient. In Niger (and other developing countries), the patient’s attendant is a crucial component of the organisation and the effectiveness of health facilities in emergency...
Social Norms: Do We Love Norms Too Much?
Bell, David C; Cox, Mary L
2015-03-01
Social norms are often cited as the cause of many social phenomena, especially as an explanation for prosocial family and relationship behaviors. And yet maybe we love the idea of social norms too much, as suggested by our failure to subject them to rigorous test. Compared to the detail in social norms theoretical orientations, there is very little detail in tests of normative theories. To provide guidance to researchers who invoke social norms as explanations, we catalog normative orientations that have been proposed to account for consistent patterns of action. We call on researchers to conduct tests of normative theories and the processes such theories assert.
Convex unwraps its first grown-up supercomputer
Energy Technology Data Exchange (ETDEWEB)
Manuel, T.
1988-03-03
Convex Computer Corp.'s new supercomputer family is even more of an industry blockbuster than its first system. At a tenfold jump in performance, it's far from just an incremental upgrade over its first minisupercomputer, the C-1. The heart of the new family, the new C-2 processor, churning at 50 million floating-point operations/s, spawns a group of systems whose performance could pass for some fancy supercomputers-namely those of the Cray Research Inc. family. When added to the C-1, Convex's five new supercomputers create the C series, a six-member product group offering a performance range from 20 to 200 Mflops. They mark an important transition for Convex from a one-product high-tech startup to a multinational company with a wide-ranging product line. It's a tough transition but the Richardson, Texas, company seems to be doing it. The extended product line propels Convex into the upper end of the minisupercomputer class and nudges it into the low end of the big supercomputers. It positions Convex in an uncrowded segment of the market in the $500,000 to $1 million range offering 50 to 200 Mflops of performance. The company is making this move because the minisuper area, which it pioneered, quickly became crowded with new vendors, causing prices and gross margins to drop drastically.
Inhibitory competition in figure-ground perception: context and convexity.
Peterson, Mary A; Salvagio, Elizabeth
2008-12-15
Convexity has long been considered a potent cue as to which of two regions on opposite sides of an edge is the shaped figure. Experiment 1 shows that for a single edge, there is only a weak bias toward seeing the figure on the convex side. Experiments 1-3 show that the bias toward seeing the convex side as figure increases as the number of edges delimiting alternating convex and concave regions increases, provided that the concave regions are homogeneous in color. The results of Experiments 2 and 3 rule out a probability summation explanation for these context effects. Taken together, the results of Experiments 1-3 show that the homogeneity versus heterogeneity of the convex regions is irrelevant. Experiment 4 shows that homogeneity of alternating regions is not sufficient for context effects; a cue that favors the perception of the intervening regions as figures is necessary. Thus homogeneity alone does not alone operate as a background cue. We interpret our results within a model of figure-ground perception in which shape properties on opposite sides of an edge compete for representation and the competitive strength of weak competitors is further reduced when they are homogeneous.
Zheng, Wenming; Lin, Zhouchen; Wang, Haixian
2014-04-01
A novel discriminant analysis criterion is derived in this paper under the theoretical framework of Bayes optimality. In contrast to the conventional Fisher's discriminant criterion, the major novelty of the proposed one is the use of L1 norm rather than L2 norm, which makes it less sensitive to the outliers. With the L1-norm discriminant criterion, we propose a new linear discriminant analysis (L1-LDA) method for linear feature extraction problem. To solve the L1-LDA optimization problem, we propose an efficient iterative algorithm, in which a novel surrogate convex function is introduced such that the optimization problem in each iteration is to simply solve a convex programming problem and a close-form solution is guaranteed to this problem. Moreover, we also generalize the L1-LDA method to deal with the nonlinear robust feature extraction problems via the use of kernel trick, and hereafter proposed the L1-norm kernel discriminant analysis (L1-KDA) method. Extensive experiments on simulated and real data sets are conducted to evaluate the effectiveness of the proposed method in comparing with the state-of-the-art methods.
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)
Transient disturbance growth in flows over convex surfaces
Karp, Michael; Hack, M. J. Philipp
2017-11-01
Flows over curved surfaces occur in a wide range of applications including airfoils, compressor and turbine vanes as well as aerial, naval and ground vehicles. In most of these applications the surface has convex curvature, while concave surfaces are less common. Since monotonic boundary-layer flows over convex surfaces are exponentially stable, they have received considerably less attention than flows over concave walls which are destabilized by centrifugal forces. Non-modal mechanisms may nonetheless enable significant disturbance growth which can make the flow susceptible to secondary instabilities. A parametric investigation of the transient growth and secondary instability of flows over convex surfaces is performed. The specific conditions yielding the maximal transient growth and strongest instability are identified. The effect of wall-normal and spanwise inflection points on the instability process is discussed. Finally, the role and significance of additional parameters, such as the geometry and pressure gradient, is analyzed.
Tensor norms and operator ideals
Defant, A; Floret, K
1992-01-01
The three chapters of this book are entitled Basic Concepts, Tensor Norms, and Special Topics. The first may serve as part of an introductory course in Functional Analysis since it shows the powerful use of the projective and injective tensor norms, as well as the basics of the theory of operator ideals. The second chapter is the main part of the book: it presents the theory of tensor norms as designed by Grothendieck in the Resumé and deals with the relation between tensor norms and operator ideals. The last chapter deals with special questions. Each section is accompanied by a series of exer
Norm waste management in Malaysia
International Nuclear Information System (INIS)
Muhamat Omar
2000-01-01
There are a number of industries generating NORM wastes in Malaysia. These include oil and gas and minerals/ores processing industries. A safe management of radioactive wastes is required. The existing guidelines are insufficient to help the management of oil and gas wastes. More guidelines are required to deal with NORM wastes from minerals/ores processing industries. To ensure that radioactive wastes are safely managed and disposed of, a National Policy on the Safe Management of Radioactive Waste is being developed which also include NORM waste. This paper describes the current status of NORM waste management in Malaysia. (author)
Trace Norm Regularized CANDECOMP/PARAFAC Decomposition With Missing Data.
Liu, Yuanyuan; Shang, Fanhua; Jiao, Licheng; Cheng, James; Cheng, Hong
2015-11-01
In recent years, low-rank tensor completion (LRTC) problems have received a significant amount of attention in computer vision, data mining, and signal processing. The existing trace norm minimization algorithms for iteratively solving LRTC problems involve multiple singular value decompositions of very large matrices at each iteration. Therefore, they suffer from high computational cost. In this paper, we propose a novel trace norm regularized CANDECOMP/PARAFAC decomposition (TNCP) method for simultaneous tensor decomposition and completion. We first formulate a factor matrix rank minimization model by deducing the relation between the rank of each factor matrix and the mode- n rank of a tensor. Then, we introduce a tractable relaxation of our rank function, and then achieve a convex combination problem of much smaller-scale matrix trace norm minimization. Finally, we develop an efficient algorithm based on alternating direction method of multipliers to solve our problem. The promising experimental results on synthetic and real-world data validate the effectiveness of our TNCP method. Moreover, TNCP is significantly faster than the state-of-the-art methods and scales to larger problems.
Shah, S.; Gray, F.; Yang, J.; Crawshaw, J.; Boek, E.
2016-12-01
Advances in 3D pore-scale imaging and computational methods have allowed an exceptionally detailed quantitative and qualitative analysis of the fluid flow in complex porous media. A fundamental problem in pore-scale imaging and modelling is how to represent and model the range of scales encountered in porous media, starting from the smallest pore spaces. In this study, a novel method is presented for determining the representative elementary volume (REV) of a rock for several parameters simultaneously. We calculate the two main macroscopic petrophysical parameters, porosity and single-phase permeability, using micro CT imaging and Lattice Boltzmann (LB) simulations for 14 different porous media, including sandpacks, sandstones and carbonates. The concept of the `Convex Hull' is then applied to calculate the REV for both parameters simultaneously using a plot of the area of the convex hull as a function of the sub-volume, capturing the different scales of heterogeneity from the pore-scale imaging. The results also show that the area of the convex hull (for well-chosen parameters such as the log of the permeability and the porosity) decays exponentially with sub-sample size suggesting a computationally efficient way to determine the system size needed to calculate the parameters to high accuracy (small convex hull area). Finally we propose using a characteristic length such as the pore size to choose an efficient absolute voxel size for the numerical rock.
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....
Convex Hull Abstraction in Specialisation of CLP Programs
DEFF Research Database (Denmark)
Peralta, J.C.; Gallagher, John Patrick
2003-01-01
We introduce an abstract domain consisting of atomic formulas constrained by linear arithmetic constraints (or convex hulls). This domain is used in an algorithm for specialization of constraint logic programs. The algorithm incorporates in a single phase both top-down goal directed propagation...... and bottom-up answer propagation, and uses a widening on the convex hull domain to ensure termination. We give examples to show the precision gained by this approach over other methods in the literature for specializing constraint logic programs. The specialization method can also be used for ordinary logic...
Closedness type regularity conditions in convex optimization and beyond
Directory of Open Access Journals (Sweden)
Sorin-Mihai Grad
2016-09-01
Full Text Available The closedness type regularity conditions have proven during the last decade to be viable alternatives to their more restrictive interiority type counterparts, in both convex optimization and different areas where it was successfully applied. In this review article we de- and reconstruct some closedness type regularity conditions formulated by means of epigraphs and subdifferentials, respectively, for general optimization problems in order to stress that they arise naturally when dealing with such problems. The results are then specialized for constrained and unconstrained convex optimization problems. We also hint towards other classes of optimization problems where closedness type regularity conditions were successfully employed and discuss other possible applications of them.
Distribution functions of sections and projections of convex bodies
Kim, Jaegil; Yaskin, Vladyslav; Zvavitch, Artem
2015-01-01
Typically, when we are given the section (or projection) function of a convex body, it means that in each direction we know the size of the central section (or projection) perpendicular to this direction. Suppose now that we can only get the information about the sizes of sections (or projections), and not about the corresponding directions. In this paper we study to what extent the distribution function of the areas of central sections (or projections) of a convex body can be used to derive ...
Interpolation Error Estimates for Mean Value Coordinates over Convex Polygons.
Rand, Alexander; Gillette, Andrew; Bajaj, Chandrajit
2013-08-01
In a similar fashion to estimates shown for Harmonic, Wachspress, and Sibson coordinates in [Gillette et al., AiCM, to appear], we prove interpolation error estimates for the mean value coordinates on convex polygons suitable for standard finite element analysis. Our analysis is based on providing a uniform bound on the gradient of the mean value functions for all convex polygons of diameter one satisfying certain simple geometric restrictions. This work makes rigorous an observed practical advantage of the mean value coordinates: unlike Wachspress coordinates, the gradient of the mean value coordinates does not become large as interior angles of the polygon approach π.
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)
Norm-Aware Socio-Technical Systems
Savarimuthu, Bastin Tony Roy; Ghose, Aditya
The following sections are included: * Introduction * The Need for Norm-Aware Systems * Norms in human societies * Why should software systems be norm-aware? * Case Studies of Norm-Aware Socio-Technical Systems * Human-computer interactions * Virtual environments and multi-player online games * Extracting norms from big data and software repositories * Norms and Sustainability * Sustainability and green ICT * Norm awareness through software systems * Where To, From Here? * Conclusions
Image restoration by the method of convex projections: part 1 theory.
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.
The selection problem for discounted Hamilton–Jacobi equations: some non-convex cases
Gomes, Diogo A.; Mitake, Hiroyoshi; Tran, Hung V.
2018-01-01
Here, we study the selection problem for the vanishing discount approximation of non-convex, first-order Hamilton–Jacobi equations. While the selection problem is well understood for convex Hamiltonians, the selection problem for non-convex Hamiltonians has thus far not been studied. We begin our study by examining a generalized discounted Hamilton–Jacobi equation. Next, using an exponential transformation, we apply our methods to strictly quasi-convex and to some non-convex Hamilton–Jacobi equations. Finally, we examine a non-convex Hamiltonian with flat parts to which our results do not directly apply. In this case, we establish the convergence by a direct approach.
The selection problem for discounted Hamilton–Jacobi equations: some non-convex cases
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.
All-Norm Approximation Algorithms
Azar, Yossi; Epstein, Leah; Richter, Yossi; Woeginger, Gerhard J.; Penttonen, Martti; Meineche Schmidt, Erik
2002-01-01
A major drawback in optimization problems and in particular in scheduling problems is that for every measure there may be a different optimal solution. In many cases the various measures are different ℓ p norms. We address this problem by introducing the concept of an All-norm ρ-approximation
Distributed Controllers for Norm Enforcement
Testerink, B.J.G.; Dastani, M.M.; Bulling, Nils
2016-01-01
This paper focuses on computational mechanisms that control the behavior of autonomous systems at runtime without necessarily restricting their autonomy. We build on existing approaches from runtime verification, control automata, and norm-based systems, and define norm-based controllers that
Directory of Open Access Journals (Sweden)
2006-01-01
Full Text Available We consider the problem of minimizing a convex separable logarithmic function over a region defined by a convex inequality constraint or linear equality constraint, and two-sided bounds on the variables (box constraints. Such problems are interesting from both theoretical and practical point of view because they arise in some mathematical programming problems as well as in various practical problems such as problems of production planning and scheduling, allocation of resources, decision making, facility location problems, and so forth. Polynomial algorithms are proposed for solving problems of this form and their convergence is proved. Some examples and results of numerical experiments are also presented.
Norms of certain Jordan elementary operators
Zhang, Xiaoli; Ji, Guoxing
2008-10-01
Let be a complex Hilbert space and let denote the algebra of all bounded linear operators on . For , the Jordan elementary operator UA,B is defined by UA,B(X)=AXB+BXA, . In this short note, we discuss the norm of UA,B. We show that if and ||UA,B||=||A||||B||, then either AB* or B*A is 0. We give some examples of Jordan elementary operators UA,B such that ||UA,B||=||A||||B|| but AB*[not equal to]0 and B*A[not equal to]0, which answer negatively a question posed by M. Boumazgour in [M. Boumazgour, Norm inequalities for sums of two basic elementary operators, J. Math. Anal. Appl. 342 (2008) 386-393].
International Nuclear Information System (INIS)
Canoba, Analia Cecilia; Gnoni, Gabriela Alejandra; Truppa, W.
2008-01-01
The oil and gas industry, which is especially significant in Argentina, is one industry that concentrates natural radionuclides during its processes. In addition, there are a few underground mines under development, where radon levels may be high. The Nuclear Regulatory Authority of Argentina (ARN) carried out a project with the objective of evaluating NORM, mainly in these types of industries. Eight facilities were characterized, three related to the gas industry, four related to the oil industry and a survey of radon gas in a gold underground mine. First, background measurements were made and then a screening survey was carried out to detect values above background. Of the values obtained, 57% were in the background range, 19% were below 2 μSv/h, 15% were in the range 2-10 μSv/h and 9% were above 10 μSv/h. Some values were as high as 400 μSv/h. The annual effective doses were estimated to be in the range 0.02-1.6 mSv/a. Samples were taken and later analysed by gamma spectrometry, liquid scintillation and fluorimetry. It was confirmed that the main radionuclides involved in the oil and gas extraction process are 226 Ra and 228 Ra. The radium isotope concentrations measured in some samples were above the exemption values established by the International Basic Safety Standards. Elevated radon levels were detected in gas facilities and in the gold mine under development. The values obtained in gas facilities showed that radon concentrates in the ethane and propane flows. As the flows in the gas industry are confined, it does not mean an exposure during normal operation. In the case of the gold mine, the values detected were informed to the pertinent authorities as well as the facility in order to take actions to reduce concentrations below the action levels. Finally, protective measures to reduce occupational doses in the cleaning and maintenance processes were suggested, as well as for storage of NORM-contaminated items. (author)
On the polarizability dyadics of electrically small, convex objects
Lakhtakia, Akhlesh
1993-11-01
This communication on the polarizability dyadics of electrically small objects of convex shapes has been prompted by a recent paper published by Sihvola and Lindell on the polarizability dyadic of an electrically gyrotropic sphere. A mini-review of recent work on polarizability dyadics is appended.
Riemann solvers and undercompressive shocks of convex FPU chains
International Nuclear Information System (INIS)
Herrmann, Michael; Rademacher, Jens D M
2010-01-01
We consider FPU-type atomic chains with general convex potentials. The naive continuum limit in the hyperbolic space–time scaling is the p-system of mass and momentum conservation. We systematically compare Riemann solutions to the p-system with numerical solutions to discrete Riemann problems in FPU chains, and argue that the latter can be described by modified p-system Riemann solvers. We allow the flux to have a turning point, and observe a third type of elementary wave (conservative shocks) in the atomistic simulations. These waves are heteroclinic travelling waves and correspond to non-classical, undercompressive shocks of the p-system. We analyse such shocks for fluxes with one or more turning points. Depending on the convexity properties of the flux we propose FPU-Riemann solvers. Our numerical simulations confirm that Lax shocks are replaced by so-called dispersive shocks. For convex–concave flux we provide numerical evidence that convex FPU chains follow the p-system in generating conservative shocks that are supersonic. For concave–convex flux, however, the conservative shocks of the p-system are subsonic and do not appear in FPU-Riemann solutions
On the Convexity of Step out - Step in Sequencing Games
Musegaas, Marieke; Borm, Peter; Quant, Marieke
2016-01-01
The main result of this paper is the convexity of Step out - Step in (SoSi) sequencing games, a class of relaxed sequencing games first analyzed by Musegaas, Borm, and Quant (2015). The proof makes use of a polynomial time algorithm determining the value and an optimal processing order for an
Preconditioning 2D Integer Data for Fast Convex Hull Computations.
Cadenas, José Oswaldo; Megson, Graham M; Luengo Hendriks, Cris L
2016-01-01
In order to accelerate computing the convex hull on a set of n points, a heuristic procedure is often applied to reduce the number of points to a set of s points, s ≤ n, which also contains the same hull. We present an algorithm to precondition 2D data with integer coordinates bounded by a box of size p × q before building a 2D convex hull, with three distinct advantages. First, we prove that under the condition min(p, q) ≤ n the algorithm executes in time within O(n); second, no explicit sorting of data is required; and third, the reduced set of s points forms a simple polygonal chain and thus can be directly pipelined into an O(n) time convex hull algorithm. This paper empirically evaluates and quantifies the speed up gained by preconditioning a set of points by a method based on the proposed algorithm before using common convex hull algorithms to build the final hull. A speedup factor of at least four is consistently found from experiments on various datasets when the condition min(p, q) ≤ n holds; the smaller the ratio min(p, q)/n is in the dataset, the greater the speedup factor achieved.
Convex relationships in ecosystems containing mixtures of trees and grass
CSIR Research Space (South Africa)
Scholes, RJ
2003-12-01
Full Text Available The relationship between grass production and the quantity of trees in mixed tree-grass ecosystems (savannas) is convex for all or most of its range. In other words, the grass production declines more steeply per unit increase in tree quantity...
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.
A duality recipe for non-convex variational problems
Bouchitté, Guy; Phan, Minh
2018-03-01
The aim of this paper is to present a general convexification recipe that can be useful for studying non-convex variational problems. In particular, this allows us to treat such problems by using a powerful primal-dual scheme. Possible further developments and open issues are given. xml:lang="fr"
A note on the nucleolus for 2-convex TU games
Driessen, Theo; Hou, D.
For 2-convex n-person cooperative TU games, the nucleolus is determined as some type of constrained equal award rule. Its proof is based on Maschler, Peleg, and Shapley’s geometrical characterization for the intersection of the prekernel with the core. Pairwise bargaining ranges within the core are
A convex optimization approach for solving large scale linear systems
Directory of Open Access Journals (Sweden)
Debora Cores
2017-01-01
Full Text Available The well-known Conjugate Gradient (CG method minimizes a strictly convex quadratic function for solving large-scale linear system of equations when the coefficient matrix is symmetric and positive definite. In this work we present and analyze a non-quadratic convex function for solving any large-scale linear system of equations regardless of the characteristics of the coefficient matrix. For finding the global minimizers, of this new convex function, any low-cost iterative optimization technique could be applied. In particular, we propose to use the low-cost globally convergent Spectral Projected Gradient (SPG method, which allow us to extend this optimization approach for solving consistent square and rectangular linear system, as well as linear feasibility problem, with and without convex constraints and with and without preconditioning strategies. Our numerical results indicate that the new scheme outperforms state-of-the-art iterative techniques for solving linear systems when the symmetric part of the coefficient matrix is indefinite, and also for solving linear feasibility problems.
Transonic shock wave. Boundary layer interaction at a convex wall
Koren, B.; Bannink, W.J.
1984-01-01
A standard finite element procedure has been applied to the problem of transonic shock wave – boundary layer interaction at a convex wall. The method is based on the analytical Bohning-Zierep model, where the boundary layer is perturbed by a weak normal shock wave which shows a singular pressure
Computing Convex Coverage Sets for Faster Multi-Objective Coordination
Roijers, D.M.; Whiteson, S.; Oliehoek, F.A.
2015-01-01
In this article, we propose new algorithms for multi-objective coordination graphs (MO-CoGs). Key to the efficiency of these algorithms is that they compute a convex coverage set (CCS) instead of a Pareto coverage set (PCS). Not only is a CCS a sufficient solution set for a large class of problems,
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.
Radioactive waste management / NORM wastes; Gerenciamento de residuos / rejeitos NORM
Energy Technology Data Exchange (ETDEWEB)
Schenato, Flavia; Ruperti Junior, Nerbe Jose Ruperti
2016-07-01
The chapter 8 presents the waste management of the mineral industries as the main problem pointed out by the inspections, due to the the inadequate deposition with consequences to the human populations and the environment. The concepts about the criteria of exemption and the related legislation are also presented. Several different technical solutions for de NORM waste deposition are mentioned. Finally, the reutilization and recycling of NORM are covered.
Regulation of NORM industries and NORM residues in Belgium
Energy Technology Data Exchange (ETDEWEB)
Biermans, G.; Dehandschutter, B.; Pepin, S.; Sonck, M. [Federal Agency for Nuclear Control - FANC (Belgium)
2014-07-01
In the Belgian Royal Decree of 20 July 2001, which transposed the EU Directive 96/26/EURATOM (BSS) into national legislation regarding radiation protection regulations, a list of 'work activities involving natural radiation sources' (i.e. NORM industries) was defined based on the concept described in Article 40 of the Directive. These activities are subject to declaration to the Belgian radiation protection authority (Federal Agency for Nuclear Control - FANC). The initial list was subsequently modified by a FANC decree in 2012 to reflect the increased knowledge about NORM in other industrial sectors, most of which have also been added in the recently published New Basic Safety Standards (Directive 2013/53/EURATOM). In March 2013, an additional decree was published by FANC regulating the acceptance of NORM residues by non-radioactive waste treatment facilities. This regulation was fitted within the framework described above by introducing NORM residue treatment into the existing NORM industry list. It introduces generic exemption levels above which the processing or disposal of NORM residues will be considered as a 'work activity' and submitted to declaration according to the Belgian radiation protection regulations. On basis of this declaration, specific acceptance criteria are assigned to the disposal or processing facility. FANC has published technical and methodological guides for the operators of the concerned facilities and industries to facilitate the declaration process, and has recently organized a round-table gathering both NORM industries and waste processing industries to identify the needs, uncertainties and concerns regarding the regulatory control of NORM in Belgium. Document available in abstract form only. (authors)
Hermite-Hadamard type inequality for φ{sub h}-convex stochastic processes
Energy Technology Data Exchange (ETDEWEB)
Sarıkaya, Mehmet Zeki, E-mail: sarikayamz@gmail.com [Department of Mathematics, Faculty of Science and Arts, Düzce University, Düzce (Turkey); Kiriş, Mehmet Eyüp, E-mail: kiris@aku.edu.tr [Department of Mathematics, Institute of Science and Arts, Afyon Kocatepe University, Afyonkarahisar (Turkey); Çelik, Nuri, E-mail: ncelik@bartin.edu.tr [Department of Statistics, Faculty of Science, Bartın University, Bartın-Turkey (Turkey)
2016-04-18
The main aim of the present paper is to introduce φ{sub h}-convex stochastic processes and we investigate main properties of these mappings. Moreover, we prove the Hadamard-type inequalities for φ{sub h}-convex stochastic processes. We also give some new general inequalities for φ{sub h}-convex stochastic processes.
Naturally Occurring Radioactive Materials (NORM)
International Nuclear Information System (INIS)
Gray, P.
1997-01-01
This paper discusses the broad problems presented by Naturally Occuring Radioactive Materials (NORM). Technologically Enhanced naturally occuring radioactive material includes any radionuclides whose physical, chemical, radiological properties or radionuclide concentration have been altered from their natural state. With regard to NORM in particular, radioactive contamination is radioactive material in an undesired location. This is a concern in a range of industries: petroleum; uranium mining; phosphorus and phosphates; fertilizers; fossil fuels; forestry products; water treatment; metal mining and processing; geothermal energy. The author discusses in more detail the problem in the petroleum industry, including the isotopes of concern, the hazards they present, the contamination which they cause, ways to dispose of contaminated materials, and regulatory issues. He points out there are three key programs to reduce legal exposure and problems due to these contaminants: waste minimization; NORM assesment (surveys); NORM compliance (training)
Naturally Occurring Radioactive Materials (NORM)
Energy Technology Data Exchange (ETDEWEB)
Gray, P. [ed.
1997-02-01
This paper discusses the broad problems presented by Naturally Occuring Radioactive Materials (NORM). Technologically Enhanced naturally occuring radioactive material includes any radionuclides whose physical, chemical, radiological properties or radionuclide concentration have been altered from their natural state. With regard to NORM in particular, radioactive contamination is radioactive material in an undesired location. This is a concern in a range of industries: petroleum; uranium mining; phosphorus and phosphates; fertilizers; fossil fuels; forestry products; water treatment; metal mining and processing; geothermal energy. The author discusses in more detail the problem in the petroleum industry, including the isotopes of concern, the hazards they present, the contamination which they cause, ways to dispose of contaminated materials, and regulatory issues. He points out there are three key programs to reduce legal exposure and problems due to these contaminants: waste minimization; NORM assesment (surveys); NORM compliance (training).
Dufwenberg, Martin; Lundholm, Michael
1997-01-01
The probability of income loss depends on talent and effort. Effort has positive externalities and therefore individuals are proportion to their perceived diligence. The social norm requires more effort from individuals perceived as more talented, but talent is private information and individuals cunningly choose effort so as to manipulate the public perception of their talent. We analyze the workings of a social insurance system in this setting. It turns out that social norms may mitigate mo...
Civilsamfundets ABC: N for Norm
DEFF Research Database (Denmark)
Lund, Anker Brink; Meyer, Gitte
2016-01-01
Bogstaveligt talt: Hvad er civilsamfundet? Anker Brink Lund og Gitte Meyer fra CBS Center for Civil Society Studies gennemgår civilsamfundet bogstav for bogstav. Vi er nået til N for Norm.......Bogstaveligt talt: Hvad er civilsamfundet? Anker Brink Lund og Gitte Meyer fra CBS Center for Civil Society Studies gennemgår civilsamfundet bogstav for bogstav. Vi er nået til N for Norm....
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.
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.
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.
Convex variational problems linear, nearly linear and anisotropic growth conditions
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.
Constrained convex minimization via model-based excessive gap
Tran Dinh, Quoc; Cevher, Volkan
2014-01-01
We introduce a model-based excessive gap technique to analyze first-order primal- dual methods for constrained convex minimization. As a result, we construct new primal-dual methods with optimal convergence rates on the objective residual and the primal feasibility gap of their iterates separately. Through a dual smoothing and prox-function selection strategy, our framework subsumes the augmented Lagrangian, and alternating methods as special cases, where our rates apply.
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.
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
Convex Clustering: An Attractive Alternative to Hierarchical Clustering
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
Numerical modeling of isothermal compositional grading by convex splitting methods
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.
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.
Measures of symmetry for convex sets and stability
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:...
Measurement system for diffraction efficiency of convex gratings
Liu, Peng; Chen, Xin-hua; Zhou, Jian-kang; Zhao, Zhi-cheng; Liu, Quan; Luo, Chao; Wang, Xiao-feng; Tang, Min-xue; Shen, Wei-min
2017-08-01
A measurement system for diffraction efficiency of convex gratings is designed. The measurement system mainly includes four components as a light source, a front system, a dispersing system that contains a convex grating, and a detector. Based on the definition and measuring principle of diffraction efficiency, the optical scheme of the measurement system is analyzed and the design result is given. Then, in order to validate the feasibility of the designed system, the measurement system is set up and the diffraction efficiency of a convex grating with the aperture of 35 mm, the curvature-radius of 72mm, the blazed angle of 6.4°, the grating period of 2.5μm and the working waveband of 400nm-900nm is tested. Based on GUM (Guide to the Expression of Uncertainty in Measurement), the uncertainties in the measuring results are evaluated. The measured diffraction efficiency data are compared to the theoretical ones, which are calculated based on the grating groove parameters got by an atomic force microscope and Rigorous Couple Wave Analysis, and the reliability of the measurement system is illustrated. Finally, the measurement performance of the system is analyzed and tested. The results show that, the testing accuracy, the testing stability and the testing repeatability are 2.5%, 0.085% and 3.5% , respectively.
Waardes as norme en as meta-norme/beginsels
Directory of Open Access Journals (Sweden)
P. J. Van Niekerk
1987-03-01
Full Text Available The fruitfulness and the necessity of the distinction between values and norms and as principles are investigated by way of the theory of political development, the legal philosophical issue surrounding natural law and positivism and the views of Habermas. In political developmental theory questions centring on value gained legitimate relevancy under the influ ence of the post-behaviorist approach. The quest for cultural universalia or values as principles became important in this sphere because it seems to be the only way to escape from the syndrome of modernity. Through the rejection of the oppositions and one-sidedness of legal positivism and natural law and with the aid of the distinction between values, norms and principles the productive contribution of this spurious dilemma is high lighted and a clearer delineation is given of the concepts legal develop ment and structural violence. In conclusion Habermas's distinction between norms and meta-norms is investigated critically and immanent contradictions in his views are pointed out. The central place which this issue has in his thought can be seen as a confirmation of the importance of this distinction. It is relevant for all the normative disciplines which - in contrast to the natural sciences - focus on the role of linguistic, social, ethical, legal and artistic norms valid for human societies.
Satisfaction with facial profile aesthetics: are norms overrated?
Manevska, I; Pavlic, A; Katic, V; Trinajstic Zrinski, M; Drevensek, M; Spalj, S
2018-01-01
This study aimed to explore to what extent adults perceive deviations from the norm of a balanced profile with normal occlusion as reducing satisfaction with facial appearance and having a psychosocial impact. This cross-sectional study included 225 Caucasian subjects (64% women) aged 18-42 years. Their facial profiles were analyzed photogrammetrically and they were classified into three categories: within, below, or above the standard range for the Croatian population with a normal occlusion. Psychosocial issues were assessed by self-reported satisfaction with facial appearance and domains from the Orthognathic Quality of Life Questionnaire: social aspects of dentofacial aesthetics (SA), facial aesthetics concern (FA), and awareness of dentofacial aesthetics (AW). Men with a concave profile were less satisfied with their faces than those with a flat or convex profile (P<0.05). A reduced upper lip height in men resulted in a lower level of satisfaction and increased FA score, when compared to men with a normal or increased upper lip height (P<0.05). In women, a reduced middle third of the face increased AW (P=0.045). Deviations from a well-balanced facial profile, as well as the morphology of the nose and lip, do not increase psychosocial issues to a great extent. The range of acceptable facial characteristics is evidently much broader than the norms. Copyright © 2017 International Association of Oral and Maxillofacial Surgeons. Published by Elsevier Ltd. All rights reserved.
Flat norm decomposition of integral currents
Directory of Open Access Journals (Sweden)
Sharif Ibrahim
2016-05-01
Full Text Available Currents represent generalized surfaces studied in geometric measure theory. They range from relatively tame integral currents representing oriented compact manifolds with boundary and integer multiplicities, to arbitrary elements of the dual space of differential forms. The flat norm provides a natural distance in the space of currents, and works by decomposing a $d$-dimensional current into $d$- and (the boundary of $(d+1$-dimensional pieces in an optimal way.Given an integral current, can we expect its at norm decomposition to be integral as well? This is not known in general, except in the case of $d$-currents that are boundaries of $(d+1$-currents in $\\mathbb{R}^{d+1}$ (following results from a corresponding problem on the $L^1$ total variation ($L^1$TV of functionals. On the other hand, for a discretized at norm on a finite simplicial complex, the analogous statement holds even when the inputs are not boundaries. This simplicial version relies on the total unimodularity of the boundary matrix of the simplicial complex; a result distinct from the $L^1$TV approach.We develop an analysis framework that extends the result in the simplicial setting to one for $d$-currents in $\\mathbb{R}^{d+1}$, provided a suitable triangulation result holds. In $\\mathbb{R}^2$, we use a triangulation result of Shewchuk (bounding both the size and location of small angles, and apply the framework to show that the discrete result implies the continuous result for $1$-currents in $\\mathbb{R}^2$ .
Space Junk Norms: US Advantages in Creating a Debris Reducing Outer Space Norm
2011-05-01
overfishing concerns related to state interests began as early as the sixteenth century. The second Truman proclamation highlighted how... overfishing just beyond a coastal states territorial sea. Again, coastal states did not reject the US proclamation, but instead moved to clarify it with
Schweizer, B
2005-01-01
Topics include special classes of probabilistic metric spaces, topologies, and several related structures, such as probabilistic normed and inner-product spaces. 1983 edition, updated with 3 new appendixes. Includes 17 illustrations.
What's in a norm? Sources and processes of norm change.
Paluck, Elizabeth Levy
2009-03-01
This reply to the commentary by E. Staub and L. A. Pearlman (2009) revisits the field experimental results of E. L. Paluck (2009). It introduces further evidence and theoretical elaboration supporting Paluck's conclusion that exposure to a reconciliation-themed radio soap opera changed perceptions of social norms and behaviors, not beliefs. Experimental and longitudinal survey evidence reinforces the finding that the radio program affected socially shared perceptions of typical or prescribed behavior-that is, social norms. Specifically, measurements of perceptions of social norms called into question by Staub and Pearlman are shown to correlate with perceptions of public opinion and public, not private, behaviors. Although measurement issues and the mechanisms of the radio program's influence merit further testing, theory and evidence point to social interactions and emotional engagement, not individual education, as the likely mechanisms of change. The present exchange makes salient what is at stake in this debate: a model of change based on learning and personal beliefs versus a model based on group influence and social norms. These theoretical models recommend very different strategies for prejudice and conflict reduction. Future field experiments should attempt to adjudicate between these models by testing relevant policies in real-world settings.
A note on the m -norm of Chaney-Schaefer | Cullender ...
African Journals Online (AJOL)
We give elementary proofs of known results concerning lattice and duality properties of the M-norm, introduced by Chaney and Schaefer, on the tensor product of a Banach space and a Banach lattice. Keywords: Banach lattice; tensor product; Bochner norm. Quaestiones Mathematicae 30(2007), 151–158 ...
A Perceptually Reweighted Mixed-Norm Method for Sparse Approximation of Audio Signals
DEFF Research Database (Denmark)
Christensen, Mads Græsbøll; Sturm, Bob L.
2011-01-01
using standard software. A prominent feature of the new method is that it solves a problem that is closely related to the objective of coding, namely rate-distortion optimization. In computer simulations, we demonstrate the properties of the algorithm and its application to real audio signals.......In this paper, we consider the problem of finding sparse representations of audio signals for coding purposes. In doing so, it is of utmost importance that when only a subset of the present components of an audio signal are extracted, it is the perceptually most important ones. To this end, we...... propose a new iterative algorithm based on two principles: 1) a reweighted l1-norm based measure of sparsity; and 2) a reweighted l2-norm based measure of perceptual distortion. Using these measures, the considered problem is posed as a constrained convex optimization problem that can be solved optimally...
The role of convexity in perceptual completion: beyond good continuation.
Liu, Z; Jacobs, D W; Basri, R
1999-01-01
Since the seminal work of the Gestalt psychologists, there has been great interest in understanding what factors determine the perceptual organization of images. While the Gestaltists demonstrated the significance of grouping cues such as similarity, proximity and good continuation, it has not been well understood whether their catalog of grouping cues is complete--in part due to the paucity of effective methodologies for examining the significance of various grouping cues. We describe a novel, objective method to study perceptual grouping of planar regions separated by an occluder. We demonstrate that the stronger the grouping between two such regions, the harder it will be to resolve their relative stereoscopic depth. We use this new method to call into question many existing theories of perceptual completion (Ullman, S. (1976). Biological Cybernetics, 25, 1-6; Shashua, A., & Ullman, S. (1988). 2nd International Conference on Computer Vision (pp. 321-327); Parent, P., & Zucker, S. (1989). IEEE Transactions on Pattern Analysis and Machine Intelligence, 11, 823-839; Kellman, P. J., & Shipley, T. F. (1991). Cognitive psychology, Liveright, New York; Heitger, R., & von der Heydt, R. (1993). A computational model of neural contour processing, figure-ground segregation and illusory contours. In Internal Conference Computer Vision (pp. 32-40); Mumford, D. (1994). Algebraic geometry and its applications, Springer, New York; Williams, L. R., & Jacobs, D. W. (1997). Neural Computation, 9, 837-858) that are based on Gestalt grouping cues by demonstrating that convexity plays a strong role in perceptual completion. In some cases convexity dominates the effects of the well known Gestalt cue of good continuation. While convexity has been known to play a role in figure/ground segmentation (Rubin, 1927; Kanizsa & Gerbino, 1976), this is the first demonstration of its importance in perceptual completion.
Fermionic zero-norm states and enlarged supersymmetries of Type II string
International Nuclear Information System (INIS)
Lee, J.-C.
2000-01-01
We calculate the NS-R fermionic zero-norm states of the type II string spectrum. The massless and some possible massive zero-norm states are seen to be responsible for the space-time supersymmetry. The existence of other fermionic massive zero-norm states with higher spinor-tensor indices correspond to new enlarged boson-fermion symmetries of the theory at high energy. We also discuss the R-R charges and R-R zero-norm states and justify the idea that the perturbative string does not carry the massless R-R charges. (orig.)
Convex models and probabilistic approach of nonlinear fatigue failure
International Nuclear Information System (INIS)
Qiu Zhiping; Lin Qiang; Wang Xiaojun
2008-01-01
This paper is concerned with the nonlinear fatigue failure problem with uncertainties in the structural systems. In the present study, in order to solve the nonlinear problem by convex models, the theory of ellipsoidal algebra with the help of the thought of interval analysis is applied. In terms of the inclusion monotonic property of ellipsoidal functions, the nonlinear fatigue failure problem with uncertainties can be solved. A numerical example of 25-bar truss structures is given to illustrate the efficiency of the presented method in comparison with the probabilistic approach
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
Gröbner bases and convex polytopes
Sturmfels, Bernd
1995-01-01
This book is about the interplay of computational commutative algebra and the theory of convex polytopes. It centers around a special class of ideals in a polynomial ring: the class of toric ideals. They are characterized as those prime ideals that are generated by monomial differences or as the defining ideals of toric varieties (not necessarily normal). The interdisciplinary nature of the study of Gröbner bases is reflected by the specific applications appearing in this book. These applications lie in the domains of integer programming and computational statistics. The mathematical tools presented in the volume are drawn from commutative algebra, combinatorics, and polyhedral geometry.
On the structure of self-affine convex bodies
Energy Technology Data Exchange (ETDEWEB)
Voynov, A S [M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics, Moscow (Russian Federation)
2013-08-31
We study the structure of convex bodies in R{sup d} that can be represented as a union of their affine images with no common interior points. Such bodies are called self-affine. Vallet's conjecture on the structure of self-affine bodies was proved for d = 2 by Richter in 2011. In the present paper we disprove the conjecture for all d≥3 and derive a detailed description of self-affine bodies in R{sup 3}. Also we consider the relation between properties of self-affine bodies and functional equations with a contraction of an argument. Bibliography: 10 titles.
Norms and facts in measurement
Brakel, J. van
1984-01-01
Publications concerned with the foundations of measurement often accept uncritically the theory/observation and the norm/fact distinction. However, measurement is measurement-in-a-context. This is analysed in the first part of the paper. Important aspects of this context are: the purpose of the
Endogenous mobility-reducing norms
Haagsma, R.; Koning, N.B.J.
2002-01-01
We present a model where a mobility-reducing norm arises in response to adverse economic conditions. Our example is the classical farm problem of low returns. A temporary transition barrier induces cognitive dissonance in farm youths, which they try to reduce by developing a belief that revalues
When sanctions convey moral norms
Mulder, Laetitia B.
2018-01-01
Sanctions not only have the instrumental function of deterring people from undesired behavior but they also have the ability to convey moral norms. As such, they may create a moral motivation not to engage in the sanctioned behavior. This is desirable as this makes the success of a sanctioning
WE-G-207-02: Full Sequential Projection Onto Convex Sets (FS-POCS) for X-Ray CT Reconstruction
International Nuclear Information System (INIS)
Liu, L; Han, Y; Jin, M
2015-01-01
Purpose: To develop an iterative reconstruction method for X-ray CT, in which the reconstruction can quickly converge to the desired solution with much reduced projection views. Methods: The reconstruction is formulated as a convex feasibility problem, i.e. the solution is an intersection of three convex sets: 1) data fidelity (DF) set – the L2 norm of the difference of observed projections and those from the reconstructed image is no greater than an error bound; 2) non-negativity of image voxels (NN) set; and 3) piecewise constant (PC) set - the total variation (TV) of the reconstructed image is no greater than an upper bound. The solution can be found by applying projection onto convex sets (POCS) sequentially for these three convex sets. Specifically, the algebraic reconstruction technique and setting negative voxels as zero are used for projection onto the DF and NN sets, respectively, while the projection onto the PC set is achieved by solving a standard Rudin, Osher, and Fatemi (ROF) model. The proposed method is named as full sequential POCS (FS-POCS), which is tested using the Shepp-Logan phantom and the Catphan600 phantom and compared with two similar algorithms, TV-POCS and CP-TV. Results: Using the Shepp-Logan phantom, the root mean square error (RMSE) of reconstructed images changing along with the number of iterations is used as the convergence measurement. In general, FS- POCS converges faster than TV-POCS and CP-TV, especially with fewer projection views. FS-POCS can also achieve accurate reconstruction of cone-beam CT of the Catphan600 phantom using only 54 views, comparable to that of FDK using 364 views. Conclusion: We developed an efficient iterative reconstruction for sparse-view CT using full sequential POCS. The simulation and physical phantom data demonstrated the computational efficiency and effectiveness of FS-POCS
Use of Convexity in Ostomy Care: Results of an International Consensus Meeting.
Hoeflok, Jo; Salvadalena, Ginger; Pridham, Sue; Droste, Werner; McNichol, Laurie; Gray, Mikel
Ostomy skin barriers that incorporate a convexity feature have been available in the marketplace for decades, but limited resources are available to guide clinicians in selection and use of convex products. Given the widespread use of convexity, and the need to provide practical guidelines for appropriate use of pouching systems with convex features, an international consensus panel was convened to provide consensus-based guidance for this aspect of ostomy practice. Panelists were provided with a summary of relevant literature in advance of the meeting; these articles were used to generate and reach consensus on 26 statements during a 1-day meeting. Consensus was achieved when 80% of panelists agreed on a statement using an anonymous electronic response system. The 26 statements provide guidance for convex product characteristics, patient assessment, convexity use, and outcomes.
Directory of Open Access Journals (Sweden)
Luz Dary Ríos
2012-05-01
Full Text Available
This paper aims at presenting people’s practices in the urban public space of Barcelona. It is about the way people find their space in places through its use. In other words, it describes the way people make relationships and links between each other and the urban space.
We present a qualitative study from an ethnographic approach. It identifies three basic types of practices associated with the urban space: one type practice was connected to the work concept, another one to the idea of transit, and the last type to the tourists practice. These urban social practices show that the public space is used in a different way than it was designed for because the designers make public space for other functions. The urban social practices are linked with psychosocial processes such as identity, social cohesion, social norms and mobility.
Furthermore, the practices presented in this investigation go beyond urban social law and the structure function of public space without altering coexistence and sociability.
En este artículo pretendemos describir las prácticas sociales y urbanas de las personas en un espacio público, concretamente en la ciudad de Barcelona. Las personas, cuando usan el espacio público lo transforman en lugar, es decir, generan ciertas relaciones y vínculos entre ellas y el espacio urbano, de tal forma que, éste, se modifica paulatinamente.
Para la descripción de esas prácticas sociales y urbanas utilizamos una metodología cualitativa, específicamente una etnografía. Se identificaron y se eligieron tres tipos básicos de prácticas asociadas al espacio urbano: un tipo de esas prácticas se relaciona con el concepto de trabajo, otro con la idea de transitar (movimiento y el último tipo con la práctica turística. Dichas prácticas sociales y urbanas evidenciaron el uso que llega a hacerse de los espacios públicos, uso que, la mayoría de las veces
Metric freeness and projectivity for classical and quantum normed modules
Energy Technology Data Exchange (ETDEWEB)
Helemskii, A Ya [M. V. Lomonosov Moscow State University, Moscow (Russian Federation)
2013-07-31
In functional analysis, there are several diverse approaches to the notion of projective module. We show that a certain general categorical scheme contains all basic versions as special cases. In this scheme, the notion of free object comes to the foreground, and, in the best categories, projective objects are precisely retracts of free ones. We are especially interested in the so-called metric version of projectivity and characterize the metrically free classical and quantum (= operator) normed modules. Informally speaking, so-called extremal projectivity, which was known earlier, is interpreted as a kind of 'asymptotical metric projectivity'. In addition, we answer the following specific question in the geometry of normed spaces: what is the structure of metrically projective modules in the simplest case of normed spaces? We prove that metrically projective normed spaces are precisely the subspaces of l{sub 1}(M) (where M is a set) that are denoted by l{sub 1}{sup 0}(M) and consist of finitely supported functions. Thus, in this case, projectivity coincides with freeness. Bibliography: 28 titles.
Canonical Primal-Dual Method for Solving Non-convex Minimization Problems
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...
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.
Sequential and Parallel Algorithms for Finding a Maximum Convex Polygon
DEFF Research Database (Denmark)
Fischer, Paul
1997-01-01
This paper investigates the problem where one is given a finite set of n points in the plane each of which is labeled either ?positive? or ?negative?. We consider bounded convex polygons, the vertices of which are positive points and which do not contain any negative point. It is shown how...... such a polygon which is maximal with respect to area can be found in time O(n³ log n). With the same running time one can also find such a polygon which contains a maximum number of positive points. If, in addition, the number of vertices of the polygon is restricted to be at most M, then the running time...... becomes O(M n³ log n). It is also shown how to find a maximum convex polygon which contains a given point in time O(n³ log n). Two parallel algorithms for the basic problem are also presented. The first one runs in time O(n log n) using O(n²) processors, the second one has polylogarithmic time but needs O...
Nash points, Ky Fan inequality and equilibria of abstract economies in Max-Plus and -convexity
Briec, Walter; Horvath, Charles
2008-05-01
-convexity was introduced in [W. Briec, C. Horvath, -convexity, Optimization 53 (2004) 103-127]. Separation and Hahn-Banach like theorems can be found in [G. Adilov, A.M. Rubinov, -convex sets and functions, Numer. Funct. Anal. Optim. 27 (2006) 237-257] and [W. Briec, C.D. Horvath, A. Rubinov, Separation in -convexity, Pacific J. Optim. 1 (2005) 13-30]. We show here that all the basic results related to fixed point theorems are available in -convexity. Ky Fan inequality, existence of Nash equilibria and existence of equilibria for abstract economies are established in the framework of -convexity. Monotone analysis, or analysis on Maslov semimodules [V.N. Kolokoltsov, V.P. Maslov, Idempotent Analysis and Its Applications, Math. Appl., volE 401, Kluwer Academic, 1997; V.P. Litvinov, V.P. Maslov, G.B. Shpitz, Idempotent functional analysis: An algebraic approach, Math. Notes 69 (2001) 696-729; V.P. Maslov, S.N. Samborski (Eds.), Idempotent Analysis, Advances in Soviet Mathematics, Amer. Math. Soc., Providence, RI, 1992], is the natural framework for these results. From this point of view Max-Plus convexity and -convexity are isomorphic Maslov semimodules structures over isomorphic semirings. Therefore all the results of this paper hold in the context of Max-Plus convexity.
Bertamini, Marco; Wagemans, Johan
2013-04-01
Interest in convexity has a long history in vision science. For smooth contours in an image, it is possible to code regions of positive (convex) and negative (concave) curvature, and this provides useful information about solid shape. We review a large body of evidence on the role of this information in perception of shape and in attention. This includes evidence from behavioral, neurophysiological, imaging, and developmental studies. A review is necessary to analyze the evidence on how convexity affects (1) separation between figure and ground, (2) part structure, and (3) attention allocation. Despite some broad agreement on the importance of convexity in these areas, there is a lack of consensus on the interpretation of specific claims--for example, on the contribution of convexity to metric depth and on the automatic directing of attention to convexities or to concavities. The focus is on convexity and concavity along a 2-D contour, not convexity and concavity in 3-D, but the important link between the two is discussed. We conclude that there is good evidence for the role of convexity information in figure-ground organization and in parsing, but other, more specific claims are not (yet) well supported.
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...
A norm knockout method on indirect reciprocity to reveal indispensable norms
Yamamoto, Hitoshi; Okada, Isamu; Uchida, Satoshi; Sasaki, Tatsuya
2017-03-01
Although various norms for reciprocity-based cooperation have been suggested that are evolutionarily stable against invasion from free riders, the process of alternation of norms and the role of diversified norms remain unclear in the evolution of cooperation. We clarify the co-evolutionary dynamics of norms and cooperation in indirect reciprocity and also identify the indispensable norms for the evolution of cooperation. Inspired by the gene knockout method, a genetic engineering technique, we developed the norm knockout method and clarified the norms necessary for the establishment of cooperation. The results of numerical investigations revealed that the majority of norms gradually transitioned to tolerant norms after defectors are eliminated by strict norms. Furthermore, no cooperation emerges when specific norms that are intolerant to defectors are knocked out.
Moral Norms in Management Ethics
Gavrilescu Liviu
2011-01-01
The culture and values of a community shape its behavior with the support of all the norms, rules and institutions created for this purpose. Business environment is focused on the responsibility to company success. This philosophy is the base of business ethics, of specific rules systems, supplemented and not replaced by legal regulations. However, responsibility for business can come into conflict with the common morality of society, the public in general, creating an "ethical paradox". The ...
Norm Theory: Comparing Reality to Its Alternatives.
Kahneman, Daniel; Miller, Dale T.
1986-01-01
A theory of norms and normality is applied to some phenomena of emotional responses, social judgment, and conversations about causes. Norm theory is applied in analyses of enhanced emotional response to events that have abnormal causes, of generation of prediction from observations of behavior, and of the role of norms. (Author/LMO)
Children are sensitive to norms of giving.
McAuliffe, Katherine; Raihani, Nichola J; Dunham, Yarrow
2017-10-01
People across societies engage in costly sharing, but the extent of such sharing shows striking cultural variation, highlighting the importance of local norms in shaping generosity. Despite this acknowledged role for norms, it is unclear when they begin to exert their influence in development. Here we use a Dictator Game to investigate the extent to which 4- to 9-year-old children are sensitive to selfish (give 20%) and generous (give 80%) norms. Additionally, we varied whether children were told how much other children give (descriptive norm) or what they should give according to an adult (injunctive norm). Results showed that children generally gave more when they were exposed to a generous norm. However, patterns of compliance varied with age. Younger children were more likely to comply with the selfish norm, suggesting a licensing effect. By contrast, older children were more influenced by the generous norm, yet capped their donations at 50%, perhaps adhering to a pre-existing norm of equality. Children were not differentially influenced by descriptive or injunctive norms, suggesting a primacy of norm content over norm format. Together, our findings indicate that while generosity is malleable in children, normative information does not completely override pre-existing biases. Copyright © 2017 Elsevier B.V. All rights reserved.
Organisational dynamics, social norms and information systems
Stamper, R.K.; Liu, Kecheng; Liu, Kecheng; Nunamaker, Jay F.; Sprague, Ralph H.
1994-01-01
An organisation is defined as a system of social norms. The concept of a norm is the social analogue of the concept of an affordance which Gibson (1968) introduced to account for perception of the physical world. Their conjunction is a logic of Norms and Affordances, Norma, which serves as a
Quality of decision making and group norms
Postmes, T; Spears, R; Cihangir, S
Two studies investigated the impact of group norms for maintaining consensus versus norms for critical thought on group decisions in a modification of the biased sampling paradigm (G. Stasser & W. Titus, 1985). Both studies showed that critical norms improved the quality of decisions, whereas
Quality of decision making and group norms
Postmes, T.; Spears, R.; Cihangir, S.
2001-01-01
Two studies investigated the impact of group norms for maintaining consensus versus norms for critical thought on group decisions in a modification of the biased sampling paradigm (G. Stasser & W. Titus, 1985). Both studies showed that critical norms improved the quality of decisions, whereas
Chance-Constrained Guidance With Non-Convex Constraints
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
Free topological vector spaces
Gabriyelyan, Saak S.; Morris, Sidney A.
2016-01-01
We define and study the free topological vector space $\\mathbb{V}(X)$ over a Tychonoff space $X$. We prove that $\\mathbb{V}(X)$ is a $k_\\omega$-space if and only if $X$ is a $k_\\omega$-space. If $X$ is infinite, then $\\mathbb{V}(X)$ contains a closed vector subspace which is topologically isomorphic to $\\mathbb{V}(\\mathbb{N})$. It is proved that if $X$ is a $k$-space, then $\\mathbb{V}(X)$ is locally convex if and only if $X$ is discrete and countable. If $X$ is a metrizable space it is shown ...
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)
Nonparametric instrumental regression with non-convex constraints
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.
Elastic energy of liquid crystals in convex polyhedra
International Nuclear Information System (INIS)
Majumdar, A; Robbins, J M; Zyskin, M
2004-01-01
We consider nematic liquid crystals in a bounded, convex polyhedron described by a director field n(r) subject to tangent boundary conditions. We derive lower bounds for the one-constant elastic energy in terms of topological invariants. For a right rectangular prism and a large class of topologies, we derive upper bounds by introducing test configurations constructed from local conformal solutions of the Euler-Lagrange equation. The ratio of the upper and lower bounds depends only on the aspect ratios of the prism. As the aspect ratios are varied, the minimum-energy conformal state undergoes a sharp transition from being smooth to having singularities on the edges. (letter to the editor)
Reachability by paths of bounded curvature in a convex polygon
Ahn, Heekap; Cheong, Otfried; Matoušek, Jiřǐ; Vigneron, Antoine E.
2012-01-01
Let B be a point robot moving in the plane, whose path is constrained to forward motions with curvature at most 1, and let P be a convex polygon with n vertices. Given a starting configuration (a location and a direction of travel) for B inside P, we characterize the region of all points of P that can be reached by B, and show that it has complexity O(n). We give an O(n2) time algorithm to compute this region. We show that a point is reachable only if it can be reached by a path of type CCSCS, where C denotes a unit circle arc and S denotes a line segment. © 2011 Elsevier B.V.
Rocking convex array used for 3D synthetic aperture focusing
DEFF Research Database (Denmark)
Andresen, Henrik; Nikolov, Svetoslav; Pedersen, M M
2008-01-01
Volumetric imaging can be performed using 1D arrays in combination with mechanical motion. Outside the elevation focus of the array, the resolution and contrast quickly degrade compared to the azimuth plane, because of the fixed transducer focus. The purpose of this paper is to use synthetic...... aperture focusing (SAF) for enhancing the elevation focusing for a convex rocking array, to obtain a more isotropic point spread function. This paper presents further development of the SAF method, which can be used with curved array combined with a rocking motion. The method uses a virtual source (VS...... Kretztechnik, Zipf, Austria). The array has an elevation focus at 60 mm of depth, and the angular rocking velocity is up to 140deg/s. The scan sequence uses an fprf of 4500 - 7000 Hz allowing up to 15 cm of penetration. The full width at half max (FWHM) and main-lobe to side-lobe ratio (MLSL) is used...
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
Convex Relaxations for a Generalized Chan-Vese Model
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.
Neural network for solving convex quadratic bilevel programming problems.
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.
Construction and uniqueness of the C*-Weyl algebra over a general pre-symplectic space
International Nuclear Information System (INIS)
Binz, Ernst; Honegger, Reinhard; Rieckers, Alfred
2004-01-01
A systematic approach to the C*-Weyl algebra W(E,σ) over a possibly degenerate pre-symplectic form σ on a real vector space E of possibly infinite dimension is elaborated in an almost self-contained manner. The construction is based on the theory of Kolmogorov decompositions for σ-positive-definite functions on involutive semigroups and their associated projective unitary group representations. The σ-positive-definite functions provide also the C*-norm of W(E,σ), the latter being shown to be *-isomorphic to the twisted group C*-algebra of the discrete vector group E. The connections to related constructions are indicated. The treatment of the fundamental symmetries is outlined for arbitrary pre-symplectic σ. The construction method is especially applied to the trivial symplectic form σ=0, leading to the commutative Weyl algebra over E, which is shown to be isomorphic to the C*-algebra of the almost periodic continuous function on the topological dual E τ ' of E with respect to an arbitrary locally convex Hausdorff topology τ on E. It is demonstrated that the almost periodic compactification aE τ ' of E τ ' is independent of the chosen locally convex τ on E, and that aE τ ' is continuously group isomorphic to the character group E of E. Applications of the results to the procedures of strict and continuous deformation quantizations are mentioned in the outlook
Path Following in the Exact Penalty Method of Convex Programming.
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.
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.
Guo, Peng; Cao, Jiannong; Zhang, Kui
2015-01-01
In critical event (e.g., fire or gas) monitoring applications of wireless sensor networks (WSNs), convex hull of the event region is an efficient tool in handling the usual tasks like event report, routes reconstruction and human motion planning. Existing works on estimating convex hull of event
de Klerk, E.; Laurent, M.
2011-01-01
The Lasserre hierarchy of semidefinite programming approximations to convex polynomial optimization problems is known to converge finitely under some assumptions. [J. B. Lasserre, Convexity in semialgebraic geometry and polynomial optimization, SIAM J. Optim., 19 (2009), pp. 1995–2014]. We give a
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 ...
Effect of dental arch convexity and type of archwire on frictional forces
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
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
Evolutionary change in continuous reaction norms
DEFF Research Database (Denmark)
Murren, Courtney J; Maclean, Heidi J; Diamond, Sarah E
2014-01-01
Understanding the evolution of reaction norms remains a major challenge in ecology and evolution. Investigating evolutionary divergence in reaction norm shapes between populations and closely related species is one approach to providing insights. Here we use a meta-analytic approach to compare...... divergence in reaction norms of closely related species or populations of animals and plants across types of traits and environments. We quantified mean-standardized differences in overall trait means (Offset) and reaction norm shape (including both Slope and Curvature). These analyses revealed...... contributed to the best-fitting models, especially for Offset, Curvature, and the total differences (Total) between reaction norms. Congeneric species had greater differences in reaction norms than populations, and novel environmental conditions increased the differences in reaction norms between populations...
Zhang, Yongjun; Lu, Zhixin
2017-10-01
Spectrum resources are very precious, so it is increasingly important to locate interference signals rapidly. Convex programming algorithms in wireless sensor networks are often used as localization algorithms. But in view of the traditional convex programming algorithm is too much overlap of wireless sensor nodes that bring low positioning accuracy, the paper proposed a new algorithm. Which is mainly based on the traditional convex programming algorithm, the spectrum car sends unmanned aerial vehicles (uses) that can be used to record data periodically along different trajectories. According to the probability density distribution, the positioning area is segmented to further reduce the location area. Because the algorithm only increases the communication process of the power value of the unknown node and the sensor node, the advantages of the convex programming algorithm are basically preserved to realize the simple and real-time performance. The experimental results show that the improved algorithm has a better positioning accuracy than the original convex programming algorithm.
A remark on multiobjective stochastic optimization via strongly convex functions
Czech Academy of Sciences Publication Activity Database
Kaňková, Vlasta
2016-01-01
Roč. 24, č. 2 (2016), s. 309-333 ISSN 1435-246X R&D Projects: GA ČR GA13-14445S Institutional support: RVO:67985556 Keywords : Stochasticmultiobjective optimization problem * Efficient solution * Wasserstein metric and L_1 norm * Stability and empirical estimates Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 0.659, year: 2016 http://library.utia.cas.cz/separaty/2015/E/kankova-0450553.pdf
[Cleanliness Norms 1964-1975].
Noelle-Neumann, E
1976-01-01
In 1964 the Institut für Demoskopie Allensbach made a first survey taking stock of norms concerning cleanliness in the Federal Republic of Germany. At that time, 78% of respondents thought that the vogue among young people of cultivating an unkempt look was past or on the wane (Table 1.). Today we know that this fashion was an indicator of more serious desires for change in many different areas like politics, sexual morality, education and that its high point was still to come. In the fall of 1975 a second survey, modelled on the one of 1964, was conducted. Again, it concentrated on norms, not on behavior. As expected, norms have changed over this period but not in a one-directional or simple manner. In general, people are much more large-minded about children's looks: neat, clean school-dress, properly combed hair, clean shoes, all this and also holding their things in order has become less important in 1975 (Table 2). To carry a clean handkerchief is becoming oldfashioned (Table 3). On the other hand, principles of bringing-up children have not loosened concerning personal hygiene - brushing ones teeth, washing hands, feet, and neck, clean fingernails (Table 4). On one item related to protection of the environment, namely throwing around waste paper, standards have even become more strict (Table 5). With regard to school-leavers, norms of personal hygiene have generally become more strict (Table 6). As living standards have gone up and the number of full bathrooms has risen from 42% to 75% of households, norms of personal hygiene have also increased: one warm bath a week seemed enough to 56% of adults in 1964, but to only 32% in 1975 (Table 7). Also standards for changing underwear have changed a lot: in 1964 only 12% of respondents said "every day", in 1975 48% said so (Table 8). Even more stringent norms are applied to young women (Tables 9/10). For comparison: 1964 there were automatic washing machines in 16%, 1975 in 79% of households. Answers to questions
Cephalometric norms of Saudi boys
International Nuclear Information System (INIS)
Nashashibi, I. A.; Shaikh, H. S.; Sarhan, O. A.
1990-01-01
The present study was conducted to establish cephalometric norms of Saudi boys based on the Steiners analysis, and to compare the results of the present study with similar studies conducted on other racial or ethnic groups. For this purpose, fifty-five healthy Saudi boys, with a mean age of 12.04 years, were selected from different schools of Riyadh. Female Saudis were not used for this study due to social restrictions with respect to the Kingdom's customs and traditions. Selection was made on the basis of normal occlusion, balanced and pleasing profile with no obvious facial asymmetry. None of the boys have undergone orthodontic treatment prior to this study. Lateral skull cephaiograms were taken and traced using a standardized technique. Each cephalogram was traced twice with a one week interval by the authors. All angular and linear measurements were calculated to the nearest 0.5 degree and 0.5 mm, respectively. Steiners method of cephalometric analysis was used to establish cephalometric norms. The result of the study demonstrated that the Saudi boys differed from other racial and ethnic groups in some skeletal and dental measurements. Generally, the Saudi boys revealed a more protrusive maxillary apical base and double dental protrusion. (author)
Topological vector spaces and their applications
Bogachev, V I
2017-01-01
This book gives a compact exposition of the fundamentals of the theory of locally convex topological vector spaces. Furthermore it contains a survey of the most important results of a more subtle nature, which cannot be regarded as basic, but knowledge which is useful for understanding applications. Finally, the book explores some of such applications connected with differential calculus and measure theory in infinite-dimensional spaces. These applications are a central aspect of the book, which is why it is different from the wide range of existing texts on topological vector spaces. In addition, this book develops differential and integral calculus on infinite-dimensional locally convex spaces by using methods and techniques of the theory of locally convex spaces. The target readership includes mathematicians and physicists whose research is related to infinite-dimensional analysis.
Energy Technology Data Exchange (ETDEWEB)
Mirro, G.A. [Growth Resources, Inc., Lafayette, LA (United States)
1997-02-01
This paper presents an overview of issues related to handling NORM materials, and provides a description of a facility designed for the processing of NORM contaminated equipment. With regard to handling NORM materials the author discusses sources of NORM, problems, regulations and disposal options, potential hazards, safety equipment, and issues related to personnel protection. For the facility, the author discusses: description of the permanent facility; the operations of the facility; the license it has for handling specific radioactive material; operating and safety procedures; decontamination facilities on site; NORM waste processing capabilities; and offsite NORM services which are available.
Children are sensitive to norms of giving
McAuliffe, K.; Raihani, N. J.; Dunham, Y.
2017-01-01
People across societies engage in costly sharing, but the extent of such sharing shows striking cultural variation, highlighting the importance of local norms in shaping generosity. Despite this acknowledged role for norms, it is unclear when they begin to exert their influence in development. Here we use a Dictator Game to investigate the extent to which 4- to 9-year-old children are sensitive to selfish (give 20%) and generous (give 80%) norms. Additionally, we varied whether children were ...
Social Norms in the Ancient Athenian Courts
Lanni, Adriaan M.
2013-01-01
Ancient Athens was a remarkably peaceful and well-ordered society by both ancient and contemporary standards. Scholars typically attribute Athens’ success to internalized norms and purely informal enforcement mechanisms. This article argues that the formal Athenian court system played a vital role in maintaining order by enforcing informal norms. This peculiar approach to norm enforcement compensated for apparent weaknesses in the state system of coercion. It mitigated the effects of under-e...
Four year-olds use norm-based coding for face identity.
Jeffery, Linda; Read, Ainsley; Rhodes, Gillian
2013-05-01
Norm-based coding, in which faces are coded as deviations from an average face, is an efficient way of coding visual patterns that share a common structure and must be distinguished by subtle variations that define individuals. Adults and school-aged children use norm-based coding for face identity but it is not yet known if pre-school aged children also use norm-based coding. We reasoned that the transition to school could be critical in developing a norm-based system because school places new demands on children's face identification skills and substantially increases experience with faces. Consistent with this view, face identification performance improves steeply between ages 4 and 7. We used face identity aftereffects to test whether norm-based coding emerges between these ages. We found that 4 year-old children, like adults, showed larger face identity aftereffects for adaptors far from the average than for adaptors closer to the average, consistent with use of norm-based coding. We conclude that experience prior to age 4 is sufficient to develop a norm-based face-space and that failure to use norm-based coding cannot explain 4 year-old children's poor face identification skills. Copyright © 2013 Elsevier B.V. All rights reserved.
Precision platform for convex lens-induced confinement microscopy
Berard, Daniel; McFaul, Christopher M. J.; Leith, Jason S.; Arsenault, Adriel K. J.; Michaud, François; Leslie, Sabrina R.
2013-10-01
We present the conception, fabrication, and demonstration of a versatile, computer-controlled microscopy device which transforms a standard inverted fluorescence microscope into a precision single-molecule imaging station. The device uses the principle of convex lens-induced confinement [S. R. Leslie, A. P. Fields, and A. E. Cohen, Anal. Chem. 82, 6224 (2010)], which employs a tunable imaging chamber to enhance background rejection and extend diffusion-limited observation periods. Using nanopositioning stages, this device achieves repeatable and dynamic control over the geometry of the sample chamber on scales as small as the size of individual molecules, enabling regulation of their configurations and dynamics. Using microfluidics, this device enables serial insertion as well as sample recovery, facilitating temporally controlled, high-throughput measurements of multiple reagents. We report on the simulation and experimental characterization of this tunable chamber geometry, and its influence upon the diffusion and conformations of DNA molecules over extended observation periods. This new microscopy platform has the potential to capture, probe, and influence the configurations of single molecules, with dramatically improved imaging conditions in comparison to existing technologies. These capabilities are of immediate interest to a wide range of research and industry sectors in biotechnology, biophysics, materials, and chemistry.
Neural network for nonsmooth pseudoconvex optimization with general convex constraints.
Bian, Wei; Ma, Litao; Qin, Sitian; Xue, Xiaoping
2018-05-01
In this paper, a one-layer recurrent neural network is proposed for solving a class of nonsmooth, pseudoconvex optimization problems with general convex constraints. Based on the smoothing method, we construct a new regularization function, which does not depend on any information of the feasible region. Thanks to the special structure of the regularization function, we prove the global existence, uniqueness and "slow solution" character of the state of the proposed neural network. Moreover, the state solution of the proposed network is proved to be convergent to the feasible region in finite time and to the optimal solution set of the related optimization problem subsequently. In particular, the convergence of the state to an exact optimal solution is also considered in this paper. Numerical examples with simulation results are given to show the efficiency and good characteristics of the proposed network. In addition, some preliminary theoretical analysis and application of the proposed network for a wider class of dynamic portfolio optimization are included. Copyright © 2018 Elsevier Ltd. All rights reserved.
JPEG2000-coded image error concealment exploiting convex sets projections.
Atzori, Luigi; Ginesu, Giaime; Raccis, Alessio
2005-04-01
Transmission errors in JPEG2000 can be grouped into three main classes, depending on the affected area: LL, high frequencies at the lower decomposition levels, and high frequencies at the higher decomposition levels. The first type of errors are the most annoying but can be concealed exploiting the signal spatial correlation like in a number of techniques proposed in the past; the second are less annoying but more difficult to address; the latter are often imperceptible. In this paper, we address the problem of concealing the second class or errors when high bit-planes are damaged by proposing a new approach based on the theory of projections onto convex sets. Accordingly, the error effects are masked by iteratively applying two procedures: low-pass (LP) filtering in the spatial domain and restoration of the uncorrupted wavelet coefficients in the transform domain. It has been observed that a uniform LP filtering brought to some undesired side effects that negatively compensated the advantages. This problem has been overcome by applying an adaptive solution, which exploits an edge map to choose the optimal filter mask size. Simulation results demonstrated the efficiency of the proposed approach.
Link Prediction via Convex Nonnegative Matrix Factorization on Multiscale Blocks
Directory of Open Access Journals (Sweden)
Enming Dong
2014-01-01
Full Text Available Low rank matrices approximations have been used in link prediction for networks, which are usually global optimal methods and lack of using the local information. The block structure is a significant local feature of matrices: entities in the same block have similar values, which implies that links are more likely to be found within dense blocks. We use this insight to give a probabilistic latent variable model for finding missing links by convex nonnegative matrix factorization with block detection. The experiments show that this method gives better prediction accuracy than original method alone. Different from the original low rank matrices approximations methods for link prediction, the sparseness of solutions is in accord with the sparse property for most real complex networks. Scaling to massive size network, we use the block information mapping matrices onto distributed architectures and give a divide-and-conquer prediction method. The experiments show that it gives better results than common neighbors method when the networks have a large number of missing links.
A One-Layer Recurrent Neural Network for Constrained Complex-Variable Convex Optimization.
Qin, Sitian; Feng, Jiqiang; Song, Jiahui; Wen, Xingnan; Xu, Chen
2018-03-01
In this paper, based on calculus and penalty method, a one-layer recurrent neural network is proposed for solving constrained complex-variable convex optimization. It is proved that for any initial point from a given domain, the state of the proposed neural network reaches the feasible region in finite time and converges to an optimal solution of the constrained complex-variable convex optimization finally. In contrast to existing neural networks for complex-variable convex optimization, the proposed neural network has a lower model complexity and better convergence. Some numerical examples and application are presented to substantiate the effectiveness of the proposed neural network.
Energy Technology Data Exchange (ETDEWEB)
Sabad, E P; Lomsadze, Yu M [AN Ukrainskoj SSR, Kiev. Inst. Teoreticheskoj Fiziki
1980-01-01
It is proved that each of the classes PHI*(Rsup(4n),F) investigated by means of suitable local topologization can be transformed into a concrete realization of the abstract class SR(..cap omega..sub(f)sup(a) ..-->.. C/sup 1/) of complexly spread reducible generalized functions. The class PHI*(Rsup(4n),F) preset by a certain representation on the basis of signal ideology is proved to be a class of generalized functions over the Poincare-invariant complete topological locally convex linear involutive space (PHI(Rsup(4n),F),Q) of test functions with the topology Q preset by a countable number of norms. These results allow a correct formulation of the axiom of complexly broken microcausality.
Groenwold, A.A.; Wood, D.W.; Etman, L.F.P.; Tosserams, S.
2009-01-01
We implement and test a globally convergent sequential approximate optimization algorithm based on (convexified) diagonal quadratic approximations. The algorithm resides in the class of globally convergent optimization methods based on conservative convex separable approximations developed by
International Nuclear Information System (INIS)
Saint-Cyr, B.
2011-01-01
We model in this work granular materials composed of non-convex and cohesive aggregates, in view of application to the rheology of UO 2 powders. The effect of non convexity is analyzed in terms of bulk quantities (Coulomb internal friction and cohesion) and micromechanical parameters such as texture anisotropy and force transmission. In particular, we find that the packing fraction evolves in a complex manner with the shape non convexity and the shear strength increases but saturates due to interlocking between the aggregates. We introduce simple models to describe these features in terms of micro-mechanical parameters. Furthermore, a systematic investigation of shearing, uniaxial compaction and simple compression of cohesive packings show that bulk cohesion increases with non-convexity but is strongly influenced by the boundary conditions and shear bands or stress concentration. (author) [fr
A Sufficient Condition on Convex Relaxation of AC Optimal Power Flow in Distribution Networks
DEFF Research Database (Denmark)
Huang, Shaojun; Wu, Qiuwei; Wang, Jianhui
2016-01-01
This paper proposes a sufficient condition for the convex relaxation of AC Optimal Power Flow (OPF) in radial distribution networks as a second order cone program (SOCP) to be exact. The condition requires that the allowed reverse power flow is only reactive or active, or none. Under the proposed...... solution of the SOCP can be converted to an optimal solution of the original AC OPF. The efficacy of the convex relaxation to solve the AC OPF is demonstrated by case studies of an optimal multi-period planning problem of electric vehicles (EVs) in distribution networks....... sufficient condition, the feasible sub-injection region (power injections of nodes excluding the root node) of the AC OPF is convex. The exactness of the convex relaxation under the proposed condition is proved through constructing a group of monotonic series with limits, which ensures that the optimal...
Frontcountry encounter norms among three cultures
Jerry J. Vaske; Maureen P. Donnelly; Robert M. Doctor; James P. Petruzzi
1995-01-01
Existing normative studies have focused on backcountry encounter norms reported by North Americans. This study extends previous research by comparing encounter norms reported by three different cultures - North Americans, Europeans, and Japanese - in a frontcountry day use recreation area. Data were obtained from on-site surveys distributed at the Columbia Icefield in...
Norm based design of fault detectors
DEFF Research Database (Denmark)
Rank, Mike Lind; Niemann, Hans Henrik
1999-01-01
The design of fault detectors for fault detection and isolation (FDI) in dynamic systems is considered in this paper from a norm based point of view. An analysis of norm based threshold selection is given based on different formulations of FDI problems. Both the nominal FDI problem as well...
Graph Design via Convex Optimization: Online and Distributed Perspectives
Meng, De
Network and graph have long been natural abstraction of relations in a variety of applications, e.g. transportation, power system, social network, communication, electrical circuit, etc. As a large number of computation and optimization problems are naturally defined on graphs, graph structures not only enable important properties of these problems, but also leads to highly efficient distributed and online algorithms. For example, graph separability enables the parallelism for computation and operation as well as limits the size of local problems. More interestingly, graphs can be defined and constructed in order to take best advantage of those problem properties. This dissertation focuses on graph structure and design in newly proposed optimization problems, which establish a bridge between graph properties and optimization problem properties. We first study a new optimization problem called Geodesic Distance Maximization Problem (GDMP). Given a graph with fixed edge weights, finding the shortest path, also known as the geodesic, between two nodes is a well-studied network flow problem. We introduce the Geodesic Distance Maximization Problem (GDMP): the problem of finding the edge weights that maximize the length of the geodesic subject to convex constraints on the weights. We show that GDMP is a convex optimization problem for a wide class of flow costs, and provide a physical interpretation using the dual. We present applications of the GDMP in various fields, including optical lens design, network interdiction, and resource allocation in the control of forest fires. We develop an Alternating Direction Method of Multipliers (ADMM) by exploiting specific problem structures to solve large-scale GDMP, and demonstrate its effectiveness in numerical examples. We then turn our attention to distributed optimization on graph with only local communication. Distributed optimization arises in a variety of applications, e.g. distributed tracking and localization, estimation
A one-dimensional gravitationally interacting gas and the convex minorant of Brownian motion
International Nuclear Information System (INIS)
Suidan, T M
2001-01-01
The surprising connection between a one-dimensional gravitationally interacting gas of sticky particles and the convex minorant process generated by Brownian motion on [0,1] is studied. A study is made of the dynamics of this 1-D gas system by identifying three distinct clustering regimes and the time scales at which they occur. At the critical moment of time the mass distribution of the gas can be computed in terms of functionals of the convex minorant process
Directory of Open Access Journals (Sweden)
Weilin Nie
2017-01-01
Full Text Available Abstract Convex risk minimization is a commonly used setting in learning theory. In this paper, we firstly give a perturbation analysis for such algorithms, and then we apply this result to differential private learning algorithms. Our analysis needs the objective functions to be strongly convex. This leads to an extension of our previous analysis to the non-differentiable loss functions, when constructing differential private algorithms. Finally, an error analysis is then provided to show the selection for the parameters.
Triangular Norms, Triangular Conorms, and Some Related Concepts
Directory of Open Access Journals (Sweden)
Angel Garrido
2011-01-01
Full Text Available Abstract. Mathematically considered, a Triangular Norm is a kind of binary operation frequently used in the context of Probabilistic Metric Spaces, but also in other very interesting fields, as may be Fuzzy Logic, or in general, in Multi-Valued Logic (MVL. The T-conorm, or S-norm, is a dual concept. Both ideas allow us to generalize the intersection and the union in a Lattice, or disjunction and conjunction in Logic. Also may be very interesting to introduce a special class of real monotone operations. We refer to the so-called Copulas, very useful in many fields. So, we offer now a comprehensive analysis of all these aggregation operators.
Russian Speech in Radio: Norm and Deviation
Directory of Open Access Journals (Sweden)
Igor V. Nefedov
2017-06-01
Full Text Available National radio, like television, is called upon to bring to the masses not only relevant information, but also a high culture of language. There were always serious demands to oral public speech from the point of view of the correctness and uniformity of the pronunciation. However, today the analysis of the language practice of broadcasting often indicates a discrepancy between the use of linguistic resources in existing literary norms. The author of the article from the end of December 2016 to early April 2017 listened and analyzed from the point of view of language correctness the majority of programs on the radio Komsomolskaya Pravda (KP. In general, recognizing the good speech qualification of the workers of this radio, as well as their «guests» (political scientists, lawyers, historians, etc., one can not but note the presence of a significant number of errors in their speech. The material presented in the article allows us to conclude that at present, broadcasting is losing its position in the field of speech culture. Neglect of the rules of the Russian language on the radio «Komsomolskaya Pravda» negatively affects the image of the Russian language, which is formed in the minds of listeners. The language of radio should strive to become a standard of cleanliness and high culture for the population, since it has the enormous power of mass impact and supports the unity of the cultural and linguistic space.
A Fast Algorithm of Convex Hull Vertices Selection for Online Classification.
Ding, Shuguang; Nie, Xiangli; Qiao, Hong; Zhang, Bo
2018-04-01
Reducing samples through convex hull vertices selection (CHVS) within each class is an important and effective method for online classification problems, since the classifier can be trained rapidly with the selected samples. However, the process of CHVS is NP-hard. In this paper, we propose a fast algorithm to select the convex hull vertices, based on the convex hull decomposition and the property of projection. In the proposed algorithm, the quadratic minimization problem of computing the distance between a point and a convex hull is converted into a linear equation problem with a low computational complexity. When the data dimension is high, an approximate, instead of exact, convex hull is allowed to be selected by setting an appropriate termination condition in order to delete more nonimportant samples. In addition, the impact of outliers is also considered, and the proposed algorithm is improved by deleting the outliers in the initial procedure. Furthermore, a dimension convention technique via the kernel trick is used to deal with nonlinearly separable problems. An upper bound is theoretically proved for the difference between the support vector machines based on the approximate convex hull vertices selected and all the training samples. Experimental results on both synthetic and real data sets show the effectiveness and validity of the proposed algorithm.
Study on IAEA international emergency response exercise convEx-3
International Nuclear Information System (INIS)
Yamamoto, Kazuya
2007-05-01
The International Atomic Energy Agency (IAEA) carried out a large-scale international emergency response exercise in 2005 under the designated name of ConvEx-3(2005), at Romania. This review report summarizes a study about ConvEx-3(2005) based on several related open literature. The ConvEx-3 was conducted in accordance with Agency's safety standard series and requirements in the field of Emergency Preparedness and Response. The study on the preparation, conduct and evaluation of ConvEx-3(2005) exercise is expected to provide very useful knowledge for development of drills and educational programs conducted by Nuclear Emergency Assistance and Training Center (NEAT). Especially, study on the exercise evaluations is instrumental in improving evaluations of drills planned by the national government and local governments. As international cooperation among Asian countries in the field of nuclear emergency preparedness and response is going to realize, it is very useful to survey and consider scheme and methodology about international emergency preparedness, response and exercise referring the knowledge of this ConvEx-3 study. The lessons learned from this study of ConvEx-3(2005) are summarized in four chapters; methodology of exercises and educational programs, exercise evaluation process, amendments/verification of the emergency response plan of NEAT, and technical issues of systems for emergency response and assistance of NEAT relevant to interface for international emergency communication. (author)
Social norms and prejudice against homosexuals.
Pereira, Annelyse; Monteiro, Maria Benedicta; Camino, Leoncio
2009-11-01
Different studies regarding the role of norms on the expression of prejudice have shown that the anti-prejudice norm influences people to inhibit prejudice expressions. However, if norm pressure has led to a substantial decrease in the public expression of prejudice against certain targets (e.g., blacks, women, blind people), little theoretical and empirical attention has been paid to the role of this general norm regarding sexual minorities (e.g., prostitutes, lesbians and gays). In this sense, the issue we want to address is whether general anti-prejudice norms can reduce the expression of prejudice against homosexual individuals. In this research we investigate the effect of activating an anti-prejudice norm against homosexuals on blatant and subtle expressions of prejudice. The anti-prejudice norm was experimentally manipulated and its effects were observed on rejection to intimacy (blatant prejudice) and on positive-negative emotions (subtle prejudice) regarding homosexuals. 136 university students were randomly allocated to activated-norm and control conditions and completed a questionnaire that included norm manipulation and the dependent variables. A multivariate analysis of variance (MANOVA) as well as subsequent ANOVAS showed that only in the high normative pressure condition participants expressed less rejection to intimacy and less negative emotions against homosexuals, when compared to the simple norm-activation and the control conditions. Positive emotions, however, were similar both in the high normative pressure and the control conditions. We concluded that a high anti-prejudice pressure regarding homosexuals could reduce blatant prejudice but not subtle prejudice, considering that the expression of negative emotions decreased while the expression of positive emotions remained stable.
Nasalance norms in Greek adults.
Okalidou, Areti; Karathanasi, Asimina; Grigoraki, Eleni
2011-08-01
The purposes of this study were to derive nasalance norms for monolingual Greek speakers, to examine nasalance scores as a function of gender and to draw cross-linguistic comparisons based on normative data. Participants read aloud a corpus of linguistic material, consisting of (1) a nasal text, an oral text and a balanced text; (2) a set of nasal sentences and four sets of oral sentences and (3) repetitions of each of 12 syllable types (8 oral and 4 nasal). The last two sets of material corpus were based on an adaptation of the Simplified Nasometric Assessment Procedures Test (SNAP test) test ( MacKay and Kummer, 1994 ) in Greek, called the G-SNAP test. Eighty monolingual healthy young adult speakers of Greek, 40 males (mean age = 21 years) and 40 females (mean age = 20.5 years), with normal hearing and speech characteristics and unremarkable history were included in the study. The Nasometer (model 6200-3) was used to derive nasalance scores. Mean normative nasalance for spoken Greek was 25.50%, based on the G-oronasal text (with 8.6% nasals). Nasalance scores did not differ significantly with respect to gender. Finally, spoken Greek consistently yielded lower nasalance scores than other languages examined in past work. The aforementioned normative data on nasalance of young adult speakers of Greek are valid across gender and have direct clinical utility as they provide valuable reference information for the diagnosis and management of Greek adults with resonance disorders caused by velar dysfunction.
Directory of Open Access Journals (Sweden)
Wei Zheng
Full Text Available The prediction of conformational b-cell epitopes plays an important role in immunoinformatics. Several computational methods are proposed on the basis of discrimination determined by the solvent-accessible surface between epitopes and non-epitopes, but the performance of existing methods is far from satisfying. In this paper, depth functions and the k-th surface convex hull are used to analyze epitopes and exposed non-epitopes. On each layer of the protein, we compute relative solvent accessibility and four different types of depth functions, i.e., Chakravarty depth, DPX, half-sphere exposure and half space depth, to analyze the location of epitopes on different layers of the proteins. We found that conformational b-cell epitopes are rich in charged residues Asp, Glu, Lys, Arg, His; aliphatic residues Gly, Pro; non-charged residues Asn, Gln; and aromatic residue Tyr. Conformational b-cell epitopes are rich in coils. Conservation of epitopes is not significantly lower than that of exposed non-epitopes. The average depths (obtained by four methods for epitopes are significantly lower than that of non-epitopes on the surface using the Wilcoxon rank sum test. Epitopes are more likely to be located in the outer layer of the convex hull of a protein. On the benchmark dataset, the cumulate 10th convex hull covers 84.6% of exposed residues on the protein surface area, and nearly 95% of epitope sites. These findings may be helpful in building a predictor for epitopes.
Effect of H-wave polarization on laser radar detection of partially convex targets in random media.
El-Ocla, Hosam
2010-07-01
A study on the performance of laser radar cross section (LRCS) of conducting targets with large sizes is investigated numerically in free space and random media. The LRCS is calculated using a boundary value method with beam wave incidence and H-wave polarization. Considered are those elements that contribute to the LRCS problem including random medium strength, target configuration, and beam width. The effect of the creeping waves, stimulated by H-polarization, on the LRCS behavior is manifested. Targets taking large sizes of up to five wavelengths are sufficiently larger than the beam width and are sufficient for considering fairly complex targets. Scatterers are assumed to have analytical partially convex contours with inflection points.
Directory of Open Access Journals (Sweden)
Lu-Chuan Ceng
2014-01-01
Full Text Available We introduce and analyze one iterative algorithm by hybrid shrinking projection method for finding a solution of the minimization problem for a convex and continuously Fréchet differentiable functional, with constraints of several problems: finitely many generalized mixed equilibrium problems, finitely many variational inequalities, the general system of variational inequalities and the fixed point problem of an asymptotically strict pseudocontractive mapping in the intermediate sense in a real Hilbert space. We prove strong convergence theorem for the iterative algorithm under suitable conditions. On the other hand, we also propose another iterative algorithm by hybrid shrinking projection method for finding a fixed point of infinitely many nonexpansive mappings with the same constraints, and derive its strong convergence under mild assumptions.
Economic impact of potential NORM regulations
International Nuclear Information System (INIS)
Smith, G.E.; Fitzgibbon, T.; Karp, S.
1995-01-01
Oil and gas field wastes and sites contaminated with naturally occurring radioactive materials (NORM) have quickly become a focus of substantial attention by regulators both at the state and federal level. Although currently regulated in a number of states, the Environmental Protection Agency (EPA) has indicated a desire to develop federal regulations to address management and disposal of NORM-contaminated wastes. This paper provides a brief overview of current state NORM regulations, currently available technologies for managing and disposing NORM wastes, and the cost of employing these techniques. Based on these characterizations and alternative assumptions about the volume of NORM wastes, four alternative scenarios have been developed to bracket potential future NORM requirements. These scenarios have been used is the basis for an analysis of the potential economic and supply impacts of NORM requirements on the U.S. oil and gas industry. The results illustrate that a reasonable approach to regulation that focuses only on those NORM wastes that pose a risk and allows producers to use safe, low cost disposal methods (downhole or other) would have minimal economic impacts on the oil and gas industry. A very stringent regulatory approach that covered large volumes of wastes, required the use of higher cost disposal techniques, and required extensive site clean-up activities could have a substantial economic impact, resulting in a loss of up to 20 percent of U.S. oil production and 8 percent of U.S. gas production by 2000. The costs of compliance with these alternative approaches could range from $71 million to over $14 billion annually. Between these two cases lies the opportunity for regulators to develop requirements for management and disposal of NORM wastes that will address any environmental and human health risks posed at industry sites without imposing unnecessarily costly regulations on the U.S. oil and gas E ampersand P industry
A Maximal Element Theorem in FWC-Spaces and Its Applications
Hu, Qingwen; Miao, Yulin
2014-01-01
A maximal element theorem is proved in finite weakly convex spaces (FWC-spaces, in short) which have no linear, convex, and topological structure. Using the maximal element theorem, we develop new existence theorems of solutions to variational relation problem, generalized equilibrium problem, equilibrium problem with lower and upper bounds, and minimax problem in FWC-spaces. The results represented in this paper unify and extend some known results in the literature. PMID:24782672
Norm based Threshold Selection for Fault Detectors
DEFF Research Database (Denmark)
Rank, Mike Lind; Niemann, Henrik
1998-01-01
The design of fault detectors for fault detection and isolation (FDI) in dynamic systems is considered from a norm based point of view. An analysis of norm based threshold selection is given based on different formulations of FDI problems. Both the nominal FDI problem as well as the uncertain FDI...... problem are considered. Based on this analysis, a performance index based on norms of the involved transfer functions is given. The performance index allows us also to optimize the structure of the fault detection filter directly...
Norms for environmentally responsible behaviour: An extended taxonomy
DEFF Research Database (Denmark)
Thøgersen, John
2006-01-01
and shopping. Also the frequency of the four behaviours was measured. The revised taxonomy has content, discriminant, predictive, and nomological validity and satisfactory test-retest reliability. The most internalized of the new norm constructs, integrated norms, is most strongly correlated with conventional...... measures of personal and moral norms. However, other constructs in the proposed taxonomy still contribute significantly to predicting conventional norm measures after controlling for integrated norms. This documents the motivational ambiguity of the conventional personal norm construct. The patterns...
The Neural Basis of Changing Social Norms through Persuasion
Yomogida, Yukihito; Matsumoto, Madoka; Aoki, Ryuta; Sugiura, Ayaka; Phillips, Adam N.; Matsumoto, Kenji
2017-01-01
Social norms regulate behavior, and changes in norms have a great impact on society. In most modern societies, norms change through interpersonal communication and persuasive messages found in media. Here, we examined the neural basis of persuasion-induced changes in attitude toward and away from norms using fMRI. We measured brain activity while human participants were exposed to persuasive messages directed toward specific norms. Persuasion directed toward social norms specifically activate...
The consequences of the heterosexual norm
Directory of Open Access Journals (Sweden)
Anna Johansson
2008-04-01
Full Text Available Librarians may exclude people accidentally. This is so because there is a widespread use of classifications and subject headings reflecting the heterosexual norm. Critical classification theory tackles this norm for the reason that it affects the retrieval of gay literature. In order to allow a reconsideration of this exclusive practice in the LIS community I challenge two main questions: Firstly, how does the heterosexual norm appear in classification systems and subject headings lists? And secondly, what are the consequences of that practice for the retrieval of gay literature?This paper focuses on the professional practise in Swedish public libraries. If subject cataloguing prevents Lesbians, Gays, Bisexuals and Transgender (LGBT finding their literatures, then Swedish public libraries are upholders of the exclusive heterosexual norm in society.
REACTIVATING NIGERIAN NORMS AND VALUES THROUGH ...
African Journals Online (AJOL)
Dean SPGS NAU
Transformation. Transformation is a complete change in outward appearance of ... incestuous relationship are prohibited in Nigerian society. The .... society is maintained. ..... physical. Our societal norms and values constitute the frame works.
Human health and stoic moral norms.
Becker, Lawrence C
2003-04-01
For the philosophy of medicine, there are two things of interest about the stoic account of moral norms, quite apart from whether the rest of stoic ethical theory is compelling. One is the stoic version of naturalism: its account of practical reasoning, its solution to the is/ought problem, and its contention that norms for creating, sustaining, or restoring human health are tantamount to moral norms. The other is the stoic account of human agency: its description of the intimate connections between human health, rational agency, and moral norms. There is practical guidance to be gained from exploring those connections, whether or not one is ready to follow stoic moral theory all the way to its austere end.
Egalitarian norms, economic development, and ethnic polarization
Haagsma, R.; Mouche, van P.H.M.
2013-01-01
Economic development generally implies that traditional egalitarian norms and beliefs are replaced by modern individualistic values. Particularly when opportunities for advancement are unequally presented to people, this transformation may be accompanied by polarization and violent conflict. We
International Nuclear Information System (INIS)
Phan Thanh An
2008-06-01
The convex rope problem, posed by Peshkin and Sanderson in IEEE J. Robotics Automat, 2 (1986) pp. 53-58, is to find the counterclockwise and clockwise convex ropes starting at the vertex a and ending at the vertex b of a simple polygon, where a is on the boundary of the convex hull of the polygon and b is visible from infinity. In this paper, we present a linear time algorithm for solving this problem without resorting to a linear-time triangulation algorithm and without resorting to a convex hull algorithm for the polygon. The counterclockwise (clockwise, respectively) convex rope consists of two polylines obtained in a basic incremental strategy described in convex hull algorithms for the polylines forming the polygon from a to b. (author)
On negative norm states in supersymmetric theories
International Nuclear Information System (INIS)
Ellwanger, U.
1983-01-01
We study the effective kinetic energy of scalar fields for two classes of supersymmetric theories. In theories with very large VEVs of scalar fields, as proposed by Witten, the use of the renormalization group improved effective action prevents the appearance of negative norm states. For simpler theories a general criterium for the absence of negative norm states is given, which is violated in a model with O(N)-symmetry proposed recently. (orig.)
On the complexity of a combined homotopy interior method for convex programming
Yu, Bo; Xu, Qing; Feng, Guochen
2007-03-01
In [G.C. Feng, Z.H. Lin, B. Yu, Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem, Nonlinear Anal. 32 (1998) 761-768; G.C. Feng, B. Yu, Combined homotopy interior point method for nonlinear programming problems, in: H. Fujita, M. Yamaguti (Eds.), Advances in Numerical Mathematics, Proceedings of the Second Japan-China Seminar on Numerical Mathematics, Lecture Notes in Numerical and Applied Analysis, vol. 14, Kinokuniya, Tokyo, 1995, pp. 9-16; Z.H. Lin, B. Yu, G.C. Feng, A combined homotopy interior point method for convex programming problem, Appl. Math. Comput. 84 (1997) 193-211.], a combined homotopy was constructed for solving non-convex programming and convex programming with weaker conditions, without assuming the logarithmic barrier function to be strictly convex and the solution set to be bounded. It was proven that a smooth interior path from an interior point of the feasible set to a K-K-T point of the problem exists. This shows that combined homotopy interior point methods can solve the problem that commonly used interior point methods cannot solveE However, so far, there is no result on its complexity, even for linear programming. The main difficulty is that the objective function is not monotonically decreasing on the combined homotopy path. In this paper, by taking a piecewise technique, under commonly used conditions, polynomiality of a combined homotopy interior point method is given for convex nonlinear programming.
NEIGHBORHOOD NORMS AND SUBSTANCE USE AMONG TEENS
Musick, Kelly; Seltzer, Judith A.; Schwartz, Christine R.
2008-01-01
This paper uses new data from the Los Angeles Family and Neighborhood Survey (L.A. FANS) to examine how neighborhood norms shape teenagers’ substance use. Specifically, it takes advantage of clustered data at the neighborhood level to relate adult neighbors’ attitudes and behavior with respect to smoking, drinking, and drugs, which we treat as norms, to teenagers’ own smoking, drinking, and drug use. We use hierarchical linear models to account for parents’ attitudes and behavior and other characteristics of individuals and families. We also investigate how the association between neighborhood norms and teen behavior depends on: (1) the strength of norms, as measured by consensus in neighbors’ attitudes and conformity in their behavior; (2) the willingness and ability of neighbors to enforce norms, for instance, by monitoring teens’ activities; and (3) the degree to which teens are exposed to their neighbors. We find little association between neighborhood norms and teen substance use, regardless of how we condition the relationship. We discuss possible theoretical and methodological explanations for this finding. PMID:18496598
Convergence of Hybrid Space Mapping Algorithms
DEFF Research Database (Denmark)
Madsen, Kaj; Søndergaard, Jacob
2004-01-01
may be poor, or the method may even fail to converge to a stationary point. We consider a convex combination of the space mapping technique with a classical optimization technique. The function to be optimized has the form \\$H \\$\\backslash\\$circ f\\$ where \\$H: \\$\\backslash\\$dR\\^m \\$\\backslash......\\$mapsto \\$\\backslash\\$dR\\$ is convex and \\$f: \\$\\backslash\\$dR\\^n \\$\\backslash\\$mapsto \\$\\backslash\\$dR\\^m\\$ is smooth. Experience indicates that the combined method maintains the initial efficiency of the space mapping technique. We prove that the global convergence property of the classical technique is also...
NORM and radon in Austria. Status and strategy; Norm und Radon in Oesterreich. Status und Strategie
Energy Technology Data Exchange (ETDEWEB)
Maringer, F.J. [Bundesamt fuer Eich- und Vermessungswesen, Wien (Austria)
2013-07-01
The author reviews the actual radiation protection practice in Austria for NORM and radon, including possible strategies and developments. Specific topics are radiation protection technologies, metrological resources for NORM in Austria, civil engineering standards (OeNORM) for radon measurement, radon prevention for new buildings and radon cleansing for existing buildings, future assessment and legal regulation of radioactivity in construction materials. The strategic development in Austria considers the current European standard projects (EU standards) and European and international research programs.
Accelerated Microstructure Imaging via Convex Optimization (AMICO) from diffusion MRI data.
Daducci, Alessandro; Canales-Rodríguez, Erick J; Zhang, Hui; Dyrby, Tim B; Alexander, Daniel C; Thiran, Jean-Philippe
2015-01-15
Microstructure imaging from diffusion magnetic resonance (MR) data represents an invaluable tool to study non-invasively the morphology of tissues and to provide a biological insight into their microstructural organization. In recent years, a variety of biophysical models have been proposed to associate particular patterns observed in the measured signal with specific microstructural properties of the neuronal tissue, such as axon diameter and fiber density. Despite very appealing results showing that the estimated microstructure indices agree very well with histological examinations, existing techniques require computationally very expensive non-linear procedures to fit the models to the data which, in practice, demand the use of powerful computer clusters for large-scale applications. In this work, we present a general framework for Accelerated Microstructure Imaging via Convex Optimization (AMICO) and show how to re-formulate this class of techniques as convenient linear systems which, then, can be efficiently solved using very fast algorithms. We demonstrate this linearization of the fitting problem for two specific models, i.e. ActiveAx and NODDI, providing a very attractive alternative for parameter estimation in those techniques; however, the AMICO framework is general and flexible enough to work also for the wider space of microstructure imaging methods. Results demonstrate that AMICO represents an effective means to accelerate the fit of existing techniques drastically (up to four orders of magnitude faster) while preserving accuracy and precision in the estimated model parameters (correlation above 0.9). We believe that the availability of such ultrafast algorithms will help to accelerate the spread of microstructure imaging to larger cohorts of patients and to study a wider spectrum of neurological disorders. Copyright © 2014 The Authors. Published by Elsevier Inc. All rights reserved.
Product numerical range in a space with tensor product structure
Puchała, Zbigniew; Gawron, Piotr; Miszczak, Jarosław Adam; Skowronek, Łukasz; Choi, Man-Duen; Życzkowski, Karol
2010-01-01
We study operators acting on a tensor product Hilbert space and investigate their product numerical range, product numerical radius and separable numerical range. Concrete bounds for the product numerical range for Hermitian operators are derived. Product numerical range of a non-Hermitian operator forms a subset of the standard numerical range containing the barycenter of the spectrum. While the latter set is convex, the product range needs not to be convex nor simply connected. The product ...
Anomalous dynamics triggered by a non-convex equation of state in relativistic flows
Ibáñez, J. M.; Marquina, A.; Serna, S.; Aloy, M. A.
2018-05-01
The non-monotonicity of the local speed of sound in dense matter at baryon number densities much higher than the nuclear saturation density (n0 ≈ 0.16 fm-3) suggests the possible existence of a non-convex thermodynamics which will lead to a non-convex dynamics. Here, we explore the rich and complex dynamics that an equation of state (EoS) with non-convex regions in the pressure-density plane may develop as a result of genuinely relativistic effects, without a classical counterpart. To this end, we have introduced a phenomenological EoS, the parameters of which can be restricted owing to causality and thermodynamic stability constraints. This EoS can be regarded as a toy model with which we may mimic realistic (and far more complex) EoSs of practical use in the realm of relativistic hydrodynamics.
DEFF Research Database (Denmark)
Kafle, Bishoksan; Gallagher, John Patrick
2014-01-01
We present an approach to constrained Horn clause (CHC) verification combining three techniques: abstract interpretation over a domain of convex polyhedra, specialisation of the constraints in CHCs using abstract interpretation of query-answer transformed clauses, and refinement by splitting...... in conjunction with specialisation for propagating constraints it can frequently solve challenging verification problems. This is a contribution in itself, but refinement is needed when it fails, and the question of how to refine convex polyhedral analyses has not been studied much. We present a refinement...... technique based on interpolants derived from a counterexample trace; these are used to drive a property-based specialisation that splits predicates, leading in turn to more precise convex polyhedral analyses. The process of specialisation, analysis and splitting can be repeated, in a manner similar...
Schur-Convexity for a Class of Symmetric Functions and Its Applications
Directory of Open Access Journals (Sweden)
Wei-Feng Xia
2009-01-01
Full Text Available For x=(x1,x2,…,xn∈R+n, the symmetric function ϕn(x,r is defined by ϕn(x,r=ϕn(x1,x2,…,xn;r=∏1≤i1
A parallel Discrete Element Method to model collisions between non-convex particles
Directory of Open Access Journals (Sweden)
Rakotonirina Andriarimina Daniel
2017-01-01
Full Text Available In many dry granular and suspension flow configurations, particles can be highly non-spherical. It is now well established in the literature that particle shape affects the flow dynamics or the microstructure of the particles assembly in assorted ways as e.g. compacity of packed bed or heap, dilation under shear, resistance to shear, momentum transfer between translational and angular motions, ability to form arches and block the flow. In this talk, we suggest an accurate and efficient way to model collisions between particles of (almost arbitrary shape. For that purpose, we develop a Discrete Element Method (DEM combined with a soft particle contact model. The collision detection algorithm handles contacts between bodies of various shape and size. For nonconvex bodies, our strategy is based on decomposing a non-convex body into a set of convex ones. Therefore, our novel method can be called “glued-convex method” (in the sense clumping convex bodies together, as an extension of the popular “glued-spheres” method, and is implemented in our own granular dynamics code Grains3D. Since the whole problem is solved explicitly, our fully-MPI parallelized code Grains3D exhibits a very high scalability when dynamic load balancing is not required. In particular, simulations on up to a few thousands cores in configurations involving up to a few tens of millions of particles can readily be performed. We apply our enhanced numerical model to (i the collapse of a granular column made of convex particles and (i the microstructure of a heap of non-convex particles in a cylindrical reactor.
Method of convex rigid frames and applications in studies of multipartite quNit pure states
International Nuclear Information System (INIS)
Zhong Zaizhe
2005-01-01
In this letter, we suggest a method of convex rigid frames in the studies of multipartite quNit pure states. We illustrate what the convex rigid frames are, and what is their method. As applications, we use this method to solve some basic problems and give some new results (three theorems): the problem of the partial separability of the multipartite quNit pure states and its geometric explanation; the problem of the classification of multipartite quNit pure states, giving a perfect explanation of the local unitary transformations; thirdly, we discuss the invariants of classes and give a possible physical explanation. (letter to the editor)
Optimization of Transverse Oscillating Fields for Vector Velocity Estimation with Convex Arrays
DEFF Research Database (Denmark)
Jensen, Jørgen Arendt
2013-01-01
A method for making Vector Flow Images using the transverse oscillation (TO) approach on a convex array is presented. The paper presents optimization schemes for TO fields for convex probes and evaluates their performance using Field II simulations and measurements using the SARUS experimental...... from 90 to 45 degrees in steps of 15 degrees. The optimization routine changes the lateral oscillation period lx to yield the best possible estimates based on the energy ratio between positive and negative spatial frequencies in the ultrasound field. The basic equation for lx gives 1.14 mm at 40 mm...
License or entry decision for innovator in international duopoly with convex cost functions
Hattori, Masahiko; Tanaka, Yasuhito
2017-01-01
We consider a choice of options for a foreign innovating firm to license its new cost-reducing technology to a domestic incumbent firm or to enter the domestic market with or without license under convex cost functions. With convex cost functions the domestic market and the foreign market are not separated, and the results depend on the relative size of those markets. In a specific case with linear demand and quadratic cost, entry without license strategy is never the optimal strategy for the...
Smoothing-Norm Preconditioning for Regularizing Minimum-Residual Methods
DEFF Research Database (Denmark)
Hansen, Per Christian; Jensen, Toke Koldborg
2006-01-01
take into account a smoothing norm for the solution. This technique is well established for CGLS, but it does not immediately carry over to minimum-residual methods when the smoothing norm is a seminorm or a Sobolev norm. We develop a new technique which works for any smoothing norm of the form $\\|L...
Geochemical signature of radioactive waste: oil NORM
Energy Technology Data Exchange (ETDEWEB)
Costa, Gilberto T. de Paula; Costa-de-Moura, Jorge; Gomes, Carlos de Almeida; Sampaio, Emidio A. Lopes, E-mail: gilberto.costa@cnen.gov.br, E-mail: jcmoura@cnen.gov.br, E-mail: cgomes@cnen.gov.br [Comissao Nacional de Energia Nuclear (CNEN), Rio de Janeiro, RJ (Brazil). Div. de Controle de Rejeitos e Transporte de Materiais Radioativos
2017-07-01
The Brazilian Nuclear Agency (CNEN) rules all nuclear activity in Brazil as demanded by the Federal Constitution, articles 21, XXIII, and 177, V, and by the Federal Acts 4.118/62 and 10.308/2001. Therefore, the CNEN is responsible for any radioactive waste disposal in the country. Oil Naturally Occurring Radioactive Materials (Oil NORM) in this paper refers to waste coming from oil exploration. Oil NORM has called much attention during the last decades, mostly because it is not possible to determine its primary source due to the actual absence of regulatory control mechanism. There is no efficient regulatory tool which allows determining the origin of such NORM wastes even among those facilities under regulatory control. This fact may encourage non-authorized radioactive material transportation, smuggling and terrorism. The aim of this project is to provide a geochemical signature for each oil NORM waste using its naturally occurring isotopic composition to identify its origin. The here proposed method is a specific geochemical modeling of oil sludge NORM samples which are analyzed for radioisotopes normally present in oil pipes, such as {sup 228}Ac, {sup 214}Bi and {sup 214}Pb. The activity ratios are plotted in scatter diagrams. This method was successfully tested with data of different sources obtained from analysis reports from the Campos Basin/Brazil and from literature. (author)
Geochemical signature of radioactive waste: oil NORM
International Nuclear Information System (INIS)
Costa, Gilberto T. de Paula; Costa-de-Moura, Jorge; Gomes, Carlos de Almeida; Sampaio, Emidio A. Lopes
2017-01-01
The Brazilian Nuclear Agency (CNEN) rules all nuclear activity in Brazil as demanded by the Federal Constitution, articles 21, XXIII, and 177, V, and by the Federal Acts 4.118/62 and 10.308/2001. Therefore, the CNEN is responsible for any radioactive waste disposal in the country. Oil Naturally Occurring Radioactive Materials (Oil NORM) in this paper refers to waste coming from oil exploration. Oil NORM has called much attention during the last decades, mostly because it is not possible to determine its primary source due to the actual absence of regulatory control mechanism. There is no efficient regulatory tool which allows determining the origin of such NORM wastes even among those facilities under regulatory control. This fact may encourage non-authorized radioactive material transportation, smuggling and terrorism. The aim of this project is to provide a geochemical signature for each oil NORM waste using its naturally occurring isotopic composition to identify its origin. The here proposed method is a specific geochemical modeling of oil sludge NORM samples which are analyzed for radioisotopes normally present in oil pipes, such as 228 Ac, 214 Bi and 214 Pb. The activity ratios are plotted in scatter diagrams. This method was successfully tested with data of different sources obtained from analysis reports from the Campos Basin/Brazil and from literature. (author)
Die vraag na norme vir moraliteit
Directory of Open Access Journals (Sweden)
J. A. Heyns
1989-08-01
Full Text Available The demand for norms for morality This article is a short investigation of the existence and the character of norms for morality. Owing to the secularized society in which we live today the well known Martin Buber once spoke of the eclipse of the light of heaven as an eclipse of God and, we may add, an eclipse also of moral norms. A theocentric basis for moral norms should be accepted as well as the fact that the whole of creation is subject unconditionally to his cosmonomic order. Consequently there is a concrete demand or claim on man in the situation he confronts, which cannot be reduced to an application of general moral norms to the situation concerned. God does speak to us through historical situations as well. We shall have to judge the concrete historical situation in its immediate hic et nunc call on us in the light of the will and law of God, as they are revealed to us in his Word.
EQ-5D Portuguese population norms.
Ferreira, Lara Noronha; Ferreira, Pedro L; Pereira, Luis N; Oppe, Mark
2014-03-01
The EQ-5D is a widely used preference-based measure. Normative data can be used as references to analyze the effects of healthcare, determine the burden of disease and enable regional or country comparisons. Population norms for the EQ-5D exist for other countries but have not been previously published for Portugal. The purpose of this study was to derive EQ-5D Portuguese population norms. The EQ-5D was applied by phone interview to a random sample of the Portuguese general population (n = 1,500) stratified by age, gender and region. The Portuguese value set was used to derive the EQ-5D index. Mean values were computed by gender and age groups, marital status, educational attainment, region and other variables to obtain the EQ-5D Portuguese norms. Health status declines with advancing age, and women reported worse health status than men. These results are similar to other EQ-5D population health studies. This study provides Portuguese population health-related quality of life data measured by the EQ-5D that can be used as population norms. These norms can be used to inform Portuguese policy makers, health care professionals and researchers in issues related to health care policy and planning and quantification of treatment effects on health status.
Cyber Norms for Civilian Nuclear Power Plants
Energy Technology Data Exchange (ETDEWEB)
Spirito, Christopher
2016-11-01
The international community agrees that the safe operation of civilian nuclear infrastructure is in every population’s best interest. One challenge each government must address is defining and agreeing to a set of acceptable norms of behavior in cyberspace as they relate to these facilities. The introduction of digital systems and networking technologies into these environments has led to the possibility that control and supporting computer systems are now accessible and exploitable, especially where interconnections to global information and communications technology (ICT) networks exist. The need for norms of behavior in cyberspace includes what is expected of system architects and cyber defenders as well as adversaries who should abide by rules of engagement even while conducting acts that violate national and international laws. The goal of this paper is to offer three behavioral cyber norms to improve the overall security of the ICT and Operational Technology (OT) networks and systems that underlie the operations of nuclear facilities. These norms of behavior will be specifically defined with the goals of reducing the threats associated to the theft of nuclear materials, accidental release of radiation and sabotage of nuclear processes. These norms would also include instances where an unwitting attacker or intelligence collection entity inadvertently makes their way into a nuclear facility network or system and can recognize they are in a protected zone and an approach to ensuring that these zones are not exploitable by bad actors to place their sensitive cyber effect delivery systems.
Stamkou, E.; van Kleef, G.A.; Homan, A.C.; Galinsky, A.D.
2016-01-01
Norm violations engender both negative reactions and perceptions of power from observers. We addressed this paradox by examining whether observers’ tendency to grant power to norm followers versus norm violators is moderated by the observer’s position in the hierarchy. Because norm violations
Characterization of generalized Orlicz spaces
Ferreira, Rita; Hä stö , Peter; Ribeiro, Ana Margarida
2016-01-01
The norm in classical Sobolev spaces can be expressed as a difference quotient. This expression can be used to generalize the space to the fractional smoothness case. Because the difference quotient is based on shifting the function, it cannot be used in generalized Orlicz spaces. In its place, we introduce a smoothed difference quotient and show that it can be used to characterize the generalized Orlicz-Sobolev space. Our results are new even in Orlicz spaces and variable exponent spaces.
Characterization of generalized Orlicz spaces
Ferreira, Rita
2016-12-14
The norm in classical Sobolev spaces can be expressed as a difference quotient. This expression can be used to generalize the space to the fractional smoothness case. Because the difference quotient is based on shifting the function, it cannot be used in generalized Orlicz spaces. In its place, we introduce a smoothed difference quotient and show that it can be used to characterize the generalized Orlicz-Sobolev space. Our results are new even in Orlicz spaces and variable exponent spaces.
True gender ratios and stereotype rating norms
Directory of Open Access Journals (Sweden)
Alan eGarnham
2015-07-01
Full Text Available We present a study comparing, in English, perceived distributions of men and women in 422 named occupations with actual real world distributions. The first set of data was obtained from previous a large-scale norming study, whereas the second set was mostly drawn from UK governmental sources. In total, real world ratios for 290 occupations were obtained for our perceive vs. real world comparison, of which 205 were deemed to be unproblematic. The means for the two sources were similar and the correlation between them was high, suggesting that people are generally accurate at judging real gender ratios, though there were some notable exceptions. Beside this correlation, some interesting patterns emerged from the two sources, suggesting some response strategies when people complete norming studies. We discuss these patterns in terms of the way real world data might complement norming studies in determining gender stereotypicality.
Normed algebras and the geometric series test
Directory of Open Access Journals (Sweden)
Robert Kantrowitz
2017-11-01
Full Text Available The purpose of this article is to survey a class of normed algebras that share many central features of Banach algebras, save for completeness. The likeness of these algebras to Banach algebras derives from the fact that the geometric series test is valid, whereas the lack of completeness points to the failure of the absolute convergence test for series in the algebra. Our main result is a compendium of conditions that are all equivalent to the validity of the geometric series test for commutative unital normed algebras. Several examples in the final section showcase some incomplete normed algebras for which the geometric series test is valid, and still others for which it is not.
Norm in the matter of safeguards
International Nuclear Information System (INIS)
Saavedra, Analia; Maceiras, Elena; Valentino, Lucia; Chiliutti, Mauro
2001-01-01
The Nuclear Regulatory Authority (NRA), through its norm, establishes requirements in the matter of safeguards that allow him to control the fulfillment of the objectives established at national level and the international commitments that the Argentine Republic has assumed in the scope of Nuclear Non-proliferation. The measures of fortification of the safeguards proposed by the International Atomic Energy Agency (IAEA), will imply new obligations for the country and consequently it will require the update of the effective norm in the matter. The objective of this work is to describe the reach of the update of the norm in the matter of safeguards and their relation with some procedures of application in the scope of the radiological protection and the nuclear security
Economical modelling of social and moral norms
International Nuclear Information System (INIS)
Nyborg, Karine
2001-01-01
Social norms and moral motivations are often ignored in economic models. It is possible, however, to model social and moral norms within the framework of economical theory. This may be useful even if the exposition is necessarily simplified. The article gives some examples. An analysis shows how the ''No Smoking Act'' may have led to a change in social norms in Norway and indirectly changed the behaviour of smokers in places where this act does not apply. Behaviour with moral motivation may also be affected by changes in regulations, economic incentives or other external conditions. For example, a more efficient collection system for source-separated waste may induce people to sharpen the moral claim on their own efforts. Indeed, interviews show that imposing a fee upon people not volunteering in communal work may cause the attendance to drop further
Directory of Open Access Journals (Sweden)
Ghulam Farid
2017-10-01
Full Text Available The aim of this paper is to obtain some more general fractional integral inequalities of Fejer Hadamard type for p-convex functions via Riemann-Liouville k-fractional integrals. Also in particular fractional inequalities for p-convex functions via Riemann-Liouville fractional integrals have been deduced.
A New Replication Norm for Psychology
Directory of Open Access Journals (Sweden)
Etienne P LeBel
2015-10-01
Full Text Available In recent years, there has been a growing concern regarding the replicability of findings in psychology, including a mounting number of prominent findings that have failed to replicate via high-powered independent replication attempts. In the face of this replicability “crisis of confidence”, several initiatives have been implemented to increase the reliability of empirical findings. In the current article, I propose a new replication norm that aims to further boost the dependability of findings in psychology. Paralleling the extant social norm that researchers should peer review about three times as many articles that they themselves publish per year, the new replication norm states that researchers should aim to independently replicate important findings in their own research areas in proportion to the number of original studies they themselves publish per year (e.g., a 4:1 original-to-replication studies ratio. I argue this simple approach could significantly advance our science by increasing the reliability and cumulative nature of our empirical knowledge base, accelerating our theoretical understanding of psychological phenomena, instilling a focus on quality rather than quantity, and by facilitating our transformation toward a research culture where executing and reporting independent direct replications is viewed as an ordinary part of the research process. To help promote the new norm, I delineate (1 how each of the major constituencies of the research process (i.e., funders, journals, professional societies, departments, and individual researchers can incentivize replications and promote the new norm and (2 any obstacles each constituency faces in supporting the new norm.
Elements of mathematics topological vector spaces
Bourbaki, Nicolas
2003-01-01
This is a softcover reprint of the English translation of 1987 of the second edition of Bourbaki's Espaces Vectoriels Topologiques (1981). This second edition is a brand new book and completely supersedes the original version of nearly 30 years ago. But a lot of the material has been rearranged, rewritten, or replaced by a more up-to-date exposition, and a good deal of new material has been incorporated in this book, all reflecting the progress made in the field during the last three decades. Table of Contents. Chapter I: Topological vector spaces over a valued field. Chapter II: Convex sets and locally convex spaces. Chapter III: Spaces of continuous linear mappings. Chapter IV: Duality in topological vector spaces. Chapter V: Hilbert spaces (elementary theory). Finally, there are the usual "historical note", bibliography, index of notation, index of terminology, and a list of some important properties of Banach spaces. (Based on Math Reviews, 1983).
Expectancy and Professional Norms in Legal Translation
DEFF Research Database (Denmark)
Faber, Dorrit; Hjort-Pedersen, Mette
2013-01-01
. These parameters focus on the degree to which the use of explicitation and implicitation is considered to influence meaning transfer, authentic English legal language and style, and the informative function of the translation in a defined translational situation. Based on Chesterman’s categorization of norms...... perceived norms influence the use of explicitation and implicitation. The findings are based on experiments involving Danish translators and legal experts who were asked to evaluate three different translations into English of the same Danish legal source text on a set of defined parameters...
NORM and the Risk of Internal Contamination
International Nuclear Information System (INIS)
Syaifudin, Mukh; Iin Kurnia; Yanti Lusiyanti; Siti Nurhayati; Iwiq Indrawati
2003-01-01
The earth and its atmosphere contain various natural radioactive materials known as NORM (naturally occurring radioactive materials) as sources of external and internal radiation exposures to human. The main radionuclides of NORM are uranium and thorium chairs and their progenies. In this paper, it will be discussed briefly about effects of internal contamination these elements which could enter into the body through inhalation and ingestion as well as absorption on the skin. The distribution, excretion and decontamination methods of the radionuclide incorporated in the body are also discussed. (author)
CONSIDERATIONS REGARDING THE INTERPRETATION OF LEGAL NORM
Directory of Open Access Journals (Sweden)
Camelia IGNĂTESCU
2013-12-01
Full Text Available The legal norm represents an intellectual creation of the legislator. It is expressed in legal language, according to certain rules of preparation, respecting the grammar rules specific to the language in which it is drawn up, as well as the legislative technique. The final result, thought out and wanted by the author, must be understood in direct relation to his intention. Interpretation of the law concerns the particular significance of the general form and the cognitive value of the information, of grammatical construction that expresses the legal norm.
Convexity of Energy-Like Functions: Theoretical Results and Applications to Power System Operations
Energy Technology Data Exchange (ETDEWEB)
Dvijotham, Krishnamurthy [California Inst. of Technology (CalTech), Pasadena, CA (United States); Low, Steven [California Inst. of Technology (CalTech), Pasadena, CA (United States); Chertkov, Michael [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2015-01-12
Power systems are undergoing unprecedented transformations with increased adoption of renewables and distributed generation, as well as the adoption of demand response programs. All of these changes, while making the grid more responsive and potentially more efficient, pose significant challenges for power systems operators. Conventional operational paradigms are no longer sufficient as the power system may no longer have big dispatchable generators with sufficient positive and negative reserves. This increases the need for tools and algorithms that can efficiently predict safe regions of operation of the power system. In this paper, we study energy functions as a tool to design algorithms for various operational problems in power systems. These have a long history in power systems and have been primarily applied to transient stability problems. In this paper, we take a new look at power systems, focusing on an aspect that has previously received little attention: Convexity. We characterize the domain of voltage magnitudes and phases within which the energy function is convex in these variables. We show that this corresponds naturally with standard operational constraints imposed in power systems. We show that power of equations can be solved using this approach, as long as the solution lies within the convexity domain. We outline various desirable properties of solutions in the convexity domain and present simple numerical illustrations supporting our results.
Perimeter generating functions for the mean-squared radius of gyration of convex polygons
International Nuclear Information System (INIS)
Jensen, Iwan
2005-01-01
We have derived long series expansions for the perimeter generating functions of the radius of gyration of various polygons with a convexity constraint. Using the series we numerically find simple (algebraic) exact solutions for the generating functions. In all cases the size exponent ν 1. (letter to the editor)
A Convex Variational Model for Restoring Blurred Images with Multiplicative Noise
DEFF Research Database (Denmark)
Dong, Yiqiu; Tieyong Zeng
2013-01-01
In this paper, a new variational model for restoring blurred images with multiplicative noise is proposed. Based on the statistical property of the noise, a quadratic penalty function technique is utilized in order to obtain a strictly convex model under a mild condition, which guarantees...
Modeling IrisCode and its variants as convex polyhedral cones and its security implications.
Kong, Adams Wai-Kin
2013-03-01
IrisCode, developed by Daugman, in 1993, is the most influential iris recognition algorithm. A thorough understanding of IrisCode is essential, because over 100 million persons have been enrolled by this algorithm and many biometric personal identification and template protection methods have been developed based on IrisCode. This paper indicates that a template produced by IrisCode or its variants is a convex polyhedral cone in a hyperspace. Its central ray, being a rough representation of the original biometric signal, can be computed by a simple algorithm, which can often be implemented in one Matlab command line. The central ray is an expected ray and also an optimal ray of an objective function on a group of distributions. This algorithm is derived from geometric properties of a convex polyhedral cone but does not rely on any prior knowledge (e.g., iris images). The experimental results show that biometric templates, including iris and palmprint templates, produced by different recognition methods can be matched through the central rays in their convex polyhedral cones and that templates protected by a method extended from IrisCode can be broken into. These experimental results indicate that, without a thorough security analysis, convex polyhedral cone templates cannot be assumed secure. Additionally, the simplicity of the algorithm implies that even junior hackers without knowledge of advanced image processing and biometric databases can still break into protected templates and reveal relationships among templates produced by different recognition methods.
Unifying kinetic approach to phoretic forces and torques onto moving and rotating convex particles
Kröger, M.; Hütter, M.
2006-01-01
We derive general expressions and present several examples for the phoretic forces and torques acting on a translationally moving and rotating convex tracer particle, usually a submicrosized aerosol particle, assumed to be small compared to the mean free path of the surrounding nonequilibrium gas.
Rooij, van I.; Stege, U.; Schactman, A.
2003-01-01
Recently there has been growing interest among psychologists in human performance on the Euclidean traveling salesperson problem (E-TSP). A debate has been initiated on what strategy people use in solving visually presented E-TSP instances. The most prominent hypothesis is the convex-hull
On the convex hull of the simple integer recourse objective function
Klein Haneveld, Willem K.; Stougie, L.; van der Vlerk, Maarten H.
1995-01-01
We consider the objective function of a simple integer recourse problem with fixed technology matrix. Using properties of the expected value function, we prove a relation between the convex hull of this function and the expected value function of a continuous simple recourse program. We present an
On evolving deformation microstructures in non-convex partially damaged solids
Gurses, Ercan; Miehe, Christian
2011-01-01
. These microstructures can be resolved by use of relaxation techniques associated with the construction of convex hulls. We propose a particular relaxation method for partially damaged solids and investigate it in one- and multi-dimensional settings. To this end, we
Convex Bodies With Minimal Volume Product in R^2 --- A New Proof
Lin, Youjiang
2010-01-01
In this paper, a new proof of the following result is given: The product of the volumes of an origin symmetric convex bodies $K$ in R^2 and of its polar body is minimal if and only if $K$ is a parallelogram.
Multiobjective optimization of classifiers by means of 3D convex-hull-based evolutionary algorithms
Zhao, J.; Basto, Fernandes V.; Jiao, L.; Yevseyeva, I.; Asep, Maulana A.; Li, R.; Bäck, T.H.W.; Tang, T.; Michael, Emmerich T. M.
2016-01-01
The receiver operating characteristic (ROC) and detection error tradeoff(DET) curves are frequently used in the machine learning community to analyze the performance of binary classifiers. Recently, the convex-hull-based multiobjective genetic programming algorithm was proposed and successfully
Deformation patterning driven by rate dependent non-convex strain gradient plasticity
Yalcinkaya, T.; Brekelmans, W.A.M.; Geers, M.G.D.
2011-01-01
A rate dependent strain gradient plasticity framework for the description of plastic slip patterning in a system with non-convex energetic hardening is presented. Both the displacement and the plastic slip fields are considered as primary variables. These fields are determined on a global level by
Primal Recovery from Consensus-Based Dual Decomposition for Distributed Convex Optimization
Simonetto, A.; Jamali-Rad, H.
2015-01-01
Dual decomposition has been successfully employed in a variety of distributed convex optimization problems solved by a network of computing and communicating nodes. Often, when the cost function is separable but the constraints are coupled, the dual decomposition scheme involves local parallel
Directory of Open Access Journals (Sweden)
Xuewen Mu
2015-01-01
quadratic programming over second-order cones and a bounded set. At each iteration, we only need to compute the metric projection onto the second-order cones and the projection onto the bound set. The result of convergence is given. Numerical results demonstrate that our method is efficient for the convex quadratic second-order cone programming problems with bounded constraints.
A DEEP CUT ELLIPSOID ALGORITHM FOR CONVEX-PROGRAMMING - THEORY AND APPLICATIONS
FRENK, JBG; GROMICHO, J; ZHANG, S
1994-01-01
This paper proposes a deep cut version of the ellipsoid algorithm for solving a general class of continuous convex programming problems. In each step the algorithm does not require more computational effort to construct these deep cuts than its corresponding central cut version. Rules that prevent
On the rank 1 convexity of stored energy functions of physically linear stress-strain relations
Czech Academy of Sciences Publication Activity Database
Šilhavý, Miroslav; Bertram, A.; Böhlke, T.
2007-01-01
Roč. 86, č. 3 (2007), s. 235-243 ISSN 0374-3535 Institutional research plan: CEZ:AV0Z10190503 Keywords : generalized linear elastic law s * generalized strain measures * rank 1 convexity Subject RIV: BA - General Mathematics Impact factor: 0.743, year: 2007
Directory of Open Access Journals (Sweden)
Mengkun Zhu
2015-01-01
Full Text Available Some sharp estimates of coefficients, distortion, and growth for harmonic mappings with analytic parts convex or starlike functions of order β are obtained. We also give area estimates and covering theorems. Our main results generalise those of Klimek and Michalski.
On the Monotonicity and Log-Convexity of a Four-Parameter Homogeneous Mean
Directory of Open Access Journals (Sweden)
Yang Zhen-Hang
2008-01-01
Full Text Available Abstract A four-parameter homogeneous mean is defined by another approach. The criterion of its monotonicity and logarithmically convexity is presented, and three refined chains of inequalities for two-parameter mean values are deduced which contain many new and classical inequalities for means.
Convex order approximations in case of cash flows of mixed signs
Dhaene, J.; Goovaerts, M.J.; Vanmaele, M.; van Weert, K.
2012-01-01
In Van Weert et al. (2010), results are obtained showing that, when allowing some of the cash flows to be negative, convex order lower bound approximations can still be used to solve general investment problems in a context of provisioning or terminal wealth. In this paper, a correction and further
From a Nonlinear, Nonconvex Variational Problem to a Linear, Convex Formulation
International Nuclear Information System (INIS)
Egozcue, J.; Meziat, R.; Pedregal, P.
2002-01-01
We propose a general approach to deal with nonlinear, nonconvex variational problems based on a reformulation of the problem resulting in an optimization problem with linear cost functional and convex constraints. As a first step we explicitly explore these ideas to some one-dimensional variational problems and obtain specific conclusions of an analytical and numerical nature
Headache as a crucial symptom in the etiology of convexal subarachnoid hemorrhage.
Rico, María; Benavente, Lorena; Para, Marta; Santamarta, Elena; Pascual, Julio; Calleja, Sergio
2014-03-01
Convexal subarachnoid hemorrhage has been associated with different diseases, reversible cerebral vasoconstriction syndrome and cerebral amyloid angiopathy being the 2 main causes. To investigate whether headache at onset is determinant in identifying the underlying etiology for convexal subarachnoid hemorrhage. After searching in the database of our hospital, 24 patients were found with convexal subarachnoid hemorrhage in the last 10 years. The mean age of the sample was 69.5 years. We recorded data referring to demographics, symptoms and neuroimaging. Cerebral amyloid angiopathy patients accounted for 46% of the sample, 13% were diagnosed with reversible cerebral vasoconstriction syndrome, 16% with several other etiologies, and in 25%, the cause remained unknown. Mild headache was present only in 1 (9%) of the 11 cerebral amyloid angiopathy patients, while severe headache was the dominant feature in 86% of cases of the remaining etiologies. Headache is a key symptom allowing a presumptive etiological diagnosis of convexal subarachnoid hemorrhage. While the absence of headache suggests cerebral amyloid angiopathy as the more probable cause, severe headache obliges us to rule out other etiologies, such as reversible cerebral vasoconstriction syndrome. © 2013 American Headache Society.
Mean-square performance of a convex combination of two adaptive filters
DEFF Research Database (Denmark)
Garcia, Jeronimo; Figueiras-Vidal, A.R.; Sayed, A.H.
2006-01-01
Combination approaches provide an interesting way to improve adaptive filter performance. In this paper, we study the mean-square performance of a convex combination of two transversal filters. The individual filters are independently adapted using their own error signals, while the combination i...
Directory of Open Access Journals (Sweden)
San-Yang Liu
2014-01-01
Full Text Available Two unified frameworks of some sufficient descent conjugate gradient methods are considered. Combined with the hyperplane projection method of Solodov and Svaiter, they are extended to solve convex constrained nonlinear monotone equations. Their global convergence is proven under some mild conditions. Numerical results illustrate that these methods are efficient and can be applied to solve large-scale nonsmooth equations.
Robust Nearfield Wideband Beamforming Design Based on Adaptive-Weighted Convex Optimization
Directory of Open Access Journals (Sweden)
Guo Ye-Cai
2017-01-01
Full Text Available Nearfield wideband beamformers for microphone arrays have wide applications in multichannel speech enhancement. The nearfield wideband beamformer design based on convex optimization is one of the typical representatives of robust approaches. However, in this approach, the coefficient of convex optimization is a constant, which has not used all the freedom provided by the weighting coefficient efficiently. Therefore, it is still necessary to further improve the performance. To solve this problem, we developed a robust nearfield wideband beamformer design approach based on adaptive-weighted convex optimization. The proposed approach defines an adaptive-weighted function by the adaptive array signal processing theory and adjusts its value flexibly, which has improved the beamforming performance. During each process of the adaptive updating of the weighting function, the convex optimization problem can be formulated as a SOCP (Second-Order Cone Program problem, which could be solved efficiently using the well-established interior-point methods. This method is suitable for the case where the sound source is in the nearfield range, can work well in the presence of microphone mismatches, and is applicable to arbitrary array geometries. Several design examples are presented to verify the effectiveness of the proposed approach and the correctness of the theoretical analysis.
A Deep Cut Ellipsoid Algorithm for convex Programming: theory and Applications
Frenk, J.B.G.; Gromicho Dos Santos, J.A.; Zhang, S.
1994-01-01
This paper proposes a deep cut version of the ellipsoid algorithm for solving a general class of continuous convex programming problems. In each step the algorithm does not require more computational effort to construct these deep cuts than its corresponding central cut version. Rules that prevent
A deep cut ellipsoid algorithm for convex programming : Theory and applications
J.B.G. Frenk (Hans); J.A.S. Gromicho (Joaquim); S. Zhang (Shuzhong)
1994-01-01
textabstractThis paper proposes a deep cut version of the ellipsoid algorithm for solving a general class of continuous convex programming problems. In each step the algorithm does not require more computational effort to construct these deep cuts than its corresponding central cut version. Rules
Study on feed forward neural network convex optimization for LiFePO4 battery parameters
Liu, Xuepeng; Zhao, Dongmei
2017-08-01
Based on the modern facility agriculture automatic walking equipment LiFePO4 Battery, the parameter identification of LiFePO4 Battery is analyzed. An improved method for the process model of li battery is proposed, and the on-line estimation algorithm is presented. The parameters of the battery are identified using feed forward network neural convex optimization algorithm.
An Efficient Algorithm to Calculate the Minkowski Sum of Convex 3D Polyhedra
Bekker, Henk; Roerdink, Jos B.T.M.
2001-01-01
A new method is presented to calculate the Minkowski sum of two convex polyhedra A and B in 3D. These graphs are given edge attributes. From these attributed graphs the attributed graph of the Minkowski sum is constructed. This graph is then transformed into the Minkowski sum of A and B. The running
The Lp Lp Lp-curvature images of convex bodies and Lp Lp Lp ...
Indian Academy of Sciences (India)
Associated with the -curvature image defined by Lutwak, some inequalities for extended mixed -affine surface areas of convex bodies and the support functions of -projection bodies are established. As a natural extension of a result due to Lutwak, an -type affine isoperimetric inequality, whose special cases are ...
On the Fermat-Lagrange principle for mixed smooth convex extremal problems
International Nuclear Information System (INIS)
Brinkhuis, Ya
2001-01-01
A simple geometric condition that can be attached to an extremal problem of a fairly general form included in a family of problems is indicated. This is used to demonstrate that the task of formulating a uniform condition for smooth convex problems can be satisfactorily accomplished. On the other hand, the necessity of this new condition of optimality is proved under certain technical assumptions
Intuitionistic fuzzy 2-metric space and its completion
International Nuclear Information System (INIS)
Mursaleen, M.; Lohani, Q.M. Danish; Mohiuddine, S.A.
2009-01-01
Recently, Mursaleen and Lohani [Mursaleen M, Lohani Danish. Intuitionistic fuzzy 2-normed space and some related concepts. Chaos, Solitons and Fractals (2008), doi:10.1016/j.chaos.2008.11.006] have introduced the concept of intuitionistic fuzzy 2-normed space. In this paper, we introduce the concept of intuitionistic fuzzy 2-metric space and study its completion.
Bloomer, Fiona K; O'Dowd, Kellie; Macleod, Catriona
2017-07-01
Meanings of abortion in society are constructed within sociohistorical and gendered spaces and manifested through myriad discourses that impact on the perception and treatment of the issue in that society. In societies with powerful oppressive anti-abortion norms, such as Northern Ireland, little is known as to how these norms are resisted by the adult population. This study uses a Foucauldian feminist approach to show how resistance to religious and patriarchal norms can be fostered through adult community abortion education. This resistance is multi-faceted and bolstered by a lived experience discourse, which does not necessarily involve eschewing religious notions held within society.
Contests versus Norms: Implications of Contest-Based and Norm-Based Intervention Techniques.
Bergquist, Magnus; Nilsson, Andreas; Hansla, André
2017-01-01
Interventions using either contests or norms can promote environmental behavioral change. Yet research on the implications of contest-based and norm-based interventions is lacking. Based on Goal-framing theory, we suggest that a contest-based intervention frames a gain goal promoting intensive but instrumental behavioral engagement. In contrast, the norm-based intervention was expected to frame a normative goal activating normative obligations for targeted and non-targeted behavior and motivation to engage in pro-environmental behaviors in the future. In two studies participants ( n = 347) were randomly assigned to either a contest- or a norm-based intervention technique. Participants in the contest showed more intensive engagement in both studies. Participants in the norm-based intervention tended to report higher intentions for future energy conservation (Study 1) and higher personal norms for non-targeted pro-environmental behaviors (Study 2). These findings suggest that contest-based intervention technique frames a gain goal, while norm-based intervention frames a normative goal.
Contests versus Norms: Implications of Contest-Based and Norm-Based Intervention Techniques
Directory of Open Access Journals (Sweden)
Magnus Bergquist
2017-11-01
Full Text Available Interventions using either contests or norms can promote environmental behavioral change. Yet research on the implications of contest-based and norm-based interventions is lacking. Based on Goal-framing theory, we suggest that a contest-based intervention frames a gain goal promoting intensive but instrumental behavioral engagement. In contrast, the norm-based intervention was expected to frame a normative goal activating normative obligations for targeted and non-targeted behavior and motivation to engage in pro-environmental behaviors in the future. In two studies participants (n = 347 were randomly assigned to either a contest- or a norm-based intervention technique. Participants in the contest showed more intensive engagement in both studies. Participants in the norm-based intervention tended to report higher intentions for future energy conservation (Study 1 and higher personal norms for non-targeted pro-environmental behaviors (Study 2. These findings suggest that contest-based intervention technique frames a gain goal, while norm-based intervention frames a normative goal.