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.
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....
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...
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...
Transient disturbance growth in flows over convex surfaces
Karp, Michael; Hack, M. J. Philipp
2017-11-01
Flows over curved surfaces occur in a wide range of applications including airfoils, compressor and turbine vanes as well as aerial, naval and ground vehicles. In most of these applications the surface has convex curvature, while concave surfaces are less common. Since monotonic boundary-layer flows over convex surfaces are exponentially stable, they have received considerably less attention than flows over concave walls which are destabilized by centrifugal forces. Non-modal mechanisms may nonetheless enable significant disturbance growth which can make the flow susceptible to secondary instabilities. A parametric investigation of the transient growth and secondary instability of flows over convex surfaces is performed. The specific conditions yielding the maximal transient growth and strongest instability are identified. The effect of wall-normal and spanwise inflection points on the instability process is discussed. Finally, the role and significance of additional parameters, such as the geometry and pressure gradient, is analyzed.
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....
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
Corrow, Sherryse L; Mathison, Jordan; Granrud, Carl E; Yonas, Albert
2014-01-01
Corrow, Granrud, Mathison, and Yonas (2011, Perception, 40, 1376-1383) found evidence that 6-month-old infants perceive the hollow face illusion. In the present study we asked whether 6-month-old infants perceive illusory depth reversal for a nonface object and whether infants' perception of the hollow face illusion is affected by mask orientation inversion. In experiment 1 infants viewed a concave bowl, and their reaches were recorded under monocular and binocular viewing conditions. Infants reached to the bowl as if it were convex significantly more often in the monocular than in the binocular viewing condition. These results suggest that infants perceive illusory depth reversal with a nonface stimulus and that the infant visual system has a bias to perceive objects as convex. Infants in experiment 2 viewed a concave face-like mask in upright and inverted orientations. Infants reached to the display as if it were convex more in the monocular than in the binocular condition; however, mask orientation had no effect on reaching. Previous findings that adults' perception of the hollow face illusion is affected by mask orientation inversion have been interpreted as evidence of stored-knowledge influences on perception. However, we found no evidence of such influences in infants, suggesting that their perception of this illusion may not be affected by stored knowledge, and that perceived depth reversal is not face-specific in infants.
Surface tension-induced high aspect-ratio PDMS micropillars with concave and convex lens tips
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.
Surface tension-induced high aspect-ratio PDMS micropillars with concave and convex lens tips
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.
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.
Energy Technology Data Exchange (ETDEWEB)
Kibar, Ali, E-mail: alikibar@kocaeli.edu.tr [Department of Mechanical and Material Technologies, Kocaeli University, Arslanbey Campus, 41285, Kocaeli (Turkey)
2017-02-15
Experiments and numerical simulations were carried out to examine the vertical impingement a round liquid jet on the edges of horizontal convex surfaces that were either superhydrophobic or hydrophobic. The experiments examine the effects on the flow behaviour of curvature, wettability, inertia of the jet, and the impingement rate. Three copper pipes with outer diameters of 15, 22, and 35 mm were investigated. The pipes were wrapped with a piece of a Brassica oleracea leaf or a smooth Teflon sheet, which have apparent contact angles of 160° and 113°. The Reynolds number ranged from 1000 to 4500, and the impingement rates of the liquid jets were varied. Numerical results show good agreement with the experimental results for explaining flow and provide detailed information about the impingement on the surfaces. The liquid jet reflected off the superhydrophobic surfaces for all conditions. However, the jet reflected or deflected off the hydrophobic surface, depending on the inertia of the jet, the curvature of the surface, and the impingement rate. The results suggest that pressure is not the main reason for the bending of the jet around the curved hydrophobic surface. (paper)
International Nuclear Information System (INIS)
Kibar, Ali
2017-01-01
Experiments and numerical simulations were carried out to examine the vertical impingement a round liquid jet on the edges of horizontal convex surfaces that were either superhydrophobic or hydrophobic. The experiments examine the effects on the flow behaviour of curvature, wettability, inertia of the jet, and the impingement rate. Three copper pipes with outer diameters of 15, 22, and 35 mm were investigated. The pipes were wrapped with a piece of a Brassica oleracea leaf or a smooth Teflon sheet, which have apparent contact angles of 160° and 113°. The Reynolds number ranged from 1000 to 4500, and the impingement rates of the liquid jets were varied. Numerical results show good agreement with the experimental results for explaining flow and provide detailed information about the impingement on the surfaces. The liquid jet reflected off the superhydrophobic surfaces for all conditions. However, the jet reflected or deflected off the hydrophobic surface, depending on the inertia of the jet, the curvature of the surface, and the impingement rate. The results suggest that pressure is not the main reason for the bending of the jet around the curved hydrophobic surface. (paper)
Study on mechanics of driving drum with superelastic convexity surface covering-layer structure
Energy Technology Data Exchange (ETDEWEB)
Xiao, L.J.; Sui, X.H.; Miao, D.J. [Shandong University of Science & Technology, Qingdao (China)
2008-09-15
Belt conveyor is one of the main transport equipment in coal mine and the driving drum is its key part. With the method of bionic design, the mushroom morphological structure is applied to the design of covering-layer structure of driving drum surface of belt conveyor. Superelastic rubber with large deformation is adopted as the covering-layer material. Nonlinear constitutive model of rubber, which is of superelasticity and large deformation, is established. The stress states and deformation principles of driving drums including both bionic covering-layer and common covering-layer are obtained by static intensity analysis with Finite Element Analysis (FEA) software ANSYS. The values of the stress and strain on the driving drum surface are gotten and the dangerous area is determined. FEA results show that the superelastic convexity surface structure can enlarge the contact area between the driving drum and viscoelastic belt. The results also show that in comparison with common driving drum, the bionic surface driving drum can not only increase the friction coefficient between drum and belt but also prolong its service life.
DEFF Research Database (Denmark)
M. Gaspar, Raquel; Murgoci, Agatha
2010-01-01
A convexity adjustment (or convexity correction) in fixed income markets arises when one uses prices of standard (plain vanilla) products plus an adjustment to price nonstandard products. We explain the basic and appealing idea behind the use of convexity adjustments and focus on the situations...
DEFF Research Database (Denmark)
Lauritzen, Niels
-Motzkin elimination, the theory is developed by introducing polyhedra, the double description method and the simplex algorithm, closed convex subsets, convex functions of one and several variables ending with a chapter on convex optimization with the Karush-Kuhn-Tucker conditions, duality and an interior point......Based on undergraduate teaching to students in computer science, economics and mathematics at Aarhus University, this is an elementary introduction to convex sets and convex functions with emphasis on concrete computations and examples. Starting from linear inequalities and Fourier...
DEFF Research Database (Denmark)
Lauritzen, Niels
Based on undergraduate teaching to students in computer science, economics and mathematics at Aarhus University, this is an elementary introduction to convex sets and convex functions with emphasis on concrete computations and examples. Starting from linear inequalities and Fourier-Motzkin elimin......Based on undergraduate teaching to students in computer science, economics and mathematics at Aarhus University, this is an elementary introduction to convex sets and convex functions with emphasis on concrete computations and examples. Starting from linear inequalities and Fourier......-Motzkin elimination, the theory is developed by introducing polyhedra, the double description method and the simplex algorithm, closed convex subsets, convex functions of one and several variables ending with a chapter on convex optimization with the Karush-Kuhn-Tucker conditions, duality and an interior point...... algorithm....
The TMS-1 corneal topography measurement applied to calibrated ellipsoidal convex surfaces.
Douthwaite, W A; Matilla, M T
1996-03-01
The purpose of this report is to assess the accuracy of the TMS-1 videokeratoscope (Computed Anatomy Inc.) by using convex ellipsoidal surfaces. The ellipsoids were calibrated using Form Talysurf analysis, which allowed for subsequent calculation of the vertex radius and p value. The videokeratoscope was used to examine the same ellipsoids. The data provided by the instrument software were used to plot a graph of r2 verses y2, where r is the measured radius at y, the distance from the corneal point being measured to the optical axis of the instrument. The intercept on the ordinate of this graph gives the vertex radius, and the slope give the p value. The results arising from the Talysurf and the TMS-1 techniques were compared. The TMS-1 videokeratoscope gave readings for the vertex radius that were generally higher than those of the Talysurf analysis. The vertex radius was up to 0.09 mm greater. The p value results were similar by the two methods for p values of approximately 0.8; however, the TMS-1 results were higher, and the discrepancy increased as the p value approached that of a paraboloid. Although the videokeratoscope may be useful in comparative studies of the cornea, there must be some doubt about the absolute values displayed as the surface becomes increasingly aspheric.
Advanced Face Gear Surface Durability Evaluations
Lewicki, David G.; Heath, Gregory F.
2016-01-01
The surface durability life of helical face gears and isotropic super-finished (ISF) face gears was investigated. Experimental fatigue tests were performed at the NASA Glenn Research Center. Endurance tests were performed on 10 sets of helical face gears in mesh with tapered involute helical pinions, and 10 sets of ISF-enhanced straight face gears in mesh with tapered involute spur pinions. The results were compared to previous tests on straight face gears. The life of the ISF configuration was slightly less than that of previous tests on straight face gears. The life of the ISF configuration was slightly greater than that of the helical configuration.
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
Martel, S. J.
2008-12-01
The formation of sheeting joints has been an outstanding problem in geology. New observations and analyses indicate that sheeting joints develop in response to a near-surface tension induced by compressive stresses parallel to a convex slope (hypothesis 1) rather than by removal of overburden by erosion, as conventionally assumed (hypothesis 2). Opening mode displacements across the joints together with the absence of mineral precipitates within the joints mean that sheeting joints open in response to a near-surface tension normal to the surface rather than a pressurized fluid. Consideration of a plot of this tensile stress as a function of depth normal to the surface reveals that a true tension must arise in the shallow subsurface if the rate of that tensile stress change with depth is positive at the surface. Static equilibrium requires this rate (derivative) to equal P22 k2 + P33 k3 - ρ g cosβ, where k2 and k3 are the principal curvatures of the surface, P22 and P33 are the respective surface- parallel normal stresses along the principal curvatures, ρ is the material density, g is gravitational acceleration, and β is the slope. This derivative will be positive and sheeting joints can open if at least one principal curvature is sufficiently convex (negative) and the surface-parallel stresses are sufficiently compressive (negative). At several sites with sheeting joints (e.g., Yosemite National Park in California), the measured topographic curvatures and the measured surface-parallel stresses of about -10 MPa combine to meet this condition. In apparent violation of hypothesis 1, sheeting joints occur locally at the bottom of Tenaya Canyon, one of the deepest glaciated, U-shaped (concave) canyons in the park. The canyon-bottom sheeting joints only occur, however, where the canyon is convex downstream, a direction that nearly coincides with direction of the most compressive stress measured in the vicinity. The most compressive stress acting along the convex
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...
A Combination Theorem for Convex Hyperbolic Manifolds, with Applications to Surfaces in 3-Manifolds
Baker, Mark; Cooper, Daryl
2005-01-01
We prove the convex combination theorem for hyperbolic n-manifolds. Applications are given both in high dimensions and in 3 dimensions. One consequence is that given two geometrically finite subgroups of a discrete group of isometries of hyperbolic n-space, satisfying a natural condition on their parabolic subgroups, there are finite index subgroups which generate a subgroup that is an amalgamated free product. Constructions of infinite volume hyperbolic n-manifolds are described by gluing lo...
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.
Baker, Paul A.; Thompson, Raymond G.; Catledge, Shane A.
2015-01-01
Using microwave-plasma Chemical Vapor Deposition (CVD), a 3-micron thick nanostructured-diamond (NSD) layer was deposited onto polished, convex and concave components that were machined from Ti-6Al-4V alloy. These components had the same radius of curvature, 25.4mm. Wear testing of the surfaces was performed by rotating articulation of the diamond-deposited surfaces (diamond-on-diamond) with a load of 225N for a total of 5 million cycles in bovine serum resulting in polishing of the diamond surface and formation of very shallow, linear wear grooves of less than 50nm depth. The two diamond surfaces remained adhered to the components and polished each other to an average surface roughness that was reduced by as much as a factor of 80 for the most polished region located at the center of the condyle. Imaging of the surfaces showed that the initial wearing-in phase of diamond was only beginning at the end of the 5 million cycles. Atomic force microscopy, scanning electron microscopy, Raman spectroscopy, and surface profilometry were used to characterize the surfaces and verify that the diamond remained intact and uniform over the surface, thereby protecting the underlying metal. These wear simulation results show that diamond deposition on Ti alloy has potential application for joint replacement devices with improved longevity over existing devices made of cobalt chrome and ultra-high molecular weight polyethylene (UHMWPE). PMID:26989457
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...
On Convex Quadratic Approximation
den Hertog, D.; de Klerk, E.; Roos, J.
2000-01-01
In this paper we prove the counterintuitive result that the quadratic least squares approximation of a multivariate convex function in a finite set of points is not necessarily convex, even though it is convex for a univariate convex function. This result has many consequences both for the field of
Scott, Paul
2006-01-01
A "convex" polygon is one with no re-entrant angles. Alternatively one can use the standard convexity definition, asserting that for any two points of the convex polygon, the line segment joining them is contained completely within the polygon. In this article, the author provides a solution to a problem involving convex lattice polygons.
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.
Face recognition based on depth maps and surface curvature
Gordon, Gaile G.
1991-09-01
This paper explores the representation of the human face by features based on the curvature of the face surface. Curature captures many features necessary to accurately describe the face, such as the shape of the forehead, jawline, and cheeks, which are not easily detected from standard intensity images. Moreover, the value of curvature at a point on the surface is also viewpoint invariant. Until recently range data of high enough resolution and accuracy to perform useful curvature calculations on the scale of the human face had been unavailable. Although several researchers have worked on the problem of interpreting range data from curved (although usually highly geometrically structured) surfaces, the main approaches have centered on segmentation by signs of mean and Gaussian curvature which have not proved sufficient in themselves for the case of the human face. This paper details the calculation of principal curvature for a particular data set, the calculation of general surface descriptors based on curvature, and the calculation of face specific descriptors based both on curvature features and a priori knowledge about the structure of the face. These face specific descriptors can be incorporated into many different recognition strategies. A system that implements one such strategy, depth template comparison, giving recognition rates between 80% and 90% is described.
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.)
International Nuclear Information System (INIS)
Chavet, I.
1987-01-01
A plasma source fitted with a circular orifice and emitting a space charge limited ion current can be made to operate with a convex spherical plasma boundary (meniscus) by appropriately adjusting its extraction parameters. In this case, the diameter of the virtual source behind the meniscus is much smaller than the orifice diameter. The effective value of this virtual source diameter depends significantly on various practical factors that are more or less controllable. Its lower ideal limit, however, depends only on the radio δ of the interelectrode distance to the meniscus curvature radius and on the ratio ω of the initial to final ion energy. This ideal limit is given for the ranges 0.1 ≤ δ ≤ 10 and 10 -7 ≤ ω ≤ 10 -3 . Preliminary experimental results are reported. (orig.)
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.
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
Convexity and Marginal Vectors
van Velzen, S.; Hamers, H.J.M.; Norde, H.W.
2002-01-01
In this paper we construct sets of marginal vectors of a TU game with the property that if the marginal vectors from these sets are core elements, then the game is convex.This approach leads to new upperbounds on the number of marginal vectors needed to characterize convexity.An other result is that
Alparslan-Gok, S.Z.; Brânzei, R.; Tijs, S.H.
2008-01-01
In this paper, convex interval games are introduced and some characterizations are given. Some economic situations leading to convex interval games are discussed. The Weber set and the Shapley value are defined for a suitable class of interval games and their relations with the interval core for
GRINDING OF SURFACES WITH COATINGS FORMED BY ELECTROMAGNETIC FACING WITH SURFACE PLASTIC DEFORMATION
Directory of Open Access Journals (Sweden)
Zh. A. Mrochek
2011-01-01
Full Text Available The paper presents investigation results on machining of surfaces having a coating formed by electromagnetic facing with surface plastic deformation and using abrasive and diamond wheels having a porous metal binder with orientated drains.
Plasma facing surface composition during NSTX Li experiments
Energy Technology Data Exchange (ETDEWEB)
Skinner, C.H., E-mail: cskinner@pppl.gov [Princeton Plasma Physics Laboratory, POB 451, Princeton, NJ 08543 (United States); Sullenberger, R. [Department of Mechanical and Aerospace Engineering, Princeton University, NJ 08540 (United States); Koel, B.E. [Department of Chemical and Biological Engineering, Princeton University, NJ 08540 (United States); Jaworski, M.A.; Kugel, H.W. [Princeton Plasma Physics Laboratory, POB 451, Princeton, NJ 08543 (United States)
2013-07-15
Lithium conditioned plasma facing surfaces have lowered recycling and enhanced plasma performance on many fusion devices. However, the nature of the plasma–lithium surface interaction has been obscured by the difficulty of in-tokamak surface analysis. We report laboratory studies of the chemical composition of lithium surfaces exposed to typical residual gases found in tokamaks. Solid lithium and a molybdenum alloy (TZM) coated with lithium have been examined using X-ray photoelectron spectroscopy, temperature programmed desorption, and Auger electron spectroscopy both in ultrahigh vacuum conditions and after exposure to trace gases. Lithium surfaces near room temperature were oxidized after exposure to 1–2 Langmuirs of oxygen or water vapor. The oxidation rate by carbon monoxide was four times less. Lithiated PFC surfaces in tokamaks will be oxidized in about 100 s depending on the tokamak vacuum conditions.
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....
Stereotype locally convex spaces
International Nuclear Information System (INIS)
Akbarov, S S
2000-01-01
We give complete proofs of some previously announced results in the theory of stereotype (that is, reflexive in the sense of Pontryagin duality) locally convex spaces. These spaces have important applications in topological algebra and functional analysis
Stereotype locally convex spaces
Energy Technology Data Exchange (ETDEWEB)
Akbarov, S S
2000-08-31
We give complete proofs of some previously announced results in the theory of stereotype (that is, reflexive in the sense of Pontryagin duality) locally convex spaces. These spaces have important applications in topological algebra and functional analysis.
Stereotype locally convex spaces
Akbarov, S. S.
2000-08-01
We give complete proofs of some previously announced results in the theory of stereotype (that is, reflexive in the sense of Pontryagin duality) locally convex spaces. These spaces have important applications in topological algebra and functional analysis.
Generalized Convexity and Inequalities
Anderson, G. D.; Vamanamurthy, M. K.; Vuorinen, M.
2007-01-01
Let R+ = (0,infinity) and let M be the family of all mean values of two numbers in R+ (some examples are the arithmetic, geometric, and harmonic means). Given m1, m2 in M, we say that a function f : R+ to R+ is (m1,m2)-convex if f(m1(x,y)) < or = m2(f(x),f(y)) for all x, y in R+ . The usual convexity is the special case when both mean values are arithmetic means. We study the dependence of (m1,m2)-convexity on m1 and m2 and give sufficient conditions for (m1,m2)-convexity of functions defined...
Tritium saturation in plasma-facing materials surfaces
International Nuclear Information System (INIS)
Longhurst, G.R.; Anderl, R.A.; Pawelko, R.J.; Causey, R.A.; Federici, G.; Haasz, A.A.
1998-01-01
Plasma-facing components in the international thermonuclear experimental reactor (ITER) will experience high heat loads and intense plasma fluxes of order 10 20 -10 23 particles/m 2 s. Experiments on Be and W, two of the materials considered for use in ITER, have revealed that a tritium saturation phenomenon can take place under these conditions in which damage to the surface results that enhances the return of implanted tritium to the plasma and inhibits uptake of tritium. This phenomenon is important because it implies that tritium inventories due to implantation in these plasma-facing materials will probably be lower than was previously estimated using classical recombination-limited release at the plasma surface. Similarly, permeation through these components to the coolant streams should be reduced. In this paper we discuss evidences for the existence of this phenomenon, describe techniques for modeling it, and present results of the application of such modeling to prior experiments. (orig.)
DEFF Research Database (Denmark)
Brodal, Gerth Stølfting; Jacob, Rico
2002-01-01
In this paper we determine the computational complexity of the dynamic convex hull problem in the planar case. We present a data structure that maintains a finite set of n points in the plane under insertion and deletion of points in amortized O(log n) time per operation. The space usage of the d......In this paper we determine the computational complexity of the dynamic convex hull problem in the planar case. We present a data structure that maintains a finite set of n points in the plane under insertion and deletion of points in amortized O(log n) time per operation. The space usage...... of the data structure is O(n). The data structure supports extreme point queries in a given direction, tangent queries through a given point, and queries for the neighboring points on the convex hull in O(log n) time. The extreme point queries can be used to decide whether or not a given line intersects...... the convex hull, and the tangent queries to determine whether a given point is inside the convex hull. We give a lower bound on the amortized asymptotic time complexity that matches the performance of this data structure....
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...
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.
Surface temperature measurement of plasma facing components in tokamaks
International Nuclear Information System (INIS)
Amiel, Stephane
2014-01-01
During this PhD, the challenges on the non-intrusive surface temperature measurements of metallic plasma facing components in tokamaks are reported. Indeed, a precise material emissivity value is needed for classical infrared methods and the environment contribution has to be known particularly for low emissivities materials. Although methods have been developed to overcome these issues, they have been implemented solely for dedicated experiments. In any case, none of these methods are suitable for surface temperature measurement in tokamaks.The active pyrometry introduced in this study allows surface temperature measurements independently of reflected flux and emissivities using pulsed and modulated photothermal effect. This method has been validated in laboratory on metallic materials with reflected fluxes for pulsed and modulated modes. This experimental validation is coupled with a surface temperature variation induced by photothermal effect and temporal signal evolvement modelling in order to optimize both the heating source characteristics and the data acquisition and treatment. The experimental results have been used to determine the application range in temperature and detection wavelengths. In this context, the design of an active pyrometry system on tokamak has been completed, based on a bicolor camera for a thermography application in metallic (or low emissivity) environment.The active pyrometry method introduced in this study is a complementary technique of classical infrared methods used for thermography in tokamak environment which allows performing local and 2D surface temperature measurements independently of reflected fluxes and emissivities. (author) [fr
Surface relaxation and surface energy of face –centered Cubic ...
African Journals Online (AJOL)
DR. MIKE HORSFALL
Surface relaxation and surface energy of face –centered Cubic metals. 1AGHEMENLO H E; *2IYAYI, S E; 3AVWIRI ,G O. 1, 3 Department of Physics, Ambrose Alli University, Ekpoma, Nigeria. 2 Department of Physics, University of Benin, Benin City, Nigeria. 3 Department of Physics, University of Port Harcourt, PH, Nigeria.
Tritium saturation in plasma-facing materials surfaces
Energy Technology Data Exchange (ETDEWEB)
Longhurst, G.R.; Anderl, R.A.; Pawelko, R.J. [Idaho Nat. Eng. and Environ. Lab., Idaho Falls, ID (United States); Causey, R.A. [Sandia National Labs., Livermore, CA (United States); Federici, G. [ITER Garching Joint Work Site, Garching (Germany); Haasz, A.A. [Toronto Univ., ON (Canada). Inst. for Aerospace Studies
1998-10-01
Plasma-facing components in the international thermonuclear experimental reactor (ITER) will experience high heat loads and intense plasma fluxes of order 10{sup 20}-10{sup 23} particles/m{sup 2}s. Experiments on Be and W, two of the materials considered for use in ITER, have revealed that a tritium saturation phenomenon can take place under these conditions in which damage to the surface results that enhances the return of implanted tritium to the plasma and inhibits uptake of tritium. This phenomenon is important because it implies that tritium inventories due to implantation in these plasma-facing materials will probably be lower than was previously estimated using classical recombination-limited release at the plasma surface. Similarly, permeation through these components to the coolant streams should be reduced. In this paper we discuss evidences for the existence of this phenomenon, describe techniques for modeling it, and present results of the application of such modeling to prior experiments. (orig.) 39 refs.
Qian, Ma; Ma, Jie
2009-06-07
Fletcher's spherical substrate model [J. Chem. Phys. 29, 572 (1958)] is a basic model for understanding the heterogeneous nucleation phenomena in nature. However, a rigorous thermodynamic formulation of the model has been missing due to the significant complexities involved. This has not only left the classical model deficient but also likely obscured its other important features, which would otherwise have helped to better understand and control heterogeneous nucleation on spherical substrates. This work presents a rigorous thermodynamic formulation of Fletcher's model using a novel analytical approach and discusses the new perspectives derived. In particular, it is shown that the use of an intermediate variable, a selected geometrical angle or pseudocontact angle between the embryo and spherical substrate, revealed extraordinary similarities between the first derivatives of the free energy change with respect to embryo radius for nucleation on spherical and flat substrates. Enlightened by the discovery, it was found that there exists a local maximum in the difference between the equivalent contact angles for nucleation on spherical and flat substrates due to the existence of a local maximum in the difference between the shape factors for nucleation on spherical and flat substrate surfaces. This helps to understand the complexity of the heterogeneous nucleation phenomena in a practical system. Also, it was found that the unfavorable size effect occurs primarily when R<5r( *) (R: radius of substrate and r( *): critical embryo radius) and diminishes rapidly with increasing value of R/r( *) beyond R/r( *)=5. This finding provides a baseline for controlling the size effects in heterogeneous nucleation.
Directory of Open Access Journals (Sweden)
Roger Koenker
2014-09-01
Full Text Available Convex optimization now plays an essential role in many facets of statistics. We briefly survey some recent developments and describe some implementations of these methods in R . Applications of linear and quadratic programming are introduced including quantile regression, the Huber M-estimator and various penalized regression methods. Applications to additively separable convex problems subject to linear equality and inequality constraints such as nonparametric density estimation and maximum likelihood estimation of general nonparametric mixture models are described, as are several cone programming problems. We focus throughout primarily on implementations in the R environment that rely on solution methods linked to R, like MOSEK by the package Rmosek. Code is provided in R to illustrate several of these problems. Other applications are available in the R package REBayes, dealing with empirical Bayes estimation of nonparametric mixture models.
Czech Academy of Sciences Publication Activity Database
Hrubeš, P.; Jukna, S.; Kulikov, A.; Pudlák, Pavel
2010-01-01
Roč. 411, 16-18 (2010), s. 1842-1854 ISSN 0304-3975 R&D Projects: GA AV ČR IAA1019401 Institutional research plan: CEZ:AV0Z10190503 Keywords : boolean formula * complexity measure * combinatorial rectangle * convexity Subject RIV: BA - General Mathematics Impact factor: 0.838, year: 2010 http://www.sciencedirect.com/science/article/pii/S0304397510000885
More Realistic Face Model Surface Improves Relevance of Pediatric In-Vitro Aerosol Studies.
Amirav, Israel; Halamish, Asaf; Gorenberg, Miguel; Omar, Hamza; Newhouse, Michael T
2015-01-01
Various hard face models are commonly used to evaluate the efficiency of aerosol face masks. Softer more realistic "face" surface materials, like skin, deform upon mask application and should provide more relevant in-vitro tests. Studies that simultaneously take into consideration many of the factors characteristic of the in vivo face are lacking. These include airways, various application forces, comparison of various devices, comparison with a hard-surface model and use of a more representative model face based on large numbers of actual faces. To compare mask to "face" seal and aerosol delivery of two pediatric masks using a soft vs. a hard, appropriately representative, pediatric face model under various applied forces. Two identical face models and upper airways replicas were constructed, the only difference being the suppleness and compressibility of the surface layer of the "face." Integrity of the seal and aerosol delivery of two different masks [AeroChamber (AC) and SootherMask (SM)] were compared using a breath simulator, filter collection and realistic applied forces. The soft "face" significantly increased the delivery efficiency and the sealing characteristics of both masks. Aerosol delivery with the soft "face" was significantly greater for the SM compared to the AC (pmasks was observed with the hard "face." The material and pliability of the model "face" surface has a significant influence on both the seal and delivery efficiency of face masks. This finding should be taken into account during in-vitro aerosol studies.
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.
DEFF Research Database (Denmark)
Mortensen, Kristine Køhler; Brotherton, Chloe
2018-01-01
for the face the be put into action. Based on an ethnographic study of Danish teenagers’ use of SnapChat we demonstrate how the face is used as a central medium for interaction with peers. Through the analysis of visual SnapChat messages we investigate how SnapChat requires the sender to put an ‘ugly’ face...... already secured their popular status on the heterosexual marketplace in the broad context of the school. Thus SnapChat functions both as a challenge to beauty norms of ‘flawless faces’ and as a reinscription of these same norms by further manifesting the exclusive status of the popular girl...
Analysis of the skin surface and inner structure around pores on the face.
Mizukoshi, Koji; Takahashi, Kazuhiro
2014-02-01
Facial pores do not appear to close again in old skin. Therefore, the tissue structure around the pore has been speculated to keep the pore open. To elucidate the reason for pore enlargement, we examined the relationship between the skin surface and inner skin structural characteristics in the same regions especially around the pore. Samples of the skin surface were obtained from the cheek and examined using a laser image processor to obtain three-dimensional (3D) data. The inner structure of the skin was analyzed using in vivo confocal laser scanning microscopy (CLSM). The conspicuous pore not only had a concave structure but also a discontinuous convex structure on the skin surface surrounding the pore. Furthermore, CLSM image indicated that the skin inner structure developed a discontinuous dermal papilla structure and isotropic dermal fiber structure. There were structural changes in the skin surface around conspicuous pores, including not only a concave structure but also a convex structure with skin inner structure changing. © 2013 John Wiley & Sons A/S. Published by John Wiley & Sons Ltd.
Convex games versus clan games
Brânzei, R.; Dimitrov, D.A.; Tijs, S.H.
2008-01-01
In this paper we provide characterizations of convex games and total clan games by using properties of their corresponding marginal games. We show that a "dualize and restrict" procedure transforms total clan games with zero worth for the clan into monotonic convex games. Furthermore, each monotonic
Convex Games versus Clan Games
Brânzei, R.; Dimitrov, D.A.; Tijs, S.H.
2006-01-01
In this paper we provide characterizations of convex games and total clan games by using properties of their corresponding marginal games.We show that a "dualize and restrict" procedure transforms total clan games with zero worth for the clan into monotonic convex games.Furthermore, each monotonic
Convexity Adjustments for ATS Models
DEFF Research Database (Denmark)
Murgoci, Agatha; Gaspar, Raquel M.
. As a result we classify convexity adjustments into forward adjustments and swaps adjustments. We, then, focus on affine term structure (ATS) models and, in this context, conjecture convexity adjustments should be related of affine functionals. In the case of forward adjustments, we show how to obtain exact...
Nested convex bodies are chaseable
N. Bansal (Nikhil); M. Böhm (Martin); M. Eliáš (Marek); G. Koumoutsos (Grigorios); S.W. Umboh (Seeun William)
2018-01-01
textabstractIn the Convex Body Chasing problem, we are given an initial point v0 2 Rd and an online sequence of n convex bodies F1; : : : ; Fn. When we receive Fi, we are required to move inside Fi. Our goal is to minimize the total distance traveled. This fundamental online problem was first
The importance of surface-based cues for face discrimination in non-human primates.
Parr, Lisa A; Taubert, Jessica
2011-07-07
Understanding how individual identity is processed from faces remains a complex problem. Contrast reversal, showing faces in photographic negative, impairs face recognition in humans and demonstrates the importance of surface-based information (shading and pigmentation) in face recognition. We tested the importance of contrast information for face encoding in chimpanzees and rhesus monkeys using a computerized face-matching task. Results showed that contrast reversal (positive to negative) selectively impaired face processing in these two species, although the impairment was greater for chimpanzees. Unlike chimpanzees, however, monkeys performed just as well matching negative to positive faces, suggesting that they retained some ability to extract identity information from negative faces. A control task showed that chimpanzees, but not rhesus monkeys, performed significantly better matching face parts compared with whole faces after a contrast reversal, suggesting that contrast reversal acts selectively on face processing, rather than general visual-processing mechanisms. These results confirm the importance of surface-based cues for face processing in chimpanzees and humans, while the results were less salient for rhesus monkeys. These findings make a significant contribution to understanding the evolution of cognitive specializations for face processing among primates, and suggest potential differences between monkeys and apes.
Fast approximate convex decomposition using relative concavity
Ghosh, Mukulika; Amato, Nancy M.; Lu, Yanyan; Lien, Jyh-Ming
2013-01-01
Approximate convex decomposition (ACD) is a technique that partitions an input object into approximately convex components. Decomposition into approximately convex pieces is both more efficient to compute than exact convex decomposition and can also generate a more manageable number of components. It can be used as a basis of divide-and-conquer algorithms for applications such as collision detection, skeleton extraction and mesh generation. In this paper, we propose a new method called Fast Approximate Convex Decomposition (FACD) that improves the quality of the decomposition and reduces the cost of computing it for both 2D and 3D models. In particular, we propose a new strategy for evaluating potential cuts that aims to reduce the relative concavity, rather than absolute concavity. As shown in our results, this leads to more natural and smaller decompositions that include components for small but important features such as toes or fingers while not decomposing larger components, such as the torso, that may have concavities due to surface texture. Second, instead of decomposing a component into two pieces at each step, as in the original ACD, we propose a new strategy that uses a dynamic programming approach to select a set of n c non-crossing (independent) cuts that can be simultaneously applied to decompose the component into n c+1 components. This reduces the depth of recursion and, together with a more efficient method for computing the concavity measure, leads to significant gains in efficiency. We provide comparative results for 2D and 3D models illustrating the improvements obtained by FACD over ACD and we compare with the segmentation methods in the Princeton Shape Benchmark by Chen et al. (2009) [31]. © 2012 Elsevier Ltd. All rights reserved.
Fast approximate convex decomposition using relative concavity
Ghosh, Mukulika
2013-02-01
Approximate convex decomposition (ACD) is a technique that partitions an input object into approximately convex components. Decomposition into approximately convex pieces is both more efficient to compute than exact convex decomposition and can also generate a more manageable number of components. It can be used as a basis of divide-and-conquer algorithms for applications such as collision detection, skeleton extraction and mesh generation. In this paper, we propose a new method called Fast Approximate Convex Decomposition (FACD) that improves the quality of the decomposition and reduces the cost of computing it for both 2D and 3D models. In particular, we propose a new strategy for evaluating potential cuts that aims to reduce the relative concavity, rather than absolute concavity. As shown in our results, this leads to more natural and smaller decompositions that include components for small but important features such as toes or fingers while not decomposing larger components, such as the torso, that may have concavities due to surface texture. Second, instead of decomposing a component into two pieces at each step, as in the original ACD, we propose a new strategy that uses a dynamic programming approach to select a set of n c non-crossing (independent) cuts that can be simultaneously applied to decompose the component into n c+1 components. This reduces the depth of recursion and, together with a more efficient method for computing the concavity measure, leads to significant gains in efficiency. We provide comparative results for 2D and 3D models illustrating the improvements obtained by FACD over ACD and we compare with the segmentation methods in the Princeton Shape Benchmark by Chen et al. (2009) [31]. © 2012 Elsevier Ltd. All rights reserved.
θ-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.
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
The occipital lobe convexity sulci and gyri.
Alves, Raphael V; Ribas, Guilherme C; Párraga, Richard G; de Oliveira, Evandro
2012-05-01
The anatomy of the occipital lobe convexity is so intricate and variable that its precise description is not found in the classic anatomy textbooks, and the occipital sulci and gyri are described with different nomenclatures according to different authors. The aim of this study was to investigate and describe the anatomy of the occipital lobe convexity and clarify its nomenclature. The configurations of sulci and gyri on the lateral surface of the occipital lobe of 20 cerebral hemispheres were examined in order to identify the most characteristic and consistent patterns. The most characteristic and consistent occipital sulci identified in this study were the intraoccipital, transverse occipital, and lateral occipital sulci. The morphology of the transverse occipital sulcus and the intraoccipital sulcus connection was identified as the most important aspect to define the gyral pattern of the occipital lobe convexity. Knowledge of the main features of the occipital sulci and gyri permits the recognition of a basic configuration of the occipital lobe and the identification of its sulcal and gyral variations.
A post-processing study on aluminum surface by fiber laser: Removing face milling patterns
Kayahan, Ersin
2018-05-01
The face milling process of the metal surface is a well-known machining process of using rotary cutters to remove material from a workpiece. Flat metal surfaces can be produced by a face milling process. However, in practice, visible, traced marks following the motion of points on the cutter's face are usually apparent. In this study, it was shown that milled patterns can be removed by means of 20 W fiber laser on the aluminum surface (AA7075). Experimental results also showed that roughened and hydrophobic surface can be produced with optimized laser parameters. It is a new approach to remove the patterns from the metal surface and can be explained through roughening by re-melting instead of ablation. The new method is a strong candidate to replace sandblasting the metal surface. It is also cheap and environmentally friendly.
Geometry of isotropic convex bodies
Brazitikos, Silouanos; Valettas, Petros; Vritsiou, Beatrice-Helen
2014-01-01
The study of high-dimensional convex bodies from a geometric and analytic point of view, with an emphasis on the dependence of various parameters on the dimension stands at the intersection of classical convex geometry and the local theory of Banach spaces. It is also closely linked to many other fields, such as probability theory, partial differential equations, Riemannian geometry, harmonic analysis and combinatorics. It is now understood that the convexity assumption forces most of the volume of a high-dimensional convex body to be concentrated in some canonical way and the main question is whether, under some natural normalization, the answer to many fundamental questions should be independent of the dimension. The aim of this book is to introduce a number of well-known questions regarding the distribution of volume in high-dimensional convex bodies, which are exactly of this nature: among them are the slicing problem, the thin shell conjecture and the Kannan-Lov�sz-Simonovits conjecture. This book prov...
Behavior of plasma facing surface in the large helical device
International Nuclear Information System (INIS)
Hino, T.; Nobuta, Y.; Sagara, A.
2002-01-01
Material probes have been installed at the inner walls along poloidal direction in LHD from the first experimental campaign. After each campaign, the impurity deposition and the gas retention have been examined to clarify the plasma surface interaction and the degree of wall cleaning. In the 2nd campaign, the entire wall was considerably cleaned by helium glow discharge conditionings. For the 3rd and 4th campaigns, graphite tiles were installed at entire divertor strike region, and then the wall condition significantly changed compared to the case of stainless steel wall. The erosion of graphite took place during the main discharges and the eroded carbon deposited on the entire wall. In particular, the deposition thickness was large at the wall far from the plasma. Since the entire wall was well carbonized, amount of retained discharge gas such as H and He became large. In particular, the helium retention was large at the position close to the anodes used for helium glow discharge cleanings. One characteristics of the LHD wall is a large retention of helium gas since the wall temperature is limited below 368 K. In order to reduce the recycling of discharge gas, the wall heating before the experimental campaign and the surface heating between the main discharge shots are planned. (author)
Behavior of plasma facing surface in the large helical device
Energy Technology Data Exchange (ETDEWEB)
Hino, T.; Nobuta, Y. [Hokkaido Univ., Dept. of Nuclear Engineering, Sapporo, Hokkaido (Japan); Sagara, A. [National Inst. for Fusion Science, Toki, Gifu (Japan)] [and others
2002-11-01
Material probes have been installed at the inner walls along poloidal direction in LHD from the first experimental campaign. After each campaign, the impurity deposition and the gas retention have been examined to clarify the plasma surface interaction and the degree of wall cleaning. In the 2nd campaign, the entire wall was considerably cleaned by helium glow discharge conditionings. For the 3rd and 4th campaigns, graphite tiles were installed at entire divertor strike region, and then the wall condition significantly changed compared to the case of stainless steel wall. The erosion of graphite took place during the main discharges and the eroded carbon deposited on the entire wall. In particular, the deposition thickness was large at the wall far from the plasma. Since the entire wall was well carbonized, amount of retained discharge gas such as H and He became large. In particular, the helium retention was large at the position close to the anodes used for helium glow discharge cleanings. One characteristics of the LHD wall is a large retention of helium gas since the wall temperature is limited below 368 K. In order to reduce the recycling of discharge gas, the wall heating before the experimental campaign and the surface heating between the main discharge shots are planned. (author)
Behavior of plasma facing surfaces in the large helical device
International Nuclear Information System (INIS)
Hino, T.; Nobuta, Y.; Sagara, A.
2003-01-01
Material probes have been installed at the inner walls along the poloidal direction in LHD from the first experimental campaign. After each campaign, the impurity deposition and the gas retention have been examined to clarify the plasma surface interaction and the degree of wall cleaning. In the 2nd campaign, the entire wall was thoroughly cleaned by helium glow discharge conditioning. For the 3rd and 4th campaigns, graphite tiles were installed over the entire divertor strike region, and then the wall condition was significantly changed compared to the case of a stainless steel wall. Graphite erosion took place during the main discharges and the eroded carbon was deposited on the entire wall. In particular, the deposition thickness was large at the wall far from the plasma. Since the entire wall was well carbonized, the amount of retained discharge gases such as H and He became large. In particular, the helium retention was large at the position close to the anodes used for helium glow discharge cleanings. One characteristic of the LHD wall is a large retention of helium gas since the wall temperature is limited to below 368 K. In order to reduce the recycling of discharge gas, wall heating before the experimental campaign and surface heating between the main discharge shots are planned. (author)
Behavior of plasma facing surface in the large helical device
International Nuclear Information System (INIS)
Hino, T.; Nobuta, Y.; Sagara, A.
2002-10-01
Material probes have been installed at the inner walls along poloidal direction in LHD from the first experimental campaign. After each the campaign, the impurity deposition and the gas retention have been examined to clarify the plasma surface interaction and the degree of wall cleaning. In the 2nd campaign, the entire wall was considerably cleaned by helium glow discharge conditionings. For the 3rd and 4th campaigns, graphite tiles were installed at entire divertor strike region, and then the wall condition significantly changed compared to the case of stainless steel wall. The erosion of graphite took place during the main discharges and the eroded carbon deposited on the entire wall. In particular, the deposition thickness was large at the wall far from the plasma. Since the entire wall was well carbonized, amount of retained discharge gas such as H and He became large. In particular, the helium retention was large at the position close to the anodes used for helium glow discharge cleanings. One characteristics of the LHD wall is a large retention of helium gas since the wall temperature is limited below 368 K. In order to reduce the recycling of discharge gas, the wall heating before the experimental campaign and the surface heating between the main discharge shots are planned. (author)
A new convexity measure for polygons.
Zunic, Jovisa; Rosin, Paul L
2004-07-01
Abstract-Convexity estimators are commonly used in the analysis of shape. In this paper, we define and evaluate a new convexity measure for planar regions bounded by polygons. The new convexity measure can be understood as a "boundary-based" measure and in accordance with this it is more sensitive to measured boundary defects than the so called "area-based" convexity measures. When compared with the convexity measure defined as the ratio between the Euclidean perimeter of the convex hull of the measured shape and the Euclidean perimeter of the measured shape then the new convexity measure also shows some advantages-particularly for shapes with holes. The new convexity measure has the following desirable properties: 1) the estimated convexity is always a number from (0, 1], 2) the estimated convexity is 1 if and only if the measured shape is convex, 3) there are shapes whose estimated convexity is arbitrarily close to 0, 4) the new convexity measure is invariant under similarity transformations, and 5) there is a simple and fast procedure for computing the new convexity measure.
NP-completeness of weakly convex and convex dominating set decision problems
Directory of Open Access Journals (Sweden)
Joanna Raczek
2004-01-01
Full Text Available The convex domination number and the weakly convex domination number are new domination parameters. In this paper we show that the decision problems of convex and weakly convex dominating sets are \\(NP\\-complete for bipartite and split graphs. Using a modified version of Warshall algorithm we can verify in polynomial time whether a given subset of vertices of a graph is convex or weakly convex.
Effect of surface treatments on the bond strengths of facing composite resins to zirconia copings.
Tsumita, M; Kokubo, Y; Kano, T
2012-09-01
The present study evaluated and compared the bond strength between zirconia and facing composite resin using different surface conditioning methods before and after thermocycling. Four primers, three opaque resins, and two facing composite resins were used, and 10 surface treatment procedures were conducted. The bond strength was measured before and after 4,000 cycles of thermocycling. The mean values of each group were statistically analyzed using one-way analysis of variance (ANOVA). The bond strengths of facing composite resins to zirconia after various treatments varied depending on the primers, opaque resins, body resins, and thermocycling. The application of primers and opaque resins to the zirconia surface after sandblasting is expected to yield strong bond strength of the facing composite resin (Estenia CG&B) even after thermocycling.
Nonsmooth Mechanics and Convex Optimization
Kanno, Yoshihiro
2011-01-01
"This book concerns matter that is intrinsically difficult: convex optimization, complementarity and duality, nonsmooth analysis, linear and nonlinear programming, etc. The author has skillfully introduced these and many more concepts, and woven them into a seamless whole by retaining an easy and consistent style throughout. The book is not all theory: There are many real-life applications in structural engineering, cable networks, frictional contact problems, and plasticity! I recommend it to any reader who desires a modern, authoritative account of nonsmooth mechanics and convex optimiz
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.
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.)
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
Quantum information and convex optimization
Energy Technology Data Exchange (ETDEWEB)
Reimpell, Michael
2008-07-01
This thesis is concerned with convex optimization problems in quantum information theory. It features an iterative algorithm for optimal quantum error correcting codes, a postprocessing method for incomplete tomography data, a method to estimate the amount of entanglement in witness experiments, and it gives necessary and sufficient criteria for the existence of retrodiction strategies for a generalized mean king problem. (orig.)
Convexity of the effective potential
International Nuclear Information System (INIS)
Haymaker, R.W.; Perez-Mercader, J.
1978-01-01
The effective potential V(phi) in field theories is a convex function of phi. V(lambda phi 1 + (1 - lambda)phi 2 ) less than or equal to lambdaV(phi 1 ) + (1 - lambda)V(phi 2 ), 0 less than or equal to lambda less than or equal to 1, all phi 1 , phi 2 . A linear interpolation of V(phi) is always larger than or equal to V(phi). There are numerous examples in the tree approximation and in perturbation theory for which this is not the case, the most notorious example being the double dip potential. More complete solutions may or may not show this property automatically. However, a non-convex V(phi) simply indicates that an unstable vacuum state was used in implementing the definition of V(phi). A strict definition will instruct one to replace V(phi) with its linear interpolation in such a way as to make it convex. (Alternatively one can just as well take the view that V(phi) is undefined in these domains.) In this note, attention is called to a very simple argument for convexity based on a construction described by H. Callen in his classic book Thermodynamics
Tritium loading in ITER plasma-facing surfaces and its release under accident conditions
International Nuclear Information System (INIS)
Longhurst, G.R.; Anderl, R.A.; Pawelko, R.J.
1996-01-01
Plasma-facing surfaces of the International Thermonuclear Experimental Reactor (ITER) will take up tritium from the plasma. These surfaces will probably consist of matures of Be, C, and possibly W together with other impurities. Recent experimental results have suggested mechanisms, not previously considered in analyses, by which tritium and other hydrogen isotopes are retained in Be. This warrants revised modeling and estimation of the amount of tritium that will be deposited in ITER beryllium plasma-facing surfaces and the rates at which it can be released under postulated accident scenarios. In this paper we describe improvements in modeling and experiments planned at the Idaho National Engineering Laboratory (INEL) to investigate the tritium uptake and thermal release behavior for mixed plasma- facing materials. TMAP4 calculations were made using recent data to estimate first-wall tritium inventories in ITER. 16 refs., 1 fig
Computing farthest neighbors on a convex polytope
Cheong, O.; Shin, C.S.; Vigneron, A.
2002-01-01
Let N be a set of n points in convex position in R3. The farthest-point Voronoi diagram of N partitions R³ into n convex cells. We consider the intersection G(N) of the diagram with the boundary of the convex hull of N. We give an algorithm that computes an implicit representation of G(N) in
International Nuclear Information System (INIS)
Gocmanac, M.; Luxat, J.C.
2012-01-01
A separate effects experimental study of heat transfer and Critical Heat Flux (CHF) on a downward facing plate in subcooled water pool boiling is described. Two geometries of downwards facing surfaces are studied. The first is termed the 'confined' study in which bubble motion is restricted to the heated surface. The second is termed the 'unconfined' study where individual bubbles are free to move along the heated surface and vent in any direction. The method used in the confined study is novel and involves the placement of a lip surrounding the heated surface. The CHF as a function of angle of inclination of the surface is presented and is in good agreement with other experimental data from somewhat different test geometries. (author)
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.
Learning Convex Inference of Marginals
Domke, Justin
2012-01-01
Graphical models trained using maximum likelihood are a common tool for probabilistic inference of marginal distributions. However, this approach suffers difficulties when either the inference process or the model is approximate. In this paper, the inference process is first defined to be the minimization of a convex function, inspired by free energy approximations. Learning is then done directly in terms of the performance of the inference process at univariate marginal prediction. The main ...
Diameter 2 properties and convexity
Czech Academy of Sciences Publication Activity Database
Abrahamsen, T. A.; Hájek, Petr Pavel; Nygaard, O.; Talponen, J.; Troyanski, S.
2016-01-01
Roč. 232, č. 3 (2016), s. 227-242 ISSN 0039-3223 R&D Projects: GA ČR GA16-07378S Institutional support: RVO:67985840 Keywords : diameter 2 property * midpoint locally uniformly rotund * Daugavet property Subject RIV: BA - General Mathematics Impact factor: 0.535, year: 2016 https://www.impan.pl/pl/wydawnictwa/czasopisma-i-serie-wydawnicze/studia- mathematica /all/232/3/91534/diameter-2-properties-and-convexity
Heat transfer effect of an extended surface in downward-facing subcooled flow boiling
Energy Technology Data Exchange (ETDEWEB)
Khan, Abdul R., E-mail: khan@vis.t.u-tokyo.ac.jp [Department of Nuclear Engineering and Management, School of Engineering, The University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-8656 (Japan); Erkan, Nejdet, E-mail: erkan@vis.t.u-tokyo.ac.jp [Nuclear Professional School, School of Engineering, The University of Tokyo, 2-22 Shirakata, Tokai-mura, Ibaraki, 319-1188 (Japan); Okamoto, Koji, E-mail: okamoto@n.t.u-tokyo.ac.jp [Nuclear Professional School, School of Engineering, The University of Tokyo, 2-22 Shirakata, Tokai-mura, Ibaraki, 319-1188 (Japan)
2015-12-15
Highlights: • Compare downward-facing flow boiling results from bare and extended surfaces. • Upstream and downstream temperatures were measured on the extended surface. • Downstream temperatures exceed upstream temperatures for all flow rates. • Bubble accumulation occurs downstream on extended surface. • Extended surface heat transfer lower than bare surface as flow rate reduced. - Abstract: New BWR containment designs are considering cavity flooding as an accident management strategy. Unlike the PWR, the BWR has many Control Rod Guide Tube (CRGT) penetrations in the lower head. During a severe accident scenario with core melt in the lower plenum along with cavity flooding, the penetrations may affect the heat transfer on the ex-vessel surface and disrupt fluid flow during the boiling process. A small-scale experiment was performed to investigate the issues existing in downward-facing boiling phenomenon with an extended surface. The results were compared with a bare (flat) surface. The mass flux of 244 kg/m{sup 2} s, 215 kg/m{sup 2} s, and 177 kg/m{sup 2} s were applied in this study. CHF conditions were observed only for the 177 kg/m{sup 2} s case. The boiling curves for both types of surfaces and all flow rates were obtained. The boiling curves for the highest flow rate showed lower surface temperatures for the extended surface experiments when compared to the bare surface. The downstream location on the extended surface yielded the highest surface temperatures as the flow rate was reduced. The bubble accumulation and low velocity in the wake produced by flow around the extended surface was believed to have caused the elevated temperatures in the downstream location. Although an extended surface may enhance the overall heat transfer, a reduction in the local heat transfer was observed in the current experiments.
International Nuclear Information System (INIS)
Nishino, Nobuhiro
1997-01-01
The surface structure of the plasma facing materials (PFM) changes due to plasma-surface interaction in a nuclear fusion reactor. Usually B 4 C coated graphite block are used as PFM. In this report, the surface fractal was applied to study the surface structure of plasma-damaged PFM carbon. A convenient flow-type adsorption apparatus was developed to evaluate the surface fractal dimension of materials. Four branched alkanol molecules with different apparent areas were used as the probe adsorbates. The samples used here were B 4 C coated isotopic graphite which were subjected to hydrogen plasma for various periods of exposure. The monolayer capacities of these samples for alkanols were determined by applying BET theory. The surface fractal dimension was calculated using the monolayer capacities and molecular areas for probe molecules and was found to increase from 2 to 3 with the plasma exposure time. (author)
An analytic model of pool boiling critical heat flux on an immerged downward facing curved surface
International Nuclear Information System (INIS)
He, Hui; Pan, Liang-ming; Wu, Yao; Chen, De-qi
2015-01-01
Highlights: • Thin liquid film and supplement of liquid contribute to the CHF. • CHF increases from the bottom to the upper of the lowerhead. • Evaporation of thin liquid film is dominant nearby bottom region. • The subcooling has significant effects on the CHF. - Abstract: In this paper, an analytical model of the critical heat flux (CHF) on the downward facing curved surface for pool boiling has been proposed, which hypothesizes that the CHF on the downward facing curved is composed of two parts, i.e. the evaporation of the thin liquid film underneath the elongated bubble adhering to the lower head outer surface and the depletion of supplement of liquid due to the relative motion of vapor bubbles along with the downward facing curved. The former adopts the Kelvin–Helmholtz instability analysis of vapor–liquid interface of the vapor jets which penetrating in the thin liquid film. When the heat flux closing to the CHF point, the vapor–liquid interface becomes highly distorted, which block liquid to feed the thin liquid film and the thin liquid film will dry out gradually. While the latter considers that the vapor bubbles move along with the downward facing curved surface, and the liquid in two-phase boundary layer enter the liquid film that will be exhausted when the CHF occurs. Based on the aforementioned mechanism and the energy balance between the thin liquid film evaporation and water feeding, and taking the subcooling of the bulk water into account, the mathematic model about the downward facing curved surface CHF has been proposed. The CHF of the downward facing curved surface for pool boiling increases along with the downward facing orientation except in the vicinity of bottom center region, because in this region the vapor bubble almost stagnates and the evaporation of the thin liquid film is dominant. In addition, the subcooling has significant effect on the CHF. Comparing the result of this model with the published experimental results show
Finite dimensional convexity and optimization
Florenzano, Monique
2001-01-01
The primary aim of this book is to present notions of convex analysis which constitute the basic underlying structure of argumentation in economic theory and which are common to optimization problems encountered in many applications. The intended readers are graduate students, and specialists of mathematical programming whose research fields are applied mathematics and economics. The text consists of a systematic development in eight chapters, with guided exercises containing sometimes significant and useful additional results. The book is appropriate as a class text, or for self-study.
Use of Convexity in Ostomy Care
Salvadalena, Ginger; Pridham, Sue; Droste, Werner; McNichol, Laurie; Gray, Mikel
2017-01-01
Ostomy skin barriers that incorporate a convexity feature have been available in the marketplace for decades, but limited resources are available to guide clinicians in selection and use of convex products. Given the widespread use of convexity, and the need to provide practical guidelines for appropriate use of pouching systems with convex features, an international consensus panel was convened to provide consensus-based guidance for this aspect of ostomy practice. Panelists were provided with a summary of relevant literature in advance of the meeting; these articles were used to generate and reach consensus on 26 statements during a 1-day meeting. Consensus was achieved when 80% of panelists agreed on a statement using an anonymous electronic response system. The 26 statements provide guidance for convex product characteristics, patient assessment, convexity use, and outcomes. PMID:28002174
Reconstruction of convex bodies from moments
DEFF Research Database (Denmark)
Hörrmann, Julia; Kousholt, Astrid
We investigate how much information about a convex body can be retrieved from a finite number of its geometric moments. We give a sufficient condition for a convex body to be uniquely determined by a finite number of its geometric moments, and we show that among all convex bodies, those which......- rithm that approximates a convex body using a finite number of its Legendre moments. The consistency of the algorithm is established using the stabil- ity result for Legendre moments. When only noisy measurements of Legendre moments are available, the consistency of the algorithm is established under...
Simulated plasma facing component measurements for an in situ surface diagnostic on Alcator C-Moda)
Hartwig, Z. S.; Whyte, D. G.
2010-10-01
The ideal in situ plasma facing component (PFC) diagnostic for magnetic fusion devices would perform surface element and isotope composition measurements on a shot-to-shot (˜10 min) time scale with ˜1 μm depth and ˜1 cm spatial resolution over large areas of PFCs. To this end, the experimental adaptation of the customary laboratory surface diagnostic—nuclear scattering of MeV ions—to the Alcator C-Mod tokamak is being guided by ACRONYM, a Geant4 synthetic diagnostic. The diagnostic technique and ACRONYM are described, and synthetic measurements of film thickness for boron-coated PFCs are presented.
Thermographic analysis of plasma facing components covered by carbon surface layer in tokamaks
International Nuclear Information System (INIS)
Gardarein, Jean-Laurent
2007-01-01
Tokamaks are reactors based on the thermonuclear fusion energy with magnetic confinement of the plasma. In theses machines, several MW are coupled to the plasma for about 10 s. A large part of this power is directed towards plasma facing components (PFC). For better understanding and control the heat flux transfer from the plasma to the surrounding wall, it is very important to measure the surface temperature of the PFC and to estimate the imposed heat flux. In most of tokamaks using carbon PFC, the eroded carbon is circulating in the plasma and redeposited elsewhere. During the plasma operations, this leads at some locations to the formation of thin or thick carbon layers usually poorly attached to the PFC. These surface layers with unknown thermal properties complicate the calculation of the heat flux from IR surface temperature measurements. To solve this problem, we develop first, inverse method to estimate the heat flux using thermocouple (not sensitive to the carbon surface layers) temperature measurements. Then, we propose a front face pulsed photothermal method allowing an estimation of layers thermal diffusivity, conductivity, effusivity and the thermal contact resistance between the layer and the tile. The principle is to study with an infrared sensor, the cooling of the layer surface after heating by a short laser pulse, this cooling depending on the thermal properties of the successive layers. (author) [fr
Entropy coherent and entropy convex measures of risk
Laeven, R.J.A.; Stadje, M.
2013-01-01
We introduce two subclasses of convex measures of risk, referred to as entropy coherent and entropy convex measures of risk. Entropy coherent and entropy convex measures of risk are special cases of φ-coherent and φ-convex measures of risk. Contrary to the classical use of coherent and convex
Non-uniform Erosion and Surface Evolution of Plasma-Facing Materials for Electric Propulsion
Matthes, Christopher Stanley Rutter
A study regarding the surface evolution of plasma-facing materials is presented. Experimental efforts were performed in the UCLA Pi Facility, designed to explore the physics of plasma-surface interactions. The influence of micro-architectured surfaces on the effects of plasma sputtering is compared with the response of planar samples. Ballistic deposition of sputtered atoms as a result of geometric re-trapping is observed. This provides a self-healing mechanism of micro-architectured surfaces during plasma exposure. This result is quantified using a QCM to demonstrate the evolution of surface features and the corresponding influence on the instantaneous sputtering yield. The sputtering yield of textured molybdenum samples exposed to 300 eV Ar plasma is found to be roughly 1 of the 2 corresponding value of flat samples, and increases with ion fluence. Mo samples exhibited a sputtering yield initially as low as 0.22+/-8%, converging to 0.4+/-8% at high fluence. Although the yield is dependent on the initial surface structure, it is shown to be transient, reaching a steady-state value that is independent of initial surface conditions. A continuum model of surface evolution resulting from sputtering, deposition and surface diffusion is also derived to resemble the damped Kuramoto-Sivashinsky (KS) equation of non-linear dynamics. Linear stability analysis of the evolution equation provides an estimate of the selected wavelength, and its dependence on the ion energy and angle of incidence. The analytical results are confirmed by numerical simulations of the equation with a Fast Fourier Transform method. It is shown that for an initially flat surface, small perturbations lead to the evolution of a selected surface pattern that has nano- scale wavelength. When the surface is initially patterned by other means, the final resulting pattern is a competition between the "templated" pattern and the "self-organized" structure. Potential future routes of research are also
Pluripotential theory and convex bodies
Bayraktar, T.; Bloom, T.; Levenberg, N.
2018-03-01
A seminal paper by Berman and Boucksom exploited ideas from complex geometry to analyze the asymptotics of spaces of holomorphic sections of tensor powers of certain line bundles L over compact, complex manifolds as the power grows. This yielded results on weighted polynomial spaces in weighted pluripotential theory in {C}^d. Here, motivated by a recent paper by the first author on random sparse polynomials, we work in the setting of weighted pluripotential theory arising from polynomials associated to a convex body in ({R}^+)^d. These classes of polynomials need not occur as sections of tensor powers of a line bundle L over a compact, complex manifold. We follow the approach of Berman and Boucksom to obtain analogous results. Bibliography: 16 titles.
Convex analysis and global optimization
Tuy, Hoang
2016-01-01
This book presents state-of-the-art results and methodologies in modern global optimization, and has been a staple reference for researchers, engineers, advanced students (also in applied mathematics), and practitioners in various fields of engineering. The second edition has been brought up to date and continues to develop a coherent and rigorous theory of deterministic global optimization, highlighting the essential role of convex analysis. The text has been revised and expanded to meet the needs of research, education, and applications for many years to come. Updates for this new edition include: · Discussion of modern approaches to minimax, fixed point, and equilibrium theorems, and to nonconvex optimization; · Increased focus on dealing more efficiently with ill-posed problems of global optimization, particularly those with hard constraints;
Flat tori in three-dimensional space and convex integration.
Borrelli, Vincent; Jabrane, Saïd; Lazarus, Francis; Thibert, Boris
2012-05-08
It is well-known that the curvature tensor is an isometric invariant of C(2) Riemannian manifolds. This invariant is at the origin of the rigidity observed in Riemannian geometry. In the mid 1950s, Nash amazed the world mathematical community by showing that this rigidity breaks down in regularity C(1). This unexpected flexibility has many paradoxical consequences, one of them is the existence of C(1) isometric embeddings of flat tori into Euclidean three-dimensional space. In the 1970s and 1980s, M. Gromov, revisiting Nash's results introduced convex integration theory offering a general framework to solve this type of geometric problems. In this research, we convert convex integration theory into an algorithm that produces isometric maps of flat tori. We provide an implementation of a convex integration process leading to images of an embedding of a flat torus. The resulting surface reveals a C(1) fractal structure: Although the tangent plane is defined everywhere, the normal vector exhibits a fractal behavior. Isometric embeddings of flat tori may thus appear as a geometric occurrence of a structure that is simultaneously C(1) and fractal. Beyond these results, our implementation demonstrates that convex integration, a theory still confined to specialists, can produce computationally tractable solutions of partial differential relations.
Characterizing Convexity of Games using Marginal Vectors
van Velzen, S.; Hamers, H.J.M.; Norde, H.W.
2003-01-01
In this paper we study the relation between convexity of TU games and marginal vectors.We show that if specfic marginal vectors are core elements, then the game is convex.We characterize sets of marginal vectors satisfying this property, and we derive the formula for the minimum number of marginal
Convex trace functions of several variables
DEFF Research Database (Denmark)
Hansen, Frank
2002-01-01
We prove that the function (x1,...,xk)¿Tr(f(x1,...,xk)), defined on k-tuples of symmetric matrices of order (n1,...,nk) in the domain of f, is convex for any convex function f of k variables. The matrix f(x1,...,xk) is defined by the functional calculus for functions of several variables, and it ...
Differential analysis of matrix convex functions II
DEFF Research Database (Denmark)
Hansen, Frank; Tomiyama, Jun
2009-01-01
We continue the analysis in [F. Hansen, and J. Tomiyama, Differential analysis of matrix convex functions. Linear Algebra Appl., 420:102--116, 2007] of matrix convex functions of a fixed order defined in a real interval by differential methods as opposed to the characterization in terms of divided...
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 ...
Introduction to Convex and Quasiconvex Analysis
J.B.G. Frenk (Hans); G. Kassay
2004-01-01
textabstractIn the first chapter of this book the basic results within convex and quasiconvex analysis are presented. In Section 2 we consider in detail the algebraic and topological properties of convex sets within Rn together with their primal and dual representations. In Section 3 we apply the
Convexity of oligopoly games without transferable technologies
Driessen, Theo; Meinhardt, Holger I.
2005-01-01
We present sufficient conditions involving the inverse demand function and the cost functions to establish the convexity of oligopoly TU-games without transferable technologies. For convex TU-games it is well known that the core is relatively large and that it is generically nonempty. The former
Convex bodies with many elliptic sections
Arelio, Isaac; Montejano, Luis
2014-01-01
{We show in this paper that two normal elliptic sections through every point of the boundary of a smooth convex body essentially characterize an ellipsoid and furthermore, that four different pairwise non-tangent elliptic sections through every point of the $C^2$-differentiable boundary of a convex body also essentially characterize an ellipsoid.
Salazar-Camacho, Carlos; Villalobos, Mario
2010-04-01
We developed a model that describes quantitatively the arsenate adsorption behavior for any goethite preparation as a function of pH and ionic strength, by using one basic surface arsenate stoichiometry, with two affinity constants. The model combines a face distribution-crystallographic site density model for goethite with tenets of the Triple Layer and CD-MUSIC surface complexation models, and is self-consistent with its adsorption behavior towards protons, electrolytes, and other ions investigated previously. Five different systems of published arsenate adsorption data were used to calibrate the model spanning a wide range of chemical conditions, which included adsorption isotherms at different pH values, and adsorption pH-edges at different As(V) loadings, both at different ionic strengths and background electrolytes. Four additional goethite-arsenate systems reported with limited characterization and adsorption data were accurately described by the model developed. The adsorption reaction proposed is: lbond2 FeOH +lbond2 SOH +AsO43-+H→lbond2 FeOAsO3[2-]…SOH+HO where lbond2 SOH is an adjacent surface site to lbond2 FeOH; with log K = 21.6 ± 0.7 when lbond2 SOH is another lbond2 FeOH, and log K = 18.75 ± 0.9, when lbond2 SOH is lbond2 Fe 2OH. An additional small contribution of a protonated complex was required to describe data at low pH and very high arsenate loadings. The model considered goethites above 80 m 2/g as ideally composed of 70% face (1 0 1) and 30% face (0 0 1), resulting in a site density for lbond2 FeOH and for lbond2 Fe 3OH of 3.125/nm 2 each. Below 80 m 2/g surface capacity increases progressively with decreasing area, which was modeled by considering a progressively increasing proportion of faces (0 1 0)/(1 0 1), because face (0 1 0) shows a much higher site density of lbond2 FeOH groups. Computation of the specific proportion of faces, and thus of the site densities for the three types of crystallographic surface groups present in
Generalized convexity, generalized monotonicity recent results
Martinez-Legaz, Juan-Enrique; Volle, Michel
1998-01-01
A function is convex if its epigraph is convex. This geometrical structure has very strong implications in terms of continuity and differentiability. Separation theorems lead to optimality conditions and duality for convex problems. A function is quasiconvex if its lower level sets are convex. Here again, the geo metrical structure of the level sets implies some continuity and differentiability properties for quasiconvex functions. Optimality conditions and duality can be derived for optimization problems involving such functions as well. Over a period of about fifty years, quasiconvex and other generalized convex functions have been considered in a variety of fields including economies, man agement science, engineering, probability and applied sciences in accordance with the need of particular applications. During the last twenty-five years, an increase of research activities in this field has been witnessed. More recently generalized monotonicity of maps has been studied. It relates to generalized conve...
Two generalizations of column-convex polygons
International Nuclear Information System (INIS)
Feretic, Svjetlan; Guttmann, Anthony J
2009-01-01
Column-convex polygons were first counted by area several decades ago, and the result was found to be a simple, rational, generating function. In this work we generalize that result. Let a p-column polyomino be a polyomino whose columns can have 1, 2, ..., p connected components. Then column-convex polygons are equivalent to 1-convex polyominoes. The area generating function of even the simplest generalization, namely 2-column polyominoes, is unlikely to be solvable. We therefore define two classes of polyominoes which interpolate between column-convex polygons and 2-column polyominoes. We derive the area generating functions of those two classes, using extensions of existing algorithms. The growth constants of both classes are greater than the growth constant of column-convex polyominoes. Rather tight lower bounds on the growth constants complement a comprehensive asymptotic analysis.
Near-surface thermal characterization of plasma facing components using the 3-omega method
International Nuclear Information System (INIS)
Dechaumphai, Edward; Barton, Joseph L.; Tesmer, Joseph R.; Moon, Jaeyun; Wang, Yongqiang; Tynan, George R.; Doerner, Russell P.; Chen, Renkun
2014-01-01
Near-surface regime plays an important role in thermal management of plasma facing components in fusion reactors. Here, we applied a technique referred to as the ‘3ω’ method to measure the thermal conductivity of near-surface regimes damaged by ion irradiation. By modulating the frequency of the heating current in a micro-fabricated heater strip, the technique enables the probing of near-surface thermal properties. The technique was applied to measure the thermal conductivity of a thin ion-irradiated layer on a tungsten substrate, which was found to decrease by nearly 60% relative to pristine tungsten for a Cu ion dosage of 0.2 dpa
Federici, G.; Holland, D. F.; Matera, R.
1996-10-01
In the next generation of DT fuelled tokamaks, i.e., the International Thermonuclear Experimental Reactor (ITER) implantation of energetic DT particles on some portions of the plasma facing components (PFCs) will take place along with significant erosion of the armour surfaces. As a result of the simultaneous removal of material from the front surface, the build-up of tritium inventory and the start of permeation originating in the presence of large densities of neutron-induced traps is expected to be influenced considerably and special provisions could be required to minimise the consequences on the design. This paper reports on the results of a tritium transport modelling study based on a new model which describes the migration of implanted tritium across the bulk of metallic plasma facing materials containing neutron-induced traps which can capture it and includes the synergistic effects of surface erosion. The physical basis of the model is summarised, but emphasis is on the discussion of the results of a comparative study performed for beryllium and tungsten armours for ranges of design and operation conditions similar to those anticipated in the divertor of ITER.
International Nuclear Information System (INIS)
Federici, G.; Holland, D.F.; Matera, R.
1996-01-01
In the next generation of DT fuelled tokamaks, i.e., the international thermonuclear experimental reactor (ITER) implantation of energetic DT particles on some portions of the plasma facing components (PFCs) will take place along with significant erosion of the armour surfaces. As a result of the simultaneous removal of material from the front surface, the build-up of tritium inventory and the start of permeation originating in the presence of large densities of neutron-induced traps is expected to be influenced considerably and special provisions could be required to minimise the consequences on the design. This paper reports on the results of a tritium transport modelling study based on a new model which describes the migration of implanted tritium across the bulk of metallic plasma facing materials containing neutron-induced traps which can capture it and includes the synergistic effects of surface erosion. The physical basis of the model is summarised, but emphasis is on the discussion of the results of a comparative study performed for beryllium and tungsten armours for ranges of design and operation conditions similar to those anticipated in the divertor of ITER. (orig.)
Alpha-Concave Hull, a Generalization of Convex Hull
Asaeedi, Saeed; Didehvar, Farzad; Mohades, Ali
2013-01-01
Bounding hull, such as convex hull, concave hull, alpha shapes etc. has vast applications in different areas especially in computational geometry. Alpha shape and concave hull are generalizations of convex hull. Unlike the convex hull, they construct non-convex enclosure on a set of points. In this paper, we introduce another generalization of convex hull, named alpha-concave hull, and compare this concept with convex hull and alpha shape. We show that the alpha-concave hull is also a general...
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)
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.
2D surface temperature measurement of plasma facing components with modulated active pyrometry
International Nuclear Information System (INIS)
Amiel, S.; Loarer, T.; Pocheau, C.; Roche, H.; Gauthier, E.; Aumeunier, M.-H.; Courtois, X.; Jouve, M.; Balorin, C.; Moncada, V.; Le Niliot, C.; Rigollet, F.
2014-01-01
In nuclear fusion devices, such as Tore Supra, the plasma facing components (PFC) are in carbon. Such components are exposed to very high heat flux and the surface temperature measurement is mandatory for the safety of the device and also for efficient plasma scenario development. Besides this measurement is essential to evaluate these heat fluxes for a better knowledge of the physics of plasma-wall interaction, it is also required to monitor the fatigue of PFCs. Infrared system (IR) is used to manage to measure surface temperature in real time. For carbon PFCs, the emissivity is high and known (ε ∼ 0.8), therefore the contribution of the reflected flux from environment and collected by the IR cameras can be neglected. However, the future tokamaks such as WEST and ITER will be equipped with PFCs in metal (W and Be/W, respectively) with low and variable emissivities (ε ∼ 0.1–0.4). Consequently, the reflected flux will contribute significantly in the collected flux by IR camera. The modulated active pyrometry, using a bicolor camera, proposed in this paper allows a 2D surface temperature measurement independently of the reflected fluxes and the emissivity. Experimental results with Tungsten sample are reported and compared with simultaneous measurement performed with classical pyrometry (monochromatic and bichromatic) with and without reflective flux demonstrating the efficiency of this method for surface temperature measurement independently of the reflected flux and the emissivity
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
Designing Camera Networks by Convex Quadratic Programming
Ghanem, Bernard; Wonka, Peter; Cao, Yuanhao
2015-01-01
be formulated mathematically as a convex binary quadratic program (BQP) under linear constraints. Moreover, we propose an optimization strategy with a favorable trade-off between speed and solution quality. Our solution
ON THE GENERALIZED CONVEXITY AND CONCAVITY
Directory of Open Access Journals (Sweden)
Bhayo B.
2015-11-01
Full Text Available A function ƒ : R+ → R+ is (m1, m2-convex (concave if ƒ(m1(x,y ≤ (≥ m2(ƒ(x, ƒ(y for all x,y Є R+ = (0,∞ and m1 and m2 are two mean functions. Anderson et al. [1] studies the dependence of (m1, m2-convexity (concavity on m1 and m2 and gave the sufficient conditions of (m1, m2-convexity and concavity of a function defined by Maclaurin series. In this paper, we make a contribution to the topic and study the (m1, m2-convexity and concavity of a function where m1 and m2 are identric mean, Alzer mean mean. As well, we prove a conjecture posed by Bruce Ebanks in [2].
On convexity and Schoenberg's variation diminishing splines
International Nuclear Information System (INIS)
Feng, Yuyu; Kozak, J.
1992-11-01
In the paper we characterize a convex function by the monotonicity of a particular variation diminishing spline sequence. The result extends the property known for the Bernstein polynomial sequence. (author). 4 refs
Critical heat flux for downward-facing pool boiling on CANDU calandria tube surface
Energy Technology Data Exchange (ETDEWEB)
Behdadi, Azin, E-mail: behdada@mcmaster.ca; Talebi, Farshad; Luxat, John
2017-04-15
Highlights: • Pressure tube-calandria tube contact may challenge fuel channel integrity in CANDU. • Critical heat flux variation is predicted on the outer surface of CANDU calandria tube. • A two-phase boundary layer flow driven by buoyancy is modeled on the surface. • Different slip ratios and flow regimes are considered inside the boundary layer. • Subcooling effects are added to the model using wall heat flux partitioning. - Abstract: One accident scenario in CANDU reactors that can challenge the integrity of the primary pressure boundary is a loss of coolant accident, referred to as critical break LOCA, in which the pressure tube (PT) can undergo thermal creep strain deformation and contact its calandria tube (CT). In such case, rapid redistribution of stored heat from PT to CT, leads to a large spike in heat flux to the moderator which can cause bubble accumulation and dryout on the CT surface. A challenge to fuel channel integrity is posed if critical heat flux occurs on the surface of the CT and results in sustained film boiling. If the post-dryout temperature becomes sufficiently high then continued creep strain of the PT and CT may lead to fuel channel failure. In this study, a mechanistic model is developed to predict the critical heat flux variations along the downward facing outer surface of CT. The hydrodynamic model considers a liquid macrolayer beneath an elongated vapor slug on the surface. Local dryout is postulated to occur whenever the fresh liquid supply to the macrolayer is not sufficient to compensate for the liquid depletion. A boundary layer analysis is performed, treating the two phase motion as an external buoyancy driven flow. The model shows good agreement with the available experimental data and has been modified to take into account the effect of subcooling.
Recent characterizations of generalized convexity in convexity in cooperative game thoery
Energy Technology Data Exchange (ETDEWEB)
Driessen, T.
1994-12-31
The notion of convexity for a real-valued function on the power set of the finite set N (the so-called cooperative game with player set N) is defined as in other mathematical fields. The study of convexity plays an important role within the field of cooperative game theory because the application of the solution part of game theory to convex games provides elegant results for the solution concepts involved. Especially, the well known solution concept called core is, for convex games, very well characterized. The current paper focuses on a notion of generalized convexity, called k- convexity, for cooperative n-person games. Due to very recent characterizations of convexity for cooperative games, the goal is to provide similar new characterizations of k-convexity. The main characterization states that for the k-convexity of an n-person game it is both necessary and sufficient that half of all the so-called marginal worth vectors belong to the core of the game. Here it is taken into account whether a marginal worth vector corresponds to an even or odd ordering of k elements of the n-person player set N. Another characterization of k-convexity is presented in terms of a so-called finite min-modular decomposition. That is, some specific cover game of a k-convex game can be decomposed as the minimum of a finite number of modular (or additive) games. Finally it is established that the k-convexity of a game can be characterized in terms of the second order partial derivates of the so-called multilinear extension of the game.
Hermitian harmonic maps into convex balls
International Nuclear Information System (INIS)
Li Zhenyang; Xi Zhang
2004-07-01
In this paper, we consider Hermitian harmonic maps from Hermitian manifolds into convex balls. We prove that there exist no non-trivial Hermitian harmonic maps from closed Hermitian manifolds into convex balls, and we use the heat flow method to solve the Dirichlet problem for Hermitian harmonic maps when the domain is compact Hermitian manifold with non-empty boundary. The case where the domain manifold is complete(noncompact) is also studied. (author)
Counting convex polygons in planar point sets
Mitchell, J.S.B.; Rote, G.; Sundaram, Gopalakrishnan; Woeginger, G.J.
1995-01-01
Given a set S of n points in the plane, we compute in time O(n3) the total number of convex polygons whose vertices are a subset of S. We give an O(m · n3) algorithm for computing the number of convex k-gons with vertices in S, for all values k = 3,…, m; previously known bounds were exponential
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
International Nuclear Information System (INIS)
Allain, J.P.; Rokusek, D.L.; Harilal, S.S.; Nieto-Perez, M.; Skinner, C.H.; Kugel, H.W.; Heim, B.; Kaita, R.; Majeski, R.
2009-01-01
Lithium has enhanced the operational performance of fusion devices such as: TFTR, CDX-U, FTU, T-11 M, and NSTX. Lithium in the solid and liquid state has been studied extensively in laboratory experiments including its erosion and hydrogen-retaining properties. Reductions in physical sputtering up to 40-60% have been measured for deuterated solid and liquid lithium surfaces. Computational modeling indicates that up to a 1:1 deuterium volumetric retention in lithium is possible. This paper presents the results of systematic in situ laboratory experimental studies on the surface chemistry evolution of ATJ graphite under lithium deposition. Results are compared to post-mortem analysis of similar lithium surface coatings on graphite exposed to deuterium discharge plasmas in NSTX. Lithium coatings on plasma-facing components in NSTX have shown substantial reduction of hydrogenic recycling. Questions remain on the role lithium surface chemistry on a graphite substrate has on particle sputtering (physical and chemical) as well as hydrogen isotope recycling. This is particularly due to the lack of in situ measurements of plasma-surface interactions in tokamaks such as NSTX. Results suggest that the lithium bonding state on ATJ graphite is lithium peroxide and with sufficient exposure to ambient air conditions, lithium carbonate is generated. Correlation between both results is used to assess the role of lithium chemistry on the state of lithium bonding and implications on hydrogen pumping and lithium sputtering. In addition, reduction of factors between 10 and 30 reduction in physical sputtering from lithiated graphite compared to pure lithium or carbon is also measured.
Entropy Coherent and Entropy Convex Measures of Risk
Laeven, R.J.A.; Stadje, M.A.
2011-01-01
We introduce two subclasses of convex measures of risk, referred to as entropy coherent and entropy convex measures of risk. We prove that convex, entropy convex and entropy coherent measures of risk emerge as certainty equivalents under variational, homothetic and multiple priors preferences,
On Hadamard-Type Inequalities Involving Several Kinds of Convexity
Directory of Open Access Journals (Sweden)
Dragomir SeverS
2010-01-01
Full Text Available We do not only give the extensions of the results given by Gill et al. (1997 for log-convex functions but also obtain some new Hadamard-type inequalities for log-convex -convex, and -convex functions.
Critical heat flux (CHF) phenomenon on a downward facing curved surface
Energy Technology Data Exchange (ETDEWEB)
Cheung, F.B.; Haddad, K.H.; Liu, Y.C. [Pennsylvania State Univ., University Park, PA (United States). Dept. of Mechanical Engineering
1997-06-01
This report describes a theoretical and experimental study of the boundary layer boiling and critical heat flux phenomena on a downward facing curved heating surface, including both hemispherical and toroidal surfaces. A subscale boundary layer boiling (SBLB) test facility was developed to measure the spatial variation of the critical heat flux and observe the underlying mechanisms. Transient quenching and steady-state boiling experiments were performed in the SBLB facility under both saturated and subcooled conditions to obtain a complete database on the critical heat flux. To complement the experimental effort, an advanced hydrodynamic CHF model was developed from the conservation laws along with sound physical arguments. The model provides a clear physical explanation for the spatial variation of the CHF observed in the SBLB experiments and for the weak dependence of the CHF data on the physical size of the vessel. Based upon the CHF model, a scaling law was established for estimating the local critical heat flux on the outer surface of a heated hemispherical vessel that is fully submerged in water. The scaling law, which compares favorably with all the available local CHF data obtained for various vessel sizes, can be used to predict the local CHF limits on large commercial-size vessels. This technical information represents one of the essential elements that is needed in assessing the efficacy of external cooling of core melt by cavity flooding as a severe accident management strategy. 83 figs., 3 tabs.
Critical heat flux (CHF) phenomenon on a downward facing curved surface
International Nuclear Information System (INIS)
Cheung, F.B.; Haddad, K.H.; Liu, Y.C.
1997-06-01
This report describes a theoretical and experimental study of the boundary layer boiling and critical heat flux phenomena on a downward facing curved heating surface, including both hemispherical and toroidal surfaces. A subscale boundary layer boiling (SBLB) test facility was developed to measure the spatial variation of the critical heat flux and observe the underlying mechanisms. Transient quenching and steady-state boiling experiments were performed in the SBLB facility under both saturated and subcooled conditions to obtain a complete database on the critical heat flux. To complement the experimental effort, an advanced hydrodynamic CHF model was developed from the conservation laws along with sound physical arguments. The model provides a clear physical explanation for the spatial variation of the CHF observed in the SBLB experiments and for the weak dependence of the CHF data on the physical size of the vessel. Based upon the CHF model, a scaling law was established for estimating the local critical heat flux on the outer surface of a heated hemispherical vessel that is fully submerged in water. The scaling law, which compares favorably with all the available local CHF data obtained for various vessel sizes, can be used to predict the local CHF limits on large commercial-size vessels. This technical information represents one of the essential elements that is needed in assessing the efficacy of external cooling of core melt by cavity flooding as a severe accident management strategy. 83 figs., 3 tabs
International Nuclear Information System (INIS)
Zhao, D.W.; Su, G.H.; Tian, W.X.; Sugiyama, K.; Qiu, S.Z.
2008-01-01
Experimental study has been conducted to examine the pool boiling occurs on a relative large downward-facing round surface with a diameter of 300 mm in confined water pool at atmospheric pressure. An artificial neural network (ANN) has been trained successfully based on the experimental data for predicting Nusselt number of transition boiling in the present study. The input parameters of the ANN are wall superheat, ΔT w , the ratio of the gap size to the diameter of the heated surface, δ/D, Prandtl number and Rayleigh number. The output is Nusselt number, Nu. The results show that: Nu decreases with increasing ΔT w , and increases generally with an increase of δ/D. Nu increases with increasing Pr when gap size is smaller than 4.0 mm. And Nu decreases initially and then increases with increasing Pr as gap size bigger than 5.0 mm. The results also indicate that the influence of Grashof number, Gr, could be negligible. Finally, a new correlation was proposed to predict the transition boiling heat transfer under the present condition. The comparisons between the prediction of the new correlation and experimental data show a reasonable agreement
Convex Banding of the Covariance Matrix.
Bien, Jacob; Bunea, Florentina; Xiao, Luo
2016-01-01
We introduce a new sparse estimator of the covariance matrix for high-dimensional models in which the variables have a known ordering. Our estimator, which is the solution to a convex optimization problem, is equivalently expressed as an estimator which tapers the sample covariance matrix by a Toeplitz, sparsely-banded, data-adaptive matrix. As a result of this adaptivity, the convex banding estimator enjoys theoretical optimality properties not attained by previous banding or tapered estimators. In particular, our convex banding estimator is minimax rate adaptive in Frobenius and operator norms, up to log factors, over commonly-studied classes of covariance matrices, and over more general classes. Furthermore, it correctly recovers the bandwidth when the true covariance is exactly banded. Our convex formulation admits a simple and efficient algorithm. Empirical studies demonstrate its practical effectiveness and illustrate that our exactly-banded estimator works well even when the true covariance matrix is only close to a banded matrix, confirming our theoretical results. Our method compares favorably with all existing methods, in terms of accuracy and speed. We illustrate the practical merits of the convex banding estimator by showing that it can be used to improve the performance of discriminant analysis for classifying sound recordings.
Directory of Open Access Journals (Sweden)
Suharso Suharso
2010-06-01
Full Text Available The surface topology of borax crystals grown at a relative supersaturation of 0.21 has been investigated using ex situ atomic force microscopy (AFM. It was found that the cleavage of borax crystals along the (010 face planes has features of the cleavage of layered compounds, exhibiting cleavage steps of low heights. The step heights of the cleavage of the (010 face of borax crystal are from one unit cell to three unit cells of this face. Keywords: AFM, cleavage, borax.
Non-convex multi-objective optimization
Pardalos, Panos M; Žilinskas, Julius
2017-01-01
Recent results on non-convex multi-objective optimization problems and methods are presented in this book, with particular attention to expensive black-box objective functions. Multi-objective optimization methods facilitate designers, engineers, and researchers to make decisions on appropriate trade-offs between various conflicting goals. A variety of deterministic and stochastic multi-objective optimization methods are developed in this book. Beginning with basic concepts and a review of non-convex single-objective optimization problems; this book moves on to cover multi-objective branch and bound algorithms, worst-case optimal algorithms (for Lipschitz functions and bi-objective problems), statistical models based algorithms, and probabilistic branch and bound approach. Detailed descriptions of new algorithms for non-convex multi-objective optimization, their theoretical substantiation, and examples for practical applications to the cell formation problem in manufacturing engineering, the process design in...
A generalization of the convex Kakeya problem
Ahn, Heekap
2012-01-01
We consider the following geometric alignment problem: Given a set of line segments in the plane, find a convex region of smallest area that contains a translate of each input segment. This can be seen as a generalization of Kakeya\\'s problem of finding a convex region of smallest area such that a needle can be turned through 360 degrees within this region. Our main result is an optimal Θ(n log n)-time algorithm for our geometric alignment problem, when the input is a set of n line segments. We also show that, if the goal is to minimize the perimeter of the region instead of its area, then the optimum placement is when the midpoints of the segments coincide. Finally, we show that for any compact convex figure G, the smallest enclosing disk of G is a smallest-perimeter region containing a translate of any rotated copy of G. © 2012 Springer-Verlag Berlin Heidelberg.
Probing convex polygons with X-rays
International Nuclear Information System (INIS)
Edelsbrunner, H.; Skiena, S.S.
1988-01-01
An X-ray probe through a polygon measures the length of intersection between a line and the polygon. This paper considers the properties of various classes of X-ray probes, and shows how they interact to give finite strategies for completely describing convex n-gons. It is shown that (3n/2)+6 probes are sufficient to verify a specified n-gon, while for determining convex polygons (3n-1)/2 X-ray probes are necessary and 5n+O(1) sufficient, with 3n+O(1) sufficient given that a lower bound on the size of the smallest edge of P is known
Recovering convexity in non-associated plasticity
Francfort, Gilles A.
2018-03-01
We quickly review two main non-associated plasticity models, the Armstrong-Frederick model of nonlinear kinematic hardening and the Drucker-Prager cap model. Non-associativity is commonly thought to preclude any kind of variational formulation, be it in a Hencky-type (static) setting, or when considering a quasi-static evolution because non-associativity destroys convexity. We demonstrate that such an opinion is misguided: associativity (and convexity) can be restored at the expense of the introduction of state variable-dependent dissipation potentials.
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
Differential analysis of matrix convex functions
DEFF Research Database (Denmark)
Hansen, Frank; Tomiyama, Jun
2007-01-01
We analyze matrix convex functions of a fixed order defined in a real interval by differential methods as opposed to the characterization in terms of divided differences given by Kraus [F. Kraus, Über konvekse Matrixfunktionen, Math. Z. 41 (1936) 18-42]. We obtain for each order conditions for ma...
Conference on Convex Analysis and Global Optimization
Pardalos, Panos
2001-01-01
There has been much recent progress in global optimization algo rithms for nonconvex continuous and discrete problems from both a theoretical and a practical perspective. Convex analysis plays a fun damental role in the analysis and development of global optimization algorithms. This is due essentially to the fact that virtually all noncon vex optimization problems can be described using differences of convex functions and differences of convex sets. A conference on Convex Analysis and Global Optimization was held during June 5 -9, 2000 at Pythagorion, Samos, Greece. The conference was honoring the memory of C. Caratheodory (1873-1950) and was en dorsed by the Mathematical Programming Society (MPS) and by the Society for Industrial and Applied Mathematics (SIAM) Activity Group in Optimization. The conference was sponsored by the European Union (through the EPEAEK program), the Department of Mathematics of the Aegean University and the Center for Applied Optimization of the University of Florida, by th...
Robust Utility Maximization Under Convex Portfolio Constraints
International Nuclear Information System (INIS)
Matoussi, Anis; Mezghani, Hanen; Mnif, Mohamed
2015-01-01
We study a robust maximization problem from terminal wealth and consumption under a convex constraints on the portfolio. We state the existence and the uniqueness of the consumption–investment strategy by studying the associated quadratic backward stochastic differential equation. We characterize the optimal control by using the duality method and deriving a dynamic maximum principle
Localized Multiple Kernel Learning A Convex Approach
2016-11-22
data. All the aforementioned approaches to localized MKL are formulated in terms of non-convex optimization problems, and deep the- oretical...learning. IEEE Transactions on Neural Networks, 22(3):433–446, 2011. Jingjing Yang, Yuanning Li, Yonghong Tian, Lingyu Duan, and Wen Gao. Group-sensitive
A generalization of the convex Kakeya problem
Ahn, Heekap; Bae, Sangwon; Cheong, Otfried; Gudmundsson, Joachim; Tokuyama, Takeshi; Vigneron, Antoine E.
2013-01-01
segments. We also show that, if the goal is to minimize the perimeter of the region instead of its area, then placing the segments with their midpoint at the origin and taking their convex hull results in an optimal solution. Finally, we show that for any
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.
Directional Convexity and Finite Optimality Conditions.
1984-03-01
system, Necessary Conditions for optimality. Work Unit Number 5 (Optimization and Large Scale Systems) *Istituto di Matematica Applicata, Universita...that R(T) is convex would then imply x(u,T) e int R(T). Cletituto di Matematica Applicata, Universita di Padova, 35100 ITALY. Sponsored by the United
Convexity properties of Hamiltonian group actions
Guillemin, Victor
2005-01-01
This is a monograph on convexity properties of moment mappings in symplectic geometry. The fundamental result in this subject is the Kirwan convexity theorem, which describes the image of a moment map in terms of linear inequalities. This theorem bears a close relationship to perplexing old puzzles from linear algebra, such as the Horn problem on sums of Hermitian matrices, on which considerable progress has been made in recent years following a breakthrough by Klyachko. The book presents a simple local model for the moment polytope, valid in the "generic&rdquo case, and an elementary Morse-theoretic argument deriving the Klyachko inequalities and some of their generalizations. It reviews various infinite-dimensional manifestations of moment convexity, such as the Kostant type theorems for orbits of a loop group (due to Atiyah and Pressley) or a symplectomorphism group (due to Bloch, Flaschka and Ratiu). Finally, it gives an account of a new convexity theorem for moment map images of orbits of a Borel sub...
Some Characterizations of Convex Interval Games
Brânzei, R.; Tijs, S.H.; Alparslan-Gok, S.Z.
2008-01-01
This paper focuses on new characterizations of convex interval games using the notions of exactness and superadditivity. We also relate big boss interval games with concave interval games and obtain characterizations of big boss interval games in terms of exactness and subadditivity.
A generalization of the convex Kakeya problem
Ahn, Heekap; Bae, Sangwon; Cheong, Otfried; Gudmundsson, Joachim; Tokuyama, Takeshi; Vigneron, Antoine E.
2012-01-01
We consider the following geometric alignment problem: Given a set of line segments in the plane, find a convex region of smallest area that contains a translate of each input segment. This can be seen as a generalization of Kakeya's problem
A generalization of the convex Kakeya problem
Ahn, Heekap
2013-09-19
Given a set of line segments in the plane, not necessarily finite, what is a convex region of smallest area that contains a translate of each input segment? This question can be seen as a generalization of Kakeya\\'s problem of finding a convex region of smallest area such that a needle can be rotated through 360 degrees within this region. We show that there is always an optimal region that is a triangle, and we give an optimal Θ(nlogn)-time algorithm to compute such a triangle for a given set of n segments. We also show that, if the goal is to minimize the perimeter of the region instead of its area, then placing the segments with their midpoint at the origin and taking their convex hull results in an optimal solution. Finally, we show that for any compact convex figure G, the smallest enclosing disk of G is a smallest-perimeter region containing a translate of every rotated copy of G. © 2013 Springer Science+Business Media New York.
Dynamic Matchings in Convex Bipartite Graphs
DEFF Research Database (Denmark)
Brodal, Gerth Stølting; Georgiadis, Loukas; Hansen, Kristoffer Arnsfelt
2007-01-01
We consider the problem of maintaining a maximum matching in a convex bipartite graph G = (V,E) under a set of update operations which includes insertions and deletions of vertices and edges. It is not hard to show that it is impossible to maintain an explicit representation of a maximum matching...
Cost Allocation and Convex Data Envelopment
DEFF Research Database (Denmark)
Hougaard, Jens Leth; Tind, Jørgen
such as Data Envelopment Analysis (DEA). The convexity constraint of the BCC model introduces a non-zero slack in the objective function of the multiplier problem and we show that the cost allocation rules discussed in this paper can be used as candidates to allocate this slack value on to the input (or output...
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 ...
Surface acoustic load sensing using a face-shear PIN-PMN-PT single-crystal resonator.
Kim, Kyungrim; Zhang, Shujun; Jiang, Xiaoning
2012-11-01
Pb(In(0.5)Nb(0.5))O(3)-Pb(Mg(1/3)Nb(2/3))O(3)-PbTiO(3) (PIN-PMN-PT) resonators for surface acoustic load sensing are presented in this paper. Different acoustic loads are applied to thickness mode, thickness-shear mode, and face-shear mode resonators, and the electrical impedances at resonance and anti-resonance frequencies are recorded. More than one order of magnitude higher sensitivity (ratio of electrical impedance change to surface acoustic impedance change) at the resonance is achieved for the face-shear-mode resonator compared with other resonators with the same dimensions. The Krimholtz, Leedom, and Matthaei (KLM) model is used to verify the surface acoustic loading effect on the electrical impedance spectrum of face-shear PIN-PMN-PT single-crystal resonators. The demonstrated high sensitivity of face-shear mode resonators to surface loads is promising for a broad range of applications, including artificial skin, biological and chemical sensors, touch screens, and other touch-based sensors.
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.
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.
Displacement Convexity for First-Order Mean-Field Games
Seneci, Tommaso
2018-01-01
Finally, we identify a large class of functions, that depend on solutions of MFGs, which are convex in time. Among these, we find several norms. This convexity gives bounds for the density of solutions of the planning problem.
Convex stoma appliances: an audit of stoma care nurses.
Perrin, Angie
2016-12-08
This article observes the complexities surrounding the use of convex appliances within the specialist sphere of stoma care. It highlights some of the results taken from a small audit carried out with 24 stoma care nurses examining the general use of convex appliances and how usage of convex products has evolved, along with specialist stoma care practice.
Hill, Harold; Johnston, Alan
2007-01-01
The hollow-face illusion, in which a mask appears as a convex face, is a powerful example of binocular depth inversion occurring with a real object under a wide range of viewing conditions. Explanations of the illusion are reviewed and six experiments reported. In experiment 1 the detrimental effect of figural inversion, evidence for the importance of familiarity, was found for other oriented objects. The inversion effect held for masks lit from the side (experiment 2). The illusion was stronger for a mask rotated by 90 degrees lit from its forehead than from its chin, suggesting that familiar patterns of shading enhance the illusion (experiment 2). There were no effects of light source visibility or any left/right asymmetry (experiment 3). In experiments 4-6 we used a 'virtual' hollow face, with illusion strength quantified by the proportion of noise texture needed to eliminate the illusion. Adding characteristic surface colour enhanced the illusion, consistent with the familiar face pigmentation outweighing additional bottom-up cues (experiment 4). There was no difference between perspective and orthographic projection. Photographic negation reduced, but did not eliminate, the illusion, suggesting shading is important but not essential (experiment 5). Absolute depth was not critical, although a shallower mask was given less extreme convexity ratings (experiment 6). We argue that the illusion arises owing to a convexity preference when the raw data have ambiguous interpretations. However, using a familiar object with typical orientation, shading, and pigmentation greatly enhances the effect.
International Nuclear Information System (INIS)
Joshi, M.S.; Trivedi, S.G.
1986-01-01
Microtopographical studies on habit faces of gel grown crystals (of different habits) of iodates of Ba, Sr, and Ca are illustrated and described. Etch patterns on these faces are illustrated and correlated to the observed growth patterns on the respective faces. Growth mechanism of the crystals is explained in light of the observed surface structures and etch pits suitably produced. (author)
Convexity, gauge-dependence and tunneling rates
Energy Technology Data Exchange (ETDEWEB)
Plascencia, Alexis D.; Tamarit, Carlos [Institute for Particle Physics Phenomenology, Durham University,South Road, DH1 3LE (United Kingdom)
2016-10-19
We clarify issues of convexity, gauge-dependence and radiative corrections in relation to tunneling rates. Despite the gauge dependence of the effective action at zero and finite temperature, it is shown that tunneling and nucleation rates remain independent of the choice of gauge-fixing. Taking as a starting point the functional that defines the transition amplitude from a false vacuum onto itself, it is shown that decay rates are exactly determined by a non-convex, false vacuum effective action evaluated at an extremum. The latter can be viewed as a generalized bounce configuration, and gauge-independence follows from the appropriate Nielsen identities. This holds for any election of gauge-fixing that leads to an invertible Faddeev-Popov matrix.
Exact generating function for 2-convex polygons
International Nuclear Information System (INIS)
James, W R G; Jensen, I; Guttmann, A J
2008-01-01
Polygons are described as almost-convex if their perimeter differs from the perimeter of their minimum bounding rectangle by twice their 'concavity index', m. Such polygons are called m-convex polygons and are characterized by having up to m indentations in their perimeter. We first describe how we conjectured the (isotropic) generating function for the case m = 2 using a numerical procedure based on series expansions. We then proceed to prove this result for the more general case of the full anisotropic generating function, in which steps in the x and y directions are distinguished. In doing so, we develop tools that would allow for the case m > 2 to be studied
Solving ptychography with a convex relaxation
Horstmeyer, Roarke; Chen, Richard Y.; Ou, Xiaoze; Ames, Brendan; Tropp, Joel A.; Yang, Changhuei
2015-05-01
Ptychography is a powerful computational imaging technique that transforms a collection of low-resolution images into a high-resolution sample reconstruction. Unfortunately, algorithms that currently solve this reconstruction problem lack stability, robustness, and theoretical guarantees. Recently, convex optimization algorithms have improved the accuracy and reliability of several related reconstruction efforts. This paper proposes a convex formulation of the ptychography problem. This formulation has no local minima, it can be solved using a wide range of algorithms, it can incorporate appropriate noise models, and it can include multiple a priori constraints. The paper considers a specific algorithm, based on low-rank factorization, whose runtime and memory usage are near-linear in the size of the output image. Experiments demonstrate that this approach offers a 25% lower background variance on average than alternating projections, the ptychographic reconstruction algorithm that is currently in widespread use.
Convex nonnegative matrix factorization with manifold regularization.
Hu, Wenjun; Choi, Kup-Sze; Wang, Peiliang; Jiang, Yunliang; Wang, Shitong
2015-03-01
Nonnegative Matrix Factorization (NMF) has been extensively applied in many areas, including computer vision, pattern recognition, text mining, and signal processing. However, nonnegative entries are usually required for the data matrix in NMF, which limits its application. Besides, while the basis and encoding vectors obtained by NMF can represent the original data in low dimension, the representations do not always reflect the intrinsic geometric structure embedded in the data. Motivated by manifold learning and Convex NMF (CNMF), we propose a novel matrix factorization method called Graph Regularized and Convex Nonnegative Matrix Factorization (GCNMF) by introducing a graph regularized term into CNMF. The proposed matrix factorization technique not only inherits the intrinsic low-dimensional manifold structure, but also allows the processing of mixed-sign data matrix. Clustering experiments on nonnegative and mixed-sign real-world data sets are conducted to demonstrate the effectiveness of the proposed method. Copyright © 2014 Elsevier Ltd. All rights reserved.
Convexity, gauge-dependence and tunneling rates
International Nuclear Information System (INIS)
Plascencia, Alexis D.; Tamarit, Carlos
2016-01-01
We clarify issues of convexity, gauge-dependence and radiative corrections in relation to tunneling rates. Despite the gauge dependence of the effective action at zero and finite temperature, it is shown that tunneling and nucleation rates remain independent of the choice of gauge-fixing. Taking as a starting point the functional that defines the transition amplitude from a false vacuum onto itself, it is shown that decay rates are exactly determined by a non-convex, false vacuum effective action evaluated at an extremum. The latter can be viewed as a generalized bounce configuration, and gauge-independence follows from the appropriate Nielsen identities. This holds for any election of gauge-fixing that leads to an invertible Faddeev-Popov matrix.
An easy path to convex analysis and applications
Mordukhovich, Boris S
2013-01-01
Convex optimization has an increasing impact on many areas of mathematics, applied sciences, and practical applications. It is now being taught at many universities and being used by researchers of different fields. As convex analysis is the mathematical foundation for convex optimization, having deep knowledge of convex analysis helps students and researchers apply its tools more effectively. The main goal of this book is to provide an easy access to the most fundamental parts of convex analysis and its applications to optimization. Modern techniques of variational analysis are employed to cl
Convex geometry of quantum resource quantification
Regula, Bartosz
2018-01-01
We introduce a framework unifying the mathematical characterisation of different measures of general quantum resources and allowing for a systematic way to define a variety of faithful quantifiers for any given convex quantum resource theory. The approach allows us to describe many commonly used measures such as matrix norm-based quantifiers, robustness measures, convex roof-based measures, and witness-based quantifiers together in a common formalism based on the convex geometry of the underlying sets of resource-free states. We establish easily verifiable criteria for a measure to possess desirable properties such as faithfulness and strong monotonicity under relevant free operations, and show that many quantifiers obtained in this framework indeed satisfy them for any considered quantum resource. We derive various bounds and relations between the measures, generalising and providing significantly simplified proofs of results found in the resource theories of quantum entanglement and coherence. We also prove that the quantification of resources in this framework simplifies for pure states, allowing us to obtain more easily computable forms of the considered measures, and show that many of them are in fact equal on pure states. Further, we investigate the dual formulation of resource quantifiers, which provide a characterisation of the sets of resource witnesses. We present an explicit application of the results to the resource theories of multi-level coherence, entanglement of Schmidt number k, multipartite entanglement, as well as magic states, providing insight into the quantification of the four resources by establishing novel quantitative relations and introducing new quantifiers, such as a measure of entanglement of Schmidt number k which generalises the convex roof-extended negativity, a measure of k-coherence which generalises the \
On the convexity of relativistic hydrodynamics
International Nuclear Information System (INIS)
Ibáñez, José M; Martí, José M; Cordero-Carrión, Isabel; Miralles, Juan A
2013-01-01
The relativistic hydrodynamic system of equations for a perfect fluid obeying a causal equation of state is hyperbolic (Anile 1989 Relativistic Fluids and Magneto-Fluids (Cambridge: Cambridge University Press)). In this report, we derive the conditions for this system to be convex in terms of the fundamental derivative of the equation of state (Menikoff and Plohr1989 Rev. Mod. Phys. 61 75). The classical limit is recovered. Communicated by L Rezzolla (note)
Dynamic Convex Duality in Constrained Utility Maximization
Li, Yusong; Zheng, Harry
2016-01-01
In this paper, we study a constrained utility maximization problem following the convex duality approach. After formulating the primal and dual problems, we construct the necessary and sufficient conditions for both the primal and dual problems in terms of FBSDEs plus additional conditions. Such formulation then allows us to explicitly characterize the primal optimal control as a function of the adjoint process coming from the dual FBSDEs in a dynamic fashion and vice versa. Moreover, we also...
Optimal skill distribution under convex skill costs
Directory of Open Access Journals (Sweden)
Tin Cheuk Leung
2018-03-01
Full Text Available This paper studies optimal distribution of skills in an optimal income tax framework with convex skill constraints. The problem is cast as a social planning problem where a redistributive planner chooses how to distribute a given amount of aggregate skills across people. We find that optimal skill distribution is either perfectly equal or perfectly unequal, but an interior level of skill inequality is never optimal.
Convex Hull Aided Registration Method (CHARM).
Fan, Jingfan; Yang, Jian; Zhao, Yitian; Ai, Danni; Liu, Yonghuai; Wang, Ge; Wang, Yongtian
2017-09-01
Non-rigid registration finds many applications such as photogrammetry, motion tracking, model retrieval, and object recognition. In this paper we propose a novel convex hull aided registration method (CHARM) to match two point sets subject to a non-rigid transformation. First, two convex hulls are extracted from the source and target respectively. Then, all points of the point sets are projected onto the reference plane through each triangular facet of the hulls. From these projections, invariant features are extracted and matched optimally. The matched feature point pairs are mapped back onto the triangular facets of the convex hulls to remove outliers that are outside any relevant triangular facet. The rigid transformation from the source to the target is robustly estimated by the random sample consensus (RANSAC) scheme through minimizing the distance between the matched feature point pairs. Finally, these feature points are utilized as the control points to achieve non-rigid deformation in the form of thin-plate spline of the entire source point set towards the target one. The experimental results based on both synthetic and real data show that the proposed algorithm outperforms several state-of-the-art ones with respect to sampling, rotational angle, and data noise. In addition, the proposed CHARM algorithm also shows higher computational efficiency compared to these methods.
Generalized vector calculus on convex domain
Agrawal, Om P.; Xu, Yufeng
2015-06-01
In this paper, we apply recently proposed generalized integral and differential operators to develop generalized vector calculus and generalized variational calculus for problems defined over a convex domain. In particular, we present some generalization of Green's and Gauss divergence theorems involving some new operators, and apply these theorems to generalized variational calculus. For fractional power kernels, the formulation leads to fractional vector calculus and fractional variational calculus for problems defined over a convex domain. In special cases, when certain parameters take integer values, we obtain formulations for integer order problems. Two examples are presented to demonstrate applications of the generalized variational calculus which utilize the generalized vector calculus developed in the paper. The first example leads to a generalized partial differential equation and the second example leads to a generalized eigenvalue problem, both in two dimensional convex domains. We solve the generalized partial differential equation by using polynomial approximation. A special case of the second example is a generalized isoperimetric problem. We find an approximate solution to this problem. Many physical problems containing integer order integrals and derivatives are defined over arbitrary domains. We speculate that future problems containing fractional and generalized integrals and derivatives in fractional mechanics will be defined over arbitrary domains, and therefore, a general variational calculus incorporating a general vector calculus will be needed for these problems. This research is our first attempt in that direction.
Convexities move because they contain matter.
Barenholtz, Elan
2010-09-22
Figure-ground assignment to a contour is a fundamental stage in visual processing. The current paper introduces a novel, highly general dynamic cue to figure-ground assignment: "Convex Motion." Across six experiments, subjects showed a strong preference to assign figure and ground to a dynamically deforming contour such that the moving contour segment was convex rather than concave. Experiments 1 and 2 established the preference across two different kinds of deformational motion. Additional experiments determined that this preference was not due to fixation (Experiment 3) or attentional mechanisms (Experiment 4). Experiment 5 found a similar, but reduced bias for rigid-as opposed to deformational-motion, and Experiment 6 demonstrated that the phenomenon depends on the global motion of the effected contour. An explanation of this phenomenon is presented on the basis of typical natural deformational motion, which tends to involve convex contour projections that contain regions consisting of physical "matter," as opposed to concave contour indentations that contain empty space. These results highlight the fundamental relationship between figure and ground, perceived shape, and the inferred physical properties of an object.
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 ...
A New Interpolation Approach for Linearly Constrained Convex Optimization
Espinoza, Francisco
2012-08-01
In this thesis we propose a new class of Linearly Constrained Convex Optimization methods based on the use of a generalization of Shepard\\'s interpolation formula. We prove the properties of the surface such as the interpolation property at the boundary of the feasible region and the convergence of the gradient to the null space of the constraints at the boundary. We explore several descent techniques such as steepest descent, two quasi-Newton methods and the Newton\\'s method. Moreover, we implement in the Matlab language several versions of the method, particularly for the case of Quadratic Programming with bounded variables. Finally, we carry out performance tests against Matab Optimization Toolbox methods for convex optimization and implementations of the standard log-barrier and active-set methods. We conclude that the steepest descent technique seems to be the best choice so far for our method and that it is competitive with other standard methods both in performance and empirical growth order.
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.
International Nuclear Information System (INIS)
Guix, Benjamin; Finestres, Fernando; Tello, Jose-Ignacio; Palma, Cesar; Martinez, Antonio; Guix, Jose-Ramon; Guix, Ricardo
2000-01-01
Purpose: To analyze the results obtained in a prospective group of patients with basal or squamous cell skin carcinomas of the face treated by high-dose-rate (HDR) brachytherapy via custom-made surface molds. Methods and Materials: A total of 136 patients with basal or squamous cell carcinomas of the face were treated between March 1992 and March 1997 by surface molds and HDR brachytherapy with iridium-192. Nineteen patients were treated with standard Brock applicators and 117 patients with custom-made polymethyl methacrylate applicators, built over a plaster mold obtained of the patient's face. Minimum dose administered to the tumor was 6000 to 6500 cGy in 33 to 36 fractions at 180 cGy/fraction in lesions of up to 4 cm. Lesions greater than 4 cm were boosted up to 7500-8000 cGy after a 3-week pause. Results: With the custom-made surface molds, the dose distribution was uniform in the surface of the skin and at 5 mm depth in the whole area of the applicator. Differences between the areas of maximum and minimum dose at this depth never reached values higher than 5% of the prescribed dose. At the edges of the custom-made molds dose gradient was sharp, with the detected dose at 5 mm from the applicator being negligible. All the patients were complete responders. There were 3 local recurrences, 1/73 patients treated for primary tumor and 2/63 patients treated for recurrent tumor. Actuarial local control at 5 years for all patients was 98%, for those patients with primary tumors 99%, and for recurrent patients 87%. The treatment tolerance was excellent in all cases. No severe, early, or late, complications were detected. Conclusions: Radiotherapy is a highly effective treatment of skin carcinomas of the face. Custom-made molds, to be used in conjunction with HDR brachytherapy equipment, make possible a uniform dose distribution, with a sharp dose gradient in the limits of applicators. Custom-made surface molds are easy and safe to use, and they fit very accurately for
On fractal properties of equipotentials over a real rough surface faced to plasma in fusion devices
International Nuclear Information System (INIS)
Budaev, V.P.; Yakovlev, M.
2008-01-01
We consider a sheath region bounded by a corrugated surface of material conductor and a flat boundary held to a constant voltage bias. The real profile of the film deposited from plasma on a limiter in a fusion device was used in numerical solving of the Poisson's equation to find a profile of electrostatic potential. The rough surface influences the equipotential lines over the surface. We characterized a shape of equipotential lines by a fractal dimension. The long-range correlation in the potential field is imposed by the non-trivial fractal structure of the surface. Dust particles bounced in such irregular potential field can accelerate due to the Fermi acceleration. (author)
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
Li, Huibin
2011-09-01
This paper presents a mesh-based approach for 3D face recognition using a novel local shape descriptor and a SIFT-like matching process. Both maximum and minimum curvatures estimated in the 3D Gaussian scale space are employed to detect salient points. To comprehensively characterize 3D facial surfaces and their variations, we calculate weighted statistical distributions of multiple order surface differential quantities, including histogram of mesh gradient (HoG), histogram of shape index (HoS) and histogram of gradient of shape index (HoGS) within a local neighborhood of each salient point. The subsequent matching step then robustly associates corresponding points of two facial surfaces, leading to much more matched points between different scans of a same person than the ones of different persons. Experimental results on the Bosphorus dataset highlight the effectiveness of the proposed method and its robustness to facial expression variations. © 2011 IEEE.
Di Nucci, Carmine
2018-05-01
This note examines the two-dimensional unsteady isothermal free surface flow of an incompressible fluid in a non-deformable, homogeneous, isotropic, and saturated porous medium (with zero recharge and neglecting capillary effects). Coupling a Boussinesq-type model for nonlinear water waves with Darcy's law, the two-dimensional flow problem is solved using one-dimensional model equations including vertical effects and seepage face. In order to take into account the seepage face development, the system equations (given by the continuity and momentum equations) are completed by an integral relation (deduced from the Cauchy theorem). After testing the model against data sets available in the literature, some numerical simulations, concerning the unsteady flow through a rectangular dam (with an impermeable horizontal bottom), are presented and discussed.
Convex functions and optimization methods on Riemannian manifolds
Udrişte, Constantin
1994-01-01
This unique monograph discusses the interaction between Riemannian geometry, convex programming, numerical analysis, dynamical systems and mathematical modelling. The book is the first account of the development of this subject as it emerged at the beginning of the 'seventies. A unified theory of convexity of functions, dynamical systems and optimization methods on Riemannian manifolds is also presented. Topics covered include geodesics and completeness of Riemannian manifolds, variations of the p-energy of a curve and Jacobi fields, convex programs on Riemannian manifolds, geometrical constructions of convex functions, flows and energies, applications of convexity, descent algorithms on Riemannian manifolds, TC and TP programs for calculations and plots, all allowing the user to explore and experiment interactively with real life problems in the language of Riemannian geometry. An appendix is devoted to convexity and completeness in Finsler manifolds. For students and researchers in such diverse fields as pu...
CVXPY: A Python-Embedded Modeling Language for Convex Optimization
Diamond, Steven; Boyd, Stephen
2016-01-01
CVXPY is a domain-specific language for convex optimization embedded in Python. It allows the user to express convex optimization problems in a natural syntax that follows the math, rather than in the restrictive standard form required by solvers. CVXPY makes it easy to combine convex optimization with high-level features of Python such as parallelism and object-oriented design. CVXPY is available at http://www.cvxpy.org/ under the GPL license, along with documentation and examples.
CVXPY: A Python-Embedded Modeling Language for Convex Optimization.
Diamond, Steven; Boyd, Stephen
2016-04-01
CVXPY is a domain-specific language for convex optimization embedded in Python. It allows the user to express convex optimization problems in a natural syntax that follows the math, rather than in the restrictive standard form required by solvers. CVXPY makes it easy to combine convex optimization with high-level features of Python such as parallelism and object-oriented design. CVXPY is available at http://www.cvxpy.org/ under the GPL license, along with documentation and examples.
Hydroxylated crystalline edingtonite silica faces as models for the amorphous silica surface
Energy Technology Data Exchange (ETDEWEB)
Tosoni, S; Civalleri, B; Ugliengo, P [Dipartimento di Chimica IFM and NIS (Centre of Excellence), Universita di Torino, Via P. Giuria 7, 10125 Torino - ITALY (Italy); Pascale, F [Laboratoire de Cristallographie ed Modelisation des Materiaux Mineraux et Biologiques, UMR-CNRS-7036. Universite Henri Poincare - Nancy I, B.P. 239, 54506 Vandoeuvre-les-Nancy Cedex 05 - FRANCE (France)], E-mail: piero.ugliengo@unito.it
2008-06-01
Fully hydroxylated surfaces derived from crystalline edingtonite were adopted to model the variety of sites known to exist at the amorphous silica surface, namely isolated, geminal and interacting silanols. Structures, energetics and vibrational features of the surfaces either bare or in contact with water were modelled at DFT level using the B3LYP functional with a GTO basis set of double-zeta polarized quality using the periodic ab-initio CRYSTAL06 code. Simulated infrared spectra of both dry and water wet edingtonite surfaces were in excellent agreement with the experimental ones recorded on amorphous silica. Water interaction energies were compared with microcalorimetric differential heats of adsorption data showing good agreement, albeit computed ones being slightly underestimated due to the lack of dispersive forces in the B3LYP functional.
Surface segregation of low-Z elements on plasma-facing materials
International Nuclear Information System (INIS)
Qian Jiapu; Liu Xiang
1994-10-01
Surface segregation behavior of low-Z elements, e.g., lithium and beryllium on ternary alloy Al-Li-Mg and Binary alloy Cu-Be has been observed. The experiments were performed by means of Secondary Ion Mass Spectroscopy (SIMS) and Auger Electron Spectroscopy (AEA). The experimental results of Al-Li-Mg alloy indicated that lithium concentration on the specimen surface reached approximately 100% in the temperature range of 150 to 300 degree C, which can be explained by Gibbsian segregation theory. The depth profile of Li showed that there was some broadening resulting from recoil implantation by high energy Ar ion bombardment. When the specimen temperature exceeded 360 degree C, beryllium, the impurity element in the alloy was found to segregate to the surface. For this reason, another experiment on surface segregation of Cu-Be alloy was carried out by SIMS and AES, the surface analysis utilizing in-situ AES analysis revealed that the surface was enriched by Be and O at elevated temperature, considering the chemical affinity of Be and O, the principal driving force of segregation was attributed to the oxygen partial pressure in the atmosphere. The depth profile of Be in the alloy was also investigated. (9 figs.)
Convex blind image deconvolution with inverse filtering
Lv, Xiao-Guang; Li, Fang; Zeng, Tieyong
2018-03-01
Blind image deconvolution is the process of estimating both the original image and the blur kernel from the degraded image with only partial or no information about degradation and the imaging system. It is a bilinear ill-posed inverse problem corresponding to the direct problem of convolution. Regularization methods are used to handle the ill-posedness of blind deconvolution and get meaningful solutions. In this paper, we investigate a convex regularized inverse filtering method for blind deconvolution of images. We assume that the support region of the blur object is known, as has been done in a few existing works. By studying the inverse filters of signal and image restoration problems, we observe the oscillation structure of the inverse filters. Inspired by the oscillation structure of the inverse filters, we propose to use the star norm to regularize the inverse filter. Meanwhile, we use the total variation to regularize the resulting image obtained by convolving the inverse filter with the degraded image. The proposed minimization model is shown to be convex. We employ the first-order primal-dual method for the solution of the proposed minimization model. Numerical examples for blind image restoration are given to show that the proposed method outperforms some existing methods in terms of peak signal-to-noise ratio (PSNR), structural similarity (SSIM), visual quality and time consumption.
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.)
Directory of Open Access Journals (Sweden)
Y. Nobuta
2017-08-01
Full Text Available In the present study, an additional deuterium (D ion irradiation was performed against long-term samples mounted on the helical coil can and in the outer private region in the LHD during the 17th experimental campaign. Based on the release behavior of the D and hydrogen (H retained during the experimental campaign, the difference of release behavior at the top surface and in bulk of modified surfaces is discussed. Almost all samples on the helical coil can were erosion-dominant and some samples were covered with boron or carbon, while a very thick carbon films were formed in the outer private region. In the erosion-dominant area, the D desorbed at much lower temperatures compared to that of H retained during the LHD plasma operation. For the samples covered with boron, the D tended to desorb at lower temperatures compared to H. For the carbon deposition samples, the D desorbed at much higher temperatures compared to no deposition and boron-covered samples, which was very similar to that of H. The D retention capabilities at the top surface of carbon and boron films were 2–3 times higher than no deposition area. The results indicate that the retention and release behavior at the top surface of the modified layer can be different from that of bulk substrate material.
International Nuclear Information System (INIS)
Wu, C.H.
1987-01-01
Tritium permeation through first walls, limiters or divertors subjected to energetic tritium charge exchange neutral bombardment is a potentially serious problem area for advanced D-T reactors operating at elevated temperatures. High concentrations of tritium in the near surface region can be reached by implantation of the charge neutral flux combined with a relatively slow recombination of these atoms into molecules at the plasma/ first wall interface. A concentration gradient is established, causing tritium to diffuse into the bulk and essentially to the outer wall surface where it can enter the first wall coolant. Since tritium separation from cooling water is very costly, release of even a small fraction of tritium to the environment could pose undesirable safety problems. Therefore, it is necessary to reduce the tritium permeation. An analysis of the way of inhibition has been made. The tritium interacts with the solid surface of the plasma facing components, resulting in trapping and material erosion, and posing problems with respect to plasma density control. The erosion of the plasma facing component materials is mainly caused by physical and chemical erosion. A detailed analysis of chemical erosion by tritium has been performed and the results are described. (author)
INdAM Workshop on Analytic Aspects of Convexity
Colesanti, Andrea; Gronchi, Paolo
2018-01-01
This book presents the proceedings of the international conference Analytic Aspects in Convexity, which was held in Rome in October 2016. It offers a collection of selected articles, written by some of the world’s leading experts in the field of Convex Geometry, on recent developments in this area: theory of valuations; geometric inequalities; affine geometry; and curvature measures. The book will be of interest to a broad readership, from those involved in Convex Geometry, to those focusing on Functional Analysis, Harmonic Analysis, Differential Geometry, or PDEs. The book is a addressed to PhD students and researchers, interested in Convex Geometry and its links to analysis.
Highly efficient absorption of visible and near infrared light in convex gold and nickel grooves
DEFF Research Database (Denmark)
Eriksen, René Lynge; Beermann, Jonas; Søndergaard, Thomas
The realization of nonresonant light absorption with nanostructured metal surfaces by making practical use of nanofocusing optical energy in tapered plasmonic waveguides, is of one of the most fascinating and fundamental phenomena in plasmonics [1,2]. We recently realized broadband light absorption...... in gold via adiabatic nanofocusing of gap surface plasmon modes in well-defined geometries of ultra-sharp convex grooves and being excited by scattering off subwavelength-sized wedges [3]....
Meso-scale wrinkled coatings to improve heat transfers of surfaces facing ambient air
International Nuclear Information System (INIS)
Kakiuchida, Hiroshi; Tajiri, Koji; Tazawa, Masato; Yoshimura, Kazuki; Shimono, Kazuaki; Nakagawa, Yukio; Takahashi, Kazuhiro; Fujita, Keisuke; Myoko, Masumi
2015-01-01
Meso-scale (micrometer-to submillimeter-scale) wrinkled surfaces coated on steel sheets used in outdoor storage and transport facilities for industrial low-temperature liquids were discovered to efficiently increase convective heat transfer between ambient air and the surface. The radiative and convective heat transfer coefficients of various wrinkled surfaces, which were formed by coating steel sheets with several types of shrinkable paints, were examined. The convective heat transfer coefficient of a surface colder than ambient air monotonically changed with average height difference and interval distance of the wrinkle undulation, where the proportions were 0.0254 and 0.0054 W/m 2 /K/μm, respectively. With this wrinkled coating, users can lower the possibility of condensation and reduce rust and maintenance cost of facilities for industrial low-temperature liquids. From the point of view of manufacturers, this coating method can be easily adapted to conventional manufacturing processes. - Highlights: • Various wrinkled surfaces were fabricated by a practical process. • Topographical effect on convection was parameterized separately from radiation. • Meso-scale wrinkled coatings increased convective heat transfer with ambient air. • Maintenance cost of outdoor steel sheets due to condensation can be reduced
SU-D-BRA-02: Motion Assessment During Open Face Mask SRS Using CBCT and Surface Monitoring
International Nuclear Information System (INIS)
Williams, BB; Fox, CJ; Hartford, AC; Gladstone, DJ
2016-01-01
Purpose: To assess the robustness of immobilization using open-face mask technology for linac-based stereotactic radiosurgery (SRS) with multiple non-coplanar arcs via repeated CBCT acquisition, with comparison to contemporaneous optical surface tracking data. Methods: 25 patients were treated in open faced masks with cranial SRS using 3–4 non-coplanar arcs. Repeated CBCT imaging was performed to verify the maintenance of proper patient positioning during treatment. Initial patient positioning was performed based on prescribed shifts and optical surface tracking. Positioning refinements employed rigid 3D-matching of the planning CT and CBCT images and were implemented via automated 6DOF couch control. CBCT imaging was repeated following the treatment of all non-transverse beams with associated couch kicks. Detected patient translations and rotations were recorded and automatically corrected. Optical surface tracking was applied throughout the treatments to monitor motion, and this contemporaneous patient positioning data was recorded to compare against CBCT data and 6DOF couch adjustments. Results: Initial patient positions were refined on average by translations of 3±1mm and rotations of ±0.9-degrees. Optical surface tracking corroborated couch corrections to within 1±1mm and ±0.4-degrees. Following treatment of the transverse and subsequent superior-oblique beam, average translations of 0.6±0.4mm and rotations of ±0.4-degrees were reported via CBCT, with optical surface tracking in agreement to within 1.1±0.6mm and ±0.6-degrees. Following treatment of the third beam, CBCT indicated additional translations of 0.4±0.2mm and rotations of ±0.3-degrees. Cumulative couch corrections resulted in 0.7 ± 0.4mm average magnitude translations and rotations of ±0.4-degrees. Conclusion: Based on CBCT measurements of patients during SRS, the open face mask maintained patient positioning to within 1.5mm and 1-degree with >95% confidence. Patient positioning
SU-D-BRA-02: Motion Assessment During Open Face Mask SRS Using CBCT and Surface Monitoring
Energy Technology Data Exchange (ETDEWEB)
Williams, BB; Fox, CJ; Hartford, AC; Gladstone, DJ [Dartmouth-Hitchcock Medical Center, Lebanon, NH (Lebanon)
2016-06-15
Purpose: To assess the robustness of immobilization using open-face mask technology for linac-based stereotactic radiosurgery (SRS) with multiple non-coplanar arcs via repeated CBCT acquisition, with comparison to contemporaneous optical surface tracking data. Methods: 25 patients were treated in open faced masks with cranial SRS using 3–4 non-coplanar arcs. Repeated CBCT imaging was performed to verify the maintenance of proper patient positioning during treatment. Initial patient positioning was performed based on prescribed shifts and optical surface tracking. Positioning refinements employed rigid 3D-matching of the planning CT and CBCT images and were implemented via automated 6DOF couch control. CBCT imaging was repeated following the treatment of all non-transverse beams with associated couch kicks. Detected patient translations and rotations were recorded and automatically corrected. Optical surface tracking was applied throughout the treatments to monitor motion, and this contemporaneous patient positioning data was recorded to compare against CBCT data and 6DOF couch adjustments. Results: Initial patient positions were refined on average by translations of 3±1mm and rotations of ±0.9-degrees. Optical surface tracking corroborated couch corrections to within 1±1mm and ±0.4-degrees. Following treatment of the transverse and subsequent superior-oblique beam, average translations of 0.6±0.4mm and rotations of ±0.4-degrees were reported via CBCT, with optical surface tracking in agreement to within 1.1±0.6mm and ±0.6-degrees. Following treatment of the third beam, CBCT indicated additional translations of 0.4±0.2mm and rotations of ±0.3-degrees. Cumulative couch corrections resulted in 0.7 ± 0.4mm average magnitude translations and rotations of ±0.4-degrees. Conclusion: Based on CBCT measurements of patients during SRS, the open face mask maintained patient positioning to within 1.5mm and 1-degree with >95% confidence. Patient positioning
International Nuclear Information System (INIS)
Kim, Ji Hoon; Ahn, Ho Seon; Kim, Ji Min
2016-01-01
Recently, graphene, carbon in two dimensions, were highlighted as a good heat transfer materials, according to its high thermal conductivity. Lateral conduction and water absorption into the structure helped graphene films to inhibit the formation of hot spots, which means increasing of critical heat flux (CHF) and boiling heat transfer coefficient (BHTC) performances. In this study, we report a promising increase of CHF and BHTC results with 2D graphene films. Furthermore, we tried to observe bubble behavior via high-speed visualization to investigate a relationship between bubble behavior and pool boiling performances in downward facing boiling. The effect of graphene film coating on the pool boiling performances of upward and downward facing heater surface were examined. 2D- and 3D- graphene film showed good enhancement results on the CHF (by 111% and 60%) and BHTC (by 40% and 20-25%) performances. Bubble behavior change was significant factor on the CHF and BHTC performances in downward facing boiling. The amount of evaporation heat flux was calculated from the velocity, bubble diameter, frequency, orientation angle and superheat that the post-products of the high-speed visualization
Multi-Period Trading via Convex Optimization
DEFF Research Database (Denmark)
Boyd, Stephen; Busseti, Enzo; Diamond, Steve
2017-01-01
We consider a basic model of multi-period trading, which can be used to evaluate the performance of a trading strategy. We describe a framework for single-period optimization, where the trades in each period are found by solving a convex optimization problem that trades oﬀ expected return, risk......, transaction cost and holding cost such as the borrowing cost for shorting assets. We then describe a multi-period version of the trading method, where optimization is used to plan a sequence of trades, with only the ﬁrst one executed, using estimates of future quantities that are unknown when the trades....... In this paper, we do not address a critical component in a trading algorithm, the predictions or forecasts of future quantities. The methods we describe in this paper can be thought of as good ways to exploit predictions, no matter how they are made. We have also developed a companion open-source software...
Wang, Hongbei; Cui, Xiaoqian; Feng, Chunlei; Li, Yuanbo; Zhao, Mengge; Luo, Guangnan; Ding, Hongbin
2017-11-01
Plasma Facing Components (PFCs) in a magnetically confined fusion plasma device will be exposed to high heat load and particle fluxes, and it would cause PFCs' surface morphology to change due to material erosion and redeposition from plasma wall interactions. The state of PFCs' surface condition will seriously affect the performance of long-pulse or steady state plasma discharge in a tokamak; it will even constitute an enormous threat to the operation and the safety of fusion plasma devices. The PFCs' surface morphology evolution measurement could provide important information about PFCs' real-time status or damage situation and it would help to a better understanding of the plasma wall interaction process and mechanism. Meanwhile through monitoring the distribution of dust deposition in a tokamak and providing an upper limit on the amount of loose dust, the PFCs' surface morphology measurement could indirectly contribute to keep fusion operational limits and fusion device safety. Aiming at in situ dynamic monitoring PFCs' surface morphology evolution, a laboratory experimental platform DUT-SIEP (Dalian University of Technology-speckle interferometry experimental platform) based on the speckle interferometry technique has been constructed at Dalian University of Technology (DUT) in China. With directional specific designing and focusing on the real detection condition of EAST (Experimental Advanced Superconducting Tokamak), the DUT-SIEP could realize a variable measurement range, widely increased from 0.1 μm to 300 μm, with high spatial resolution (<1 mm) and ultra-high time resolution (<2 s for EAST measuring conditions). Three main components of the DUT-SIEP are all integrated and synchronized by a time schedule control and data acquisition terminal and coupled with a three-dimensional phase unwrapping algorithm, the surface morphology information of target samples can be obtained and reconstructed in real-time. A local surface morphology of the real divertor
Conditionally exponential convex functions on locally compact groups
International Nuclear Information System (INIS)
Okb El-Bab, A.S.
1992-09-01
The main results of the thesis are: 1) The construction of a compact base for the convex cone of all conditionally exponential convex functions. 2) The determination of the extreme parts of this cone. Some supplementary lemmas are proved for this purpose. (author). 8 refs
Approximate convex hull of affine iterated function system attractors
International Nuclear Information System (INIS)
Mishkinis, Anton; Gentil, Christian; Lanquetin, Sandrine; Sokolov, Dmitry
2012-01-01
Highlights: ► We present an iterative algorithm to approximate affine IFS attractor convex hull. ► Elimination of the interior points significantly reduces the complexity. ► To optimize calculations, we merge the convex hull images at each iteration. ► Approximation by ellipses increases speed of convergence to the exact convex hull. ► We present a method of the output convex hull simplification. - Abstract: In this paper, we present an algorithm to construct an approximate convex hull of the attractors of an affine iterated function system (IFS). We construct a sequence of convex hull approximations for any required precision using the self-similarity property of the attractor in order to optimize calculations. Due to the affine properties of IFS transformations, the number of points considered in the construction is reduced. The time complexity of our algorithm is a linear function of the number of iterations and the number of points in the output approximate convex hull. The number of iterations and the execution time increases logarithmically with increasing accuracy. In addition, we introduce a method to simplify the approximate convex hull without loss of accuracy.
Entropy coherent and entropy convex measures of risk
Laeven, Roger; Stadje, M.A.
2010-01-01
We introduce entropy coherent and entropy convex measures of risk and prove a collection of axiomatic characterization and duality results. We show in particular that entropy coherent and entropy convex measures of risk emerge as negative certainty equivalents in (the regular and a generalized
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...
On approximation and energy estimates for delta 6-convex functions.
Saleem, Muhammad Shoaib; Pečarić, Josip; Rehman, Nasir; Khan, Muhammad Wahab; Zahoor, Muhammad Sajid
2018-01-01
The smooth approximation and weighted energy estimates for delta 6-convex functions are derived in this research. Moreover, we conclude that if 6-convex functions are closed in uniform norm, then their third derivatives are closed in weighted [Formula: see text]-norm.
On approximation and energy estimates for delta 6-convex functions
Directory of Open Access Journals (Sweden)
Muhammad Shoaib Saleem
2018-02-01
Full Text Available Abstract The smooth approximation and weighted energy estimates for delta 6-convex functions are derived in this research. Moreover, we conclude that if 6-convex functions are closed in uniform norm, then their third derivatives are closed in weighted L2 $L^{2}$-norm.
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.
Directory of Open Access Journals (Sweden)
Adel Taha Abbas
2016-01-01
Full Text Available A full factorial design technique is used to investigate the effect of machining parameters, namely, spindle speed (N, depth of cut (ap, and table feed rate (Vf, on the obtained surface roughness (Ra and Rt during face milling operation of high strength steel. A second-order regression model was built using least squares method depending on the factorial design results to approximate a mathematical relationship between the surface roughness and the studied process parameters. Analysis of variance was conducted to estimate the significance of each factor and interaction with respect to the surface roughness. For Ra, the results show that spindle speed, depth of cut, and table feed rate have a significant effect on the surface roughness in both linear and quadratic terms. There is also an interaction between depth of cut and feed rate. It also appears that feed rate has the greatest effect on the data variation followed by depth of cut. For Rt, the results show that the table feed rate is the most effective factor followed by the depth of cut, while the spindle speed had a significant small effect only in its quadratic term. The conditions of minimum Ra and Rt are identified through least square optimization. Moreover, multiobjective optimization for minimizing Ra and maximizing metal removal rate Q is conducted and the results are presented.
Fundamentals of convex analysis duality, separation, representation, and resolution
Panik, Michael J
1993-01-01
Fundamentals of Convex Analysis offers an in-depth look at some of the fundamental themes covered within an area of mathematical analysis called convex analysis. In particular, it explores the topics of duality, separation, representation, and resolution. The work is intended for students of economics, management science, engineering, and mathematics who need exposure to the mathematical foundations of matrix games, optimization, and general equilibrium analysis. It is written at the advanced undergraduate to beginning graduate level and the only formal preparation required is some familiarity with set operations and with linear algebra and matrix theory. Fundamentals of Convex Analysis is self-contained in that a brief review of the essentials of these tool areas is provided in Chapter 1. Chapter exercises are also provided. Topics covered include: convex sets and their properties; separation and support theorems; theorems of the alternative; convex cones; dual homogeneous systems; basic solutions and comple...
Steady-state subcooled nucleate boiling on a downward facing hemispherical surface
International Nuclear Information System (INIS)
Haddad, K.H.; Cheung, F.B.
1996-01-01
Steady-state nucleate boiling heat transfer experiments in saturated and subcooled water were conducted. The heating surface was a 0.305 m hemispherical aluminum vessel heated from the inside with water boiling on the outside. It was found that subcooling had very little effect on the nucleate boiling curve in the high heat flux regime where latent heat transport dominated. On the other hand, a relatively large effect of subcooling was observed in the low heat flux regime where sensible heat transport was important. Photographic records of the boiling phenomenon and the bubble dynamics indicated that in the high heat flux regime, boiling in the bottom center region of the vessel was cyclic in nature with a liquid heating phase, a bubble nucleation and growth phase, a bubble coalescence phase, and a large vapor mass ejection phase. At the same heat flux level, the size of the vapor masses was found to decrease from the bottom center toward the upper edge of the vessel, which was consistent with the observed increase in the critical heat flux in the flow direction along the curved heating surface
Directory of Open Access Journals (Sweden)
Hirokata Fukushima
Full Text Available BACKGROUND: The neural system of our closest living relative, the chimpanzee, is a topic of increasing research interest. However, electrophysiological examinations of neural activity during visual processing in awake chimpanzees are currently lacking. METHODOLOGY/PRINCIPAL FINDINGS: In the present report, skin-surface event-related brain potentials (ERPs were measured while a fully awake chimpanzee observed photographs of faces and objects in two experiments. In Experiment 1, human faces and stimuli composed of scrambled face images were displayed. In Experiment 2, three types of pictures (faces, flowers, and cars were presented. The waveforms evoked by face stimuli were distinguished from other stimulus types, as reflected by an enhanced early positivity appearing before 200 ms post stimulus, and an enhanced late negativity after 200 ms, around posterior and occipito-temporal sites. Face-sensitive activity was clearly observed in both experiments. However, in contrast to the robustly observed face-evoked N170 component in humans, we found that faces did not elicit a peak in the latency range of 150-200 ms in either experiment. CONCLUSIONS/SIGNIFICANCE: Although this pilot study examined a single subject and requires further examination, the observed scalp voltage patterns suggest that selective processing of faces in the chimpanzee brain can be detected by recording surface ERPs. In addition, this non-invasive method for examining an awake chimpanzee can be used to extend our knowledge of the characteristics of visual cognition in other primate species.
Chemisorption on the (111) and (100) faces of platinum-tin bimetallic surfaces
Panja, Chameli
2000-10-01
Chemisorption and reaction of CH3OH (methanol), C2H 5OH (ethanol), and H2O (water) on Pt(111) and Sn/Pt(111) alloys, and CO (carbon monoxide), NO (nitric oxide), and C2D 2 (acetylene) on Pt(100) and Sn/Pt(100) have been studied under ultrahigh vacuum conditions using temperature programmed desorption (TPD), Auger electron spectroscopy (AES), low energy electron diffraction (LEED), X-ray photoelectron spectroscopy (XPS) and high resolution electron energy loss spectroscopy (HREELS). Small organic molecules like CH3OH and C2H5OH are potential fuels for low-temperature hydrocarbon fuel cells and it is important to understand the role of tin as a promoter in electrooxidation of these molecules. Also, the catalytic reactions of CO, NO and C2H2 are of considerable interest for improving of automotive exhaust-gas catalytic converters and other heterogeneous catalysts. Ordered Pt-Sn alloys can be prepared by vapor deposition of Sn on Pt surfaces. A (2 x 2) structure (theta Sn = 0.25) and a (√3x√/3)R30° structure are formed on Pt(111), and a c(2 x 2) and (3√2x√2)R45° structures with theta Sn = 0.5 and 0.67, respectively, are formed on Pt(100). CH3OH, C2H5OH and H2O are all weakly bound and reversibly adsorbed on Pt(111) and both of the Sn/Pt(111) alloys under UHV conditions. Alloying Sn into the Pt(111) surface weakens the adsorption of these molecules from that on Pt(111) and leads to a lower reactivity as the surface concentration of Sn increases. TPD measurements reveal a reduction in the saturation coverage and chemisorption bond energy for CO, NO and C2HL chemisorption, on the two Sn/Pt(100)alloys compared to that on Pt(100). CO chemisorption is completely reversible on these two Sn/Pt(100) alloys. However, NO is partially reduced to form N2O on these alloys, so that N2O along with NO and O2 desorption was observed. We propose that dinitrosyl species, i.e., two NO molecules bound to one Pt atom, are intermediates in N2O formation from adsorbed NO on these Sn
Wind effect on currents in a thin surface layer of coastal waters faced open-sea
International Nuclear Information System (INIS)
Nakano, Masanao; Isozaki, Hisaaki; Isozaki, Tokuju; Nemoto, Masashi; Hasunuma, Keiichi; Kitamura, Takashi
2009-01-01
Two-years of continuous observation of wind and current were carried out to investigate the relationship between them in the coastal waters off Tokai-mura, Ibaraki prefecture. Three instruments to measure the current were set in a thin surface layer of 3 m above the strong pycnocline, which is a common feature in coastal waters. Both of the power spectra of wind and currents showed very similar features, an outstanding high peak at 24-hour period and a range of high peaks longer than several-days period. The long term variation of the wind field always contained north-wind component, which contributed to forming the southward current along the shore throughout the year. A high correlation coefficient (0.64) was obtained between the wind and the current at a depth of 0.5 m on the basis of the two-year observation. Harmonic analysis revealed that an outstanding current with 24-hour period was the S 1 component (meteorological tide), and was driven by land and sea breezes. These breezes also contained solar tidal components such as K 1 , P 1 and S 2 . These wind components added their own wind driven currents on the original tidal currents. This meant that land and sea breezes generated wind driven currents with solar tidal periods which behaved like astronomical tidal currents. As result, coastal currents contained pseudo tidal currents which behaved like astronomical tidal currents. (author)
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.
Energy Technology Data Exchange (ETDEWEB)
El-Genk, M.S.; Glebov, A.G. [Univ. of New Mexico, Albuquerque, NM (United States)
1995-09-01
Quenching experiments were performed to investigate the effects of water subcooling and wall thickness on pool boiling from a downward-facing curved surface. Experiments used three copper sections of the same diameter (50.8 mm) and surface radius (148 mm), but different thickness (12.8, 20 and 30 mm). Local and average pool boiling curves were obtained at saturation and 5 K, 10 K, and 14 K subcooling. Water subcooling increased the maximum heat flux, but decreased the corresponding wall superheat. The minimum film boiling heat flux and the corresponding wall superheat, however, increased with increased subcooling. The maximum and minimum film boiling heat fluxes were independent of wall thickness above 20 mm and Biot Number > 0.8, indicating that boiling curves for the 20 and 30 thick sections were representative of quasi steady-state, but not those for the 12.8 mm thick section. When compared with that for a flat surface section of the same thickness, the data for the 12.8 mm thick section showed significant increases in both the maximum heat flux (from 0.21 to 0.41 MW/m{sup 2}) and the minimum film boiling heat flux (from 2 to 13 kW/m{sup 2}) and about 11.5 K and 60 K increase in the corresponding wall superheats, respectively.
Modelling of subcritical free-surface flow over an inclined backward-facing step in a water channel
Directory of Open Access Journals (Sweden)
Šulc Jan
2012-04-01
Full Text Available The contribution deals with the experimental and numerical modelling of subcritical turbulent flow in an open channel with an inclined backward-facing step. The step with the inclination angle α = 20° was placed in the water channel of the cross-section 200×200 mm. Experiments were carried out by means of the PIV and LDA measuring techniques. Numerical simulations were executed by means of the commercial software ANSYS CFX 12.0. Numerical results obtained for twoequation models and EARSM turbulence model completed by transport equations for turbulent energy and specific dissipation rate were compared with experimental data. The modelling was concentrated particularly on the development of the flow separation and on the corresponding changes of free surface.
Decomposability and convex structure of thermal processes
Mazurek, Paweł; Horodecki, Michał
2018-05-01
We present an example of a thermal process (TP) for a system of d energy levels, which cannot be performed without an instant access to the whole energy space. This TP is uniquely connected with a transition between some states of the system, that cannot be performed without access to the whole energy space even when approximate transitions are allowed. Pursuing the question about the decomposability of TPs into convex combinations of compositions of processes acting non-trivially on smaller subspaces, we investigate transitions within the subspace of states diagonal in the energy basis. For three level systems, we determine the set of extremal points of these operations, as well as the minimal set of operations needed to perform an arbitrary TP, and connect the set of TPs with thermomajorization criterion. We show that the structure of the set depends on temperature, which is associated with the fact that TPs cannot increase deterministically extractable work from a state—the conclusion that holds for arbitrary d level system. We also connect the decomposability problem with detailed balance symmetry of an extremal TPs.
Designing Camera Networks by Convex Quadratic Programming
Ghanem, Bernard
2015-05-04
In this paper, we study the problem of automatic camera placement for computer graphics and computer vision applications. We extend the problem formulations of previous work by proposing a novel way to incorporate visibility constraints and camera-to-camera relationships. For example, the placement solution can be encouraged to have cameras that image the same important locations from different viewing directions, which can enable reconstruction and surveillance tasks to perform better. We show that the general camera placement problem can be formulated mathematically as a convex binary quadratic program (BQP) under linear constraints. Moreover, we propose an optimization strategy with a favorable trade-off between speed and solution quality. Our solution is almost as fast as a greedy treatment of the problem, but the quality is significantly higher, so much so that it is comparable to exact solutions that take orders of magnitude more computation time. Because it is computationally attractive, our method also allows users to explore the space of solutions for variations in input parameters. To evaluate its effectiveness, we show a range of 3D results on real-world floorplans (garage, hotel, mall, and airport).
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....
A survey on locally uniformly A-convex algebras
International Nuclear Information System (INIS)
Oudadess, M.
1984-12-01
Using a bornological technic of M. Akkar, we reduce the study of classical questions (spectrum, boundedness of characters, functional calculus, etc.) in locally uniformly A-convex algebras to the Banach case. (author)
Lipschitz estimates for convex functions with respect to vector fields
Directory of Open Access Journals (Sweden)
Valentino Magnani
2012-12-01
Full Text Available We present Lipschitz continuity estimates for a class of convex functions with respect to Hörmander vector fields. These results have been recently obtained in collaboration with M. Scienza, [22].
A note on supercyclic operators in locally convex spaces
Albanese, Angela A.; Jornet, David
2018-01-01
We treat some questions related to supercyclicity of continuous linear operators when acting in locally convex spaces. We extend results of Ansari and Bourdon and consider doubly power bounded operators in this general setting. Some examples are given.
Convex solutions of systems arising from Monge-Ampere equations
Directory of Open Access Journals (Sweden)
Haiyan Wang
2009-10-01
Full Text Available We establish two criteria for the existence of convex solutions to a boundary value problem for weakly coupled systems arising from the Monge-Ampère equations. We shall use fixed point theorems in a cone.
Entropy and convexity for nonlinear partial differential equations.
Ball, John M; Chen, Gui-Qiang G
2013-12-28
Partial differential equations are ubiquitous in almost all applications of mathematics, where they provide a natural mathematical description of many phenomena involving change in physical, chemical, biological and social processes. The concept of entropy originated in thermodynamics and statistical physics during the nineteenth century to describe the heat exchanges that occur in the thermal processes in a thermodynamic system, while the original notion of convexity is for sets and functions in mathematics. Since then, entropy and convexity have become two of the most important concepts in mathematics. In particular, nonlinear methods via entropy and convexity have been playing an increasingly important role in the analysis of nonlinear partial differential equations in recent decades. This opening article of the Theme Issue is intended to provide an introduction to entropy, convexity and related nonlinear methods for the analysis of nonlinear partial differential equations. We also provide a brief discussion about the content and contributions of the papers that make up this Theme Issue.
Displacement Convexity for First-Order Mean-Field Games
Seneci, Tommaso
2018-05-01
In this thesis, we consider the planning problem for first-order mean-field games (MFG). These games degenerate into optimal transport when there is no coupling between players. Our aim is to extend the concept of displacement convexity from optimal transport to MFGs. This extension gives new estimates for solutions of MFGs. First, we introduce the Monge-Kantorovich problem and examine related results on rearrangement maps. Next, we present the concept of displacement convexity. Then, we derive first-order MFGs, which are given by a system of a Hamilton-Jacobi equation coupled with a transport equation. Finally, we identify a large class of functions, that depend on solutions of MFGs, which are convex in time. Among these, we find several norms. This convexity gives bounds for the density of solutions of the planning problem.
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.
International Nuclear Information System (INIS)
Yan-Jun, Gong; Zhen-Sen, Wu; Jia-Ji, Wu
2009-01-01
We present an analytical model of Doppler spectra in backscattering from arbitrary rough convex bodies of revolution rotating around their axes in the global Cartesian coordinate system. This analytical model is applied to analyse Doppler spectra in backscatter from two cones and two cylinders, as well as two ellipsoids of revolution. We numerically analyse the influences of attitude and geometry size of objects on Doppler spectra. The analytical model can give contribution of the surface roughness, attitude and geometry size of convex bodies of revolution to Doppler spectra and may contribute to laser Doppler velocimetry as well as ladar applications
Surgical treatment of convexity focal epilepsy
International Nuclear Information System (INIS)
Shimizu, Hiroyuki; Ishijima, Buichi; Iio, Masaaki.
1987-01-01
We have hitherto applied PET study in 72 epileptic patients. The main contents of their seizures consists of complex partial in 32, elementary partial in 32, generalized in 6, and others in 3 cases. We administered perorally 10 mCi glucose labeled with C11 produced in the JSW Baby Cyclotron for the study of CMRG(cerebral metabolic rate of glucose). The continuous inhalation method of CO 2 and O 2 labeled with O15 produced in the same cyclotron was also employed for measurement of rCBE(cerebral blood flow) and CMRO 2 (cerebral metabolic rate of oxygen). In both studies, epileptic foci were shown as well demarcated hypometabolic zones with decreased CMRG, rCBF or CMRO 2 . The locations of PET diagnosed foci were not contradictory with the clinical symptoms, scalp EEGs or X-ray CT findings. Of the 32 patients with the convexity epileptic foci, 8 patients underwent surgical treatment. Prior to the surgical intervention, subdural strip electrodes were inserted in the four cases for further assessment of focus locations. Subdural EEG disclosed very active brain activity with high amplitude 4 to 5 times scalp EEG and revealed epileptiform discharges most of which were not detected by scalp recording. PET scans did not characterize epileptogenic nature of a lesion. Subdural recording therefore was useful for detecting the foci responsible for habitual seizures in the cases with multiple PET foci. Ambiguous hypometabolic zones on PECT images also could be confirmed by the subdural technique. Of the 8 operated cases, five patients are seizure free, one is signigicantly improved and two are not improved although the postoperative follow-up is too short for precise evaluation. (J.P.N.)
Efficiency and Generalized Convex Duality for Nondifferentiable Multiobjective Programs
Directory of Open Access Journals (Sweden)
Bae KwanDeok
2010-01-01
Full Text Available We introduce nondifferentiable multiobjective programming problems involving the support function of a compact convex set and linear functions. The concept of (properly efficient solutions are presented. We formulate Mond-Weir-type and Wolfe-type dual problems and establish weak and strong duality theorems for efficient solutions by using suitable generalized convexity conditions. Some special cases of our duality results are given.
Two examples of non strictly convex large deviations
De Marco, Stefano; Jacquier, Antoine; Roome, Patrick
2016-01-01
We present two examples of a large deviations principle where the rate function is not strictly convex. This is motivated by a model used in mathematical finance (the Heston model), and adds a new item to the zoology of non strictly convex large deviations. For one of these examples, we show that the rate function of the Cramer-type of large deviations coincides with that of the Freidlin-Wentzell when contraction principles are applied.
Decompositions, partitions, and coverings with convex polygons and pseudo-triangles
Aichholzer, O.; Huemer, C.; Kappes, S.; Speckmann, B.; Tóth, Cs.D.
2007-01-01
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangles. This pseudo-convex decomposition is significantly sparser than either convex decompositions or pseudo-triangulations for planar point sets and simple polygons. We also introduce pseudo-convex
Energy Technology Data Exchange (ETDEWEB)
Seki, Yohji, E-mail: seki.yohji@jaea.go.jp; Ezato, Koichiro; Suzuki, Satoshi; Yokoyama, Kenji; Yamada, Hirokazu; Hirayama, Tomoyuki
2016-11-01
Through R&D for a plasma facing units (PFUs) in an outer vertical target of an ITER full-tungsten (W) divertor, Japan Atomic Energy Agency succeeded in demonstrating the durability of the W divertor shaped by an electrical discharge machining (EDM). To prevent melting of W armors in the PFUs, an adequate technology to meet requirements of a geometrical shape and a tolerance is one of the most important key issues in a manufacturing process. From the necessity, the EDM has been evaluated to control the final shape of the W armor. Though the EDM was known to be advantages such as an easy workability, a potential disadvantage of presence of micro-cracks on the W surface appeared. In order to examine a potential effect of the micro-crack on a heat removal durability, a high heat flux testing was carried out for the W divertor mock-up with the polish and the EDM. As the result, all of the W armors endured the repetitive heat load of 1000 cycles at an absorbed heat flux of more than 20 MW/m{sup 2}, which strongly encourages the realization of the PFUs of the ITER full-W divertor with the various geometrical shape and the high accuracy tolerance.
International Nuclear Information System (INIS)
Seki, Yohji; Ezato, Koichiro; Suzuki, Satoshi; Yokoyama, Kenji; Yamada, Hirokazu; Hirayama, Tomoyuki
2016-01-01
Through R&D for a plasma facing units (PFUs) in an outer vertical target of an ITER full-tungsten (W) divertor, Japan Atomic Energy Agency succeeded in demonstrating the durability of the W divertor shaped by an electrical discharge machining (EDM). To prevent melting of W armors in the PFUs, an adequate technology to meet requirements of a geometrical shape and a tolerance is one of the most important key issues in a manufacturing process. From the necessity, the EDM has been evaluated to control the final shape of the W armor. Though the EDM was known to be advantages such as an easy workability, a potential disadvantage of presence of micro-cracks on the W surface appeared. In order to examine a potential effect of the micro-crack on a heat removal durability, a high heat flux testing was carried out for the W divertor mock-up with the polish and the EDM. As the result, all of the W armors endured the repetitive heat load of 1000 cycles at an absorbed heat flux of more than 20 MW/m"2, which strongly encourages the realization of the PFUs of the ITER full-W divertor with the various geometrical shape and the high accuracy tolerance.
Tritium retention on the surface of stainless steel samples fixed on the plasma-facing wall in LHD
International Nuclear Information System (INIS)
Matsuyama, Masao; Abe, Shinsuke; Nishimura, Kiyohiko; Ashikawa, Naoko; Sagara, Akio; Oya, Yasuhisa; Okuno, Kenji; Yamauchi, Yuji; Nobuta, Yuji
2014-01-01
Effects of pre-heating for retention and distribution of tritium have been studied using samples fixed on the wall of the Large Helical Device during a plasma campaign. The samples were fixed at four different locations. The plasma-facing surface of the samples was covered with deposition layers of different thickness in each sample. Retention behavior in deposition layers was observed using β-ray-induced X-ray spectrometry and imaging plate technique. Pre-heating of the samples in vacuum was changed in a temperature range from 300 to 623 K, and subsequent tritium exposure was carried out at 300 K in every runs. Non-uniformity of tritium distribution clearly appeared even in the as-received samples which was not pre-heated. It is considered, therefore, that non-uniform adsorption sites of tritium have been produced during a formation process of deposition layers. In addition, it was seen that the amount of tritium retention increased with an increase in the pre-heating temperature, indicating that adsorption sites of tritium were newly formed in the deposition layers by heating in vacuum. (author)
Surgery for convexity/parasagittal/falx meningiomas
International Nuclear Information System (INIS)
Ochi, Takashi; Saito, Nobuhito
2013-01-01
Incidence of the complication related with the surgical treatment of meningiomas in the title was reviewed together with consideration of data about progress observation and stereotactic radiosurgery. MEDLINE papers in English were on line searched with keywords contained in above using PubMed System. For the convexity meningioma, 50-141 cases (mean age, 48-58.9 y) with 1.9-3.6 cm or 146.3 mL of the tumor size or volume were reported in 6 literatures (2006-2011), presenting 0% of surgery related death, 1-5.9% of internal medical or 5.5-37.4% of surgical complication, 0-2% of postoperative hemorrhage, 0-15.4% of neurological and 0-15.4% of prolonged/permanent deficits. For the parasagittal/falx meningioma, 46-108 cases (age, 55-58 y) with 1.9-4 cm tumor were reported in 8 literatures (2004-2011), presenting 0-5.7% death, 2-7.4% medical or 5.4-31% surgical complication, 0-3% hemorrhage, 0-15.4 neurologic and 0-15.4% prolonged deficits. For complications after the radiosurgery of the all 3 meningiomas, 41-832 cases (50-60 y) with tumors of 24.7-28 mm or 4.7-7.4 mL were reported in 8 literatures (2003-2012), presenting the incidence of 6.8-26.8% of radiation-related complications like headache, seizures and paralysis necessary for steroid treatment, and 1.20 or 4.80% of permanent morbidity. For the natural history of incidental meningiomas involving tentorium one, 16-144 cases in 6 literatures (2000-2012) revealed the growth rate/y of 1.9-3.9 mm or 0.54-1.15 mL. The outcome of surgical treatment of the meningiomas, a representative benign tumor, was concluded to be rather good as surgery was generally needed only when the disease became symptomatic due to the tumor growth. (T.T.)
Convex unwraps its first grown-up supercomputer
Energy Technology Data Exchange (ETDEWEB)
Manuel, T.
1988-03-03
Convex Computer Corp.'s new supercomputer family is even more of an industry blockbuster than its first system. At a tenfold jump in performance, it's far from just an incremental upgrade over its first minisupercomputer, the C-1. The heart of the new family, the new C-2 processor, churning at 50 million floating-point operations/s, spawns a group of systems whose performance could pass for some fancy supercomputers-namely those of the Cray Research Inc. family. When added to the C-1, Convex's five new supercomputers create the C series, a six-member product group offering a performance range from 20 to 200 Mflops. They mark an important transition for Convex from a one-product high-tech startup to a multinational company with a wide-ranging product line. It's a tough transition but the Richardson, Texas, company seems to be doing it. The extended product line propels Convex into the upper end of the minisupercomputer class and nudges it into the low end of the big supercomputers. It positions Convex in an uncrowded segment of the market in the $500,000 to $1 million range offering 50 to 200 Mflops of performance. The company is making this move because the minisuper area, which it pioneered, quickly became crowded with new vendors, causing prices and gross margins to drop drastically.
Inhibitory competition in figure-ground perception: context and convexity.
Peterson, Mary A; Salvagio, Elizabeth
2008-12-15
Convexity has long been considered a potent cue as to which of two regions on opposite sides of an edge is the shaped figure. Experiment 1 shows that for a single edge, there is only a weak bias toward seeing the figure on the convex side. Experiments 1-3 show that the bias toward seeing the convex side as figure increases as the number of edges delimiting alternating convex and concave regions increases, provided that the concave regions are homogeneous in color. The results of Experiments 2 and 3 rule out a probability summation explanation for these context effects. Taken together, the results of Experiments 1-3 show that the homogeneity versus heterogeneity of the convex regions is irrelevant. Experiment 4 shows that homogeneity of alternating regions is not sufficient for context effects; a cue that favors the perception of the intervening regions as figures is necessary. Thus homogeneity alone does not alone operate as a background cue. We interpret our results within a model of figure-ground perception in which shape properties on opposite sides of an edge compete for representation and the competitive strength of weak competitors is further reduced when they are homogeneous.
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)
Convexity and concavity constants in Lorentz and Marcinkiewicz spaces
Kaminska, Anna; Parrish, Anca M.
2008-07-01
We provide here the formulas for the q-convexity and q-concavity constants for function and sequence Lorentz spaces associated to either decreasing or increasing weights. It yields also the formula for the q-convexity constants in function and sequence Marcinkiewicz spaces. In this paper we extent and enhance the results from [G.J.O. Jameson, The q-concavity constants of Lorentz sequence spaces and related inequalities, Math. Z. 227 (1998) 129-142] and [A. Kaminska, A.M. Parrish, The q-concavity and q-convexity constants in Lorentz spaces, in: Banach Spaces and Their Applications in Analysis, Conference in Honor of Nigel Kalton, May 2006, Walter de Gruyter, Berlin, 2007, pp. 357-373].
A working-set framework for sequential convex approximation methods
DEFF Research Database (Denmark)
Stolpe, Mathias
2008-01-01
We present an active-set algorithmic framework intended as an extension to existing implementations of sequential convex approximation methods for solving nonlinear inequality constrained programs. The framework is independent of the choice of approximations and the stabilization technique used...... to guarantee global convergence of the method. The algorithm works directly on the nonlinear constraints in the convex sub-problems and solves a sequence of relaxations of the current sub-problem. The algorithm terminates with the optimal solution to the sub-problem after solving a finite number of relaxations....
Convex Hull Abstraction in Specialisation of CLP Programs
DEFF Research Database (Denmark)
Peralta, J.C.; Gallagher, John Patrick
2003-01-01
We introduce an abstract domain consisting of atomic formulas constrained by linear arithmetic constraints (or convex hulls). This domain is used in an algorithm for specialization of constraint logic programs. The algorithm incorporates in a single phase both top-down goal directed propagation...... and bottom-up answer propagation, and uses a widening on the convex hull domain to ensure termination. We give examples to show the precision gained by this approach over other methods in the literature for specializing constraint logic programs. The specialization method can also be used for ordinary logic...
Closedness type regularity conditions in convex optimization and beyond
Directory of Open Access Journals (Sweden)
Sorin-Mihai Grad
2016-09-01
Full Text Available The closedness type regularity conditions have proven during the last decade to be viable alternatives to their more restrictive interiority type counterparts, in both convex optimization and different areas where it was successfully applied. In this review article we de- and reconstruct some closedness type regularity conditions formulated by means of epigraphs and subdifferentials, respectively, for general optimization problems in order to stress that they arise naturally when dealing with such problems. The results are then specialized for constrained and unconstrained convex optimization problems. We also hint towards other classes of optimization problems where closedness type regularity conditions were successfully employed and discuss other possible applications of them.
Distribution functions of sections and projections of convex bodies
Kim, Jaegil; Yaskin, Vladyslav; Zvavitch, Artem
2015-01-01
Typically, when we are given the section (or projection) function of a convex body, it means that in each direction we know the size of the central section (or projection) perpendicular to this direction. Suppose now that we can only get the information about the sizes of sections (or projections), and not about the corresponding directions. In this paper we study to what extent the distribution function of the areas of central sections (or projections) of a convex body can be used to derive ...
Interpolation Error Estimates for Mean Value Coordinates over Convex Polygons.
Rand, Alexander; Gillette, Andrew; Bajaj, Chandrajit
2013-08-01
In a similar fashion to estimates shown for Harmonic, Wachspress, and Sibson coordinates in [Gillette et al., AiCM, to appear], we prove interpolation error estimates for the mean value coordinates on convex polygons suitable for standard finite element analysis. Our analysis is based on providing a uniform bound on the gradient of the mean value functions for all convex polygons of diameter one satisfying certain simple geometric restrictions. This work makes rigorous an observed practical advantage of the mean value coordinates: unlike Wachspress coordinates, the gradient of the mean value coordinates does not become large as interior angles of the polygon approach π.
Relaxation Methods for Strictly Convex Regularizations of Piecewise Linear Programs
International Nuclear Information System (INIS)
Kiwiel, K. C.
1998-01-01
We give an algorithm for minimizing the sum of a strictly convex function and a convex piecewise linear function. It extends several dual coordinate ascent methods for large-scale linearly constrained problems that occur in entropy maximization, quadratic programming, and network flows. In particular, it may solve exact penalty versions of such (possibly inconsistent) problems, and subproblems of bundle methods for nondifferentiable optimization. It is simple, can exploit sparsity, and in certain cases is highly parallelizable. Its global convergence is established in the recent framework of B -functions (generalized Bregman functions)
The selection problem for discounted Hamilton–Jacobi equations: some non-convex cases
Gomes, Diogo A.; Mitake, Hiroyoshi; Tran, Hung V.
2018-01-01
Here, we study the selection problem for the vanishing discount approximation of non-convex, first-order Hamilton–Jacobi equations. While the selection problem is well understood for convex Hamiltonians, the selection problem for non-convex Hamiltonians has thus far not been studied. We begin our study by examining a generalized discounted Hamilton–Jacobi equation. Next, using an exponential transformation, we apply our methods to strictly quasi-convex and to some non-convex Hamilton–Jacobi equations. Finally, we examine a non-convex Hamiltonian with flat parts to which our results do not directly apply. In this case, we establish the convergence by a direct approach.
The selection problem for discounted Hamilton–Jacobi equations: some non-convex cases
Gomes, Diogo A.
2018-01-26
Here, we study the selection problem for the vanishing discount approximation of non-convex, first-order Hamilton–Jacobi equations. While the selection problem is well understood for convex Hamiltonians, the selection problem for non-convex Hamiltonians has thus far not been studied. We begin our study by examining a generalized discounted Hamilton–Jacobi equation. Next, using an exponential transformation, we apply our methods to strictly quasi-convex and to some non-convex Hamilton–Jacobi equations. Finally, we examine a non-convex Hamiltonian with flat parts to which our results do not directly apply. In this case, we establish the convergence by a direct approach.
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.
Robert Leckey
2013-01-01
This paper uses Queer theory, specifically literature on Bowers v. Hardwick, to analyze debates over legislation proposed in Quebec regarding covered faces. Queer theory sheds light on legal responses to the veil. Parliamentary debates in Quebec reconstitute the polity, notably as secular and united. The paper highlights the contradictory and unstable character of four binaries: legislative text versus social practice, act versus status, majority versus minority, and knowable versus unknowabl...
On the polarizability dyadics of electrically small, convex objects
Lakhtakia, Akhlesh
1993-11-01
This communication on the polarizability dyadics of electrically small objects of convex shapes has been prompted by a recent paper published by Sihvola and Lindell on the polarizability dyadic of an electrically gyrotropic sphere. A mini-review of recent work on polarizability dyadics is appended.
Riemann solvers and undercompressive shocks of convex FPU chains
International Nuclear Information System (INIS)
Herrmann, Michael; Rademacher, Jens D M
2010-01-01
We consider FPU-type atomic chains with general convex potentials. The naive continuum limit in the hyperbolic space–time scaling is the p-system of mass and momentum conservation. We systematically compare Riemann solutions to the p-system with numerical solutions to discrete Riemann problems in FPU chains, and argue that the latter can be described by modified p-system Riemann solvers. We allow the flux to have a turning point, and observe a third type of elementary wave (conservative shocks) in the atomistic simulations. These waves are heteroclinic travelling waves and correspond to non-classical, undercompressive shocks of the p-system. We analyse such shocks for fluxes with one or more turning points. Depending on the convexity properties of the flux we propose FPU-Riemann solvers. Our numerical simulations confirm that Lax shocks are replaced by so-called dispersive shocks. For convex–concave flux we provide numerical evidence that convex FPU chains follow the p-system in generating conservative shocks that are supersonic. For concave–convex flux, however, the conservative shocks of the p-system are subsonic and do not appear in FPU-Riemann solutions
On the Convexity of Step out - Step in Sequencing Games
Musegaas, Marieke; Borm, Peter; Quant, Marieke
2016-01-01
The main result of this paper is the convexity of Step out - Step in (SoSi) sequencing games, a class of relaxed sequencing games first analyzed by Musegaas, Borm, and Quant (2015). The proof makes use of a polynomial time algorithm determining the value and an optimal processing order for an
Preconditioning 2D Integer Data for Fast Convex Hull Computations.
Cadenas, José Oswaldo; Megson, Graham M; Luengo Hendriks, Cris L
2016-01-01
In order to accelerate computing the convex hull on a set of n points, a heuristic procedure is often applied to reduce the number of points to a set of s points, s ≤ n, which also contains the same hull. We present an algorithm to precondition 2D data with integer coordinates bounded by a box of size p × q before building a 2D convex hull, with three distinct advantages. First, we prove that under the condition min(p, q) ≤ n the algorithm executes in time within O(n); second, no explicit sorting of data is required; and third, the reduced set of s points forms a simple polygonal chain and thus can be directly pipelined into an O(n) time convex hull algorithm. This paper empirically evaluates and quantifies the speed up gained by preconditioning a set of points by a method based on the proposed algorithm before using common convex hull algorithms to build the final hull. A speedup factor of at least four is consistently found from experiments on various datasets when the condition min(p, q) ≤ n holds; the smaller the ratio min(p, q)/n is in the dataset, the greater the speedup factor achieved.
Convex relationships in ecosystems containing mixtures of trees and grass
CSIR Research Space (South Africa)
Scholes, RJ
2003-12-01
Full Text Available The relationship between grass production and the quantity of trees in mixed tree-grass ecosystems (savannas) is convex for all or most of its range. In other words, the grass production declines more steeply per unit increase in tree quantity...
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.
Intracranial Convexity Lipoma with Massive Calcification: Case Report
Energy Technology Data Exchange (ETDEWEB)
Kim, Eung Tae; Park, Dong Woo; Ryu, Jeong Ah; Park, Choong Ki; Lee, Young Jun; Lee, Seung Ro [Dept. of Radiology, Hanyang University College of Medicine, Seoul (Korea, Republic of)
2011-12-15
Intracranial lipoma is a rare entity, accounting for less than 0.5% of intracranial tumors, which usually develops in the callosal cisterns. We report a case of lipoma with an unusual location; in the high parietal convexity combined with massive calcification, and no underlying vascular malformation or congenital anomaly.
A duality recipe for non-convex variational problems
Bouchitté, Guy; Phan, Minh
2018-03-01
The aim of this paper is to present a general convexification recipe that can be useful for studying non-convex variational problems. In particular, this allows us to treat such problems by using a powerful primal-dual scheme. Possible further developments and open issues are given. xml:lang="fr"
A note on the nucleolus for 2-convex TU games
Driessen, Theo; Hou, D.
For 2-convex n-person cooperative TU games, the nucleolus is determined as some type of constrained equal award rule. Its proof is based on Maschler, Peleg, and Shapley’s geometrical characterization for the intersection of the prekernel with the core. Pairwise bargaining ranges within the core are
A convex optimization approach for solving large scale linear systems
Directory of Open Access Journals (Sweden)
Debora Cores
2017-01-01
Full Text Available The well-known Conjugate Gradient (CG method minimizes a strictly convex quadratic function for solving large-scale linear system of equations when the coefficient matrix is symmetric and positive definite. In this work we present and analyze a non-quadratic convex function for solving any large-scale linear system of equations regardless of the characteristics of the coefficient matrix. For finding the global minimizers, of this new convex function, any low-cost iterative optimization technique could be applied. In particular, we propose to use the low-cost globally convergent Spectral Projected Gradient (SPG method, which allow us to extend this optimization approach for solving consistent square and rectangular linear system, as well as linear feasibility problem, with and without convex constraints and with and without preconditioning strategies. Our numerical results indicate that the new scheme outperforms state-of-the-art iterative techniques for solving linear systems when the symmetric part of the coefficient matrix is indefinite, and also for solving linear feasibility problems.
Transonic shock wave. Boundary layer interaction at a convex wall
Koren, B.; Bannink, W.J.
1984-01-01
A standard finite element procedure has been applied to the problem of transonic shock wave – boundary layer interaction at a convex wall. The method is based on the analytical Bohning-Zierep model, where the boundary layer is perturbed by a weak normal shock wave which shows a singular pressure
Computing Convex Coverage Sets for Faster Multi-Objective Coordination
Roijers, D.M.; Whiteson, S.; Oliehoek, F.A.
2015-01-01
In this article, we propose new algorithms for multi-objective coordination graphs (MO-CoGs). Key to the efficiency of these algorithms is that they compute a convex coverage set (CCS) instead of a Pareto coverage set (PCS). Not only is a CCS a sufficient solution set for a large class of problems,
On the stretch factor of convex polyhedra whose vertices are (almost on a sphere
Directory of Open Access Journals (Sweden)
Michiel Smid
2016-10-01
Full Text Available Let $P$ be a convex polyhedron in $\\mathbb{R}^3$. The skeleton of $P$ is the graph whose vertices and edges are the vertices and edges of $P$, respectively. We prove that, if these vertices are on the unit-sphere, the skeleton is a $(0.999 \\cdot \\pi$-spanner. If the vertices are very close to this sphere, then the skeleton is not necessarily a spanner. For the case when the boundary of $P$ is between two concentric spheres of radii $1$ and $R>1$, and the angles in all faces are at least $\\theta$, we prove that the skeleton is a $t$-spanner, where $t$ depends only on $R$ and $\\theta$. One of the ingredients in the proof is a tight upper bound on the geometric dilation of a convex cycle that is contained in an annulus.
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.
International Nuclear Information System (INIS)
Juuti, M; Tuononen, H; Kontturi, V; Peiponen, K-E; Prykäri, T; Alarousu, E; Myllylä, R; Kuosmanen, M; Ketolainen, J
2009-01-01
Surface and bulk properties of flat-faced starch acetate tablets were studied. For surface quality inspection optical coherence tomography and recently developed diffractive glossmeter were utilized. Both these optical devices together provide local information on surface roughness and gloss of a tablet over a measured area. The concepts of mean topography and mean gloss profile for surface quality of a tablet are introduced. It was observed that the surface quality of the tablet varies, and compression at high pressure may not guarantee a good surface quality of the tablet. Using novel statistical parameters for gloss and relevant surface roughness parameter, it is possible to get more comprehensive quantitative data on the surface condition of a tablet. THz spectrometer was utilized for detection of THz pulse delay in transmission measurement mode from the tablets. The delay time and thickness ratio of the tablet are consistent with the porosity of the tablet as a function of compression pressure. We suggest that the multimeasurement scheme using three different devices helps tablet makers to better assess bulk and surface quality of their products
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
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.
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.
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.
On the stretch factor of convex Delaunay graphs
Directory of Open Access Journals (Sweden)
Prosenjit Bose
2010-06-01
Full Text Available Let C be a compact and convex set in the plane that contains the origin in its interior, and let S be a finite set of points in the plane. The Delaunay graph DGC(S of S is defined to be the dual of the Voronoi diagram of S with respect to the convex distance function defined by C. We prove that DGC(S is a t-spanner for S, for some constant t that depends only on the shape of the set C. Thus, for any two points p and q in S, the graph DGC(S contains a path between p and q whose Euclidean length is at most t times the Euclidean distance between p and q.
A Survey on Operator Monotonicity, Operator Convexity, and Operator Means
Directory of Open Access Journals (Sweden)
Pattrawut Chansangiam
2015-01-01
Full Text Available This paper is an expository devoted to an important class of real-valued functions introduced by Löwner, namely, operator monotone functions. This concept is closely related to operator convex/concave functions. Various characterizations for such functions are given from the viewpoint of differential analysis in terms of matrix of divided differences. From the viewpoint of operator inequalities, various characterizations and the relationship between operator monotonicity and operator convexity are given by Hansen and Pedersen. In the viewpoint of measure theory, operator monotone functions on the nonnegative reals admit meaningful integral representations with respect to Borel measures on the unit interval. Furthermore, Kubo-Ando theory asserts the correspondence between operator monotone functions and operator means.
Convex variational problems linear, nearly linear and anisotropic growth conditions
Bildhauer, Michael
2003-01-01
The author emphasizes a non-uniform ellipticity condition as the main approach to regularity theory for solutions of convex variational problems with different types of non-standard growth conditions. This volume first focuses on elliptic variational problems with linear growth conditions. Here the notion of a "solution" is not obvious and the point of view has to be changed several times in order to get some deeper insight. Then the smoothness properties of solutions to convex anisotropic variational problems with superlinear growth are studied. In spite of the fundamental differences, a non-uniform ellipticity condition serves as the main tool towards a unified view of the regularity theory for both kinds of problems.
DEFF Research Database (Denmark)
Hermann, Nuno Vibe; Darvann, Tron Andre; Larsen, P.
2016-01-01
of deformation in three selected regions were determined: nose (mean, 1 mm; maximum = 3 mm); cleft region (mean, 2 mm; maximum = 5 mm); chin region (mean, 5 mm; maximum = 12 mm). Analysis indicated that introduction of a formalized review of images could reduce these errors by a factor of 2. Conclusions......Objective Three-dimensional surface imaging is an increasingly popular modality for face measurements in infants with cleft lip and palate. Infants are noncompliant toward producing specific facial expressions, and selecting the appropriate moment of acquisition is challenging. The objective...... was to estimate amount and spatial distribution of deformation of the face due to facial expression in infants with cleft lip and palate and provide recommendations for an improved acquisition protocol, including a method of quality control in terms of obtaining images with true neutral expression. Material...
Directory of Open Access Journals (Sweden)
Lalsingh Khalsa
2018-01-01
Full Text Available This paper is an attempt to determine quasi-static thermal stresses in a thin elliptical plate which is subjected to transient temperature on the top face with zero temperature on the lower face and the homogeneous boundary condition of the third kind on the fixed elliptical curved surface. The solution to conductivity equation is elucidated by employing a classical method. The solution of stress components is achieved by using Goodier’s and Airy’s potential function involving the Mathieu and modified functions and their derivatives. The obtained numerical results are accurate enough for practical purposes, better understanding of the underlying elliptic object, and better estimates of the thermal effect on the thermoelastic problem. The conclusions emphasize the importance of better understanding of the underlying elliptic structure, improved understanding of its relationship to circular object profile, and better estimates of the thermal effect on the thermoelastic problem.
Constrained convex minimization via model-based excessive gap
Tran Dinh, Quoc; Cevher, Volkan
2014-01-01
We introduce a model-based excessive gap technique to analyze first-order primal- dual methods for constrained convex minimization. As a result, we construct new primal-dual methods with optimal convergence rates on the objective residual and the primal feasibility gap of their iterates separately. Through a dual smoothing and prox-function selection strategy, our framework subsumes the augmented Lagrangian, and alternating methods as special cases, where our rates apply.
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
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.
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.$
PENNON: A code for convex nonlinear and semidefinite programming
Czech Academy of Sciences Publication Activity Database
Kočvara, Michal; Stingl, M.
2003-01-01
Roč. 18, č. 3 (2003), s. 317-333 ISSN 1055-6788 R&D Projects: GA ČR GA201/00/0080 Grant - others:BMBF(DE) 03ZOM3ER Institutional research plan: CEZ:AV0Z1075907 Keywords : convex programming * semidefinite programming * large-scale problems Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 0.306, year: 2003
Convex Clustering: An Attractive Alternative to Hierarchical Clustering
Chen, Gary K.; Chi, Eric C.; Ranola, John Michael O.; Lange, Kenneth
2015-01-01
The primary goal in cluster analysis is to discover natural groupings of objects. The field of cluster analysis is crowded with diverse methods that make special assumptions about data and address different scientific aims. Despite its shortcomings in accuracy, hierarchical clustering is the dominant clustering method in bioinformatics. Biologists find the trees constructed by hierarchical clustering visually appealing and in tune with their evolutionary perspective. Hierarchical clustering operates on multiple scales simultaneously. This is essential, for instance, in transcriptome data, where one may be interested in making qualitative inferences about how lower-order relationships like gene modules lead to higher-order relationships like pathways or biological processes. The recently developed method of convex clustering preserves the visual appeal of hierarchical clustering while ameliorating its propensity to make false inferences in the presence of outliers and noise. The solution paths generated by convex clustering reveal relationships between clusters that are hidden by static methods such as k-means clustering. The current paper derives and tests a novel proximal distance algorithm for minimizing the objective function of convex clustering. The algorithm separates parameters, accommodates missing data, and supports prior information on relationships. Our program CONVEXCLUSTER incorporating the algorithm is implemented on ATI and nVidia graphics processing units (GPUs) for maximal speed. Several biological examples illustrate the strengths of convex clustering and the ability of the proximal distance algorithm to handle high-dimensional problems. CONVEXCLUSTER can be freely downloaded from the UCLA Human Genetics web site at http://www.genetics.ucla.edu/software/ PMID:25965340
Directory of Open Access Journals (Sweden)
Robert Leckey
2013-12-01
Full Text Available This paper uses Queer theory, specifically literature on Bowers v. Hardwick, to analyze debates over legislation proposed in Quebec regarding covered faces. Queer theory sheds light on legal responses to the veil. Parliamentary debates in Quebec reconstitute the polity, notably as secular and united. The paper highlights the contradictory and unstable character of four binaries: legislative text versus social practice, act versus status, majority versus minority, and knowable versus unknowable. As with contradictory propositions about homosexuality, contradiction does not undermine discourse but makes it stronger and more agile. Este artículo utiliza la teoría Queer, más concretamente la literatura sobre Bowers vs. Hardwick, para analizar los debates sobre la legislación propuesta en Quebec en relación al velo. La teoría Queer arroja luz sobre las respuestas legales al velo. Los debates parlamentarios en Quebec reconstituyen la forma de gobierno, especialmente como secular y unido. El documento pone de relieve el carácter contradictorio e inestable de cuatro binarios: texto legislativo frente a las prácticas sociales; legislación frente a estado; mayoría versus minoría; y conocible frente a incognoscible. Al igual que con las proposiciones contradictorias acerca de la homosexualidad, la contradicción no socava el discurso, sino que lo hace más fuerte y más ágil.
Numerical modeling of isothermal compositional grading by convex splitting methods
Li, Yiteng
2017-04-09
In this paper, an isothermal compositional grading process is simulated based on convex splitting methods with the Peng-Robinson equation of state. We first present a new form of gravity/chemical equilibrium condition by minimizing the total energy which consists of Helmholtz free energy and gravitational potential energy, and incorporating Lagrange multipliers for mass conservation. The time-independent equilibrium equations are transformed into a system of transient equations as our solution strategy. It is proved our time-marching scheme is unconditionally energy stable by the semi-implicit convex splitting method in which the convex part of Helmholtz free energy and its derivative are treated implicitly and the concave parts are treated explicitly. With relaxation factor controlling Newton iteration, our method is able to converge to a solution with satisfactory accuracy if a good initial estimate of mole compositions is provided. More importantly, it helps us automatically split the unstable single phase into two phases, determine the existence of gas-oil contact (GOC) and locate its position if GOC does exist. A number of numerical examples are presented to show the performance of our method.
Speech Enhancement by Modified Convex Combination of Fractional Adaptive Filtering
Directory of Open Access Journals (Sweden)
M. Geravanchizadeh
2014-12-01
Full Text Available This paper presents new adaptive filtering techniques used in speech enhancement system. Adaptive filtering schemes are subjected to different trade-offs regarding their steady-state misadjustment, speed of convergence, and tracking performance. Fractional Least-Mean-Square (FLMS is a new adaptive algorithm which has better performance than the conventional LMS algorithm. Normalization of LMS leads to better performance of adaptive filter. Furthermore, convex combination of two adaptive filters improves its performance. In this paper, new convex combinational adaptive filtering methods in the framework of speech enhancement system are proposed. The proposed methods utilize the idea of normalization and fractional derivative, both in the design of different convex mixing strategies and their related component filters. To assess our proposed methods, simulation results of different LMS-based algorithms based on their convergence behavior (i.e., MSE plots and different objective and subjective criteria are compared. The objective and subjective evaluations include examining the results of SNR improvement, PESQ test, and listening tests for dual-channel speech enhancement. The powerful aspects of proposed methods are their low complexity, as expected with all LMS-based methods, along with a high convergence rate.
Measures of symmetry for convex sets and stability
Toth, Gabor
2015-01-01
This textbook treats two important and related matters in convex geometry: the quantification of symmetry of a convex set—measures of symmetry—and the degree to which convex sets that nearly minimize such measures of symmetry are themselves nearly symmetric—the phenomenon of stability. By gathering the subject’s core ideas and highlights around Grünbaum’s general notion of measure of symmetry, it paints a coherent picture of the subject, and guides the reader from the basics to the state-of-the-art. The exposition takes various paths to results in order to develop the reader’s grasp of the unity of ideas, while interspersed remarks enrich the material with a behind-the-scenes view of corollaries and logical connections, alternative proofs, and allied results from the literature. Numerous illustrations elucidate definitions and key constructions, and over 70 exercises—with hints and references for the more difficult ones—test and sharpen the reader’s comprehension. The presentation includes:...
Measurement system for diffraction efficiency of convex gratings
Liu, Peng; Chen, Xin-hua; Zhou, Jian-kang; Zhao, Zhi-cheng; Liu, Quan; Luo, Chao; Wang, Xiao-feng; Tang, Min-xue; Shen, Wei-min
2017-08-01
A measurement system for diffraction efficiency of convex gratings is designed. The measurement system mainly includes four components as a light source, a front system, a dispersing system that contains a convex grating, and a detector. Based on the definition and measuring principle of diffraction efficiency, the optical scheme of the measurement system is analyzed and the design result is given. Then, in order to validate the feasibility of the designed system, the measurement system is set up and the diffraction efficiency of a convex grating with the aperture of 35 mm, the curvature-radius of 72mm, the blazed angle of 6.4°, the grating period of 2.5μm and the working waveband of 400nm-900nm is tested. Based on GUM (Guide to the Expression of Uncertainty in Measurement), the uncertainties in the measuring results are evaluated. The measured diffraction efficiency data are compared to the theoretical ones, which are calculated based on the grating groove parameters got by an atomic force microscope and Rigorous Couple Wave Analysis, and the reliability of the measurement system is illustrated. Finally, the measurement performance of the system is analyzed and tested. The results show that, the testing accuracy, the testing stability and the testing repeatability are 2.5%, 0.085% and 3.5% , respectively.
Cheng, Chao-Min; Matsuura, Koji; Wang, I-Jan; Kuroda, Yuka; LeDuc, Philip R; Naruse, Keiji
2009-11-21
Polymeric curved structures are widely used in imaging systems including optical fibers and microfluidic channels. Here, we demonstrate that small-scale, poly(dimethylsiloxane) (PDMS)-based, curved structures can be fabricated through controlling interfacial free energy equilibrium. Resultant structures have a smooth, symmetric, curved surface, and may be convex or concave in form based on surface tension balance. Their curvatures are controlled by surface characteristics (i.e., hydrophobicity and hydrophilicity) of the molds and semi-liquid PDMS. In addition, these structures are shown to be biocompatible for cell culture. Our system provides a simple, efficient and economical method for generating integrateable optical components without costly fabrication facilities.
International Nuclear Information System (INIS)
Shimura, K.; Terai, T.; Yamawaki, M.
2003-01-01
In this study, the kinetics of desorption of adsorbed hydrogen from an ideal metallic surface is modelled in Cellular Automaton (CA). The modelling is achieved by downgrading the surface to one dimension. The model consists of two parts that are surface migration and desorption. The former is attained by randomly sorting the particles at each time, the latter is realised by modelling the thermally-activated process. For the verification of this model, thermal desorption is simulated then the comparison with the chemical kinetics is carried out. Excellent agreement is observed from the result. The results show that this model is reasonable to express the recombinative desorption of two chemisorbed adatoms. Though, the application of this model is limited to the second-order reaction case. But it can be believed that the groundwork of modelling the transport dynamics of hydrogen through the surface under complex conditions is established
Investigation on the surface characterization of Ga-faced GaN after chemical-mechanical polishing
Energy Technology Data Exchange (ETDEWEB)
Gong, Hua [State Key Laboratory of Tribology, Tsinghua University, Beijing 100084 (China); Shenzhen Key Laboratory of Micro/nano Manufacturing, Research Institute of Tsinghua University in Shenzhen, Shenzhen 518057 (China); Pan, Guoshun, E-mail: pangs@tsinghua.edu.cn [State Key Laboratory of Tribology, Tsinghua University, Beijing 100084 (China); Shenzhen Key Laboratory of Micro/nano Manufacturing, Research Institute of Tsinghua University in Shenzhen, Shenzhen 518057 (China); Zhou, Yan; Shi, Xiaolei; Zou, Chunli; Zhang, Suman [State Key Laboratory of Tribology, Tsinghua University, Beijing 100084 (China); Shenzhen Key Laboratory of Micro/nano Manufacturing, Research Institute of Tsinghua University in Shenzhen, Shenzhen 518057 (China)
2015-05-30
Highlights: • Tiny-sized nanoparticles were introduced in GaN CMP to realize a good surface. • The relationship between surface characterization and abrasive size was conducted. • An atomic step-terrace structure was achieved on GaN surface after CMP. • Pt/C catalyst nanoparticles were used in GaN CMP to get a higher MRR. - Abstract: The relationship between the surface characterization after chemical mechanical polishing (CMP) and the size of the silica (SiO{sub 2}) abrasive used for CMP of gallium nitride (GaN) substrates was investigated in detail. Atomic force microscope was used for measuring the surface morphology, pit feature, pit depth distribution, and atomic step-terrace structure. With the decrease of SiO{sub 2} abrasive size, the pit depth reduced and the atomic step-terrace structure became more whole with smaller damage area, resulting in smaller roughness. For tiny-sized SiO{sub 2} abrasive, an almost complete atomic step-terrace structure with 0.0523 nm roughness was achieved. On the other hand, in order to acquire higher removal, Pt/C nanoparticle was employed as a catalyst in CMP slurry. The result indicates that when Pt/C catalyst content was reached to 1.0 ppm, material removal rate was increased by 47.69% compared to that by none of the catalyst, and besides, the pit depth reduced and the surface atomic step-terrace structure was not destroyed. The Pt/C nanoparticle is proved to be the promising catalyst to the surface preparation of super-hard and inert materials with high efficiency and good surface.
International Nuclear Information System (INIS)
Firment, L.E.; Somorjai, G.A.
1977-01-01
The surfaces of the normal paraffins (C 3 --C 8 ) and cyclohexane have been studied using low-energy electron diffraction (LEED). The samples were prepared by vapor deposition on the (111) face of a platinum single crystal in ultrahigh vacuum, and were studied both as thick films and as adsorbed monolayers. These molecules form ordered monolayers on the clean metal surface in the temperature range 100--220 K and at a vapor flux corresponding to 10 -7 Torr. In the adsorbed monolayers of the normal paraffins (C 4 --C 8 ), the molecules lie with their chain axes parallel to the Pt surface and Pt[110]. The paraffin monolayer structures undergo order--disorder transitions as a function of temperature. Multilayers condensed upon the ordered monolayers maintained the same orientation and packing as found in the monolayers. The surface structures of the growing organic crystals do not corresond to planes in their reported bulk crystal structures and are evidence for epitaxial growth of pseudomorphic crystal forms. Multilayers of n-octane and n-heptane condensed upon disordered monolayers have also grown with the (001) plane of the triclinic bulk crystal structures parallel to the surface. n-Butane has three monolayer structures on Pt(111) and one of the three is maintained during growth of the crystal. Cyclohexane forms an ordered monolayer, upon which a multilayer of cyclohexane grows exhibiting the (001) surface orientation of the monoclinic bulk crystal structure. Surface structures of saturated hydrocarbons are found to be very susceptible to electron beam induced damage. Surface charging interferes with LEED only at sample thicknesses greater than 200 A
International Nuclear Information System (INIS)
Cai, Laizhong; Gauthier, Eric; Corre, Yann; Liu, Jian
2013-01-01
Both a deposition surface layer and a delamination underneath junction existing on plasma facing components (PFCs) can result in abnormal high surface temperature under normal heating conditions. The tile with delamination has to be replaced to prevent from a critical failure (complete delamination) during plasma operation while the carbon deposit can be removed without any repairing. Therefore, distinguishing in situ deposited tiles and junction defect tiles is crucial to avoid the critical failure without unwanted shutdown. In this paper, the thermal behaviors of junction defect tiles and carbon deposit tiles are simulated numerically. A modified time constant method is then introduced to analyze the thermal behaviors of deposited tiles and junction defect tiles. The feasibility of discrimination by analyzing the thermal behaviors of tiles is discussed and the requirements of this method for discrimination are described. Finally, the time resolution requirement of IR cameras to do the discrimination is mentioned
International Nuclear Information System (INIS)
Bitzek, Erik; Gumbsch, Peter
2004-01-01
Atomistic simulations of an accelerating edge dislocation were carried out to study the effects of drag and inertia. Using an embedded atom potential for nickel, the Peierls stress, the effective mass and the drag coefficient of an edge dislocation were determined for different temperatures and stresses in a simple slab geometry. The effect of {1 1 1} surfaces on an intersecting edge dislocation were studied by appropriately cutting the slab. A dislocation intersecting a surface step was used as a model system to demonstrate the importance of inertial effects for dynamically overcoming short range obstacles. Significant effects were found even at room temperature. A simple model based on the dislocation-obstacle interaction energies was used to describe the findings
Czech Academy of Sciences Publication Activity Database
Weber, S.; Biehl, M.; Kotrla, Miroslav; Kinzel, W.
2008-01-01
Roč. 20, č. 26 (2008), 265004/1-265004/7 ISSN 0953-8984 EU Projects: European Commission(XE) 16447 - MAGDOT Grant - others:NSF DMR(DE) 0502737 Institutional research plan: CEZ:AV0Z10100520 Keywords : nanostructures * surface alloys * Monte Carlo simulation * self-assembling magnetic dots Subject RIV: BM - Solid Matter Physics ; Magnetism Impact factor: 1.900, year: 2008
DEFF Research Database (Denmark)
Beermann, Jonas; Eriksen, René L.; Stær, Tobias Holmgaard
2014-01-01
Plasmonic black surfaces formed by two-dimensional arrays of ultra-sharp convex metal grooves, in which the incident radiation is converted into gap surface plasmon polaritons (GSPPs) and subsequently absorbed (via adiabatic nanofocusing), are fabricated and investigated experimentally for gold......%, averaged over the investigated wavelength range of 400-985 nm. The highest averaged absorption level (similar to 97%) is achieved with 250-nm-period arrays in palladium that also has the highest melting temperature(similar to 15526 degrees C), promising thereby potential applications for broadband...
The role of convexity in perceptual completion: beyond good continuation.
Liu, Z; Jacobs, D W; Basri, R
1999-01-01
Since the seminal work of the Gestalt psychologists, there has been great interest in understanding what factors determine the perceptual organization of images. While the Gestaltists demonstrated the significance of grouping cues such as similarity, proximity and good continuation, it has not been well understood whether their catalog of grouping cues is complete--in part due to the paucity of effective methodologies for examining the significance of various grouping cues. We describe a novel, objective method to study perceptual grouping of planar regions separated by an occluder. We demonstrate that the stronger the grouping between two such regions, the harder it will be to resolve their relative stereoscopic depth. We use this new method to call into question many existing theories of perceptual completion (Ullman, S. (1976). Biological Cybernetics, 25, 1-6; Shashua, A., & Ullman, S. (1988). 2nd International Conference on Computer Vision (pp. 321-327); Parent, P., & Zucker, S. (1989). IEEE Transactions on Pattern Analysis and Machine Intelligence, 11, 823-839; Kellman, P. J., & Shipley, T. F. (1991). Cognitive psychology, Liveright, New York; Heitger, R., & von der Heydt, R. (1993). A computational model of neural contour processing, figure-ground segregation and illusory contours. In Internal Conference Computer Vision (pp. 32-40); Mumford, D. (1994). Algebraic geometry and its applications, Springer, New York; Williams, L. R., & Jacobs, D. W. (1997). Neural Computation, 9, 837-858) that are based on Gestalt grouping cues by demonstrating that convexity plays a strong role in perceptual completion. In some cases convexity dominates the effects of the well known Gestalt cue of good continuation. While convexity has been known to play a role in figure/ground segmentation (Rubin, 1927; Kanizsa & Gerbino, 1976), this is the first demonstration of its importance in perceptual completion.
Directory of Open Access Journals (Sweden)
J. Prakash Maran
2017-02-01
Full Text Available In this study, four factors at three level central composite face centered design was employed to study and optimize the process variables on extraction of bioactive compounds (total anthocyanin, phenolic and flavonoid content from Nephelium lappaceum L. fruit peel. The effect of process variables such as extraction temperature (30–50 °C, power of ultrasound (20–40 W, extraction time (10–30 min and solid–liquid ratio (1:10–1:20 g/ml is studied. Multiple regression analysis was done on the experimental data to develop second-order polynomial models with high coefficient of determination value (R2 > 0.99. The optimal conditions based on both individual and combinations of all process variables (extraction temperature of 50 °C, ultrasound power of 20 W, extraction time of 20 min and solid–liquid ratio of 1:18.6 g/ml were determined by Derringer’s desired function methodology. Under these conditions, total anthocyanin (10.26 ± 0.39 (mg/100 g, phenolics (552.64 ± 1.57 (mg GAE/100 g and flavonoid (104 ± 1.13 (mg RE/100 g content values were determined and it is closely related with the predicted values (10.17 mg/100 g of total anthocyanin, 546.98 mg GAE/100 g of total phenolics and 100.93 mg RE/100 g of total flavonoid content and indicted the suitability of the developed models.
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...
Convex models and probabilistic approach of nonlinear fatigue failure
International Nuclear Information System (INIS)
Qiu Zhiping; Lin Qiang; Wang Xiaojun
2008-01-01
This paper is concerned with the nonlinear fatigue failure problem with uncertainties in the structural systems. In the present study, in order to solve the nonlinear problem by convex models, the theory of ellipsoidal algebra with the help of the thought of interval analysis is applied. In terms of the inclusion monotonic property of ellipsoidal functions, the nonlinear fatigue failure problem with uncertainties can be solved. A numerical example of 25-bar truss structures is given to illustrate the efficiency of the presented method in comparison with the probabilistic approach
Generalized minimizers of convex integral functionals, Bregman distance, Pythagorean identities
Czech Academy of Sciences Publication Activity Database
Imre, C.; Matúš, František
2012-01-01
Roč. 48, č. 4 (2012), s. 637-689 ISSN 0023-5954 R&D Projects: GA ČR GA201/08/0539; GA ČR GAP202/10/0618 Institutional support: RVO:67985556 Keywords : maximum entropy * moment constraint * generalized primal/dual solutions * normal integrand * convex duality * Bregman projection * inference principles Subject RIV: BA - General Mathematics Impact factor: 0.619, year: 2012 http://library.utia.cas.cz/separaty/2012/MTR/matus-0381750.pdf
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.
Gröbner bases and convex polytopes
Sturmfels, Bernd
1995-01-01
This book is about the interplay of computational commutative algebra and the theory of convex polytopes. It centers around a special class of ideals in a polynomial ring: the class of toric ideals. They are characterized as those prime ideals that are generated by monomial differences or as the defining ideals of toric varieties (not necessarily normal). The interdisciplinary nature of the study of Gröbner bases is reflected by the specific applications appearing in this book. These applications lie in the domains of integer programming and computational statistics. The mathematical tools presented in the volume are drawn from commutative algebra, combinatorics, and polyhedral geometry.
On the structure of self-affine convex bodies
Energy Technology Data Exchange (ETDEWEB)
Voynov, A S [M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics, Moscow (Russian Federation)
2013-08-31
We study the structure of convex bodies in R{sup d} that can be represented as a union of their affine images with no common interior points. Such bodies are called self-affine. Vallet's conjecture on the structure of self-affine bodies was proved for d = 2 by Richter in 2011. In the present paper we disprove the conjecture for all d≥3 and derive a detailed description of self-affine bodies in R{sup 3}. Also we consider the relation between properties of self-affine bodies and functional equations with a contraction of an argument. Bibliography: 10 titles.
Gil-Bona, Ana; Amador-García, Ahinara; Gil, Concha; Monteoliva, Lucia
2018-05-30
The cell surface and secreted proteins are the initial points of contact between Candida albicans and the host. Improvements in protein extraction approaches and mass spectrometers have allowed researchers to obtain a comprehensive knowledge of these external subproteomes. In this paper, we review the published proteomic studies that have examined C. albicans extracellular proteins, including the cell surface proteins or surfome and the secreted proteins or secretome. The use of different approaches to isolate cell wall and cell surface proteins, such as fractionation approaches or cell shaving, have resulted in different outcomes. Proteins with N-terminal signal peptide, known as classically secreted proteins, and those that lack the signal peptide, known as unconventionally secreted proteins, have been consistently identified. Existing studies on C. albicans extracellular vesicles reveal that they are relevant as an unconventional pathway of protein secretion and can help explain the presence of proteins without a signal peptide, including some moonlighting proteins, in the cell wall and the extracellular environment. According to the global view presented in this review, cell wall proteins, virulence factors such as adhesins or hydrolytic enzymes, metabolic enzymes and stress related-proteins are important groups of proteins in C. albicans surfome and secretome. Candida albicans extracellular proteins are involved in biofilm formation, cell nutrient acquisition and cell wall integrity maintenance. Furthermore, these proteins include virulence factors and immunogenic proteins. This review is of outstanding interest, not only because it extends knowledge of the C. albicans surface and extracellular proteins that could be related with pathogenesis, but also because it presents insights that may facilitate the future development of new antifungal drugs and vaccines and contributes to efforts to identify new biomarkers that can be employed to diagnose candidiasis
Use of Convexity in Ostomy Care: Results of an International Consensus Meeting.
Hoeflok, Jo; Salvadalena, Ginger; Pridham, Sue; Droste, Werner; McNichol, Laurie; Gray, Mikel
Ostomy skin barriers that incorporate a convexity feature have been available in the marketplace for decades, but limited resources are available to guide clinicians in selection and use of convex products. Given the widespread use of convexity, and the need to provide practical guidelines for appropriate use of pouching systems with convex features, an international consensus panel was convened to provide consensus-based guidance for this aspect of ostomy practice. Panelists were provided with a summary of relevant literature in advance of the meeting; these articles were used to generate and reach consensus on 26 statements during a 1-day meeting. Consensus was achieved when 80% of panelists agreed on a statement using an anonymous electronic response system. The 26 statements provide guidance for convex product characteristics, patient assessment, convexity use, and outcomes.
Effects of Ultrasonics-Assisted Face Milling on Surface Integrity and Fatigue Life of Ni-Alloy 718
Suárez, Alfredo; Veiga, Fernando; de Lacalle, Luis N. López; Polvorosa, Roberto; Lutze, Steffen; Wretland, Anders
2016-11-01
This work investigates the effects of ultrasonic vibration-assisted milling on important aspects such us material surface integrity, tool wear, cutting forces and fatigue resistance. As an alternative to natural application of ultrasonic milling in brittle materials, in this study, ultrasonics have been applied to a difficult-to-cut material, Alloy 718, very common in high-temperature applications. Results show alterations in the sub-superficial part of the material which could influence fatigue resistance of the material, as it has been observed in a fatigue test campaign of specimens obtained with the application of ultrasonic milling in comparison with another batch obtained applying conventional milling. Tool wear pattern was found to be very similar for both milling technologies, concluding the study with the analysis of cutting forces, exhibiting certain improvement in case of the application of ultrasonic milling with a more stable evolution.
Dislocation dynamics in non-convex domains using finite elements with embedded discontinuities
Romero, Ignacio; Segurado, Javier; LLorca, Javier
2008-04-01
The standard strategy developed by Van der Giessen and Needleman (1995 Modelling Simul. Mater. Sci. Eng. 3 689) to simulate dislocation dynamics in two-dimensional finite domains was modified to account for the effect of dislocations leaving the crystal through a free surface in the case of arbitrary non-convex domains. The new approach incorporates the displacement jumps across the slip segments of the dislocations that have exited the crystal within the finite element analysis carried out to compute the image stresses on the dislocations due to the finite boundaries. This is done in a simple computationally efficient way by embedding the discontinuities in the finite element solution, a strategy often used in the numerical simulation of crack propagation in solids. Two academic examples are presented to validate and demonstrate the extended model and its implementation within a finite element program is detailed in the appendix.
Dislocation dynamics in non-convex domains using finite elements with embedded discontinuities
International Nuclear Information System (INIS)
Romero, Ignacio; Segurado, Javier; LLorca, Javier
2008-01-01
The standard strategy developed by Van der Giessen and Needleman (1995 Modelling Simul. Mater. Sci. Eng. 3 689) to simulate dislocation dynamics in two-dimensional finite domains was modified to account for the effect of dislocations leaving the crystal through a free surface in the case of arbitrary non-convex domains. The new approach incorporates the displacement jumps across the slip segments of the dislocations that have exited the crystal within the finite element analysis carried out to compute the image stresses on the dislocations due to the finite boundaries. This is done in a simple computationally efficient way by embedding the discontinuities in the finite element solution, a strategy often used in the numerical simulation of crack propagation in solids. Two academic examples are presented to validate and demonstrate the extended model and its implementation within a finite element program is detailed in the appendix
Canonical Primal-Dual Method for Solving Non-convex Minimization Problems
Wu, Changzhi; Li, Chaojie; Gao, David Yang
2012-01-01
A new primal-dual algorithm is presented for solving a class of non-convex minimization problems. This algorithm is based on canonical duality theory such that the original non-convex minimization problem is first reformulated as a convex-concave saddle point optimization problem, which is then solved by a quadratically perturbed primal-dual method. %It is proved that the popular SDP method is indeed a special case of the canonical duality theory. Numerical examples are illustrated. Comparing...
Sequential Change-Point Detection via Online Convex Optimization
Directory of Open Access Journals (Sweden)
Yang Cao
2018-02-01
Full Text Available Sequential change-point detection when the distribution parameters are unknown is a fundamental problem in statistics and machine learning. When the post-change parameters are unknown, we consider a set of detection procedures based on sequential likelihood ratios with non-anticipating estimators constructed using online convex optimization algorithms such as online mirror descent, which provides a more versatile approach to tackling complex situations where recursive maximum likelihood estimators cannot be found. When the underlying distributions belong to a exponential family and the estimators satisfy the logarithm regret property, we show that this approach is nearly second-order asymptotically optimal. This means that the upper bound for the false alarm rate of the algorithm (measured by the average-run-length meets the lower bound asymptotically up to a log-log factor when the threshold tends to infinity. Our proof is achieved by making a connection between sequential change-point and online convex optimization and leveraging the logarithmic regret bound property of online mirror descent algorithm. Numerical and real data examples validate our theory.
Sequential and Parallel Algorithms for Finding a Maximum Convex Polygon
DEFF Research Database (Denmark)
Fischer, Paul
1997-01-01
This paper investigates the problem where one is given a finite set of n points in the plane each of which is labeled either ?positive? or ?negative?. We consider bounded convex polygons, the vertices of which are positive points and which do not contain any negative point. It is shown how...... such a polygon which is maximal with respect to area can be found in time O(n³ log n). With the same running time one can also find such a polygon which contains a maximum number of positive points. If, in addition, the number of vertices of the polygon is restricted to be at most M, then the running time...... becomes O(M n³ log n). It is also shown how to find a maximum convex polygon which contains a given point in time O(n³ log n). Two parallel algorithms for the basic problem are also presented. The first one runs in time O(n log n) using O(n²) processors, the second one has polylogarithmic time but needs O...
Nash points, Ky Fan inequality and equilibria of abstract economies in Max-Plus and -convexity
Briec, Walter; Horvath, Charles
2008-05-01
-convexity was introduced in [W. Briec, C. Horvath, -convexity, Optimization 53 (2004) 103-127]. Separation and Hahn-Banach like theorems can be found in [G. Adilov, A.M. Rubinov, -convex sets and functions, Numer. Funct. Anal. Optim. 27 (2006) 237-257] and [W. Briec, C.D. Horvath, A. Rubinov, Separation in -convexity, Pacific J. Optim. 1 (2005) 13-30]. We show here that all the basic results related to fixed point theorems are available in -convexity. Ky Fan inequality, existence of Nash equilibria and existence of equilibria for abstract economies are established in the framework of -convexity. Monotone analysis, or analysis on Maslov semimodules [V.N. Kolokoltsov, V.P. Maslov, Idempotent Analysis and Its Applications, Math. Appl., volE 401, Kluwer Academic, 1997; V.P. Litvinov, V.P. Maslov, G.B. Shpitz, Idempotent functional analysis: An algebraic approach, Math. Notes 69 (2001) 696-729; V.P. Maslov, S.N. Samborski (Eds.), Idempotent Analysis, Advances in Soviet Mathematics, Amer. Math. Soc., Providence, RI, 1992], is the natural framework for these results. From this point of view Max-Plus convexity and -convexity are isomorphic Maslov semimodules structures over isomorphic semirings. Therefore all the results of this paper hold in the context of Max-Plus convexity.
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
Bertamini, Marco; Wagemans, Johan
2013-04-01
Interest in convexity has a long history in vision science. For smooth contours in an image, it is possible to code regions of positive (convex) and negative (concave) curvature, and this provides useful information about solid shape. We review a large body of evidence on the role of this information in perception of shape and in attention. This includes evidence from behavioral, neurophysiological, imaging, and developmental studies. A review is necessary to analyze the evidence on how convexity affects (1) separation between figure and ground, (2) part structure, and (3) attention allocation. Despite some broad agreement on the importance of convexity in these areas, there is a lack of consensus on the interpretation of specific claims--for example, on the contribution of convexity to metric depth and on the automatic directing of attention to convexities or to concavities. The focus is on convexity and concavity along a 2-D contour, not convexity and concavity in 3-D, but the important link between the two is discussed. We conclude that there is good evidence for the role of convexity information in figure-ground organization and in parsing, but other, more specific claims are not (yet) well supported.
First-order Convex Optimization Methods for Signal and Image Processing
DEFF Research Database (Denmark)
Jensen, Tobias Lindstrøm
2012-01-01
In this thesis we investigate the use of first-order convex optimization methods applied to problems in signal and image processing. First we make a general introduction to convex optimization, first-order methods and their iteration complexity. Then we look at different techniques, which can...... be used with first-order methods such as smoothing, Lagrange multipliers and proximal gradient methods. We continue by presenting different applications of convex optimization and notable convex formulations with an emphasis on inverse problems and sparse signal processing. We also describe the multiple...
Rosales, E; Sanromán, M A; Pazos, M
2012-06-01
The aim of this work was to improve the ability of electro-Fenton technique for the remediation of wastewater contaminated with synthetic dyes using a model azo dye such as Azure B. Batch experiments were conducted to study the effects of main parameters, such as dye concentration, electrode surface area, treatment time, and voltage. In this study, central composite face-centered experimental design matrix and response surface methodology were applied to design the experiments and evaluate the interactive effects of the four studied parameters. A total of 30 experimental runs were set, and the kinetic data were analyzed using first- and second-order models. The experimental data fitted to the empirical second-order model of a suitable degree for the maximum decolorization of Azure B by electro-Fenton treatment. ANOVA analysis showed high coefficient of determination value (R(2) = 0.9835) and reasonable second-order regression prediction. Pareto analysis suggests that the variables, time, and voltage produce the largest effect on the decolorization rate. Optimum conditions suggested by the second-order polynomial regression model for attaining maximum decolorization were dye concentration 4.83 mg/L, electrode surface area 15 cm(2), voltage 14.19 V, and treatment time of 34.58 min.
Šašiċ, Slobodan; Ojakovo, Peter; Warman, Martin; Sanghvi, Tapan
2013-09-01
Raman chemical mapping was used to determine the distribution of magnesium stearate, a lubricant, on the surface of tablets. The lubrication was carried out via a punch-face lubrication system with different spraying rates applied on placebo and active-containing tablets. Principal component analysis was used for decomposing the matrix of Raman mapping spectra. Some of the loadings associated with minuscule variation in the data significantly overlap with the Raman spectrum of magnesium stearate in placebo tablets and allow for imaging the domains of magnesium stearate via corresponding scores. Despite the negligible variation accounted for by respective principal components, the score images seem reliable as demonstrated through thresholding the one-dimensional representation and the spectra of the hot pixels that show a weak but perceivable magnesium stearate band at 1295 cm(-1). The same approach was applied on the active formulation, but no magnesium stearate was identified, presumably due to overwhelming concentration and spectral contribution of the active pharmaceutical ingredient.
Full Text Available ... Basics PTSD Treatment What is AboutFace? Resources for Professionals Get Help Home Watch Videos by Topic Videos ... Basics PTSD Treatment What is AboutFace? Resources for Professionals Get Help PTSD We've been there. After ...
Full Text Available ... Treatment What is AboutFace? Resources for Professionals Get Help Home Watch Videos by Topic Videos by Type ... Treatment What is AboutFace? Resources for Professionals Get Help PTSD We've been there. After a traumatic ...
Chance-Constrained Guidance With Non-Convex Constraints
Ono, Masahiro
2011-01-01
Missions to small bodies, such as comets or asteroids, require autonomous guidance for descent to these small bodies. Such guidance is made challenging by uncertainty in the position and velocity of the spacecraft, as well as the uncertainty in the gravitational field around the small body. In addition, the requirement to avoid collision with the asteroid represents a non-convex constraint that means finding the optimal guidance trajectory, in general, is intractable. In this innovation, a new approach is proposed for chance-constrained optimal guidance with non-convex constraints. Chance-constrained guidance takes into account uncertainty so that the probability of collision is below a specified threshold. In this approach, a new bounding method has been developed to obtain a set of decomposed chance constraints that is a sufficient condition of the original chance constraint. The decomposition of the chance constraint enables its efficient evaluation, as well as the application of the branch and bound method. Branch and bound enables non-convex problems to be solved efficiently to global optimality. Considering the problem of finite-horizon robust optimal control of dynamic systems under Gaussian-distributed stochastic uncertainty, with state and control constraints, a discrete-time, continuous-state linear dynamics model is assumed. Gaussian-distributed stochastic uncertainty is a more natural model for exogenous disturbances such as wind gusts and turbulence than the previously studied set-bounded models. However, with stochastic uncertainty, it is often impossible to guarantee that state constraints are satisfied, because there is typically a non-zero probability of having a disturbance that is large enough to push the state out of the feasible region. An effective framework to address robustness with stochastic uncertainty is optimization with chance constraints. These require that the probability of violating the state constraints (i.e., the probability of
DEFF Research Database (Denmark)
Sørensen, Mette-Marie Zacher
2016-01-01
artist Marnix de Nijs' Physiognomic Scrutinizer is an interactive installation whereby the viewer's face is scanned and identified with historical figures. The American artist Zach Blas' project Fag Face Mask consists of three-dimensional portraits that blend biometric facial data from 30 gay men's faces...... and critically examine bias in surveillance technologies, as well as scientific investigations, regarding the stereotyping mode of the human gaze. The American artist Heather Dewey-Hagborg creates three-dimensional portraits of persons she has “identified” from their garbage. Her project from 2013 entitled...
Reading faces and Facing words
DEFF Research Database (Denmark)
Robotham, Julia Emma; Lindegaard, Martin Weis; Delfi, Tzvetelina Shentova
unilateral lesions, we found no patient with a selective deficit in either reading or face processing. Rather, the patients showing a deficit in processing either words or faces were also impaired with the other category. One patient performed within the normal range on all tasks. In addition, all patients......It has long been argued that perceptual processing of faces and words is largely independent, highly specialised and strongly lateralised. Studies of patients with either pure alexia or prosopagnosia have strongly contributed to this view. The aim of our study was to investigate how visual...... perception of faces and words is affected by unilateral posterior stroke. Two patients with lesions in their dominant hemisphere and two with lesions in their non-dominant hemisphere were tested on sensitive tests of face and word perception during the stable phase of recovery. Despite all patients having...
Nonparametric instrumental regression with non-convex constraints
International Nuclear Information System (INIS)
Grasmair, M; Scherzer, O; Vanhems, A
2013-01-01
This paper considers the nonparametric regression model with an additive error that is dependent on the explanatory variables. As is common in empirical studies in epidemiology and economics, it also supposes that valid instrumental variables are observed. A classical example in microeconomics considers the consumer demand function as a function of the price of goods and the income, both variables often considered as endogenous. In this framework, the economic theory also imposes shape restrictions on the demand function, such as integrability conditions. Motivated by this illustration in microeconomics, we study an estimator of a nonparametric constrained regression function using instrumental variables by means of Tikhonov regularization. We derive rates of convergence for the regularized model both in a deterministic and stochastic setting under the assumption that the true regression function satisfies a projected source condition including, because of the non-convexity of the imposed constraints, an additional smallness condition. (paper)
Nonparametric instrumental regression with non-convex constraints
Grasmair, M.; Scherzer, O.; Vanhems, A.
2013-03-01
This paper considers the nonparametric regression model with an additive error that is dependent on the explanatory variables. As is common in empirical studies in epidemiology and economics, it also supposes that valid instrumental variables are observed. A classical example in microeconomics considers the consumer demand function as a function of the price of goods and the income, both variables often considered as endogenous. In this framework, the economic theory also imposes shape restrictions on the demand function, such as integrability conditions. Motivated by this illustration in microeconomics, we study an estimator of a nonparametric constrained regression function using instrumental variables by means of Tikhonov regularization. We derive rates of convergence for the regularized model both in a deterministic and stochastic setting under the assumption that the true regression function satisfies a projected source condition including, because of the non-convexity of the imposed constraints, an additional smallness condition.
Elastic energy of liquid crystals in convex polyhedra
International Nuclear Information System (INIS)
Majumdar, A; Robbins, J M; Zyskin, M
2004-01-01
We consider nematic liquid crystals in a bounded, convex polyhedron described by a director field n(r) subject to tangent boundary conditions. We derive lower bounds for the one-constant elastic energy in terms of topological invariants. For a right rectangular prism and a large class of topologies, we derive upper bounds by introducing test configurations constructed from local conformal solutions of the Euler-Lagrange equation. The ratio of the upper and lower bounds depends only on the aspect ratios of the prism. As the aspect ratios are varied, the minimum-energy conformal state undergoes a sharp transition from being smooth to having singularities on the edges. (letter to the editor)
Convex analysis and monotone operator theory in Hilbert spaces
Bauschke, Heinz H
2017-01-01
This reference text, now in its second edition, offers a modern unifying presentation of three basic areas of nonlinear analysis: convex analysis, monotone operator theory, and the fixed point theory of nonexpansive operators. Taking a unique comprehensive approach, the theory is developed from the ground up, with the rich connections and interactions between the areas as the central focus, and it is illustrated by a large number of examples. The Hilbert space setting of the material offers a wide range of applications while avoiding the technical difficulties of general Banach spaces. The authors have also drawn upon recent advances and modern tools to simplify the proofs of key results making the book more accessible to a broader range of scholars and users. Combining a strong emphasis on applications with exceptionally lucid writing and an abundance of exercises, this text is of great value to a large audience including pure and applied mathematicians as well as researchers in engineering, data science, ma...
Reachability by paths of bounded curvature in a convex polygon
Ahn, Heekap; Cheong, Otfried; Matoušek, Jiřǐ; Vigneron, Antoine E.
2012-01-01
Let B be a point robot moving in the plane, whose path is constrained to forward motions with curvature at most 1, and let P be a convex polygon with n vertices. Given a starting configuration (a location and a direction of travel) for B inside P, we characterize the region of all points of P that can be reached by B, and show that it has complexity O(n). We give an O(n2) time algorithm to compute this region. We show that a point is reachable only if it can be reached by a path of type CCSCS, where C denotes a unit circle arc and S denotes a line segment. © 2011 Elsevier B.V.
Rocking convex array used for 3D synthetic aperture focusing
DEFF Research Database (Denmark)
Andresen, Henrik; Nikolov, Svetoslav; Pedersen, M M
2008-01-01
Volumetric imaging can be performed using 1D arrays in combination with mechanical motion. Outside the elevation focus of the array, the resolution and contrast quickly degrade compared to the azimuth plane, because of the fixed transducer focus. The purpose of this paper is to use synthetic...... aperture focusing (SAF) for enhancing the elevation focusing for a convex rocking array, to obtain a more isotropic point spread function. This paper presents further development of the SAF method, which can be used with curved array combined with a rocking motion. The method uses a virtual source (VS...... Kretztechnik, Zipf, Austria). The array has an elevation focus at 60 mm of depth, and the angular rocking velocity is up to 140deg/s. The scan sequence uses an fprf of 4500 - 7000 Hz allowing up to 15 cm of penetration. The full width at half max (FWHM) and main-lobe to side-lobe ratio (MLSL) is used...
Convex Relaxations for a Generalized Chan-Vese Model
Bae, Egil
2013-01-01
We revisit the Chan-Vese model of image segmentation with a focus on the encoding with several integer-valued labeling functions. We relate several representations with varying amount of complexity and demonstrate the connection to recent relaxations for product sets and to dual maxflow-based formulations. For some special cases, it can be shown that it is possible to guarantee binary minimizers. While this is not true in general, we show how to derive a convex approximation of the combinatorial problem for more than 4 phases. We also provide a method to avoid overcounting of boundaries in the original Chan-Vese model without departing from the efficient product-set representation. Finally, we derive an algorithm to solve the associated discretized problem, and demonstrate that it allows to obtain good approximations for the segmentation problem with various number of regions. © 2013 Springer-Verlag.
Neural network for solving convex quadratic bilevel programming problems.
He, Xing; Li, Chuandong; Huang, Tingwen; Li, Chaojie
2014-03-01
In this paper, using the idea of successive approximation, we propose a neural network to solve convex quadratic bilevel programming problems (CQBPPs), which is modeled by a nonautonomous differential inclusion. Different from the existing neural network for CQBPP, the model has the least number of state variables and simple structure. Based on the theory of nonsmooth analysis, differential inclusions and Lyapunov-like method, the limit equilibrium points sequence of the proposed neural networks can approximately converge to an optimal solution of CQBPP under certain conditions. Finally, simulation results on two numerical examples and the portfolio selection problem show the effectiveness and performance of the proposed neural network. Copyright © 2013 Elsevier Ltd. All rights reserved.
Entropies from Coarse-graining: Convex Polytopes vs. Ellipsoids
Directory of Open Access Journals (Sweden)
Nikos Kalogeropoulos
2015-09-01
Full Text Available We examine the Boltzmann/Gibbs/Shannon SBGS and the non-additive Havrda-Charvát/Daróczy/Cressie-Read/Tsallis Sq and the Kaniadakis κ-entropy Sκ from the viewpoint of coarse-graining, symplectic capacities and convexity. We argue that the functional form of such entropies can be ascribed to a discordance in phase-space coarse-graining between two generally different approaches: the Euclidean/Riemannian metric one that reflects independence and picks cubes as the fundamental cells in coarse-graining and the symplectic/canonical one that picks spheres/ellipsoids for this role. Our discussion is motivated by and confined to the behaviour of Hamiltonian systems of many degrees of freedom. We see that Dvoretzky’s theorem provides asymptotic estimates for the minimal dimension beyond which these two approaches are close to each other. We state and speculate about the role that dualities may play in this viewpoint.
Energy Technology Data Exchange (ETDEWEB)
Wang, Yun; Wu, Junmei [State Key Laboratory for Strength and Vibration of Mechanical Structures, School of Nuclear Science and Technology, Xi' an Jiaotong University, Xi' an (China)
2016-08-15
After a severe accident to the nuclear reactor, the in-vessel retention strategy is a key way to prevent the leakage of radioactive material. Nanofluid is a steady suspension used to improve heat-transfer characteristics of working fluids, formed by adding solid particles with diameters below 100 nm to the base fluids, and its thermal physical properties and heat-transfer characteristics are much different from the conventional working fluids. Thus, nanofluids with appropriate nanoparticle type and volume concentration can enhance the heat-transfer process. In this study, the moving particle semi-implicit method-meshless advection using flow-directional local grid method is used to simulate the bubble growth, departure, and sliding on the downward-facing heating surface in pure water and nanofluid (1.0 vol.% Al2O3/H2O) flow boiling processes; additionally, the bubble critical departure angle and sliding characteristics and their influence are also investigated. The results indicate that the bubble in nanofluid departs from the heating surface more easily and the critical departure inclined angle of nanofluid is greater than that of pure water. In addition, the influence of nanofluid on bubble sliding is not significant compared with pure water.
Directory of Open Access Journals (Sweden)
I. Bykov
2017-08-01
Full Text Available Transient heat load tests have been conducted in the lower divertor of DIII-D using DiMES manipulator in order to study the behavior of dust on tungsten Plasma Facing Components (PFCs during ELMy H-mode discharges. Samples with pre-adhered, pre-characterized dust have been exposed at the outer strike point (OSP in a series of discharges with varied intra-(inter- ELM heat fluxes. We used C dust because of its high sublimation temperature and non-metal properties. Al dust as a surrogate for Be and W dust were employed as relevant to that in the ITER divertor. The poor initial thermal contact between the substrate and the particles led to overheating, sublimation and shrinking of the carbon dust, and wetting induced coagulation of Al dust. Little modification of the W dust was observed. An enhanced surface adhesion and improvement of the thermal contact of C and Al dust were the result of exposure. A post mortem “adhesive tape” sampling showed that 70% of Al, <5% of W and C particles could not be removed from the surface owing to the improved adhesion. Al and C but not W particles that could be lifted had W inclusions indicating damage to the substrate. This suggests that non destructive methods may be inefficient for removal of dust in ITER.
Path Following in the Exact Penalty Method of Convex Programming.
Zhou, Hua; Lange, Kenneth
2015-07-01
Classical penalty methods solve a sequence of unconstrained problems that put greater and greater stress on meeting the constraints. In the limit as the penalty constant tends to ∞, one recovers the constrained solution. In the exact penalty method, squared penalties are replaced by absolute value penalties, and the solution is recovered for a finite value of the penalty constant. In practice, the kinks in the penalty and the unknown magnitude of the penalty constant prevent wide application of the exact penalty method in nonlinear programming. In this article, we examine a strategy of path following consistent with the exact penalty method. Instead of performing optimization at a single penalty constant, we trace the solution as a continuous function of the penalty constant. Thus, path following starts at the unconstrained solution and follows the solution path as the penalty constant increases. In the process, the solution path hits, slides along, and exits from the various constraints. For quadratic programming, the solution path is piecewise linear and takes large jumps from constraint to constraint. For a general convex program, the solution path is piecewise smooth, and path following operates by numerically solving an ordinary differential equation segment by segment. Our diverse applications to a) projection onto a convex set, b) nonnegative least squares, c) quadratically constrained quadratic programming, d) geometric programming, and e) semidefinite programming illustrate the mechanics and potential of path following. The final detour to image denoising demonstrates the relevance of path following to regularized estimation in inverse problems. In regularized estimation, one follows the solution path as the penalty constant decreases from a large value.
Hermite-Hadamard type inequalities for GA-s-convex functions
Directory of Open Access Journals (Sweden)
İmdat İşcan
2014-10-01
Full Text Available In this paper, The author introduces the concepts of the GA-s-convex functions in the first sense and second sense and establishes some integral inequalities of Hermite-Hadamard type related to the GA-s-convex functions. Some applications to special means of real numbers are also given.
Guo, Peng; Cao, Jiannong; Zhang, Kui
2015-01-01
In critical event (e.g., fire or gas) monitoring applications of wireless sensor networks (WSNs), convex hull of the event region is an efficient tool in handling the usual tasks like event report, routes reconstruction and human motion planning. Existing works on estimating convex hull of event
de Klerk, E.; Laurent, M.
2011-01-01
The Lasserre hierarchy of semidefinite programming approximations to convex polynomial optimization problems is known to converge finitely under some assumptions. [J. B. Lasserre, Convexity in semialgebraic geometry and polynomial optimization, SIAM J. Optim., 19 (2009), pp. 1995–2014]. We give a
The Concept of Convexity in Fuzzy Set Theory | Rauf | Journal of the ...
African Journals Online (AJOL)
The notions of convex analysis are indispensable in theoretical and applied Mathematics especially in the study of Calculus where it has a natural generalization for the several variables case. This paper investigates the concept of Fuzzy set theory in relation to the idea of convexity. Some fundamental theorems were ...
Effect of dental arch convexity and type of archwire on frictional forces
Fourie, Zacharias; Ozcan, Mutlu; Sandham, John
Introduction: Friction measurements in orthodontics are often derived from models by using brackets placed on flat models with various straight wires. Dental arches are convex in some areas. The objectives of this study were to compare the frictional forces generated in conventional flat and convex
Groeneboom, P.; Jongbloed, G.; Wellner, J.A.
2001-01-01
A process associated with integrated Brownian motion is introduced that characterizes the limit behavior of nonparametric least squares and maximum likelihood estimators of convex functions and convex densities, respectively. We call this process “the invelope” and show that it is an almost surely
Full Text Available Skip to Content Menu Closed (Tap to Open) Home Interviews Our Stories Search All Videos PTSD Basics PTSD Treatment What is AboutFace? Resources for Professionals Get Help Home Watch Interviews Our ...
Full Text Available ... not feeling better, you may have PTSD (posttraumatic stress disorder). Watch the intro This is AboutFace In these videos, Veterans, family members, and clinicians share their experiences with PTSD ...
Full Text Available Skip to Content Menu Closed (Tap to Open) Home Videos by Topic Videos by Type Search All ... What is AboutFace? Resources for Professionals Get Help Home Watch Videos by Topic Videos by Type Search ...
Full Text Available Skip to Content Menu Closed (Tap to Open) Home Interviews Our Stories Search All Videos PTSD Basics ... What is AboutFace? Resources for Professionals Get Help Home Watch Interviews Our Stories Search All Videos Learn ...
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.
Directory of Open Access Journals (Sweden)
Stan Schein
2016-08-01
Full Text Available The Goldberg construction of symmetric cages involves pasting a patch cut out of a regular tiling onto the faces of a Platonic host polyhedron, resulting in a cage with the same symmetry as the host. For example, cutting equilateral triangular patches from a 6.6.6 tiling of hexagons and pasting them onto the full triangular faces of an icosahedron produces icosahedral fullerene cages. Here we show that pasting cutouts from a 6.6.6 tiling onto the full hexagonal and triangular faces of an Archimedean host polyhedron, the truncated tetrahedron, produces two series of tetrahedral (Td fullerene cages. Cages in the first series have 28n2 vertices (n ≥ 1. Cages in the second (leapfrog series have 3 × 28n2. We can transform all of the cages of the first series and the smallest cage of the second series into geometrically convex equilateral polyhedra. With tetrahedral (Td symmetry, these new polyhedra constitute a new class of “convex equilateral polyhedra with polyhedral symmetry”. We also show that none of the other Archimedean polyhedra, six with octahedral symmetry and six with icosahedral, can host full-face cutouts from regular tilings to produce cages with the host’s polyhedral symmetry.
Directory of Open Access Journals (Sweden)
Wei Zheng
Full Text Available The prediction of conformational b-cell epitopes plays an important role in immunoinformatics. Several computational methods are proposed on the basis of discrimination determined by the solvent-accessible surface between epitopes and non-epitopes, but the performance of existing methods is far from satisfying. In this paper, depth functions and the k-th surface convex hull are used to analyze epitopes and exposed non-epitopes. On each layer of the protein, we compute relative solvent accessibility and four different types of depth functions, i.e., Chakravarty depth, DPX, half-sphere exposure and half space depth, to analyze the location of epitopes on different layers of the proteins. We found that conformational b-cell epitopes are rich in charged residues Asp, Glu, Lys, Arg, His; aliphatic residues Gly, Pro; non-charged residues Asn, Gln; and aromatic residue Tyr. Conformational b-cell epitopes are rich in coils. Conservation of epitopes is not significantly lower than that of exposed non-epitopes. The average depths (obtained by four methods for epitopes are significantly lower than that of non-epitopes on the surface using the Wilcoxon rank sum test. Epitopes are more likely to be located in the outer layer of the convex hull of a protein. On the benchmark dataset, the cumulate 10th convex hull covers 84.6% of exposed residues on the protein surface area, and nearly 95% of epitope sites. These findings may be helpful in building a predictor for epitopes.
Glass molding of 3mm diameter aspheric plano-convex lens
Sung, Hayeong; Hue, Myung sang; Lee, Giljae; Ryu, Geunman; Kim, Dongguk; Yang, Suncheol
2017-10-01
The many industries and research fields have demands for small scale optical systems. To satisfy the demands, many studies are conducted and the miniaturization technologies have been developed. The optical lens is directly related to the optical systems and a key component for the miniaturization. So the aspheric surface which can replace multispherical lenses is applied to the optical lens. And fabrication methods to reduce the diameter of the lens have been developed. The glass molding pressing (GMP) process is an attractive method to fabricate aspheric lens among the lens manufacturing processes. Because the GMP process has advantages of productivity, repeatability and so on. In this study, a 3 mm diameter aspheric plano-convex lens was fabricated using the GMP process. The GMP process was divided into heating, pressing, annealing and cooling. And the process was conducted using a commercial glass molding machine. Mold tools consist of an upper and a lower mold insert, an inner and an outer guide. The aspheric and the flat surfaces of the mold inserts were coated with ta-C to prevent the sticking of the glass to the mold. The surfaces of molded lens were measured by white interferometry and surface profilometer. The height and the diameter were measured using optical microscopy. As results, the aspheric surface of the lens was 5.1187 nm in Ra and 0.242 um in Pt. And the flat surface was 2.6697 nm in Ra and 0.13 um in Pt. The height and the diameter were 1.935 mm and 3.002 mm respectively.
Podczeck, Fridrun; Drake, Kevin R; Newton, J Michael
2013-09-15
In the literature various solutions exist for the calculation of the diametral compression tensile strength of doubly-convex tablets and each approach is based on experimental data obtained from single materials (gypsum, microcrystalline cellulose) only. The solutions are represented by complex equations and further differ for elastic and elasto-plastic behaviour of the compacts. The aim of this work was to develop a general equation that is applicable independently of deformation behaviour and which is based on simple tablet dimensions such as diameter and total tablet thickness only. With the help of 3D-FEM analysis the tensile failure stress of doubly-convex tables with central cylinder to total tablet thickness ratios W/D between 0.06 and 0.50 and face-curvature ratios D/R between 0.25 and 1.85 were evaluated. Both elastic and elasto-plastic deformation behaviour were considered. The results of 80 individual simulations were combined and showed that the tensile failure stress σt of doubly-convex tablets can be calculated from σt=(2P/πDW)(W/T)=2P/πDT with P being the failure load, D the diameter, W the central cylinder thickness, and T the total thickness of the tablet. This equation converts into the standard Brazilian equation (σt=2P/πDW) when W equals T, i.e. is equally valid for flat cylindrical tablets. In practice, the use of this new equation removes the need for complex measurements of tablet dimensions, because it only requires values for diameter and total tablet thickness. It also allows setting of standards for the mechanical strength of doubly-convex tablets. The new equation holds both for elastic and elasto-plastic deformation behaviour of the tablets under load. It is valid for all combinations of W/D-ratios between 0.06 and 0.50 with D/R-ratios between 0.00 and 1.85 except for W/D=0.50 in combination with D/R-ratios of 1.85 and 1.43 and for W/D-ratios of 0.40 and 0.30 in combination with D/R=1.85. FEM-analysis indicated a tendency to
Energy Technology Data Exchange (ETDEWEB)
Smith, J.H.
1980-01-15
This handbook provides estimates of average available solar insolation to fixed, flat-plate, south-facing collector surfaces at various array tilt angles at numerous sites in the US. This first volume contains average daily, total insolation estimates, by month, and annual totals for 235 locations. A model that estimates the direct, diffuse, and reflected components of total insolation on an hourly, daily, and monthly basis is presented. A shadow loss model and a reflector augmentation model providing estimates of the losses and gains associated with various fixed array geometries are also described. These models can be used with the insolation model provided or with other recorded data. A FORTRAN computer program with user's guide is presented. The program can be used to generate additional handbook values or to examine the effects of array shadowing and fixed reflector augmentation effects on a daily, monthly, or annual basis. Array shadowing depends on location, array size, array tilt, array separation, and time. The program can be used to examine trade-offs between array spacing and insolation losses due to shadowing. The reflector augmentation program can be used to examine trade-offs among array size and tilt, separation, and reflector tilt to determine the combination of design values that optimize the economic objectives or technical criteria of the system.
Full Text Available ... at first. But if it's been months or years since the trauma and you're not feeling better, you may have PTSD (posttraumatic stress disorder). Watch the intro This is AboutFace In these videos, Veterans, family members, ...
Full Text Available ... What is AboutFace? Resources for Professionals Get Help PTSD We've been there. After a traumatic event — ... you're not feeling better, you may have PTSD (posttraumatic stress disorder). Watch the intro This is ...
Precision platform for convex lens-induced confinement microscopy
Berard, Daniel; McFaul, Christopher M. J.; Leith, Jason S.; Arsenault, Adriel K. J.; Michaud, François; Leslie, Sabrina R.
2013-10-01
We present the conception, fabrication, and demonstration of a versatile, computer-controlled microscopy device which transforms a standard inverted fluorescence microscope into a precision single-molecule imaging station. The device uses the principle of convex lens-induced confinement [S. R. Leslie, A. P. Fields, and A. E. Cohen, Anal. Chem. 82, 6224 (2010)], which employs a tunable imaging chamber to enhance background rejection and extend diffusion-limited observation periods. Using nanopositioning stages, this device achieves repeatable and dynamic control over the geometry of the sample chamber on scales as small as the size of individual molecules, enabling regulation of their configurations and dynamics. Using microfluidics, this device enables serial insertion as well as sample recovery, facilitating temporally controlled, high-throughput measurements of multiple reagents. We report on the simulation and experimental characterization of this tunable chamber geometry, and its influence upon the diffusion and conformations of DNA molecules over extended observation periods. This new microscopy platform has the potential to capture, probe, and influence the configurations of single molecules, with dramatically improved imaging conditions in comparison to existing technologies. These capabilities are of immediate interest to a wide range of research and industry sectors in biotechnology, biophysics, materials, and chemistry.
Neural network for nonsmooth pseudoconvex optimization with general convex constraints.
Bian, Wei; Ma, Litao; Qin, Sitian; Xue, Xiaoping
2018-05-01
In this paper, a one-layer recurrent neural network is proposed for solving a class of nonsmooth, pseudoconvex optimization problems with general convex constraints. Based on the smoothing method, we construct a new regularization function, which does not depend on any information of the feasible region. Thanks to the special structure of the regularization function, we prove the global existence, uniqueness and "slow solution" character of the state of the proposed neural network. Moreover, the state solution of the proposed network is proved to be convergent to the feasible region in finite time and to the optimal solution set of the related optimization problem subsequently. In particular, the convergence of the state to an exact optimal solution is also considered in this paper. Numerical examples with simulation results are given to show the efficiency and good characteristics of the proposed network. In addition, some preliminary theoretical analysis and application of the proposed network for a wider class of dynamic portfolio optimization are included. Copyright © 2018 Elsevier Ltd. All rights reserved.
On asphericity of convex bodies in linear normed spaces.
Faried, Nashat; Morsy, Ahmed; Hussein, Aya M
2018-01-01
In 1960, Dvoretzky proved that in any infinite dimensional Banach space X and for any [Formula: see text] there exists a subspace L of X of arbitrary large dimension ϵ -iometric to Euclidean space. A main tool in proving this deep result was some results concerning asphericity of convex bodies. In this work, we introduce a simple technique and rigorous formulas to facilitate calculating the asphericity for each set that has a nonempty boundary set with respect to the flat space generated by it. We also give a formula to determine the center and the radius of the smallest ball containing a nonempty nonsingleton set K in a linear normed space, and the center and the radius of the largest ball contained in it provided that K has a nonempty boundary set with respect to the flat space generated by it. As an application we give lower and upper estimations for the asphericity of infinite and finite cross products of these sets in certain spaces, respectively.
JPEG2000-coded image error concealment exploiting convex sets projections.
Atzori, Luigi; Ginesu, Giaime; Raccis, Alessio
2005-04-01
Transmission errors in JPEG2000 can be grouped into three main classes, depending on the affected area: LL, high frequencies at the lower decomposition levels, and high frequencies at the higher decomposition levels. The first type of errors are the most annoying but can be concealed exploiting the signal spatial correlation like in a number of techniques proposed in the past; the second are less annoying but more difficult to address; the latter are often imperceptible. In this paper, we address the problem of concealing the second class or errors when high bit-planes are damaged by proposing a new approach based on the theory of projections onto convex sets. Accordingly, the error effects are masked by iteratively applying two procedures: low-pass (LP) filtering in the spatial domain and restoration of the uncorrupted wavelet coefficients in the transform domain. It has been observed that a uniform LP filtering brought to some undesired side effects that negatively compensated the advantages. This problem has been overcome by applying an adaptive solution, which exploits an edge map to choose the optimal filter mask size. Simulation results demonstrated the efficiency of the proposed approach.
Link Prediction via Convex Nonnegative Matrix Factorization on Multiscale Blocks
Directory of Open Access Journals (Sweden)
Enming Dong
2014-01-01
Full Text Available Low rank matrices approximations have been used in link prediction for networks, which are usually global optimal methods and lack of using the local information. The block structure is a significant local feature of matrices: entities in the same block have similar values, which implies that links are more likely to be found within dense blocks. We use this insight to give a probabilistic latent variable model for finding missing links by convex nonnegative matrix factorization with block detection. The experiments show that this method gives better prediction accuracy than original method alone. Different from the original low rank matrices approximations methods for link prediction, the sparseness of solutions is in accord with the sparse property for most real complex networks. Scaling to massive size network, we use the block information mapping matrices onto distributed architectures and give a divide-and-conquer prediction method. The experiments show that it gives better results than common neighbors method when the networks have a large number of missing links.
Convergence theorems for quasi-contractive maps in uniformly convex spaces
International Nuclear Information System (INIS)
Chidume, C.E.; Osilike, M.O.
1992-04-01
Let K be a nonempty closed convex and bounded subset of a real uniformly convex Banach space E of modulus of convexity of power type q≥2. Let T by a quasi-contractive mapping of K into itself. It is proved that each of two well known fixed point iteration methods (the Mann and the Ishikawa iteration methods) converges strongly, without any compactness assumption on the domain of the map, to the unique fixed point of T in K. Our theorems generalize important known results. (author). 22 refs
A One-Layer Recurrent Neural Network for Constrained Complex-Variable Convex Optimization.
Qin, Sitian; Feng, Jiqiang; Song, Jiahui; Wen, Xingnan; Xu, Chen
2018-03-01
In this paper, based on calculus and penalty method, a one-layer recurrent neural network is proposed for solving constrained complex-variable convex optimization. It is proved that for any initial point from a given domain, the state of the proposed neural network reaches the feasible region in finite time and converges to an optimal solution of the constrained complex-variable convex optimization finally. In contrast to existing neural networks for complex-variable convex optimization, the proposed neural network has a lower model complexity and better convergence. Some numerical examples and application are presented to substantiate the effectiveness of the proposed neural network.
A Simple Proof of Cauchy's Surface Area Formula
Tsukerman, Emmanuel; Veomett, Ellen
2016-01-01
We give a short and simple proof of Cauchy's surface area formula, which states that the average area of a projection of a convex body is equal to its surface area up to a multiplicative constant in the dimension.
Auto-recognition of surfaces and auto-generation of material removal volume for finishing process
Kataraki, Pramod S.; Salman Abu Mansor, Mohd
2018-03-01
Auto-recognition of a surface and auto-generation of material removal volumes for the so recognised surfaces has become a need to achieve successful downstream manufacturing activities like automated process planning and scheduling. Few researchers have contributed to generation of material removal volume for a product but resulted in material removal volume discontinuity between two adjacent material removal volumes generated from two adjacent faces that form convex geometry. The need for limitation free material removal volume generation was attempted and an algorithm that automatically recognises computer aided design (CAD) model’s surface and also auto-generate material removal volume for finishing process of the recognised surfaces was developed. The surfaces of CAD model are successfully recognised by the developed algorithm and required material removal volume is obtained. The material removal volume discontinuity limitation that occurred in fewer studies is eliminated.
Groenwold, A.A.; Wood, D.W.; Etman, L.F.P.; Tosserams, S.
2009-01-01
We implement and test a globally convergent sequential approximate optimization algorithm based on (convexified) diagonal quadratic approximations. The algorithm resides in the class of globally convergent optimization methods based on conservative convex separable approximations developed by
International Nuclear Information System (INIS)
Saint-Cyr, B.
2011-01-01
We model in this work granular materials composed of non-convex and cohesive aggregates, in view of application to the rheology of UO 2 powders. The effect of non convexity is analyzed in terms of bulk quantities (Coulomb internal friction and cohesion) and micromechanical parameters such as texture anisotropy and force transmission. In particular, we find that the packing fraction evolves in a complex manner with the shape non convexity and the shear strength increases but saturates due to interlocking between the aggregates. We introduce simple models to describe these features in terms of micro-mechanical parameters. Furthermore, a systematic investigation of shearing, uniaxial compaction and simple compression of cohesive packings show that bulk cohesion increases with non-convexity but is strongly influenced by the boundary conditions and shear bands or stress concentration. (author) [fr
Convex integration theory solutions to the h-principle in geometry and topology
Spring, David
1998-01-01
This book provides a comprehensive study of convex integration theory in immersion-theoretic topology. Convex integration theory, developed originally by M. Gromov, provides general topological methods for solving the h-principle for a wide variety of problems in differential geometry and topology, with applications also to PDE theory and to optimal control theory. Though topological in nature, the theory is based on a precise analytical approximation result for higher order derivatives of functions, proved by M. Gromov. This book is the first to present an exacting record and exposition of all of the basic concepts and technical results of convex integration theory in higher order jet spaces, including the theory of iterated convex hull extensions and the theory of relative h-principles. A second feature of the book is its detailed presentation of applications of the general theory to topics in symplectic topology, divergence free vector fields on 3-manifolds, isometric immersions, totally real embeddings, u...
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...
Energy Technology Data Exchange (ETDEWEB)
Chinsky, B; Patel, R; Roeske, J; Surucu, M [Loyola University Medical Center, Maywood, IL (United States)
2016-06-15
Purpose: To evaluate the inherent accuracy of using a surface guided radiotherapy system (SGRT) in the setup and monitoring of patients receiving stereotactic radiosurgery with an open-face SRS immobilization system. Methods: An anthropomorphic head phantom was set up using the Qfix Encompass SRS Immobilization System on a Varian Edge with OSMS and Varian TrueBeam with AlignRT. The phantom was positioned at 0° gantry and couch. A reference image was acquired using the SGRT system and an ROI was created over the mask opening. The couch and gantry were rotated to different combinations focusing on clinically used SRS gantry/couch combinations and those blocking the SGRT cameras. Perceived surface deviation by the SGRT system from the reference image was recorded. A Winston-Lutz test was performed on couch angles tested and used to exclude couch walkout. The deviation magnitude was calculated using translational values and rotational raw values were recorded. Results: The maximum couch walkouts were: 0.4mm (Edge) and 0.5mm (TB). Solely rotating the gantry resulted in a median couch deviation of 0.2mm and range of 0.1–0.3mm for both linacs. Only rotating the couch (0° gantry) resulted in median deviations of 0.6mm and 0.5mm with ranges of 0.3–1.0mm and 0.3–0.7mm for the Edge and TB, respectively. Combining gantry and couch rotations, the median deviations were 0.7mm and 0.9mm with ranges of 0.3–1.1mm and 0.2–1.9mm for the Edge and TB, respectively. Including all combinations, rotation, roll, and pitch median deviations ranged from 0.1–0.3° with pitch demonstrating consistently higher values and a maximum deviation of 1.0° (both linacs). Conclusion: SGRT is a reliable monitoring tool, though taking into account system fluctuations, 1mm is too restrictive a site tolerance to use with the Qfix Encompass mask. Gantry rotation has little effect on system fluctuation even with camera blockage, whereas couch rotation has a larger effect.
International Nuclear Information System (INIS)
Chinsky, B; Patel, R; Roeske, J; Surucu, M
2016-01-01
Purpose: To evaluate the inherent accuracy of using a surface guided radiotherapy system (SGRT) in the setup and monitoring of patients receiving stereotactic radiosurgery with an open-face SRS immobilization system. Methods: An anthropomorphic head phantom was set up using the Qfix Encompass SRS Immobilization System on a Varian Edge with OSMS and Varian TrueBeam with AlignRT. The phantom was positioned at 0° gantry and couch. A reference image was acquired using the SGRT system and an ROI was created over the mask opening. The couch and gantry were rotated to different combinations focusing on clinically used SRS gantry/couch combinations and those blocking the SGRT cameras. Perceived surface deviation by the SGRT system from the reference image was recorded. A Winston-Lutz test was performed on couch angles tested and used to exclude couch walkout. The deviation magnitude was calculated using translational values and rotational raw values were recorded. Results: The maximum couch walkouts were: 0.4mm (Edge) and 0.5mm (TB). Solely rotating the gantry resulted in a median couch deviation of 0.2mm and range of 0.1–0.3mm for both linacs. Only rotating the couch (0° gantry) resulted in median deviations of 0.6mm and 0.5mm with ranges of 0.3–1.0mm and 0.3–0.7mm for the Edge and TB, respectively. Combining gantry and couch rotations, the median deviations were 0.7mm and 0.9mm with ranges of 0.3–1.1mm and 0.2–1.9mm for the Edge and TB, respectively. Including all combinations, rotation, roll, and pitch median deviations ranged from 0.1–0.3° with pitch demonstrating consistently higher values and a maximum deviation of 1.0° (both linacs). Conclusion: SGRT is a reliable monitoring tool, though taking into account system fluctuations, 1mm is too restrictive a site tolerance to use with the Qfix Encompass mask. Gantry rotation has little effect on system fluctuation even with camera blockage, whereas couch rotation has a larger effect.
Graph Design via Convex Optimization: Online and Distributed Perspectives
Meng, De
Network and graph have long been natural abstraction of relations in a variety of applications, e.g. transportation, power system, social network, communication, electrical circuit, etc. As a large number of computation and optimization problems are naturally defined on graphs, graph structures not only enable important properties of these problems, but also leads to highly efficient distributed and online algorithms. For example, graph separability enables the parallelism for computation and operation as well as limits the size of local problems. More interestingly, graphs can be defined and constructed in order to take best advantage of those problem properties. This dissertation focuses on graph structure and design in newly proposed optimization problems, which establish a bridge between graph properties and optimization problem properties. We first study a new optimization problem called Geodesic Distance Maximization Problem (GDMP). Given a graph with fixed edge weights, finding the shortest path, also known as the geodesic, between two nodes is a well-studied network flow problem. We introduce the Geodesic Distance Maximization Problem (GDMP): the problem of finding the edge weights that maximize the length of the geodesic subject to convex constraints on the weights. We show that GDMP is a convex optimization problem for a wide class of flow costs, and provide a physical interpretation using the dual. We present applications of the GDMP in various fields, including optical lens design, network interdiction, and resource allocation in the control of forest fires. We develop an Alternating Direction Method of Multipliers (ADMM) by exploiting specific problem structures to solve large-scale GDMP, and demonstrate its effectiveness in numerical examples. We then turn our attention to distributed optimization on graph with only local communication. Distributed optimization arises in a variety of applications, e.g. distributed tracking and localization, estimation
A one-dimensional gravitationally interacting gas and the convex minorant of Brownian motion
International Nuclear Information System (INIS)
Suidan, T M
2001-01-01
The surprising connection between a one-dimensional gravitationally interacting gas of sticky particles and the convex minorant process generated by Brownian motion on [0,1] is studied. A study is made of the dynamics of this 1-D gas system by identifying three distinct clustering regimes and the time scales at which they occur. At the critical moment of time the mass distribution of the gas can be computed in terms of functionals of the convex minorant process
Directory of Open Access Journals (Sweden)
Weilin Nie
2017-01-01
Full Text Available Abstract Convex risk minimization is a commonly used setting in learning theory. In this paper, we firstly give a perturbation analysis for such algorithms, and then we apply this result to differential private learning algorithms. Our analysis needs the objective functions to be strongly convex. This leads to an extension of our previous analysis to the non-differentiable loss functions, when constructing differential private algorithms. Finally, an error analysis is then provided to show the selection for the parameters.
Raoufi, Mohammad; Schönherr, Holger
2014-02-18
We report on the fabrication of unprecedented free-standing complex polymeric nanoobjects, which possess both concave and convex curvatures, by exploiting the layer-by-layer (LBL) deposition of polyelectrolytes. In a combined top-down/bottom-up replication approach pore diameter-modulated anodic aluminum oxide (AAO) templates, fabricated by temperature modulation hard anodization (TMHA), were replicated with multilayers of poly(styrene sulfonate) (PSS) and poly(allylamine hydrochloride) (PAH) to yield open nanotubes with diameters in the wide and narrow segments of 210 and 150 nm, respectively. To obtain stable pore diameter-modulated nanopores, which possess segment lengths between 1 and 5 μm and 5 and 10 μm in the narrow and wide pore portion, respectively, conventional hard anodization of aluminum was followed by a subsequent temperature-modulated anodization. After removing the backside aluminum electrode, silanizing the aluminum oxide, and passivating the exposed membrane surface with a thin layer of gold, PSS and PAH were deposited alternatingly to yield LBL multilayers. For optimized LBL multilayer thicknesses and compactness, established in separate experiments on silicon substrates and nanoporous AAO with straight pores, free-standing polymeric nanoobjects with concave and convex curvatures, were obtained. These were stable for wall thickness to pore diameter ratios of ≥0.08.
A Fast Algorithm of Convex Hull Vertices Selection for Online Classification.
Ding, Shuguang; Nie, Xiangli; Qiao, Hong; Zhang, Bo
2018-04-01
Reducing samples through convex hull vertices selection (CHVS) within each class is an important and effective method for online classification problems, since the classifier can be trained rapidly with the selected samples. However, the process of CHVS is NP-hard. In this paper, we propose a fast algorithm to select the convex hull vertices, based on the convex hull decomposition and the property of projection. In the proposed algorithm, the quadratic minimization problem of computing the distance between a point and a convex hull is converted into a linear equation problem with a low computational complexity. When the data dimension is high, an approximate, instead of exact, convex hull is allowed to be selected by setting an appropriate termination condition in order to delete more nonimportant samples. In addition, the impact of outliers is also considered, and the proposed algorithm is improved by deleting the outliers in the initial procedure. Furthermore, a dimension convention technique via the kernel trick is used to deal with nonlinearly separable problems. An upper bound is theoretically proved for the difference between the support vector machines based on the approximate convex hull vertices selected and all the training samples. Experimental results on both synthetic and real data sets show the effectiveness and validity of the proposed algorithm.
Pattern Discovery in Brain Imaging Genetics via SCCA Modeling with a Generic Non-convex Penalty.
Du, Lei; Liu, Kefei; Yao, Xiaohui; Yan, Jingwen; Risacher, Shannon L; Han, Junwei; Guo, Lei; Saykin, Andrew J; Shen, Li
2017-10-25
Brain imaging genetics intends to uncover associations between genetic markers and neuroimaging quantitative traits. Sparse canonical correlation analysis (SCCA) can discover bi-multivariate associations and select relevant features, and is becoming popular in imaging genetic studies. The L1-norm function is not only convex, but also singular at the origin, which is a necessary condition for sparsity. Thus most SCCA methods impose [Formula: see text]-norm onto the individual feature or the structure level of features to pursuit corresponding sparsity. However, the [Formula: see text]-norm penalty over-penalizes large coefficients and may incurs estimation bias. A number of non-convex penalties are proposed to reduce the estimation bias in regression tasks. But using them in SCCA remains largely unexplored. In this paper, we design a unified non-convex SCCA model, based on seven non-convex functions, for unbiased estimation and stable feature selection simultaneously. We also propose an efficient optimization algorithm. The proposed method obtains both higher correlation coefficients and better canonical loading patterns. Specifically, these SCCA methods with non-convex penalties discover a strong association between the APOE e4 rs429358 SNP and the hippocampus region of the brain. They both are Alzheimer's disease related biomarkers, indicating the potential and power of the non-convex methods in brain imaging genetics.
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)
International Nuclear Information System (INIS)
Lo, W.J.; Somorjai, G.A.
1978-01-01
Low-energy-electron diffraction, Auger-electron spectroscopy, electron-energy-loss, and ultraviolet-photoelectron spectroscopies were used to study the structure, composition, and electron energy distribution of a clean single-crystal (111) face of strontium titanate (perovskite). The dependence of the surface chemical composition on the temperature has been observed along with corresponding changes in the surface electronic properties. High-temperature Ar-ion bombardment causes an irreversible change in the surface structure, stoichiometry, and electron energy distribution. In contrast to the TiO 2 surface, there are always significant concentrations of Ti 3+ in an annealed ordered SrTiO 3 (111) surface. This stable active Ti 3+ monolayer on top of a substrate with large surface dipole potential makes SrTiO 3 superior to TiO 2 when used as a photoanode in the photoelectrochemical cell
Alternative face models for 3D face registration
Salah, Albert Ali; Alyüz, Neşe; Akarun, Lale
2007-01-01
3D has become an important modality for face biometrics. The accuracy of a 3D face recognition system depends on a correct registration that aligns the facial surfaces and makes a comparison possible. The best results obtained so far use a one-to-all registration approach, which means each new facial surface is registered to all faces in the gallery, at a great computational cost. We explore the approach of registering the new facial surface to an average face model (AFM), which automatically establishes correspondence to the pre-registered gallery faces. Going one step further, we propose that using a couple of well-selected AFMs can trade-off computation time with accuracy. Drawing on cognitive justifications, we propose to employ category-specific alternative average face models for registration, which is shown to increase the accuracy of the subsequent recognition. We inspect thin-plate spline (TPS) and iterative closest point (ICP) based registration schemes under realistic assumptions on manual or automatic landmark detection prior to registration. We evaluate several approaches for the coarse initialization of ICP. We propose a new algorithm for constructing an AFM, and show that it works better than a recent approach. Finally, we perform simulations with multiple AFMs that correspond to different clusters in the face shape space and compare these with gender and morphology based groupings. We report our results on the FRGC 3D face database.
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)
Directory of Open Access Journals (Sweden)
David A. Becker
2012-11-01
Full Text Available A bilaterally symmetrical convex dodecahedron consisting of twelve quadrilateral faces is derived from the icosahedron via a process akin to Fuller’s Jitterbug Transformation. The unusual zygomorphic dodecahedron so obtained is shown to harbor a bilaterally symmetrical jazz/blues harmonic code on its twelve faces that is related to such fundamental music theoretical constructs as the Circle of Fifths and Euler’s tonnetz. Curiously, the patterning within the aforementioned zygo-dodecahedron is discernibly similar to that observed in a ventral view of the human brain. Moreover, this same pattern is arguably evident during development of the embryonic pharynx. A possible role for the featured zygo-dodecahedron in cephalogenesis is considered. Recent studies concerning type II cadherins, an important class of proteins that promote cell adhesion, have generated data that is demonstrated to conform to this zygo-dodecahedral brain model in a substantially congruous manner.
Face pareidolia in the rhesus monkey
Taubert, Jessica; Wardle, Susan G.; Flessert, Molly; Leopold, David A.; Ungerleider, Leslie G.
2017-01-01
Face perception in humans and non-human primates is rapid and accurate[1–4]. In the human brain, a network of visual processing regions is specialized for faces[5–7]. Although face processing is a priority of the primate visual system, face detection is not infallible. Face pareidolia is the compelling illusion of perceiving facial features on inanimate objects, such as the illusory face on the surface of the moon. Although face pareidolia is commonly experienced by humans, its presence in ot...
Famous face recognition, face matching, and extraversion.
Lander, Karen; Poyarekar, Siddhi
2015-01-01
It has been previously established that extraverts who are skilled at interpersonal interaction perform significantly better than introverts on a face-specific recognition memory task. In our experiment we further investigate the relationship between extraversion and face recognition, focusing on famous face recognition and face matching. Results indicate that more extraverted individuals perform significantly better on an upright famous face recognition task and show significantly larger face inversion effects. However, our results did not find an effect of extraversion on face matching or inverted famous face recognition.
On the complexity of a combined homotopy interior method for convex programming
Yu, Bo; Xu, Qing; Feng, Guochen
2007-03-01
In [G.C. Feng, Z.H. Lin, B. Yu, Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem, Nonlinear Anal. 32 (1998) 761-768; G.C. Feng, B. Yu, Combined homotopy interior point method for nonlinear programming problems, in: H. Fujita, M. Yamaguti (Eds.), Advances in Numerical Mathematics, Proceedings of the Second Japan-China Seminar on Numerical Mathematics, Lecture Notes in Numerical and Applied Analysis, vol. 14, Kinokuniya, Tokyo, 1995, pp. 9-16; Z.H. Lin, B. Yu, G.C. Feng, A combined homotopy interior point method for convex programming problem, Appl. Math. Comput. 84 (1997) 193-211.], a combined homotopy was constructed for solving non-convex programming and convex programming with weaker conditions, without assuming the logarithmic barrier function to be strictly convex and the solution set to be bounded. It was proven that a smooth interior path from an interior point of the feasible set to a K-K-T point of the problem exists. This shows that combined homotopy interior point methods can solve the problem that commonly used interior point methods cannot solveE However, so far, there is no result on its complexity, even for linear programming. The main difficulty is that the objective function is not monotonically decreasing on the combined homotopy path. In this paper, by taking a piecewise technique, under commonly used conditions, polynomiality of a combined homotopy interior point method is given for convex nonlinear programming.
Directory of Open Access Journals (Sweden)
Karan Tangri
2012-01-01
Conclusion: The results of this study indicate that orthodontic bracket slots were different than stated by the manufacturers. All the brackets were larger at the face than at the base. Clinicians should be aware that there may be a three-dimensional loss of tooth positioning as a result of the inadvertent use of orthodontic brackets with inaccurate slots.
Registration of 3D Face Scans with Average Face Models
A.A. Salah (Albert Ali); N. Alyuz; L. Akarun
2008-01-01
htmlabstractThe accuracy of a 3D face recognition system depends on a correct registration that aligns the facial surfaces and makes a comparison possible. The best results obtained so far use a costly one-to-all registration approach, which requires the registration of each facial surface to all
Anomalous dynamics triggered by a non-convex equation of state in relativistic flows
Ibáñez, J. M.; Marquina, A.; Serna, S.; Aloy, M. A.
2018-05-01
The non-monotonicity of the local speed of sound in dense matter at baryon number densities much higher than the nuclear saturation density (n0 ≈ 0.16 fm-3) suggests the possible existence of a non-convex thermodynamics which will lead to a non-convex dynamics. Here, we explore the rich and complex dynamics that an equation of state (EoS) with non-convex regions in the pressure-density plane may develop as a result of genuinely relativistic effects, without a classical counterpart. To this end, we have introduced a phenomenological EoS, the parameters of which can be restricted owing to causality and thermodynamic stability constraints. This EoS can be regarded as a toy model with which we may mimic realistic (and far more complex) EoSs of practical use in the realm of relativistic hydrodynamics.
DEFF Research Database (Denmark)
Kafle, Bishoksan; Gallagher, John Patrick
2014-01-01
We present an approach to constrained Horn clause (CHC) verification combining three techniques: abstract interpretation over a domain of convex polyhedra, specialisation of the constraints in CHCs using abstract interpretation of query-answer transformed clauses, and refinement by splitting...... in conjunction with specialisation for propagating constraints it can frequently solve challenging verification problems. This is a contribution in itself, but refinement is needed when it fails, and the question of how to refine convex polyhedral analyses has not been studied much. We present a refinement...... technique based on interpolants derived from a counterexample trace; these are used to drive a property-based specialisation that splits predicates, leading in turn to more precise convex polyhedral analyses. The process of specialisation, analysis and splitting can be repeated, in a manner similar...
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
Schur-Convexity for a Class of Symmetric Functions and Its Applications
Directory of Open Access Journals (Sweden)
Wei-Feng Xia
2009-01-01
Full Text Available For x=(x1,x2,…,xn∈R+n, the symmetric function ϕn(x,r is defined by ϕn(x,r=ϕn(x1,x2,…,xn;r=∏1≤i1
Virtual & Real Face to Face Teaching
Teneqexhi, Romeo; Kuneshka, Loreta
2016-01-01
In traditional "face to face" lessons, during the time the teacher writes on a black or white board, the students are always behind the teacher. Sometimes, this happens even in the recorded lesson in videos. Most of the time during the lesson, the teacher shows to the students his back not his face. We do not think the term "face to…
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.
DEFF Research Database (Denmark)
Walder, Christian; Breidt, Martin; Bulthoff, Heinrich
2009-01-01
We present a novel algorithm for the markerless tracking of deforming surfaces such as faces. We acquire a sequence of 3D scans along with color images at 40Hz. The data is then represented by implicit surface and color functions, using a novel partition-of-unity type method of efficiently...... the scanned surface, using the variation of both shape and color as features in a dynamic energy minimization problem. Our prototype system yields high-quality animated 3D models in correspondence, at a rate of approximately twenty seconds per timestep. Tracking results for faces and other objects...
Method of convex rigid frames and applications in studies of multipartite quNit pure states
International Nuclear Information System (INIS)
Zhong Zaizhe
2005-01-01
In this letter, we suggest a method of convex rigid frames in the studies of multipartite quNit pure states. We illustrate what the convex rigid frames are, and what is their method. As applications, we use this method to solve some basic problems and give some new results (three theorems): the problem of the partial separability of the multipartite quNit pure states and its geometric explanation; the problem of the classification of multipartite quNit pure states, giving a perfect explanation of the local unitary transformations; thirdly, we discuss the invariants of classes and give a possible physical explanation. (letter to the editor)
Optimization of Transverse Oscillating Fields for Vector Velocity Estimation with Convex Arrays
DEFF Research Database (Denmark)
Jensen, Jørgen Arendt
2013-01-01
A method for making Vector Flow Images using the transverse oscillation (TO) approach on a convex array is presented. The paper presents optimization schemes for TO fields for convex probes and evaluates their performance using Field II simulations and measurements using the SARUS experimental...... from 90 to 45 degrees in steps of 15 degrees. The optimization routine changes the lateral oscillation period lx to yield the best possible estimates based on the energy ratio between positive and negative spatial frequencies in the ultrasound field. The basic equation for lx gives 1.14 mm at 40 mm...
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.
License or entry decision for innovator in international duopoly with convex cost functions
Hattori, Masahiko; Tanaka, Yasuhito
2017-01-01
We consider a choice of options for a foreign innovating firm to license its new cost-reducing technology to a domestic incumbent firm or to enter the domestic market with or without license under convex cost functions. With convex cost functions the domestic market and the foreign market are not separated, and the results depend on the relative size of those markets. In a specific case with linear demand and quadratic cost, entry without license strategy is never the optimal strategy for the...
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.
Convexity of Energy-Like Functions: Theoretical Results and Applications to Power System Operations
Energy Technology Data Exchange (ETDEWEB)
Dvijotham, Krishnamurthy [California Inst. of Technology (CalTech), Pasadena, CA (United States); Low, Steven [California Inst. of Technology (CalTech), Pasadena, CA (United States); Chertkov, Michael [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2015-01-12
Power systems are undergoing unprecedented transformations with increased adoption of renewables and distributed generation, as well as the adoption of demand response programs. All of these changes, while making the grid more responsive and potentially more efficient, pose significant challenges for power systems operators. Conventional operational paradigms are no longer sufficient as the power system may no longer have big dispatchable generators with sufficient positive and negative reserves. This increases the need for tools and algorithms that can efficiently predict safe regions of operation of the power system. In this paper, we study energy functions as a tool to design algorithms for various operational problems in power systems. These have a long history in power systems and have been primarily applied to transient stability problems. In this paper, we take a new look at power systems, focusing on an aspect that has previously received little attention: Convexity. We characterize the domain of voltage magnitudes and phases within which the energy function is convex in these variables. We show that this corresponds naturally with standard operational constraints imposed in power systems. We show that power of equations can be solved using this approach, as long as the solution lies within the convexity domain. We outline various desirable properties of solutions in the convexity domain and present simple numerical illustrations supporting our results.
Perimeter generating functions for the mean-squared radius of gyration of convex polygons
International Nuclear Information System (INIS)
Jensen, Iwan
2005-01-01
We have derived long series expansions for the perimeter generating functions of the radius of gyration of various polygons with a convexity constraint. Using the series we numerically find simple (algebraic) exact solutions for the generating functions. In all cases the size exponent ν 1. (letter to the editor)
A Convex Variational Model for Restoring Blurred Images with Multiplicative Noise
DEFF Research Database (Denmark)
Dong, Yiqiu; Tieyong Zeng
2013-01-01
In this paper, a new variational model for restoring blurred images with multiplicative noise is proposed. Based on the statistical property of the noise, a quadratic penalty function technique is utilized in order to obtain a strictly convex model under a mild condition, which guarantees...
Modeling IrisCode and its variants as convex polyhedral cones and its security implications.
Kong, Adams Wai-Kin
2013-03-01
IrisCode, developed by Daugman, in 1993, is the most influential iris recognition algorithm. A thorough understanding of IrisCode is essential, because over 100 million persons have been enrolled by this algorithm and many biometric personal identification and template protection methods have been developed based on IrisCode. This paper indicates that a template produced by IrisCode or its variants is a convex polyhedral cone in a hyperspace. Its central ray, being a rough representation of the original biometric signal, can be computed by a simple algorithm, which can often be implemented in one Matlab command line. The central ray is an expected ray and also an optimal ray of an objective function on a group of distributions. This algorithm is derived from geometric properties of a convex polyhedral cone but does not rely on any prior knowledge (e.g., iris images). The experimental results show that biometric templates, including iris and palmprint templates, produced by different recognition methods can be matched through the central rays in their convex polyhedral cones and that templates protected by a method extended from IrisCode can be broken into. These experimental results indicate that, without a thorough security analysis, convex polyhedral cone templates cannot be assumed secure. Additionally, the simplicity of the algorithm implies that even junior hackers without knowledge of advanced image processing and biometric databases can still break into protected templates and reveal relationships among templates produced by different recognition methods.
Unifying kinetic approach to phoretic forces and torques onto moving and rotating convex particles
Kröger, M.; Hütter, M.
2006-01-01
We derive general expressions and present several examples for the phoretic forces and torques acting on a translationally moving and rotating convex tracer particle, usually a submicrosized aerosol particle, assumed to be small compared to the mean free path of the surrounding nonequilibrium gas.
Rooij, van I.; Stege, U.; Schactman, A.
2003-01-01
Recently there has been growing interest among psychologists in human performance on the Euclidean traveling salesperson problem (E-TSP). A debate has been initiated on what strategy people use in solving visually presented E-TSP instances. The most prominent hypothesis is the convex-hull
On the convex hull of the simple integer recourse objective function
Klein Haneveld, Willem K.; Stougie, L.; van der Vlerk, Maarten H.
1995-01-01
We consider the objective function of a simple integer recourse problem with fixed technology matrix. Using properties of the expected value function, we prove a relation between the convex hull of this function and the expected value function of a continuous simple recourse program. We present an
On evolving deformation microstructures in non-convex partially damaged solids
Gurses, Ercan; Miehe, Christian
2011-01-01
. These microstructures can be resolved by use of relaxation techniques associated with the construction of convex hulls. We propose a particular relaxation method for partially damaged solids and investigate it in one- and multi-dimensional settings. To this end, we
Convex Bodies With Minimal Volume Product in R^2 --- A New Proof
Lin, Youjiang
2010-01-01
In this paper, a new proof of the following result is given: The product of the volumes of an origin symmetric convex bodies $K$ in R^2 and of its polar body is minimal if and only if $K$ is a parallelogram.
Multiobjective optimization of classifiers by means of 3D convex-hull-based evolutionary algorithms
Zhao, J.; Basto, Fernandes V.; Jiao, L.; Yevseyeva, I.; Asep, Maulana A.; Li, R.; Bäck, T.H.W.; Tang, T.; Michael, Emmerich T. M.
2016-01-01
The receiver operating characteristic (ROC) and detection error tradeoff(DET) curves are frequently used in the machine learning community to analyze the performance of binary classifiers. Recently, the convex-hull-based multiobjective genetic programming algorithm was proposed and successfully
Deformation patterning driven by rate dependent non-convex strain gradient plasticity
Yalcinkaya, T.; Brekelmans, W.A.M.; Geers, M.G.D.
2011-01-01
A rate dependent strain gradient plasticity framework for the description of plastic slip patterning in a system with non-convex energetic hardening is presented. Both the displacement and the plastic slip fields are considered as primary variables. These fields are determined on a global level by
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...
Primal Recovery from Consensus-Based Dual Decomposition for Distributed Convex Optimization
Simonetto, A.; Jamali-Rad, H.
2015-01-01
Dual decomposition has been successfully employed in a variety of distributed convex optimization problems solved by a network of computing and communicating nodes. Often, when the cost function is separable but the constraints are coupled, the dual decomposition scheme involves local parallel
Directory of Open Access Journals (Sweden)
Xuewen Mu
2015-01-01
quadratic programming over second-order cones and a bounded set. At each iteration, we only need to compute the metric projection onto the second-order cones and the projection onto the bound set. The result of convergence is given. Numerical results demonstrate that our method is efficient for the convex quadratic second-order cone programming problems with bounded constraints.
A DEEP CUT ELLIPSOID ALGORITHM FOR CONVEX-PROGRAMMING - THEORY AND APPLICATIONS
FRENK, JBG; GROMICHO, J; ZHANG, S
1994-01-01
This paper proposes a deep cut version of the ellipsoid algorithm for solving a general class of continuous convex programming problems. In each step the algorithm does not require more computational effort to construct these deep cuts than its corresponding central cut version. Rules that prevent
On the rank 1 convexity of stored energy functions of physically linear stress-strain relations
Czech Academy of Sciences Publication Activity Database
Šilhavý, Miroslav; Bertram, A.; Böhlke, T.
2007-01-01
Roč. 86, č. 3 (2007), s. 235-243 ISSN 0374-3535 Institutional research plan: CEZ:AV0Z10190503 Keywords : generalized linear elastic law s * generalized strain measures * rank 1 convexity Subject RIV: BA - General Mathematics Impact factor: 0.743, year: 2007
Directory of Open Access Journals (Sweden)
Mengkun Zhu
2015-01-01
Full Text Available Some sharp estimates of coefficients, distortion, and growth for harmonic mappings with analytic parts convex or starlike functions of order β are obtained. We also give area estimates and covering theorems. Our main results generalise those of Klimek and Michalski.
On the Monotonicity and Log-Convexity of a Four-Parameter Homogeneous Mean
Directory of Open Access Journals (Sweden)
Yang Zhen-Hang
2008-01-01
Full Text Available Abstract A four-parameter homogeneous mean is defined by another approach. The criterion of its monotonicity and logarithmically convexity is presented, and three refined chains of inequalities for two-parameter mean values are deduced which contain many new and classical inequalities for means.
Convex order approximations in case of cash flows of mixed signs
Dhaene, J.; Goovaerts, M.J.; Vanmaele, M.; van Weert, K.
2012-01-01
In Van Weert et al. (2010), results are obtained showing that, when allowing some of the cash flows to be negative, convex order lower bound approximations can still be used to solve general investment problems in a context of provisioning or terminal wealth. In this paper, a correction and further
From a Nonlinear, Nonconvex Variational Problem to a Linear, Convex Formulation
International Nuclear Information System (INIS)
Egozcue, J.; Meziat, R.; Pedregal, P.
2002-01-01
We propose a general approach to deal with nonlinear, nonconvex variational problems based on a reformulation of the problem resulting in an optimization problem with linear cost functional and convex constraints. As a first step we explicitly explore these ideas to some one-dimensional variational problems and obtain specific conclusions of an analytical and numerical nature
Headache as a crucial symptom in the etiology of convexal subarachnoid hemorrhage.
Rico, María; Benavente, Lorena; Para, Marta; Santamarta, Elena; Pascual, Julio; Calleja, Sergio
2014-03-01
Convexal subarachnoid hemorrhage has been associated with different diseases, reversible cerebral vasoconstriction syndrome and cerebral amyloid angiopathy being the 2 main causes. To investigate whether headache at onset is determinant in identifying the underlying etiology for convexal subarachnoid hemorrhage. After searching in the database of our hospital, 24 patients were found with convexal subarachnoid hemorrhage in the last 10 years. The mean age of the sample was 69.5 years. We recorded data referring to demographics, symptoms and neuroimaging. Cerebral amyloid angiopathy patients accounted for 46% of the sample, 13% were diagnosed with reversible cerebral vasoconstriction syndrome, 16% with several other etiologies, and in 25%, the cause remained unknown. Mild headache was present only in 1 (9%) of the 11 cerebral amyloid angiopathy patients, while severe headache was the dominant feature in 86% of cases of the remaining etiologies. Headache is a key symptom allowing a presumptive etiological diagnosis of convexal subarachnoid hemorrhage. While the absence of headache suggests cerebral amyloid angiopathy as the more probable cause, severe headache obliges us to rule out other etiologies, such as reversible cerebral vasoconstriction syndrome. © 2013 American Headache Society.
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)
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.
Mean-square performance of a convex combination of two adaptive filters
DEFF Research Database (Denmark)
Garcia, Jeronimo; Figueiras-Vidal, A.R.; Sayed, A.H.
2006-01-01
Combination approaches provide an interesting way to improve adaptive filter performance. In this paper, we study the mean-square performance of a convex combination of two transversal filters. The individual filters are independently adapted using their own error signals, while the combination i...
Directory of Open Access Journals (Sweden)
San-Yang Liu
2014-01-01
Full Text Available Two unified frameworks of some sufficient descent conjugate gradient methods are considered. Combined with the hyperplane projection method of Solodov and Svaiter, they are extended to solve convex constrained nonlinear monotone equations. Their global convergence is proven under some mild conditions. Numerical results illustrate that these methods are efficient and can be applied to solve large-scale nonsmooth equations.
Robust Nearfield Wideband Beamforming Design Based on Adaptive-Weighted Convex Optimization
Directory of Open Access Journals (Sweden)
Guo Ye-Cai
2017-01-01
Full Text Available Nearfield wideband beamformers for microphone arrays have wide applications in multichannel speech enhancement. The nearfield wideband beamformer design based on convex optimization is one of the typical representatives of robust approaches. However, in this approach, the coefficient of convex optimization is a constant, which has not used all the freedom provided by the weighting coefficient efficiently. Therefore, it is still necessary to further improve the performance. To solve this problem, we developed a robust nearfield wideband beamformer design approach based on adaptive-weighted convex optimization. The proposed approach defines an adaptive-weighted function by the adaptive array signal processing theory and adjusts its value flexibly, which has improved the beamforming performance. During each process of the adaptive updating of the weighting function, the convex optimization problem can be formulated as a SOCP (Second-Order Cone Program problem, which could be solved efficiently using the well-established interior-point methods. This method is suitable for the case where the sound source is in the nearfield range, can work well in the presence of microphone mismatches, and is applicable to arbitrary array geometries. Several design examples are presented to verify the effectiveness of the proposed approach and the correctness of the theoretical analysis.
A Deep Cut Ellipsoid Algorithm for convex Programming: theory and Applications
Frenk, J.B.G.; Gromicho Dos Santos, J.A.; Zhang, S.
1994-01-01
This paper proposes a deep cut version of the ellipsoid algorithm for solving a general class of continuous convex programming problems. In each step the algorithm does not require more computational effort to construct these deep cuts than its corresponding central cut version. Rules that prevent
A deep cut ellipsoid algorithm for convex programming : Theory and applications
J.B.G. Frenk (Hans); J.A.S. Gromicho (Joaquim); S. Zhang (Shuzhong)
1994-01-01
textabstractThis paper proposes a deep cut version of the ellipsoid algorithm for solving a general class of continuous convex programming problems. In each step the algorithm does not require more computational effort to construct these deep cuts than its corresponding central cut version. Rules
Study on feed forward neural network convex optimization for LiFePO4 battery parameters
Liu, Xuepeng; Zhao, Dongmei
2017-08-01
Based on the modern facility agriculture automatic walking equipment LiFePO4 Battery, the parameter identification of LiFePO4 Battery is analyzed. An improved method for the process model of li battery is proposed, and the on-line estimation algorithm is presented. The parameters of the battery are identified using feed forward network neural convex optimization algorithm.
An Efficient Algorithm to Calculate the Minkowski Sum of Convex 3D Polyhedra
Bekker, Henk; Roerdink, Jos B.T.M.
2001-01-01
A new method is presented to calculate the Minkowski sum of two convex polyhedra A and B in 3D. These graphs are given edge attributes. From these attributed graphs the attributed graph of the Minkowski sum is constructed. This graph is then transformed into the Minkowski sum of A and B. The running
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
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.
Directory of Open Access Journals (Sweden)
Gao Jingkun
2018-02-01
Full Text Available Echo simulation is a precondition for developing radar imaging systems, algorithms, and subsequent applications. Electromagnetic scattering modeling of the target is key to echo simulation. At terahertz (THz frequencies, targets are usually of ultra-large electrical size that makes applying classical electromagnetic calculation methods unpractical. In contrast, the short wavelength makes the surface roughness of targets a factor that cannot be ignored, and this makes the traditional echo simulation methods based on point scattering hypothesis in applicable. Modeling the scattering characteristics of targets and efficiently generating its radar echoes in THz bands has become a problem that must be solved. In this paper, a hierarchical semi-deterministic modeling method is proposed. A full-wave algorithm of rough surfaces is used to calculate the scattered field of facets. Then, the scattered fields of all facets are transformed into the target coordinate system and coherently summed. Finally, the radar echo containing phase information can be obtained. Using small-scale rough models, our method is compared with the standard high-frequency numerical method, which verifies the effectiveness of the proposed method. Imaging results of a full-scale cone-shape target is presented, and the scattering model and echo generation problem of the full-scale convex targets with rough surfaces in THz bands are preliminary solved; this lays the foundation for future research on imaging regimes and algorithms.
International Nuclear Information System (INIS)
Firment, L.E.
1977-01-01
The structures of molecular crystal surfaces were investigated for the first time by the use of low-energy electron diffraction (LEED). The experimental results from a variety of molecular crystals were examined and compared as a first step towards understanding the properties of these surfaces on a microscopic level. The method of sample preparation employed, vapor deposition onto metal single-crystal substrates at low temperatures in ultrahigh vacuum, allowed concurrent study of the structures of adsorbed monolayers on metal surfaces and of the growth processes of molecular films on metal substrates. The systems investigated were ice, ammonia, naphthalene, benzene, the n-paraffins (C 3 to C 8 ), cyclohexane, trioxane, acetic acid, propionic acid, methanol, and methylamine adsorbed and condensed on both Pt(111) and Ag(111) surfaces. Electron-beam-induced damage of the molecular surfaces was observed after electron exposures of 10 -4 A sec cm -2 at 20 eV. Aromatic molecular crystal samples were more resistant to damage than samples of saturated molecules. The quality and orientation of the grown molecular crystal films were influenced by substrate preparation and growth conditions. Forty ordered monolayer structures were observed. 110 figures, 22 tables, 162 references
European cinema: face to face with Hollywood
Elsaesser, T.
2005-01-01
In the face of renewed competition from Hollywood since the early 1980s and the challenges posed to Europe's national cinemas by the fall of the Wall in 1989, independent filmmaking in Europe has begun to re-invent itself. European Cinema: Face to Face with Hollywood re-assesses the different
A Face Inversion Effect without a Face
Brandman, Talia; Yovel, Galit
2012-01-01
Numerous studies have attributed the face inversion effect (FIE) to configural processing of internal facial features in upright but not inverted faces. Recent findings suggest that face mechanisms can be activated by faceless stimuli presented in the context of a body. Here we asked whether faceless stimuli with or without body context may induce…
Radiation by Sources on Perfectly Conducting Convex Cylinders with an Impedance Surface Patch.
1980-01-01
U -- = - (a to0 . 0 0 m 4- 0 4- 04 0-0 1 - .0 4’ U-- ~4- 4 0 n4- -- C_ to S~0- 4J C >1 cu S)-0’ (0 C 0)~ 00 =3 .r aCCA 50 It is observed from these...by such a source has only a z-component and it will be denoted by H . H satisfies the reduced, inhomo- geneous wave equation, and the f6 1llowing
Czech Academy of Sciences Publication Activity Database
De Angelis, F.; Vitillaro, G.; Kavan, Ladislav; Nazeeruddin, M. K.; Grätzel, M.
2012-01-01
Roč. 116, č. 34 (2012), s. 18124-18131 ISSN 1932-7447 R&D Projects: GA AV ČR IAA400400804; GA AV ČR KAN200100801 Institutional support: RVO:61388955 Keywords : Dye-sensitized solar cells * density-functional theory * anatase TiO2 surfaces Subject RIV: CG - Electrochemistry Impact factor: 4.814, year: 2012
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
A Genealogy of Convex Solids Via Local and Global Bifurcations of Gradient Vector Fields
Domokos, Gábor; Holmes, Philip; Lángi, Zsolt
2016-12-01
Three-dimensional convex bodies can be classified in terms of the number and stability types of critical points on which they can balance at rest on a horizontal plane. For typical bodies, these are non-degenerate maxima, minima, and saddle points, the numbers of which provide a primary classification. Secondary and tertiary classifications use graphs to describe orbits connecting these critical points in the gradient vector field associated with each body. In previous work, it was shown that these classifications are complete in that no class is empty. Here, we construct 1- and 2-parameter families of convex bodies connecting members of adjacent primary and secondary classes and show that transitions between them can be realized by codimension 1 saddle-node and saddle-saddle (heteroclinic) bifurcations in the gradient vector fields. Our results indicate that all combinatorially possible transitions can be realized in physical shape evolution processes, e.g., by abrasion of sedimentary particles.
International Nuclear Information System (INIS)
Alabau-Boussouira, Fatiha
2005-01-01
This work is concerned with the stabilization of hyperbolic systems by a nonlinear feedback which can be localized on a part of the boundary or locally distributed. We show that general weighted integral inequalities together with convexity arguments allow us to produce a general semi-explicit formula which leads to decay rates of the energy in terms of the behavior of the nonlinear feedback close to the origin. This formula allows us to unify for instance the cases where the feedback has a polynomial growth at the origin, with the cases where it goes exponentially fast to zero at the origin. We also give three other significant examples of nonpolynomial growth at the origin. We also prove the optimality of our results for the one-dimensional wave equation with nonlinear boundary dissipation. The key property for obtaining our general energy decay formula is the understanding between convexity properties of an explicit function connected to the feedback and the dissipation of energy
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)
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...
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...
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...
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...
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)
The steady-state of the (Normalized) LMS is schur convex
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.
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
Convex lattice polygons of fixed area with perimeter-dependent weights.
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.
Reduction of shock induced noise in imperfectly expanded supersonic jets using convex optimization
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.
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.
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.
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.
The steady-state of the (Normalized) LMS is schur convex
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.
Neural Network in Fixed Time for Collision Detection between Two Convex Polyhedra
M. Khouil; N. Saber; M. Mestari
2014-01-01
In this paper, a different architecture of a collision detection neural network (DCNN) is developed. This network, which has been particularly reviewed, has enabled us to solve with a new approach the problem of collision detection between two convex polyhedra in a fixed time (O (1) time). We used two types of neurons, linear and threshold logic, which simplified the actual implementation of all the networks proposed. The study of the collision detection is divided into two sections, the coll...
Annuity factors, duration and convexity : insights from a financial engineering perspective
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...
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)
On Difference of Convex Optimization to Visualize Statistical Data and Dissimilarities
DEFF Research Database (Denmark)
Carrizosa, Emilio; Guerrero, Vanesa; Morales, Dolores Romero
2016-01-01
In this talk we address the problem of visualizing in a bounded region a set of individuals, which has attached a dissimilarity measure and a statistical value. 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 DCA algorithm in a very efficient way. Our algorithmic approach is used to visualize two real-world datasets....
F-SVM: Combination of Feature Transformation and SVM Learning via Convex Relaxation
Wu, Xiaohe; Zuo, Wangmeng; Zhu, Yuanyuan; Lin, Liang
2015-01-01
The generalization error bound of support vector machine (SVM) depends on the ratio of radius and margin, while standard SVM only considers the maximization of the margin but ignores the minimization of the radius. Several approaches have been proposed to integrate radius and margin for joint learning of feature transformation and SVM classifier. However, most of them either require the form of the transformation matrix to be diagonal, or are non-convex and computationally expensive. In this ...
Convex Hypersurfaces and $L^p$ Estimates for Schr\\"odinger Equations
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.
Geometry intuitive, discrete, and convex : a tribute to László Fejes Tóth
Böröczky, Károly; Tóth, Gábor; Pach, János
2013-01-01
The present volume is a collection of a dozen survey articles, dedicated to the memory of the famous Hungarian geometer, László Fejes Tóth, on the 99th anniversary of his birth. Each article reviews recent progress in an important field in intuitive, discrete, and convex geometry. The mathematical work and perspectives of all editors and most contributors of this volume were deeply influenced by László Fejes Tóth.
Image restoration by the method of convex projections: part 2 applications and numerical results.
Sezan, M I; Stark, H
1982-01-01
The image restoration theory discussed in a previous paper by Youla and Webb [1] is applied to a simulated image and the results compared with the well-known method known as the Gerchberg-Papoulis algorithm. The results show that the method of image restoration by projection onto convex sets, by providing a convenient technique for utilizing a priori information, performs significantly better than the Gerchberg-Papoulis method.
On evolving deformation microstructures in non-convex partially damaged solids
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.
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
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
Multilayer Spectral Graph Clustering via Convex Layer Aggregation: Theory and Algorithms
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...
Dey, C.; Dey, S. K.
1983-01-01
An explicit finite difference scheme consisting of a predictor and a corrector has been developed and applied to solve some hyperbolic partial differential equations (PDEs). The corrector is a convex-type function which is applied at each time level and at each mesh point. It consists of a parameter which may be estimated such that for larger time steps the algorithm should remain stable and generate a fast speed of convergence to the steady-state solution. Some examples have been given.
Using Fisher Information Criteria for Chemical Sensor Selection via Convex Optimization Methods
2016-11-16
burden to Department of Defense, Washington Headquarters Services, Directorate for Information Operations and Reports (0704-0188), 1215 Jefferson Davis...10 3.4 Defining the Mean Response Vector, ECD Scale Matrix, Slack Variables and their Con- straints for Convex Optimization...parametrized for optimization and the objective function thus becomes, ln(det(C(θ )))≥ ln(det(F−1(θ ;s))) =− ln(det(F (θ ;s))) (29) where s are the slack
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
Langton, Stephen R. H.; Law, Anna S.; Burton, A. Mike; Schweinberger, Stefan R.
2008-01-01
We report three experiments that investigate whether faces are capable of capturing attention when in competition with other non-face objects. In Experiment 1a participants took longer to decide that an array of objects contained a butterfly target when a face appeared as one of the distracting items than when the face did not appear in the array.…
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.
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.
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.
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
Towards reproducible experimental studies for non-convex polyhedral shaped particles
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.
A two-layer recurrent neural network for nonsmooth convex optimization problems.
Qin, Sitian; Xue, Xiaoping
2015-06-01
In this paper, a two-layer recurrent neural network is proposed to solve the nonsmooth convex optimization problem subject to convex inequality and linear equality constraints. Compared with existing neural network models, the proposed neural network has a low model complexity and avoids penalty parameters. It is proved that from any initial point, the state of the proposed neural network reaches the equality feasible region in finite time and stays there thereafter. Moreover, the state is unique if the initial point lies in the equality feasible region. The equilibrium point set of the proposed neural network is proved to be equivalent to the Karush-Kuhn-Tucker optimality set of the original optimization problem. It is further proved that the equilibrium point of the proposed neural network is stable in the sense of Lyapunov. Moreover, from any initial point, the state is proved to be convergent to an equilibrium point of the proposed neural network. Finally, as applications, the proposed neural network is used to solve nonlinear convex programming with linear constraints and L1 -norm minimization problems.
Derivative-free generation and interpolation of convex Pareto optimal IMRT plans
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.
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
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.
Novel method of finding extreme edges in a convex set of N-dimension vectors
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.
Fan, Yiqiang; Li, Huawei; Foulds, Ian G.
2013-01-01
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
Directory of Open Access Journals (Sweden)
Yoshi-Taka Matsuda
2016-08-01
Full Text Available Highly social animals possess a well-developed ability to distinguish the faces of familiar from novel conspecifics to induce distinct behaviors for maintaining society. However, the behaviors of animals when they encounter ambiguous faces of familiar yet novel conspecifics, e.g., strangers with faces resembling known individuals, have not been well characterised. Using a morphing technique and preferential-looking paradigm, we address this question via the chimpanzee’s facial–recognition abilities. We presented eight subjects with three types of stimuli: (1 familiar faces, (2 novel faces and (3 intermediate morphed faces that were 50% familiar and 50% novel faces of conspecifics. We found that chimpanzees spent more time looking at novel faces and scanned novel faces more extensively than familiar or intermediate faces. Interestingly, chimpanzees looked at intermediate faces in a manner similar to familiar faces with regards to the fixation duration, fixation count, and saccade length for facial scanning, even though the participant was encountering the intermediate faces for the first time. We excluded the possibility that subjects merely detected and avoided traces of morphing in the intermediate faces. These findings suggest a bias for a feeling-of-familiarity that chimpanzees perceive familiarity with an intermediate face by detecting traces of a known individual, as 50% alternation is sufficient to perceive familiarity.
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.
Uniqueness of a pre-generator for $C_0$-semigroup on a general locally convex vector space
Lemle, Ludovic Dan; Wu, Liming
2007-01-01
The main purpose is to generalize a theorem of Arendt about uniqueness of $C_0$-semigroups from Banach space setting to the general locally convex vector spaces, more precisely, we show that cores are the only domains of uniqueness for $C_0$-semigroups on locally convex spaces. As an application, we find a necessary and sufficient condition for that the mass transport equation has one unique $L^1(\\R^d,dx)$ weak solution.
Surface tensor estimation from linear sections
DEFF Research Database (Denmark)
Kousholt, Astrid; Kiderlen, Markus; Hug, Daniel
From Crofton's formula for Minkowski tensors we derive stereological estimators of translation invariant surface tensors of convex bodies in the n-dimensional Euclidean space. The estimators are based on one-dimensional linear sections. In a design based setting we suggest three types of estimators....... These are based on isotropic uniform random lines, vertical sections, and non-isotropic random lines, respectively. Further, we derive estimators of the specific surface tensors associated with a stationary process of convex particles in the model based setting....
Surface tensor estimation from linear sections
DEFF Research Database (Denmark)
Kousholt, Astrid; Kiderlen, Markus; Hug, Daniel
2015-01-01
From Crofton’s formula for Minkowski tensors we derive stereological estimators of translation invariant surface tensors of convex bodies in the n-dimensional Euclidean space. The estimators are based on one-dimensional linear sections. In a design based setting we suggest three types of estimators....... These are based on isotropic uniform random lines, vertical sections, and non-isotropic random lines, respectively. Further, we derive estimators of the specific surface tensors associated with a stationary process of convex particles in the model based setting....
A Shape-Based Account for Holistic Face Processing
Zhao, Mintao; Bülthoff, Heinrich H.; Bülthoff, Isabelle
2016-01-01
Faces are processed holistically, so selective attention to 1 face part without any influence of the others often fails. In this study, 3 experiments investigated what type of facial information (shape or surface) underlies holistic face processing and whether generalization of holistic processing to nonexperienced faces requires extensive…
Almeida, Pedro; Tomas, Ricardo; Rosas, Filipe; Duarte, Joao; Terrinha, Pedro
2015-04-01
Different modes of strain accommodation affecting a deformable hanging-wall in a flat-ramp-flat thrust system were previously addressed through several (sandbox) analog modeling studies, focusing on the influence of different variables, such as: a) thrust ramp dip angle and friction (Bonini et al, 2000); b) prescribed thickness of the hanging-wall (Koy and Maillot, 2007); and c) sin-thrust erosion (compensating for topographic thrust edification, e.g. Persson and Sokoutis, 2002). In the present work we reproduce the same experimental procedure to investigate the influence of two different parameters on hanging-wall deformation: 1) the geometry of the thrusting surface; and 2) the absence of a velocity discontinuity (VD) that is always present in previous similar analogue modeling studies. Considering the first variable we use two end member ramp geometries, flat-ramp-flat and convex-concave, to understand the control exerted by the abrupt ramp edges in the hanging-wall stress-strain distribution, comparing the obtain results with the situation in which such edge singularities are absent (convex-concave thrust ramp). Considering the second investigated parameter, our motivation was the recognition that the VD found in the different analogue modeling settings simply does not exist in nature, despite the fact that it has a major influence on strain accommodation in the deformable hanging-wall. We thus eliminate such apparatus artifact from our models and compare the obtained results with the previous ones. Our preliminary results suggest that both investigated variables play a non-negligible role on the structural style characterizing the hanging-wall deformation of convergent tectonic settings were such thrust-ramp systems were recognized. Acknowledgments This work was sponsored by the Fundação para a Ciência e a Tecnologia (FCT) through project MODELINK EXPL/GEO-GEO/0714/2013. Pedro Almeida wants to thank to FCT for the Ph.D. grant (SFRH/BD/52556/2014) under the
Neurocomputational bases of object and face recognition.
Biederman, I; Kalocsai, P
1997-01-01
A number of behavioural phenomena distinguish the recognition of faces and objects, even when members of a set of objects are highly similar. Because faces have the same parts in approximately the same relations, individuation of faces typically requires specification of the metric variation in a holistic and integral representation of the facial surface. The direct mapping of a hypercolumn-like pattern of activation onto a representation layer that preserves relative spatial filter values in...
Yi, Cancan; Lv, Yong; Xiao, Han; Ke, Ke; Yu, Xun
2017-12-01
For laser-induced breakdown spectroscopy (LIBS) quantitative analysis technique, baseline correction is an essential part for the LIBS data preprocessing. As the widely existing cases, the phenomenon of baseline drift is generated by the fluctuation of laser energy, inhomogeneity of sample surfaces and the background noise, which has aroused the interest of many researchers. Most of the prevalent algorithms usually need to preset some key parameters, such as the suitable spline function and the fitting order, thus do not have adaptability. Based on the characteristics of LIBS, such as the sparsity of spectral peaks and the low-pass filtered feature of baseline, a novel baseline correction and spectral data denoising method is studied in this paper. The improved technology utilizes convex optimization scheme to form a non-parametric baseline correction model. Meanwhile, asymmetric punish function is conducted to enhance signal-noise ratio (SNR) of the LIBS signal and improve reconstruction precision. Furthermore, an efficient iterative algorithm is applied to the optimization process, so as to ensure the convergence of this algorithm. To validate the proposed method, the concentration analysis of Chromium (Cr),Manganese (Mn) and Nickel (Ni) contained in 23 certified high alloy steel samples is assessed by using quantitative models with Partial Least Squares (PLS) and Support Vector Machine (SVM). Because there is no prior knowledge of sample composition and mathematical hypothesis, compared with other methods, the method proposed in this paper has better accuracy in quantitative analysis, and fully reflects its adaptive ability.
Amberg, Brian
2011-01-01
Editing faces in movies is of interest in the special effects industry. We aim at producing effects such as the addition of accessories interacting correctly with the face or replacing the face of a stuntman with the face of the main actor. The system introduced in this thesis is based on a 3D generative face model. Using a 3D model makes it possible to edit the face in the semantic space of pose, expression, and identity instead of pixel space, and due to its 3D nature allows...
Lp-dual affine surface area forms of Busemann–Petty type problems
Indian Academy of Sciences (India)
Associated with the notion of Lp-intersection body which was defined ... Lp-dual affine surface area; Lp-intersection body; Busemann–Petty ..... [11] Schneider R, Convex Bodies: The Brunn–Minkowski Theory (1993) (Cambridge: Cam-.
Computer aided surface representation
Energy Technology Data Exchange (ETDEWEB)
Barnhill, R E
1987-11-01
The aims of this research are the creation of new surface forms and the determination of geometric and physical properties of surfaces. The full sweep from constructive mathematics through the implementation of algorithms and the interactive computer graphics display of surfaces is utilized. Both three-dimensional and multi- dimensional surfaces are considered. Particular emphasis is given to the scientific computing solution of Department of Energy problems. The methods that we have developed and that we are proposing to develop allow applications such as: Producing smooth contour maps from measured data, such as weather maps. Modeling the heat distribution inside a furnace from sample measurements. Terrain modeling based on satellite pictures. The investigation of new surface forms includes the topics of triangular interpolants, multivariate interpolation, surfaces defined on surfaces and monotone and/or convex surfaces. The geometric and physical properties considered include contours, the intersection of surfaces, curvatures as a interrogation tool, and numerical integration.
Series 'Facing Radiation'. 2 Facing radiation is facing residents
International Nuclear Information System (INIS)
Hanzawa, Takahiro
2013-01-01
The series is to report how general people, who are not at all radiological experts, have faced and understood the problems and tasks of radiation given by the Fukushima Daiichi Nuclear Power Plant Accident (Mar. 2011). The section 2 is reported by an officer of Date City, which localizes at 60 km northern west of the Plant, borders on Iitate Village of Fukushima prefecture, and is indicated as the important area of contamination search (IACS), which the reporter has been conducted for as responsible personnel. In July 2011, the ambient dose was as high as 3.0-3.5 mc-Sv/h and the tentative storage place of contaminated materials was decided by own initiative of residents of a small community, from which the real decontamination started in the City. The target dose after decontamination was defined to be 1.0 mc-Sv/h: however, 28/32 IACS municipalities in the prefecture had not defined the target although they had worked for 2 years after the Accident for their areas exceeding the standard 0.23 mc-Sv/h. At the moment of decontamination of the reporter's own house, he noticed that resident's concerns had directed toward its work itself, not toward the target dose, and wondered if these figures had obstructed to correctly face the radiation. At present that about 2.5 years have passed since the Accident, all of Date citizens have personal accumulated glass dosimeters for seeing the effective external dose and it seems that their dose will not exceed 1 mSv/y if the ambient dose estimated is 0.3-5 mc-Sv/h. Media run to popularity not to face radiation, experts tend to hesitate to face media and residents, and radiation dose will be hardly reduced to zero, despite that correct understanding of radiation is a shorter way for residents' own ease: facing radiation is facing residents. (T.T.)
Face Detection and Recognition
National Research Council Canada - National Science Library
Jain, Anil K
2004-01-01
.... Specifically, the report addresses the problem of detecting faces in color images in the presence of various lighting conditions and complex backgrounds as well as recognizing faces under variations...
Measuring External Face Appearance for Face Classification
Masip, David; Lapedriza, Agata; Vitria, Jordi
2007-01-01
In this chapter we introduce the importance of the external features in face classification problems, and propose a methodology to extract the external features obtaining an aligned feature set. The extracted features can be used as input to any standard pattern recognition classifier, as the classic feature extraction approaches dealing with internal face regions in the literature. The resulting scheme follows a top-down segmentation approach to deal with the diversity inherent to the extern...
Face Pareidolia in the Rhesus Monkey.
Taubert, Jessica; Wardle, Susan G; Flessert, Molly; Leopold, David A; Ungerleider, Leslie G
2017-08-21
Face perception in humans and nonhuman primates is rapid and accurate [1-4]. In the human brain, a network of visual-processing regions is specialized for faces [5-7]. Although face processing is a priority of the primate visual system, face detection is not infallible. Face pareidolia is the compelling illusion of perceiving facial features on inanimate objects, such as the illusory face on the surface of the moon. Although face pareidolia is commonly experienced by humans, its presence in other species is unknown. Here we provide evidence for face pareidolia in a species known to possess a complex face-processing system [8-10]: the rhesus monkey (Macaca mulatta). In a visual preference task [11, 12], monkeys looked longer at photographs of objects that elicited face pareidolia in human observers than at photographs of similar objects that did not elicit illusory faces. Examination of eye movements revealed that monkeys fixated the illusory internal facial features in a pattern consistent with how they view photographs of faces [13]. Although the specialized response to faces observed in humans [1, 3, 5-7, 14] is often argued to be continuous across primates [4, 15], it was previously unclear whether face pareidolia arose from a uniquely human capacity. For example, pareidolia could be a product of the human aptitude for perceptual abstraction or result from frequent exposure to cartoons and illustrations that anthropomorphize inanimate objects. Instead, our results indicate that the perception of illusory facial features on inanimate objects is driven by a broadly tuned face-detection mechanism that we share with other species. Published by Elsevier Ltd.
Energy Technology Data Exchange (ETDEWEB)
Abreu, Billy A. de; Broering, Carlos E. [Universidade Federal de Santa Catarina (UFSC), Florianopolis, SC (Brazil). Dept. de Engenharia Mecanica
2004-07-01
Facing such challenges, the main objective of this work is to develop automated equipment and new welding procedures to be used to repair tank reservoirs operating in corrosive media. The equipment is expected to be applied directly in the maintenance of petrochemical plants. The project consists on a mechanical displacement device, able to move along a flexible rail, which can be fixed to a concave or convex surface and fitting itself to the geometry. A transversal arm gives it a second movement ability, allowing oscillatory displacements and the exact positioning of the pistol. As it is widely known, the automated welding process results in a considerably increase in productivity and quality, when comparing to the hand made process. Therefore, knowing the parameters involved and adjusted the welding variables to the best values, it is expected to achieve welding free of imperfections, inconsistencies and errors, and able to be repetitive. (author)
Bin, Liu; Zhengyu, Liu; Shucai, Li; Lichao, Nie; Maoxin, Su; Huaifeng, Sun; Kerui, Fan; Xinxin, Zhang; Yonghao, Pang
2017-09-01
This paper describes the application of a comprehensive surface geophysical investigation of underground karst systems ahead of the tunnel face in the Xiaoheyan section in the main line of the water supply project from Songhua River, located in Jilin, China. To make an accurate investigation, Surface Electrical Resistivity Tomography (S-ERT), Transient Electromagnetic Method (TEM), Geological Drilling (Geo-D) and Three-dimensional Cross-hole Electrical Resistivity Tomography (3D cross-hole ERT) were applied to gain a comprehensive interpretation. To begin with, S-ERT and TEM are adopted to detect and delineate the underground karst zone. Based on the detection results, surface and in-tunnel Geo-D are placed in major areas with more specific and accurate information gained. After that, survey lines of 3D cross-hole ERT are used to conduct detailed exploration towards underground karst system. In the comprehensive investigation, it is the major question to make the best of prior information so as to promote the quality of detection. The paper has put forward strategies to make the full use of effective information in data processing and the main ideas of those strategies include: (1) Take the resistivity distribution of the subsurface stratum gained by S-ERT inversion as the initial model of TEM inversion; (2) Arrange borehole positions with the results of S-ERT and TEM. After that, gain more accurate information about resistivity of subsurface stratum using those boreholes located; (3) Through the comprehensive analysis of the information about S-ERT, TEM and Geo-D, set the initial model of 3D cross-hole resistivity inversion and meanwhile, gain the variation range of stratum resistivity. At last, a 3D cross-hole resistivity inversion based on the incorporated initial model and inequality constraint is conducted. Constrained inversion and joint interpretation are realized by the effective use of prior information in comprehensive investigation, helping to suppress
Image restoration by the method of convex projections: part 1 theory.
Youla, D C; Webb, H
1982-01-01
A projection operator onto a closed convex set in Hilbert space is one of the few examples of a nonlinear map that can be defined in simple abstract terms. Moreover, it minimizes distance and is nonexpansive, and therefore shares two of the more important properties of ordinary linear orthogonal projections onto closed linear manifolds. In this paper, we exploit the properties of these operators to develop several iterative algorithms for image restoration from partial data which permit any number of nonlinear constraints of a certain type to be subsumed automatically. Their common conceptual basis is as follows. Every known property of an original image f is envisaged as restricting it to lie in a well-defined closed convex set. Thus, m such properties place f in the intersection E(0) = E(i) of the corresponding closed convex sets E(1),E(2),...EE(m). Given only the projection operators PE(i) onto the individual E(i)'s, i = 1 --> m, we restore f by recursive means. Clearly, in this approach, the realization of the P(i)'s in a Hilbert space setting is one of the major synthesis problems. Section I describes the geometrical significance of the three main theorems in considerable detail, and most of the underlying ideas are illustrated with the aid of simple diagrams. Section II presents rules for the numerical implementation of 11 specific projection operators which are found to occur frequently in many signal-processing applications, and the Appendix contains proofs of all the major results.
3D face modeling, analysis and recognition
Daoudi, Mohamed; Veltkamp, Remco
2013-01-01
3D Face Modeling, Analysis and Recognition presents methodologies for analyzing shapes of facial surfaces, develops computational tools for analyzing 3D face data, and illustrates them using state-of-the-art applications. The methodologies chosen are based on efficient representations, metrics, comparisons, and classifications of features that are especially relevant in the context of 3D measurements of human faces. These frameworks have a long-term utility in face analysis, taking into account the anticipated improvements in data collection, data storage, processing speeds, and application s
An inequality for convex functionals and its application to a maxwellian gas
Directory of Open Access Journals (Sweden)
G. Toscani
1991-05-01
Full Text Available We study the trend towards equilibrium of the solution of the spatially homogeneous Boltzmann equation for a gas of Maxwellian molecules. The cases of axially symmetric and plane initial densities are investigated. In these situations, the strong L1 convergence to equilibrium follows by a suitable use of some convex and isotropic functionals, with monotonic behaviour in time along the solution. The initial density is required to have finite energy and entropy. It is shown that the functionals satisfy a common convolution inequality.
An Iterative Procedure for Obtaining I-Projections onto the Intersection of Convex Sets.
1984-06-01
Dykstra Department of Statistics and Actuarial Science The University of Iowa Iowa City, Iowa 52242 Technical Report #106 June 1984D I e ELECTE lSEP...t Theorem ~ ~ 2.. Asm i where the 4 are closed, convex sets of PD’s and R d 0 is a nonnegative vector such that there exists a T E 4 where I(TIR) < M...PERFOMING ORGANIZATION NAME AND ADDRESS 1. PROGIRA ILEMNT. PROJECT. TAK Department of Statistics and Actuarial Science AEAS a WORK UNIT Numaa The
Horn clause verification with convex polyhedral abstraction and tree automata-based refinement
DEFF Research Database (Denmark)
Kafle, Bishoksan; Gallagher, John Patrick
2017-01-01
In this paper we apply tree-automata techniques to refinement of abstract interpretation in Horn clause verification. We go beyond previous work on refining trace abstractions; firstly we handle tree automata rather than string automata and thereby can capture traces in any Horn clause derivations...... underlying the Horn clauses. Experiments using linear constraint problems and the abstract domain of convex polyhedra show that the refinement technique is practical and that iteration of abstract interpretation with tree automata-based refinement solves many challenging Horn clause verification problems. We...... compare the results with other state-of-the-art Horn clause verification tools....
Directory of Open Access Journals (Sweden)
Tobias Nüesch
2014-02-01
Full Text Available This paper presents a novel method to solve the energy management problem for hybrid electric vehicles (HEVs with engine start and gearshift costs. The method is based on a combination of deterministic dynamic programming (DP and convex optimization. As demonstrated in a case study, the method yields globally optimal results while returning the solution in much less time than the conventional DP method. In addition, the proposed method handles state constraints, which allows for the application to scenarios where the battery state of charge (SOC reaches its boundaries.
Preliminary In-Vivo Evaluation of Convex Array Synthetic Aperture Imaging
DEFF Research Database (Denmark)
Pedersen, Morten Høgholm; Gammelmark, Kim; Jensen, Jørgen Arendt
2004-01-01
of STA imaging in comparison to conventional imaging. The purpose is to evaluate whether STA imaging is feasible in-vivo. and whether the image quality obtained is comparable to traditional scanned imaging in terms of penetration depth, spatial resolution, contrast resolution, and artifacts. Acquisition...... was done using our RASMUS research scanner and a 5.5 MHz convex array transducer. STA imaging applies spherical wave emulation using multi-element subapertures and a 20 mus linear FM signal as excitation pulse. For conventional imaging a 64 element aperture was used in transmit and receive with a 1.5 cycle...
Geometry of convex polygons and locally minimal binary trees spanning these polygons
International Nuclear Information System (INIS)
Ivanov, A O; Tuzhilin, A A
1999-01-01
In previous works the authors have obtained an effective classification of planar locally minimal binary trees with convex boundaries. The main aim of the present paper is to find more subtle restrictions on the possible structure of such trees in terms of the geometry of the given boundary set. Special attention is given to the case of quasiregular boundaries (that is, boundaries that are sufficiently close to regular ones in a certain sense). In particular, a series of quasiregular boundaries that cannot be spanned by a locally minimal binary tree is constructed
DEFF Research Database (Denmark)
Sidky, Emil Y.; Jørgensen, Jakob Heide; Pan, Xiaochuan
2012-01-01
The primal–dual optimization algorithm developed in Chambolle and Pock (CP) (2011 J. Math. Imag. Vis. 40 1–26) is applied to various convex optimization problems of interest in computed tomography (CT) image reconstruction. This algorithm allows for rapid prototyping of optimization problems...... for the purpose of designing iterative image reconstruction algorithms for CT. The primal–dual algorithm is briefly summarized in this paper, and its potential for prototyping is demonstrated by explicitly deriving CP algorithm instances for many optimization problems relevant to CT. An example application...