Sample records for convex non-instrumented fusion

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

4. Convex analysis

CERN Document Server

Rockafellar, Ralph Tyrell

2015-01-01

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

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

6. Convex surfaces

CERN Document Server

Busemann, Herbert

2008-01-01

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

7. Convex polytopes

CERN Document Server

Klee, Victor; Ziegler, Günter

2003-01-01

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

NARCIS (Netherlands)

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

2000-01-01

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

9. Convex Lattice Polygons

Science.gov (United States)

Scott, Paul

2006-01-01

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

10. Two-convex polygons

OpenAIRE

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

2009-01-01

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

11. Analytic aspects of convexity

CERN Document Server

Colesanti, Andrea; Gronchi, Paolo

2018-01-01

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

12. Theory of convex structures

CERN Document Server

van de Vel, MLJ

1993-01-01

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

13. Convexity and Marginal Vectors

NARCIS (Netherlands)

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

2002-01-01

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

14. Convex Interval Games

NARCIS (Netherlands)

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

2008-01-01

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

15. Dynamic Planar Convex Hull

DEFF Research Database (Denmark)

Jacob, Riko

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

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

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

18. Stereotype locally convex spaces

Science.gov (United States)

Akbarov, S. S.

2000-08-01

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

19. Generalized Convexity and Inequalities

OpenAIRE

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

2007-01-01

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

20. Dynamic Planar Convex Hull

DEFF Research Database (Denmark)

Brodal, Gerth Stølfting; Jacob, Rico

2002-01-01

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

1. Notions of convexity

CERN Document Server

Hörmander, Lars

1994-01-01

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

2. Some Aspects of Convexity

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.

3. Convex Optimization in R

Directory of Open Access Journals (Sweden)

Roger Koenker

2014-09-01

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

4. On convex complexity measures

Czech Academy of Sciences Publication Activity Database

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

2010-01-01

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

5. Fusion

CERN Document Server

Mahaffey, James A

2012-01-01

As energy problems of the world grow, work toward fusion power continues at a greater pace than ever before. The topic of fusion is one that is often met with the most recognition and interest in the nuclear power arena. Written in clear and jargon-free prose, Fusion explores the big bang of creation to the blackout death of worn-out stars. A brief history of fusion research, beginning with the first tentative theories in the early 20th century, is also discussed, as well as the race for fusion power. This brand-new, full-color resource examines the various programs currently being funded or p

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

7. Convex games versus clan games

NARCIS (Netherlands)

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

2008-01-01

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

8. Convex Games versus Clan Games

NARCIS (Netherlands)

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

2006-01-01

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

9. Convexity Adjustments for ATS Models

DEFF Research Database (Denmark)

Murgoci, Agatha; Gaspar, Raquel M.

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

10. Nested convex bodies are chaseable

NARCIS (Netherlands)

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

2018-01-01

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

11. Design and fabrication of non-instrumented capsule

Energy Technology Data Exchange (ETDEWEB)

Kim, Yong Sung; Lee, Jeong Young; Kim, Joon Yeon; Lee, Sung Ho; Ji, Dae Young; Kim, Suk Hoon; Ahn, Sung Ho [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)

1995-04-01

The use of non-instrumented capsule designed and fabricated in this time is for the evaluation of material irradiation performance, it is to be installed in the inner core of HANARO. The design process of non-instrumented capsule was accomplished by the decision of the quality of material and the shape, thermal analysis, structural analysis. The temperature of the specimen and the stress in capsule during irradiation test was calculated by the thermal analysis and the structural analysis. GGENGTC code and ABAQUS code were used for the calculation of non-instrumented capsule. In case of installing the capsule in irradiation hole, the coolant flow rate and the pressure drop in the hole is changed, which will affect the coolant flow rate of the fuel region. Eventually the coolant flow rate outside capsule have to be restricted to the allowable range. In order to obtain the required pressure drop, the flow rate control mechanism, end plate and orifice ring were used in this test. The test results are compared with 36-element fuel pressure drop data which AECL performed by the SCTR facility.

12. Design and fabrication of non-instrumented capsule

International Nuclear Information System (INIS)

Kim, Yong Sung; Lee, Jeong Young; Kim, Joon Yeon; Lee, Sung Ho; Ji, Dae Young; Kim, Suk Hoon; Ahn, Sung Ho

1995-04-01

The use of non-instrumented capsule designed and fabricated in this time is for the evaluation of material irradiation performance, it is to be installed in the inner core of HANARO. The design process of non-instrumented capsule was accomplished by the decision of the quality of material and the shape, thermal analysis, structural analysis. The temperature of the specimen and the stress in capsule during irradiation test was calculated by the thermal analysis and the structural analysis. GGENGTC code and ABAQUS code were used for the calculation of non-instrumented capsule. In case of installing the capsule in irradiation hole, the coolant flow rate and the pressure drop in the hole is changed, which will affect the coolant flow rate of the fuel region. Eventually the coolant flow rate outside capsule have to be restricted to the allowable range. In order to obtain the required pressure drop, the flow rate control mechanism, end plate and orifice ring were used in this test. The test results are compared with 36-element fuel pressure drop data which AECL performed by the SCTR facility

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

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

15. Geometry of isotropic convex bodies

CERN Document Server

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

2014-01-01

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

16. A new convexity measure for polygons.

Science.gov (United States)

Zunic, Jovisa; Rosin, Paul L

2004-07-01

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

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

18. Nonsmooth Mechanics and Convex Optimization

CERN Document Server

Kanno, Yoshihiro

2011-01-01

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

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

20. On the Moduli of Convexity

Czech Academy of Sciences Publication Activity Database

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

2007-01-01

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

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

2. Convexity of the effective potential

International Nuclear Information System (INIS)

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

3. Computing farthest neighbors on a convex polytope

NARCIS (Netherlands)

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

2002-01-01

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

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

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

6. Learning Convex Inference of Marginals

OpenAIRE

Domke, Justin

2012-01-01

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

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

8. Finite dimensional convexity and optimization

CERN Document Server

Florenzano, Monique

2001-01-01

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

9. Use of Convexity in Ostomy Care

Science.gov (United States)

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

2017-01-01

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

10. Fabrication of Non-instrumented capsule for DUPIC simulated fuel irradiation test in HANARO

Energy Technology Data Exchange (ETDEWEB)

Kim, B.G.; Kang, Y.H.; Park, S.J.; Shin, Y.T. [Korea Atomic Energy Research Institute, Taejon (Korea)

1999-10-01

In order to develope DUPIC nuclear fuel, the irradiation test for simulated DUPIC fuel was planed using a non-instrumented capsule in HANARO. Because DUPIC fuel is highly radioactive material the non-instrumented capsule for an irradiation test of simulated DUPIC fuel in HANARO was designed to remotely assemble and disassemble in hot cell. And then, according to the design requirements the non-instrumented DUPIC capsule was successfully manufactured. Also, the manufacturing technologies of the non-instrumented capsule for irradiating the nuclear fuel in HANARO were established, and the basic technology for the development of the instrumented capsule technology was accumulated. This report describes the manufacturing of the non-instrumented capsule for simulated DUPIC fuel. And, this report will be based to develope the instrumented capsule, which will be utilized to irradiate the nuclear fuel in HANARO. 26 refs., 4 figs. (Author)

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

12. Entropy coherent and entropy convex measures of risk

NARCIS (Netherlands)

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

13. Pluripotential theory and convex bodies

Science.gov (United States)

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

2018-03-01

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

14. Convex analysis and global optimization

CERN Document Server

Tuy, Hoang

2016-01-01

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

15. Characterizing Convexity of Games using Marginal Vectors

NARCIS (Netherlands)

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

2003-01-01

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

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

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

18. Strictly convex functions on complete Finsler manifolds

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

19. Introduction to Convex and Quasiconvex Analysis

NARCIS (Netherlands)

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

2004-01-01

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

20. Convexity of oligopoly games without transferable technologies

NARCIS (Netherlands)

Driessen, Theo; Meinhardt, Holger I.

2005-01-01

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

1. Convex bodies with many elliptic sections

OpenAIRE

Arelio, Isaac; Montejano, Luis

2014-01-01

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

2. Generalized convexity, generalized monotonicity recent results

CERN Document Server

Martinez-Legaz, Juan-Enrique; Volle, Michel

1998-01-01

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

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

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

OpenAIRE

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

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

6. Convex sets in probabilistic normed spaces

International Nuclear Information System (INIS)

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

7. Designing Camera Networks by Convex Quadratic Programming

KAUST Repository

Ghanem, Bernard; Wonka, Peter; Cao, Yuanhao

2015-01-01

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

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

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

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

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

12. Counting convex polygons in planar point sets

NARCIS (Netherlands)

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

1995-01-01

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

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

Science.gov (United States)

Parekh, Ankit

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

14. Entropy Coherent and Entropy Convex Measures of Risk

NARCIS (Netherlands)

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,

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

16. Convex Banding of the Covariance Matrix.

Science.gov (United States)

Bien, Jacob; Bunea, Florentina; Xiao, Luo

2016-01-01

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

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

18. Non-convex multi-objective optimization

CERN Document Server

Pardalos, Panos M; Žilinskas, Julius

2017-01-01

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

19. A generalization of the convex Kakeya problem

KAUST Repository

Ahn, Heekap

2012-01-01

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

20. Reconstruction of convex bodies from surface tensors

DEFF Research Database (Denmark)

Kousholt, Astrid; Kiderlen, Markus

We present two algorithms for reconstruction of the shape of convex bodies in the two-dimensional Euclidean space. The first reconstruction algorithm requires knowledge of the exact surface tensors of a convex body up to rank s for some natural number s. The second algorithm uses harmonic intrinsic...... volumes which are certain values of the surface tensors and allows for noisy measurements. From a generalized version of Wirtinger's inequality, we derive stability results that are utilized to ensure consistency of both reconstruction procedures. Consistency of the reconstruction procedure based...

1. Probing convex polygons with X-rays

International Nuclear Information System (INIS)

Edelsbrunner, H.; Skiena, S.S.

1988-01-01

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

2. Recovering convexity in non-associated plasticity

Science.gov (United States)

Francfort, Gilles A.

2018-03-01

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

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

CERN Document Server

Bayoumi, A

2003-01-01

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

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

5. Conference on Convex Analysis and Global Optimization

CERN Document Server

Pardalos, Panos

2001-01-01

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

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

7. Localized Multiple Kernel Learning A Convex Approach

Science.gov (United States)

2016-11-22

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

8. A generalization of the convex Kakeya problem

KAUST Repository

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

2013-01-01

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

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

10. Directional Convexity and Finite Optimality Conditions.

Science.gov (United States)

1984-03-01

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

11. Convexity properties of Hamiltonian group actions

CERN Document Server

Guillemin, Victor

2005-01-01

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

12. Some Characterizations of Convex Interval Games

NARCIS (Netherlands)

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

2008-01-01

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

13. A generalization of the convex Kakeya problem

KAUST Repository

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

2012-01-01

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

14. A generalization of the convex Kakeya problem

KAUST Repository

Ahn, Heekap

2013-09-19

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

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

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

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

18. Fast approximate convex decomposition using relative concavity

KAUST Repository

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

2013-01-01

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

19. Fast approximate convex decomposition using relative concavity

KAUST Repository

Ghosh, Mukulika

2013-02-01

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

20. The Hydraulic Test Procedure for Non-instrumented Irradiation Test Rig of Annular Fuel

Energy Technology Data Exchange (ETDEWEB)

Kim, Dae Ho; Lee, Kang Hee; Shin, Chang Hwan; Park, Chan Kook

2008-08-15

This report presents the procedure of pressure drop test, vibration test and endurance test for the non-instrumented rig using the irradiation test in HANARO of advanced PWR annular fuel which were designed and fabricated by KAERI. From the out-pile thermal hydraulic tests, confirm the flow rate at the 200 kPa pressure drop and measure the RMS displacement at this time. And the endurance test is confirmed the wear and the integrity of the non-instrumented rig at the 110% design flow rate. This out-pile test perform the Flow-Induced Vibration and Pressure Drop Experimental Tester(FIVPET) facility. The instruments in FIVPET facility was calibrated in KAERI and the pump and the thermocouple were certified by manufacturer.

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

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

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

KAUST Repository

Seneci, Tommaso

2018-01-01

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

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

Science.gov (United States)

Perrin, Angie

2016-12-08

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

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

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

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

8. Solving ptychography with a convex relaxation

Science.gov (United States)

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

2015-05-01

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

9. Convex nonnegative matrix factorization with manifold regularization.

Science.gov (United States)

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

2015-03-01

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

10. Convexity, gauge-dependence and tunneling rates

International Nuclear Information System (INIS)

Plascencia, Alexis D.; Tamarit, Carlos

2016-01-01

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

11. An easy path to convex analysis and applications

CERN Document Server

Mordukhovich, Boris S

2013-01-01

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

12. Convex geometry of quantum resource quantification

Science.gov (United States)

Regula, Bartosz

2018-01-01

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

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

14. Dynamic Convex Duality in Constrained Utility Maximization

OpenAIRE

Li, Yusong; Zheng, Harry

2016-01-01

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

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

16. The occipital lobe convexity sulci and gyri.

Science.gov (United States)

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

2012-05-01

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

17. Convex Hull Aided Registration Method (CHARM).

Science.gov (United States)

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

2017-09-01

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

18. Generalized vector calculus on convex domain

Science.gov (United States)

Agrawal, Om P.; Xu, Yufeng

2015-06-01

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

19. Convexities move because they contain matter.

Science.gov (United States)

Barenholtz, Elan

2010-09-22

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

20. Design and manufacturing of non-instrumented capsule for advanced PWR fuel pellet irradiation test in HANARO

Energy Technology Data Exchange (ETDEWEB)

Kim, D. H.; Lee, C. B.; Song, K. W. [Korea Atomic Energy Research Institute, Taejeon (Korea)

2002-04-01

1. The Design and Manufacturing Report of Plug Type Non-Instrumented Rig for Irradiation Test in HANARO OR Hole

Energy Technology Data Exchange (ETDEWEB)

Kim, Dae Ho; Bang, Je Geon; Lim, Ik Sung; Kim, Sun Ki; Yang, Yong Sik; Song, Kun Woo

2008-09-15

This project is developed the plug type non-instrumented irradiation test rig of the advanced nuclear fuel in HANARO for pursuit advanced performance in High Performance Fuel Technology Development as a part Nuclear Mid and Long-term R and D Program. This irradiation rig was confirmed the integrity and HANARO core compatibility by the optimum design and the thermal hydraulic out-pile test in FIVPET. The characteristic of plug type non-instrument rig is to possible irradiation test of variable in-pile condition and reduced the wastes for reusable as function. This plug type non-instrumented rig was satisfied the quality assurance requirements and written out the end of manufacturing report. This plug type non-instrumented rig is adopt to the irradiation test for nuclear fuel irradiation test in HANARO OR hole.

2. The Hydraulic Test Report for Non-instrumented Irradiation Test Rig of DUO-Cooled Annular Pellet

International Nuclear Information System (INIS)

Kim, Dae Ho; Lee, Kang Hee; Shin, Chang Hwan; Yang, Yong Sik; Kim, Sun Ki; Bang, Je Geon; Song, Kun Woo

2007-08-01

This report presents the results of pressure drop test and vibration test for non-instrumented rig of Advanced PWR DUO-Fuel Annular Pellet which were designed and fabricated by KAERI. From the pressure drop test results, it is noted that the flow velocity across the non-instrumented rig of Advanced PWR DUO-Fuel Annular Pellet corresponding to the pressure drop of 200 kPa is measured to be about 8.30 kg/sec. Vibration frequency results for the non-instrumented rig at the pump spin frequency ranges from 19.0 to 32.0 Hz, RMS(Root Mean Square) displacement for the non-instrumented rig of Advanced PWR DUO-Fuel Annular Pellet is less than 7.25 m, and the maximum displacement is less than 31.27 μm. This test was performed at the FIVPET facility

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

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

5. Convex functions and optimization methods on Riemannian manifolds

CERN Document Server

Udrişte, Constantin

1994-01-01

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

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

OpenAIRE

Diamond, Steven; Boyd, Stephen

2016-01-01

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

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

Science.gov (United States)

Diamond, Steven; Boyd, Stephen

2016-04-01

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

8. Convex blind image deconvolution with inverse filtering

Science.gov (United States)

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

2018-03-01

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

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

10. INdAM Workshop on Analytic Aspects of Convexity

CERN Document Server

Colesanti, Andrea; Gronchi, Paolo

2018-01-01

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

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

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

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

14. Entropy coherent and entropy convex measures of risk

NARCIS (Netherlands)

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

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

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

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

Science.gov (United States)

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.

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

Directory of Open Access Journals (Sweden)

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.

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

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

CERN Document Server

Panik, Michael J

1993-01-01

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

1. Non-instrumented capsule design of HANARO irradiation test for the high burn-up large grain UO2 pellets

International Nuclear Information System (INIS)

Kim, D. H.; Lee, C. B.; Oh, D. S.

2001-01-01

Non-instrumented capsule was designed to irradiate the large grain UO 2 pellet developed for the high burn-up LWR fuel in the HANARO in-pile capsule. UO 2 pelletes will be irradiated up to the burn-up higher than 70 MWD/kgU in HANARO. To irradiate the UO 2 pellets up to the burn-up 70 MWD/kgU, need the time about 60 months and ensure the integrity of non-instrumented capsule for 30 months until replace the new capsule. In addition, to satisfy the safety criteria of HANARO such as prevention of ONB(Onset of Nucleate Boiling), fuel melting and wear damage of the capsule during the long term irradiation, design of the non-instrumented capsule was optimized

2. Two experimental tests of relational models of procedural justice: non-instrumental voice and authority group membership.

Science.gov (United States)

Platow, Michael J; Eggins, Rachael A; Chattopadhyay, Rachana; Brewer, Greg; Hardwick, Lisa; Milsom, Laurin; Brocklebank, Jacinta; Lalor, Thérèse; Martin, Rowena; Quee, Michelle; Vassallo, Sara; Welsh, Jenny

2013-06-01

In both a laboratory experiment (in Australia) using university as the basis of group membership, and a scenario experiment (in India) using religion as the basis of group membership, we observe more favourable respect and fairness ratings in response to an in-group authority than an out-group authority who administers non-instrumental voice. Moreover, we observe in our second experiment that reported likelihood of protest (herein called "social-change voice") was relatively high following non-instrumental voice from an out-group authority, but relatively low following non-instrumental voice from an in-group authority. Our findings are consistent with relational models of procedural justice, and extend the work by examining likely use of alternative forms of voice as well as highlighting the relative importance of instrumentality. ©2012 The British Psychological Society.

3. Development of Temperature Control Solutions for Non-Instrumented Nucleic Acid Amplification Tests (NINAAT

Directory of Open Access Journals (Sweden)

Tamás Pardy

2017-06-01

Full Text Available Non-instrumented nucleic acid amplification tests (NINAAT are a novel paradigm in portable molecular diagnostics. They offer the high detection accuracy characteristic of nucleic acid amplification tests (NAAT in a self-contained device, without the need for any external instrumentation. These Point-of-Care tests typically employ a Lab-on-a-Chip for liquid handling functionality, and perform isothermal nucleic acid amplification protocols that require low power but high accuracy temperature control in a single well-defined temperature range. We propose temperature control solutions based on commercially available heating elements capable of meeting these challenges, as well as demonstrate the process by which such elements can be fitted to a NINAAT system. Self-regulated and thermostat-controlled resistive heating elements were evaluated through experimental characterization as well as thermal analysis using the finite element method (FEM. We demonstrate that the proposed solutions can support various NAAT protocols, as well as demonstrate an optimal solution for the loop-mediated isothermal amplification (LAMP protocol. Furthermore, we present an Arduino-compatible open-source thermostat developed for NINAAT applications.

4. Decomposability and convex structure of thermal processes

Science.gov (United States)

Mazurek, Paweł; Horodecki, Michał

2018-05-01

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

5. Designing Camera Networks by Convex Quadratic Programming

KAUST Repository

Ghanem, Bernard

2015-05-04

​In this paper, we study the problem of automatic camera placement for computer graphics and computer vision applications. We extend the problem formulations of previous work by proposing a novel way to incorporate visibility constraints and camera-to-camera relationships. For example, the placement solution can be encouraged to have cameras that image the same important locations from different viewing directions, which can enable reconstruction and surveillance tasks to perform better. We show that the general camera placement problem can be formulated mathematically as a convex binary quadratic program (BQP) under linear constraints. Moreover, we propose an optimization strategy with a favorable trade-off between speed and solution quality. Our solution is almost as fast as a greedy treatment of the problem, but the quality is significantly higher, so much so that it is comparable to exact solutions that take orders of magnitude more computation time. Because it is computationally attractive, our method also allows users to explore the space of solutions for variations in input parameters. To evaluate its effectiveness, we show a range of 3D results on real-world floorplans (garage, hotel, mall, and airport). ​

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

7. The Thermal-hydraulic Performance Test Report for the Non-instrumented Irradiation Test Rig of Annular Fuel

Energy Technology Data Exchange (ETDEWEB)

Kim, Dae Ho; Lee, Kang Hee; Shin, Chang Hwan

2008-09-15

This report presents the results of pressure drop test, vibration test and endurance test for the non-instrumented rig using the irradiation test in HANARO of the double cooled annular fuel which were designed and fabricated by KAERI. From the out-pile thermal hydraulic tests, corresponding to the pressure drop of 200 kPa is measured to be about 9.72 kg/sec. Vibration frequency for the non-instrumented rig ranges from 5.0 to 10.7 kg/s. RMS(Root Mean Square) displacement for non-instrumented rig is less than 11.73 m, and the maximum displacement is less than 54.87m. The flow rate for endurance test were 10.5 kg/s, which was 110% of 9.72 kg/s. And the endurance test was carried out for 3 days. The test results found not to the wear and satisfied to the limits of pressure drop, flow rate, vibration and wear in the non-instrumented rig. This test was performed at the FIVPET facility.

8. Out-pile test of non-instrumented capsule for the advanced PWR fuel pellets in HANARO irradiation test

Energy Technology Data Exchange (ETDEWEB)

Kim, D. H.; Lee, C. B.; Oh, D. S.; Bang, J. K.; Kim, Y. M.; Yang, Y. S.; Jeong, Y. H.; Jeon, H. K.; Ryu, J. S. [KAERI, Taejon (Korea, Republic of)

2002-05-01

Non-instrumental capsule were designed and fabricated to irradiate the advanced pellet developed for the high burn-up LWR fuel in the HANARO in-pile capsule. This capsule was out-pie tested at Cold Test Loop-I in KAERI. From the pressure drop test results, it is noted that the flow velocity across the non-instrumented capsule of advanced PWR fuel pellet corresponding to the pressure drop of 200 kPa is measured to be about 7.45 kg/sec. Vibration frequency for the capsule ranges from 13.0 to 32.3 Hz. RMS displacement for non-instrumented capsule of advanced PWR fuel pellet is less than 11.6 {mu}m, and the maximum displacement is less that 30.5 {mu}m. The flow rate for endurance test were 8.19 kg/s, which was 110% of 7.45 kg/s. And the endurance test was carried out for 100 days and 17 hours. The test results found not to the wear satisfied to the limits of pressure drop, flow rate, vibration and wear in the non-instrumented capsule.

9. A survey on locally uniformly A-convex algebras

International Nuclear Information System (INIS)

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)

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

11. A note on supercyclic operators in locally convex spaces

OpenAIRE

Albanese, Angela A.; Jornet, David

2018-01-01

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

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

13. Entropy and convexity for nonlinear partial differential equations.

Science.gov (United States)

Ball, John M; Chen, Gui-Qiang G

2013-12-28

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

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

KAUST Repository

Seneci, Tommaso

2018-05-01

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

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

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

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

18. Two examples of non strictly convex large deviations

OpenAIRE

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

2016-01-01

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

19. Fusion energy

International Nuclear Information System (INIS)

Gross, R.A.

1984-01-01

This textbook covers the physics and technology upon which future fusion power reactors will be based. It reviews the history of fusion, reaction physics, plasma physics, heating, and confinement. Descriptions of commercial plants and design concepts are included. Topics covered include: fusion reactions and fuel resources; reaction rates; ignition, and confinement; basic plasma directory; Tokamak confinement physics; fusion technology; STARFIRE: A commercial Tokamak fusion power plant. MARS: A tandem-mirror fusion power plant; and other fusion reactor concepts

20. A standardized non-instrumental tool for characterizing workstations concerned with exposure to engineered nanomaterials

Science.gov (United States)

Canu I, Guseva; C, Ducros; S, Ducamp; L, Delabre; S, Audignon-Durand; C, Durand; Y, Iwatsubo; D, Jezewski-Serra; Bihan O, Le; S, Malard; A, Radauceanu; M, Reynier; M, Ricaud; O, Witschger

2015-05-01

The French national epidemiological surveillance program EpiNano aims at surveying mid- and long-term health effects possibly related with occupational exposure to either carbon nanotubes or titanium dioxide nanoparticles (TiO2). EpiNano is limited to workers potentially exposed to these nanomaterials including their aggregates and agglomerates. In order to identify those workers during the in-field industrial hygiene visits, a standardized non-instrumental method is necessary especially for epidemiologists and occupational physicians unfamiliar with nanoparticle and nanomaterial exposure metrology. A working group, Quintet ExpoNano, including national experts in nanomaterial metrology and occupational hygiene reviewed available methods, resources and their practice in order to develop a standardized tool for conducting company industrial hygiene visits and collecting necessary information. This tool, entitled “Onsite technical logbook”, includes 3 parts: company, workplace, and workstation allowing a detailed description of each task, process and exposure surrounding conditions. This logbook is intended to be completed during the company industrial hygiene visit. Each visit is conducted jointly by an industrial hygienist and an epidemiologist of the program and lasts one or two days depending on the company size. When all collected information is computerized using friendly-using software, it is possible to classify workstations with respect to their potential direct and/or indirect exposure. Workers appointed to workstations classified as concerned with exposure are considered as eligible for EpiNano program and invited to participate. Since January 2014, the Onsite technical logbook has been used in ten company visits. The companies visited were mostly involved in research and development. A total of 53 workstations with potential exposure to nanomaterials were pre-selected and observed: 5 with TiO2, 16 with single-walled carbon nanotubes, 27 multiwalled

1. A standardized non-instrumental tool for characterizing workstations concerned with exposure to engineered nanomaterials

International Nuclear Information System (INIS)

I, Guseva Canu; S, Ducamp; L, Delabre; Y, Iwatsubo; D, Jezewski-Serra; C, Ducros; S, Audignon-Durand; C, Durand; O, Le Bihan; S, Malard; A, Radauceanu; M, Reynier; M, Ricaud; O, Witschger

2015-01-01

The French national epidemiological surveillance program EpiNano aims at surveying mid- and long-term health effects possibly related with occupational exposure to either carbon nanotubes or titanium dioxide nanoparticles (TiO 2 ). EpiNano is limited to workers potentially exposed to these nanomaterials including their aggregates and agglomerates. In order to identify those workers during the in-field industrial hygiene visits, a standardized non-instrumental method is necessary especially for epidemiologists and occupational physicians unfamiliar with nanoparticle and nanomaterial exposure metrology. A working group, Quintet ExpoNano, including national experts in nanomaterial metrology and occupational hygiene reviewed available methods, resources and their practice in order to develop a standardized tool for conducting company industrial hygiene visits and collecting necessary information. This tool, entitled “Onsite technical logbook”, includes 3 parts: company, workplace, and workstation allowing a detailed description of each task, process and exposure surrounding conditions. This logbook is intended to be completed during the company industrial hygiene visit. Each visit is conducted jointly by an industrial hygienist and an epidemiologist of the program and lasts one or two days depending on the company size. When all collected information is computerized using friendly-using software, it is possible to classify workstations with respect to their potential direct and/or indirect exposure. Workers appointed to workstations classified as concerned with exposure are considered as eligible for EpiNano program and invited to participate. Since January 2014, the Onsite technical logbook has been used in ten company visits. The companies visited were mostly involved in research and development. A total of 53 workstations with potential exposure to nanomaterials were pre-selected and observed: 5 with TiO 2 , 16 with single-walled carbon nanotubes, 27 multiwalled

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

NARCIS (Netherlands)

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

2007-01-01

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

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

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

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

Science.gov (United States)

Peterson, Mary A; Salvagio, Elizabeth

2008-12-15

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

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

7. Convexity and concavity constants in Lorentz and Marcinkiewicz spaces

Science.gov (United States)

Kaminska, Anna; Parrish, Anca M.

2008-07-01

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

8. Transient disturbance growth in flows over convex surfaces

Science.gov (United States)

Karp, Michael; Hack, M. J. Philipp

2017-11-01

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

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

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

11. Closedness type regularity conditions in convex optimization and beyond

Directory of Open Access Journals (Sweden)

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.

12. Distribution functions of sections and projections of convex bodies

OpenAIRE

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

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

Science.gov (United States)

Rand, Alexander; Gillette, Andrew; Bajaj, Chandrajit

2013-08-01

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

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

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

KAUST Repository

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

2018-01-01

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

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

KAUST Repository

Gomes, Diogo A.

2018-01-26

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

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

Directory of Open Access Journals (Sweden)

2006-01-01

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

18. EMP Fusion

OpenAIRE

KUNTAY, Isık

2010-01-01

This paper introduces a novel fusion scheme, called EMP Fusion, which has the promise of achieving breakeven and realizing commercial fusion power. The method is based on harnessing the power of an electromagnetic pulse generated by the now well-developed flux compression technology. The electromagnetic pulse acts as a means of both heating up the plasma and confining the plasma, eliminating intermediate steps. The EMP Fusion device is simpler compared to other fusion devices and this reduces...

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

Science.gov (United States)

Lakhtakia, Akhlesh

1993-11-01

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

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

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

NARCIS (Netherlands)

Musegaas, Marieke; Borm, Peter; Quant, Marieke

2016-01-01

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

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

Science.gov (United States)

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

2016-01-01

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

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

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

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

6. A duality recipe for non-convex variational problems

Science.gov (United States)

Bouchitté, Guy; Phan, Minh

2018-03-01

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

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

NARCIS (Netherlands)

Driessen, Theo; Hou, D.

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

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

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

NARCIS (Netherlands)

Koren, B.; Bannink, W.J.

1984-01-01

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

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

NARCIS (Netherlands)

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

2015-01-01

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

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

Science.gov (United States)

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

2012-05-08

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

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

13. Osteoclast Fusion

DEFF Research Database (Denmark)

Marie Julie Møller, Anaïs; Delaissé, Jean-Marie; Søe, Kent

2017-01-01

on the nuclearity of fusion partners. While CD47 promotes cell fusions involving mono-nucleated pre-osteoclasts, syncytin-1 promotes fusion of two multi-nucleated osteoclasts, but also reduces the number of fusions between mono-nucleated pre-osteoclasts. Furthermore, CD47 seems to mediate fusion mostly through...... individual fusion events using time-lapse and antagonists of CD47 and syncytin-1. All time-lapse recordings have been studied by two independent observers. A total of 1808 fusion events were analyzed. The present study shows that CD47 and syncytin-1 have different roles in osteoclast fusion depending...... broad contact surfaces between the partners' cell membrane while syncytin-1 mediate fusion through phagocytic-cup like structure. J. Cell. Physiol. 9999: 1-8, 2016. © 2016 Wiley Periodicals, Inc....

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

15. Fusion power

International Nuclear Information System (INIS)

Hancox, R.

1981-01-01

The principles of fusion power, and its advantages and disadvantages, are outlined. Present research programmes and future plans directed towards the development of a fusion power reactor, are summarized. (U.K.)

16. Fusion rings and fusion ideals

DEFF Research Database (Denmark)

Andersen, Troels Bak

by the so-called fusion ideals. The fusion rings of Wess-Zumino-Witten models have been widely studied and are well understood in terms of precise combinatorial descriptions and explicit generating sets of the fusion ideals. They also appear in another, more general, setting via tilting modules for quantum......This dissertation investigates fusion rings, which are Grothendieck groups of rigid, monoidal, semisimple, abelian categories. Special interest is in rational fusion rings, i.e., fusion rings which admit a finite basis, for as commutative rings they may be presented as quotients of polynomial rings...

17. Fusion: introduction

International Nuclear Information System (INIS)

Decreton, M.

2006-01-01

The article gives an overview and introduction to the activities of SCK-CEN's research programme on fusion. The decision to construct the ITER international nuclear fusion experiment in Cadarache is highlighted. A summary of the Belgian contributions to fusion research is given with particular emphasis on studies of radiation effects on diagnostics systems, radiation effects on remote handling sensing systems, fusion waste management and socio-economic studies

18. Membrane fusion

DEFF Research Database (Denmark)

Bendix, Pól Martin

2015-01-01

At Stanford University, Boxer lab, I worked on membrane fusion of small unilamellar lipid vesicles to flat membranes tethered to glass surfaces. This geometry closely resembles biological systems in which liposomes fuse to plasma membranes. The fusion mechanism was studied using DNA zippering...... between complementary strands linked to the two apposing membranes closely mimicking the zippering mechanism of SNARE fusion complexes....

International Nuclear Information System (INIS)

1987-07-01

This first issue of a quarterly newsletter announces the startup of the Tokamak de Varennes, describes Canada's national fusion program, and outlines the Canadian Fusion Fuels Technology Program. A map gives the location of the eleven principal fusion centres in Canada. (L.L.)

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

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

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

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

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

CERN Document Server

Bildhauer, Michael

2003-01-01

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

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

6. Constrained convex minimization via model-based excessive gap

OpenAIRE

Tran Dinh, Quoc; Cevher, Volkan

2014-01-01

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

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

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

9. Some fixed point theorems on non-convex sets

Directory of Open Access Journals (Sweden)

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

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

11. Convex Clustering: An Attractive Alternative to Hierarchical Clustering

Science.gov (United States)

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

2015-01-01

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

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

KAUST Repository

Li, Yiteng

2017-04-09

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

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

Directory of Open Access Journals (Sweden)

2014-12-01

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

14. Measures of symmetry for convex sets and stability

CERN Document Server

Toth, Gabor

2015-01-01

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

15. Measurement system for diffraction efficiency of convex gratings

Science.gov (United States)

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

2017-08-01

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

16. Fusion neutronics

CERN Document Server

Wu, Yican

2017-01-01

This book provides a systematic and comprehensive introduction to fusion neutronics, covering all key topics from the fundamental theories and methodologies, as well as a wide range of fusion system designs and experiments. It is the first-ever book focusing on the subject of fusion neutronics research. Compared with other nuclear devices such as fission reactors and accelerators, fusion systems are normally characterized by their complex geometry and nuclear physics, which entail new challenges for neutronics such as complicated modeling, deep penetration, low simulation efficiency, multi-physics coupling, etc. The book focuses on the neutronics characteristics of fusion systems and introduces a series of theories and methodologies that were developed to address the challenges of fusion neutronics, and which have since been widely applied all over the world. Further, it introduces readers to neutronics design’s unique principles and procedures, experimental methodologies and technologies for fusion systems...

17. Fusion Physics

Energy Technology Data Exchange (ETDEWEB)

Kikuchi, Mitsuru; Lackner, Karl; Tran, Minh Quang [eds.

2012-09-15

Recreating the energy production process of the Sun - nuclear fusion - on Earth in a controlled fashion is one of the greatest challenges of this century. If achieved at affordable costs, energy supply security would be greatly enhanced and environmental degradation from fossil fuels greatly diminished. Fusion Physics describes the last fifty years or so of physics and research in innovative technologies to achieve controlled thermonuclear fusion for energy production. The International Atomic Energy Agency (IAEA) has been involved since its establishment in 1957 in fusion research. It has been the driving force behind the biennial conferences on Plasma Physics and Controlled Thermonuclear Fusion, today known as the Fusion Energy Conference. Hosted by several Member States, this biennial conference provides a global forum for exchange of the latest achievements in fusion research against the backdrop of the requirements for a net energy producing fusion device and, eventually, a fusion power plant. The scientific and technological knowledge compiled during this series of conferences, as well as by the IAEA Nuclear Fusion journal, is immense and will surely continue to grow in the future. It has led to the establishment of the International Thermonuclear Experimental Reactor (ITER), which represents the biggest experiment in energy production ever envisaged by humankind.

18. Fusion breeder

International Nuclear Information System (INIS)

Moir, R.W.

1982-01-01

The fusion breeder is a fusion reactor designed with special blankets to maximize the transmutation by 14 MeV neutrons of uranium-238 to plutonium or thorium to uranium-233 for use as a fuel for fission reactors. Breeding fissile fuels has not been a goal of the US fusion energy program. This paper suggests it is time for a policy change to make the fusion breeder a goal of the US fusion program and the US nuclear energy program. The purpose of this paper is to suggest this policy change be made and tell why it should be made, and to outline specific research and development goals so that the fusion breeder will be developed in time to meet fissile fuel needs

19. Fusion Implementation

International Nuclear Information System (INIS)

Schmidt, J.A.

2002-01-01

If a fusion DEMO reactor can be brought into operation during the first half of this century, fusion power production can have a significant impact on carbon dioxide production during the latter half of the century. An assessment of fusion implementation scenarios shows that the resource demands and waste production associated with these scenarios are manageable factors. If fusion is implemented during the latter half of this century it will be one element of a portfolio of (hopefully) carbon dioxide limiting sources of electrical power. It is time to assess the regional implications of fusion power implementation. An important attribute of fusion power is the wide range of possible regions of the country, or countries in the world, where power plants can be located. Unlike most renewable energy options, fusion energy will function within a local distribution system and not require costly, and difficult, long distance transmission systems. For example, the East Coast of the United States is a prime candidate for fusion power deployment by virtue of its distance from renewable energy sources. As fossil fuels become less and less available as an energy option, the transmission of energy across bodies of water will become very expensive. On a global scale, fusion power will be particularly attractive for regions separated from sources of renewable energy by oceans

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

Science.gov (United States)

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

1999-01-01

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

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

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

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

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

5. Gröbner bases and convex polytopes

CERN Document Server

Sturmfels, Bernd

1995-01-01

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

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

7. Enhancement of numeric cognition in children with low achievement in mathematic after a non-instrumental musical training.

Science.gov (United States)

Ribeiro, Fabiana Silva; Santos, Flávia H

2017-03-01

Studies suggest that musical training enhances spatial-temporal reasoning and leads to greater learning of mathematical concepts. The aim of this prospective study was to verify the efficacy of a Non-Instrumental Musical Training (NIMT) on the Numerical Cognition systems in children with low achievement in math. For this purpose, we examined, with a cluster analysis, whether children with low scores on Numerical Cognition would be grouped in the same cluster at pre and post-NIMT. Participants were primary school children divided into two groups according to their scores on an Arithmetic test. Results with a specialized battery of Numerical Cognition revealed improvements for Cluster 2 (children with low achievement in math) especially for number production capacity compared to normative data. Besides, the number of children with low scores in Numerical Cognition decreased at post-NIMT. These findings suggest that NIMT enhances Numerical Cognition and seems to be a useful tool for rehabilitation of children with low achievement in math. Copyright © 2016 Elsevier Ltd. All rights reserved.

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

Science.gov (United States)

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

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

9. Thermonuclear fusion

International Nuclear Information System (INIS)

Weisse, J.

2000-01-01

This document takes stock of the two ways of thermonuclear fusion research explored today: magnetic confinement fusion and inertial confinement fusion. The basic physical principles are recalled first: fundamental nuclear reactions, high temperatures, elementary properties of plasmas, ignition criterion, magnetic confinement (charged particle in a uniform magnetic field, confinement and Tokamak principle, heating of magnetized plasmas (ohmic, neutral particles, high frequency waves, other heating means), results obtained so far (scale laws and extrapolation of performances, tritium experiments, ITER project), inertial fusion (hot spot ignition, instabilities, results (Centurion-Halite program, laser experiments). The second part presents the fusion reactor and its associated technologies: principle (tritium production, heat source, neutron protection, tritium generation, materials), magnetic fusion (superconducting magnets, divertor (role, principle, realization), inertial fusion (energy vector, laser adaptation, particle beams, reaction chamber, stresses, chamber concepts (dry and wet walls, liquid walls), targets (fabrication, injection and pointing)). The third chapter concerns the socio-economic aspects of thermonuclear fusion: safety (normal operation and accidents, wastes), costs (costs structure and elementary comparison, ecological impact and external costs). (J.S.)

10. Fusion devices

International Nuclear Information System (INIS)

Fowler, T.K.

1977-01-01

Three types of thermonuclear fusion devices currently under development are reviewed for an electric utilities management audience. Overall design features of laser fusion, tokamak, and magnetic mirror type reactors are described and illustrated. Thrusts and trends in current research on these devices that promise to improve performance are briefly reviewed. Twenty photographs and drawings are included

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

OpenAIRE

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

2012-01-01

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

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

13. A New Interpolation Approach for Linearly Constrained Convex Optimization

KAUST Repository

Espinoza, Francisco

2012-08-01

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

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

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

Science.gov (United States)

Briec, Walter; Horvath, Charles

2008-05-01

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

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

International Nuclear Information System (INIS)

Grasmair, Markus

2010-01-01

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

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

Science.gov (United States)

Bertamini, Marco; Wagemans, Johan

2013-04-01

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

18. First-order Convex Optimization Methods for Signal and Image Processing

DEFF Research Database (Denmark)

Jensen, Tobias Lindstrøm

2012-01-01

In this thesis we investigate the use of first-order convex optimization methods applied to problems in signal and image processing. First we make a general introduction to convex optimization, first-order methods and their iteration complexity. Then we look at different techniques, which can...... be used with first-order methods such as smoothing, Lagrange multipliers and proximal gradient methods. We continue by presenting different applications of convex optimization and notable convex formulations with an emphasis on inverse problems and sparse signal processing. We also describe the multiple...

19. Oral Storytelling, Speaking and Listening and the Hegemony of Literacy: Non-Instrumental Language Use and Transactional Talk in the Primary Classroom

Science.gov (United States)

Hibbin, Rebecca

2016-01-01

The oral re-telling of traditional tales, modelled by a storyteller and taught to children in school, can be understood as "non-instrumental" practice in speaking and listening that emphasises oral language over the reading and writing of stories. While oral storytelling has significant benefits to children's education and development,…

20. Atomic fusion, Gerrard atomic fusion

International Nuclear Information System (INIS)

Gerrard, T.H.

1980-01-01

In the approach to atomic fusion described here the heat produced in a fusion reaction, which is induced in a chamber by the interaction of laser beams and U.H.F. electromagnetic beams with atom streams, is transferred to a heat exchanger for electricity generation by a coolant flowing through a jacket surrounding the chamber. (U.K.)

1. Peaceful fusion

Energy Technology Data Exchange (ETDEWEB)

Englert, Matthias [IANUS, TU Darmstadt (Germany)

2014-07-01

Like other intense neutron sources fusion reactors have in principle a potential to be used for military purposes. Although the use of fissile material is usually not considered when thinking of fusion reactors (except in fusion-fission hybrid concepts) quantitative estimates about the possible production potential of future commercial fusion reactor concepts show that significant amounts of weapon grade fissile materials could be produced even with very limited amounts of source materials. In this talk detailed burnup calculations with VESTA and MCMATH using an MCNP model of the PPCS-A will be presented. We compare different irradiation positions and the isotopic vectors of the plutonium bred in different blankets of the reactor wall with the liquid lead-lithium alloy replaced by uranium. The technical, regulatory and policy challenges to manage the proliferation risks of fusion power will be addressed as well. Some of these challenges would benefit if addressed at an early stage of the research and development process. Hence, research on fusion reactor safeguards should start as early as possible and accompany the current research on experimental fusion reactors.

2. Chance-Constrained Guidance With Non-Convex Constraints

Science.gov (United States)

Ono, Masahiro

2011-01-01

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

3. Cold fusion

International Nuclear Information System (INIS)

Suh, Suk Yong; Sung, Ki Woong; Kang, Joo Sang; Lee, Jong Jik

1995-02-01

So called 'cold fusion phenomena' are not confirmed yet. Excess heat generation is very delicate one. Neutron generation is most reliable results, however, the records are erratic and the same results could not be repeated. So there is no reason to exclude the malfunction of testing instruments. The same arguments arise in recording 4 He, 3 He, 3 H, which are not rich in quantity basically. An experiment where plenty of 4 He were recorded is attached in appendix. The problem is that we are trying to search cold fusion which is permitted by nature or not. The famous tunneling effect in quantum mechanics will answer it, however, the most fusion rate is known to be negligible. The focus of this project is on the theme that how to increase that negligible fusion rate. 6 figs, 4 tabs, 1512 refs. (Author)

4. Cold fusion

Energy Technology Data Exchange (ETDEWEB)

Suh, Suk Yong; Sung, Ki Woong; Kang, Joo Sang; Lee, Jong Jik [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)

1995-02-01

So called cold fusion phenomena are not confirmed yet. Excess heat generation is very delicate one. Neutron generation is most reliable results, however, the records are erratic and the same results could not be repeated. So there is no reason to exclude the malfunction of testing instruments. The same arguments arise in recording {sup 4}He, {sup 3}He, {sup 3}H, which are not rich in quantity basically. An experiment where plenty of {sup 4}He were recorded is attached in appendix. The problem is that we are trying to search cold fusion which is permitted by nature or not. The famous tunneling effect in quantum mechanics will answer it, however, the most fusion rate is known to be negligible. The focus of this project is on the theme that how to increase that negligible fusion rate. 6 figs, 4 tabs, 1512 refs. (Author).

5. Laser fusion

International Nuclear Information System (INIS)

Ashby, D.E.T.F.

1976-01-01

A short survey is given on laser fusion its basic concepts and problems and the present theoretical and experimental methods. The future research program of the USA in this field is outlined. (WBU) [de

6. Fusion energy

International Nuclear Information System (INIS)

Anon.

1979-01-01

The efforts of the Chemical Technology Division in fusion energy include the areas of fuel handling, processing, and containment. Current studies are concerned largely with the development of vacuum pumps for fusion reactors and experiments and with development and evaluation of techniques for recovering tritium from solid or liquid breeding blankets. In addition, a small effort is devoted to support of the ORNL design of a major Tokamak experiment, The Next Step (TNS)

7. Laser fusion

International Nuclear Information System (INIS)

Key, M.H.; Oxford Univ.

1990-04-01

The use of lasers to drive implosions for the purpose of inertially confined fusion is an area of intense activity where progress compares favourably with that made in magnetic fusion and there are significant prospects for future development. In this brief review the basic concept is summarised and the current status is outlined both in the area of laser technology and in the most recent results from implosion experiments. Prospects for the future are also considered. (author)

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

9. Nonparametric instrumental regression with non-convex constraints

Science.gov (United States)

Grasmair, M.; Scherzer, O.; Vanhems, A.

2013-03-01

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

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

11. Convex analysis and monotone operator theory in Hilbert spaces

CERN Document Server

Bauschke, Heinz H

2017-01-01

This reference text, now in its second edition, offers a modern unifying presentation of three basic areas of nonlinear analysis: convex analysis, monotone operator theory, and the fixed point theory of nonexpansive operators. Taking a unique comprehensive approach, the theory is developed from the ground up, with the rich connections and interactions between the areas as the central focus, and it is illustrated by a large number of examples. The Hilbert space setting of the material offers a wide range of applications while avoiding the technical difficulties of general Banach spaces. The authors have also drawn upon recent advances and modern tools to simplify the proofs of key results making the book more accessible to a broader range of scholars and users. Combining a strong emphasis on applications with exceptionally lucid writing and an abundance of exercises, this text is of great value to a large audience including pure and applied mathematicians as well as researchers in engineering, data science, ma...

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

KAUST Repository

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

2012-01-01

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

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

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

15. Convex Relaxations for a Generalized Chan-Vese Model

KAUST Repository

Bae, Egil

2013-01-01

We revisit the Chan-Vese model of image segmentation with a focus on the encoding with several integer-valued labeling functions. We relate several representations with varying amount of complexity and demonstrate the connection to recent relaxations for product sets and to dual maxflow-based formulations. For some special cases, it can be shown that it is possible to guarantee binary minimizers. While this is not true in general, we show how to derive a convex approximation of the combinatorial problem for more than 4 phases. We also provide a method to avoid overcounting of boundaries in the original Chan-Vese model without departing from the efficient product-set representation. Finally, we derive an algorithm to solve the associated discretized problem, and demonstrate that it allows to obtain good approximations for the segmentation problem with various number of regions. © 2013 Springer-Verlag.

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

Science.gov (United States)

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

2014-03-01

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

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

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

Science.gov (United States)

Zhou, Hua; Lange, Kenneth

2015-07-01

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

19. Nuclear fusion

International Nuclear Information System (INIS)

Al-zaelic, M.M.

2013-01-01

Nuclear fusion can be relied on to solve the global energy crisis if the process of limiting the heat produced by the fusion reaction (Plasma) is successful. Currently scientists are progressively working on this aspect whereas there are two methods to limit the heat produced by fusion reaction, the two methods are auto-restriction using laser beam and magnetic restriction through the use of magnetic fields and research is carried out to improve these two methods. It is expected that at the end of this century the nuclear fusion energy will play a vital role in overcoming the global energy crisis and for these reasons, acquiring energy through the use of nuclear fusion reactors is one of the most urge nt demands of all mankind at this time. The conclusion given is that the source of fuel for energy production is readily available and inexpensive ( hydrogen atoms) and whole process is free of risks and hazards, especially to general health and the environment . Nuclear fusion importance lies in the fact that energy produced by the process is estimated to be about four to five times the energy produced by nuclear fission. (author)

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

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

NARCIS (Netherlands)

Guo, Peng; Cao, Jiannong; Zhang, Kui

2015-01-01

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

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

NARCIS (Netherlands)

de Klerk, E.; Laurent, M.

2011-01-01

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

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

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

NARCIS (Netherlands)

Fourie, Zacharias; Ozcan, Mutlu; Sandham, John

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

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

NARCIS (Netherlands)

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

2001-01-01

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

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

Science.gov (United States)

Zhang, Yongjun; Lu, Zhixin

2017-10-01

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

7. Cold fusion

International Nuclear Information System (INIS)

Koster, J.

1989-01-01

In this contribution the author the phenomenom of so-called cold fusion, inspired by the memorable lecture of Moshe Gai on his own search for this effect. Thus much of what follows was presented by Dr. Gai; the rest is from independent reading. What is referred to as cold fusion is of course the observation of possible products of deuteron-deuteron (d-d) fusion within deuterium-loaded (dentended) electrodes. The debate over the two vanguard cold fusion experiments has raged under far more public attention than usually accorded new scientific phenomena. The clamor commenced with the press conference of M. Fleishmann and S. Pons on March 23, 1989 and the nearly simultaneous wide circulation of a preprint of S. Jones and collaborators. The majority of work attempting to confirm these observations has at the time of this writing yet to appear in published form, but contributions to conferences and electronic mail over computer networks were certainly filled with preliminary results. To keep what follows to a reasonable length the author limit this discussion to the searches for neutron (suggested by ref. 2) or for excessive heat production (suggested by ref. 1), following a synopsis of the hypotheses of cold fusion

8. Fusion events

International Nuclear Information System (INIS)

Aboufirassi, M; Angelique, J.C.; Bizard, G.; Bougault, R.; Brou, R.; Buta, A.; Colin, J.; Cussol, D.; Durand, D.; Genoux-Lubain, A.; Horn, D.; Kerambrun, A.; Laville, J.L.; Le Brun, C.; Lecolley, J.F.; Lefebvres, F.; Lopez, O.; Louvel, M.; Meslin, C.; Metivier, V.; Nakagawa, T.; Peter, J.; Popescu, R.; Regimbart, R.; Steckmeyer, J.C.; Tamain, B.; Vient, E.; Wieloch, A.; Yuasa-Nakagawa, K.

1998-01-01

The fusion reactions between low energy heavy ions have a very high cross section. First measurements at energies around 30-40 MeV/nucleon indicated no residue of either complete or incomplete fusion, thus demonstrating the disappearance of this process. This is explained as being due to the high amount o energies transferred to the nucleus, what leads to its total dislocation in light fragments and particles. Exclusive analyses have permitted to mark clearly the presence of fusion processes in heavy systems at energies above 30-40 MeV/nucleon. Among the complete events of the Kr + Au reaction at 60 MeV/nucleon the majority correspond to binary collisions. Nevertheless, for the most considerable energy losses, a class of events do occur for which the detected fragments appears to be emitted from a unique source. These events correspond to an incomplete projectile-target fusion followed by a multifragmentation. Such events were singled out also in the reaction Xe + Sn at 50 MeV/nucleon. For the events in which the energy dissipation was maximal it was possible to isolate an isotropic group of events showing all the characteristics of fusion nuclei. The fusion is said to be incomplete as pre-equilibrium Z = 1 and Z = 2 particles are emitted. The cross section is of the order of 25 mb. Similar conclusions were drown for the systems 36 Ar + 27 Al and 64 Zn + nat Ti. A cross section value of ∼ 20 mb was determined at 55 MeV/nucleon in the first case, while the measurement of evaporation light residues in the last system gave an upper limit of 20-30 mb for the cross section at 50 MeV/nucleon

9. Precision platform for convex lens-induced confinement microscopy

Science.gov (United States)

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.

10. Neural network for nonsmooth pseudoconvex optimization with general convex constraints.

Science.gov (United States)

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.

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

Science.gov (United States)

Faried, Nashat; Morsy, Ahmed; Hussein, Aya M

2018-01-01

In 1960, Dvoretzky proved that in any infinite dimensional Banach space X and for any [Formula: see text] there exists a subspace L of X of arbitrary large dimension ϵ -iometric to Euclidean space. A main tool in proving this deep result was some results concerning asphericity of convex bodies. In this work, we introduce a simple technique and rigorous formulas to facilitate calculating the asphericity for each set that has a nonempty boundary set with respect to the flat space generated by it. We also give a formula to determine the center and the radius of the smallest ball containing a nonempty nonsingleton set K in a linear normed space, and the center and the radius of the largest ball contained in it provided that K has a nonempty boundary set with respect to the flat space generated by it. As an application we give lower and upper estimations for the asphericity of infinite and finite cross products of these sets in certain spaces, respectively.

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

Science.gov (United States)

Atzori, Luigi; Ginesu, Giaime; Raccis, Alessio

2005-04-01

Transmission errors in JPEG2000 can be grouped into three main classes, depending on the affected area: LL, high frequencies at the lower decomposition levels, and high frequencies at the higher decomposition levels. The first type of errors are the most annoying but can be concealed exploiting the signal spatial correlation like in a number of techniques proposed in the past; the second are less annoying but more difficult to address; the latter are often imperceptible. In this paper, we address the problem of concealing the second class or errors when high bit-planes are damaged by proposing a new approach based on the theory of projections onto convex sets. Accordingly, the error effects are masked by iteratively applying two procedures: low-pass (LP) filtering in the spatial domain and restoration of the uncorrupted wavelet coefficients in the transform domain. It has been observed that a uniform LP filtering brought to some undesired side effects that negatively compensated the advantages. This problem has been overcome by applying an adaptive solution, which exploits an edge map to choose the optimal filter mask size. Simulation results demonstrated the efficiency of the proposed approach.

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

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

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

Science.gov (United States)

Qin, Sitian; Feng, Jiqiang; Song, Jiahui; Wen, Xingnan; Xu, Chen

2018-03-01

In this paper, based on calculus and penalty method, a one-layer recurrent neural network is proposed for solving constrained complex-variable convex optimization. It is proved that for any initial point from a given domain, the state of the proposed neural network reaches the feasible region in finite time and converges to an optimal solution of the constrained complex-variable convex optimization finally. In contrast to existing neural networks for complex-variable convex optimization, the proposed neural network has a lower model complexity and better convergence. Some numerical examples and application are presented to substantiate the effectiveness of the proposed neural network.

16. Nuclear fusion

International Nuclear Information System (INIS)

Huber, H.

1978-01-01

A comprehensive survey is presented of the present state of knowledge in nuclear fusion research. In the first part, potential thermonuclear reactions, basic energy balances of the plasma (Lawson criterion), and the main criteria to be observed in the selection of appropriate thermonuclear reactions are dealt with. This is followed by a discussion of the problems encountered in plasma physics (plasma confinement and heating, transport processes, plasma impurities, plasma instabilities and plasma diagnostics) and by a consideration of the materials problems involved, such as material of the first wall, fuel inlet and outlet, magnetic field generation, as well as repair work and in-service inspections. Two main methods have been developed to tackle these problems: reactor concepts using the magnetic pinch (stellarator, Tokamak, High-Beta reactors, mirror machines) on the one hand, and the other concept using the inertial confinement (laser fusion reactor). These two approaches and their specific problems as well as past, present and future fusion experiments are treated in detail. The last part of the work is devoted to safety and environmental aspects of the potential thermonuclear aspects of the potential thermonuclear reactor, discussing such problems as fusion-specific hazards, normal operation and potential hazards, reactor incidents, environmental pollution by thermal effluents, radiological pollution, radioactive wastes and their disposal, and siting problems. (orig./GG) [de

17. Short fusion

CERN Multimedia

2002-01-01

French and UK researchers are perfecting a particle accelerator technique that could aid the quest for fusion energy or make X-rays that are safer and produce higher-resolution images. Led by Dr Victor Malka from the Ecole Nationale Superieure des Techniques Avancees in Paris, the team has developed a better way of accelerating electrons over short distances (1 page).

18. Magnetic fusion

International Nuclear Information System (INIS)

2002-01-01

This document is a detailed lecture on thermonuclear fusion. The basic physics principles are recalled and the technological choices that have led to tokamaks or stellarators are exposed. Different aspects concerning thermonuclear reactors such as safety, economy and feasibility are discussed. Tore-supra is described in details as well as the ITER project

19. Cold fusion

International Nuclear Information System (INIS)

Seo, Suk Yong; You, Jae Jun

1996-01-01

Nearly every technical information is chased in the world. All of them are reviewed and analyzed. Some of them are chosen to study further more to review every related documents. And a probable suggestion about the excitonic process in deuteron absorbed condensed matter is proposed a way to cold fusion. 8 refs. (Author)

20. Cold fusion, Alchemist's dream

International Nuclear Information System (INIS)

Clayton, E.D.

1989-09-01

In this report the following topics relating to cold fusion are discussed: muon catalysed cold fusion; piezonuclear fusion; sundry explanations pertaining to cold fusion; cosmic ray muon catalysed cold fusion; vibrational mechanisms in excited states of D 2 molecules; barrier penetration probabilities within the hydrogenated metal lattice/piezonuclear fusion; branching ratios of D 2 fusion at low energies; fusion of deuterons into 4 He; secondary D+T fusion within the hydrogenated metal lattice; 3 He to 4 He ratio within the metal lattice; shock induced fusion; and anomalously high isotopic ratios of 3 He/ 4 He

1. Magnetic fusion; La fusion magnetique

Energy Technology Data Exchange (ETDEWEB)

NONE

2002-07-01

This document is a detailed lecture on thermonuclear fusion. The basic physics principles are recalled and the technological choices that have led to tokamaks or stellarators are exposed. Different aspects concerning thermonuclear reactors such as safety, economy and feasibility are discussed. Tore-supra is described in details as well as the ITER project.

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

NARCIS (Netherlands)

Groenwold, A.A.; Wood, D.W.; Etman, L.F.P.; Tosserams, S.

2009-01-01

We implement and test a globally convergent sequential approximate optimization algorithm based on (convexified) diagonal quadratic approximations. The algorithm resides in the class of globally convergent optimization methods based on conservative convex separable approximations developed by

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

International Nuclear Information System (INIS)

Saint-Cyr, B.

2011-01-01

We model in this work granular materials composed of non-convex and cohesive aggregates, in view of application to the rheology of UO 2 powders. The effect of non convexity is analyzed in terms of bulk quantities (Coulomb internal friction and cohesion) and micromechanical parameters such as texture anisotropy and force transmission. In particular, we find that the packing fraction evolves in a complex manner with the shape non convexity and the shear strength increases but saturates due to interlocking between the aggregates. We introduce simple models to describe these features in terms of micro-mechanical parameters. Furthermore, a systematic investigation of shearing, uniaxial compaction and simple compression of cohesive packings show that bulk cohesion increases with non-convexity but is strongly influenced by the boundary conditions and shear bands or stress concentration. (author) [fr

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

CERN Document Server

Spring, David

1998-01-01

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

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

6. Graph Design via Convex Optimization: Online and Distributed Perspectives

Science.gov (United States)

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

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

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

Directory of Open Access Journals (Sweden)

Weilin Nie

2017-01-01

Full Text Available Abstract Convex risk minimization is a commonly used setting in learning theory. In this paper, we firstly give a perturbation analysis for such algorithms, and then we apply this result to differential private learning algorithms. Our analysis needs the objective functions to be strongly convex. This leads to an extension of our previous analysis to the non-differentiable loss functions, when constructing differential private algorithms. Finally, an error analysis is then provided to show the selection for the parameters.

Directory of Open Access Journals (Sweden)

Sung-Lang Chen

2008-11-01

Full Text Available Splenogonadal fusion (SGF is a rare congenital non-malignant anomaly characterized by fusion of splenic tissue to the gonad, and can be continuous or discontinuous. Very few cases have been diagnosed preoperatively, and many patients who present with testicular swelling undergo unnecessary orchiectomy under the suspicion of testicular neoplasm. A 16-year-old boy presented with a left scrotal mass and underwent total excision of a 1.6-cm tumor without damaging the testis, epididymis or its accompanying vessels. Pathologic examination revealed SFG (discontinuous type. If clinically suspected before surgery, the diagnosis may be confirmed by Tc-99m sulfur colloid imaging, which shows uptake in both the spleen and accessory splenic tissue within the scrotum. Frozen section should be considered if there remains any doubt regarding the diagnosis during operation.

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

Science.gov (United States)

Ding, Shuguang; Nie, Xiangli; Qiao, Hong; Zhang, Bo

2018-04-01

Reducing samples through convex hull vertices selection (CHVS) within each class is an important and effective method for online classification problems, since the classifier can be trained rapidly with the selected samples. However, the process of CHVS is NP-hard. In this paper, we propose a fast algorithm to select the convex hull vertices, based on the convex hull decomposition and the property of projection. In the proposed algorithm, the quadratic minimization problem of computing the distance between a point and a convex hull is converted into a linear equation problem with a low computational complexity. When the data dimension is high, an approximate, instead of exact, convex hull is allowed to be selected by setting an appropriate termination condition in order to delete more nonimportant samples. In addition, the impact of outliers is also considered, and the proposed algorithm is improved by deleting the outliers in the initial procedure. Furthermore, a dimension convention technique via the kernel trick is used to deal with nonlinearly separable problems. An upper bound is theoretically proved for the difference between the support vector machines based on the approximate convex hull vertices selected and all the training samples. Experimental results on both synthetic and real data sets show the effectiveness and validity of the proposed algorithm.

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

Science.gov (United States)

Du, Lei; Liu, Kefei; Yao, Xiaohui; Yan, Jingwen; Risacher, Shannon L; Han, Junwei; Guo, Lei; Saykin, Andrew J; Shen, Li

2017-10-25

Brain imaging genetics intends to uncover associations between genetic markers and neuroimaging quantitative traits. Sparse canonical correlation analysis (SCCA) can discover bi-multivariate associations and select relevant features, and is becoming popular in imaging genetic studies. The L1-norm function is not only convex, but also singular at the origin, which is a necessary condition for sparsity. Thus most SCCA methods impose [Formula: see text]-norm onto the individual feature or the structure level of features to pursuit corresponding sparsity. However, the [Formula: see text]-norm penalty over-penalizes large coefficients and may incurs estimation bias. A number of non-convex penalties are proposed to reduce the estimation bias in regression tasks. But using them in SCCA remains largely unexplored. In this paper, we design a unified non-convex SCCA model, based on seven non-convex functions, for unbiased estimation and stable feature selection simultaneously. We also propose an efficient optimization algorithm. The proposed method obtains both higher correlation coefficients and better canonical loading patterns. Specifically, these SCCA methods with non-convex penalties discover a strong association between the APOE e4 rs429358 SNP and the hippocampus region of the brain. They both are Alzheimer's disease related biomarkers, indicating the potential and power of the non-convex methods in brain imaging genetics.

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

13. Laser fusion

International Nuclear Information System (INIS)

Eliezer, S.

1982-02-01

In this paper, the physics of laser fusion is described on an elementary level. The irradiated matter consists of a dense inner core surrounded by a less dense plasma corona. The laser radiation is mainly absorbed in the outer periphery of the plasma. The absorbed energy is transported inward to the ablation surface where plasma flow is created. Due to this plasma flow, a sequence of inward going shock waves and heat waves are created, resulting in the compression and heating of the core to high density and temperature. The interaction physics between laser and matter leading to thermonuclear burn is summarized by the following sequence of events: Laser absorption → Energy transport → Compression → Nuclear Fusion. This scenario is shown in particular for a Nd:laser with a wavelength of 1 μm. The wavelength scaling of the physical processes is also discussed. In addition to the laser-plasma physics, the Nd high power pulsed laser is described. We give a very brief description of the oscillator, the amplifiers, the spatial filters, the isolators and the diagnostics involved. Last, but not least, the concept of reactors for laser fusion and the necessary laser system are discussed. (author)

14. Fusion spectroscopy

International Nuclear Information System (INIS)

Peacock, N.J.

1995-09-01

This article traces developments in the spectroscopy of high temperature laboratory plasma used in controlled fusion research from the early 1960's until the present. These three and a half decades have witnessed many orders of magnitude increase in accessible plasma parameters such as density and temperature as well as particle and energy confinement timescales. Driven by the need to interpret the radiation in terms of the local plasma parameters, the thrust of fusion spectroscopy has been to develop our understanding of (i) the atomic structure of highly ionised atoms, usually of impurities in the hydrogen isotope fuel; (ii) the atomic collision rates and their incorporation into ionization structure and emissivity models that take into account plasma phenomena like plasma-wall interactions, particle transport and radiation patterns; (iii) the diagnostic applications of spectroscopy aided by increasingly sophisticated characterisation of the electron fluid. These topics are discussed in relation to toroidal magnetically confined plasmas, particularly the Tokamak which appears to be the most promising approach to controlled fusion to date. (author)

15. Fusion Machines

International Nuclear Information System (INIS)

Weynants, R.R.

2004-01-01

A concise overview is given of the principles of inertial and magnetic fusion, with an emphasis on the latter in view of the aim of this summer school. The basis of magnetic confinement in mirror and toroidal geometry is discussed and applied to the tokamak concept. A brief discussion of the reactor prospects of this configuration identifies which future developments are crucial and where alternative concepts might help in optimising the reactor design. The text also aims at introducing the main concepts encountered in tokamak research that will be studied and used in the subsequent lectures

International Nuclear Information System (INIS)

1990-02-01

A short bulletin from the National Fusion Program. Included in this issue is a report on Fusion Materials Research, ITER physics research, fusion performance record at JET, and design options for reactor building. 4 figs

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

International Nuclear Information System (INIS)

Phan Thanh An

2008-06-01

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

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

Science.gov (United States)

Yu, Bo; Xu, Qing; Feng, Guochen

2007-03-01

In [G.C. Feng, Z.H. Lin, B. Yu, Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem, Nonlinear Anal. 32 (1998) 761-768; G.C. Feng, B. Yu, Combined homotopy interior point method for nonlinear programming problems, in: H. Fujita, M. Yamaguti (Eds.), Advances in Numerical Mathematics, Proceedings of the Second Japan-China Seminar on Numerical Mathematics, Lecture Notes in Numerical and Applied Analysis, vol. 14, Kinokuniya, Tokyo, 1995, pp. 9-16; Z.H. Lin, B. Yu, G.C. Feng, A combined homotopy interior point method for convex programming problem, Appl. Math. Comput. 84 (1997) 193-211.], a combined homotopy was constructed for solving non-convex programming and convex programming with weaker conditions, without assuming the logarithmic barrier function to be strictly convex and the solution set to be bounded. It was proven that a smooth interior path from an interior point of the feasible set to a K-K-T point of the problem exists. This shows that combined homotopy interior point methods can solve the problem that commonly used interior point methods cannot solveE However, so far, there is no result on its complexity, even for linear programming. The main difficulty is that the objective function is not monotonically decreasing on the combined homotopy path. In this paper, by taking a piecewise technique, under commonly used conditions, polynomiality of a combined homotopy interior point method is given for convex nonlinear programming.

19. Revitalizing Fusion via Fission Fusion

Science.gov (United States)

Manheimer, Wallace

2001-10-01

Existing tokamaks could generate significant nuclear fuel. TFTR, operating steady state with DT might generate enough fuel for a 300 MW nuclear reactor. The immediate goals of the magnetic fusion program would necessarily shift from a study of advanced plasma regimes in larger sized devices, to mostly known plasmas regimes, but at steady state or high duty cycle operation in DT plasmas. The science and engineering of breeding blankets would be equally important. Follow on projects could possibly produce nuclear fuel in large quantity at low price. Although today there is strong opposition to nuclear power in the United States, in a 21st century world of 10 billion people, all of whom will demand a middle class life style, nuclear energy will be important. Concern over greenhouse gases will also drive the world toward nuclear power. There are studies indicating that the world will need 10 TW of carbon free energy by 2050. It is difficult to see how this can be achieved without the breeding of nuclear fuel. By using the thorium cycle, proliferation risks are minimized. [1], [2]. 1 W. Manheimer, Fusion Technology, 36, 1, 1999, 2.W. Manheimer, Physics and Society, v 29, #3, p5, July, 2000

20. Catalysed fusion

CERN Document Server

Farley, Francis

2012-01-01

A sizzling romance and a romp with subatomic particles at CERN. Love, discovery and adventure in the city where nations meet and beams collide. Life in a large laboratory. As always, the challenges are the same. Who leads? Who follows? Who succeeds? Who gets the credit? Who gets the women or the men? Young Jeremy arrives in CERN and joins the quest for green energy. Coping with baffling jargon and manifold dangers, he is distracted by radioactive rats, lovely ladies and an unscrupulous rival. Full of doubts and hesitations, he falls for a dazzling Danish girl, who leads him astray. His brilliant idea leads to a discovery and a new route to cold fusion. But his personal life is scrambled. Does it bring fame or failure? Tragedy or triumph?

1. Fusion cuisine

DEFF Research Database (Denmark)

Peters, Chris; Broersma, Marcel

2018-01-01

JJournalism studies as an academic field is characterized by multidisciplinarity. Focusing on one object of study, journalism and the news, it established itself by integrating and synthesizing approaches from established disciplines – a tendency that lives on today. This constant gaze to the out......JJournalism studies as an academic field is characterized by multidisciplinarity. Focusing on one object of study, journalism and the news, it established itself by integrating and synthesizing approaches from established disciplines – a tendency that lives on today. This constant gaze...... to the outside for conceptual inspiration and methodological tools lends itself to a journalism studies that is a fusion cuisine of media, communication, and related scholarship. However, what happens when this object becomes as fragmented and multifaceted as the ways we study it? This essay addresses...

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

Science.gov (United States)

Ibáñez, J. M.; Marquina, A.; Serna, S.; Aloy, M. A.

2018-05-01

The non-monotonicity of the local speed of sound in dense matter at baryon number densities much higher than the nuclear saturation density (n0 ≈ 0.16 fm-3) suggests the possible existence of a non-convex thermodynamics which will lead to a non-convex dynamics. Here, we explore the rich and complex dynamics that an equation of state (EoS) with non-convex regions in the pressure-density plane may develop as a result of genuinely relativistic effects, without a classical counterpart. To this end, we have introduced a phenomenological EoS, the parameters of which can be restricted owing to causality and thermodynamic stability constraints. This EoS can be regarded as a toy model with which we may mimic realistic (and far more complex) EoSs of practical use in the realm of relativistic hydrodynamics.

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

DEFF Research Database (Denmark)

Kafle, Bishoksan; Gallagher, John Patrick

2014-01-01

We present an approach to constrained Horn clause (CHC) verification combining three techniques: abstract interpretation over a domain of convex polyhedra, specialisation of the constraints in CHCs using abstract interpretation of query-answer transformed clauses, and refinement by splitting...... in conjunction with specialisation for propagating constraints it can frequently solve challenging verification problems. This is a contribution in itself, but refinement is needed when it fails, and the question of how to refine convex polyhedral analyses has not been studied much. We present a refinement...... technique based on interpolants derived from a counterexample trace; these are used to drive a property-based specialisation that splits predicates, leading in turn to more precise convex polyhedral analyses. The process of specialisation, analysis and splitting can be repeated, in a manner similar...

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

5. Schur-Convexity for a Class of Symmetric Functions and Its Applications

Directory of Open Access Journals (Sweden)

Wei-Feng Xia

2009-01-01

Full Text Available For x=(x1,x2,…,xn∈R+n, the symmetric function ϕn(x,r is defined by ϕn(x,r=ϕn(x1,x2,…,xn;r=∏1≤i1convexity, Schur multiplicative convexity and Schur harmonic convexity of ϕn(x,r are discussed. As applications, some inequalities are established by use of the theory of majorization.

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

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

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

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

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

OpenAIRE

Hattori, Masahiko; Tanaka, Yasuhito

2017-01-01

We consider a choice of options for a foreign innovating firm to license its new cost-reducing technology to a domestic incumbent firm or to enter the domestic market with or without license under convex cost functions. With convex cost functions the domestic market and the foreign market are not separated, and the results depend on the relative size of those markets. In a specific case with linear demand and quadratic cost, entry without license strategy is never the optimal strategy for the...

11. Towards nuclear fusion reactors

International Nuclear Information System (INIS)

1993-11-01

The results of nuclear fusion researches in JAERI are summarized. In this report, following themes are collected: the concept of fusion reactor (including ITER), fusion reactor safety, plasma confinement, fusion reactor equipment, and so on. Includes glossary. (J.P.N.)

International Nuclear Information System (INIS)

1995-06-01

A short bulletin from the National Fusion Program highlighting in this issue the Canada - US fusion meeting in Montreal, fusion breeder work in Chile, new management at CFFTP, fast electrons in tokamaks: new data from TdeV, a program review of CCFM and Velikhov to address Montreal fusion meeting. 1 fig

13. Fusion systems engineering

International Nuclear Information System (INIS)

Anon.

1977-01-01

Summaries of research are included for each of the following topics: (1) fusion reactor systems studies, (2) development of blanket processing technology for fusion reactors, (3) safety studies of fusion concepts, (4) the MACK/MACKLIB system for nuclear response functions, and (5) energy storage and power supply systems for fusion reactors

14. Fusion systems engineering

International Nuclear Information System (INIS)

Anon.

1978-01-01

Research during this report period has covered the following areas: (1) fusion reactor systems studies, (2) development of blanket processing technology for fusion reactors, (3) safety studies of fusion concepts, (4) MACKLIB-IV, a new library of nuclear response functions, (5) energy storage and power supply requirements for commercial fusion reactors, (6) blanket/shield design evaluation for commercial fusion reactors, and (7) cross section measurements, evaluations, and techniques

15. Fusion fuel and renewables

International Nuclear Information System (INIS)

Entler, Slavomir

2015-01-01

It is shown that fusion fuel meets all aspects applied when defining renewables. A table of definitions of renewables is presented. The sections of the paper are as follows: An industrial renewable source; Nuclear fusion; Current situation in research; Definitions of renewable sources; Energy concept of nuclear fusion; Fusion fuel; Natural energy flow; Environmental impacts; Fusion fuel assessment; Sustainable power; and Energy mix from renewables. (P.A.)

16. Cold fusion

International Nuclear Information System (INIS)

Bush, R.T.

1991-01-01

The transmission resonance model (TRM) is combined with some electrochemistry of the cathode surface and found to provide a good fit to new data on excess heat. For the first time, a model for cold fusion not only fits calorimetric data but also predicts optimal trigger points. This suggests that the model is meaningful and that the excess heat phenomenon claimed by Fleischmann and Pons is genuine. A crucial role is suggested for the overpotential and, in particular, for the concentration overpotential, i.e., the hydrogen overvoltage. Self-similar geometry, or scale invariance, i.e., a fractal nature, is revealed by the relative excess power function. Heat bursts are predicted with a scale invariance in time, suggesting a possible link between the TRM and chaos theory. The model describes a near-surface phenomenon with an estimated excess power yield of ∼1 kW/cm 3 Pd, as compared to 50 W/cm 3 of reactor core for a good fission reactor. Transmission resonance-induced nuclear transmutation, a new type of nuclear reaction, is strongly suggested with two types emphasized: transmission resonance-induced neutron transfer reactions yielding essentially the same end result as Teller's hypothesized catalytic neutron transfer and a three-body reaction promoted by standing de Broglie waves. In this paper suggestions for the anomalous production of heat, particles, and radiation are given

17. Fusion energy

International Nuclear Information System (INIS)

1990-09-01

The main purpose of the International Thermonuclear Experimental Reactor (ITER) is to develop an experimental fusion reactor through the united efforts of many technologically advanced countries. The ITER terms of reference, issued jointly by the European Community, Japan, the USSR, and the United States, call for an integrated international design activity and constitute the basis of current activities. Joint work on ITER is carried out under the auspices of the International Atomic Energy Agency (IAEA), according to the terms of quadripartite agreement reached between the European Community, Japan, the USSR, and the United States. The site for joint technical work sessions is at the MaxPlanck Institute of Plasma Physics. Garching, Federal Republic of Germany. The ITER activities have two phases: a definition phase performed in 1988 and the present design phase (1989--1990). During the definition phase, a set of ITER technical characteristics and supporting research and development (R ampersand D) activities were developed and reported. The present conceptual design phase of ITER lasts until the end of 1990. The objectives of this phase are to develop the design of ITER, perform a safety and environmental analysis, develop site requirements, define future R ampersand D needs, and estimate cost, manpower, and schedule for construction and operation. A final report will be submitted at the end of 1990. This paper summarizes progress in the ITER program during the 1989 design phase

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

Directory of Open Access Journals (Sweden)

Ghulam Farid

2017-10-01

Full Text Available The aim of this paper is to obtain some more general fractional integral inequalities of Fejer Hadamard type for p-convex functions via Riemann-Liouville k-fractional integrals. Also in particular fractional inequalities for p-convex functions via Riemann-Liouville fractional integrals have been deduced.

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

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

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

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

Science.gov (United States)

2013-03-01

IrisCode, developed by Daugman, in 1993, is the most influential iris recognition algorithm. A thorough understanding of IrisCode is essential, because over 100 million persons have been enrolled by this algorithm and many biometric personal identification and template protection methods have been developed based on IrisCode. This paper indicates that a template produced by IrisCode or its variants is a convex polyhedral cone in a hyperspace. Its central ray, being a rough representation of the original biometric signal, can be computed by a simple algorithm, which can often be implemented in one Matlab command line. The central ray is an expected ray and also an optimal ray of an objective function on a group of distributions. This algorithm is derived from geometric properties of a convex polyhedral cone but does not rely on any prior knowledge (e.g., iris images). The experimental results show that biometric templates, including iris and palmprint templates, produced by different recognition methods can be matched through the central rays in their convex polyhedral cones and that templates protected by a method extended from IrisCode can be broken into. These experimental results indicate that, without a thorough security analysis, convex polyhedral cone templates cannot be assumed secure. Additionally, the simplicity of the algorithm implies that even junior hackers without knowledge of advanced image processing and biometric databases can still break into protected templates and reveal relationships among templates produced by different recognition methods.

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

NARCIS (Netherlands)

Kröger, M.; Hütter, M.

2006-01-01

We derive general expressions and present several examples for the phoretic forces and torques acting on a translationally moving and rotating convex tracer particle, usually a submicrosized aerosol particle, assumed to be small compared to the mean free path of the surrounding nonequilibrium gas.

4. Convex hull and tour crossings in the Euclidean traveling salesperson problem : implications for human performance studies

NARCIS (Netherlands)

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

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

NARCIS (Netherlands)

Klein Haneveld, Willem K.; Stougie, L.; van der Vlerk, Maarten H.

1995-01-01

We consider the objective function of a simple integer recourse problem with fixed technology matrix. Using properties of the expected value function, we prove a relation between the convex hull of this function and the expected value function of a continuous simple recourse program. We present an

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

KAUST Repository

Gurses, Ercan; Miehe, Christian

2011-01-01

. These microstructures can be resolved by use of relaxation techniques associated with the construction of convex hulls. We propose a particular relaxation method for partially damaged solids and investigate it in one- and multi-dimensional settings. To this end, we

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

OpenAIRE

Lin, Youjiang

2010-01-01

In this paper, a new proof of the following result is given: The product of the volumes of an origin symmetric convex bodies $K$ in R^2 and of its polar body is minimal if and only if $K$ is a parallelogram.

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

NARCIS (Netherlands)

Zhao, J.; Basto, Fernandes V.; Jiao, L.; Yevseyeva, I.; Asep, Maulana A.; Li, R.; Bäck, T.H.W.; Tang, T.; Michael, Emmerich T. M.

2016-01-01

The receiver operating characteristic (ROC) and detection error tradeoff(DET) curves are frequently used in the machine learning community to analyze the performance of binary classifiers. Recently, the convex-hull-based multiobjective genetic programming algorithm was proposed and successfully

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

NARCIS (Netherlands)

Yalcinkaya, T.; Brekelmans, W.A.M.; Geers, M.G.D.

2011-01-01

A rate dependent strain gradient plasticity framework for the description of plastic slip patterning in a system with non-convex energetic hardening is presented. Both the displacement and the plastic slip fields are considered as primary variables. These fields are determined on a global level by

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

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

NARCIS (Netherlands)

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

12. An Alternating Direction Method for Convex Quadratic Second-Order Cone Programming with Bounded Constraints

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.

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

NARCIS (Netherlands)

FRENK, JBG; GROMICHO, J; ZHANG, S

1994-01-01

This paper proposes a deep cut version of the ellipsoid algorithm for solving a general class of continuous convex programming problems. In each step the algorithm does not require more computational effort to construct these deep cuts than its corresponding central cut version. Rules that prevent

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

15. The Distortion Theorems for Harmonic Mappings with Analytic Parts Convex or Starlike Functions of Order β

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.

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

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

NARCIS (Netherlands)

Dhaene, J.; Goovaerts, M.J.; Vanmaele, M.; van Weert, K.

2012-01-01

In Van Weert et al. (2010), results are obtained showing that, when allowing some of the cash flows to be negative, convex order lower bound approximations can still be used to solve general investment problems in a context of provisioning or terminal wealth. In this paper, a correction and further

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

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

Science.gov (United States)

Rico, María; Benavente, Lorena; Para, Marta; Santamarta, Elena; Pascual, Julio; Calleja, Sergio

2014-03-01

Convexal subarachnoid hemorrhage has been associated with different diseases, reversible cerebral vasoconstriction syndrome and cerebral amyloid angiopathy being the 2 main causes. To investigate whether headache at onset is determinant in identifying the underlying etiology for convexal subarachnoid hemorrhage. After searching in the database of our hospital, 24 patients were found with convexal subarachnoid hemorrhage in the last 10 years. The mean age of the sample was 69.5 years. We recorded data referring to demographics, symptoms and neuroimaging. Cerebral amyloid angiopathy patients accounted for 46% of the sample, 13% were diagnosed with reversible cerebral vasoconstriction syndrome, 16% with several other etiologies, and in 25%, the cause remained unknown. Mild headache was present only in 1 (9%) of the 11 cerebral amyloid angiopathy patients, while severe headache was the dominant feature in 86% of cases of the remaining etiologies. Headache is a key symptom allowing a presumptive etiological diagnosis of convexal subarachnoid hemorrhage. While the absence of headache suggests cerebral amyloid angiopathy as the more probable cause, severe headache obliges us to rule out other etiologies, such as reversible cerebral vasoconstriction syndrome. © 2013 American Headache Society.

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

1. Extreme points of the convex set of joint probability distributions with ...

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.

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

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

Directory of Open Access Journals (Sweden)

San-Yang Liu

2014-01-01

Full Text Available Two unified frameworks of some sufficient descent conjugate gradient methods are considered. Combined with the hyperplane projection method of Solodov and Svaiter, they are extended to solve convex constrained nonlinear monotone equations. Their global convergence is proven under some mild conditions. Numerical results illustrate that these methods are efficient and can be applied to solve large-scale nonsmooth equations.

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

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

NARCIS (Netherlands)

Frenk, J.B.G.; Gromicho Dos Santos, J.A.; Zhang, S.

1994-01-01

This paper proposes a deep cut version of the ellipsoid algorithm for solving a general class of continuous convex programming problems. In each step the algorithm does not require more computational effort to construct these deep cuts than its corresponding central cut version. Rules that prevent

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

NARCIS (Netherlands)

J.B.G. Frenk (Hans); J.A.S. Gromicho (Joaquim); S. Zhang (Shuzhong)

1994-01-01

textabstractThis paper proposes a deep cut version of the ellipsoid algorithm for solving a general class of continuous convex programming problems. In each step the algorithm does not require more computational effort to construct these deep cuts than its corresponding central cut version. Rules

7. Study on feed forward neural network convex optimization for LiFePO4 battery parameters

Science.gov (United States)

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.

8. An Efficient Algorithm to Calculate the Minkowski Sum of Convex 3D Polyhedra

NARCIS (Netherlands)

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

9. The Lp Lp Lp-curvature images of convex bodies and Lp Lp Lp ...

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

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

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

12. Fusion technology: The Iter fusion experiment

International Nuclear Information System (INIS)

Dietz, K.J.

1994-01-01

Plans for the Iter international fusion experiment, in which the European Union, Japan, Canada, Russia, Sweden, Switzerland, and the USA cooperate, were begun in 1985, and construction work started in early 1994. These activities serve for the preparation of the design and construction documents for a research reactor in which a stable fusion plasma is to be generated. This is to be the basis for the construction of a fusion reactor for electricity generation. Preparatory work was performed in the Tokamak experiments with JET and TFTR. The fusion power of 1.5 GW will be attained, thus enabling Iter to keep a deuterium-tritium plasma burning. (orig.) [de

13. Review of fusion synfuels

International Nuclear Information System (INIS)

Fillo, J.A.

1980-01-01

Thermonuclear fusion offers an inexhaustible source of energy for the production of hydrogen from water. Depending on design, electric generation efficiencies of approx. 40 to 60% and hydrogen production efficiencies by high-temperature electrolysis of approx. 50 to 65% are projected for fusion reactors using high-temperatures blankets. Fusion/coal symbiotic systems appear economically promising for the first generation of commercial fusion synfuels plants. Coal production requirements and the environmental effects of large-scale coal usage would be greatly reduced by a fusion/coal system. In the long term, there could be a gradual transition to an inexhaustible energy system based solely on fusion

14. Barriers to fusion

International Nuclear Information System (INIS)

Berriman, A.C.; Butt, R.D.; Dasgupta, M.; Hinde, D.J.; Morton, C.R.; Newton, J.O.

1999-01-01

The fusion barrier is formed by the combination of the repulsive Coulomb and attractive nuclear forces. Recent research at the Australian National University has shown that when heavy nuclei collide, instead of a single fusion barrier, there is a set of fusion barriers. These arise due to intrinsic properties of the interacting nuclei such deformation, rotations and vibrations. Thus the range of barrier energies depends on the properties of both nuclei. The transfer of matter between nuclei, forming a neck, can also affect the fusion process. High precision data have been used to determine fusion barrier distributions for many nuclear reactions, leading to new insights into the fusion process

15. Preliminary Study of the Onset of Nucleate Boiling (ONB) for the Thermal-hydraulic Design of HANARO Irradiation non-instrumented Capsule during the Natural Convection

Energy Technology Data Exchange (ETDEWEB)

Nam, Kyungho [Korea Atomic Energy Research Institute, Daejeon (Korea, Republic of)

2016-10-15

The HANARO reactor is an open-tank-in-pool type for easy access, and the capsules are being utilized for the irradiation test of materials and nuclear fuel in HANARO. The concept of the capsule is the direct contact with the coolant to cool the temperature of specimen down. To successfully accomplish the irradiation test, it is essential that the capsule should be designed considering the thermal margin such as the margin to Onset of Nucleate Boiling (ONB), the margin to Departure from Nucleate Boiling (DNB). In this paper, the preliminary study was performed by focusing on the ONB and the capsule design will be performed using the heat flux and temperature at ONB condition calculated in this paper. In this paper, the temperature and heat flux under ONB condition are simply calculated for the thermal design of fuel capsule for irradiation test. These values will be considered to design the non-instrumented capsule for natural circulation. To confirm the calculated value, detailed calculation will be performed using the one dimensional and multi-dimensional codes.

16. Fusion reactor design studies

International Nuclear Information System (INIS)

Emmert, G.A.; Kulcinski, G.L.; Santarius, J.F.

1990-01-01

This report discusses the following topics on the ARIES tokamak: systems; plasma power balance; impurity control and fusion ash removal; fusion product ripple loss; energy conversion; reactor fueling; first wall design; shield design; reactor safety; and fuel cost and resources

17. Laser fusion: an overview

International Nuclear Information System (INIS)

Boyer, K.

1975-01-01

The laser fusion concept is described along with developments in neodymium and carbon dioxide lasers. Fuel design and fabrication are reviewed. Some spin-offs of the laser fusion program are discussed. (U.S.)

Energy Technology Data Exchange (ETDEWEB)

NONE

1994-01-01

A short bulletin from the National Fusion Program highlighting in this issue TdeV tokamak updates, fusion research in Korea, CCFM program review, TdeV divertor plasma, and CFFTP program review. 4 figs.

International Nuclear Information System (INIS)

1995-03-01

A short bulletin from the National Fusion Program highlighting in this issue ITER reactor siting, a major upgrade for TdeV tokamak, Ceramic Breeders: new tritium mapping technique and Joint Fusion Symposium. 2 figs

International Nuclear Information System (INIS)

1993-03-01

Fusion Canada's publication of the National Fusion Program. Included in this issue is the CFFTP Industrial Impact Study, CCFM/TdeV Update:helium pumping, research funds, and deuterium in beryllium - high temperature behaviour. 3 figs

International Nuclear Information System (INIS)

1994-01-01

A short bulletin from the National Fusion Program highlighting in this issue TdeV tokamak updates, fusion research in Korea, CCFM program review, TdeV divertor plasma, and CFFTP program review. 4 figs

International Nuclear Information System (INIS)

Jackson, D. P.

1990-01-01

Canada's fusion strategy is based on developing specialized technologies in well-defined areas and supplying these technologies to international fusion projects. Two areas are specially emphasized in Canada: engineered fusion system technologies, and specific magnetic confinement and materials studies. The Canadian Fusion Fuels Technology Project focuses on the first of these areas. It tritium and fusion reactor fuel systems, remote maintenance and related safety studies. In the second area, the Centre Canadian de fusion magnetique operates the Tokamak de Varennes, the main magnetic fusion device in Canada. Both projects are partnerships linking the Government of Canada, represented by Atomic Energy of Canada Limited, and provincial governments, electrical utilities, universities and industry. Canada's program has extensive international links, through which it collaborates with the major world fusion programs, including participation in the International Thermonuclear Experimental Reactor project

3. Fusion systems engineering

International Nuclear Information System (INIS)

Anon.

1977-01-01

Information is given on each of the following topics: (1) fusion reactor systems studies, (2) development of blanket processing technology for fusion reactors, (3) safety studies of CTR concepts, and (4) cross section measurements and techniques

International Nuclear Information System (INIS)

1989-02-01

A short bulletin from the National Fusion Program. Included in this issue is a funding report for CFFTP, a technical update for Tokamak de Varennes and a network for university research by the National Fusion Program. 4 figs

Energy Technology Data Exchange (ETDEWEB)

NONE

1992-08-01

A short bulletin from the National Fusion Program. Included in this issue is a report on the ITER agreement signed with the EDA, the robotic maintenance for NET, the CFFTP Fusion Pilot Study, the new IEA joint programs on environment, safety and economic aspects of fusion power, and a review by the CCFM advisory committee. 3 figs.

6. User's perspective on fusion

International Nuclear Information System (INIS)

Ashworth, C.P.

1976-01-01

The need in fusion, from the electric utilities viewpoint, is for fusion to be a real option, not huge, complicated nuclear plants costing $10 billion each and requiring restructuring the energy industry to provide and use them. A course for future fusion reactor work in order to be a real option is discussed. The advantages of alternate concepts to the tokamak are presented 7. Fusion Canada issue 17 International Nuclear Information System (INIS) 1992-05-01 A short bulletin from the National Fusion Program. Included in this issue is a report on increased funding for the Canadian Fusion Program, news of the compact Toroid fuelling gun, an update on Tokamak de Varennes, the Canada - U.S. fusion meeting, measurements of plasma flow velocity, and replaceable Tokamak divertors. 4 figs 8. Fusion Canada issue 18 International Nuclear Information System (INIS) 1992-08-01 A short bulletin from the National Fusion Program. Included in this issue is a report on the ITER agreement signed with the EDA, the robotic maintenance for NET, the CFFTP Fusion Pilot Study, the new IEA joint programs on environment, safety and economic aspects of fusion power, and a review by the CCFM advisory committee. 3 figs 9. CO2-laser fusion International Nuclear Information System (INIS) Stark, E.E. Jr. 1978-01-01 The basic concept of laser fusion is described, with a set of requirements on the laser system. Systems and applications concepts are presented and discussed. The CO 2 laser's characteristics and advantages for laser fusion are described. Finally, technological issues in the development of CO 2 laser systems for fusion applications are discussed 10. Fusion Canada issue 9 Energy Technology Data Exchange (ETDEWEB) NONE 1989-11-01 A short bulletin from the National Fusion Program. Included in this issue is a report on availability of Canadian Tritium, an ITER update, a CCFM update on Tokamak and the new team organization, an international report on Fusion in Canada and a Laser Fusion Project at the University of Toronto. 3 figs. 11. Heavy ion fusion International Nuclear Information System (INIS) Bangerter, R.O. 1986-01-01 This report on the International Symposium on Heavy Ion Fusion held May 27-29, 1986 summarizes the problems and achievements in the areas of targets, accelerators, focussing, reactor studies, and system studies. The symposium participants recognize that there are large uncertainties in Heavy Ion Fusion but many of them are also optimistic that HIF may ultimately be the best approach to fusion 12. Fusion Canada issue 17 Energy Technology Data Exchange (ETDEWEB) NONE 1992-05-01 A short bulletin from the National Fusion Program. Included in this issue is a report on increased funding for the Canadian Fusion Program, news of the compact Toroid fuelling gun, an update on Tokamak de Varennes, the Canada - U.S. fusion meeting, measurements of plasma flow velocity, and replaceable Tokamak divertors. 4 figs. 13. Fusion Canada issue 25 International Nuclear Information System (INIS) 1994-08-01 A short bulletin from the National Fusion Program highlighting in this issue an economic impact study of the Canadian site for ITER, Harvey Skarsgard: fusion pioneer retires, NFP: Phillips and Holtslander exchange roles, Europe's fusion funding proposals and an update of CCFM/TdeV. 1 fig 14. Fusion reactors - types - problems International Nuclear Information System (INIS) Schmitter, K.H. 1979-07-01 A short account is given of the principles of fusion reactions and of the expected advantages of fusion reactors. Descriptions are presented of various Tokamak experimental devices being developed in a number of countries and of some mirror machines. The technical obstacles to be overcome before a fusion reactor could be self-supporting are discussed. (U.K.) 15. Cold fusion research International Nuclear Information System (INIS) 1989-11-01 I am pleased to forward to you the Final Report of the Cold Fusion Panel. This report reviews the current status of cold fusion and includes major chapters on Calorimetry and Excess Heat, Fusion Products and Materials Characterization. In addition, the report makes a number of conclusions and recommendations, as requested by the Secretary of Energy 16. Fusion Canada issue 9 International Nuclear Information System (INIS) 1989-11-01 A short bulletin from the National Fusion Program. Included in this issue is a report on availability of Canadian Tritium, an ITER update, a CCFM update on Tokamak and the new team organization, an international report on Fusion in Canada and a Laser Fusion Project at the University of Toronto. 3 figs 17. On the convex closed set-valued operators in Banach spaces and their applications in control problems International Nuclear Information System (INIS) Vu Ngoc Phat; Jong Yeoul Park 1995-10-01 The paper studies a class of set-values operators with emphasis on properties of their adjoints and existence of eigenvalues and eigenvectors of infinite-dimensional convex closed set-valued operators. Sufficient conditions for existence of eigenvalues and eigenvectors of set-valued convex closed operators are derived. These conditions specify possible features of control problems. The results are applied to some constrained control problems of infinite-dimensional systems described by discrete-time inclusions whose right-hand-sides are convex closed set- valued functions. (author). 8 refs 18. Calculating and controlling the error of discrete representations of Pareto surfaces in convex multi-criteria optimization. Science.gov (United States) Craft, David 2010-10-01 A discrete set of points and their convex combinations can serve as a sparse representation of the Pareto surface in multiple objective convex optimization. We develop a method to evaluate the quality of such a representation, and show by example that in multiple objective radiotherapy planning, the number of Pareto optimal solutions needed to represent Pareto surfaces of up to five dimensions grows at most linearly with the number of objectives. The method described is also applicable to the representation of convex sets. Copyright © 2009 Associazione Italiana di Fisica Medica. Published by Elsevier Ltd. All rights reserved. 19. A Genealogy of Convex Solids Via Local and Global Bifurcations of Gradient Vector Fields Science.gov (United States) 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. 20. Convexity and Weighted Integral Inequalities for Energy Decay Rates of Nonlinear Dissipative Hyperbolic Systems 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 1. 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) 2. 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... 3. 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... 4. 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... 5. 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... 6. 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) 7. Surface tension-induced high aspect-ratio PDMS micropillars with concave and convex lens tips KAUST Repository Li, Huawei 2013-04-01 This paper reports a novel method for the fabrication of 3-dimensional (3D) Polydimethylsiloxane (PDMS) micropillars with concave and convex lens tips in a one-step molding process, using a CO2 laser-machined Poly(methyl methacrylate) (PMMA) mold with through holes. The PDMS micropillars are 4 mm high and have an aspect ratio of 251. The micropillars are formed by capillary force drawing up PDMS into the through hole mold. The concave and convex lens tips of the PDMS cylindrical micropillars are induced by surface tension and are controllable by changing the surface wetting properties of the through holes in the PMMA mold. This technique eliminates the requirements of expensive and complicated facilities to prepare a 3D mold, and it provides a simple and rapid method to fabricate 3D PDMS micropillars with controllable dimensions and tip shapes. © 2013 IEEE. 8. The steady-state of the (Normalized) LMS is schur convex KAUST Repository Al-Hujaili, Khaled A. 2016-06-24 In this work, we demonstrate how the theory of majorization and schur-convexity can be used to assess the impact of input-spread on the Mean Squares Error (MSE) performance of adaptive filters. First, we show that the concept of majorization can be utilized to measure the spread in input-regressors and subsequently order the input-regressors according to their spread. Second, we prove that the MSE of the Least Mean Squares Error (LMS) and Normalized LMS (NLMS) algorithms are schur-convex, that is, the MSE of the LMS and the NLMS algorithms preserve the majorization order of the inputs which provide an analytical justification to why and how much the MSE performance of the LMS and the NLMS algorithms deteriorate as the spread in input increases. © 2016 IEEE. 9. Surface tension-induced high aspect-ratio PDMS micropillars with concave and convex lens tips KAUST Repository Li, Huawei; Fan, Yiqiang; Yi, Ying; Foulds, Ian G. 2013-01-01 This paper reports a novel method for the fabrication of 3-dimensional (3D) Polydimethylsiloxane (PDMS) micropillars with concave and convex lens tips in a one-step molding process, using a CO2 laser-machined Poly(methyl methacrylate) (PMMA) mold with through holes. The PDMS micropillars are 4 mm high and have an aspect ratio of 251. The micropillars are formed by capillary force drawing up PDMS into the through hole mold. The concave and convex lens tips of the PDMS cylindrical micropillars are induced by surface tension and are controllable by changing the surface wetting properties of the through holes in the PMMA mold. This technique eliminates the requirements of expensive and complicated facilities to prepare a 3D mold, and it provides a simple and rapid method to fabricate 3D PDMS micropillars with controllable dimensions and tip shapes. © 2013 IEEE. 10. 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 11. Convex lattice polygons of fixed area with perimeter-dependent weights. Science.gov (United States) Rajesh, R; Dhar, Deepak 2005-01-01 We study fully convex polygons with a given area, and variable perimeter length on square and hexagonal lattices. We attach a weight tm to a convex polygon of perimeter m and show that the sum of weights of all polygons with a fixed area s varies as s(-theta(conv))eK(t)square root(s) for large s and t less than a critical threshold tc, where K(t) is a t-dependent constant, and theta(conv) is a critical exponent which does not change with t. Using heuristic arguments, we find that theta(conv) is 1/4 for the square lattice, but -1/4 for the hexagonal lattice. The reason for this unexpected nonuniversality of theta(conv) is traced to existence of sharp corners in the asymptotic shape of these polygons. 12. Reduction of shock induced noise in imperfectly expanded supersonic jets using convex optimization Science.gov (United States) Adhikari, Sam 2007-11-01 Imperfectly expanded jets generate screech noise. The imbalance between the backpressure and the exit pressure of the imperfectly expanded jets produce shock cells and expansion or compression waves from the nozzle. The instability waves and the shock cells interact to generate the screech sound. The mathematical model consists of cylindrical coordinate based full Navier-Stokes equations and large-eddy-simulation turbulence modeling. Analytical and computational analysis of the three-dimensional helical effects provide a model that relates several parameters with shock cell patterns, screech frequency and distribution of shock generation locations. Convex optimization techniques minimize the shock cell patterns and the instability waves. The objective functions are (convex) quadratic and the constraint functions are affine. In the quadratic optimization programs, minimization of the quadratic functions over a set of polyhedrons provides the optimal result. Various industry standard methods like regression analysis, distance between polyhedra, bounding variance, Markowitz optimization, and second order cone programming is used for Quadratic Optimization. 13. 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. 14. Functional analysis and applied optimization in Banach spaces applications to non-convex variational models CERN Document Server Botelho, Fabio 2014-01-01 This book introduces the basic concepts of real and functional analysis. It presents the fundamentals of the calculus of variations, convex analysis, duality, and optimization that are necessary to develop applications to physics and engineering problems. The book includes introductory and advanced concepts in measure and integration, as well as an introduction to Sobolev spaces. The problems presented are nonlinear, with non-convex variational formulation. Notably, the primal global minima may not be attained in some situations, in which cases the solution of the dual problem corresponds to an appropriate weak cluster point of minimizing sequences for the primal one. Indeed, the dual approach more readily facilitates numerical computations for some of the selected models. While intended primarily for applied mathematicians, the text will also be of interest to engineers, physicists, and other researchers in related fields. 15. Structural Health Monitoring of Tall Buildings with Numerical Integrator and Convex-Concave Hull Classification Directory of Open Access Journals (Sweden) Suresh Thenozhi 2012-01-01 Full Text Available An important objective of health monitoring systems for tall buildings is to diagnose the state of the building and to evaluate its possible damage. In this paper, we use our prototype to evaluate our data-mining approach for the fault monitoring. The offset cancellation and high-pass filtering techniques are combined effectively to solve common problems in numerical integration of acceleration signals in real-time applications. The integration accuracy is improved compared with other numerical integrators. Then we introduce a novel method for support vector machine (SVM classification, called convex-concave hull. We use the Jarvis march method to decide the concave (nonconvex hull for the inseparable points. Finally the vertices of the convex-concave hull are applied for SVM training. 16. The steady-state of the (Normalized) LMS is schur convex KAUST Repository Al-Hujaili, Khaled A.; Al-Naffouri, Tareq Y.; Moinuddin, Muhammad 2016-01-01 In this work, we demonstrate how the theory of majorization and schur-convexity can be used to assess the impact of input-spread on the Mean Squares Error (MSE) performance of adaptive filters. First, we show that the concept of majorization can be utilized to measure the spread in input-regressors and subsequently order the input-regressors according to their spread. Second, we prove that the MSE of the Least Mean Squares Error (LMS) and Normalized LMS (NLMS) algorithms are schur-convex, that is, the MSE of the LMS and the NLMS algorithms preserve the majorization order of the inputs which provide an analytical justification to why and how much the MSE performance of the LMS and the NLMS algorithms deteriorate as the spread in input increases. © 2016 IEEE. 17. Colorimetric tests for diagnosis of filarial infection and vector surveillance using non-instrumented nucleic acid loop-mediated isothermal amplification (NINA-LAMP. Directory of Open Access Journals (Sweden) Catherine B Poole Full Text Available Accurate detection of filarial parasites in humans is essential for the implementation and evaluation of mass drug administration programs to control onchocerciasis and lymphatic filariasis. Determining the infection levels in vector populations is also important for assessing transmission, deciding when drug treatments may be terminated and for monitoring recrudescence. Immunological methods to detect infection in humans are available, however, cross-reactivity issues have been reported. Nucleic acid-based molecular assays offer high levels of specificity and sensitivity, and can be used to detect infection in both humans and vectors. In this study we developed loop-mediated isothermal amplification (LAMP tests to detect three different filarial DNAs in human and insect samples using pH sensitive dyes for enhanced visual detection of amplification. Furthermore, reactions were performed in a portable, non-instrumented nucleic acid amplification (NINA device that provides a stable heat source for LAMP. The efficacy of several strand displacing DNA polymerases were evaluated in combination with neutral red or phenol red dyes. Colorimetric NINA-LAMP assays targeting Brugia Hha I repeat, Onchocerca volvulus GST1a and Wuchereria bancrofti LDR each exhibit species-specificity and are also highly sensitive, detecting DNA equivalent to 1/10-1/5000th of one microfilaria. Reaction times varied depending on whether a single copy gene (70 minutes, O. volvulus or repetitive DNA (40 min, B. malayi and W. bancrofti was employed as a biomarker. The NINA heater can be used to detect multiple infections simultaneously. The accuracy, simplicity and versatility of the technology suggests that colorimetric NINA-LAMP assays are ideally suited for monitoring the success of filariasis control programs. 18. Neural Network in Fixed Time for Collision Detection between Two Convex Polyhedra OpenAIRE 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... 19. Annuity factors, duration and convexity : insights from a financial engineering perspective OpenAIRE Ekern, Steinar 1998-01-01 This paper applies a unified and integrative financial engineering perspective to key derived concepts in traditional fixed income analysis, with the purpose of enhancing conceptual insights and motivating computational applications. The emphasis on annuity factors and their impact on duration and convexity differs from the focus prevailing in related discussions. By decomposing the cashflow streams of a coupon bond into different, specific, and clearly defined portfolios of component bonds w... 20. 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) 1. 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.... 2. F-SVM: Combination of Feature Transformation and SVM Learning via Convex Relaxation OpenAIRE 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 ... 3. Convex Hypersurfaces and$L^p$Estimates for Schr\\"odinger Equations OpenAIRE Zheng, Quan; Yao, Xiaohua; Fan, Da 2004-01-01 This paper is concerned with Schr\\"odinger equations whose principal operators are homogeneous elliptic. When the corresponding level hypersurface is convex, we show the$L^p$-$L^q$estimate of solution operator in free case. This estimate, combining with the results of fractionally integrated groups, allows us to further obtain the$L^p$estimate of solutions for the initial data belonging to a dense subset of$L^p$in the case of integrable potentials. 4. 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].... 5. Geometry intuitive, discrete, and convex : a tribute to László Fejes Tóth CERN Document Server 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. 6. Image restoration by the method of convex projections: part 2 applications and numerical results. Science.gov (United States) 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. 7. On evolving deformation microstructures in non-convex partially damaged solids KAUST Repository Gurses, Ercan 2011-06-01 The paper outlines a relaxation method based on a particular isotropic microstructure evolution and applies it to the model problem of rate independent, partially damaged solids. The method uses an incremental variational formulation for standard dissipative materials. In an incremental setting at finite time steps, the formulation defines a quasi-hyperelastic stress potential. The existence of this potential allows a typical incremental boundary value problem of damage mechanics to be expressed in terms of a principle of minimum incremental work. Mathematical existence theorems of minimizers then induce a definition of the material stability in terms of the sequential weak lower semicontinuity of the incremental functional. As a consequence, the incremental material stability of standard dissipative solids may be defined in terms of weak convexity notions of the stress potential. Furthermore, the variational setting opens up the possibility to analyze the development of deformation microstructures in the post-critical range of unstable inelastic materials based on energy relaxation methods. In partially damaged solids, accumulated damage may yield non-convex stress potentials which indicate instability and formation of fine-scale microstructures. These microstructures can be resolved by use of relaxation techniques associated with the construction of convex hulls. We propose a particular relaxation method for partially damaged solids and investigate it in one- and multi-dimensional settings. To this end, we introduce a new isotropic microstructure which provides a simple approximation of the multi-dimensional rank-one convex hull. The development of those isotropic microstructures is investigated for homogeneous and inhomogeneous numerical simulations. © 2011 Elsevier Ltd. All rights reserved. 8. 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 9. Electron-pair logarithmic convexity and interelectronic moments in atoms: Application to heliumlike ions International Nuclear Information System (INIS) Koga, T.; Kasai, Y.; Dehesa, J.S.; Angulo, J.C. 1993-01-01 The electron-pair function h(u) of a finite many-electron system is not monotonic, but the related quantity h(u)/u α , α>0, is not only monotonically decreasing from the origin but also convex for the values α 1 and α 2 , respectively, as has been recently found. Here, it is first argued that this quantity is also logarithmically convex for any α≥α' with α'=max{-u 2 d2[lnh(u)]/du 2 }. Then this property is used to obtain a general inequality which involves three interelectronic moments left-angle u t right-angle. Particular cases of this inequality involve relevant characteristics of the system such as the number of electrons and the total electron-electron repulsion energy. Second, the logarithmic-convexity property of h(u) as well as the accuracy of this inequality are investigated by the optimum 20-term Hylleraas-type wave functions for two-electron atoms with nuclear charge Z=1, 2, 3, 5, and 10. It is found that (i) 14 2 much-gt α 1 ) and (ii) the accuracy of the inequality which involves moments of contiguous orders oscillates between 62.4% and 96.7% according to the specific He-like atom and the moments involved. Finally, the importance of the logarithmic-convexity effects on the interelectronic moments relative to those coming from other monotonicity properties of h(u)/u α are analyzed in the same numerical Hylleraas framework 10. A Combination Theorem for Convex Hyperbolic Manifolds, with Applications to Surfaces in 3-Manifolds OpenAIRE Baker, Mark; Cooper, Daryl 2005-01-01 We prove the convex combination theorem for hyperbolic n-manifolds. Applications are given both in high dimensions and in 3 dimensions. One consequence is that given two geometrically finite subgroups of a discrete group of isometries of hyperbolic n-space, satisfying a natural condition on their parabolic subgroups, there are finite index subgroups which generate a subgroup that is an amalgamated free product. Constructions of infinite volume hyperbolic n-manifolds are described by gluing lo... 11. Multilayer Spectral Graph Clustering via Convex Layer Aggregation: Theory and Algorithms OpenAIRE Chen, Pin-Yu; Hero, Alfred O. 2017-01-01 Multilayer graphs are commonly used for representing different relations between entities and handling heterogeneous data processing tasks. Non-standard multilayer graph clustering methods are needed for assigning clusters to a common multilayer node set and for combining information from each layer. This paper presents a multilayer spectral graph clustering (SGC) framework that performs convex layer aggregation. Under a multilayer signal plus noise model, we provide a phase transition analys... 12. Explicit finite difference predictor and convex corrector with applications to hyperbolic partial differential equations Science.gov (United States) 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. 13. Using Fisher Information Criteria for Chemical Sensor Selection via Convex Optimization Methods Science.gov (United States) 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 14. 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 15. Viral membrane fusion International Nuclear Information System (INIS) Harrison, Stephen C. 2015-01-01 Membrane fusion is an essential step when enveloped viruses enter cells. Lipid bilayer fusion requires catalysis to overcome a high kinetic barrier; viral fusion proteins are the agents that fulfill this catalytic function. Despite a variety of molecular architectures, these proteins facilitate fusion by essentially the same generic mechanism. Stimulated by a signal associated with arrival at the cell to be infected (e.g., receptor or co-receptor binding, proton binding in an endosome), they undergo a series of conformational changes. A hydrophobic segment (a “fusion loop” or “fusion peptide”) engages the target-cell membrane and collapse of the bridging intermediate thus formed draws the two membranes (virus and cell) together. We know of three structural classes for viral fusion proteins. Structures for both pre- and postfusion conformations of illustrate the beginning and end points of a process that can be probed by single-virion measurements of fusion kinetics. - Highlights: • Viral fusion proteins overcome the high energy barrier to lipid bilayer merger. • Different molecular structures but the same catalytic mechanism. • Review describes properties of three known fusion-protein structural classes. • Single-virion fusion experiments elucidate mechanism 16. Viral membrane fusion Energy Technology Data Exchange (ETDEWEB) Harrison, Stephen C., E-mail: harrison@crystal.harvard.edu 2015-05-15 Membrane fusion is an essential step when enveloped viruses enter cells. Lipid bilayer fusion requires catalysis to overcome a high kinetic barrier; viral fusion proteins are the agents that fulfill this catalytic function. Despite a variety of molecular architectures, these proteins facilitate fusion by essentially the same generic mechanism. Stimulated by a signal associated with arrival at the cell to be infected (e.g., receptor or co-receptor binding, proton binding in an endosome), they undergo a series of conformational changes. A hydrophobic segment (a “fusion loop” or “fusion peptide”) engages the target-cell membrane and collapse of the bridging intermediate thus formed draws the two membranes (virus and cell) together. We know of three structural classes for viral fusion proteins. Structures for both pre- and postfusion conformations of illustrate the beginning and end points of a process that can be probed by single-virion measurements of fusion kinetics. - Highlights: • Viral fusion proteins overcome the high energy barrier to lipid bilayer merger. • Different molecular structures but the same catalytic mechanism. • Review describes properties of three known fusion-protein structural classes. • Single-virion fusion experiments elucidate mechanism. 17. Some Convex Functions Based Measures of Independence and Their Application to Strange Attractor Reconstruction Directory of Open Access Journals (Sweden) Kazuyuki Aihara 2011-04-01 Full Text Available The classical information-theoretic measures such as the entropy and the mutual information (MI are widely applicable to many areas in science and engineering. Csiszar generalized the entropy and the MI by using the convex functions. Recently, we proposed the grid occupancy (GO and the quasientropy (QE as measures of independence. The QE explicitly includes a convex function in its definition, while the expectation of GO is a subclass of QE. In this paper, we study the effect of different convex functions on GO, QE, and Csiszar’s generalized mutual information (GMI. A quality factor (QF is proposed to quantify the sharpness of their minima. Using the QF, it is shown that these measures can have sharper minima than the classical MI. Besides, a recursive algorithm for computing GMI, which is a generalization of Fraser and Swinney’s algorithm for computing MI, is proposed. Moreover, we apply GO, QE, and GMI to chaotic time series analysis. It is shown that these measures are good criteria for determining the optimum delay in strange attractor reconstruction. 18. Environmental protection stability of river bed and banks using convex, concave, and linear bed sills. Science.gov (United States) Keshavarzi, Alireza; Noori, Lila Khaje 2010-12-01 River bed scourings are a major environmental problem for fish and aquatic habitat resources. In this study, to prevent river bed and banks from scouring, different types of bed sills including convex, concave and linear patterns were installed in a movable channel bed in a laboratory flume. The bed sills were tested with nine different arrangements and under different flow conditions. To find the most effective bed sill pattern, the scouring depth was measured downstream of the bed sill for a long experimental duration. The scour depth was measured at the middle and at the end of each experimental test for different ratios of the arch radius to the channel width [r/w]. The experimental results indicated that the convex pattern with r/w=0.35 produced minimum bed scouring depth at the center line whereas the concave pattern with r/w=0.23 produced the minimum scour depth at the wall banks. Therefore, the convex pattern was the most effective configuration for prevention of scouring at the center line of the river while the concave pattern was very effective to prevent scouring at the river banks. These findings can be suggested to be used in practical applications. 19. Renorming c0 and closed, bounded, convex sets with fixed point property for affine nonexpansive mappings Science.gov (United States) Nezir, Veysel; Mustafa, Nizami 2017-04-01 In 2008, P.K. Lin provided the first example of a nonreflexive space that can be renormed to have fixed point property for nonexpansive mappings. This space was the Banach space of absolutely summable sequences l1 and researchers aim to generalize this to c0, Banach space of null sequences. Before P.K. Lin's intriguing result, in 1979, Goebel and Kuczumow showed that there is a large class of non-weak* compact closed, bounded, convex subsets of l1 with fixed point property for nonexpansive mappings. Then, P.K. Lin inspired by Goebel and Kuczumow's ideas to give his result. Similarly to P.K. Lin's study, Hernández-Linares worked on L1 and in his Ph.D. thesis, supervisored under Maria Japón, showed that L1 can be renormed to have fixed point property for affine nonexpansive mappings. Then, related questions for c0 have been considered by researchers. Recently, Nezir constructed several equivalent norms on c0 and showed that there are non-weakly compact closed, bounded, convex subsets of c0 with fixed point property for affine nonexpansive mappings. In this study, we construct a family of equivalent norms containing those developed by Nezir as well and show that there exists a large class of non-weakly compact closed, bounded, convex subsets of c0 with fixed point property for affine nonexpansive mappings. 20. Convex-based void filling method for CAD-based Monte Carlo geometry modeling International Nuclear Information System (INIS) Yu, Shengpeng; Cheng, Mengyun; Song, Jing; Long, Pengcheng; Hu, Liqin 2015-01-01 Highlights: • We present a new void filling method named CVF for CAD based MC geometry modeling. • We describe convex based void description based and quality-based space subdivision. • The results showed improvements provided by CVF for both modeling and MC calculation efficiency. - Abstract: CAD based automatic geometry modeling tools have been widely applied to generate Monte Carlo (MC) calculation geometry for complex systems according to CAD models. Automatic void filling is one of the main functions in the CAD based MC geometry modeling tools, because the void space between parts in CAD models is traditionally not modeled while MC codes such as MCNP need all the problem space to be described. A dedicated void filling method, named Convex-based Void Filling (CVF), is proposed in this study for efficient void filling and concise void descriptions. The method subdivides all the problem space into disjointed regions using Quality based Subdivision (QS) and describes the void space in each region with complementary descriptions of the convex volumes intersecting with that region. It has been implemented in SuperMC/MCAM, the Multiple-Physics Coupling Analysis Modeling Program, and tested on International Thermonuclear Experimental Reactor (ITER) Alite model. The results showed that the new method reduced both automatic modeling time and MC calculation time 1. Towards reproducible experimental studies for non-convex polyhedral shaped particles Science.gov (United States) Wilke, Daniel N.; Pizette, Patrick; Govender, Nicolin; Abriak, Nor-Edine 2017-06-01 The packing density and flat bottomed hopper discharge of non-convex polyhedral particles are investigated in a systematic experimental study. The motivation for this study is two-fold. Firstly, to establish an approach to deliver quality experimental particle packing data for non-convex polyhedral particles that can be used for characterization and validation purposes of discrete element codes. Secondly, to make the reproducibility of experimental setups as convenient and readily available as possible using affordable and accessible technology. The primary technology for this study is fused deposition modeling used to 3D print polylactic acid (PLA) particles using readily available 3D printer technology. A total of 8000 biodegradable particles were printed, 1000 white particles and 1000 black particles for each of the four particle types considered in this study. Reproducibility is one benefit of using fused deposition modeling to print particles, but an extremely important additional benefit is that specific particle properties can be explicitly controlled. As an example in this study the volume fraction of each particle can be controlled i.e. the effective particle density can be adjusted. In this study the particle volumes reduces drastically as the non-convexity is increased, however all printed white particles in this study have the same mass within 2% of each other. 2. A two-layer recurrent neural network for nonsmooth convex optimization problems. Science.gov (United States) Qin, Sitian; Xue, Xiaoping 2015-06-01 In this paper, a two-layer recurrent neural network is proposed to solve the nonsmooth convex optimization problem subject to convex inequality and linear equality constraints. Compared with existing neural network models, the proposed neural network has a low model complexity and avoids penalty parameters. It is proved that from any initial point, the state of the proposed neural network reaches the equality feasible region in finite time and stays there thereafter. Moreover, the state is unique if the initial point lies in the equality feasible region. The equilibrium point set of the proposed neural network is proved to be equivalent to the Karush-Kuhn-Tucker optimality set of the original optimization problem. It is further proved that the equilibrium point of the proposed neural network is stable in the sense of Lyapunov. Moreover, from any initial point, the state is proved to be convergent to an equilibrium point of the proposed neural network. Finally, as applications, the proposed neural network is used to solve nonlinear convex programming with linear constraints and L1 -norm minimization problems. 3. Derivative-free generation and interpolation of convex Pareto optimal IMRT plans Science.gov (United States) Hoffmann, Aswin L.; Siem, Alex Y. D.; den Hertog, Dick; Kaanders, Johannes H. A. M.; Huizenga, Henk 2006-12-01 In inverse treatment planning for intensity-modulated radiation therapy (IMRT), beamlet intensity levels in fluence maps of high-energy photon beams are optimized. Treatment plan evaluation criteria are used as objective functions to steer the optimization process. Fluence map optimization can be considered a multi-objective optimization problem, for which a set of Pareto optimal solutions exists: the Pareto efficient frontier (PEF). In this paper, a constrained optimization method is pursued to iteratively estimate the PEF up to some predefined error. We use the property that the PEF is convex for a convex optimization problem to construct piecewise-linear upper and lower bounds to approximate the PEF from a small initial set of Pareto optimal plans. A derivative-free Sandwich algorithm is presented in which these bounds are used with three strategies to determine the location of the next Pareto optimal solution such that the uncertainty in the estimated PEF is maximally reduced. We show that an intelligent initial solution for a new Pareto optimal plan can be obtained by interpolation of fluence maps from neighbouring Pareto optimal plans. The method has been applied to a simplified clinical test case using two convex objective functions to map the trade-off between tumour dose heterogeneity and critical organ sparing. All three strategies produce representative estimates of the PEF. The new algorithm is particularly suitable for dynamic generation of Pareto optimal plans in interactive treatment planning. 4. Derivative-free generation and interpolation of convex Pareto optimal IMRT plans International Nuclear Information System (INIS) Hoffmann, Aswin L; Siem, Alex Y D; Hertog, Dick den; Kaanders, Johannes H A M; Huizenga, Henk 2006-01-01 In inverse treatment planning for intensity-modulated radiation therapy (IMRT), beamlet intensity levels in fluence maps of high-energy photon beams are optimized. Treatment plan evaluation criteria are used as objective functions to steer the optimization process. Fluence map optimization can be considered a multi-objective optimization problem, for which a set of Pareto optimal solutions exists: the Pareto efficient frontier (PEF). In this paper, a constrained optimization method is pursued to iteratively estimate the PEF up to some predefined error. We use the property that the PEF is convex for a convex optimization problem to construct piecewise-linear upper and lower bounds to approximate the PEF from a small initial set of Pareto optimal plans. A derivative-free Sandwich algorithm is presented in which these bounds are used with three strategies to determine the location of the next Pareto optimal solution such that the uncertainty in the estimated PEF is maximally reduced. We show that an intelligent initial solution for a new Pareto optimal plan can be obtained by interpolation of fluence maps from neighbouring Pareto optimal plans. The method has been applied to a simplified clinical test case using two convex objective functions to map the trade-off between tumour dose heterogeneity and critical organ sparing. All three strategies produce representative estimates of the PEF. The new algorithm is particularly suitable for dynamic generation of Pareto optimal plans in interactive treatment planning 5. 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. 6. Novel method of finding extreme edges in a convex set of N-dimension vectors Science.gov (United States) Hu, Chia-Lun J. 2001-11-01 As we published in the last few years, for a binary neural network pattern recognition system to learn a given mapping {Um mapped to Vm, m=1 to M} where um is an N- dimension analog (pattern) vector, Vm is a P-bit binary (classification) vector, the if-and-only-if (IFF) condition that this network can learn this mapping is that each i-set in {Ymi, m=1 to M} (where Ymithere existsVmiUm and Vmi=+1 or -1, is the i-th bit of VR-m).)(i=1 to P and there are P sets included here.) Is POSITIVELY, LINEARLY, INDEPENDENT or PLI. We have shown that this PLI condition is MORE GENERAL than the convexity condition applied to a set of N-vectors. In the design of old learning machines, we know that if a set of N-dimension analog vectors form a convex set, and if the machine can learn the boundary vectors (or extreme edges) of this set, then it can definitely learn the inside vectors contained in this POLYHEDRON CONE. This paper reports a new method and new algorithm to find the boundary vectors of a convex set of ND analog vectors. 7. Fourth class of convex equilateral polyhedron with polyhedral symmetry related to fullerenes and viruses. Science.gov (United States) Schein, Stan; Gayed, James Maurice 2014-02-25 The three known classes of convex polyhedron with equal edge lengths and polyhedral symmetry--tetrahedral, octahedral, and icosahedral--are the 5 Platonic polyhedra, the 13 Archimedean polyhedra--including the truncated icosahedron or soccer ball--and the 2 rhombic polyhedra reported by Johannes Kepler in 1611. (Some carbon fullerenes, inorganic cages, icosahedral viruses, geodesic structures, and protein complexes resemble these fundamental shapes.) Here we add a fourth class, "Goldberg polyhedra," which are also convex and equilateral. We begin by decorating each of the triangular facets of a tetrahedron, an octahedron, or an icosahedron with the T vertices and connecting edges of a "Goldberg triangle." We obtain the unique set of internal angles in each planar face of each polyhedron by solving a system of n equations and n variables, where the equations set the dihedral angle discrepancy about different types of edge to zero, and the variables are a subset of the internal angles in 6gons. Like the faces in Kepler's rhombic polyhedra, the 6gon faces in Goldberg polyhedra are equilateral and planar but not equiangular. We show that there is just a single tetrahedral Goldberg polyhedron, a single octahedral one, and a systematic, countable infinity of icosahedral ones, one for each Goldberg triangle. Unlike carbon fullerenes and faceted viruses, the icosahedral Goldberg polyhedra are nearly spherical. The reasoning and techniques presented here will enable discovery of still more classes of convex equilateral polyhedra with polyhedral symmetry. 8. Fusion technology 1992 International Nuclear Information System (INIS) Ferro, C.; Gasparatto, M.; Knoepfel, H. 1993-01-01 The aim of the biennial series of symposia on the title subject, organized by the European Fusion Laboratories, is the exchange of information on the design, construction and operation of fusion experiments and on the technology being developed for the next step devices and fusion reactors. The coverage of the volume includes the technological aspects of fusion reactors in relation to new developments, this forming a guideline for the definition of future work. These proceedings comprise three volumes and contain both the invited lectures and contributed papers presented at the symposium which was attended by 569 participants from around the globe. The 343 papers, including 12 invited papers, characterize the increasing interest of industry in the fusion programme, giving a broad and current overview on the progress and trends fusion technology is experiencing now, as well as indicating the future for fusion devices 9. Integration of polystyrene microlenses with both convex and concave profiles in a polymer-based microfluidic system KAUST Repository 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 10. A one-layer recurrent neural network for non-smooth convex optimization subject to linear inequality constraints International Nuclear Information System (INIS) Liu, Xiaolan; Zhou, Mi 2016-01-01 In this paper, a one-layer recurrent network is proposed for solving a non-smooth convex optimization subject to linear inequality constraints. Compared with the existing neural networks for optimization, the proposed neural network is capable of solving more general convex optimization with linear inequality constraints. The convergence of the state variables of the proposed neural network to achieve solution optimality is guaranteed as long as the designed parameters in the model are larger than the derived lower bounds. 11. Uniqueness of a pre-generator for$C_0$-semigroup on a general locally convex vector space OpenAIRE Lemle, Ludovic Dan; Wu, Liming 2007-01-01 The main purpose is to generalize a theorem of Arendt about uniqueness of$C_0$-semigroups from Banach space setting to the general locally convex vector spaces, more precisely, we show that cores are the only domains of uniqueness for$C_0$-semigroups on locally convex spaces. As an application, we find a necessary and sufficient condition for that the mass transport equation has one unique$L^1(\\R^d,dx)\$ weak solution.

12. Economics of fusion research

International Nuclear Information System (INIS)

1977-01-01

This report provides the results of a study of methods of economic analysis applied to the evaluation of fusion research. The study recognizes that a hierarchy of economic analyses of research programs exists: standard benefit-cost analysis, expected value of R and D information, and expected utility analysis. It is shown that standard benefit-cost analysis, as commonly applied to research programs, is inadequate for the evaluation of a high technology research effort such as fusion research. A methodology for performing an expected value analysis is developed and demonstrated and an overview of an approach to perform an expected utility analysis of fusion research is presented. In addition, a potential benefit of fusion research, not previously identified, is discussed and rough estimates of its magnitude are presented. This benefit deals with the effect of a fusion research program on optimal fossil fuel consumption patterns. The results of this study indicate that it is both appropriate and possible to perform an expected value analysis of fusion research in order to assess the economics of a fusion research program. The results indicate further that the major area of benefits of fusion research is likely due to the impact of a fusion research program on optimal fossil fuel consumption patterns and it is recommended that this benefit be included in future assessments of fusion research economics

13. Economics of fusion research

Energy Technology Data Exchange (ETDEWEB)

None, None

1977-10-15

This report provides the results of a study of methods of economic analysis applied to the evaluation of fusion research. The study recognizes that a hierarchy of economic analyses of research programs exists: standard benefit-cost analysis, expected value of R and D information, and expected utility analysis. It is shown that standard benefit-cost analysis, as commonly applied to research programs, is inadequate for the evaluation of a high technology research effort such as fusion research. A methodology for performing an expected value analysis is developed and demonstrated and an overview of an approach to perform an expected utility analysis of fusion research is presented. In addition, a potential benefit of fusion research, not previously identified, is discussed and rough estimates of its magnitude are presented. This benefit deals with the effect of a fusion research program on optimal fossil fuel consumption patterns. The results of this study indicate that it is both appropriate and possible to perform an expected value analysis of fusion research in order to assess the economics of a fusion research program. The results indicate further that the major area of benefits of fusion research is likely due to the impact of a fusion research program on optimal fossil fuel consumption patterns and it is recommended that this benefit be included in future assessments of fusion research economics.

14. Recycling fusion materials

International Nuclear Information System (INIS)

Ooms, L.

2005-01-01

The inherent safety and environmental advantages of fusion power in comparison with other energy sources play an important role in the public acceptance. No waste burden for future generations is therefore one of the main arguments to decide for fusion power. The waste issue has thus been studied in several documents and the final conclusion of which it is stated that there is no permanent disposal waste needed if recycling is applied. But recycling of fusion reactor materials is far to be obvious regarding mostly the very high specific activity of the materials to be handled, the types of materials and the presence of tritium. The main objective of research performed by SCK-CEN is to study the possible ways of recycling fusion materials and analyse the challenges of the materials management from fusion reactors, based on current practices used in fission reactors and the requirements for the manufacture of fusion equipment

15. The controlled thermonuclear fusion

International Nuclear Information System (INIS)

Barre, Bertrand

2014-01-01

After some generalities on particle physics, and on fusion and fission reactions, the author outlines that the fission reaction is easier to obtain than the fusion reaction, evokes the fusion which takes place in stars, and outlines the difficulty to manage and control this reaction: one of its application is the H bomb. The challenge is therefore to find a way to control this reaction and make it a steady and continuous source of energy. The author then presents the most promising way: the magnetic confinement fusion. He evokes its main issues, the already performed experiments (tokamak), and gives a larger presentation of the ITER project. Then, he evokes another way, the inertial confinement fusion, and the two main experimental installations (National Ignition Facility in Livermore, and the Laser Megajoule in Bordeaux). Finally, he gives a list of benefits and drawbacks of an industrial nuclear fusion

16. Laser fusion overview

International Nuclear Information System (INIS)

Nuckolls, J.

1976-01-01

Because of recent breakthroughs in the target area, and in the glass laser area, the scientific feasibility of laser fusion--and of inertial fusion--may be demonstrated in the early 1980's. Then the development in that time period of a suitable laser (or storage ring or other driving source) would make possible an operational inertial fusion reactor in this century. These are roughly the same time scales as projected by the Tokamak magnetic confinement approach. It thus appears that the 15-20 year earlier start by magnetic confinement fusion may be overcome. Because inertial confinement has been demonstrated, and inertial fusion reactors may operate on smaller scales than Tokamaks, laser fusion may have important technical and economic advantages

17. Synthetic fuels and fusion

Energy Technology Data Exchange (ETDEWEB)

Fillo, J A; Powell, J; Steinberg, M [Brookhaven National Lab., Upton, NY (USA)

1981-03-01

The decreasing availability of fossil fuels emphasizes the need to develop systems which will produce synthetic fuel to substitute for and supplement the natural supply. An important first step in the synthesis of liquid and gaseous fuels is the production of hydrogen. Thermonuclear fusion offers an inexhaustible source of energy for the production of hydrogen from water. Depending on design, electric generation efficiencies of approx. equal to 40-60% and hydrogen production efficiencies by high temperature electrolysis of approx. equal to 50-70% are projected for fusion reactors using high temperature blankets. Fusion/coal symbiotic systems appear economically promising for the first generation of commercial fusion synfuels plants. Coal production requirements and the environmental effects of large-scale coal usage would be greatly reduced by a fusion/coal system. In the long-term, there could be a gradual transition to an inexhaustible energy system based solely on fusion.

18. Magnetic-fusion program

International Nuclear Information System (INIS)

1980-08-01

In February 1980, the Director of Energy Research requested that the Energy Research Advisory Board (ERAB) review the Department of Energy (DOE) Magnetic Fusion Program. Of particular concern to the DOE was the judicious choice of the next major steps toward demonstration of economic power production from fusion. Of equal concern was the overall soundness of the DOE Magnetic Fusion Program: its pace, scope, and funding profiles. Their finding and recommendations are included

19. Magnetic fusion technology

CERN Document Server

Dolan, Thomas J

2014-01-01

Magnetic Fusion Technology describes the technologies that are required for successful development of nuclear fusion power plants using strong magnetic fields. These technologies include: ? magnet systems, ? plasma heating systems, ? control systems, ? energy conversion systems, ? advanced materials development, ? vacuum systems, ? cryogenic systems, ? plasma diagnostics, ? safety systems, and ? power plant design studies. Magnetic Fusion Technology will be useful to students and to specialists working in energy research.

20. Status of fusion maintenance

International Nuclear Information System (INIS)

Fuller, G.M.

1984-01-01

Effective maintenance will be an essential ingredient in determining fusion system productivity. This level of productivity will result only after close attention is paid to the entire system as an entity and appropriate integration of the elements is made. The status of fusion maintenance is reviewed in the context of the entire system. While there are many challenging developmental tasks ahead in fusion maintenance, the required technologies are available in several high-technology industries, including nuclear fission

1. Membrane fusion and exocytosis.

Science.gov (United States)

Jahn, R; Südhof, T C

1999-01-01

Membrane fusion involves the merger of two phospholipid bilayers in an aqueous environment. In artificial lipid bilayers, fusion proceeds by means of defined transition states, including hourglass-shaped intermediates in which the proximal leaflets of the fusing membranes are merged whereas the distal leaflets are separate (fusion stalk), followed by the reversible opening of small aqueous fusion pores. Fusion of biological membranes requires the action of specific fusion proteins. Best understood are the viral fusion proteins that are responsible for merging the viral with the host cell membrane during infection. These proteins undergo spontaneous and dramatic conformational changes upon activation. In the case of the paradigmatic fusion proteins of the influenza virus and of the human immunodeficiency virus, an amphiphilic fusion peptide is inserted into the target membrane. The protein then reorients itself, thus forcing the fusing membranes together and inducing lipid mixing. Fusion of intracellular membranes in eukaryotic cells involves several protein families including SNAREs, Rab proteins, and Sec1/Munc-18 related proteins (SM-proteins). SNAREs form a novel superfamily of small and mostly membrane-anchored proteins that share a common motif of about 60 amino acids (SNARE motif). SNAREs reversibly assemble into tightly packed helical bundles, the core complexes. Assembly is thought to pull the fusing membranes closely together, thus inducing fusion. SM-proteins comprise a family of soluble proteins that bind to certain types of SNAREs and prevent the formation of core complexes. Rab proteins are GTPases that undergo highly regulated GTP-GDP cycles. In their GTP form, they interact with specific proteins, the effector proteins. Recent evidence suggests that Rab proteins function in the initial membrane contact connecting the fusing membranes but are not involved in the fusion reaction itself.

2. Fusion facility siting considerations

International Nuclear Information System (INIS)

Bussell, G.T.

1985-01-01

Inherent in the fusion program's transition from hydrogen devices to commercial power machines is a general increase in the size and scope of succeeding projects. This growth will lead to increased emphasis on safety, environmental impact, and the external effects of fusion in general, and of each new device in particular. A critically important consideration in this regard is site selection. The purpose of this paper is to examine major siting issues that may affect the economics, safety, and environmental impact of fusion

3. Fusion research principles

CERN Document Server

Dolan, Thomas James

2013-01-01

Fusion Research, Volume I: Principles provides a general description of the methods and problems of fusion research. The book contains three main parts: Principles, Experiments, and Technology. The Principles part describes the conditions necessary for a fusion reaction, as well as the fundamentals of plasma confinement, heating, and diagnostics. The Experiments part details about forty plasma confinement schemes and experiments. The last part explores various engineering problems associated with reactor design, vacuum and magnet systems, materials, plasma purity, fueling, blankets, neutronics

4. Nuclear fusion power

International Nuclear Information System (INIS)

Dinghee, D.A.

1983-01-01

In this chapter, fusion is compared with other inexhaustible energy sources. Research is currently being conducted both within and outside the USA. The current confinement principles of thermonuclear reactions are reveiwed with the discussion of economics mainly focusing on the magnetic confinement concepts. Environmental, health and safety factors are of great concern to the public and measures are being taken to address them. The magnetic fusion program logic and the inertial fusion program logic are compared

5. Inertial confinement fusion (ICF)

International Nuclear Information System (INIS)

Nuckolls, J.

1977-01-01

The principal goal of the inertial confinement fusion program is the development of a practical fusion power plant in this century. Rapid progress has been made in the four major areas of ICF--targets, drivers, fusion experiments, and reactors. High gain targets have been designed. Laser, electron beam, and heavy ion accelerator drivers appear to be feasible. Record-breaking thermonuclear conditions have been experimentally achieved. Detailed diagnostics of laser implosions have confirmed predictions of the LASNEX computer program. Experimental facilities are being planned and constructed capable of igniting high gain fusion microexplosions in the mid 1980's. A low cost long lifetime reactor design has been developed

6. Inertial fusion energy

International Nuclear Information System (INIS)

Decroisette, M.; Andre, M.; Bayer, C.; Juraszek, D.; Le Garrec, B.; Deutsch, C.; Migus, A.

2005-01-01

We first recall the scientific basis of inertial fusion and then describe a generic fusion reactor with the different components: the driver, the fusion chamber, the material treatment unit, the target factory and the turbines. We analyse the options proposed at the present time for the driver and for target irradiation scheme giving the state of art for each approach. We conclude by the presentation of LMJ (laser Megajoule) and NIF (national ignition facility) projects. These facilities aim to demonstrate the feasibility of laboratory DT ignition, first step toward Inertial Fusion Energy. (authors)

7. Laser fusion program overview

International Nuclear Information System (INIS)

Emmett, J.L.

1977-01-01

This program is structured to proceed through a series of well defined fusion milestones to proof of the scientific feasibility, of laser fusion with the Shiva Nova system. Concurrently, those key technical areas, such as advanced lasers, which are required to progress beyond proof of feasibility, are being studied. We have identified and quantified the opportunities and key technical issues in military applications, such as weapons effects simulations, and in civilian applications, such as central-station electric power production. We summarize the current status and future plans for the laser fusion program at LLL, emphasizing the civilian applications of laser fusion

8. Frontiers in fusion research

CERN Document Server

Kikuchi, Mitsuru

2011-01-01

Frontiers in Fusion Research provides a systematic overview of the latest physical principles of fusion and plasma confinement. It is primarily devoted to the principle of magnetic plasma confinement, that has been systematized through 50 years of fusion research. Frontiers in Fusion Research begins with an introduction to the study of plasma, discussing the astronomical birth of hydrogen energy and the beginnings of human attempts to harness the Sun's energy for use on Earth. It moves on to chapters that cover a variety of topics such as: * charged particle motion, * plasma kinetic theory, *

9. Fusion of Nonionic Vesicles

DEFF Research Database (Denmark)

Bulut, Sanja; Oskolkova, M. Z.; Schweins, R.

2010-01-01

We present an experimental study of vesicle fusion using light and neutron scattering to monitor fusion events. Vesicles are reproducibly formed with an extrusion procedure using an single amphiphile triethylene glycol mono-n-decyl ether in water. They show long-term stability for temperatures ar...... a barrier to fusion changing from 15 k(B)T at T = 26 degrees C to 10k(H) T at T = 35 degrees C. These results are compatible with the theoretical predictions using the stalk model of vesicle fusion....

10. Fusion reactor safety

International Nuclear Information System (INIS)

1987-12-01

Nuclear fusion could soon become a viable energy source. Work in plasma physics, fusion technology and fusion safety is progressing rapidly in a number of Member States and international collaboration continues on work aiming at the demonstration of fusion power generation. Safety of fusion reactors and technological and radiological aspects of waste management are important aspects in the development and design of fusion machines. In order to provide an international forum to review and discuss the status and the progress made since 1983 in programmes related to operational safety aspects of fusion reactors, their waste management and decommissioning concepts, the IAEA had organized the Technical Committee on ''Fusion Reactor Safety'' in Culham, 3-7 November 1986. All presentations of this meeting were divided into four sessions: 1. Statements on National-International Fusion Safety Programmes (5 papers); 2. Operation and System Safety (15 papers); 3. Waste Management and Decommissioning (5 papers); 4. Environmental Impacts (6 papers). A separate abstract was prepared for each of these 31 papers. Refs, figs, tabs

11. Magnetic fusion reactor economics

International Nuclear Information System (INIS)

Krakowski, R.A.

1995-01-01

An almost primordial trend in the conversion and use of energy is an increased complexity and cost of conversion systems designed to utilize cheaper and more-abundant fuels; this trend is exemplified by the progression fossil fission → fusion. The present projections of the latter indicate that capital costs of the fusion ''burner'' far exceed any commensurate savings associated with the cheapest and most-abundant of fuels. These projections suggest competitive fusion power only if internal costs associate with the use of fossil or fission fuels emerge to make them either uneconomic, unacceptable, or both with respect to expensive fusion systems. This ''implementation-by-default'' plan for fusion is re-examined by identifying in general terms fusion power-plant embodiments that might compete favorably under conditions where internal costs (both economic and environmental) of fossil and/or fission are not as great as is needed to justify the contemporary vision for fusion power. Competitive fusion power in this context will require a significant broadening of an overly focused program to explore the physics and simbiotic technologies leading to more compact, simplified, and efficient plasma-confinement configurations that reside at the heart of an attractive fusion power plant

12. Limit of detection in the presence of instrumental and non-instrumental errors: study of the possible sources of error and application to the analysis of 41 elements at trace levels by inductively coupled plasma-mass spectrometry technique

International Nuclear Information System (INIS)

Badocco, Denis; Lavagnini, Irma; Mondin, Andrea; Tapparo, Andrea; Pastore, Paolo

2015-01-01

In this paper the detection limit was estimated when signals were affected by two error contributions, namely instrumental errors and operational-non-instrumental errors. The detection limit was theoretically obtained following the hypothesis testing schema implemented with the calibration curve methodology. The experimental calibration design was based on J standards measured I times with non-instrumental errors affecting each standard systematically but randomly among the J levels. A two-component variance regression was performed to determine the calibration curve and to define the detection limit in these conditions. The detection limit values obtained from the calibration at trace levels of 41 elements by ICP-MS resulted larger than those obtainable from a one component variance regression. The role of the reagent impurities on the instrumental errors was ascertained and taken into account. Environmental pollution was studied as source of non-instrumental errors. The environmental pollution role was evaluated by Principal Component Analysis technique (PCA) applied to a series of nine calibrations performed in fourteen months. The influence of the seasonality of the environmental pollution on the detection limit was evidenced for many elements usually present in the urban air particulate. The obtained results clearly indicated the need of using the two-component variance regression approach for the calibration of all the elements usually present in the environment at significant concentration levels. - Highlights: • Limit of detection was obtained considering a two variance component regression. • Calibration data may be affected by instrumental and operational conditions errors. • Calibration model was applied to determine 41 elements at trace level by ICP-MS. • Non instrumental errors were evidenced by PCA analysis

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

Science.gov (United States)

Youla, D C; Webb, H

1982-01-01

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

14. Incomplete fusion studies

International Nuclear Information System (INIS)

Singh, B.P.

2011-01-01

In order to study the incomplete fusion reaction dynamics at energies ≅ 4-7 MeV/nucleon, several experiments have been carried out using accelerator facilities available in India. The measurements presented here cover a wide range of projectile-target combinations and enhance significantly our knowledge about incomplete fusion reaction dynamics. Here, the three sets of measurements have been presented; (i) excitation functions, (ii) forward recoil range distributions and (iii) the spin distributions. The first evidence of these reactions has been obtained from the measurement and analysis of excitation functions for xn/αxn/2αxn-channels. The measured excitation functions have been analyzed within the framework of compound nucleus model. The results obtained indicate the occurrence of fusion incompleteness at low beam energies. However, in order to determine the relative contribution of complete and incomplete fusion reaction processes, the recoil range distributions of the heavy residues have also been measured and analyzed within the framework of breakup fusion model which confirmed the fusion incompleteness in several heavy ion reactions involving α-emitting reaction channels. Further, in order to study the role of l-values in these reactions the spin distributions of the residues populated in case of complete and incomplete channels have been measured and are found to be distinctly different. The analysis of the data on spin distribution measurements indicate that the mean values of driving input angular momenta associated with direct-α-emitting (incomplete fusion) channels are higher than that observed for fusion-evaporation xn or α-emitting (complete fusion) channels, and is found to increase with direct α-multiplicity in the forward cone. One of the important conclusions drawn in the present work is that, there is significant incomplete fusion contribution even at energies slightly above the barrier. Further, the projectile structure has been found to

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

16. An Iterative Procedure for Obtaining I-Projections onto the Intersection of Convex Sets.

Science.gov (United States)

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

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

18. Convex Optimization for the Energy Management of Hybrid Electric Vehicles Considering Engine Start and Gearshift Costs

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.

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

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

1. Convex optimization problem prototyping for image reconstruction in computed tomography with the Chambolle–Pock algorithm

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

2. An Implementable First-Order Primal-Dual Algorithm for Structured Convex Optimization

Directory of Open Access Journals (Sweden)

Feng Ma

2014-01-01

Full Text Available Many application problems of practical interest can be posed as structured convex optimization models. In this paper, we study a new first-order primaldual algorithm. The method can be easily implementable, provided that the resolvent operators of the component objective functions are simple to evaluate. We show that the proposed method can be interpreted as a proximal point algorithm with a customized metric proximal parameter. Convergence property is established under the analytic contraction framework. Finally, we verify the efficiency of the algorithm by solving the stable principal component pursuit problem.

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

Science.gov (United States)

Chi, Yuejie

2017-08-01

We consider recovering the amplitudes and locations of spikes in a point source signal from its low-pass spectrum that may suffer from missing data and arbitrary outliers. We first review and provide a unified view of several recently proposed convex relaxations that characterize and capitalize the spectral sparsity of the point source signal without discretization under the framework of atomic norms. Next we propose a new algorithm when the spikes are known a priori to be positive, motivated by applications such as neural spike sorting and fluorescence microscopy imaging. Numerical experiments are provided to demonstrate the effectiveness of the proposed approach.

4. Regularized Fractional Power Parameters for Image Denoising Based on Convex Solution of Fractional Heat Equation

Directory of Open Access Journals (Sweden)

Hamid A. Jalab

2014-01-01

Full Text Available The interest in using fractional mask operators based on fractional calculus operators has grown for image denoising. Denoising is one of the most fundamental image restoration problems in computer vision and image processing. This paper proposes an image denoising algorithm based on convex solution of fractional heat equation with regularized fractional power parameters. The performances of the proposed algorithms were evaluated by computing the PSNR, using different types of images. Experiments according to visual perception and the peak signal to noise ratio values show that the improvements in the denoising process are competent with the standard Gaussian filter and Wiener filter.

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

DEFF Research Database (Denmark)

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

2013-01-01

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

6. Log-Log Convexity of Type-Token Growth in Zipf's Systems

Science.gov (United States)

Font-Clos, Francesc; Corral, Álvaro

2015-06-01

It is traditionally assumed that Zipf's law implies the power-law growth of the number of different elements with the total number of elements in a system—the so-called Heaps' law. We show that a careful definition of Zipf's law leads to the violation of Heaps' law in random systems, with growth curves that have a convex shape in log-log scale. These curves fulfill universal data collapse that only depends on the value of Zipf's exponent. We observe that real books behave very much in the same way as random systems, despite the presence of burstiness in word occurrence. We advance an explanation for this unexpected correspondence.

7. Convexity of Ruin Probability and Optimal Dividend Strategies for a General Lévy Process

Directory of Open Access Journals (Sweden)

Chuancun Yin

2015-01-01

Full Text Available We consider the optimal dividends problem for a company whose cash reserves follow a general Lévy process with certain positive jumps and arbitrary negative jumps. The objective is to find a policy which maximizes the expected discounted dividends until the time of ruin. Under appropriate conditions, we use some recent results in the theory of potential analysis of subordinators to obtain the convexity properties of probability of ruin. We present conditions under which the optimal dividend strategy, among all admissible ones, takes the form of a barrier strategy.

8. Convexity of Ruin Probability and Optimal Dividend Strategies for a General Lévy Process

Science.gov (United States)

Yuen, Kam Chuen; Shen, Ying

2015-01-01

We consider the optimal dividends problem for a company whose cash reserves follow a general Lévy process with certain positive jumps and arbitrary negative jumps. The objective is to find a policy which maximizes the expected discounted dividends until the time of ruin. Under appropriate conditions, we use some recent results in the theory of potential analysis of subordinators to obtain the convexity properties of probability of ruin. We present conditions under which the optimal dividend strategy, among all admissible ones, takes the form of a barrier strategy. PMID:26351655

9. A Duality Theory for Non-convex Problems in the Calculus of Variations

Science.gov (United States)

Bouchitté, Guy; Fragalà, Ilaria

2018-02-01

We present a new duality theory for non-convex variational problems, under possibly mixed Dirichlet and Neumann boundary conditions. The dual problem reads nicely as a linear programming problem, and our main result states that there is no duality gap. Further, we provide necessary and sufficient optimality conditions, and we show that our duality principle can be reformulated as a min-max result which is quite useful for numerical implementations. As an example, we illustrate the application of our method to a celebrated free boundary problem. The results were announced in Bouchitté and Fragalà (C R Math Acad Sci Paris 353(4):375-379, 2015).

10. Silicon microneedle formation using modified mask designs based on convex corner undercut

Science.gov (United States)

Wilke, N.; Morrissey, A.

2007-02-01

In this work, we present microneedle fabrication using the mechanism of silicon convex corner undercutting for modified etch masks in aqueous KOH solution (29% KOH, 79 °C). The presented modified mask designs include three different shapes, as well as different compensation structures applied to a square mask shape. We have found that square mask shapes present an optimum needle structure in contrast to circular or diamond shapes. The use of compensation structures facilitates an increase in needle density of 33-50% over that otherwise achieved.

11. Oracle Inequalities for Convex Loss Functions with Non-Linear Targets

DEFF Research Database (Denmark)

Caner, Mehmet; Kock, Anders Bredahl

This paper consider penalized empirical loss minimization of convex loss functions with unknown non-linear target functions. Using the elastic net penalty we establish a finite sample oracle inequality which bounds the loss of our estimator from above with high probability. If the unknown target...... of the same order as that of the oracle. If the target is linear we give sufficient conditions for consistency of the estimated parameter vector. Next, we briefly discuss how a thresholded version of our estimator can be used to perform consistent variable selection. We give two examples of loss functions...

12. Optimal Energy Consumption in Refrigeration Systems - Modelling and Non-Convex Optimisation

DEFF Research Database (Denmark)

Hovgaard, Tobias Gybel; Larsen, Lars F. S.; Skovrup, Morten J.

2012-01-01

Supermarket refrigeration consumes substantial amounts of energy. However, due to the thermal capacity of the refrigerated goods, parts of the cooling capacity delivered can be shifted in time without deteriorating the food quality. In this study, we develop a realistic model for the energy...... consumption in super market refrigeration systems. This model is used in a Nonlinear Model Predictive Controller (NMPC) to minimise the energy used by operation of a supermarket refrigeration system. The model is non-convex and we develop a computational efficient algorithm tailored to this problem...

13. Mirror fusion--fission hybrids

International Nuclear Information System (INIS)

Lee, J.D.

1978-01-01

The fusion-fission concept and the mirror fusion-fission hybrid program are outlined. Magnetic mirror fusion drivers and blankets for hybrid reactors are discussed. Results of system analyses are presented and a reference design is described

14. Cell fusion and nuclear fusion in plants.

Science.gov (United States)

Maruyama, Daisuke; Ohtsu, Mina; Higashiyama, Tetsuya

2016-12-01

Eukaryotic cells are surrounded by a plasma membrane and have a large nucleus containing the genomic DNA, which is enclosed by a nuclear envelope consisting of the outer and inner nuclear membranes. Although these membranes maintain the identity of cells, they sometimes fuse to each other, such as to produce a zygote during sexual reproduction or to give rise to other characteristically polyploid tissues. Recent studies have demonstrated that the mechanisms of plasma membrane or nuclear membrane fusion in plants are shared to some extent with those of yeasts and animals, despite the unique features of plant cells including thick cell walls and intercellular connections. Here, we summarize the key factors in the fusion of these membranes during plant reproduction, and also focus on "non-gametic cell fusion," which was thought to be rare in plant tissue, in which each cell is separated by a cell wall. Copyright © 2016 Elsevier Ltd. All rights reserved.

15. The fusion reactor

International Nuclear Information System (INIS)

Brennan, M.H.

1974-01-01

Basic principles of the fusion reactor are outlined. Plasma heating and confinement schemes are described. These confinement systems include the linear Z pinch, magnetic mirrors and Tokamaks. A fusion reactor is described and a discussion is given of its environmental impact and its fuel situation. (R.L.)

International Nuclear Information System (INIS)

1989-08-01

A short bulletin from the National Fusion Program. Included in this issue are Canada-ITER contributions, NET Fuel Processing Loop, Bilateral Meeting for Canada-Europe, report from Tokamak de Varennes and a report from the University of Toronto on materials research for Fusion Reactors. 3 figs

International Nuclear Information System (INIS)

1991-10-01

A short bulletin from the National Fusion Program. Included in this issue is a report on the 1996 IAEA Fusion Conference site, operations at the Tokamak de Varennes including divertor pumping of impurities and pumping of carbon monoxide and methane, a discussion of the CFFTP and it's role. 1 fig

18. Energy by nuclear fusion

International Nuclear Information System (INIS)

Buende, R.; Daenner, W.; Herold, H.; Raeder, J.

1976-12-01

This report reviews the state of knowledge in a number of fields of fusion research up to autumn 1976. Section 1 gives a very brief presentation of the elementary fusion reactions, the energies delivered by them and the most basic energy balances leading to Lawson-type diagrams. Section 2 outlines the reserves and cost of lithium and deuterium, gives estimates of the total energy available from DT fusion and comments on production technology, availlability and handling of the fuels. In section 3 a survey is given of the different concepts of magnetic confinement (stellarators, tokamaks, toroidal pinches, mirror machines, two-component plasmas), of confinement by walls, gas blankets and imploding liners and, finally, of the concepts of interial confinement (laser fusion, beam fusion). The reactors designed or outlined on the basis of the tokamak, high-β, mirror, and laser fusion concepts are presented in section 4, which is followed in section 5 by a discussion of the key problems of fusion power plants. The present-day knowledge of the cost structure of fusion power plants and the sensitivity of this structure with respect to the physical and technical assumptions made is analysed in section 6. Section 7 and 8 treat the aspects of safety and environment. The problems discussed include the hazard potentials of different designs (radiological, toxicological, and with respect to stored energies), release of radioactivity, possible kinds of malfunctioning, and the environmental impact of waste heat, radiation and radioactive waste (orig.) [de

19. Fusion helps diversification

NARCIS (Netherlands)

Liang, S.; Ren, Z.; de Rijke, M.

2014-01-01

A popular strategy for search result diversification is to first retrieve a set of documents utilizing a standard retrieval method and then rerank the results. We adopt a different perspective on the problem, based on data fusion. Starting from the hypothesis that data fusion can improve performance

International Nuclear Information System (INIS)

1993-10-01

A short bulletin from the National Fusion Program highlighting in this issue a bi-lateral meeting between Canada and Japan, water and hydrogen detritiation, in-situ tokamak surface analysis, an update of CCFM/TdeV and tritium accounting Industry guidance in Fusion, fast probe for plasma-surface interaction. 4 figs

1. International fusion research council

International Nuclear Information System (INIS)

Belozerov, A.N.

1977-01-01

A brief history of the International Fusion Research Council (IFRC) is given and the minutes of the 1976 meeting in Garching are summarized. At the Garching meeting, the IFRC evaluated the quality of papers presented at recent IAEA conferences on plasma physics and controlled thermonuclear research, and made recommendations on the organization and timing of future meetings on nuclear fusion

Energy Technology Data Exchange (ETDEWEB)

NONE

1991-10-01

A short bulletin from the National Fusion Program. Included in this issue is a report on the 1996 IAEA Fusion Conference site, operations at the Tokamak de Varennes including divertor pumping of impurities and pumping of carbon monoxide and methane, a discussion of the CFFTP and its role. 1 fig.

3. Magnetic Fusion Program Plan

International Nuclear Information System (INIS)

1985-02-01

This Plan reflects the present conditions of the energy situation and is consistent with national priorities for the support of basic and applied research. It is realistic in taking advantage of the technical position that the United States has already established in fusion research to make cost-effective progress toward the development of fusion power as a future energy option

Energy Technology Data Exchange (ETDEWEB)

NONE

1989-08-01

A short bulletin from the National Fusion Program. Included in this issue are Canada-ITER contributions, NET Fuel Processing Loop, Bilateral Meeting for Canada-Europe, report from Tokamak de Varennes and a report from the University of Toronto on materials research for Fusion Reactors. 3 figs.

5. Sensor Data Fusion

DEFF Research Database (Denmark)

Plascencia, Alfredo; Stepán, Petr

2006-01-01

The main contribution of this paper is to present a sensor fusion approach to scene environment mapping as part of a Sensor Data Fusion (SDF) architecture. This approach involves combined sonar array with stereo vision readings.  Sonar readings are interpreted using probability density functions...

6. Coatings for laser fusion

International Nuclear Information System (INIS)

Lowdermilk, W.H.

1981-01-01

Optical coatings are used in lasers systems for fusion research to control beam propagation and reduce surface reflection losses. The performance of coatings is important in the design, reliability, energy output, and cost of the laser systems. Significant developments in coating technology are required for future lasers for fusion research and eventual power reactors

7. Fusion reactor materials

International Nuclear Information System (INIS)

Sethi, V.K.; Scholz, R.; Nolfi, F.V. Jr.; Turner, A.P.L.

1980-01-01

Data are given for each of the following areas: (1) effects of irradiation on fusion reactor materials, (2) hydrogen permeation and materials behavior in alloys, (3) carbon coatings for fusion applications, (4) surface damage of TiB 2 coatings under energetic D + and 4 He + irradiations, and (5) neutron dosimetry

8. The IGNITEX fusion project

International Nuclear Information System (INIS)

Carrera, R.

1987-01-01

The author discusses the recently proposed fusion ignition experiment, IGNITEX. He emphasizes the basic ideas of this concept rather than the specific details of the physics and engineering aspects of the experiment. This concept is a good example of the importance of maintaining an adequate balance between the basic scientific progress in fusion physics and the new technologies that are becoming available in order to make fusion work. The objective of the IGNITEX project is to produce and control ignited plasmas for scientific study in the simplest and least expensive way possible. Being able to study this not-yet-produced regime of plasma operation is essential to fusion research. Two years after the fission nuclear reaction was discovered, a non-self-sustained fission reaction was produced in a laboratory, and in one more year a self-sustained reaction was achieved at the University of Chicago. However, after almost forty years of fusion research, a self-sustained fusion reaction has yet not been produced in a laboratory experiment. This fact indicates the greater difficulty of the fusion experiment. Because of the difficulty involved in the production of a self-sustained fusion reaction, it is necessary to propose such an experiment with maximum ignition margins, maximum simplicity, and minimum financial risk

9. Controlled thermonuclear fusion

CERN Document Server

Bobin, Jean Louis

2014-01-01

The book is a presentation of the basic principles and main achievements in the field of nuclear fusion. It encompasses both magnetic and inertial confinements plus a few exotic mechanisms for nuclear fusion. The state-of-the-art regarding thermonuclear reactions, hot plasmas, tokamaks, laser-driven compression and future reactors is given.

10. Fusion Power Deployment

International Nuclear Information System (INIS)

Schmidt, J.A.; Ogden, J.M.

2002-01-01

Fusion power plants could be part of a future portfolio of non-carbon dioxide producing energy supplies such as wind, solar, biomass, advanced fission power, and fossil energy with carbon dioxide sequestration. In this paper, we discuss key issues that could impact fusion energy deployment during the last half of this century. These include geographic issues such as resource availability, scale issues, energy storage requirements, and waste issues. The resource needs and waste production associated with fusion deployment in the U.S. should not pose serious problems. One important feature of fusion power is the fact that a fusion power plant should be locatable within most local or regional electrical distribution systems. For this reason, fusion power plants should not increase the burden of long distance power transmission to our distribution system. In contrast to fusion power, regional factors could play an important role in the deployment of renewable resources such as wind, solar and biomass or fossil energy with CO2 sequestration. We examine the role of these regional factors and their implications for fusion power deployment

International Nuclear Information System (INIS)

1988-05-01

A short bulletin from the National Fusion Program. Included in this issue is a technical update on Tokamak de Varennes, a report on the Beatrix II Breeding Materials Test Program, the Tritium glovebox system for UPM, Saudi Arabia, a broad update of the Canadian Fusion Fuels Technology Project is also included. 1 fig

Energy Technology Data Exchange (ETDEWEB)

NONE

1990-10-01

A short bulletin from the National Fusion Program. Included in this issue is a report on Darlington`s Tritium Removal Facility, work at universities on Deuterium Diffusivity in Beryllium, Fusion Studies, confinement research and the operation of divertors at Tokamak de Varennes. 5 figs.

Energy Technology Data Exchange (ETDEWEB)

NONE

1993-10-01

A short bulletin from the National Fusion Program highlighting in this issue a bi-lateral meeting between Canada and Japan, water and hydrogen detritiation, in-situ tokamak surface analysis, an update of CCFM/TdeV and tritium accounting Industry guidance in Fusion, fast probe for plasma-surface interaction. 4 figs.

Energy Technology Data Exchange (ETDEWEB)

NONE

1988-05-01

A short bulletin from the National Fusion Program. Included in this issue is a technical update on Tokamak de Varennes, a report on the Beatrix II Breeding Materials Test Program, the Tritium glovebox system for UPM, Saudi Arabia, a broad update of the Canadian Fusion Fuels Technology Project is also included. 1 fig.

International Nuclear Information System (INIS)

1992-12-01

A short bulletin from the National Fusion Program. Included in this issue is a report on the IAEA Plasma Biasing Meeting, the new IEA program -Nuclear Technology of Fusion reactors, TFTR tritium purification system, an update by CCFM on machine additions and modifications, and news of a new compact Toroid injector at the University of Saskatchewan. 1 fig

International Nuclear Information System (INIS)

1991-05-01

A short bulletin from the National Fusion Program. Included in this issue is a report on a fusion cooperation agreement between Japan and Canada, an update at Tokamak de Varennes on plasma biasing experiments and boronization tests and a collaboration between Canada and the U.S. on a compact toroid fuelling gun. 4 figs

International Nuclear Information System (INIS)

1990-10-01

A short bulletin from the National Fusion Program. Included in this issue is a report on Darlington's Tritium Removal Facility, work at universities on Deuterium Diffusivity in Beryllium, Fusion Studies, confinement research and the operation of divertors at Tokamak de Varennes. 5 figs

18. Controlled Nuclear Fusion.

Science.gov (United States)

Glasstone, Samuel

This publication is one of a series of information booklets for the general public published by The United States Atomic Energy Commission. Among the topics discussed are: Importance of Fusion Energy; Conditions for Nuclear Fusion; Thermonuclear Reactions in Plasmas; Plasma Confinement by Magnetic Fields; Experiments With Plasmas; High-Temperature…

19. Industry's role in inertial fusion

International Nuclear Information System (INIS)

Glass, A.J.

1983-01-01

This paper is an address to the Tenth Symposium on Fusion Engineering. The speaker first addressed the subject of industry's role in inertial fusion three years earlier in 1980, outlining programs that included participation in the Shiva construction project, and the industrial participants' program set up in the laser fusion program to bring industrial scientists and engineers into the laboratory to work on laser fusion. The speaker is now the president of KMS Fusion, Inc., the primary industrial participant in the inertial fusion program. The outlook for fusion energy and the attitude of the federal government toward the fusion program is discussed

20. Towards fusion power

International Nuclear Information System (INIS)

Venkataraman, G.

1975-01-01

An attempt has been made to present general but broad review of the recent developments in the field of plasma physics and its application to fusion power. The first chapter describes the fusion reactions and fusion power systems. The second chapter deals in detail with production and behaviour of plasma, screening, oscillations, instability, energy losses, temperature effects, etc. Magnetic confinements, including pinch systems, toroidal systems such as Tokamac and stellarator, minor machine, etc. are discussed in detail in chapter III. Laser produced plasma, laser implosion and problems associated with it and future prospects are explained in chapter IV. Chapter V is devoted entirely to the various aspects of hybrid systems. The last chapter throws light on problems of fusion technology, such as plasma heating, vacuum requirements, radiation damage, choice of materials, blanket problems, hazards of fusion reactions, etc. (K.B.)