WorldWideScience

Sample records for uniformly convex normed

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

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

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

  4. STRICT CONVEXITY THROUGH EQUIVALENT NORMS IN SEPARABLES BANACH SPACES

    Directory of Open Access Journals (Sweden)

    Willy Zubiaga Vera

    2016-12-01

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

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

    Science.gov (United States)

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

    2018-01-01

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

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

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

  8. On the Moduli of Convexity

    Czech Academy of Sciences Publication Activity Database

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

    2007-01-01

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

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

  10. On asphericity of convex bodies in linear normed spaces.

    Science.gov (United States)

    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.

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

    Science.gov (United States)

    Parekh, Ankit

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

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

    KAUST Repository

    Seneci, Tommaso

    2018-01-01

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

  13. Convergence of Implicit and Explicit Schemes for an Asymptotically Nonexpansive Mapping in -Uniformly Smooth and Strictly Convex Banach Spaces

    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.

  14. Pattern Discovery in Brain Imaging Genetics via SCCA Modeling with a Generic Non-convex Penalty.

    Science.gov (United States)

    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.

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

    KAUST Repository

    Seneci, Tommaso

    2018-05-01

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

  16. Convex Banding of the Covariance Matrix.

    Science.gov (United States)

    Bien, Jacob; Bunea, Florentina; Xiao, Luo

    2016-01-01

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

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

    CERN Document Server

    Bildhauer, Michael

    2003-01-01

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

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

  19. Undergraduate Convexity

    DEFF Research Database (Denmark)

    Lauritzen, Niels

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

  20. Convex geometry of quantum resource quantification

    Science.gov (United States)

    Regula, Bartosz

    2018-01-01

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

  1. The Iterative Reweighted Mixed-Norm Estimate for Spatio-Temporal MEG/EEG Source Reconstruction.

    Science.gov (United States)

    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.

  2. Undergraduate Convexity

    DEFF Research Database (Denmark)

    Lauritzen, Niels

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

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

  4. Convexity Adjustments

    DEFF Research Database (Denmark)

    M. Gaspar, Raquel; Murgoci, Agatha

    2010-01-01

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

  5. Convex analysis

    CERN Document Server

    Rockafellar, Ralph Tyrell

    2015-01-01

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

  6. T-S Fuzzy Model-Based Approximation and Filter Design for Stochastic Time-Delay Systems with Hankel Norm Criterion

    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.

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

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

  9. Convex Lattice Polygons

    Science.gov (United States)

    Scott, Paul

    2006-01-01

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

  10. A two-layer recurrent neural network for nonsmooth convex optimization problems.

    Science.gov (United States)

    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.

  11. Linearization of Euclidean Norm Dependent Inequalities Applied to Multibeam Satellites Design

    OpenAIRE

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

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

    Science.gov (United States)

    Rand, Alexander; Gillette, Andrew; Bajaj, Chandrajit

    2013-08-01

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

  13. Two-convex polygons

    OpenAIRE

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

    2009-01-01

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

  14. On Convex Quadratic Approximation

    NARCIS (Netherlands)

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

    2000-01-01

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

  15. Renorming c0 and closed, bounded, convex sets with fixed point property for affine nonexpansive mappings

    Science.gov (United States)

    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.

  16. L1-norm kernel discriminant analysis via Bayes error bound optimization for robust feature extraction.

    Science.gov (United States)

    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.

  17. Undergraduate Convexity

    DEFF Research Database (Denmark)

    Lauritzen, Niels

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

  18. A new convexity measure for polygons.

    Science.gov (United States)

    Zunic, Jovisa; Rosin, Paul L

    2004-07-01

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

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

  20. Theory of convex structures

    CERN Document Server

    van de Vel, MLJ

    1993-01-01

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

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

  2. Convex blind image deconvolution with inverse filtering

    Science.gov (United States)

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

    2018-03-01

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

  3. Analytic aspects of convexity

    CERN Document Server

    Colesanti, Andrea; Gronchi, Paolo

    2018-01-01

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

  4. Convex Interval Games

    NARCIS (Netherlands)

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

    2008-01-01

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

  5. Learning Sparse Visual Representations with Leaky Capped Norm Regularizers

    OpenAIRE

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

  6. Generalized Convexity and Inequalities

    OpenAIRE

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

    2007-01-01

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

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

  8. Dynamic Planar Convex Hull

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølfting; Jacob, Rico

    2002-01-01

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

  9. High-Dimensional Analysis of Convex Optimization-Based Massive MIMO Decoders

    KAUST Repository

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

  10. Use of Convexity in Ostomy Care

    Science.gov (United States)

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

    2017-01-01

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

  11. Dynamic Planar Convex Hull

    DEFF Research Database (Denmark)

    Jacob, Riko

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

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

  13. Geometry of isotropic convex bodies

    CERN Document Server

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

    2014-01-01

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

  14. Trace Norm Regularized CANDECOMP/PARAFAC Decomposition With Missing Data.

    Science.gov (United States)

    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.

  15. Economische consequenties invoering CTT-norm zoute baggerspecie voor Nederlandse havens: evaluatie CTT norm 2004-2005

    NARCIS (Netherlands)

    Linderhof, V.G.M.; Hess, S.; Kruseman, G.; Hattum, van B.; Bruinsma, F.; Jonkeren, O.; Ubbels, E.

    2006-01-01

    In juni 2004 werd een nieuw toetsingskader, de Chemie-Toxiciteit-Toets (CTT), voor zoute baggerspecie geïntroduceerd. De CTT vervangt de Uniforme Gehalte Toets (UGT). De belangrijkste wijzigingen zijn de expliciete norm voor Tributyltin (TBT) en signaleringswaarden voor een drietal bio-assays. Op

  16. Entropy coherent and entropy convex measures of risk

    NARCIS (Netherlands)

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

    2013-01-01

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

  17. Novel attempt to create uniform magnetic-field space generated by face-to-face settled HTS bulk magnets

    International Nuclear Information System (INIS)

    Oka, Tetsuo; Ichiju, Kana; Higa, Kazuya; Fukui, Satoshi; Ogawa, Jun; Sato, Takao; Yokoyama, Kazuya; Nakamura, Takashi

    2017-01-01

    Various experimental attempts have been made to obtain a uniform magnetic field in the space between face-to-face HTS bulk magnets that could possibly be utilized as NMR magnets. In general, the magnetic fields emitted from the magnetic pole surfaces containing HTS bulk magnets are characterized as non-uniform field distributions. Since the NMR magnets require highly uniform magnetic-field spaces, it has been assumed to be difficult to form uniform magnetic-field spaces between magnetic poles placed face-to-face. The authors modified the shapes of the magnetic-field distribution from convex to concave by attaching ferromagnetic iron plates to the pole surfaces. The magnets were then set face-to-face with various gaps of 30-70 mm, and the experimental data on magnetic-field uniformity was precisely measured in the space. In order to detect the NMR signals, the target performance for uniformity was set as 1,500 ppm throughout the 4-mm span on the x-axis, which is equivalent to performance in the past when the world's first detection of NMR signals was observed in the bore of hollow-type HTS bulk magnets. When we combined the concave and convex field distributions to compensate the uneven field distributions, the data of the best uniformity reached 358 ppm and 493 ppm in the 30 mm and 50 mm gaps, respectively, which exceeded the target value for the purpose of detecting the NMR signals within the space. Furthermore, it was shown that the field distributions change from concave to convex shape without any change at 1.1 T in the range from 7 to 11 mm in the 30-mm gap, indicating that the distributions are uniform. This suggests the possibility that the uniform magnetic-field space between the HTS bulk magnets set face-to-face expands. (author)

  18. Convex relaxations of spectral sparsity for robust super-resolution and line spectrum estimation

    Science.gov (United States)

    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.

  19. Convexity and Marginal Vectors

    NARCIS (Netherlands)

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

    2002-01-01

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

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

    CERN Document Server

    Bayoumi, A

    2003-01-01

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

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

    OpenAIRE

    Asaeedi, Saeed; Didehvar, Farzad; Mohades, Ali

    2013-01-01

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

  2. Notions of convexity

    CERN Document Server

    Hörmander, Lars

    1994-01-01

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

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

  4. Two generalizations of column-convex polygons

    International Nuclear Information System (INIS)

    Feretic, Svjetlan; Guttmann, Anthony J

    2009-01-01

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

  5. Entropy Coherent and Entropy Convex Measures of Risk

    NARCIS (Netherlands)

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

    2011-01-01

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

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

    International Nuclear Information System (INIS)

    Brinkhuis, Ya; Tikhomirov, V M

    2007-01-01

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

  7. Generalized convexity, generalized monotonicity recent results

    CERN Document Server

    Martinez-Legaz, Juan-Enrique; Volle, Michel

    1998-01-01

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

  8. Convex surfaces

    CERN Document Server

    Busemann, Herbert

    2008-01-01

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

  9. Convexity Adjustments for ATS Models

    DEFF Research Database (Denmark)

    Murgoci, Agatha; Gaspar, Raquel M.

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

  10. Convex games versus clan games

    NARCIS (Netherlands)

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

    2008-01-01

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

  11. Convex Games versus Clan Games

    NARCIS (Netherlands)

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

    2006-01-01

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

  12. An easy path to convex analysis and applications

    CERN Document Server

    Mordukhovich, Boris S

    2013-01-01

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

  13. Cantilever arrays with self-aligned nanotips of uniform height

    International Nuclear Information System (INIS)

    Koelmans, W W; Peters, T; Berenschot, E; De Boer, M J; Siekman, M H; Abelmann, L

    2012-01-01

    Cantilever arrays are employed to increase the throughput of imaging and manipulation at the nanoscale. We present a fabrication process to construct cantilever arrays with nanotips that show a uniform tip–sample distance. Such uniformity is crucial, because in many applications the cantilevers do not feature individual tip–sample spacing control. Uniform cantilever arrays lead to very similar tip–sample interaction within an array, enable non-contact modes for arrays and give better control over the load force in contact modes. The developed process flow uses a single mask to define both tips and cantilevers. An additional mask is required for the back side etch. The tips are self-aligned in the convex corner at the free end of each cantilever. Although we use standard optical contact lithography, we show that the convex corner can be sharpened to a nanometre scale radius by an isotropic underetch step. The process is robust and wafer-scale. The resonance frequencies of the cantilevers within an array are shown to be highly uniform with a relative standard error of 0.26% or lower. The tip–sample distance within an array of up to ten cantilevers is measured to have a standard error around 10 nm. An imaging demonstration using the AFM shows that all cantilevers in the array have a sharp tip with a radius below 10 nm. The process flow for the cantilever arrays finds application in probe-based nanolithography, probe-based data storage, nanomanufacturing and parallel scanning probe microscopy. (paper)

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

  15. Computing farthest neighbors on a convex polytope

    NARCIS (Netherlands)

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

    2002-01-01

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

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

  17. Nested convex bodies are chaseable

    NARCIS (Netherlands)

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

    2018-01-01

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

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

  19. Convex functions and optimization methods on Riemannian manifolds

    CERN Document Server

    Udrişte, Constantin

    1994-01-01

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

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

  1. Convexity properties of Hamiltonian group actions

    CERN Document Server

    Guillemin, Victor

    2005-01-01

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

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

  3. Introduction to Convex and Quasiconvex Analysis

    NARCIS (Netherlands)

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

    2004-01-01

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

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

    NARCIS (Netherlands)

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

    2007-01-01

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

  5. Non-convex multi-objective optimization

    CERN Document Server

    Pardalos, Panos M; Žilinskas, Julius

    2017-01-01

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

  6. Convex bodies with many elliptic sections

    OpenAIRE

    Arelio, Isaac; Montejano, Luis

    2014-01-01

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

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

  8. INdAM Workshop on Analytic Aspects of Convexity

    CERN Document Server

    Colesanti, Andrea; Gronchi, Paolo

    2018-01-01

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

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

  10. Convex polytopes

    CERN Document Server

    Klee, Victor; Ziegler, Günter

    2003-01-01

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

  11. Homogenization of non-uniformly bounded periodic diffusion energies in dimension two

    International Nuclear Information System (INIS)

    Braides, Andrea; Briane, Marc; Casado-Díaz, Juan

    2009-01-01

    This paper deals with the homogenization of two-dimensional oscillating convex functionals, the densities of which are equicoercive but not uniformly bounded from above. Using a uniform-convergence result for the minimizers, which holds for this type of scalar problems in dimension two, we prove in particular that the limit energy is local and recover the validity of the analogue of the well-known periodic homogenization formula in this degenerate case. However, in the present context the classical argument leading to integral representation based on the use of cut-off functions is useless due to the unboundedness of the densities. In its place we build sequences with bounded energy, which converge uniformly to piecewise-affine functions, taking point-wise extrema of recovery sequences for affine functions

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

    Science.gov (United States)

    Hernandez, Monica

    2017-12-01

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

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

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

  15. Nonsmooth Mechanics and Convex Optimization

    CERN Document Server

    Kanno, Yoshihiro

    2011-01-01

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

  16. Uniform in Time Description for Weak Solutions of the Hopf Equation with Nonconvex Nonlinearity

    Directory of Open Access Journals (Sweden)

    Antonio Olivas Martinez

    2009-01-01

    Full Text Available We consider the Riemann problem for the Hopf equation with concave-convex flux functions. Applying the weak asymptotics method we construct a uniform in time description for the Cauchy data evolution and show that the use of this method implies automatically the appearance of the Oleinik E-condition.

  17. Mixed-norm estimates for the M/EEG inverse problem using accelerated gradient methods.

    Science.gov (United States)

    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.

  18. Convexity of oligopoly games without transferable technologies

    NARCIS (Netherlands)

    Driessen, Theo; Meinhardt, Holger I.

    2005-01-01

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

  19. Conference on Convex Analysis and Global Optimization

    CERN Document Server

    Pardalos, Panos

    2001-01-01

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

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

    Science.gov (United States)

    Perrin, Angie

    2016-12-08

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

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

  2. $q$-norms are really norms

    OpenAIRE

    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.

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

  4. Characterizing Convexity of Games using Marginal Vectors

    NARCIS (Netherlands)

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

    2003-01-01

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

  5. Convex unwraps its first grown-up supercomputer

    Energy Technology Data Exchange (ETDEWEB)

    Manuel, T.

    1988-03-03

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

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

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

    CERN Document Server

    Panik, Michael J

    1993-01-01

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

  8. A generalization of the convex Kakeya problem

    KAUST Repository

    Ahn, Heekap

    2013-09-19

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

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

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

    International Nuclear Information System (INIS)

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

    2010-01-01

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

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

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

    Directory of Open Access Journals (Sweden)

    Maria Hussain

    2014-07-01

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

  13. Counting convex polygons in planar point sets

    NARCIS (Netherlands)

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

    1995-01-01

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

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

  15. Recovering convexity in non-associated plasticity

    Science.gov (United States)

    Francfort, Gilles A.

    2018-03-01

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

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

  17. Entropy coherent and entropy convex measures of risk

    NARCIS (Netherlands)

    Laeven, Roger; Stadje, M.A.

    2010-01-01

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

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

    KAUST Repository

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

    2018-01-01

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

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

    KAUST Repository

    Gomes, Diogo A.

    2018-01-26

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

  20. Stereotype locally convex spaces

    International Nuclear Information System (INIS)

    Akbarov, S S

    2000-01-01

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

  1. Stereotype locally convex spaces

    Energy Technology Data Exchange (ETDEWEB)

    Akbarov, S S

    2000-08-31

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

  2. Stereotype locally convex spaces

    Science.gov (United States)

    Akbarov, S. S.

    2000-08-01

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

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

    OpenAIRE

    Diamond, Steven; Boyd, Stephen

    2016-01-01

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

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

    Science.gov (United States)

    Diamond, Steven; Boyd, Stephen

    2016-04-01

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

  5. Entropy and convexity for nonlinear partial differential equations.

    Science.gov (United States)

    Ball, John M; Chen, Gui-Qiang G

    2013-12-28

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

  6. A Quantitative Version of a Theorem due to Borwein-Reich-Shafrir

    DEFF Research Database (Denmark)

    Kohlenbach, Ulrich

    2001-01-01

    We give a quantitative analysis of a result due to Borwein, Reich and Shafrir on the asymptotic behaviour of the general Krasnoselski-Mann iteration for nonexpansive self-mappings of convex sets in arbitrary normed spaces. Besides providing explicit bounds we also get new qualitative results...... bounds were known in that bounded case. For the unbounded case, no quantitative information was known before. Our results were obtained in a case study of analysing non-effective proofs in analysis by certain logical methods. General logical meta-theorems of the author guarantee (at least under some...... concerning the independence of the rate of asymptotic regularity of that iteration from various input data. In the special case of bounded convex sets, where by well-known results of Ishikawa, Edelstein/O'Brien and Goebel/Kirk the norm of the iteration converges to zero, we obtain uniform bounds which do...

  7. Convex Optimization in R

    Directory of Open Access Journals (Sweden)

    Roger Koenker

    2014-09-01

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

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

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

    Science.gov (United States)

    Peterson, Mary A; Salvagio, Elizabeth

    2008-12-15

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

  10. Convexities move because they contain matter.

    Science.gov (United States)

    Barenholtz, Elan

    2010-09-22

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

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

    Science.gov (United States)

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

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

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

  13. Approximate Fixed Point Theorems for the Class of Almost S-KKM𝒞 Mappings in Abstract Convex Uniform Spaces

    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.

  14. Fast approximate convex decomposition using relative concavity

    KAUST Repository

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

    2013-01-01

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

  15. Fast approximate convex decomposition using relative concavity

    KAUST Repository

    Ghosh, Mukulika

    2013-02-01

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

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

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

    OpenAIRE

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

    2012-01-01

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

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

  19. A generalization of the convex Kakeya problem

    KAUST Repository

    Ahn, Heekap

    2012-01-01

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

  20. From Norm Adoption to Norm Internalization

    Science.gov (United States)

    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.

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

  2. Strong convergence theorems for uniformly L-Lipschitzian mappings in Banach spaces

    International Nuclear Information System (INIS)

    Chidume, C.E.; Ofoedu, E.U.

    2007-07-01

    Let E be a real reflexive Banach space with uniform Gateaux differentiable norm, K be a nonempty bounded closed and convex subset of E , T : K → K be a uniformly L-Lipschitzian mapping such that F (T) := {x element of K : Tx = x} ≠ 0, u element of K be fixed and let {α n } n≥0 and {γ n } n≥0 subset of (0, 1) be such that lim n→∞ α n = 0 = lim n→ ∞ γ n and lim n→ ∞(β n - 1)/ α n = 0, where β n Σ j=0 n λ j and λ j = 1 + α j γ j L. Let S n := (1 - α n γ n )I + α n γ n T n . It is proved that there exists some integer N 0 > 1, such that for each n ≥ N 0 , there exists unique x n element of K such that x n = α n u+(1 -α n ) 1/ (n + 1) Σ j=0 n S j x n . If φ : E → R is defined by φ (y) := LIM n vertical bar vertical bar x n -y vertical bar vertical bar 2 for all y element of E here LIM denotes a Banach limit, vertical bar vertical bar x n - Tx n vertical bar vertical bar → 0 as n → ∞ and K min intersection F (T) ≠ 0, where K min := {x element of E : φ (x) = min (u element of K) φ (u) }, then it is proved that {x n } converges strongly to a fixed point of T. As an application, it is proved that the iterative process, z 0 element of K, z n+1 alpha# n u + (1 - α n ) 1/ (n + 1) Σ j=0 n S j z n , n ≥ 0, under suitable conditions on the iteration parameters, converges strongly to a fixed point of T. (author)

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

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

  5. Some Aspects of Convexity

    Indian Academy of Sciences (India)

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

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

  7. Amemiya norm equals Orlicz norm in general

    OpenAIRE

    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.

  8. A Fast Algorithm of Convex Hull Vertices Selection for Online Classification.

    Science.gov (United States)

    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.

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

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

  11. Convexity and concavity constants in Lorentz and Marcinkiewicz spaces

    Science.gov (United States)

    Kaminska, Anna; Parrish, Anca M.

    2008-07-01

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

  12. Two examples of non strictly convex large deviations

    OpenAIRE

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

    2016-01-01

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

  13. Convex Hull Aided Registration Method (CHARM).

    Science.gov (United States)

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

    2017-09-01

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

  14. On convex complexity measures

    Czech Academy of Sciences Publication Activity Database

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

    2010-01-01

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

  15. The occipital lobe convexity sulci and gyri.

    Science.gov (United States)

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

    2012-05-01

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

  16. VALIDATION OF THE DERIVED LAW NORM IN THE EUROPEAN AND INTERNATIONAL LAW

    Directory of Open Access Journals (Sweden)

    Alina Leția

    2013-11-01

    Full Text Available Throughout realizing the study we analyzed the validity of the European law norm resulting from the derived sources of law with obligatory force (regulations, decisions and directives in connection with the European law norm, the national law norm and the general principles of law considering the jurisprudence of the European Court of Justice and the supremacy of the European Union law also over national constitutions. Thus the European Union represents a new law order, having as subjects not only states member, but also the nationals of these states, who benefit of rights that can be appealed before national courts against public organisms or other private persons and obligations. Therefore, the European Court of Justice has successively imposed the direct applicability of community norms, continuing with the priority of these norms so that in the end the principle of the supremacy of the European law has been adopted. The European norm has to be respected and interpreted in a uniform manner in all states member, considering the fact that the supremacy of the European law over the national law is seen as a sine qua non of the integration, but also a fundamental principle of the Union. National courts guarantee the supremacy of the European norm and its unitary application – aspects analyzed in this study- through the procedure of preliminary decisions.

  17. Satisfaction with facial profile aesthetics: are norms overrated?

    Science.gov (United States)

    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.

  18. Transient disturbance growth in flows over convex surfaces

    Science.gov (United States)

    Karp, Michael; Hack, M. J. Philipp

    2017-11-01

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

  19. A norm knockout method on indirect reciprocity to reveal indispensable norms

    Science.gov (United States)

    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.

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

  1. Relationship between Norm-internalization and Cooperation in N-person Prisoners' Dilemma Games

    Science.gov (United States)

    Matsumoto, Mitsutaka

    In this paper, I discuss the problems of ``order in social situations'' using a computer simulation of iterated N-person prisoners' dilemma game. It has been claimed that, in the case of the 2-person prisoners' dilemma, repetition of games and the reciprocal use of the ``tit-for-tat'' strategy promote the possibility of cooperation. However, in cases of N-person prisoners' dilemma where N is greater than 2, the logic does not work effectively. The most essential problem is so called ``sanctioning problems''. In this paper, firstly, I discuss the ``sanctioning problems'' which were introduced by Axelrod and Keohane in 1986. Based on the model formalized by Axelrod, I propose a new model, in which I added a mechanism of players' payoff changes in the Axelrod's model. I call this mechanism norm-internalization and call our model ``norm-internalization game''. Second, by using the model, I investigated the relationship between agents' norm-internalization (payoff-alternation) and the possibilities of cooperation. The results of computer simulation indicated that unequal distribution of cooperating norm and uniform distribution of sanctioning norm are more effective in establishing cooperation. I discuss the mathematical features and the implications of the results on social science.

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

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

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

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

    Science.gov (United States)

    Bertamini, Marco; Wagemans, Johan

    2013-04-01

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

  6. Measures of symmetry for convex sets and stability

    CERN Document Server

    Toth, Gabor

    2015-01-01

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

  7. Generalized vector calculus on convex domain

    Science.gov (United States)

    Agrawal, Om P.; Xu, Yufeng

    2015-06-01

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

  8. Sparse signals recovered by non-convex penalty in quasi-linear systems.

    Science.gov (United States)

    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.

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

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

    Science.gov (United States)

    Briec, Walter; Horvath, Charles

    2008-05-01

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

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

    Science.gov (United States)

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

    2012-05-08

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

  12. Convex Hull Abstraction in Specialisation of CLP Programs

    DEFF Research Database (Denmark)

    Peralta, J.C.; Gallagher, John Patrick

    2003-01-01

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

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

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

  15. Solving ptychography with a convex relaxation

    Science.gov (United States)

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

    2015-05-01

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

  16. Uniform magnetic fields in density-functional theory

    Science.gov (United States)

    Tellgren, Erik I.; Laestadius, Andre; Helgaker, Trygve; Kvaal, Simen; Teale, Andrew M.

    2018-01-01

    We construct a density-functional formalism adapted to uniform external magnetic fields that is intermediate between conventional density functional theory and Current-Density Functional Theory (CDFT). In the intermediate theory, which we term linear vector potential-DFT (LDFT), the basic variables are the density, the canonical momentum, and the paramagnetic contribution to the magnetic moment. Both a constrained-search formulation and a convex formulation in terms of Legendre-Fenchel transformations are constructed. Many theoretical issues in CDFT find simplified analogs in LDFT. We prove results concerning N-representability, Hohenberg-Kohn-like mappings, existence of minimizers in the constrained-search expression, and a restricted analog to gauge invariance. The issue of additivity of the energy over non-interacting subsystems, which is qualitatively different in LDFT and CDFT, is also discussed.

  17. Convex Clustering: An Attractive Alternative to Hierarchical Clustering

    Science.gov (United States)

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

    2015-01-01

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

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

  19. Extending the Mertonian Norms: Scientists' Subscription to Norms of Research

    Science.gov (United States)

    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…

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

    Directory of Open Access Journals (Sweden)

    2006-01-01

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

  1. Social Norms: Do We Love Norms Too Much?

    Science.gov (United States)

    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.

  2. Some Characterizations of Convex Interval Games

    NARCIS (Netherlands)

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

    2008-01-01

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

  3. 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≤i1convexity, Schur multiplicative convexity and Schur harmonic convexity of ϕn(x,r are discussed. As applications, some inequalities are established by use of the theory of majorization.

  4. Designing Camera Networks by Convex Quadratic Programming

    KAUST Repository

    Ghanem, Bernard; Wonka, Peter; Cao, Yuanhao

    2015-01-01

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

  5. Quotient normed cones

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

  6. Manger hors norme, respecter les normes

    OpenAIRE

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

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

  8. Distribution functions of sections and projections of convex bodies

    OpenAIRE

    Kim, Jaegil; Yaskin, Vladyslav; Zvavitch, Artem

    2015-01-01

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

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

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

  11. Directional Convexity and Finite Optimality Conditions.

    Science.gov (United States)

    1984-03-01

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

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

    Science.gov (United States)

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

    2016-01-01

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

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

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

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

    NARCIS (Netherlands)

    Fourie, Zacharias; Ozcan, Mutlu; Sandham, John

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

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

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

  18. A One-Layer Recurrent Neural Network for Constrained Complex-Variable Convex Optimization.

    Science.gov (United States)

    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.

  19. Adherence to Traditionally Masculine Norms and Condom-Related Beliefs: Emphasis on African American and Hispanic Men.

    Science.gov (United States)

    Vincent, Wilson; Gordon, Derrick M; Campbell, Christina; Ward, Nadia L; Albritton, Tashuna; Kershaw, Trace

    2016-01-01

    Although studies have shown that adherence to traditional masculine norms (i.e., Status, Toughness, Antifemininity) affect men's attitudes toward sexual health, there is little research on how men's adherence to these norms affect them in the context of heterosexual, dyadic relationships. Among 296 young pregnant couples, we investigated the extent to which adherence to traditional masculine norms affected male and female partners' own condom-related beliefs (i.e., condom self-efficacy, positive condom attitudes) and that of their partners. We tested an interdependence model using a dyadic-analytic approach to path analysis. We also tested for differences across gender and race-ethnicity (i.e., African American, Hispanic). Results showed that adherence to the Antifemininity and Toughness masculine norms predicted negative condom-related beliefs, whereas, overall, adherence to the Status norm predicted positive condom-related beliefs. Men's and women's adherence to traditional norms about masculinity were associated with their partner's condom self-efficacy, and moderated associations based on gender and race-ethnicity were detected. In contrast, each dyad member's traditional masculine norms were not associated with his or her partner's positive condom attitudes. Taken together, findings indicated that the roles of traditional masculinity and condom-related beliefs in sexual health should be addressed within the context of relationships and associations between masculine norms and condom-related beliefs are not uniformly negative.

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

    CERN Document Server

    Spring, David

    1998-01-01

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

  1. Differential analysis of matrix convex functions

    DEFF Research Database (Denmark)

    Hansen, Frank; Tomiyama, Jun

    2007-01-01

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

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

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

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

    International Nuclear Information System (INIS)

    Phan Thanh An

    2008-06-01

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

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

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

  7. JPEG2000-coded image error concealment exploiting convex sets projections.

    Science.gov (United States)

    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.

  8. Improved radiological/nuclear source localization in variable NORM background: An MLEM approach with segmentation data

    Energy Technology Data Exchange (ETDEWEB)

    Penny, Robert D., E-mail: robert.d.penny@leidos.com [Leidos Inc., 10260 Campus Point Road, San Diego, CA (United States); Crowley, Tanya M.; Gardner, Barbara M.; Mandell, Myron J.; Guo, Yanlin; Haas, Eric B.; Knize, Duane J.; Kuharski, Robert A.; Ranta, Dale; Shyffer, Ryan [Leidos Inc., 10260 Campus Point Road, San Diego, CA (United States); Labov, Simon; Nelson, Karl; Seilhan, Brandon [Lawrence Livermore National Laboratory, Livermore, CA (United States); Valentine, John D. [Lawrence Berkeley National Laboratory, Berkeley, CA (United States)

    2015-06-01

    A novel approach and algorithm have been developed to rapidly detect and localize both moving and static radiological/nuclear (R/N) sources from an airborne platform. Current aerial systems with radiological sensors are limited in their ability to compensate for variable naturally occurring radioactive material (NORM) background. The proposed approach suppresses the effects of NORM background by incorporating additional information to segment the survey area into regions over which the background is likely to be uniform. The method produces pixelated Source Activity Maps (SAMs) of both target and background radionuclide activity over the survey area. The task of producing the SAMs requires (1) the development of a forward model which describes the transformation of radionuclide activity to detector measurements and (2) the solution of the associated inverse problem. The inverse problem is ill-posed as there are typically fewer measurements than unknowns. In addition the measurements are subject to Poisson statistical noise. The Maximum-Likelihood Expectation-Maximization (MLEM) algorithm is used to solve the inverse problem as it is well suited for under-determined problems corrupted by Poisson noise. A priori terrain information is incorporated to segment the reconstruction space into regions within which we constrain NORM background activity to be uniform. Descriptions of the algorithm and examples of performance with and without segmentation on simulated data are presented.

  9. A generalization of the convex Kakeya problem

    KAUST Repository

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

    2012-01-01

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

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

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

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

    NARCIS (Netherlands)

    de Klerk, E.; Laurent, M.

    2011-01-01

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

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

  14. Learning Convex Inference of Marginals

    OpenAIRE

    Domke, Justin

    2012-01-01

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

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

  16. Norm-Aware Socio-Technical Systems

    Science.gov (United States)

    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

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

  18. On the complexity of a combined homotopy interior method for convex programming

    Science.gov (United States)

    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.

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

  20. Polynomial approximation on polytopes

    CERN Document Server

    Totik, Vilmos

    2014-01-01

    Polynomial approximation on convex polytopes in \\mathbf{R}^d is considered in uniform and L^p-norms. For an appropriate modulus of smoothness matching direct and converse estimates are proven. In the L^p-case so called strong direct and converse results are also verified. The equivalence of the moduli of smoothness with an appropriate K-functional follows as a consequence. The results solve a problem that was left open since the mid 1980s when some of the present findings were established for special, so-called simple polytopes.

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

  2. Measurement system for diffraction efficiency of convex gratings

    Science.gov (United States)

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

    2017-08-01

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

  3. Contests versus Norms: Implications of Contest-Based and Norm-Based Intervention Techniques.

    Science.gov (United States)

    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.

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

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

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

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

  8. A generalization of the convex Kakeya problem

    KAUST Repository

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

    2013-01-01

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

  9. Localized Multiple Kernel Learning A Convex Approach

    Science.gov (United States)

    2016-11-22

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

  10. Convex nonnegative matrix factorization with manifold regularization.

    Science.gov (United States)

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

    2015-03-01

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

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

  12. Adaptation and perceptual norms

    Science.gov (United States)

    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.

  13. Headache as a crucial symptom in the etiology of convexal subarachnoid hemorrhage.

    Science.gov (United States)

    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.

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

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

    KAUST Repository

    Gurses, Ercan

    2011-06-01

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

  16. Convergence theorems for a class of nonlinear maps in uniformly smooth Banach spaces

    International Nuclear Information System (INIS)

    Chidume, C.E.; Osilike, M.O.

    1992-05-01

    Let K be a nonempty closed and convex subset of a real uniformly smooth Banach space, E, with modulus of smoothness of power type q>1. Let T be a mapping of K into itself, T is an element of C (in the notion of Browder and Petryshyn; and Rhoades). It is proved that the Mann iteration process, under suitable conditions, converges strongly to the unique fixed point of T. If K is also bounded, then the Ishikawa iteration process converges to the fixed point of T. While our theorems generalize important known results, our method is also of independent interest. (author). 14 refs

  17. Uniform product formulae with application to the Feynman-Nelson integral for open systems

    International Nuclear Information System (INIS)

    Exner, P.; Kolerov, G.I.

    1982-01-01

    The product formula for perturbations of propagators by Faris is generalized: we show that one can use arbitrary partitions of a given interval and perform the limit uniformly with respect to the partition norm. The results are applied to express solutions of the Schroedinger equation, in particular for some complex and time-dependent potentials, by means of Nelson-type path integrals. (orig.)

  18. Norms as Group-Level Constructs: Investigating School-Level Teen Pregnancy Norms and Behaviors.

    Science.gov (United States)

    Mollborn, Stefanie; Domingue, Benjamin W; Boardman, Jason D

    2014-09-01

    Social norms are a group-level phenomenon, but past quantitative research has rarely measured them in the aggregate or considered their group-level properties. We used the school-based design of the National Longitudinal Study of Adolescent Health to measure normative climates regarding teen pregnancy across 75 U.S. high schools. We distinguished between the strength of a school's norm against teen pregnancy and the consensus around that norm. School-level norm strength and dissensus were strongly (r = -0.65) and moderately (r = 0.34) associated with pregnancy prevalence within schools, respectively. Normative climate partially accounted for observed racial differences in school pregnancy prevalence, but norms were a stronger predictor than racial composition. As hypothesized, schools with both a stronger average norm against teen pregnancy and greater consensus around the norm had the lowest pregnancy prevalence. Results highlight the importance of group-level normative processes and of considering the local school environment when designing policies to reduce teen pregnancy.

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

  20. Cohesive granular media modelization with non-convex particles shape: Application to UO2 powder compaction

    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

  1. The spectral positioning algorithm of new spectrum vehicle based on convex programming in wireless sensor network

    Science.gov (United States)

    Zhang, Yongjun; Lu, Zhixin

    2017-10-01

    Spectrum resources are very precious, so it is increasingly important to locate interference signals rapidly. Convex programming algorithms in wireless sensor networks are often used as localization algorithms. But in view of the traditional convex programming algorithm is too much overlap of wireless sensor nodes that bring low positioning accuracy, the paper proposed a new algorithm. Which is mainly based on the traditional convex programming algorithm, the spectrum car sends unmanned aerial vehicles (uses) that can be used to record data periodically along different trajectories. According to the probability density distribution, the positioning area is segmented to further reduce the location area. Because the algorithm only increases the communication process of the power value of the unknown node and the sensor node, the advantages of the convex programming algorithm are basically preserved to realize the simple and real-time performance. The experimental results show that the improved algorithm has a better positioning accuracy than the original convex programming algorithm.

  2. Finite dimensional convexity and optimization

    CERN Document Server

    Florenzano, Monique

    2001-01-01

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

  3. Robust Utility Maximization Under Convex Portfolio Constraints

    International Nuclear Information System (INIS)

    Matoussi, Anis; Mezghani, Hanen; Mnif, Mohamed

    2015-01-01

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

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

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

    KAUST Repository

    Li, Yiteng

    2017-04-09

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

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

  7. A Convex Optimization Model and Algorithm for Retinex

    Directory of Open Access Journals (Sweden)

    Qing-Nan Zhao

    2017-01-01

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

  8. On the convexity of relativistic hydrodynamics

    International Nuclear Information System (INIS)

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

    2013-01-01

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

  9. Overview of NORM and activities by a NORM licensed permanent decontamination and waste processing facility

    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.

  10. Probabilistic uniformities of uniform spaces

    Energy Technology Data Exchange (ETDEWEB)

    Rodriguez Lopez, J.; Romaguera, S.; Sanchis, M.

    2017-07-01

    The theory of metric spaces in the fuzzy context has shown to be an interesting area of study not only from a theoretical point of view but also for its applications. Nevertheless, it is usual to consider these spaces as classical topological or uniform spaces and there are not too many results about constructing fuzzy topological structures starting from a fuzzy metric. Maybe, H/{sup o}hle was the first to show how to construct a probabilistic uniformity and a Lowen uniformity from a probabilistic pseudometric /cite{Hohle78,Hohle82a}. His method can be directly translated to the context of fuzzy metrics and allows to characterize the categories of probabilistic uniform spaces or Lowen uniform spaces by means of certain families of fuzzy pseudometrics /cite{RL}. On the other hand, other different fuzzy uniformities can be constructed in a fuzzy metric space: a Hutton $[0,1]$-quasi-uniformity /cite{GGPV06}; a fuzzifiying uniformity /cite{YueShi10}, etc. The paper /cite{GGRLRo} gives a study of several methods of endowing a fuzzy pseudometric space with a probabilistic uniformity and a Hutton $[0,1]$-quasi-uniformity. In 2010, J. Guti/'errez Garc/'{/i}a, S. Romaguera and M. Sanchis /cite{GGRoSanchis10} proved that the category of uniform spaces is isomorphic to a category formed by sets endowed with a fuzzy uniform structure, i. e. a family of fuzzy pseudometrics satisfying certain conditions. We will show here that, by means of this isomorphism, we can obtain several methods to endow a uniform space with a probabilistic uniformity. Furthermore, these constructions allow to obtain a factorization of some functors introduced in /cite{GGRoSanchis10}. (Author)

  11. Picard iterations for nonlinear Lipschitz strong pseudo-contractions in uniformly smooth Banach spaces

    International Nuclear Information System (INIS)

    Chidume, C.E.

    1995-06-01

    Suppose E is a real uniformly smooth Banach space and K is a nonempty closed convex and bounded subset of E, T:K → K is a Lipschitz pseudo-contraction. It is proved that the Picard iterates of a suitably defined operator converges strongly to the unique fixed point of T. Furthermore, this result also holds for the slightly larger class of Lipschitz strong hemi-contractions. Related results deal with strong convergence of the Picard iterates to the unique solution of operator equations involving Lipschitz strongly accretive maps. Apart from establishing strong convergence, our theorems give existence, uniqueness and convergence-rate which is at least as fast as a geometric progression. (author). 51 refs

  12. Convex polyhedral abstractions, specialisation and property-based predicate splitting in Horn clause verification

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

  13. Efficiency measurement with a non-convex free disposal hull technology

    DEFF Research Database (Denmark)

    Fukuyama, Hirofumi; Hougaard, Jens Leth; Sekitani, Kazuyuki

    2016-01-01

    We investigate the basic monotonicity properties of least-distance (in)efficiency measures on the class of non-convex FDH (free disposable hull) technologies. We show that any known FDH least-distance measure violates strong monotonicity over the strongly (Pareto-Koopmans) efficient frontier. Tak....... Taking this result into account, we develop a new class of FDH least-distance measures that satisfy strong monotonicity and show that the developed (in)efficiency measurement framework has a natural profit interpretation.......We investigate the basic monotonicity properties of least-distance (in)efficiency measures on the class of non-convex FDH (free disposable hull) technologies. We show that any known FDH least-distance measure violates strong monotonicity over the strongly (Pareto-Koopmans) efficient frontier...

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

  15. Towards reproducible experimental studies for non-convex polyhedral shaped particles

    Directory of Open Access Journals (Sweden)

    Wilke Daniel N.

    2017-01-01

    Full Text Available The packing density and flat bottomed hopper discharge of non-convex polyhedral particles are investigated in a systematic experimental study. The motivation for this study is two-fold. Firstly, to establish an approach to deliver quality experimental particle packing data for non-convex polyhedral particles that can be used for characterization and validation purposes of discrete element codes. Secondly, to make the reproducibility of experimental setups as convenient and readily available as possible using affordable and accessible technology. The primary technology for this study is fused deposition modeling used to 3D print polylactic acid (PLA particles using readily available 3D printer technology. A total of 8000 biodegradable particles were printed, 1000 white particles and 1000 black particles for each of the four particle types considered in this study. Reproducibility is one benefit of using fused deposition modeling to print particles, but an extremely important additional benefit is that specific particle properties can be explicitly controlled. As an example in this study the volume fraction of each particle can be controlled i.e. the effective particle density can be adjusted. In this study the particle volumes reduces drastically as the non-convexity is increased, however all printed white particles in this study have the same mass within 2% of each other.

  16. Towards reproducible experimental studies for non-convex polyhedral shaped particles

    Science.gov (United States)

    Wilke, Daniel N.; Pizette, Patrick; Govender, Nicolin; Abriak, Nor-Edine

    2017-06-01

    The packing density and flat bottomed hopper discharge of non-convex polyhedral particles are investigated in a systematic experimental study. The motivation for this study is two-fold. Firstly, to establish an approach to deliver quality experimental particle packing data for non-convex polyhedral particles that can be used for characterization and validation purposes of discrete element codes. Secondly, to make the reproducibility of experimental setups as convenient and readily available as possible using affordable and accessible technology. The primary technology for this study is fused deposition modeling used to 3D print polylactic acid (PLA) particles using readily available 3D printer technology. A total of 8000 biodegradable particles were printed, 1000 white particles and 1000 black particles for each of the four particle types considered in this study. Reproducibility is one benefit of using fused deposition modeling to print particles, but an extremely important additional benefit is that specific particle properties can be explicitly controlled. As an example in this study the volume fraction of each particle can be controlled i.e. the effective particle density can be adjusted. In this study the particle volumes reduces drastically as the non-convexity is increased, however all printed white particles in this study have the same mass within 2% of each other.

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

  18. A duality recipe for non-convex variational problems

    Science.gov (United States)

    Bouchitté, Guy; Phan, Minh

    2018-03-01

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

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

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

    NARCIS (Netherlands)

    Guo, Peng; Cao, Jiannong; Zhang, Kui

    2015-01-01

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

  1. On the convex closed set-valued operators in Banach spaces and their applications in control problems

    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

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

  3. A new corrective technique for adolescent idiopathic scoliosis (Ucar′s convex rod rotation

    Directory of Open Access Journals (Sweden)

    Bekir Yavuz Ucar

    2014-01-01

    Full Text Available Study Design: Prospective single-center study. Objective: To analyze the efficacy and safety of a new technique of global vertebral correction with convex rod rotation performed on the patients with adolescent idiopathic scoliosis. Summary of Background Data: Surgical goal is to obtain an optimal curve correction in scoliosis surgery. There are various correction techniques. This report describes a new technique of global vertebral correction with convex rod rotation. Materials and Methods: A total of 12 consecutive patients with Lenke type I adolescent idiopathic scoliosis and managed by convex rod rotation technique between years 2012 and 2013 having more than 1 year follow-up were included. Mean age was 14.5 (range = 13-17 years years at the time of operation. The hospital charts were reviewed for demographic data. Measurements of curve magnitude and balance were made on 36-inch standing anteroposterior and lateral radiographs taken before surgery and at most recent follow up to assess deformity correction, spinal balance, and complications related to the instrumentation. Results: Preoperative coronal plane major curve of 62° (range = 50°-72° with flexibility of less than 30% was corrected to 11.5°(range = 10°-14° showing a 81% scoliosis correction at the final follow-up. Coronal imbalance was improved 72% at the most recent follow-up assessment. No complications were found. Conclusion: The new technique of global vertebral correction with Ucar′s convex rod rotation is an effective technique. This method is a vertebral rotation procedure from convex side and it allows to put screws easily to the concave side.

  4. A note on supercyclic operators in locally convex spaces

    OpenAIRE

    Albanese, Angela A.; Jornet, David

    2018-01-01

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

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

  6. Anomalous dynamics triggered by a non-convex equation of state in relativistic flows

    Science.gov (United States)

    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.

  7. Generalization of the fejer-hadamard type inequalities for p-convex functions via k-fractional integrals

    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.

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

  9. Cephalometric norms and esthetic profile preference for the Japanese: a systematic review.

    Science.gov (United States)

    Bronfman, Caroline Nemetz; Janson, Guilherme; Pinzan, Arnaldo; Rocha, Thais Lima

    2015-01-01

    To determine the cephalometric parameters and esthetic preferences of a pleasant face for the Japanese population. For the present study, the following databases were accessed: PubMed, Embase, Scopus and Web of Science. Initial inclusion criteria comprised studies written in English and quoting cephalometric norms and/or facial attractiveness in Japanese adults. No time period of publication was determined. The quality features evaluated were sample description, variables analyzed and how cephalometric standards or facial profile were evaluated. Initially, 60 articles were retrieved. From the selected studies, 13 abstracts met the initial inclusion criteria. They were divided into two groups; seven articles were included in Group I and six articles in Group II, according to the criteria of evaluation: cephalometric or facial analyses. Japanese are characterized by having a less convex skeletal profile, bilabial protrusion, less prominent nose, more retruded chin and protruded mandibular incisor. Despite living in a society with homogeneous patterns, they seem to get an esthetic preference for white-like features. Therefore, in addition to ethnic normative values, patient's preferences to establish individual treatment plans should always be considered.

  10. The integration of DVH-based planning aspects into a convex intensity modulated radiation therapy optimization framework

    International Nuclear Information System (INIS)

    Kratt, Karin; Scherrer, Alexander

    2009-01-01

    The formulation of intensity modulated radiation therapy (IMRT) planning aspects frequently uses the dose-volume histogram (DVH), whereas plan computations often happen in the more desirable convex IMRT optimization framework. Inspired by a recent publication of Zinchenko et al (2008 Phys. Med. Biol. 53 3231-50), this work addresses the integration of DVH-based planning aspects into this framework from a general point of view. It first provides the basic mathematical requirements on the evaluation functions in order to support such an incorporation. Then it introduces the condition number as a description for how precisely DVH-based planning aspects can be reformulated in terms of evaluation functions. Exemplary numerical studies for the generalized equivalent uniform dose and a physical constraint function show the influence of function parameter values and DVH approximation on the condition number. The work concludes by formulating the aspects that should be taken into account for an appropriate integration of DVH-based planning aspects. (note)

  11. The integration of DVH-based planning aspects into a convex intensity modulated radiation therapy optimization framework

    Energy Technology Data Exchange (ETDEWEB)

    Kratt, Karin [Faculty of Mathematics, Technical University of Kaiserslautern, Kaiserslautern (Germany); Scherrer, Alexander [Department of Optimization, Fraunhofer Institute for Industrial Mathematics (ITWM), Kaiserslautern (Germany)], E-mail: alexander.scherrer@itwm.fraunhofer.de

    2009-06-21

    The formulation of intensity modulated radiation therapy (IMRT) planning aspects frequently uses the dose-volume histogram (DVH), whereas plan computations often happen in the more desirable convex IMRT optimization framework. Inspired by a recent publication of Zinchenko et al (2008 Phys. Med. Biol. 53 3231-50), this work addresses the integration of DVH-based planning aspects into this framework from a general point of view. It first provides the basic mathematical requirements on the evaluation functions in order to support such an incorporation. Then it introduces the condition number as a description for how precisely DVH-based planning aspects can be reformulated in terms of evaluation functions. Exemplary numerical studies for the generalized equivalent uniform dose and a physical constraint function show the influence of function parameter values and DVH approximation on the condition number. The work concludes by formulating the aspects that should be taken into account for an appropriate integration of DVH-based planning aspects. (note)

  12. WE-AB-209-07: Explicit and Convex Optimization of Plan Quality Metrics in Intensity-Modulated Radiation Therapy Treatment Planning

    International Nuclear Information System (INIS)

    Engberg, L; Eriksson, K; Hardemark, B; Forsgren, A

    2016-01-01

    Purpose: To formulate objective functions of a multicriteria fluence map optimization model that correlate well with plan quality metrics, and to solve this multicriteria model by convex approximation. Methods: In this study, objectives of a multicriteria model are formulated to explicitly either minimize or maximize a dose-at-volume measure. Given the widespread agreement that dose-at-volume levels play important roles in plan quality assessment, these objectives correlate well with plan quality metrics. This is in contrast to the conventional objectives, which are to maximize clinical goal achievement by relating to deviations from given dose-at-volume thresholds: while balancing the new objectives means explicitly balancing dose-at-volume levels, balancing the conventional objectives effectively means balancing deviations. Constituted by the inherently non-convex dose-at-volume measure, the new objectives are approximated by the convex mean-tail-dose measure (CVaR measure), yielding a convex approximation of the multicriteria model. Results: Advantages of using the convex approximation are investigated through juxtaposition with the conventional objectives in a computational study of two patient cases. Clinical goals of each case respectively point out three ROI dose-at-volume measures to be considered for plan quality assessment. This is translated in the convex approximation into minimizing three mean-tail-dose measures. Evaluations of the three ROI dose-at-volume measures on Pareto optimal plans are used to represent plan quality of the Pareto sets. Besides providing increased accuracy in terms of feasibility of solutions, the convex approximation generates Pareto sets with overall improved plan quality. In one case, the Pareto set generated by the convex approximation entirely dominates that generated with the conventional objectives. Conclusion: The initial computational study indicates that the convex approximation outperforms the conventional objectives

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

  14. The personal norm of reciprocity

    NARCIS (Netherlands)

    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

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

    NARCIS (Netherlands)

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

    2001-01-01

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

  16. Sequential Change-Point Detection via Online Convex Optimization

    Directory of Open Access Journals (Sweden)

    Yang Cao

    2018-02-01

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

  17. Calculating and controlling the error of discrete representations of Pareto surfaces in convex multi-criteria optimization.

    Science.gov (United States)

    Craft, David

    2010-10-01

    A discrete set of points and their convex combinations can serve as a sparse representation of the Pareto surface in multiple objective convex optimization. We develop a method to evaluate the quality of such a representation, and show by example that in multiple objective radiotherapy planning, the number of Pareto optimal solutions needed to represent Pareto surfaces of up to five dimensions grows at most linearly with the number of objectives. The method described is also applicable to the representation of convex sets. Copyright © 2009 Associazione Italiana di Fisica Medica. Published by Elsevier Ltd. All rights reserved.

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

    Directory of Open Access Journals (Sweden)

    Valentino Magnani

    2012-12-01

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

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

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

  1. Convex and Radially Concave Contoured Distributions

    Directory of Open Access Journals (Sweden)

    Wolf-Dieter Richter

    2015-01-01

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

  2. Dutch taboo norms.

    Science.gov (United States)

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

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

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

    Science.gov (United States)

    Lakhtakia, Akhlesh

    1993-11-01

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

  5. Perturbation of convex risk minimization and its application in differential private learning algorithms

    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.

  6. License or entry decision for innovator in international duopoly with convex cost functions

    OpenAIRE

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

  7. What's in a norm? Sources and processes of norm change.

    Science.gov (United States)

    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.

  8. The steady-state of the (Normalized) LMS is schur convex

    KAUST Repository

    Al-Hujaili, Khaled A.

    2016-06-24

    In this work, we demonstrate how the theory of majorization and schur-convexity can be used to assess the impact of input-spread on the Mean Squares Error (MSE) performance of adaptive filters. First, we show that the concept of majorization can be utilized to measure the spread in input-regressors and subsequently order the input-regressors according to their spread. Second, we prove that the MSE of the Least Mean Squares Error (LMS) and Normalized LMS (NLMS) algorithms are schur-convex, that is, the MSE of the LMS and the NLMS algorithms preserve the majorization order of the inputs which provide an analytical justification to why and how much the MSE performance of the LMS and the NLMS algorithms deteriorate as the spread in input increases. © 2016 IEEE.

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

    Science.gov (United States)

    Rajesh, R; Dhar, Deepak

    2005-01-01

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

  10. The steady-state of the (Normalized) LMS is schur convex

    KAUST Repository

    Al-Hujaili, Khaled A.; Al-Naffouri, Tareq Y.; Moinuddin, Muhammad

    2016-01-01

    In this work, we demonstrate how the theory of majorization and schur-convexity can be used to assess the impact of input-spread on the Mean Squares Error (MSE) performance of adaptive filters. First, we show that the concept of majorization can be utilized to measure the spread in input-regressors and subsequently order the input-regressors according to their spread. Second, we prove that the MSE of the Least Mean Squares Error (LMS) and Normalized LMS (NLMS) algorithms are schur-convex, that is, the MSE of the LMS and the NLMS algorithms preserve the majorization order of the inputs which provide an analytical justification to why and how much the MSE performance of the LMS and the NLMS algorithms deteriorate as the spread in input increases. © 2016 IEEE.

  11. How norm violations shape social hierarchies : Those who stand on top block norm violators from rising up

    NARCIS (Netherlands)

    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

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

  13. Reconstruction of Undersampled Big Dynamic MRI Data Using Non-Convex Low-Rank and Sparsity Constraints

    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.

  14. A class of discontinuous Petrov-Galerkin methods. Part IV: The optimal test norm and time-harmonic wave propagation in 1D

    KAUST Repository

    Zitelli, J.; Muga, Ignacio; Demkowicz, Leszek F.; Gopalakrishnan, Jayadeep; Pardo, David; Calo, Victor M.

    2011-01-01

    The phase error, or the pollution effect in the finite element solution of wave propagation problems, is a well known phenomenon that must be confronted when solving problems in the high-frequency range. This paper presents a new method with no phase errors for one-dimensional (1D) time-harmonic wave propagation problems using new ideas that hold promise for the multidimensional case. The method is constructed within the framework of the discontinuous Petrov-Galerkin (DPG) method with optimal test functions. We have previously shown that such methods select solutions that are the best possible approximations in an energy norm dual to any selected test space norm. In this paper, we advance by asking what is the optimal test space norm that achieves error reduction in a given energy norm. This is answered in the specific case of the Helmholtz equation with L2-norm as the energy norm. We obtain uniform stability with respect to the wave number. We illustrate the method with a number of 1D numerical experiments, using discontinuous piecewise polynomial hp spaces for the trial space and its corresponding optimal test functions computed approximately and locally. A 1D theoretical stability analysis is also developed. © 2010 Elsevier Inc.

  15. A class of discontinuous Petrov-Galerkin methods. Part IV: The optimal test norm and time-harmonic wave propagation in 1D

    KAUST Repository

    Zitelli, J.

    2011-04-01

    The phase error, or the pollution effect in the finite element solution of wave propagation problems, is a well known phenomenon that must be confronted when solving problems in the high-frequency range. This paper presents a new method with no phase errors for one-dimensional (1D) time-harmonic wave propagation problems using new ideas that hold promise for the multidimensional case. The method is constructed within the framework of the discontinuous Petrov-Galerkin (DPG) method with optimal test functions. We have previously shown that such methods select solutions that are the best possible approximations in an energy norm dual to any selected test space norm. In this paper, we advance by asking what is the optimal test space norm that achieves error reduction in a given energy norm. This is answered in the specific case of the Helmholtz equation with L2-norm as the energy norm. We obtain uniform stability with respect to the wave number. We illustrate the method with a number of 1D numerical experiments, using discontinuous piecewise polynomial hp spaces for the trial space and its corresponding optimal test functions computed approximately and locally. A 1D theoretical stability analysis is also developed. © 2010 Elsevier Inc.

  16. Changing Collective Social Norms in Favour of Reduced Harmful Use of Alcohol: A Review of Reviews.

    Science.gov (United States)

    Anderson, Peter; Jané-Llopis, Eva; Hasan, Omer Syed Muhammad; Rehm, Jürgen

    2018-05-01

    Public sector bodies have called for policies and programmes to shift collective social norms in disfavour of the harmful use of alcohol. This article aims to identify and summarize the evidence and propose how policies and programmes to shift social norms could be implemented and evaluated. Review of reviews for all years to July 2017. Searches on OVID Medline, Healthstar, Embase, PsycINFO, AMED, Social Work Abstracts, CAB Abstracts, Mental Measurements Yearbook, Joanna Briggs Institute EBP, Health and Psychosocial Instruments, International Pharmaceutical Abstracts, International Political Science Abstracts, NASW Clinical Register and Epub Ahead of Print databases. All reviews, without language or date restrictions resulting from combining the terms ((review or literature review or review literature or data pooling or comparative study or systematic review or meta-analysis or pooled analysis) and (social norms or culture) and (alcohol drinking)). Two relevant reviews were identified. One review of community-based interventions found one study that demonstrated small changes in parental disapproval of under-age drinking. One review stressed that collective social norms about drinking are malleable and not uniform in any one country. Three factors are proposed to inform programmes: provide information about the consequences of the harmful use of alcohol, and their causes and distribution; act on groups, not individuals; and strengthen environmental laws, regulations and approaches. Purposeful policies and programmes could be implemented to change collective social norms in disfavour of the harmful use of alcohol; they should be evidence-based and fully evaluated for their impact.

  17. From physical dose constraints to equivalent uniform dose constraints in inverse radiotherapy planning

    International Nuclear Information System (INIS)

    Thieke, Christian; Bortfeld, Thomas; Niemierko, Andrzej; Nill, Simeon

    2003-01-01

    Optimization algorithms in inverse radiotherapy planning need information about the desired dose distribution. Usually the planner defines physical dose constraints for each structure of the treatment plan, either in form of minimum and maximum doses or as dose-volume constraints. The concept of equivalent uniform dose (EUD) was designed to describe dose distributions with a higher clinical relevance. In this paper, we present a method to consider the EUD as an optimization constraint by using the method of projections onto convex sets (POCS). In each iteration of the optimization loop, for the actual dose distribution of an organ that violates an EUD constraint a new dose distribution is calculated that satisfies the EUD constraint, leading to voxel-based physical dose constraints. The new dose distribution is found by projecting the current one onto the convex set of all dose distributions fulfilling the EUD constraint. The algorithm is easy to integrate into existing inverse planning systems, and it allows the planner to choose between physical and EUD constraints separately for each structure. A clinical case of a head and neck tumor is optimized using three different sets of constraints: physical constraints for all structures, physical constraints for the target and EUD constraints for the organs at risk, and EUD constraints for all structures. The results show that the POCS method converges stable and given EUD constraints are reached closely

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

  19. A New Interpolation Approach for Linearly Constrained Convex Optimization

    KAUST Repository

    Espinoza, Francisco

    2012-08-01

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

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

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

  2. Electron-pair logarithmic convexity and interelectronic moments in atoms: Application to heliumlike ions

    International Nuclear Information System (INIS)

    Koga, T.; Kasai, Y.; Dehesa, J.S.; Angulo, J.C.

    1993-01-01

    The electron-pair function h(u) of a finite many-electron system is not monotonic, but the related quantity h(u)/u α , α>0, is not only monotonically decreasing from the origin but also convex for the values α 1 and α 2 , respectively, as has been recently found. Here, it is first argued that this quantity is also logarithmically convex for any α≥α' with α'=max{-u 2 d2[lnh(u)]/du 2 }. Then this property is used to obtain a general inequality which involves three interelectronic moments left-angle u t right-angle. Particular cases of this inequality involve relevant characteristics of the system such as the number of electrons and the total electron-electron repulsion energy. Second, the logarithmic-convexity property of h(u) as well as the accuracy of this inequality are investigated by the optimum 20-term Hylleraas-type wave functions for two-electron atoms with nuclear charge Z=1, 2, 3, 5, and 10. It is found that (i) 14 2 much-gt α 1 ) and (ii) the accuracy of the inequality which involves moments of contiguous orders oscillates between 62.4% and 96.7% according to the specific He-like atom and the moments involved. Finally, the importance of the logarithmic-convexity effects on the interelectronic moments relative to those coming from other monotonicity properties of h(u)/u α are analyzed in the same numerical Hylleraas framework

  3. Children are sensitive to norms of giving.

    Science.gov (United States)

    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.

  4. Chance-Constrained Guidance With Non-Convex Constraints

    Science.gov (United States)

    Ono, Masahiro

    2011-01-01

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

  5. Dynamic Convex Duality in Constrained Utility Maximization

    OpenAIRE

    Li, Yusong; Zheng, Harry

    2016-01-01

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

  6. Convexity Conditions and the Legendre-Fenchel Transform for the Product of Finitely Many Positive Definite Quadratic Forms

    International Nuclear Information System (INIS)

    Zhao Yunbin

    2010-01-01

    While the product of finitely many convex functions has been investigated in the field of global optimization, some fundamental issues such as the convexity condition and the Legendre-Fenchel transform for the product function remain unresolved. Focusing on quadratic forms, this paper is aimed at addressing the question: When is the product of finitely many positive definite quadratic forms convex, and what is the Legendre-Fenchel transform for it? First, we show that the convexity of the product is determined intrinsically by the condition number of so-called 'scaled matrices' associated with quadratic forms involved. The main result claims that if the condition number of these scaled matrices are bounded above by an explicit constant (which depends only on the number of quadratic forms involved), then the product function is convex. Second, we prove that the Legendre-Fenchel transform for the product of positive definite quadratic forms can be expressed, and the computation of the transform amounts to finding the solution to a system of equations (or equally, finding a Brouwer's fixed point of a mapping) with a special structure. Thus, a broader question than the open 'Question 11' in Hiriart-Urruty (SIAM Rev. 49, 225-273, 2007) is addressed in this paper.

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

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

    KAUST Repository

    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

  9. Social norms and prejudice against homosexuals.

    Science.gov (United States)

    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.

  10. The dominance of norm

    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

  11. Moduli spaces of convex projective structures on surfaces

    DEFF Research Database (Denmark)

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

    2007-01-01

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

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

    NARCIS (Netherlands)

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

    2015-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Daniel Alpay

    2018-01-01

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

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

  15. Tensor norms and operator ideals

    CERN Document Server

    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

  16. Pluripotential theory and convex bodies

    Science.gov (United States)

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

    2018-03-01

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

  17. Constrained convex minimization via model-based excessive gap

    OpenAIRE

    Tran Dinh, Quoc; Cevher, Volkan

    2014-01-01

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

  18. All-Norm Approximation Algorithms

    NARCIS (Netherlands)

    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

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

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

  1. Globally convergent optimization algorithm using conservative convex separable diagonal quadratic approximations

    NARCIS (Netherlands)

    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

  2. Modeling IrisCode and its variants as convex polyhedral cones and its security implications.

    Science.gov (United States)

    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.

  3. Derivative-free generation and interpolation of convex Pareto optimal IMRT plans

    Science.gov (United States)

    Hoffmann, Aswin L.; Siem, Alex Y. D.; den Hertog, Dick; Kaanders, Johannes H. A. M.; Huizenga, Henk

    2006-12-01

    In inverse treatment planning for intensity-modulated radiation therapy (IMRT), beamlet intensity levels in fluence maps of high-energy photon beams are optimized. Treatment plan evaluation criteria are used as objective functions to steer the optimization process. Fluence map optimization can be considered a multi-objective optimization problem, for which a set of Pareto optimal solutions exists: the Pareto efficient frontier (PEF). In this paper, a constrained optimization method is pursued to iteratively estimate the PEF up to some predefined error. We use the property that the PEF is convex for a convex optimization problem to construct piecewise-linear upper and lower bounds to approximate the PEF from a small initial set of Pareto optimal plans. A derivative-free Sandwich algorithm is presented in which these bounds are used with three strategies to determine the location of the next Pareto optimal solution such that the uncertainty in the estimated PEF is maximally reduced. We show that an intelligent initial solution for a new Pareto optimal plan can be obtained by interpolation of fluence maps from neighbouring Pareto optimal plans. The method has been applied to a simplified clinical test case using two convex objective functions to map the trade-off between tumour dose heterogeneity and critical organ sparing. All three strategies produce representative estimates of the PEF. The new algorithm is particularly suitable for dynamic generation of Pareto optimal plans in interactive treatment planning.

  4. Derivative-free generation and interpolation of convex Pareto optimal IMRT plans

    International Nuclear Information System (INIS)

    Hoffmann, Aswin L; Siem, Alex Y D; Hertog, Dick den; Kaanders, Johannes H A M; Huizenga, Henk

    2006-01-01

    In inverse treatment planning for intensity-modulated radiation therapy (IMRT), beamlet intensity levels in fluence maps of high-energy photon beams are optimized. Treatment plan evaluation criteria are used as objective functions to steer the optimization process. Fluence map optimization can be considered a multi-objective optimization problem, for which a set of Pareto optimal solutions exists: the Pareto efficient frontier (PEF). In this paper, a constrained optimization method is pursued to iteratively estimate the PEF up to some predefined error. We use the property that the PEF is convex for a convex optimization problem to construct piecewise-linear upper and lower bounds to approximate the PEF from a small initial set of Pareto optimal plans. A derivative-free Sandwich algorithm is presented in which these bounds are used with three strategies to determine the location of the next Pareto optimal solution such that the uncertainty in the estimated PEF is maximally reduced. We show that an intelligent initial solution for a new Pareto optimal plan can be obtained by interpolation of fluence maps from neighbouring Pareto optimal plans. The method has been applied to a simplified clinical test case using two convex objective functions to map the trade-off between tumour dose heterogeneity and critical organ sparing. All three strategies produce representative estimates of the PEF. The new algorithm is particularly suitable for dynamic generation of Pareto optimal plans in interactive treatment planning

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

    NARCIS (Netherlands)

    Driessen, Theo; Hou, D.

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

  6. Tensor completion and low-n-rank tensor recovery via convex optimization

    International Nuclear Information System (INIS)

    Gandy, Silvia; Yamada, Isao; Recht, Benjamin

    2011-01-01

    In this paper we consider sparsity on a tensor level, as given by the n-rank of a tensor. In an important sparse-vector approximation problem (compressed sensing) and the low-rank matrix recovery problem, using a convex relaxation technique proved to be a valuable solution strategy. Here, we will adapt these techniques to the tensor setting. We use the n-rank of a tensor as a sparsity measure and consider the low-n-rank tensor recovery problem, i.e. the problem of finding the tensor of the lowest n-rank that fulfills some linear constraints. We introduce a tractable convex relaxation of the n-rank and propose efficient algorithms to solve the low-n-rank tensor recovery problem numerically. The algorithms are based on the Douglas–Rachford splitting technique and its dual variant, the alternating direction method of multipliers

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

  8. NORM regulations

    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.

  9. Some Convex Functions Based Measures of Independence and Their Application to Strange Attractor Reconstruction

    Directory of Open Access Journals (Sweden)

    Kazuyuki Aihara

    2011-04-01

    Full Text Available The classical information-theoretic measures such as the entropy and the mutual information (MI are widely applicable to many areas in science and engineering. Csiszar generalized the entropy and the MI by using the convex functions. Recently, we proposed the grid occupancy (GO and the quasientropy (QE as measures of independence. The QE explicitly includes a convex function in its definition, while the expectation of GO is a subclass of QE. In this paper, we study the effect of different convex functions on GO, QE, and Csiszar’s generalized mutual information (GMI. A quality factor (QF is proposed to quantify the sharpness of their minima. Using the QF, it is shown that these measures can have sharper minima than the classical MI. Besides, a recursive algorithm for computing GMI, which is a generalization of Fraser and Swinney’s algorithm for computing MI, is proposed. Moreover, we apply GO, QE, and GMI to chaotic time series analysis. It is shown that these measures are good criteria for determining the optimum delay in strange attractor reconstruction.

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

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

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

    NARCIS (Netherlands)

    Musegaas, Marieke; Borm, Peter; Quant, Marieke

    2016-01-01

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

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

    NARCIS (Netherlands)

    Koren, B.; Bannink, W.J.

    1984-01-01

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

  14. The Evolution of Wikipedia’s Norm Network

    Directory of Open Access Journals (Sweden)

    Bradi Heaberlin

    2016-04-01

    Full Text Available Social norms have traditionally been difficult to quantify. In any particular society, their sheer number and complex interdependencies often limit a system-level analysis. One exception is that of the network of norms that sustain the online Wikipedia community. We study the fifteen-year evolution of this network using the interconnected set of pages that establish, describe, and interpret the community’s norms. Despite Wikipedia’s reputation for ad hoc governance, we find that its normative evolution is highly conservative. The earliest users create norms that both dominate the network and persist over time. These core norms govern both content and interpersonal interactions using abstract principles such as neutrality, verifiability, and assume good faith. As the network grows, norm neighborhoods decouple topologically from each other, while increasing in semantic coherence. Taken together, these results suggest that the evolution of Wikipedia’s norm network is akin to bureaucratic systems that predate the information age.

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

  16. Uniformly bounded representations of the Lorentz groups

    International Nuclear Information System (INIS)

    Brega, A.O.

    1982-01-01

    For the Lorentz group G = SO/sub e/(n + 1, 1)(ngreater than or equal to 2) the author constructs a family of uniformly bounded representations by means of analytically continuing a certain normalization of the unitary principal series. The method the author uses relies on an analysis of various operators under a Mellin transform and extends earlier work of E.N. Wilson. In a series of papers Kunze and Stein initiated the theory of uniformly bounded representations of semisimple Lie groups; the starting point is the unitary principal series T(sigma,s) obtained in a certain subgroup M of G and a purely imaginary number s. From there Kunze and Stein constructed families of representations R(sigma,s) depending analytically on a parameter s in a domain D of C containing the imaginary axis which are unitarily equilvalent to T(sigma,s) for s contained in the set of imaginary numbers and whose operator norms are uniformly bounded for each s in D. In the case of the Lorentz groups SO/sub e/(n + 1, 1)(ngreater than or equal to2) and the trivial representation 1 of M, E.N. Wilson obtained such a family R(1,s) for the domain D = [s contained in the set of C: absolute value Re(s) Vertical Bar2]. For this domain D and for any representation sigma of M the author provides a family R(sigma,s) of uniformly bounded representations analytically continuing T(sigma,s), thereby generalizing Wilson's work. The author has also investigated certain symmetry properties of the representations R(sigma,s) under the action of the Weyl group. The trivial representation is Weyl group invariant and the family R(1,s) obtained by Wilson satisfies R(1,s) = R(1,-s) reflecting this. Obtained was the analogous result R(sigma,s) = R(sigma,-s) for some well known representations sigma that are Weyl group invariant. This involves the explicit computation of certain constants arising in the Fourier transforms of intertwining operators

  17. Energizing and de-motivating effects of norm-conflict.

    Science.gov (United States)

    McDonald, Rachel I; Fielding, Kelly S; Louis, Winnifred R

    2013-01-01

    Norms have a pervasive influence on behavior, yet previous research has not addressed that people often face conflicting norms from multiple ingroups. The current research addresses this gap in the context of proenvironmental behavior and demonstrates two effects predicted by the novel theoretical position we offer: People can be de-motivated by norm-conflict, or conversely, norm-conflict can encourage people to take action. Studies 1 and 2 demonstrated that norm-conflict is associated with increased perceived effectiveness for those with positive attitudes to the issue and reduced perceived effectiveness for those with moderate attitudes, and effectiveness perceptions mediated an indirect effect on behavioral intentions. Study 3 found that perceived effectiveness also moderates the effects of norm-conflict such that norm-conflict only influences intentions when perceived effectiveness is high. Norm-conflict is both positively and negatively related to behavioral decision making, suggesting additional considerations in the design of social norms-based interventions.

  18. NORM management in the oil and gas industry

    International Nuclear Information System (INIS)

    Cowie, Michael; Mously, Khalid; Fageeha, Osama; Nassar, Rafat

    2008-01-01

    It has been established that Naturally Occurring Radioactive Materials (NORM) may accumulate at various locations along the oil/gas production process. Components such as wellheads, separation vessels, pumps, and other processing equipment can become NORM contaminated, and NORM can accumulate in the form of sludge, scale, scrapings and other waste media. This can create a potential radiation hazard to workers, general public and the environment if certain controls are not established. Saudi Aramco has developed NORM management guidelines and is implementing a comprehensive strategy to address all aspects of NORM management which aim towards enhancing: NORM monitoring; Control of NORM contaminated equipment; Control over NORM waste handling and disposal; Workers protection, awareness, and training. The benefits of shared knowledge, best practice and, experience across the oil and gas industry are seen as key to the establishment of common guidance. This paper outlines Saudi Aramco's experience in the development of a NORM management strategy and its goals of establishing common guidance throughout the oil and gas industry. (author)

  19. Integration of polystyrene microlenses with both convex and concave profiles in a polymer-based microfluidic system

    KAUST Repository

    Fan, Yiqiang

    2013-12-20

    This paper reports a new technique of fabricating polystyrene microlenses with both convex and concave profiles that are integrated in polymer-based microfluidic system. The polystyrene microlenses, or microlens array, are fabricated using the free-surface thermal compression molding method. The laser fabricated poly(methyl methacrylate) (PMMA) sheet is used as the mold for the thermal compression molding process. With different surface treatment methods of the PMMA mold, microlenses with either convex or concave profiles could be achieved during the thermal molding process. By integrating the microlenses in the microfluidic systems, observing the flow inside the microchannels is easier. This new technique is rapid, low cost, and it does not require cleanroom facilities. Microlenses with both convex and concave profiles can be easily fabricated and integrated in microfluidic system with this technique. © 2013 Springer-Verlag Berlin Heidelberg.

  20. Usefulness of the convexity apparent hyperperfusion sign in 123I-iodoamphetamine brain perfusion SPECT for the diagnosis of idiopathic normal pressure hydrocephalus.

    Science.gov (United States)

    Ohmichi, Takuma; Kondo, Masaki; Itsukage, Masahiro; Koizumi, Hidetaka; Matsushima, Shigenori; Kuriyama, Nagato; Ishii, Kazunari; Mori, Etsuro; Yamada, Kei; Mizuno, Toshiki; Tokuda, Takahiko

    2018-03-16

    OBJECTIVE The gold standard for the diagnosis of idiopathic normal pressure hydrocephalus (iNPH) is the CSF removal test. For elderly patients, however, a less invasive diagnostic method is required. On MRI, high-convexity tightness was reported to be an important finding for the diagnosis of iNPH. On SPECT, patients with iNPH often show hyperperfusion of the high-convexity area. The authors tested 2 hypotheses regarding the SPECT finding: 1) it is relative hyperperfusion reflecting the increased gray matter density of the convexity, and 2) it is useful for the diagnosis of iNPH. The authors termed the SPECT finding the convexity apparent hyperperfusion (CAPPAH) sign. METHODS Two clinical studies were conducted. In study 1, SPECT was performed for 20 patients suspected of having iNPH, and regional cerebral blood flow (rCBF) of the high-convexity area was examined using quantitative analysis. Clinical differences between patients with the CAPPAH sign (CAP) and those without it (NCAP) were also compared. In study 2, the CAPPAH sign was retrospectively assessed in 30 patients with iNPH and 19 healthy controls using SPECT images and 3D stereotactic surface projection. RESULTS In study 1, rCBF of the high-convexity area of the CAP group was calculated as 35.2-43.7 ml/min/100 g, which is not higher than normal values of rCBF determined by SPECT. The NCAP group showed lower cognitive function and weaker responses to the removal of CSF than the CAP group. In study 2, the CAPPAH sign was positive only in patients with iNPH (24/30) and not in controls (sensitivity 80%, specificity 100%). The coincidence rate between tight high convexity on MRI and the CAPPAH sign was very high (28/30). CONCLUSIONS Patients with iNPH showed hyperperfusion of the high-convexity area on SPECT; however, the presence of the CAPPAH sign did not indicate real hyperperfusion of rCBF in the high-convexity area. The authors speculated that patients with iNPH without the CAPPAH sign, despite showing

  1. Uniqueness of a pre-generator for $C_0$-semigroup on a general locally convex vector space

    OpenAIRE

    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.

  2. Primal Recovery from Consensus-Based Dual Decomposition for Distributed Convex Optimization

    NARCIS (Netherlands)

    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

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

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

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

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

  7. Impact of Norm Perceptions and Guilt on Audience Response to Anti-Smoking Norm PSAs: The Case of Korean Male Smokers

    Science.gov (United States)

    Lee, Hyegyu; Paek, Hye-Jin

    2013-01-01

    Objective: To examine how norm appeals and guilt influence smokers' behavioural intention. Design: Quasi-experimental design. Setting: South Korea. Method: Two hundred and fifty-five male smokers were randomly assigned to descriptive, injunctive, or subjective anti-smoking norm messages. After they viewed the norm messages, their norm perceptions,…

  8. Three-Dimensional Synthetic Aperture Focusing Using a Rocking Convex Array Transducer

    DEFF Research Database (Denmark)

    Andresen, Henrik; Nikolov, Svetoslav; Pedersen, Mads Møller

    2010-01-01

    Volumetric imaging can be performed using 1-D arrays in combination with mechanical motion. Outside the elevation focus of the array, the resolution and contrast quickly degrade compared with the lateral plane, because of the fixed transducer focus. This paper shows the feasibility of using...... synthetic aperture focusing for enhancing the elevation focus for a convex rocking array. The method uses a virtual source (VS) for defocused multi-element transmit, and another VS in the elevation focus point. This allows a direct time-of-flight to be calculated for a given 3-D point. To avoid artifacts...... and increase SNR at the elevation VS, a plane-wave VS approach has been implemented. Simulations and measurements using an experimental scanner with a convex rocking array show an average improvement in resolution of 26% and 33%, respectively. This improvement is also seen in in vivo measurements...

  9. Norm in Some Industries and Its Measurement Method

    International Nuclear Information System (INIS)

    Syarbaini; Wahyudi

    2001-01-01

    NORM as a by product of some industries activity must be monitored and handled in such a way because this product is radioactive material. By using nuclear technology and instrumentation, NORM can be monitored and analyzed its radionuclides content qualitatively and/or quantitatively. This paper describe the measurement method and analysis used for radionuclides in NORM or in the environmental component contaminated by NORM. By monitoring and handling NORM in industries, the radiology impact of NORM to the industrial workers, the member of the public and the surrounding environment could be controlled. (author)

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2016-06-15

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

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

    International Nuclear Information System (INIS)

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

    2016-01-01

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

  12. Distributed Controllers for Norm Enforcement

    NARCIS (Netherlands)

    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

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

    Science.gov (United States)

    Youla, D C; Webb, H

    1982-01-01

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

  14. Design and analysis of a curved cylindrical Fresnel lens that produces high irradiance uniformity on the solar cell.

    Science.gov (United States)

    González, Juan C

    2009-04-10

    A new type of convex Fresnel lens for linear photovoltaic concentration systems is presented. The lens designed with this method reaches 100% of geometrical optical efficiency, and the ratio (Aperture area)/(Receptor area) is up to 75% of the theoretical limit. The main goal of the design is high uniformity of the radiation on the cell surface for each input angle inside the acceptance. The ratio between the maximum and the minimum irradiance on points of the solar cell is less than 2. The lens has been designed with the simultaneous multiple surfaces (SMS) method of nonimaging optics, and ray tracing techniques have been used to characterize its performance for linear symmetry systems.

  15. CudaPre3D: An Alternative Preprocessing Algorithm for Accelerating 3D Convex Hull Computation on the GPU

    Directory of Open Access Journals (Sweden)

    MEI, G.

    2015-05-01

    Full Text Available In the calculating of convex hulls for point sets, a preprocessing procedure that is to filter the input points by discarding non-extreme points is commonly used to improve the computational efficiency. We previously proposed a quite straightforward preprocessing approach for accelerating 2D convex hull computation on the GPU. In this paper, we extend that algorithm to being used in 3D cases. The basic ideas behind these two preprocessing algorithms are similar: first, several groups of extreme points are found according to the original set of input points and several rotated versions of the input set; then, a convex polyhedron is created using the found extreme points; and finally those interior points locating inside the formed convex polyhedron are discarded. Experimental results show that: when employing the proposed preprocessing algorithm, it achieves the speedups of about 4x on average and 5x to 6x in the best cases over the cases where the proposed approach is not used. In addition, more than 95 percent of the input points can be discarded in most experimental tests.

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

    Science.gov (United States)

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

    1999-01-01

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

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

  18. A deep cut ellipsoid algorithm for convex programming : Theory and applications

    NARCIS (Netherlands)

    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

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

  20. On the statistics of the minimal solution of a linear Diophantine equation and uniform distribution of the real part of orbits in hyperbolic spaces

    DEFF Research Database (Denmark)

    Risager, Morten S.; Rudnick, Zeev

    We study a variant of a problem considered by Dinaburg and Sinai on the statistics of the minimal solution to a linear Diophantine equation. We show that the signed ratio between the Euclidean norms of the minimal solution and the coefficient vector is uniformly distributed modulo one. We reduce ...

  1. A one-layer recurrent neural network for non-smooth convex optimization subject to linear inequality constraints

    International Nuclear Information System (INIS)

    Liu, Xiaolan; Zhou, Mi

    2016-01-01

    In this paper, a one-layer recurrent network is proposed for solving a non-smooth convex optimization subject to linear inequality constraints. Compared with the existing neural networks for optimization, the proposed neural network is capable of solving more general convex optimization with linear inequality constraints. The convergence of the state variables of the proposed neural network to achieve solution optimality is guaranteed as long as the designed parameters in the model are larger than the derived lower bounds.

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

  3. A Review of Norms and Normative Multiagent Systems

    Science.gov (United States)

    Mahmoud, Moamin A.; Ahmad, Mohd Sharifuddin; Mustapha, Aida

    2014-01-01

    Norms and normative multiagent systems have become the subjects of interest for many researchers. Such interest is caused by the need for agents to exploit the norms in enhancing their performance in a community. The term norm is used to characterize the behaviours of community members. The concept of normative multiagent systems is used to facilitate collaboration and coordination among social groups of agents. Many researches have been conducted on norms that investigate the fundamental concepts, definitions, classification, and types of norms and normative multiagent systems including normative architectures and normative processes. However, very few researches have been found to comprehensively study and analyze the literature in advancing the current state of norms and normative multiagent systems. Consequently, this paper attempts to present the current state of research on norms and normative multiagent systems and propose a norm's life cycle model based on the review of the literature. Subsequently, this paper highlights the significant areas for future work. PMID:25110739

  4. A review of norms and normative multiagent systems.

    Science.gov (United States)

    Mahmoud, Moamin A; Ahmad, Mohd Sharifuddin; Yusoff, Mohd Zaliman Mohd; Mustapha, Aida

    2014-01-01

    Norms and normative multiagent systems have become the subjects of interest for many researchers. Such interest is caused by the need for agents to exploit the norms in enhancing their performance in a community. The term norm is used to characterize the behaviours of community members. The concept of normative multiagent systems is used to facilitate collaboration and coordination among social groups of agents. Many researches have been conducted on norms that investigate the fundamental concepts, definitions, classification, and types of norms and normative multiagent systems including normative architectures and normative processes. However, very few researches have been found to comprehensively study and analyze the literature in advancing the current state of norms and normative multiagent systems. Consequently, this paper attempts to present the current state of research on norms and normative multiagent systems and propose a norm's life cycle model based on the review of the literature. Subsequently, this paper highlights the significant areas for future work.

  5. The Superconvergence Phenomenon and Proof of the MAC Scheme for the Stokes Equations on Non-uniform Rectangular Meshes

    KAUST Repository

    Li, Jichun

    2014-12-02

    For decades, the widely used finite difference method on staggered grids, also known as the marker and cell (MAC) method, has been one of the simplest and most effective numerical schemes for solving the Stokes equations and Navier–Stokes equations. Its superconvergence on uniform meshes has been observed by Nicolaides (SIAM J Numer Anal 29(6):1579–1591, 1992), but the rigorous proof is never given. Its behavior on non-uniform grids is not well studied, since most publications only consider uniform grids. In this work, we develop the MAC scheme on non-uniform rectangular meshes, and for the first time we theoretically prove that the superconvergence phenomenon (i.e., second order convergence in the (Formula presented.) norm for both velocity and pressure) holds true for the MAC method on non-uniform rectangular meshes. With a careful and accurate analysis of various sources of errors, we observe that even though the local truncation errors are only first order in terms of mesh size, the global errors after summation are second order due to the amazing cancellation of local errors. This observation leads to the elegant superconvergence analysis even with non-uniform meshes. Numerical results are given to verify our theoretical analysis.

  6. Report on the observation of IAEA international emergency response exercise ConvEx-3(2008)

    International Nuclear Information System (INIS)

    Yamamoto, Kazuya; Sumiya, Akihiro

    2009-02-01

    The International Atomic Energy Agency IAEA carried out a large-scale international emergency response exercise under the designated name of ConvEx-3(2008), accompanying the national exercise of Mexico in July 2008. This review report summarizes two simultaneous observations of the exercises in Mexico and the IAEA headquarter during ConvEx-3(2008). Mexico has established a very steady nuclear emergency response system based on that of US, while only two BWR nuclear power units have been operated yet. The Mexican nuclear emergency response system and the emergency response activities of the Incident and Emergency Centre of the IAEA headquarter impressed important knowledge on observers that is helpful for enhancement of Japanese nuclear emergency response system in the future, e.g. establishment of Emergency Action Level and of implementation of long time exercise and enhancement of prompt protective actions. Japan had established the Act on Special Measures Concerning Nuclear Emergency Preparedness and has developed the nuclear disaster prevention system since the JCO Criticality Accident in Tokai-mura. Now is the new stage to enhance the system on the view point of prevention of a nuclear disaster affecting the neighboring countries' or prevention of a nuclear disaster which arise from the neighboring countries'. The ConvEx-3(2008) suggested key issues about nuclear disaster prevention related to the neighboring countries, e.g. establishment of much wider environmental monitoring and of international assistance system against a foreign nuclear disaster. The observations of the IAEA ConvEx-3(2008) exercise described in this review report were funded by the MEXT (Ministry of Education, Culture, Sports, Science and Technology). (author)

  7. RxNorm

    Data.gov (United States)

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

  8. A DEEP CUT ELLIPSOID ALGORITHM FOR CONVEX-PROGRAMMING - THEORY AND APPLICATIONS

    NARCIS (Netherlands)

    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

  9. On the convex hull of the simple integer recourse objective function

    NARCIS (Netherlands)

    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

  10. Deformation patterning driven by rate dependent non-convex strain gradient plasticity

    NARCIS (Netherlands)

    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

  11. A Deep Cut Ellipsoid Algorithm for convex Programming: theory and Applications

    NARCIS (Netherlands)

    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

  12. Novel method of finding extreme edges in a convex set of N-dimension vectors

    Science.gov (United States)

    Hu, Chia-Lun J.

    2001-11-01

    As we published in the last few years, for a binary neural network pattern recognition system to learn a given mapping {Um mapped to Vm, m=1 to M} where um is an N- dimension analog (pattern) vector, Vm is a P-bit binary (classification) vector, the if-and-only-if (IFF) condition that this network can learn this mapping is that each i-set in {Ymi, m=1 to M} (where Ymithere existsVmiUm and Vmi=+1 or -1, is the i-th bit of VR-m).)(i=1 to P and there are P sets included here.) Is POSITIVELY, LINEARLY, INDEPENDENT or PLI. We have shown that this PLI condition is MORE GENERAL than the convexity condition applied to a set of N-vectors. In the design of old learning machines, we know that if a set of N-dimension analog vectors form a convex set, and if the machine can learn the boundary vectors (or extreme edges) of this set, then it can definitely learn the inside vectors contained in this POLYHEDRON CONE. This paper reports a new method and new algorithm to find the boundary vectors of a convex set of ND analog vectors.

  13. Quality of decision making and group norms

    NARCIS (Netherlands)

    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

  14. Quality of decision making and group norms

    NARCIS (Netherlands)

    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

  15. Human health and stoic moral norms.

    Science.gov (United States)

    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.

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

  17. Characterisation of NORM Contaminated Objects: Reliable and Efficient

    DEFF Research Database (Denmark)

    Breddam, Kresten; Hou, Xiaolin; Koufakis, Markos

    The predominant contributors to the production of Technologically En-hanced Naturally Occurring Radioactive Material (TENORM) and NORM-waste in the Nordic countries are the on- and offshore oil and gas produc-ers. In oil and gas production processes, host rock formation water con-taining low...... concentrations of NORM is mixed with seawater containing high concentrations of sulphate. This leads to precipitation of NORM (Ra, Pb, Po)SO4, which is deposited as either scale or sludge in the production equipment. NORM contaminated pipes, tubes, pumps and tanks, etc. are therefore subject to radiological...... characterization in order to ensure safe reuse or recycling as well as safe NORM waste handling.The procedures and measurement techniques may significantly affect the amount of mate-rial that is categorized as NORM contaminated equipment and NORM waste. At present, different procedures are used for categorization...

  18. Management of NORM Residues

    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

  19. The Neural Basis of Changing Social Norms through Persuasion

    OpenAIRE

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

  20. Framework to model neutral particle flux in convex high aspect ratio structures using one-dimensional radiosity

    Science.gov (United States)

    Manstetten, Paul; Filipovic, Lado; Hössinger, Andreas; Weinbub, Josef; Selberherr, Siegfried

    2017-02-01

    We present a computationally efficient framework to compute the neutral flux in high aspect ratio structures during three-dimensional plasma etching simulations. The framework is based on a one-dimensional radiosity approach and is applicable to simulations of convex rotationally symmetric holes and convex symmetric trenches with a constant cross-section. The framework is intended to replace the full three-dimensional simulation step required to calculate the neutral flux during plasma etching simulations. Especially for high aspect ratio structures, the computational effort, required to perform the full three-dimensional simulation of the neutral flux at the desired spatial resolution, conflicts with practical simulation time constraints. Our results are in agreement with those obtained by three-dimensional Monte Carlo based ray tracing simulations for various aspect ratios and convex geometries. With this framework we present a comprehensive analysis of the influence of the geometrical properties of high aspect ratio structures as well as of the particle sticking probability on the neutral particle flux.

  1. Skin carcinogenesis following uniform and non-uniform β irradiation

    International Nuclear Information System (INIS)

    Charles, M.W.; Williams, J.P.; Coggle, J.E.

    1989-01-01

    Where workers or the general public may be exposed to ionising radiation, the irradiation is rarely uniform. The risk figures and dose limits recommended by the International Commission on Radiological Protection (ICRP) are based largely on clinical and epidemiological studies of reasonably uniform irradiated organs. The paucity of clinical or experimental data for highly non-uniform exposures has prevented the ICRP from providing adequate recommendations. This weakness has led on a number of occasions to the postulate that highly non-uniform exposures of organs could be 100,000 times more carcinogenic than ICRP risk figures would predict. This so-called ''hot-particle hypothesis'' found little support among reputable radiobiologists, but could not be clearly and definitively refuted on the basis of experiment. An experiment, based on skin tumour induction in mouse skin, is described which was developed to test the hypothesis. The skin of 1200 SAS/4 male mice has been exposed to a range of uniform and non-uniform sources of the β emitter 170 Tm (E max ∼ 1 MeV). Non-uniform exposures were produced using arrays of 32 or 8 2-mm diameter sources distributed over the same 8-cm 2 area as a uniform control source. Average skin doses varied from 2-100 Gy. The results for the non-uniform sources show a 30% reduction in tumour incidence by the 32-point array at the lower mean doses compared with the response from uniform sources. The eight-point array showed an order-of-magnitude reduction in tumour incidence compared to uniform irradiation at low doses. These results, in direct contradiction to the ''hot particle hypothesis'', indicate that non-uniform exposures produce significantly fewer tumours than uniform exposures. (author)

  2. Convex analysis and global optimization

    CERN Document Server

    Tuy, Hoang

    2016-01-01

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

  3. Organisational dynamics, social norms and information systems

    NARCIS (Netherlands)

    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

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

  5. Convex order approximations in case of cash flows of mixed signs

    NARCIS (Netherlands)

    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

  6. Norm Theory: Comparing Reality to Its Alternatives.

    Science.gov (United States)

    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)

  7. The motivational roots of norms for environmentally responsible behaviour

    DEFF Research Database (Denmark)

    Thøgersen, John

    This paper investigates whether norms guiding environmentally desirable behaviour are genuinely internalized and integrated into the person's cognitive and goal structures or just shallowly "introjected" social norms. Internet-based questionnaires were administered to a stratified sample of Danish...... to the studied behaviour differ significantly depending on the strength of their norms and the two types of norms differ in their embeddedness in the person's cognitive structures. The behavioural influence of subjective social norms and expressed reasons and motives is mediated through personal norms...

  8. Passive shimming of a superconducting magnet using the L1-norm regularized least square algorithm.

    Science.gov (United States)

    Kong, Xia; Zhu, Minhua; Xia, Ling; Wang, Qiuliang; Li, Yi; Zhu, Xuchen; Liu, Feng; Crozier, Stuart

    2016-02-01

    The uniformity of the static magnetic field B0 is of prime importance for an MRI system. The passive shimming technique is usually applied to improve the uniformity of the static field by optimizing the layout of a series of steel shims. The steel pieces are fixed in the drawers in the inner bore of the superconducting magnet, and produce a magnetizing field in the imaging region to compensate for the inhomogeneity of the B0 field. In practice, the total mass of steel used for shimming should be minimized, in addition to the field uniformity requirement. This is because the presence of steel shims may introduce a thermal stability problem. The passive shimming procedure is typically realized using the linear programming (LP) method. The LP approach however, is generally slow and also has difficulty balancing the field quality and the total amount of steel for shimming. In this paper, we have developed a new algorithm that is better able to balance the dual constraints of field uniformity and the total mass of the shims. The least square method is used to minimize the magnetic field inhomogeneity over the imaging surface with the total mass of steel being controlled by an L1-norm based constraint. The proposed algorithm has been tested with practical field data, and the results show that, with similar computational cost and mass of shim material, the new algorithm achieves superior field uniformity (43% better for the test case) compared with the conventional linear programming approach. Copyright © 2016 Elsevier Inc. All rights reserved.

  9. Vitrification of NORM wastes

    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

  10. Gröbner bases and convex polytopes

    CERN Document Server

    Sturmfels, Bernd

    1995-01-01

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

  11. Bundles of Norms About Teen Sex and Pregnancy.

    Science.gov (United States)

    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.

  12. The role of concavo-convex walls of a nanopore on the density profile, adsorption, solvation force, and capillary condensation of confined fluids: A DFT study

    International Nuclear Information System (INIS)

    Helmi, Abbas; Keshavarzi, Ezat

    2014-01-01

    Highlights: • The effect of concavo-convex walls of nanopores on the density profile was studied. • For HS fluids the contact density at concave wall is greater than for convex wall. • For Yukawa fluid the contact density at concave wall can be less than convex wall. • Capillary condensation was observed for Yukawa fluids in the homocentric pores. - Abstract: We investigate the effects of concavo-convex walls of a nanopore on the structure and certain thermodynamic properties of confined fluids. Adsorption, solvation force, and capillary condensation in a nanopore formed between two homocentric spheres will be determined using the MFMT. For hard sphere fluids, contact density is greater at the concave wall than it is at the convex wall. In Yukawa fluids, for the thermodynamic state in which the energy effect is the dominant factor, contact density at a concave wall is less than that at a convex wall; this will be reversed for the thermodynamic state in which the entropy effect is the dominant factor. It is possible to find thermodynamic states in which contact densities at concave and convex walls become identical. The adsorption and solvation force of hard sphere fluid show an oscillatory behavior versus H. Capillary condensation is in certain cases observed for Yukawa fluids

  13. The malleability of injunctive norms among college students.

    Science.gov (United States)

    Prince, Mark A; Carey, Kate B

    2010-11-01

    Alcohol use among college students has been associated with injunctive norms, which refer to the perceived acceptability of excessive drinking, and descriptive norms, which refer to perceptions of actual drinking. The purpose of this study was to examine the effect of a brief injunctive norms manipulation on both injunctive and descriptive norms about drinking alcohol and to explore differences in the malleability of norms across referent groups, sex, and gender role. Participants were 265 undergraduates (43% male, 70% freshmen) who completed a web-based survey for course credit. A randomly selected half was exposed to a page of information-based feedback about typical student injunctive norms. Relative to the control condition, the manipulation produced lower injunctive and descriptive norms related to typical students' drinking but no change in either type of norm related to close friends. Femininity was associated with less permissive normative beliefs about the acceptability of excessive drinking whereas masculinity was associated with elevated perceptions of peer drinking, but neither sex nor gender role moderated the manipulation effect. We conclude that perceptions of peer approval of drinking are malleable with a very brief information-based manipulation. Copyright 2010 Elsevier Ltd. All rights reserved.

  14. NEIGHBORHOOD NORMS AND SUBSTANCE USE AMONG TEENS

    Science.gov (United States)

    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

  15. Competition and norms: A self-defeating combination?

    International Nuclear Information System (INIS)

    Alberts, Genevieve; Gurguc, Zeynep; Koutroumpis, Pantelis; Martin, Ralf; Muûls, Mirabelle; Napp, Tamaryn

    2016-01-01

    This paper investigates the effects of information feedback mechanisms on electricity and heating usage at a student hall of residence in London. In a randomised control trial, we formulate different treatments such as feedback information and norms, as well as prize competition among subjects. We show that information and norms lead to a sharp – more than 20% - reduction in overall energy consumption. Because participants do not pay for their energy consumption this response cannot be driven by cost saving incentives. Interestingly, when combining feedback and norms with a prize competition for achieving low energy consumption, the reduction effect – while present initially – disappears in the long run. This could suggest that external rewards reduce and even destroy intrinsic motivation to change behaviour. - Highlights: •We investigate the effect of information feedback on residential energy consumption. •A RCT tests whether norms affect the decisions of price-indifferent participants. •Feedback mechanisms and norms reduce energy consumption by 22% on average. •Introducing prize competition dissipates the impact of information feedback and norms.

  16. Convex Bodies With Minimal Volume Product in R^2 --- A New Proof

    OpenAIRE

    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.

  17. Using multiscale norms to quantify mixing and transport

    International Nuclear Information System (INIS)

    Thiffeault, Jean-Luc

    2012-01-01

    Mixing is relevant to many areas of science and engineering, including the pharmaceutical and food industries, oceanography, atmospheric sciences and civil engineering. In all these situations one goal is to quantify and often then to improve the degree of homogenization of a substance being stirred, referred to as a passive scalar or tracer. A classical measure of mixing is the variance of the concentration of the scalar, which is the L 2 norm of a mean-zero concentration field. Recently, other norms have been used to quantify mixing, in particular the mix-norm as well as negative Sobolev norms. These norms have the advantage that unlike variance they decay even in the absence of diffusion, and their decay corresponds to the flow being mixing in the sense of ergodic theory. General Sobolev norms weigh scalar gradients differently, and are known as multiscale norms for mixing. We review the applications of such norms to mixing and transport, and show how they can be used to optimize the stirring and mixing of a decaying passive scalar. We then review recent work on the less-studied case of a continuously replenished scalar field—the source–sink problem. In that case the flows that optimally reduce the norms are associated with transport rather than mixing: they push sources onto sinks, and vice versa. (invited article)

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

  19. Equilibrium prices supported by dual price functions in markets with non-convexities

    International Nuclear Information System (INIS)

    Bjoerndal, Mette; Joernsten, Kurt

    2004-06-01

    The issue of finding market clearing prices in markets with non-convexities has had a renewed interest due to the deregulation of the electricity sector. In the day-ahead electricity market, equilibrium prices are calculated based on bids from generators and consumers. In most of the existing markets, several generation technologies are present, some of which have considerable non-convexities, such as capacity limitations and large start up costs. In this paper we present equilibrium prices composed of a commodity price and an uplift charge. The prices are based on the generation of a separating valid inequality that supports the optimal resource allocation. In the case when the sub-problem generated as the integer variables are held fixed to their optimal values possess the integrality property, the generated prices are also supported by non-linear price-functions that are the basis for integer programming duality. (Author)

  20. Consumer Preferences for Local Food: Testing an Extended Norm Taxonomy

    Directory of Open Access Journals (Sweden)

    Julius Wenzig

    2018-04-01

    Full Text Available Consumer attitudes toward consuming and buying locally produced food are well studied. By contrast, the topic of consumer preferences for local food, with a special emphasis on the role of norms, still lacks empirical evidence. To study the influence of norms and morals on the intention to buy local food products, a quantitative study (N = 327 focusing on external social and internalized moral norms was conducted using the constructs of the theory of planned behavior in combination with an extended norm taxonomy and the perceived consumer effectiveness measure. The norm constructs consisted of two different personal norms, integrated and introjected, and two social norms, descriptive and injunctive. In a factor analysis, two factors for social norms but only one for personal norms were obtained. Multiple regressions explained 50 percent of the variance in intentions and 29 percent of the variance in past behavior. Norm constructs were proven important in the model, as personal norms had the largest effect among all constructs on intentions, and descriptive norms strongly influenced past behavior. An additional mediation analysis showed that personal norms were internalized social injunctive norms and that intentions mediated the relationship between all constructs. The implications of the findings and recommendations for future research are given accordingly.

  1. Norm

    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

  2. The Neural Basis of Changing Social Norms through Persuasion.

    Science.gov (United States)

    Yomogida, Yukihito; Matsumoto, Madoka; Aoki, Ryuta; Sugiura, Ayaka; Phillips, Adam N; Matsumoto, Kenji

    2017-11-24

    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 activated a set of brain regions including temporal poles, temporo-parietal junction, and medial prefrontal cortex. Beyond these regions, when successful, persuasion away from an accepted norm specifically recruited the left middle temporal and supramarginal gyri. Furthermore, in combination with data from a separate attitude-rating task, we found that left supramarginal gyrus activity represented participant attitude toward norms and tracked the persuasion-induced attitude changes that were away from agreement.

  3. A Total Variation Model Based on the Strictly Convex Modification for Image Denoising

    Directory of Open Access Journals (Sweden)

    Boying Wu

    2014-01-01

    Full Text Available We propose a strictly convex functional in which the regular term consists of the total variation term and an adaptive logarithm based convex modification term. We prove the existence and uniqueness of the minimizer for the proposed variational problem. The existence, uniqueness, and long-time behavior of the solution of the associated evolution system is also established. Finally, we present experimental results to illustrate the effectiveness of the model in noise reduction, and a comparison is made in relation to the more classical methods of the traditional total variation (TV, the Perona-Malik (PM, and the more recent D-α-PM method. Additional distinction from the other methods is that the parameters, for manual manipulation, in the proposed algorithm are reduced to basically only one.

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

  5. Determining Representative Elementary Volume For Multiple Petrophysical Parameters using a Convex Hull Analysis of Digital Rock Data

    Science.gov (United States)

    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.

  6. Norms for environmentally responsible behaviour: An extended taxonomy

    DEFF Research Database (Denmark)

    Thøgersen, John

    2006-01-01

    is carried out based on a survey of residents of Denmark. A range of norm constructs were measured with regard to four environmentally responsible behaviours: buying organic milk, buying energy saving light bulbs, source separating compostable kitchen waste, and using public transportation for work...... of correlation between norm constructs and between norms and behaviour vary between behaviours. Hence, respondents seem to apply different norms for different environmentally responsible behaviours....

  7. Observer-based output feedback control of networked control systems with non-uniform sampling and time-varying delay

    Science.gov (United States)

    Meng, Su; Chen, Jie; Sun, Jian

    2017-10-01

    This paper investigates the problem of observer-based output feedback control for networked control systems with non-uniform sampling and time-varying transmission delay. The sampling intervals are assumed to vary within a given interval. The transmission delay belongs to a known interval. A discrete-time model is first established, which contains time-varying delay and norm-bounded uncertainties coming from non-uniform sampling intervals. It is then converted to an interconnection of two subsystems in which the forward channel is delay-free. The scaled small gain theorem is used to derive the stability condition for the closed-loop system. Moreover, the observer-based output feedback controller design method is proposed by utilising a modified cone complementary linearisation algorithm. Finally, numerical examples illustrate the validity and superiority of the proposed method.

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

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

    Science.gov (United States)

    Keshavarzi, Alireza; Noori, Lila Khaje

    2010-12-01

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

  10. Anatomy of zero-norm states in string theory

    International Nuclear Information System (INIS)

    Chan, C.-T.; Lee, J.-C.; Yi Yang

    2005-01-01

    We calculate and identify the counterparts of zero-norm states in the old covariant first quantized (OCFQ) spectrum of open bosonic string in two other quantization schemes of string theory, namely, the light-cone Del Giudice-Di Vecchia-Fubine zero-norm states and the off-shell Becchi-Rouet-Stora-Tyutin (BRST) zero-norm states (with ghost) in the Witten string field theory (WSFT). In particular, special attention is paid to the interparticle zero-norm states in all quantization schemes. For the case of the off-shell BRST zero-norm states, we impose the no-ghost conditions and recover exactly two types of on-shell zero-norm states in the OCFQ string spectrum for the first few low-lying mass levels. We then show that off-shell gauge transformations of WSFT are identical to the on-shell stringy gauge symmetries generated by two types of zero-norm states in the generalized massive σ-model approach of string theory. The high-energy limit of these stringy gauge symmetries was recently used to calculate the proportionality constants, conjectured by Gross, among high-energy scattering amplitudes of different string states. Based on these zero-norm state calculations, we have thus related gauge symmetry of WSFT to the high-energy stringy symmetry of Gross

  11. Convex optimization of MRI exposure for mitigation of RF-heating from active medical implants

    Science.gov (United States)

    Córcoles, Juan; Zastrow, Earl; Kuster, Niels

    2015-09-01

    Local RF-heating of elongated medical implants during magnetic resonance imaging (MRI) may pose a significant health risk to patients. The actual patient risk depends on various parameters including RF magnetic field strength and frequency, MR coil design, patient’s anatomy, posture, and imaging position, implant location, RF coupling efficiency of the implant, and the bio-physiological responses associated with the induced local heating. We present three constrained convex optimization strategies that incorporate the implant’s RF-heating characteristics, for the reduction of local heating of medical implants during MRI. The study emphasizes the complementary performances of the different formulations. The analysis demonstrates that RF-induced heating of elongated metallic medical implants can be carefully controlled and balanced against MRI quality. A reduction of heating of up to 25 dB can be achieved at the cost of reduced uniformity in the magnitude of the B1+ field of less than 5%. The current formulations incorporate a priori knowledge of clinically-specific parameters, which is assumed to be available. Before these techniques can be applied practically in the broader clinical context, further investigations are needed to determine whether reduced access to a priori knowledge regarding, e.g. the patient’s anatomy, implant routing, RF-transmitter, and RF-implant coupling, can be accepted within reasonable levels of uncertainty.

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

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

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

  15. Hermite-Hadamard Type Integral Inequalities for Functions Whose Second-Order Mixed Derivatives Are Coordinated (s,m-P-Convex

    Directory of Open Access Journals (Sweden)

    Yu-Mei Bai

    2018-01-01

    Full Text Available We establish some new Hermite-Hadamard type integral inequalities for functions whose second-order mixed derivatives are coordinated (s,m-P-convex. An expression form of Hermite-Hadamard type integral inequalities via the beta function and the hypergeometric function is also presented. Our results provide a significant complement to the work of Wu et al. involving the Hermite-Hadamard type inequalities for coordinated (s,m-P-convex functions in an earlier article.

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

  17. Structural Health Monitoring of Tall Buildings with Numerical Integrator and Convex-Concave Hull Classification

    Directory of Open Access Journals (Sweden)

    Suresh Thenozhi

    2012-01-01

    Full Text Available An important objective of health monitoring systems for tall buildings is to diagnose the state of the building and to evaluate its possible damage. In this paper, we use our prototype to evaluate our data-mining approach for the fault monitoring. The offset cancellation and high-pass filtering techniques are combined effectively to solve common problems in numerical integration of acceleration signals in real-time applications. The integration accuracy is improved compared with other numerical integrators. Then we introduce a novel method for support vector machine (SVM classification, called convex-concave hull. We use the Jarvis march method to decide the concave (nonconvex hull for the inseparable points. Finally the vertices of the convex-concave hull are applied for SVM training.

  18. Discontinuous Petrov-Galerkin method based on the optimal test space norm for one-dimensional transport problems

    KAUST Repository

    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.

  19. Management of NORM/TENORM Waste from Non Nuclear Industries

    International Nuclear Information System (INIS)

    Djarot S Wisnubroto

    2003-01-01

    Management of NORM/TENORM waste is now to be an issue and discussed in many international conferences and seminars. This paper describes the status of the management of NORM/TENORM waste including the origin of the waste, regulations and assessment of waste disposal. Several countries have established the regulation for NORM/TENORM waste; however the IAEA has not yet published guideline for management of NORM/TENORM. There are many options for disposal of NORM/TENORM waste based on standard of the radioactive waste disposal. The decision and policy on management of NORM/TENORM waste must be conducted carefully due to the social and economical impacts. (author)

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

  1. Convex relaxation of Optimal Power Flow in Distribution Feeders with embedded solar power

    DEFF Research Database (Denmark)

    Hermann, Alexander Niels August; Wu, Qiuwei; Huang, Shaojun

    2016-01-01

    There is an increasing interest in using Distributed Energy Resources (DER) directly coupled to end user distribution feeders. This poses an array of challenges because most of today’s distribution feeders are designed for unidirectional power flow. Therefore when installing DERs such as solar...... panels with uncontrolled inverters, the upper limit of installable capacity is quickly reached in many of today’s distribution feeders. This problem can often be mitigated by optimally controlling the voltage angles of inverters. However, the optimal power flow problem in its standard form is a large...... scale non-convex optimization problem, and thus can’t be solved precisely and also is computationally heavy and intractable for large systems. This paper examines the use of a convex relaxation using Semi-definite programming to optimally control solar power inverters in a distribution grid in order...

  2. Silence and table manners: when environments activate norms.

    Science.gov (United States)

    Joly, Janneke F; Stapel, Diederik A; Lindenberg, Siegwart M

    2008-08-01

    Two studies tested the conditions under which an environment (e.g., library, restaurant) raises the relevance of environment-specific social norms (e.g., being quiet, using table manners). As hypothesized, the relevance of such norms is raised when environments are goal relevant ("I am going there later") and when they are humanized with people or the remnants of their presence (e.g., a glass of wine on a table). Two studies show that goal-relevant environments and humanized environments raise the perceived importance of norms (Study 1) and the intention to conform to norms (Study 2). Interestingly, in both studies, these effects reach beyond norms related to the environments used in the studies.

  3. Growth, financial development, societal norms and legal institutions

    NARCIS (Netherlands)

    Garretsen, Harry; Lensink, Robert; Sterken, Elmer

    2002-01-01

    This paper analyses whether societal norms help to explain cross-country differences in financial development. We analyze whether societal norms in addition to legal institutions have an impact on financial development. We address the implications of the inclusion of societal norms for the analysis

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

  5. Solving of L0 norm constrained EEG inverse problem.

    Science.gov (United States)

    Xu, Peng; Lei, Xu; Hu, Xiao; Yao, Dezhong

    2009-01-01

    l(0) norm is an effective constraint used to solve EEG inverse problem for a sparse solution. However, due to the discontinuous and un-differentiable properties, it is an open issue to solve the l(0) norm constrained problem, which is usually instead solved by using some alternative functions like l(1) norm to approximate l(0) norm. In this paper, a continuous and differentiable function having the same form as the transfer function of Butterworth low-pass filter is introduced to approximate l(0) norm constraint involved in EEG inverse problem. The new approximation based approach was compared with l(1) norm and LORETA solutions on a realistic head model using simulated sources. The preliminary results show that this alternative approximation to l(0) norm is promising for the estimation of EEG sources with sparse distribution.

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

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

  8. Regulation of naturally occurring radioactive materials (NORM) with emphasis on NORM disposal options

    International Nuclear Information System (INIS)

    Gray, P.

    1995-01-01

    Regulation of radioactive material can occur at the Federal, State, and sometimes local level. In addition to regulations at the federal and state level, there are guidelines and standards that do not carry the weight of law, yet are often referenced. Neither the Nuclear Regulatory Commission (NRC) or Environmental Protection Agency (EPA) categorically regulates NORM at this time. However, many of the existing regulations and guidelines for licensed radioactive material can be applied by states and other regulatory agencies to NORM. The primary regulations covering radioactive materials and exposures were promulgated under the Atomic Energy Act (AEA) or 1954, as amended. NRC licenses and regulates civilian use of nuclear materials to protect public health and safety and the environment. NRC makes rules and sets standards for licensees and inspects the activities of licensees to insure that they do not violate safety rules. OSHA regulations for worker protection from exposures to radioactivity are contained in 29CFR1910.96. These standards are designed to protect workers from exposure to radiation in programs other than those regulated by OSHA. The Uranium Mill Tailings Control Act, with implementing regulations found in 40CFR192 were promulgated by the EPA for cleanup of uranium mill tailings. These standards are often used by states and other agencies in regulating cleanup of NORM. EPA is currently considering regulation of NORM on NRC and DOE facilities under 40CFR195

  9. EQ-5D Portuguese population norms.

    Science.gov (United States)

    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.

  10. Model Selection in Continuous Test Norming With GAMLSS.

    Science.gov (United States)

    Voncken, Lieke; Albers, Casper J; Timmerman, Marieke E

    2017-06-01

    To compute norms from reference group test scores, continuous norming is preferred over traditional norming. A suitable continuous norming approach for continuous data is the use of the Box-Cox Power Exponential model, which is found in the generalized additive models for location, scale, and shape. Applying the Box-Cox Power Exponential model for test norming requires model selection, but it is unknown how well this can be done with an automatic selection procedure. In a simulation study, we compared the performance of two stepwise model selection procedures combined with four model-fit criteria (Akaike information criterion, Bayesian information criterion, generalized Akaike information criterion (3), cross-validation), varying data complexity, sampling design, and sample size in a fully crossed design. The new procedure combined with one of the generalized Akaike information criterion was the most efficient model selection procedure (i.e., required the smallest sample size). The advocated model selection procedure is illustrated with norming data of an intelligence test.

  11. The motivational roots of norms for environmentally responsible behaviour

    DEFF Research Database (Denmark)

    Thøgersen, John

    2007-01-01

    to the studied behaviour differ significantly depending on the strength of their norms and the two types of norms differ in their embeddedness in the person's cognitive structures. The behavioural influence of subjective social norms and expressed reasons and motives is mediated through personal norms...... consumers (N = 206). Each questionnaire contained standard items measuring subjective social and personal norms for the purchase of organic food, self-reported buying behaviour, and a "hard laddering" instrument probing reasons and motives for doing so. As expected, participants' means-end associations...

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

  13. Social Norms in the Ancient Athenian Courts

    OpenAIRE

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

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

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

    International Nuclear Information System (INIS)

    Sitaramayya, M.

    1993-11-01

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

  16. Geometry of power flows and convex-relaxed power flows in distribution networks with high penetration of renewables

    DEFF Research Database (Denmark)

    Huang, Shaojun; Wu, Qiuwei; Zhao, Haoran

    2016-01-01

    Renewable energies are increasingly integrated in electric distribution networks and will cause severe overvoltage issues. Smart grid technologies make it possible to use coordinated control to mitigate the overvoltage issues and the optimal power flow (OPF) method is proven to be efficient...... in the applications such as curtailment management and reactive power control. Nonconvex nature of the OPF makes it difficult to solve and convex relaxation is a promising method to solve the OPF very efficiently. This paper investigates the geometry of the power flows and the convex-relaxed power flows when high...

  17. First-order convex feasibility algorithms for x-ray CT

    DEFF Research Database (Denmark)

    Sidky, Emil Y.; Jørgensen, Jakob Heide; Pan, Xiaochuan

    2013-01-01

    Purpose: Iterative image reconstruction (IIR) algorithms in computed tomography (CT) are based on algorithms for solving a particular optimization problem. Design of the IIR algorithm, therefore, is aided by knowledge of the solution to the optimization problem on which it is based. Often times...... problems. Conclusions: Formulation of convex feasibility problems can provide a useful alternative to unconstrained optimization when designing IIR algorithms for CT. The approach is amenable to recent methods for accelerating first-order algorithms which may be particularly useful for CT with limited...

  18. Coarse-convex-compactification approach to numerical solution of nonconvex variational problems

    Czech Academy of Sciences Publication Activity Database

    Meziat, R.; Roubíček, Tomáš; Patino, D.

    2010-01-01

    Roč. 31, č. 4 (2010), s. 460-488 ISSN 0163-0563 Grant - others:GA MŠk(CZ) LC06052 Program:LC Institutional research plan: CEZ:AV0Z20760514 Keywords : convex approximations * method of moments * relaxed variational problems Subject RIV: BA - General Mathematics Impact factor: 0.687, year: 2010 http://www.informaworld.com/smpp/content~db=all~content=a922886514~frm=titlelink

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

  20. Norms and customs: causally important or causally impotent?

    Science.gov (United States)

    Jones, Todd

    2010-01-01

    In this article, I argue that norms and customs, despite frequently being described as being causes of behavior in the social sciences and ordinary conversation, cannot really cause behavior. Terms like "norms" and the like seem to refer to philosophically disreputable disjunctive properties. More problematically, even if they do not, or even if there can be disjunctive properties after all, I argue that norms and customs still cannot cause behavior. The social sciences would be better off without referring to properties like norms and customs as if they could be causal.

  1. Convex Hypersurfaces and $L^p$ Estimates for Schr\\"odinger Equations

    OpenAIRE

    Zheng, Quan; Yao, Xiaohua; Fan, Da

    2004-01-01

    This paper is concerned with Schr\\"odinger equations whose principal operators are homogeneous elliptic. When the corresponding level hypersurface is convex, we show the $L^p$-$L^q$ estimate of solution operator in free case. This estimate, combining with the results of fractionally integrated groups, allows us to further obtain the $L^p$ estimate of solutions for the initial data belonging to a dense subset of $L^p$ in the case of integrable potentials.

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

  3. Practical Run-Time Norm Enforcement with Bounded Lookahead

    NARCIS (Netherlands)

    Alechina, Natasha; Bulling, Nils; Dastani, Mehdi; Logan, Brian

    2015-01-01

    Norms have been widely proposed as a means of coordinating and controlling the behaviour of agents in a multi-agent system. A key challenge in normative MAS is norm enforcement: how and when to restrict the agents’ behaviour in order to obtain a desirable outcome? Even if a norm can be enforced

  4. Evolution of generous cooperative norms by cultural group selection.

    Science.gov (United States)

    Scheuring, István

    2009-04-07

    Evolution of cooperative norms is studied in a population where individual- and group-level selection are both in operation. Individuals play indirect reciprocity game within their group. Individuals are well informed about the previous actions and reputations, and follow second-order norms. Individuals are norm-followers, and imitate their successful group mates. In contrast to previous models where norms classify actions deterministically, we assume that norms determine only the probabilities of actions, and mutants can differ in these probabilities. The central question is how a selective cooperative norm can emerge in a population where initially only non-cooperative norms were present. It is shown that evolution leads to a cooperative state if generous cooperative strategies are dominant, although the "always defecting" and the "always cooperating"-like strategies remain stably present. The characteristics of these generous cooperative strategies and the presence of always defecting and always cooperating strategies are in concordance with experimental observations.

  5. Children are sensitive to norms of giving

    OpenAIRE

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

  6. Assessment indices for uniform and non-uniform thermal environments

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    Different assessment indices for thermal environments were compared and selected for proper assessment of indoor thermal environments.30 subjects reported their overall thermal sensation,thermal comfort,and thermal acceptability in uniform and non-uniform conditions.The results show that these three assessment indices provide equivalent evaluations in uniform environments.However,overall thermal sensation differs from the other two indices and cannot be used as a proper index for the evaluation of non-uniform environments.The relationship between the percentage and the mean vote for each index is established.

  7. Random noise attenuation of non-uniformly sampled 3D seismic data along two spatial coordinates using non-equispaced curvelet transform

    Science.gov (United States)

    Zhang, Hua; Yang, Hui; Li, Hongxing; Huang, Guangnan; Ding, Zheyi

    2018-04-01

    The attenuation of random noise is important for improving the signal to noise ratio (SNR). However, the precondition for most conventional denoising methods is that the noisy data must be sampled on a uniform grid, making the conventional methods unsuitable for non-uniformly sampled data. In this paper, a denoising method capable of regularizing the noisy data from a non-uniform grid to a specified uniform grid is proposed. Firstly, the denoising method is performed for every time slice extracted from the 3D noisy data along the source and receiver directions, then the 2D non-equispaced fast Fourier transform (NFFT) is introduced in the conventional fast discrete curvelet transform (FDCT). The non-equispaced fast discrete curvelet transform (NFDCT) can be achieved based on the regularized inversion of an operator that links the uniformly sampled curvelet coefficients to the non-uniformly sampled noisy data. The uniform curvelet coefficients can be calculated by using the inversion algorithm of the spectral projected-gradient for ℓ1-norm problems. Then local threshold factors are chosen for the uniform curvelet coefficients for each decomposition scale, and effective curvelet coefficients are obtained respectively for each scale. Finally, the conventional inverse FDCT is applied to the effective curvelet coefficients. This completes the proposed 3D denoising method using the non-equispaced curvelet transform in the source-receiver domain. The examples for synthetic data and real data reveal the effectiveness of the proposed approach in applications to noise attenuation for non-uniformly sampled data compared with the conventional FDCT method and wavelet transformation.

  8. Numerically Optimized Uniformly Most Powerful Alphabets for Hierarchical-Decode-and-Forward Two-Way Relaying

    Directory of Open Access Journals (Sweden)

    M. Hekrdla

    2011-01-01

    Full Text Available We address the issue of the parametric performance of the Hierarchical-Decode-and-Forward (HDF strategy in a wireless 2-way relay channel. Promising HDF, representing the concept of wireless network coding, performs well with a pre-coding strategy that requires Channel State Information (CSI on the transceiver side. Assuming a practical case when CSI is available only on the receiver side and the channel conditions do not allow adaptive strategies, the parametrization causes significant HDF performance degradation for some modulation alphabets. Alphabets that are robust to the parametrization (denoted Uniformly Most Powerful (UMP have already been proposed restricting on the class of non-linear multi-dimensional frequency modulations. In this work, we focus on the general design of unrestricted UMP alphabets. We formulate an optimization problem which is solved by standard non-linear convex constrained optimization algorithms, particularly by Nelder-Mead global optimization search, which is further refined by the local interior-pointsmethod.

  9. Computation of complexity measures of morphologically significant zones decomposed from binary fractal sets via multiscale convexity analysis

    International Nuclear Information System (INIS)

    Lim, Sin Liang; Koo, Voon Chet; Daya Sagar, B.S.

    2009-01-01

    Multiscale convexity analysis of certain fractal binary objects-like 8-segment Koch quadric, Koch triadic, and random Koch quadric and triadic islands-is performed via (i) morphologic openings with respect to recursively changing the size of a template, and (ii) construction of convex hulls through half-plane closings. Based on scale vs convexity measure relationship, transition levels between the morphologic regimes are determined as crossover scales. These crossover scales are taken as the basis to segment binary fractal objects into various morphologically prominent zones. Each segmented zone is characterized through normalized morphologic complexity measures. Despite the fact that there is no notably significant relationship between the zone-wise complexity measures and fractal dimensions computed by conventional box counting method, fractal objects-whether they are generated deterministically or by introducing randomness-possess morphologically significant sub-zones with varied degrees of spatial complexities. Classification of realistic fractal sets and/or fields according to sub-zones possessing varied degrees of spatial complexities provides insight to explore links with the physical processes involved in the formation of fractal-like phenomena.

  10. Frontcountry encounter norms among three cultures

    Science.gov (United States)

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

  11. Grip and Pinch Strength Norms for Michigan Workers

    Directory of Open Access Journals (Sweden)

    Joel M. Phillips M.S., OTRL

    2013-06-01

    Full Text Available The purpose of this study was to create a norm reference of current grip and pinch strength norms for working-age Michigan adults. This normative study included a convenience sample of 179 volunteers who were employees at car plants in South East Michigan or hospital sites in West Michigan. Participants’ ages ranged from between 20 and 62 years of age with a mean age of 49.15 years. There were 78 females (44% and 101 males (56%. Subjects were classified by gender and in the age categories of ages 20 to 49 years and ages 50-62 years. Grip and pinch strength norms were collected following the American Society of Hand Therapy protocol. The norms from these working adults were calculated with descriptive statistics for males and females in two age classifications: ages 20 to 49 and ages 50 to 62 years. Standard Errors (SE are better than the 1985 norms for both males and females ages 20 to 49 years. SEs are higher than the ages 20 to 49 years’ norms for the ages 50 to 62 years age categories in both males and females. These norms offer a point of comparison for clinicians to use for clients in Michigan who are ages 20 to 62 years and who have a goal to improve their grip strength. Clients’ grip and pinch strength could be compared to their age level or gender norms using the comparison for one standard deviation above, below, or at the means.

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

  13. Human rights – local value or universal norm?

    Directory of Open Access Journals (Sweden)

    Grigory Gutner

    2011-03-01

    Full Text Available The article argues for the universal character of human rights. It is demonstrated that they are not of specific value of Western culture but are a universal norm. This norm is valid not only for political practices but, first of all, for the morality and practice of argumentation. Human rights are strictly correlated with Kantian Categorical Imperative and can be substantiated by means of transcendental­pragmatic argument (K.­O. Apel. The difference between values and norms are also considered. It is demonstrated that values are always subjective and arbitrary meanwhile final justification is possible for norms.  

  14. Elastic energy of liquid crystals in convex polyhedra

    International Nuclear Information System (INIS)

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

    2004-01-01

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

  15. Feasibility of re-melting NORM-contaminated scrap metal

    Energy Technology Data Exchange (ETDEWEB)

    Winters, S. J.; Smith, K. P.

    1999-10-26

    Naturally occurring radioactive materials (NORM) sometimes accumulate inside pieces of equipment associated with oil and gas production and processing activities. Typically, the NORM accumulates when radium that is present in solution in produced water precipitates out in scale and sludge deposits. Scrap equipment containing residual quantities of these NORM-bearing scales and sludges can present a waste management problem if the radium concentrations exceed regulatory limits or activate the alarms on radiation screening devices installed at most scrap metal recycling facilities. Although NORM-contaminated scrap metal currently is not disposed of by re-melting, this form of recycling could present a viable disposition option for this waste stream. Studies indicate that re-melting NORM-contaminated scrap metal is a viable recycling option from a risk-based perspective. However, a myriad of economic, regulatory, and policy issues have caused the recyclers to turn away virtually all radioactive scrap metal. Until these issues can be resolved, re-melting of the petroleum industry's NORM-impacted scrap metal is unlikely to be a widespread practice. This paper summarizes the issues associated with re-melting radioactive scrap so that the petroleum industry and its regulators will understand the obstacles. This paper was prepared as part of a report being prepared by the Interstate Oil and Gas Compact Commission's NORM Subcommittee.

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

  17. Social Norms and Moral Hazard

    OpenAIRE

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

  18. Variation in reaction norms: Statistical considerations and biological interpretation.

    Science.gov (United States)

    Morrissey, Michael B; Liefting, Maartje

    2016-09-01

    Analysis of reaction norms, the functions by which the phenotype produced by a given genotype depends on the environment, is critical to studying many aspects of phenotypic evolution. Different techniques are available for quantifying different aspects of reaction norm variation. We examine what biological inferences can be drawn from some of the more readily applicable analyses for studying reaction norms. We adopt a strongly biologically motivated view, but draw on statistical theory to highlight strengths and drawbacks of different techniques. In particular, consideration of some formal statistical theory leads to revision of some recently, and forcefully, advocated opinions on reaction norm analysis. We clarify what simple analysis of the slope between mean phenotype in two environments can tell us about reaction norms, explore the conditions under which polynomial regression can provide robust inferences about reaction norm shape, and explore how different existing approaches may be used to draw inferences about variation in reaction norm shape. We show how mixed model-based approaches can provide more robust inferences than more commonly used multistep statistical approaches, and derive new metrics of the relative importance of variation in reaction norm intercepts, slopes, and curvatures. © 2016 The Author(s). Evolution © 2016 The Society for the Study of Evolution.

  19. Regulatory and management approaches to NORM residues in Malaysia

    International Nuclear Information System (INIS)

    Omar, M.; Teng, I.L.

    2006-01-01

    Naturally Occurring Radioactive Material (NORM) processing industries in Malaysia include oil and gas production and mineral processing plants. These industries are controlled by the Atomic Energy Licensing Board of Malaysia (AELB) through the enforcement of the Atomic Energy Licensing Act 1984 (Act 304). Related regulations have been developed in order to ensure the safety of workers and members of the public. However, more regulations are necessary for the safe handling of NORM. NORM processing generates various types of NORM residues that require proper management. As for low-level NORM residues, landfill disposal can be exempted from regulatory control if the Radiological Impact Assessment (RIA) shows that the additional dose to the members of the public is below the limit set by the authority. This paper outlines the regulatory and management approaches to NORM residues in Malaysia. (author)

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

  1. Fourth class of convex equilateral polyhedron with polyhedral symmetry related to fullerenes and viruses.

    Science.gov (United States)

    Schein, Stan; Gayed, James Maurice

    2014-02-25

    The three known classes of convex polyhedron with equal edge lengths and polyhedral symmetry--tetrahedral, octahedral, and icosahedral--are the 5 Platonic polyhedra, the 13 Archimedean polyhedra--including the truncated icosahedron or soccer ball--and the 2 rhombic polyhedra reported by Johannes Kepler in 1611. (Some carbon fullerenes, inorganic cages, icosahedral viruses, geodesic structures, and protein complexes resemble these fundamental shapes.) Here we add a fourth class, "Goldberg polyhedra," which are also convex and equilateral. We begin by decorating each of the triangular facets of a tetrahedron, an octahedron, or an icosahedron with the T vertices and connecting edges of a "Goldberg triangle." We obtain the unique set of internal angles in each planar face of each polyhedron by solving a system of n equations and n variables, where the equations set the dihedral angle discrepancy about different types of edge to zero, and the variables are a subset of the internal angles in 6gons. Like the faces in Kepler's rhombic polyhedra, the 6gon faces in Goldberg polyhedra are equilateral and planar but not equiangular. We show that there is just a single tetrahedral Goldberg polyhedron, a single octahedral one, and a systematic, countable infinity of icosahedral ones, one for each Goldberg triangle. Unlike carbon fullerenes and faceted viruses, the icosahedral Goldberg polyhedra are nearly spherical. The reasoning and techniques presented here will enable discovery of still more classes of convex equilateral polyhedra with polyhedral symmetry.

  2. Measurement of laser welding pool geometry using a closed convex active contour model

    International Nuclear Information System (INIS)

    Zheng, Rui; Zhang, Pu; Duan, Aiqing; Xiao, Peng

    2014-01-01

    The purpose of this study was to develop a computer vision method to measure geometric parameters of the weld pool in a deep penetration CO 2 laser welding system. Accurate measurement was achieved by removing a huge amount of interference caused by spatter, arc light and plasma to extract the true weld pool contour. This paper introduces a closed convex active contour (CCAC) model derived from the active contour model (snake model), which is a more robust high-level vision method than the traditional low-level vision methods. We made an improvement by integrating an active contour with the information that the weld pool contour is almost a closed convex curve. An effective thresholding method and an improved greedy algorithm are also given to complement the CCAC model. These influences can be effectively removed by using the CCAC model to acquire and measure the weld pool contour accurately and relatively fast. (paper)

  3. Reduction of shock induced noise in imperfectly expanded supersonic jets using convex optimization

    Science.gov (United States)

    Adhikari, Sam

    2007-11-01

    Imperfectly expanded jets generate screech noise. The imbalance between the backpressure and the exit pressure of the imperfectly expanded jets produce shock cells and expansion or compression waves from the nozzle. The instability waves and the shock cells interact to generate the screech sound. The mathematical model consists of cylindrical coordinate based full Navier-Stokes equations and large-eddy-simulation turbulence modeling. Analytical and computational analysis of the three-dimensional helical effects provide a model that relates several parameters with shock cell patterns, screech frequency and distribution of shock generation locations. Convex optimization techniques minimize the shock cell patterns and the instability waves. The objective functions are (convex) quadratic and the constraint functions are affine. In the quadratic optimization programs, minimization of the quadratic functions over a set of polyhedrons provides the optimal result. Various industry standard methods like regression analysis, distance between polyhedra, bounding variance, Markowitz optimization, and second order cone programming is used for Quadratic Optimization.

  4. Functional analysis and applied optimization in Banach spaces applications to non-convex variational models

    CERN Document Server

    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.

  5. A discussion on NORM guidelines: proposed revisions needed for practical use

    International Nuclear Information System (INIS)

    Chen, Jing

    2015-01-01

    International awareness of NORM as a potential source of radiation risk to workers, members of the public and the environment has increased significantly in recent years. NORM guidelines were originally developed for radiation management in NORM industries. However, the guidelines have been often consulted by many other industries not commonly considered as an NORM industry. In addition, with the increased awareness of NORM issues, more and more people have tried to apply NORM guidelines in many other situations related to NORM in the environment. The broad use of NORM guidelines out of the original scope has demonstrated the needs to revise the guidelines for practical use. These needs are discussed in the article. (authors)

  6. Monte Carlo modelling of large scale NORM sources using MCNP.

    Science.gov (United States)

    Wallace, J D

    2013-12-01

    The representative Monte Carlo modelling of large scale planar sources (for comparison to external environmental radiation fields) is undertaken using substantial diameter and thin profile planar cylindrical sources. The relative impact of source extent, soil thickness and sky-shine are investigated to guide decisions relating to representative geometries. In addition, the impact of source to detector distance on the nature of the detector response, for a range of source sizes, has been investigated. These investigations, using an MCNP based model, indicate a soil cylinder of greater than 20 m diameter and of no less than 50 cm depth/height, combined with a 20 m deep sky section above the soil cylinder, are needed to representatively model the semi-infinite plane of uniformly distributed NORM sources. Initial investigation of the effect of detector placement indicate that smaller source sizes may be used to achieve a representative response at shorter source to detector distances. Crown Copyright © 2013. Published by Elsevier Ltd. All rights reserved.

  7. Social Norms of Cooperation in Small-Scale Societies.

    Directory of Open Access Journals (Sweden)

    Fernando P Santos

    2016-01-01

    Full Text Available Indirect reciprocity, besides providing a convenient framework to address the evolution of moral systems, offers a simple and plausible explanation for the prevalence of cooperation among unrelated individuals. By helping someone, an individual may increase her/his reputation, which may change the pre-disposition of others to help her/him in the future. This, however, depends on what is reckoned as a good or a bad action, i.e., on the adopted social norm responsible for raising or damaging a reputation. In particular, it remains an open question which social norms are able to foster cooperation in small-scale societies, while enduring the wide plethora of stochastic affects inherent to finite populations. Here we address this problem by studying the stochastic dynamics of cooperation under distinct social norms, showing that the leading norms capable of promoting cooperation depend on the community size. However, only a single norm systematically leads to the highest cooperative standards in small communities. That simple norm dictates that only whoever cooperates with good individuals, and defects against bad ones, deserves a good reputation, a pattern that proves robust to errors, mutations and variations in the intensity of selection.

  8. Social Norms of Cooperation in Small-Scale Societies.

    Science.gov (United States)

    Santos, Fernando P; Santos, Francisco C; Pacheco, Jorge M

    2016-01-01

    Indirect reciprocity, besides providing a convenient framework to address the evolution of moral systems, offers a simple and plausible explanation for the prevalence of cooperation among unrelated individuals. By helping someone, an individual may increase her/his reputation, which may change the pre-disposition of others to help her/him in the future. This, however, depends on what is reckoned as a good or a bad action, i.e., on the adopted social norm responsible for raising or damaging a reputation. In particular, it remains an open question which social norms are able to foster cooperation in small-scale societies, while enduring the wide plethora of stochastic affects inherent to finite populations. Here we address this problem by studying the stochastic dynamics of cooperation under distinct social norms, showing that the leading norms capable of promoting cooperation depend on the community size. However, only a single norm systematically leads to the highest cooperative standards in small communities. That simple norm dictates that only whoever cooperates with good individuals, and defects against bad ones, deserves a good reputation, a pattern that proves robust to errors, mutations and variations in the intensity of selection.

  9. CLEX: A cross-linguistic lexical norms database

    DEFF Research Database (Denmark)

    Jørgensen, Rune Nørgaard; Dale, Philip; Bleses, Dorthe

    2009-01-01

    Parent report has proven a valid and cost-effective means of evaluating early child language. Norming datasets for these instruments, which provide the basis for standardized comparisons of individual children to a population, can also be used to derive norms for the acquisition of individual words...... in production and comprehension and also early gestures and symbolic actions. These lexical norms have a wide range of uses in basic research, assessment and intervention. In addition, crosslinguistic comparisons of lexical development are greatly facilitated by the availability of norms from diverse languages....... This report describes the development of CLEX, a new web-based cross-linguistic database for lexical data from adaptations of the MacArthur-Bates Communicative Development Inventories. CLEX provides tools for a range of analyses within and across languages. It is designed to incorporate additional language...

  10. A Sequential Convex Semidefinite Programming Algorithm for Multiple-Load Free Material Optimization

    Czech Academy of Sciences Publication Activity Database

    Stingl, M.; Kočvara, Michal; Leugering, G.

    2009-01-01

    Roč. 20, č. 1 (2009), s. 130-155 ISSN 1052-6234 R&D Projects: GA AV ČR IAA1075402 Grant - others:commision EU(XE) EU-FP6-30717 Institutional research plan: CEZ:AV0Z10750506 Keywords : structural optimization * material optimization * semidefinite programming * sequential convex programming Subject RIV: BA - General Mathematics Impact factor: 1.429, year: 2009

  11. Multiobjective optimization of classifiers by means of 3D convex-hull-based evolutionary algorithms

    NARCIS (Netherlands)

    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

  12. How preschoolers react to norm violations is associated with culture.

    Science.gov (United States)

    Gampe, Anja; Daum, Moritz M

    2018-01-01

    Children from the age of 3years understand social norms as such and enforce these norms in interactions with others. Differences in parental and institutional education across cultures make it likely that children receive divergent information about how to act in cases of norm violations. In the current study, we investigated whether cultural values are associated with the ways in which children react to norm violations. We tested 80 bicultural 3-year-olds with a norm enforcement paradigm and analyzed their reactions to norm violations. The reactions were correlated to the children's parental cultural values using the Global Leadership and Organizational Behavior Effectiveness (GLOBE) scales, and these results show that parental culture was associated with children's reactions to norm violations. The three strongest correlations were found for institutional collectivism, performance orientation, and assertiveness. Copyright © 2017 Elsevier Inc. All rights reserved.

  13. [Cleanliness Norms 1964-1975].

    Science.gov (United States)

    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

  14. Development and testing of the Youth Alcohol Norms Survey (YANS) instrument to measure youth alcohol norms and psychosocial influences.

    Science.gov (United States)

    Burns, Sharyn K; Maycock, Bruce; Hildebrand, Janina; Zhao, Yun; Allsop, Steve; Lobo, Roanna; Howat, Peter

    2018-05-14

    This study aimed to develop and validate an online instrument to: (1) identify common alcohol-related social influences, norms and beliefs among adolescents; (2) clarify the process and pathways through which proalcohol norms are transmitted to adolescents; (3) describe the characteristics of social connections that contribute to the transmission of alcohol norms; and (4) identify the influence of alcohol marketing on adolescent norm development. The online Youth Alcohol Norms Survey (YANS) was administered in secondary schools in Western Australia PARTICIPANTS: Using a 2-week test-retest format, the YANS was administered to secondary school students (n=481, age=13-17 years, female 309, 64.2%). The development of the YANS was guided by social cognitive theory and comprised a systematic multistage process including evaluation of content and face validity. A 2-week test-retest format was employed. Exploratory factor analysis was conducted to determine the underlying factor structure of the instrument. Test-retest reliability was examined using intraclass correlation coefficient (ICC) and Cohen's kappa. A five-factor structure with meaningful components and robust factorial loads was identified, and the five factors were labelled as 'individual attitudes and beliefs', 'peer and community identity', 'sibling influences', 'school and community connectedness' and 'injunctive norms', respectively. The instrument demonstrated stability across the test-retest procedure (ICC=0.68-0.88, Cohen's kappa coefficient=0.69) for most variables. The results support the reliability and factorial validity of this instrument. The YANS presents a promising tool, which enables comprehensive assessment of reciprocal individual, behavioural and environmental factors that influence alcohol-related norms among adolescents. © Article author(s) (or their employer(s) unless otherwise stated in the text of the article) 2018. All rights reserved. No commercial use is permitted unless otherwise

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

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

  17. The enhancement of social norm compliance: Prospects and caveats

    NARCIS (Netherlands)

    Civai, C.; Ma, I.

    2017-01-01

    Societies are characterized by a shared system of social norms, which promotes cooperation among people. However, following social norms often means going against self-interest - imagine, for example, being required to choose whether or not to get richer from an unfair deal; ignoring social norms,

  18. EXPERIMENTAL STUDY OF INFORMAL NORMS OF URBAN COLORISTICS

    Directory of Open Access Journals (Sweden)

    Yulia Alexandrowna Griber

    2017-02-01

    Full Text Available The objective of the study was informal social norms of urban culture. The paper contains the detailed description of the experimental situation and the main steps of the field research, focused on the observance of informal social norms in the sphere of urban coloristics. The experiment was conducted in three districts of Smolensk (Russia – Leninskiy, Zadneprovskiy and Promyshlennyy. Particular attention was paid to the analysis of the results of the field research, including evaluation of reaction of participants (residents of multi-storied houses, breakers of informal norms of urban coloristics (experimenters and casual experiment witnesses (neighbors and passersby. In addition, the accuracy of results “forecasting”, done before the beginning of the experiment, is analyzed. The research was conducted using the methodology of breaking experiment that is one of the most provocative ways of studying informal norms in sociology and social psychology. The experiment allowed to draw a number of important conclusions. It showed that urban coloristics is regulated by strict informal norms, that are not noticed by citizens until a violation occurs. The power of informal norms is significantly underestimated by citizens, and their break causes a negative reaction and protest. The most important contribution to the study of informal norms of urban culture was the comparison of the reaction degree by men and women, by the residents of different districts (central, residential or blue-collar neighborhoods, by different age groups.

  19. Annuity factors, duration and convexity : insights from a financial engineering perspective

    OpenAIRE

    Ekern, Steinar

    1998-01-01

    This paper applies a unified and integrative financial engineering perspective to key derived concepts in traditional fixed income analysis, with the purpose of enhancing conceptual insights and motivating computational applications. The emphasis on annuity factors and their impact on duration and convexity differs from the focus prevailing in related discussions. By decomposing the cashflow streams of a coupon bond into different, specific, and clearly defined portfolios of component bonds w...

  20. Multilayer Spectral Graph Clustering via Convex Layer Aggregation: Theory and Algorithms

    OpenAIRE

    Chen, Pin-Yu; Hero, Alfred O.

    2017-01-01

    Multilayer graphs are commonly used for representing different relations between entities and handling heterogeneous data processing tasks. Non-standard multilayer graph clustering methods are needed for assigning clusters to a common multilayer node set and for combining information from each layer. This paper presents a multilayer spectral graph clustering (SGC) framework that performs convex layer aggregation. Under a multilayer signal plus noise model, we provide a phase transition analys...

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

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

  3. Narrow CSF space at high convexity and high midline areas in idiopathic normal pressure hydrocephalus detected by axial and coronal MRI

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

  4. Narrow CSF space at high convexity and high midline areas in idiopathic normal pressure hydrocephalus detected by axial and coronal MRI

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

  5. Responsible Communication between the Judicial and Deontological Norm

    Directory of Open Access Journals (Sweden)

    Daniela Aurelia Popa

    2010-07-01

    Full Text Available Confronting with numerous problems related to moral judgment, the responsibility and irresponsibility in what concerns the vast domain of communication, we are interested in forming a correct and complete vision that crosses the judicial and deontological domain of the profession. The deontological norms are meant to guarantee, by their freely consented acceptance, the good fulfillment of the mission of the journalists, recognized as being indispensable for the god functioning of any human society. The laws do not expressly refer to the deontological norms, but these norms exist according to the law order and are necessary for its guarantee in this social context, which is chaotic from the point of view of the legislation in communication. The aspects analyzed here aremeant to indicate the manner in which passing from deontological norm to the judicial norm creates an external constraint for the communicator which brings more responsibility in view of avoiding the journalistic conflicts.

  6. Operator’s Fuzzy Norm and Some Properties

    OpenAIRE

    Bag, T.; Samanta, S.K.

    2015-01-01

    In this paper, a concept of operator’s fuzzy norm is introduced for the first time in general t-norm setting. Ideas of fuzzy continuous operators, fuzzy bounded linear operators are given with some properties of such operators studied in this general setting.

  7. Multi-Period Trading via Convex Optimization

    DEFF Research Database (Denmark)

    Boyd, Stephen; Busseti, Enzo; Diamond, Steve

    2017-01-01

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

  8. Professional norms, public service motivation and economic incentives

    DEFF Research Database (Denmark)

    Andersen, Lotte Bøgh

    2007-01-01

    The theories of professions, public service motivation, and economic incentives explain the behaviour of the producers of publicly financed services differently. They emphasize professional norms, sector, and economic incentives, respectively. The few existing attempts to integrate these theories...... have, however, indicated that these factors interact. Using interviews, surveys and registers, the paper investigated how professional norms, economic incentives and sector affected the behaviour of Danish dentists and physicians. It was found that when strong professional norms existed, economic...... incentives were unimportant for both public and private employees. In contrast, when no firm professional norm applied, economic incentives affected behaviour. Controlling for different economic incentives, sector does not seem to affect the behaviour much. The results imply that the economic...

  9. Peer punishment promotes enforcement of bad social norms.

    Science.gov (United States)

    Abbink, Klaus; Gangadharan, Lata; Handfield, Toby; Thrasher, John

    2017-09-20

    Social norms are an important element in explaining how humans achieve very high levels of cooperative activity. It is widely observed that, when norms can be enforced by peer punishment, groups are able to resolve social dilemmas in prosocial, cooperative ways. Here we show that punishment can also encourage participation in destructive behaviours that are harmful to group welfare, and that this phenomenon is mediated by a social norm. In a variation of a public goods game, in which the return to investment is negative for both group and individual, we find that the opportunity to punish led to higher levels of contribution, thereby harming collective payoffs. A second experiment confirmed that, independently of whether punishment is available, a majority of subjects regard the efficient behaviour of non-contribution as socially inappropriate. The results show that simply providing a punishment opportunity does not guarantee that punishment will be used for socially beneficial ends, because the social norms that influence punishment behaviour may themselves be destructive.Punishment by peers can enforce social norms, such as contributing to a public good. Here, Abbink and colleagues show that individuals will enforce norms even when contributions reduce the net benefit of the group, resulting in the maintenance of wasteful contributions.

  10. Parameter sensitivity study of a Field II multilayer transducer model on a convex transducer

    DEFF Research Database (Denmark)

    Bæk, David; Jensen, Jørgen Arendt; Willatzen, Morten

    2009-01-01

    A multilayer transducer model for predicting a transducer impulse response has in earlier works been developed and combined with the Field II software. This development was tested on current, voltage, and intensity measurements on piezoceramics discs (Bæk et al. IUS 2008) and a convex 128 element...... ultrasound imaging transducer (Bæk et al. ICU 2009). The model benefits from its 1D simplicity and hasshown to give an amplitude error around 1.7‐2 dB. However, any prediction of amplitude, phase, and attenuation of pulses relies on the accuracy of manufacturer supplied material characteristics, which may...... is a quantitative calibrated model for a complete ultrasound system. This includes a sensitivity study aspresented here.Statement of Contribution/MethodsThe study alters 35 different model parameters which describe a 128 element convex transducer from BK Medical Aps. The changes are within ±20 % of the values...

  11. Surface tension-induced high aspect-ratio PDMS micropillars with concave and convex lens tips

    KAUST Repository

    Li, Huawei; Fan, Yiqiang; Yi, Ying; Foulds, Ian G.

    2013-01-01

    This paper reports a novel method for the fabrication of 3-dimensional (3D) Polydimethylsiloxane (PDMS) micropillars with concave and convex lens tips in a one-step molding process, using a CO2 laser-machined Poly(methyl methacrylate) (PMMA) mold with through holes. The PDMS micropillars are 4 mm high and have an aspect ratio of 251. The micropillars are formed by capillary force drawing up PDMS into the through hole mold. The concave and convex lens tips of the PDMS cylindrical micropillars are induced by surface tension and are controllable by changing the surface wetting properties of the through holes in the PMMA mold. This technique eliminates the requirements of expensive and complicated facilities to prepare a 3D mold, and it provides a simple and rapid method to fabricate 3D PDMS micropillars with controllable dimensions and tip shapes. © 2013 IEEE.

  12. Surface tension-induced high aspect-ratio PDMS micropillars with concave and convex lens tips

    KAUST Repository

    Li, Huawei

    2013-04-01

    This paper reports a novel method for the fabrication of 3-dimensional (3D) Polydimethylsiloxane (PDMS) micropillars with concave and convex lens tips in a one-step molding process, using a CO2 laser-machined Poly(methyl methacrylate) (PMMA) mold with through holes. The PDMS micropillars are 4 mm high and have an aspect ratio of 251. The micropillars are formed by capillary force drawing up PDMS into the through hole mold. The concave and convex lens tips of the PDMS cylindrical micropillars are induced by surface tension and are controllable by changing the surface wetting properties of the through holes in the PMMA mold. This technique eliminates the requirements of expensive and complicated facilities to prepare a 3D mold, and it provides a simple and rapid method to fabricate 3D PDMS micropillars with controllable dimensions and tip shapes. © 2013 IEEE.

  13. Sufficient Descent Conjugate Gradient Methods for Solving Convex Constrained Nonlinear Monotone Equations

    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.

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

  15. Full waveform inversion using envelope-based global correlation norm

    Science.gov (United States)

    Oh, Ju-Won; Alkhalifah, Tariq

    2018-05-01

    To increase the feasibility of full waveform inversion on real data, we suggest a new objective function, which is defined as the global correlation of the envelopes of modelled and observed data. The envelope-based global correlation norm has the advantage of the envelope inversion that generates artificial low-frequency information, which provides the possibility to recover long-wavelength structure in an early stage. In addition, the envelope-based global correlation norm maintains the advantage of the global correlation norm, which reduces the sensitivity of the misfit to amplitude errors so that the performance of inversion on real data can be enhanced when the exact source wavelet is not available and more complex physics are ignored. Through the synthetic example for 2-D SEG/EAGE overthrust model with inaccurate source wavelet, we compare the performance of four different approaches, which are the least-squares waveform inversion, least-squares envelope inversion, global correlation norm and envelope-based global correlation norm. Finally, we apply the envelope-based global correlation norm on the 3-D Ocean Bottom Cable (OBC) data from the North Sea. The envelope-based global correlation norm captures the strong reflections from the high-velocity caprock and generates artificial low-frequency reflection energy that helps us recover long-wavelength structure of the model domain in the early stages. From this long-wavelength model, the conventional global correlation norm is sequentially applied to invert for higher-resolution features of the model.

  16. Changing Gender Norms and Marriage Dynamics in the United States.

    Science.gov (United States)

    Pessin, Léa

    2018-02-01

    Using a regional measure of gender norms from the General Social Surveys together with marital histories from the Panel Study of Income Dynamics, this study explored how gender norms were associated with women's marriage dynamics between 1968 and 2012. Results suggested that a higher prevalence of egalitarian gender norms predicted a decline in marriage formation. This decline was, however, only true for women without a college degree. For college-educated women, the association between gender norms and marriage formation became positive when gender egalitarianism prevailed. The findings also revealed an inverted U-shaped relationship between gender norms and divorce: an initial increase in divorce was observed when gender norms were predominantly traditional. The association, however, reversed as gender norms became egalitarian. No differences by education were found for divorce. The findings partially support the gender revolution framework but also highlight greater barriers to marriage for low-educated women as societies embrace gender equality.

  17. The impact of insecticide-treated school uniforms on dengue infections in school-aged children: study protocol for a randomised controlled trial in Thailand.

    Science.gov (United States)

    Wilder-Smith, Annelies; Byass, Peter; Olanratmanee, Phanthip; Maskhao, Pongsri; Sringernyuang, Luechai; Logan, James G; Lindsay, Steve W; Banks, Sarah; Gubler, Duane; Louis, Valérie R; Tozan, Yesim; Kittayapong, Pattamaporn

    2012-11-15

    There is an urgent need to protect children against dengue since this age group is particularly sensitive to the disease. Since dengue vectors are active mainly during the day, a potential target for control should be schools where children spend a considerable amount of their day. School uniforms are the cultural norm in most developing countries, worn throughout the day. We hypothesise that insecticide-treated school uniforms will reduce the incidence of dengue infection in school-aged children. Our objective is to determine the impact of impregnated school uniforms on dengue incidence. A randomised controlled trial will be conducted in eastern Thailand in a group of schools with approximately 2,000 students aged 7-18 years. Pre-fabricated school uniforms will be commercially treated to ensure consistent, high-quality insecticide impregnation with permethrin. A double-blind, randomised, crossover trial at the school level will cover two dengue transmission seasons. Practical issues and plans concerning intervention implementation, evaluation, analysing and interpreting the data, and possible policy implications arising from the trial are discussed. clinicaltrial.gov. NCT01563640.

  18. Do social norms affect intended food choice?

    Science.gov (United States)

    Croker, H; Whitaker, K L; Cooke, L; Wardle, J

    2009-01-01

    To evaluate the effect of social norms on intended fruit and vegetable intake. A two-stage design to i) compare the perceived importance of normative influences vs cost and health on dietary choices, and ii) test the prediction that providing information on social norms will increase intended fruit and vegetable consumption in an experimental study. Home-based interviews (N=1083; 46% men, 54% women) were carried out as part of the Office for National Statistics Omnibus Survey in November 2008. The public's perception of the importance of social norms was lower (M=2.1) than the perceived importance of cost (M=2.7) or health (M=3.4) (all p'scost information; none of the interventions affected women's intentions. People have little awareness of the influence of social norms but normative information can have a demonstrable impact on dietary intentions. Health promotion might profit from emphasising how many people are attempting to adopt healthy lifestyles rather than how many have poor diets.

  19. Mean anisotropy of homogeneous Gaussian random fields and anisotropic norms of linear translation-invariant operators on multidimensional integer lattices

    Directory of Open Access Journals (Sweden)

    Phil Diamond

    2003-01-01

    Full Text Available Sensitivity of output of a linear operator to its input can be quantified in various ways. In Control Theory, the input is usually interpreted as disturbance and the output is to be minimized in some sense. In stochastic worst-case design settings, the disturbance is considered random with imprecisely known probability distribution. The prior set of probability measures can be chosen so as to quantify how far the disturbance deviates from the white-noise hypothesis of Linear Quadratic Gaussian control. Such deviation can be measured by the minimal Kullback-Leibler informational divergence from the Gaussian distributions with zero mean and scalar covariance matrices. The resulting anisotropy functional is defined for finite power random vectors. Originally, anisotropy was introduced for directionally generic random vectors as the relative entropy of the normalized vector with respect to the uniform distribution on the unit sphere. The associated a-anisotropic norm of a matrix is then its maximum root mean square or average energy gain with respect to finite power or directionally generic inputs whose anisotropy is bounded above by a≥0. We give a systematic comparison of the anisotropy functionals and the associated norms. These are considered for unboundedly growing fragments of homogeneous Gaussian random fields on multidimensional integer lattice to yield mean anisotropy. Correspondingly, the anisotropic norms of finite matrices are extended to bounded linear translation invariant operators over such fields.

  20. Unifying kinetic approach to phoretic forces and torques onto moving and rotating convex particles

    NARCIS (Netherlands)

    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.