Existence of Lipschitz selections of the Steiner map

NASA Astrophysics Data System (ADS)

Bednov, B. B.; Borodin, P. A.; Chesnokova, K. V.

2018-02-01

This paper is concerned with the problem of the existence of Lipschitz selections of the Steiner map {St}_n, which associates with n points of a Banach space X the set of their Steiner points. The answer to this problem depends on the geometric properties of the unit sphere S(X) of X, its dimension, and the number n. For n≥slant 4 general conditions are obtained on the space X under which {St}_n admits no Lipschitz selection. When X is finite dimensional it is shown that, if n≥slant 4 is even, the map {St}_n has a Lipschitz selection if and only if S(X) is a finite polytope; this is not true if n≥slant 3 is odd. For n=3 the (single-valued) map {St}_3 is shown to be Lipschitz continuous in any smooth strictly-convex two-dimensional space; this ceases to be true in three-dimensional spaces. Bibliography: 21 titles.

Sensitivity of Dynamical Systems to Banach Space Parameters

DTIC Science & Technology

2005-02-13

We consider general nonlinear dynamical systems in a Banach space with dependence on parameters in a second Banach space. An abstract theoretical ... framework for sensitivity equations is developed. An application to measure dependent delay differential systems arising in a class of HIV models is presented.

Spectral dilation of L(B,H)-valued measures and its application to stationary dilation for Banach space valued processes

NASA Technical Reports Server (NTRS)

Miamee, A. G.

1988-01-01

Let B be a Banach space and H and K two Hilbert spaces. The spectral dilation of L(B,H)-valued measures is studied and it is shown that the recent results of Makagon and Salehi (1986) and Rosenberg (1982) on the dilation of L(K,H)-valued measures can be extended to hold for the general Banach space setting of L(B,H)-valued measures. These L(B,H)-valued measures are closely connected to the Banach space valued processes. This connection is recalled and as application of spectral dilation of L(B,H)-valued measures the well known stationary dilation results for scalar valued processes is extended to the case of Banach space valued processes.

Relative entropy of steering: on its definition and properties

NASA Astrophysics Data System (ADS)

Kaur, Eneet; Wilde, Mark M.

2017-11-01

In Gallego and Aolita (2015 Phys. Rev. X 5 041008), the authors proposed a definition for the relative entropy of steering and showed that the resulting quantity is a convex steering monotone. Here we advocate for a different definition for relative entropy of steering, based on well grounded concerns coming from quantum Shannon theory. We prove that this modified relative entropy of steering is a convex steering monotone. Furthermore, we establish that it is uniformly continuous and faithful, in both cases giving quantitative bounds that should be useful in applications. We also consider a restricted relative entropy of steering which is relevant for the case in which the free operations in the resource theory of steering have a more restricted form (the restricted operations could be more relevant in practical scenarios). The restricted relative entropy of steering is convex, monotone with respect to these restricted operations, uniformly continuous, and faithful.

A Fixed Point Theorem in Weak Topology for Successively Recurrent System of Set-Valued Mapping Equations and Its Applications

NASA Astrophysics Data System (ADS)

Horiuchi, Kazuo

Let us introduce n (≥ 2) mappings fi(i = 1, …, n ≡ 0) defined on reflexive real Banach spaces Xi-1 and let fi : Xi-1 → Yi be completely continuous on bounded convex closed subsets X_{i-1}^{(0)} \\\\subset X_{i-1}. Moreover, let us introduce n set-valued mappings F_i : X_{i-1} \\\\times Y_i \\\\to {\\\\cal F}_c(X_i) (the family of all non-empty compact subsets of Xi), (i=1, …, n ≡ 0). Here, we have a fixed point theorem in weak topology on the successively recurrent system of set-valued mapping equations: xi ∈ Fi(xi-1, fi(xi-1)), (i=1, …, n ≡ 0). This theorem can be applied immediately to analysis of the availability of system of circular networks of channels undergone by uncertain fluctuations and to evaluation of the tolerability of behaviors of those systems.

Interpolation Error Estimates for Mean Value Coordinates over Convex Polygons

PubMed Central

Rand, Alexander; Gillette, Andrew; Bajaj, Chandrajit

2012-01-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 π. PMID:24027379

Interpolation Error Estimates for Mean Value Coordinates over Convex Polygons.

PubMed

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

Banach Synaptic Algebras

NASA Astrophysics Data System (ADS)

Foulis, David J.; Pulmannov, Sylvia

2018-04-01

Using a representation theorem of Erik Alfsen, Frederic Schultz, and Erling Størmer for special JB-algebras, we prove that a synaptic algebra is norm complete (i.e., Banach) if and only if it is isomorphic to the self-adjoint part of a Rickart C∗-algebra. Also, we give conditions on a Banach synaptic algebra that are equivalent to the condition that it is isomorphic to the self-adjoint part of an AW∗-algebra. Moreover, we study some relationships between synaptic algebras and so-called generalized Hermitian algebras.

UNIFORM ESTIMATES FOR SOLUTIONS OF THE \\overline{\\partial}-EQUATION IN PSEUDOCONVEX POLYHEDRA

NASA Astrophysics Data System (ADS)

Sergeev, A. G.; Henkin, G. M.

1981-04-01

It is proved that the nonhomogeneous Cauchy-Riemann equation on an analytic submanifold "in general position" in a Cartesian product of strictly convex domains admits a solution with a uniform estimate. The possibility of weakening the requirement of general position in this result is investigated. Bibliography: 46 titles.

Electrode configuration for extreme-UV electrical discharge source

DOEpatents

Spence, Paul Andrew; Fornaciari, Neal Robert; Chang, Jim Jihchyun

2002-01-01

It has been demonstrated that debris generation within an electric capillary discharge source, for generating extreme ultraviolet and soft x-ray, is dependent on the magnitude and profile of the electric field that is established along the surfaces of the electrodes. An electrode shape that results in uniform electric field strength along its surface has been developed to minimize sputtering and debris generation. The electric discharge plasma source includes: (a) a body that defines a circular capillary bore that has a proximal end and a distal end; (b) a back electrode positioned around and adjacent to the distal end of the capillary bore wherein the back electrode has a channel that is in communication with the distal end and that is defined by a non-uniform inner surface which exhibits a first region which is convex, a second region which is concave, and a third region which is convex wherein the regions are viewed outwardly from the inner surface of the channel that is adjacent the distal end of the capillary bore so that the first region is closest to the distal end; (c) a front electrode positioned around and adjacent to the proximal end of the capillary bore wherein the front electrode has an opening that is communication with the proximal end and that is defined by a non-uniform inner surface which exhibits a first region which is convex, a second region which is substantially linear, and third region which is convex wherein the regions are viewed outwardly from the inner surface of the opening that is adjacent the proximal end of the capillary bore so that the first region is closest to the proximal end; and (d) a source of electric potential that is connected across the front and back electrodes.

Fabrication of long-focal-length plano-convex microlens array by combining the micro-milling and injection molding processes.

PubMed

Chen, Lei; Kirchberg, Stefan; Jiang, Bing-Yan; Xie, Lei; Jia, Yun-Long; Sun, Lei-Lei

2014-11-01

A uniform plano-convex spherical microlens array with a long focal length was fabricated by combining the micromilling and injection molding processes in this work. This paper presents a quantitative study of the injection molding process parameters on the uniformity of the height of the microlenses. The variation of the injection process parameters, i.e., barrel temperature, mold temperature, injection speed, and packing pressure, was found to have a significant effect on the uniformity of the height of the microlenses, especially the barrel temperature. The filling-to-packing switchover point is also critical to the uniformity of the height of the microlenses. The optimal uniformity was achieved when the polymer melts completely filled the mold cavity, or even a little excessively filled the cavity, during the filling stage. In addition, due to the filling resistance, the practical filling-to-packing switchover point can vary with the change of the filling processing conditions and lead to a non-negligible effect on the uniformity of the height of the microlenses. Furthermore, the effect of injection speed on the uniformity of the height of the microlenses was analyzed in detail. The results indicated that the effect of injection speed on the uniformity of the height of the microlenses is mainly attributed to the two functions of injection speed: transferring the filling-to-packing switchover point and affecting the distribution of residual flow stress in the polymer melt.

Some Analogies of the Banach Contraction Principle in Fuzzy Modular Spaces

PubMed Central

Wongkum, Kittipong; Chaipunya, Parin; Kumam, Poom

2013-01-01

We established some theorems under the aim of deriving variants of the Banach contraction principle, using the classes of inner contractions and outer contractions, on the structure of fuzzy modular spaces. PMID:23766681

The existence results and Tikhonov regularization method for generalized mixed variational inequalities in Banach spaces

NASA Astrophysics Data System (ADS)

Wang, Min

2017-06-01

This paper aims to establish the Tikhonov regularization method for generalized mixed variational inequalities in Banach spaces. For this purpose, we firstly prove a very general existence result for generalized mixed variational inequalities, provided that the mapping involved has the so-called mixed variational inequality property and satisfies a rather weak coercivity condition. Finally, we establish the Tikhonov regularization method for generalized mixed variational inequalities. Our findings extended the results for the generalized variational inequality problem (for short, GVIP( F, K)) in R^n spaces (He in Abstr Appl Anal, 2012) to the generalized mixed variational inequality problem (for short, GMVIP(F,φ , K)) in reflexive Banach spaces. On the other hand, we generalized the corresponding results for the generalized mixed variational inequality problem (for short, GMVIP(F,φ ,K)) in R^n spaces (Fu and He in J Sichuan Norm Univ (Nat Sci) 37:12-17, 2014) to reflexive Banach spaces.

QUADRATIC SERENDIPITY FINITE ELEMENTS ON POLYGONS USING GENERALIZED BARYCENTRIC COORDINATES.

PubMed

Rand, Alexander; Gillette, Andrew; Bajaj, Chandrajit

2014-01-01

We introduce a finite element construction for use on the class of convex, planar polygons and show it obtains a quadratic error convergence estimate. On a convex n -gon, our construction produces 2 n basis functions, associated in a Lagrange-like fashion to each vertex and each edge midpoint, by transforming and combining a set of n ( n + 1)/2 basis functions known to obtain quadratic convergence. The technique broadens the scope of the so-called 'serendipity' elements, previously studied only for quadrilateral and regular hexahedral meshes, by employing the theory of generalized barycentric coordinates. Uniform a priori error estimates are established over the class of convex quadrilaterals with bounded aspect ratio as well as over the class of convex planar polygons satisfying additional shape regularity conditions to exclude large interior angles and short edges. Numerical evidence is provided on a trapezoidal quadrilateral mesh, previously not amenable to serendipity constructions, and applications to adaptive meshing are discussed.

Within-wafer CD variation induced by wafer shape

NASA Astrophysics Data System (ADS)

Huang, Chi-hao; Yang, Mars; Yang, Elvis; Yang, T. H.; Chen, K. C.

2016-03-01

In order to meet the increasing storage capacity demand and reduce bit cost of NAND flash memories, 3D stacked vertical flash cell array has been proposed. In constructing 3D NAND flash memories, the bit number per unit area is increased as increasing the number of stacked layers. However, the increased number of stacked layers has made the film stress control extremely important for maintaining good process quality. The residual film stress alters the wafer shape accordingly several process impacts have been readily observed across wafer, such as film deposition non-uniformity, etch rate non-uniformity, wafer chucking error on scanner, materials coating/baking defects, overlay degradation and critical dimension (CD) non-uniformity. The residual tensile and compressive stresses on wafers will result in concave and convex wafer shapes, respectively. This study investigates within-wafer CD uniformity (CDU) associated with wafer shape change induced by the 3D NAND flash memory processes. Within-wafer CDU was correlated with several critical parameters including different wafer bow heights of concave and convex wafer shapes, photo resists with different post exposure baking (PEB) temperature sensitivities, and DoseMapper compensation. The results indicated the trend of within-wafer CDU maintains flat for convex wafer shapes with bow height up to +230um and concave wafer shapes with bow height ranging from 0 ~ -70um, while the within-wafer CDU trends up from -70um to -246um wafer bow heights. To minimize the within-wafer CD distribution induced by wafer warpage, carefully tailoring the film stack and thermal budget in the process flow for maintaining the wafer shape at CDU friendly range is indispensable and using photo-resist materials with lower PEB temperature sensitivity is also suggested. In addition, DoseMapper compensation is also an alternative to greatly suppress the within-wafer CD non-uniformity but the photo-resist profile variation induced by across-wafer PEB temperature non-uniformity attributed to wafer warpage is uncorrectable, and the photo-resist profile variation is believed to affect across-wafer etch bias uniformity to some degree.

Existence of tripled fixed points for a class of condensing operators in Banach spaces.

PubMed

Karakaya, Vatan; Bouzara, Nour El Houda; Doğan, Kadri; Atalan, Yunus

2014-01-01

We give some results concerning the existence of tripled fixed points for a class of condensing operators in Banach spaces. Further, as an application, we study the existence of solutions for a general system of nonlinear integral equations.

Realization theory and quadratic optimal controllers for systems defined over Banach and Frechet algebras

NASA Technical Reports Server (NTRS)

Byrnes, C. I.

1980-01-01

It is noted that recent work by Kamen (1979) on the stability of half-plane digital filters shows that the problem of the existence of a feedback law also arises for other Banach algebras in applications. This situation calls for a realization theory and stabilizability criteria for systems defined over Banach for Frechet algebra A. Such a theory is developed here, with special emphasis placed on the construction of finitely generated realizations, the existence of coprime factorizations for T(s) defined over A, and the solvability of the quadratic optimal control problem and the associated algebraic Riccati equation over A.

On the Solutions of a 2+1-Dimensional Model for Epitaxial Growth with Axial Symmetry

NASA Astrophysics Data System (ADS)

Lu, Xin Yang

2018-04-01

In this paper, we study the evolution equation derived by Xu and Xiang (SIAM J Appl Math 69(5):1393-1414, 2009) to describe heteroepitaxial growth in 2+1 dimensions with elastic forces on vicinal surfaces is in the radial case and uniform mobility. This equation is strongly nonlinear and contains two elliptic integrals and defined via Cauchy principal value. We will first derive a formally equivalent parabolic evolution equation (i.e., full equivalence when sufficient regularity is assumed), and the main aim is to prove existence, uniqueness and regularity of strong solutions. We will extensively use techniques from the theory of evolution equations governed by maximal monotone operators in Banach spaces.

The nonconvex multi-dimensional Riemann problem for Hamilton-Jacobi equations

NASA Technical Reports Server (NTRS)

Bardi, Martino; Osher, Stanley

1991-01-01

Simple inequalities are presented for the viscosity solution of a Hamilton-Jacobi equation in N space dimensions when neither the initial data nor the Hamiltonian need be convex (or concave). The initial data are uniformly Lipschitz and can be written as the sum of a convex function in a group of variables and a concave function in the remaining variables, therefore including the nonconvex Riemann problem. The inequalities become equalities wherever a 'maxmin' equals a 'minmax', and thus a representation formula for this problem is obtained, generalizing the classical Hopi formulas.

QUADRATIC SERENDIPITY FINITE ELEMENTS ON POLYGONS USING GENERALIZED BARYCENTRIC COORDINATES

PubMed Central

RAND, ALEXANDER; GILLETTE, ANDREW; BAJAJ, CHANDRAJIT

2013-01-01

We introduce a finite element construction for use on the class of convex, planar polygons and show it obtains a quadratic error convergence estimate. On a convex n-gon, our construction produces 2n basis functions, associated in a Lagrange-like fashion to each vertex and each edge midpoint, by transforming and combining a set of n(n + 1)/2 basis functions known to obtain quadratic convergence. The technique broadens the scope of the so-called ‘serendipity’ elements, previously studied only for quadrilateral and regular hexahedral meshes, by employing the theory of generalized barycentric coordinates. Uniform a priori error estimates are established over the class of convex quadrilaterals with bounded aspect ratio as well as over the class of convex planar polygons satisfying additional shape regularity conditions to exclude large interior angles and short edges. Numerical evidence is provided on a trapezoidal quadrilateral mesh, previously not amenable to serendipity constructions, and applications to adaptive meshing are discussed. PMID:25301974

DOE Office of Scientific and Technical Information (OSTI.GOV)

Koh, S.K.; Song, S.K.; Choi, W.K.

A Kaufman-type 5 cm convex gridded ion-beam source is characterized in terms of angle-resolved ion-beam current density and beam uniformity at various discharge currents, electromagnet currents, and acceleration potentials. {copyright} {ital 1995} {ital American} {ital Institute} {ital of} {ital Physics}.

On the perturbation of the group generalized inverse for a class of bounded operators in Banach spaces

NASA Astrophysics Data System (ADS)

Castro-González, N.; Vélez-Cerrada, J. Y.

2008-05-01

Given a bounded operator A on a Banach space X with Drazin inverse AD and index r, we study the class of group invertible bounded operators B such that I+AD(B-A) is invertible and . We show that they can be written with respect to the decomposition as a matrix operator, , where B1 and are invertible. Several characterizations of the perturbed operators are established, extending matrix results. We analyze the perturbation of the Drazin inverse and we provide explicit upper bounds of ||B#-AD|| and ||BB#-ADA||. We obtain a result on the continuity of the group inverse for operators on Banach spaces.

Linear Stochastic Differential Equations on the Dual of a Countably Hilbert Nuclear Space with Applications to Neurophysiology.

DTIC Science & Technology

1985-06-01

o - - % - , . - . 65 su JT~qo0+J I < OD e ~~ O<t<T Hence the Banach- Steinhaus theorem yields the existence of PT eg o and a constant CT>0 such that...interior(K) sup ly(s+h)[+4l < co V + e |, heK and therefore the Banach- Steinhaus theorem yields the existence of a constant CK and rK e no such that...y(h&)[TtA4Ji e e16~,V (0,t) But W- Y(4) is weakly continuous, so again the Banach- Steinhaus theorem yields the existence of a constant Ct and r e v

A Characterization of Banach Spaces Containing l1

PubMed Central

Rosenthal, Haskell P.

1974-01-01

It is proved that a Banach space contains a subspace isomorphic to l1 if (and only if) it has a bounded sequence with no weak-Cauchy subsequence. The proof yields that a sequence of subsets of a given set has a subsequence that is either convergent or Boolean independent. PMID:16592162

Banach spaces that realize minimal fillings

NASA Astrophysics Data System (ADS)

Bednov, B. B.; Borodin, P. A.

2014-04-01

It is proved that a real Banach space realizes minimal fillings for all its finite subsets (a shortest network spanning a fixed finite subset always exists and has the minimum possible length) if and only if it is a predual of L_1. The spaces L_1 are characterized in terms of Steiner points (medians). Bibliography: 25 titles.

Uniform refraction in negative refractive index materials.

PubMed

Gutiérrez, Cristian E; Stachura, Eric

2015-11-01

We study the problem of constructing an optical surface separating two homogeneous, isotropic media, one of which has a negative refractive index. In doing so, we develop a vector form of Snell's law, which is used to study surfaces possessing a certain uniform refraction property, in both the near- and far-field cases. In the near-field problem, unlike the case when both materials have positive refractive indices, we show that the resulting surfaces can be neither convex nor concave.

Representations for the Generalized Drazin Inverse of the Sum in a Banach Algebra and Its Application for Some Operator Matrices

PubMed Central

Liu, Xiaoji; Qin, Xiaolan

2015-01-01

We investigate additive properties of the generalized Drazin inverse in a Banach algebra A. We find explicit expressions for the generalized Drazin inverse of the sum a + b, under new conditions on a, b ∈ A. As an application we give some new representations for the generalized Drazin inverse of an operator matrix. PMID:25729767

Representations for the generalized Drazin inverse of the sum in a Banach algebra and its application for some operator matrices.

PubMed

Liu, Xiaoji; Qin, Xiaolan

2015-01-01

We investigate additive properties of the generalized Drazin inverse in a Banach algebra A. We find explicit expressions for the generalized Drazin inverse of the sum a + b, under new conditions on a, b ∈ A. As an application we give some new representations for the generalized Drazin inverse of an operator matrix.

Some methods for achieving more efficient performance of fuel assemblies

NASA Astrophysics Data System (ADS)

Boltenko, E. A.

2014-07-01

More efficient operation of reactor plant fuel assemblies can be achieved through the use of new technical solutions aimed at obtaining more uniform distribution of coolant over the fuel assembly section, more intense heat removal on convex heat-transfer surfaces, and higher values of departure from nucleate boiling ratio (DNBR). Technical solutions using which it is possible to obtain more intense heat removal on convex heat-transfer surfaces and higher DNBR values in reactor plant fuel assemblies are considered. An alternative heat removal arrangement is described using which it is possible to obtain a significantly higher power density in a reactor plant and essentially lower maximal fuel rod temperature.

Functional Itô versus Banach space stochastic calculus and strict solutions of semilinear path-dependent equations

NASA Astrophysics Data System (ADS)

Cosso, Andrea; Russo, Francesco

2016-11-01

Functional Itô calculus was introduced in order to expand a functional F(t,Xṡ+t,Xt) depending on time t, past and present values of the process X. Another possibility to expand F(t,Xṡ+t,Xt) consists in considering the path Xṡ+t = {Xx+t,x ∈ [-T, 0]} as an element of the Banach space of continuous functions on C([-T, 0]) and to use Banach space stochastic calculus. The aim of this paper is threefold. (1) To reformulate functional Itô calculus, separating time and past, making use of the regularization procedures which match more naturally the notion of horizontal derivative which is one of the tools of that calculus. (2) To exploit this reformulation in order to discuss the (not obvious) relation between the functional and the Banach space approaches. (3) To study existence and uniqueness of smooth solutions to path-dependent partial differential equations which naturally arise in the study of functional Itô calculus. More precisely, we study a path-dependent equation of Kolmogorov type which is related to the window process of the solution to an Itô stochastic differential equation with path-dependent coefficients. We also study a semilinear version of that equation.

Mean convergence theorems and weak laws of large numbers for weighted sums of random variables under a condition of weighted integrability

NASA Astrophysics Data System (ADS)

Ordóñez Cabrera, Manuel; Volodin, Andrei I.

2005-05-01

From the classical notion of uniform integrability of a sequence of random variables, a new concept of integrability (called h-integrability) is introduced for an array of random variables, concerning an array of constantsE We prove that this concept is weaker than other previous related notions of integrability, such as Cesàro uniform integrability [Chandra, Sankhya Ser. A 51 (1989) 309-317], uniform integrability concerning the weights [Ordóñez Cabrera, Collect. Math. 45 (1994) 121-132] and Cesàro [alpha]-integrability [Chandra and Goswami, J. Theoret. ProbabE 16 (2003) 655-669]. Under this condition of integrability and appropriate conditions on the array of weights, mean convergence theorems and weak laws of large numbers for weighted sums of an array of random variables are obtained when the random variables are subject to some special kinds of dependence: (a) rowwise pairwise negative dependence, (b) rowwise pairwise non-positive correlation, (c) when the sequence of random variables in every row is [phi]-mixing. Finally, we consider the general weak law of large numbers in the sense of Gut [Statist. Probab. Lett. 14 (1992) 49-52] under this new condition of integrability for a Banach space setting.

Improving the growth of CZT crystals for radiation detectors: a modeling perspective

NASA Astrophysics Data System (ADS)

Derby, Jeffrey J.; Zhang, Nan; Yeckel, Andrew

2012-10-01

The availability of large, single crystals of cadmium zinc telluride (CZT) with uniform properties is key to improving the performance of gamma radiation detectors fabricated from them. Towards this goal, we discuss results obtained by computational models that provide a deeper understanding of crystal growth processes and how the growth of CZT can be improved. In particular, we discuss methods that may be implemented to lessen the deleterious interactions between the ampoule wall and the growing crystal via engineering a convex solidification interface. For vertical Bridgman growth, a novel, bell-curve furnace temperature profile is predicted to achieve macroscopically convex solid-liquid interface shapes during melt growth of CZT in a multiple-zone furnace. This approach represents a significant advance over traditional gradient-freeze profiles, which always yield concave interface shapes, and static heat transfer designs, such as pedestal design, that achieve convex interfaces over only a small portion of the growth run. Importantly, this strategy may be applied to any Bridgman configuration that utilizes multiple, controllable heating zones. Realizing a convex solidification interface via this adaptive bell-curve furnace profile is postulated to result in better crystallinity and higher yields than conventional CZT growth techniques.

Display-wide influences on figure-ground perception: the case of symmetry.

PubMed

Mojica, Andrew J; Peterson, Mary A

2014-05-01

Past research has demonstrated that convex regions are increasingly likely to be perceived as figures as the number of alternating convex and concave regions in test displays increases. This region-number effect depends on both a small preexisting preference for convex over concave objects and the presence of scene characteristics (i.e., uniform fill) that allow the integration of the concave regions into a background object/surface. These factors work together to enable the percept of convex objects in front of a background. We investigated whether region-number effects generalize to another property, symmetry, whose effectiveness as a figure property has been debated. Observers reported which regions they perceived as figures in black-and-white displays with alternating symmetric/asymmetric regions. In Experiments 1 and 2, the displays had articulated outer borders that preserved the symmetry/asymmetry of the outermost regions. Region-number effects were not observed, although symmetric regions were perceived as figures more often than chance. We hypothesized that the articulated outer borders prevented fitting a background interpretation to the asymmetric regions. In Experiment 3, we used straight-edge framelike outer borders and observed region-number effects for symmetry equivalent to those observed for convexity. These results (1) show that display-wide information affects figure assignment at a border, (2) extend the evidence indicating that the ability to fit background as well as foreground interpretations is critical in figure assignment, (3) reveal that symmetry and convexity are equally effective figure cues and, (4) demonstrate that symmetry serves as a figural property only when it is close to fixation.

Decomposability of P-Cylindrical Martingales.

DTIC Science & Technology

1982-10-01

5 &P(s)f olI(Xn-Xm) f 1 P dii(f) By using the Banach- Steinhaus theorem we observe that the right side of the last inequality converges to zero as n,m...Yt Ip < ’%P(S) f 0oIXt f’-Xt f’ iP dvi(f’) m n P m n By the assumption (Xtfl)tcT converges in L p for each f’ c F’ and by the Banach- Steinhaus

Characterizations of linear sufficient statistics

NASA Technical Reports Server (NTRS)

Peters, B. C., Jr.; Reoner, R.; Decell, H. P., Jr.

1977-01-01

A surjective bounded linear operator T from a Banach space X to a Banach space Y must be a sufficient statistic for a dominated family of probability measures defined on the Borel sets of X. These results were applied, so that they characterize linear sufficient statistics for families of the exponential type, including as special cases the Wishart and multivariate normal distributions. The latter result was used to establish precisely which procedures for sampling from a normal population had the property that the sample mean was a sufficient statistic.

Seamless lamination of a concave-convex architecture with single-layer graphene.

PubMed

Park, Ji-Hoon; Lim, Taekyung; Baik, Jaeyoon; Seo, Keumyoung; Moon, Youngkwon; Park, Noejung; Shin, Hyun-Joon; Kwak, Sang Kyu; Ju, Sanghyun; Ahn, Joung Real

2015-11-21

Graphene has been used as an electrode and channel material in electronic devices because of its superior physical properties. Recently, electronic devices have changed from a planar to a complicated three-dimensional (3D) geometry to overcome the limitations of planar devices. The evolution of electronic devices requires that graphene be adaptable to a 3D substrate. Here, we demonstrate that chemical-vapor-deposited single-layer graphene can be transferred onto a silicon dioxide substrate with a 3D geometry, such as a concave-convex architecture. A variety of silicon dioxide concave-convex architectures were uniformly and seamlessly laminated with graphene using a thermal treatment. The planar graphene was stretched to cover the concave-convex architecture, and the resulting strain on the curved graphene was spatially resolved by confocal Raman spectroscopy; molecular dynamic simulations were also conducted and supported the observations. Changes in electrical resistivity caused by the spatially varying strain induced as the graphene-silicon dioxide laminate varies dimensionally from 2D to 3D were measured by using a four-point probe. The resistivity measurements suggest that the electrical resistivity can be systematically controlled by the 3D geometry of the graphene-silicon dioxide laminate. This 3D graphene-insulator laminate will broaden the range of graphene applications beyond planar structures to 3D materials.

Eshelby's problem of non-elliptical inclusions

NASA Astrophysics Data System (ADS)

Zou, Wennan; He, Qichang; Huang, Mojia; Zheng, Quanshui

2010-03-01

The Eshelby problem consists in determining the strain field of an infinite linearly elastic homogeneous medium due to a uniform eigenstrain prescribed over a subdomain, called inclusion, of the medium. The salient feature of Eshelby's solution for an ellipsoidal inclusion is that the strain tensor field inside the latter is uniform. This uniformity has the important consequence that the solution to the fundamental problem of determination of the strain field in an infinite linearly elastic homogeneous medium containing an embedded ellipsoidal inhomogeneity and subjected to remote uniform loading can be readily deduced from Eshelby's solution for an ellipsoidal inclusion upon imposing appropriate uniform eigenstrains. Based on this result, most of the existing micromechanics schemes dedicated to estimating the effective properties of inhomogeneous materials have been nevertheless applied to a number of materials of practical interest where inhomogeneities are in reality non-ellipsoidal. Aiming to examine the validity of the ellipsoidal approximation of inhomogeneities underlying various micromechanics schemes, we first derive a new boundary integral expression for calculating Eshelby's tensor field (ETF) in the context of two-dimensional isotropic elasticity. The simple and compact structure of the new boundary integral expression leads us to obtain the explicit expressions of ETF and its average for a wide variety of non-elliptical inclusions including arbitrary polygonal ones and those characterized by the finite Laurent series. In light of these new analytical results, we show that: (i) the elliptical approximation to the average of ETF is valid for a convex non-elliptical inclusion but becomes inacceptable for a non-convex non-elliptical inclusion; (ii) in general, the Eshelby tensor field inside a non-elliptical inclusion is quite non-uniform and cannot be replaced by its average; (iii) the substitution of the generalized Eshelby tensor involved in various micromechanics schemes by the average Eshelby tensor for non-elliptical inhomogeneities is in general inadmissible.

A simple smoothness indicator for the WENO scheme with adaptive order

NASA Astrophysics Data System (ADS)

Huang, Cong; Chen, Li Li

2018-01-01

The fifth order WENO scheme with adaptive order is competent for solving hyperbolic conservation laws, its reconstruction is a convex combination of a fifth order linear reconstruction and three third order linear reconstructions. Note that, on uniform mesh, the computational cost of smoothness indicator for fifth order linear reconstruction is comparable with the sum of ones for three third order linear reconstructions, thus it is too heavy; on non-uniform mesh, the explicit form of smoothness indicator for fifth order linear reconstruction is difficult to be obtained, and its computational cost is much heavier than the one on uniform mesh. In order to overcome these problems, a simple smoothness indicator for fifth order linear reconstruction is proposed in this paper.

Flattening Property and the Existence of Global Attractors in Banach Space

NASA Astrophysics Data System (ADS)

Aris, Naimah; Maharani, Sitti; Jusmawati, Massalesse; Nurwahyu, Budi

2018-03-01

This paper analyses the existence of global attractor in infinite dimensional system using flattening property. The earlier stage we show the existence of the global attractor in complete metric space by using concept of the ω-limit compact concept with measure of non-compactness methods. Then we show that the ω-limit compact concept is equivalent with the flattening property in Banach space. If we can prove there exist an absorbing set in the system and the flattening property holds, then the global attractor exist in the system.

An experimental investigation of turbulent boundary layers along curved surfaces

NASA Technical Reports Server (NTRS)

So, R. M. C.; Mellor, G. L.

1972-01-01

A curved wall tunnel was designed, and an equilibrium turbulent boundary layer was set up on the straight section preceding the curved test section. Turbulent boundary layer flows with uniform and adverse pressure distributions along convex and concave walls were investigated. Hot-wire measurements along the convex surface indicated that turbulent mixing between fluid layers was very much reduced. However, the law of the wall held and the skin friction, thus determined, correlated well with other measurements. Hot-wire measurements along the concave test wall revealed a system of longitudinal vortices inside the boundary layer and confirmed that concave curvature enhances mixing. A self-consistent set of turbulent boundary layer equations for flows along curved surfaces was derived together with a modified eddy viscosity. Solution of these equations together with the modified eddy viscosity gave results that correlated well with the present data on flows along the convex surface with arbitrary pressure distribution. However, it could only be used to predict the mean characteristics of the flow along concave walls because of the existence of the system of longitudinal vortices inside the boundary layer.

An extended UTD analysis for the scattering and diffraction from cubic polynomial strips

NASA Technical Reports Server (NTRS)

Constantinides, E. D.; Marhefka, R. J.

1993-01-01

Spline and polynomial type surfaces are commonly used in high frequency modeling of complex structures such as aircraft, ships, reflectors, etc. It is therefore of interest to develop an efficient and accurate solution to describe the scattered fields from such surfaces. An extended Uniform Geometrical Theory of Diffraction (UTD) solution for the scattering and diffraction from perfectly conducting cubic polynomial strips is derived and involves the incomplete Airy integrals as canonical functions. This new solution is universal in nature and can be used to effectively describe the scattered fields from flat, strictly concave or convex, and concave convex boundaries containing edges. The classic UTD solution fails to describe the more complicated field behavior associated with higher order phase catastrophes and therefore a new set of uniform reflection and first-order edge diffraction coefficients is derived. Also, an additional diffraction coefficient associated with a zero-curvature (inflection) point is presented. Higher order effects such as double edge diffraction, creeping waves, and whispering gallery modes are not examined. The extended UTD solution is independent of the scatterer size and also provides useful physical insight into the various scattering and diffraction processes. Its accuracy is confirmed via comparison with some reference moment method results.

A new formulation of electromagnetic wave scattering using an on-surface radiation boundary condition approach

NASA Technical Reports Server (NTRS)

Kriegsmann, Gregory A.; Taflove, Allen; Umashankar, Koradar R.

1987-01-01

A new formulation of electromagnetic wave scattering by convex, two-dimensional conducting bodies is reported. This formulation, called the on-surface radiation condition (OSRC) approach, is based upon an expansion of the radiation condition applied directly on the surface of a scatterer. It is now shown that application of a suitable radiation condition directly on the surface of a convex conducting scatterer can lead to substantial simplification of the frequency-domain integral equation for the scattered field, which is reduced to just a line integral. For the transverse magnetic case, the integrand is known explicitly. For the transverse electric case, the integrand can be easily constructed by solving an ordinary differential equation around the scatterer surface contour. Examples are provided which show that OSRC yields computed near and far fields which approach the exact results for canonical shapes such as the circular cylinder, square cylinder, and strip. Electrical sizes for the examples are ka = 5 and ka = 10. The new OSRC formulation of scattering may present a useful alternative to present integral equation and uniform high-frequency approaches for convex cylinders larger than ka = 1. Structures with edges or corners can also be analyzed, although more work is needed to incorporate the physics of singular currents at these discontinuities. Convex dielectric structures can also be treated using OSRC.

CHRR: coordinate hit-and-run with rounding for uniform sampling of constraint-based models

DOE Office of Scientific and Technical Information (OSTI.GOV)

Haraldsdóttir, Hulda S.; Cousins, Ben; Thiele, Ines

In constraint-based metabolic modelling, physical and biochemical constraints define a polyhedral convex set of feasible flux vectors. Uniform sampling of this set provides an unbiased characterization of the metabolic capabilities of a biochemical network. However, reliable uniform sampling of genome-scale biochemical networks is challenging due to their high dimensionality and inherent anisotropy. Here, we present an implementation of a new sampling algorithm, coordinate hit-and-run with rounding (CHRR). This algorithm is based on the provably efficient hit-and-run random walk and crucially uses a preprocessing step to round the anisotropic flux set. CHRR provably converges to a uniform stationary sampling distribution. Wemore » apply it to metabolic networks of increasing dimensionality. We show that it converges several times faster than a popular artificial centering hit-and-run algorithm, enabling reliable and tractable sampling of genome-scale biochemical networks.« less

CHRR: coordinate hit-and-run with rounding for uniform sampling of constraint-based models

DOE PAGES

Haraldsdóttir, Hulda S.; Cousins, Ben; Thiele, Ines; ...

2017-01-31

In constraint-based metabolic modelling, physical and biochemical constraints define a polyhedral convex set of feasible flux vectors. Uniform sampling of this set provides an unbiased characterization of the metabolic capabilities of a biochemical network. However, reliable uniform sampling of genome-scale biochemical networks is challenging due to their high dimensionality and inherent anisotropy. Here, we present an implementation of a new sampling algorithm, coordinate hit-and-run with rounding (CHRR). This algorithm is based on the provably efficient hit-and-run random walk and crucially uses a preprocessing step to round the anisotropic flux set. CHRR provably converges to a uniform stationary sampling distribution. Wemore » apply it to metabolic networks of increasing dimensionality. We show that it converges several times faster than a popular artificial centering hit-and-run algorithm, enabling reliable and tractable sampling of genome-scale biochemical networks.« less

A tensor Banach algebra approach to abstract kinetic equations

NASA Astrophysics Data System (ADS)

Greenberg, W.; van der Mee, C. V. M.

The study deals with a concrete algebraic construction providing the existence theory for abstract kinetic equation boundary-value problems, when the collision operator A is an accretive finite-rank perturbation of the identity operator in a Hilbert space H. An algebraic generalization of the Bochner-Phillips theorem is utilized to study solvability of the abstract boundary-value problem without any regulatory condition. A Banach algebra in which the convolution kernel acts is obtained explicitly, and this result is used to prove a perturbation theorem for bisemigroups, which then plays a vital role in solving the initial equations.

Method of constructing dished ion thruster grids to provide hole array spacing compensation

NASA Technical Reports Server (NTRS)

Banks, B. A. (Inventor)

1976-01-01

The center-to-center spacings of a photoresist pattern for an array of holes applied to a thin metal sheet are increased by uniformly stretching the thin metal sheet in all directions along the plane of the sheet. The uniform stretching is provided by securely clamping the periphery of the sheet and applying an annular force against the face of the sheet, within the periphery of the sheet and around the photoresist pattern. The technique is used in the construction of ion thruster grid units where the outer or downstream grid is subjected to uniform stretching prior to convex molding. The technique provides alignment of the holes of grid pairs so as to direct the ion beamlets in a direction parallel to the axis of the grid unit and thereby provide optimization of the available thrust.

On dual and three space problems for the compact approximation property

NASA Astrophysics Data System (ADS)

Choi, Changsun; Kim, Ju Myung

2006-11-01

We introduce the properties W*D and BW*D for the dual space of a Banach space. And then solve the dual problem for the compact approximation property (CAP): if X* has the CAP and the W*D, then X has the CAP. Also, we solve the three space problem for the CAP: for example, if M is a closed subspace of a Banach space such that M[perpendicular] is complemented in X* and X* has the W*D, then X has the CAP whenever X/M has the CAP and M has the bounded CAP. Corresponding problems for the bounded compact approximation property are also addressed.

Common fixed points in best approximation for Banach operator pairs with Ciric type I-contractions

NASA Astrophysics Data System (ADS)

Hussain, N.

2008-02-01

The common fixed point theorems, similar to those of Ciric [Lj.B. Ciric, On a common fixed point theorem of a Gregus type, Publ. Inst. Math. (Beograd) (N.S.) 49 (1991) 174-178; Lj.B. Ciric, On Diviccaro, Fisher and Sessa open questions, Arch. Math. (Brno) 29 (1993) 145-152; Lj.B. Ciric, On a generalization of Gregus fixed point theorem, Czechoslovak Math. J. 50 (2000) 449-458], Fisher and Sessa [B. Fisher, S. Sessa, On a fixed point theorem of Gregus, Internat. J. Math. Math. Sci. 9 (1986) 23-28], Jungck [G. Jungck, On a fixed point theorem of Fisher and Sessa, Internat. J. Math. Math. Sci. 13 (1990) 497-500] and Mukherjee and Verma [R.N. Mukherjee, V. Verma, A note on fixed point theorem of Gregus, Math. Japon. 33 (1988) 745-749], are proved for a Banach operator pair. As applications, common fixed point and approximation results for Banach operator pair satisfying Ciric type contractive conditions are obtained without the assumption of linearity or affinity of either T or I. Our results unify and generalize various known results to a more general class of noncommuting mappings.

Synchronization Control of Neural Networks With State-Dependent Coefficient Matrices.

PubMed

Zhang, Junfeng; Zhao, Xudong; Huang, Jun

2016-11-01

This brief is concerned with synchronization control of a class of neural networks with state-dependent coefficient matrices. Being different from the existing drive-response neural networks in the literature, a novel model of drive-response neural networks is established. The concepts of uniformly ultimately bounded (UUB) synchronization and convex hull Lyapunov function are introduced. Then, by using the convex hull Lyapunov function approach, the UUB synchronization design of the drive-response neural networks is proposed, and a delay-independent control law guaranteeing the bounded synchronization of the neural networks is constructed. All present conditions are formulated in terms of bilinear matrix inequalities. By comparison, it is shown that the neural networks obtained in this brief are less conservative than those ones in the literature, and the bounded synchronization is suitable for the novel drive-response neural networks. Finally, an illustrative example is given to verify the validity of the obtained results.

Survey on nonlocal games and operator space theory

DOE Office of Scientific and Technical Information (OSTI.GOV)

Palazuelos, Carlos, E-mail: cpalazue@mat.ucm.es; Vidick, Thomas, E-mail: vidick@cms.caltech.edu

This review article is concerned with a recently uncovered connection between operator spaces, a noncommutative extension of Banach spaces, and quantum nonlocality, a striking phenomenon which underlies many of the applications of quantum mechanics to information theory, cryptography, and algorithms. Using the framework of nonlocal games, we relate measures of the nonlocality of quantum mechanics to certain norms in the Banach and operator space categories. We survey recent results that exploit this connection to derive large violations of Bell inequalities, study the complexity of the classical and quantum values of games and their relation to Grothendieck inequalities, and quantify themore » nonlocality of different classes of entangled states.« less

Generalized Browder's and Weyl's theorems for Banach space operators

NASA Astrophysics Data System (ADS)

Curto, Raúl E.; Han, Young Min

2007-12-01

We find necessary and sufficient conditions for a Banach space operator T to satisfy the generalized Browder's theorem. We also prove that the spectral mapping theorem holds for the Drazin spectrum and for analytic functions on an open neighborhood of [sigma](T). As applications, we show that if T is algebraically M-hyponormal, or if T is algebraically paranormal, then the generalized Weyl's theorem holds for f(T), where f[set membership, variant]H((T)), the space of functions analytic on an open neighborhood of [sigma](T). We also show that if T is reduced by each of its eigenspaces, then the generalized Browder's theorem holds for f(T), for each f[set membership, variant]H([sigma](T)).

Well-posedness of nonlocal parabolic differential problems with dependent operators.

PubMed

Ashyralyev, Allaberen; Hanalyev, Asker

2014-01-01

The nonlocal boundary value problem for the parabolic differential equation v'(t) + A(t)v(t) = f(t) (0 ≤ t ≤ T), v(0) = v(λ) + φ, 0 < λ ≤ T in an arbitrary Banach space E with the dependent linear positive operator A(t) is investigated. The well-posedness of this problem is established in Banach spaces C 0 (β,γ) (E α-β ) of all E α-β -valued continuous functions φ(t) on [0, T] satisfying a Hölder condition with a weight (t + τ)(γ). New Schauder type exact estimates in Hölder norms for the solution of two nonlocal boundary value problems for parabolic equations with dependent coefficients are established.

Task reports on developing techniques for scattering by 3D composite structures and to generate new solutions in diffraction theory using higher order boundary conditions

NASA Technical Reports Server (NTRS)

Volakis, John L.

1991-01-01

There are two tasks described in this report. First, an extension of a two dimensional formulation is presented for a three dimensional body of revolution. A Fourier series expansion of the vector electric and magnetic fields is employed to reduce the dimensionality of the system, and an exact boundary condition is employed to terminate the mesh. The mesh termination boundary is chosen such that it leads to convolutional boundary operators for low O(n) memory demand. Second, rigorous uniform geometrical theory of diffraction (UTD) diffraction coefficients are presented for a coated convex cylinder simulated with generalized impedance boundary conditions. Ray solutions are obtained which remain valid in the transition region and reduce uniformly those in the deep lit and shadow regions. A uniform asymptotic solution is also presented for observations in the close vicinity of the cylinder.

Optimization of spatiotemporally fractionated radiotherapy treatments with bounds on the achievable benefit

NASA Astrophysics Data System (ADS)

Gaddy, Melissa R.; Yıldız, Sercan; Unkelbach, Jan; Papp, Dávid

2018-01-01

Spatiotemporal fractionation schemes, that is, treatments delivering different dose distributions in different fractions, can potentially lower treatment side effects without compromising tumor control. This can be achieved by hypofractionating parts of the tumor while delivering approximately uniformly fractionated doses to the surrounding tissue. Plan optimization for such treatments is based on biologically effective dose (BED); however, this leads to computationally challenging nonconvex optimization problems. Optimization methods that are in current use yield only locally optimal solutions, and it has hitherto been unclear whether these plans are close to the global optimum. We present an optimization framework to compute rigorous bounds on the maximum achievable normal tissue BED reduction for spatiotemporal plans. The approach is demonstrated on liver tumors, where the primary goal is to reduce mean liver BED without compromising any other treatment objective. The BED-based treatment plan optimization problems are formulated as quadratically constrained quadratic programming (QCQP) problems. First, a conventional, uniformly fractionated reference plan is computed using convex optimization. Then, a second, nonconvex, QCQP model is solved to local optimality to compute a spatiotemporally fractionated plan that minimizes mean liver BED, subject to the constraints that the plan is no worse than the reference plan with respect to all other planning goals. Finally, we derive a convex relaxation of the second model in the form of a semidefinite programming problem, which provides a rigorous lower bound on the lowest achievable mean liver BED. The method is presented on five cases with distinct geometries. The computed spatiotemporal plans achieve 12-35% mean liver BED reduction over the optimal uniformly fractionated plans. This reduction corresponds to 79-97% of the gap between the mean liver BED of the uniform reference plans and our lower bounds on the lowest achievable mean liver BED. The results indicate that spatiotemporal treatments can achieve substantial reductions in normal tissue dose and BED, and that local optimization techniques provide high-quality plans that are close to realizing the maximum potential normal tissue dose reduction.

Reduced depth inversion illusions in schizophrenia are state-specific and occur for multiple object types and viewing conditions.

PubMed

Keane, Brian P; Silverstein, Steven M; Wang, Yushi; Papathomas, Thomas V

2013-05-01

Schizophrenia patients are less susceptible to depth inversion illusions (DIIs) in which concave faces appear as convex, but what stimulus attributes generate this effect and how does it vary with clinical state? To address these issues, we had 30 schizophrenia patients and 25 well-matched healthy controls make convexity judgments on physically concave faces and scenes. Patients were selectively sampled from three levels of care to ensure symptom heterogeneity. Half of the concave objects were painted with realistic texture to enhance the convexity illusion; the remaining objects were painted uniform beige to reduce the illusion. Subjects viewed the objects with one eye while laterally moving in front of the stimulus (to see depth via motion parallax) or with two eyes while remaining motionless (to see depth stereoscopically). For each group, DIIs were stronger with texture than without, and weaker with stereoscopic information than without, indicating that patients responded normally to stimulus alterations. More importantly, patients experienced fewer illusions than controls irrespective of the face/scene category, texture, or viewing condition (parallax/stereo). Illusions became less frequent as patients experienced more positive symptoms and required more structured treatment. Taken together, these results indicate that people with schizophrenia experience fewer DIIs with a variety of object types and viewing conditions, perhaps because of a lessened tendency to construe any type of object as convex. Moreover, positive symptoms and the need for structured treatment are associated with more accurate 3-D perception, suggesting that DII may serve as a state marker for the illness. © 2013 American Psychological Association

Nonlocal continuum analysis of a nonlinear uniaxial elastic lattice system under non-uniform axial load

NASA Astrophysics Data System (ADS)

Hérisson, Benjamin; Challamel, Noël; Picandet, Vincent; Perrot, Arnaud

2016-09-01

The static behavior of the Fermi-Pasta-Ulam (FPU) axial chain under distributed loading is examined. The FPU system examined in the paper is a nonlinear elastic lattice with linear and quadratic spring interaction. A dimensionless parameter controls the possible loss of convexity of the associated quadratic and cubic energy. Exact analytical solutions based on Hurwitz zeta functions are developed in presence of linear static loading. It is shown that this nonlinear lattice possesses scale effects and possible localization properties in the absence of energy convexity. A continuous approach is then developed to capture the main phenomena observed regarding the discrete axial problem. The associated continuum is built from a continualization procedure that is mainly based on the asymptotic expansion of the difference operators involved in the lattice problem. This associated continuum is an enriched gradient-based or nonlocal axial medium. A Taylor-based and a rational differential method are both considered in the continualization procedures to approximate the FPU lattice response. The Padé approximant used in the continualization procedure fits the response of the discrete system efficiently, even in the vicinity of the limit load when the non-convex FPU energy is examined. It is concluded that the FPU lattice system behaves as a nonlocal axial system in dynamic but also static loading.

Banach Gelfand Triples for Applications in Physics and Engineering

NASA Astrophysics Data System (ADS)

Feichtinger, Hans G.

2009-07-01

The principle of extension is widespread within mathematics. Starting from simple objects one constructs more sophisticated ones, with a kind of natural embedding from the set of old objects to the new, enlarged set. Usually a set of operations on the old set can still be carried out, but maybe also some new ones. Done properly one obtains more completed objects of a similar kind, with additional useful properties. Let us give a simple example: While multiplication and addition can be done exactly and perfectly in the setting of Q, the rational numbers, the field R of real numbers has the advantage of being complete (Cauchy sequences have a limit…) and hence allowing for numbers like π or √2 . Finally the even "more complicated" field C of complex numbers allows to find solutions to equations like z2 = -1. The chain of inclusions of fields, Q⊂R⊂C is a good motivating example in the domain of "numbers." The main subject of the present survey-type article is a new theory of Banach Gelfand triples (BGTs), providing a similar setting in the context of (generalized) functions. Test functions are the simple objects, elements of the Hilbert space L2(Rd) are well suited in order to describe concepts of orthogonality, and they can be approximated to any given precision (in the ‖ṡ‖2-norm) by test functions. Finally one needs an even larger (Banach) space of generalized functions resp. distributions, containing among others pure frequencies and Dirac measures in order to describe various mappings between such Banach Gelfand triples in terms of the most important "elementary building blocks," in a clear analogy to the finite/discrete setting (where Dirac measures correspond to unit vectors). Our concrete Banach Gelfand triple is based on the Segal algebra S0(Rd), which coincides with the modulation space M1(Rd) = M01,1(Rd), and plays a very important and natural role for time-frequency analysis. We will point out that it provides the appropriate setting for a description of many problems in engineering or physics, including the classical Fourier transform or the Kohn-Nirenberg or Weyl calculus for pseudo-differential operators. Particular emphasis will be given to the concept of w*-convergence and w*-continuity of operators which allows to prove conceptual uniqueness results, and to give a correct interpretation to certain formal expressions coming up in various versions of the Dirac formalism.

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

PubMed

González, Juan C

2009-04-10

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

A Bifurcation Problem for a Nonlinear Partial Differential Equation of Parabolic Type,

DTIC Science & Technology

NONLINEAR DIFFERENTIAL EQUATIONS, INTEGRATION), (*PARTIAL DIFFERENTIAL EQUATIONS, BOUNDARY VALUE PROBLEMS), BANACH SPACE , MAPPING (TRANSFORMATIONS), SET THEORY, TOPOLOGY, ITERATIONS, STABILITY, THEOREMS

Davidenko’s Method for the Solution of Nonlinear Operator Equations.

DTIC Science & Technology

NONLINEAR DIFFERENTIAL EQUATIONS, NUMERICAL INTEGRATION), OPERATORS(MATHEMATICS), BANACH SPACE , MAPPING (TRANSFORMATIONS), NUMERICAL METHODS AND PROCEDURES, INTEGRALS, SET THEORY, CONVERGENCE, MATRICES(MATHEMATICS)

Multidirectional hybrid algorithm for the split common fixed point problem and application to the split common null point problem.

PubMed

Li, Xia; Guo, Meifang; Su, Yongfu

2016-01-01

In this article, a new multidirectional monotone hybrid iteration algorithm for finding a solution to the split common fixed point problem is presented for two countable families of quasi-nonexpansive mappings in Banach spaces. Strong convergence theorems are proved. The application of the result is to consider the split common null point problem of maximal monotone operators in Banach spaces. Strong convergence theorems for finding a solution of the split common null point problem are derived. This iteration algorithm can accelerate the convergence speed of iterative sequence. The results of this paper improve and extend the recent results of Takahashi and Yao (Fixed Point Theory Appl 2015:87, 2015) and many others .

Spectral methods in edge-diffraction theories

DOE Office of Scientific and Technical Information (OSTI.GOV)

Arnold, J.M.

Spectral methods for the construction of uniform asymptotic representations of the field diffracted by an aperture in a plane screen are reviewed. These are separated into contrasting approaches, roughly described as physical and geometrical. It is concluded that the geometrical methods provide a direct route to the construction of uniform representations that are formally identical to the equivalent-edge-current concept. Some interpretive and analytical difficulties that complicate the physical methods of obtaining uniform representations are analyzed. Spectral synthesis proceeds directly from the ray geometry and diffraction coefficients, without any intervening current representation, and the representation is uniform at shadow boundaries andmore » caustics of the diffracted field. The physical theory of diffraction postulates currents on the diffracting screen that give rise to the diffracted field. The difficulties encountered in evaluating the current integrals are throughly examined, and it is concluded that the additional data provided by the physical theory of diffraction (diffraction coefficients off the Keller diffraction cone) are not actually required for obtaining uniform asymptotics at the leading order. A new diffraction representation that generalizes to arbitrary plane-convex apertures a formula given by Knott and Senior [Proc. IEEE 62, 1468 (1974)] for circular apertures is deduced. 34 refs., 1 fig.« less

CHRR: coordinate hit-and-run with rounding for uniform sampling of constraint-based models.

PubMed

Haraldsdóttir, Hulda S; Cousins, Ben; Thiele, Ines; Fleming, Ronan M T; Vempala, Santosh

2017-06-01

In constraint-based metabolic modelling, physical and biochemical constraints define a polyhedral convex set of feasible flux vectors. Uniform sampling of this set provides an unbiased characterization of the metabolic capabilities of a biochemical network. However, reliable uniform sampling of genome-scale biochemical networks is challenging due to their high dimensionality and inherent anisotropy. Here, we present an implementation of a new sampling algorithm, coordinate hit-and-run with rounding (CHRR). This algorithm is based on the provably efficient hit-and-run random walk and crucially uses a preprocessing step to round the anisotropic flux set. CHRR provably converges to a uniform stationary sampling distribution. We apply it to metabolic networks of increasing dimensionality. We show that it converges several times faster than a popular artificial centering hit-and-run algorithm, enabling reliable and tractable sampling of genome-scale biochemical networks. https://github.com/opencobra/cobratoolbox . ronan.mt.fleming@gmail.com or vempala@cc.gatech.edu. Supplementary data are available at Bioinformatics online. © The Author 2017. Published by Oxford University Press.

Scattering from thin dielectric straps surrounding a perfectly conducting structure

NASA Technical Reports Server (NTRS)

Al-Hekail, Zeyad; Gupta, Inder J.

1989-01-01

A method to calculate the electromagnetic scattered fields from a dielectric strap wrapped around convex, conducting structure is presented. A moment method technique is used to find the current excited within the strap by the incident plane wave. Then, Uniform Geometrical Theory of Diffraction (UTD) is used to compute the fields scattered by the strap. Reasonable agreement was obtained between the computed and the measured results. The results found in this study are useful in evaluating straps as a target support structure for scattering measurements.

Fabrication of large diffractive optical elements in thick film on a concave lens surface.

PubMed

Xie, Yongjun; Lu, Zhenwu; Li, Fengyou

2003-05-05

We demonstrate experimentally the technique of fabricating large diffractive optical elements (DOEs) in thick film on a concave lens surface (mirrors) with precise alignment by using the strategy of double exposure. We adopt the method of double exposure to overcome the difficulty of processing thick photoresist on a large curved substrate. A uniform thick film with arbitrary thickness on a concave lens can be obtained with this technique. We fabricate a large concentric circular grating with a 10-ìm period on a concave lens surface in film with a thickness of 2.0 ìm after development. It is believed that this technique can also be used to fabricate larger DOEs in thicker film on the concave or convex lens surface with precise alignment. There are other potential applications of this technique, such as fabrication of micro-optoelectromechanical systems (MOEMS) or microelectromechanical systems (MEMS) and fabrication of microlens arrays on a large concave lens surface or convex lens surface with precise alignment.

Uniform magnetic fields in density-functional theory

NASA Astrophysics Data System (ADS)

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

2018-01-01

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

Uniform magnetic fields in density-functional theory.

PubMed

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

2018-01-14

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

Four-mirror extreme ultraviolet (EUV) lithography projection system

DOEpatents

Cohen, Simon J; Jeong, Hwan J; Shafer, David R

2000-01-01

The invention is directed to a four-mirror catoptric projection system for extreme ultraviolet (EUV) lithography to transfer a pattern from a reflective reticle to a wafer substrate. In order along the light path followed by light from the reticle to the wafer substrate, the system includes a dominantly hyperbolic convex mirror, a dominantly elliptical concave mirror, spherical convex mirror, and spherical concave mirror. The reticle and wafer substrate are positioned along the system's optical axis on opposite sides of the mirrors. The hyperbolic and elliptical mirrors are positioned on the same side of the system's optical axis as the reticle, and are relatively large in diameter as they are positioned on the high magnification side of the system. The hyperbolic and elliptical mirrors are relatively far off the optical axis and hence they have significant aspherical components in their curvatures. The convex spherical mirror is positioned on the optical axis, and has a substantially or perfectly spherical shape. The spherical concave mirror is positioned substantially on the opposite side of the optical axis from the hyperbolic and elliptical mirrors. Because it is positioned off-axis to a degree, the spherical concave mirror has some asphericity to counter aberrations. The spherical concave mirror forms a relatively large, uniform field on the wafer substrate. The mirrors can be tilted or decentered slightly to achieve further increase in the field size.

The Laplace method for probability measures in Banach spaces

NASA Astrophysics Data System (ADS)

Piterbarg, V. I.; Fatalov, V. R.

1995-12-01

Contents §1. Introduction Chapter I. Asymptotic analysis of continual integrals in Banach space, depending on a large parameter §2. The large deviation principle and logarithmic asymptotics of continual integrals §3. Exact asymptotics of Gaussian integrals in Banach spaces: the Laplace method 3.1. The Laplace method for Gaussian integrals taken over the whole Hilbert space: isolated minimum points ([167], I) 3.2. The Laplace method for Gaussian integrals in Hilbert space: the manifold of minimum points ([167], II) 3.3. The Laplace method for Gaussian integrals in Banach space ([90], [174], [176]) 3.4. Exact asymptotics of large deviations of Gaussian norms §4. The Laplace method for distributions of sums of independent random elements with values in Banach space 4.1. The case of a non-degenerate minimum point ([137], I) 4.2. A degenerate isolated minimum point and the manifold of minimum points ([137], II) §5. Further examples 5.1. The Laplace method for the local time functional of a Markov symmetric process ([217]) 5.2. The Laplace method for diffusion processes, a finite number of non-degenerate minimum points ([116]) 5.3. Asymptotics of large deviations for Brownian motion in the Hölder norm 5.4. Non-asymptotic expansion of a strong stable law in Hilbert space ([41]) Chapter II. The double sum method - a version of the Laplace method in the space of continuous functions §6. Pickands' method of double sums 6.1. General situations 6.2. Asymptotics of the distribution of the maximum of a Gaussian stationary process 6.3. Asymptotics of the probability of a large excursion of a Gaussian non-stationary process §7. Probabilities of large deviations of trajectories of Gaussian fields 7.1. Homogeneous fields and fields with constant dispersion 7.2. Finitely many maximum points of dispersion 7.3. Manifold of maximum points of dispersion 7.4. Asymptotics of distributions of maxima of Wiener fields §8. Exact asymptotics of large deviations of the norm of Gaussian vectors and processes with values in the spaces L_k^p and l^2. Gaussian fields with the set of parameters in Hilbert space 8.1 Exact asymptotics of the distribution of the l_k^p-norm of a Gaussian finite-dimensional vector with dependent coordinates, p > 1 8.2. Exact asymptotics of probabilities of high excursions of trajectories of processes of type \\chi^2 8.3. Asymptotics of the probabilities of large deviations of Gaussian processes with a set of parameters in Hilbert space [74] 8.4. Asymptotics of distributions of maxima of the norms of l^2-valued Gaussian processes 8.5. Exact asymptotics of large deviations for the l^2-valued Ornstein-Uhlenbeck process Bibliography

Ultimate boundedness stability and controllability of hereditary systems

NASA Technical Reports Server (NTRS)

Chukwu, E. N.

1979-01-01

By generalizing the Liapunov-Yoshizawa techniques, necessary and sufficient conditions are given for uniform boundedness and uniform ultimate boundedness of a rather general class of nonlinear differential equations of neutral type. Among the applications treated by the methods are the Lienard equation of neutral type and hereditary systems of Lurie type. The absolute stability of this later equation is also investigated. A certain existence result of a solution of a neutral functional differential inclusion with two point boundary values is applied to study the exact function space controllability of a nonlinear neutral functional differential control system. A geometric growth condition is used to characterize both the function space and Euclidean controllability of another nonlinear delay system which has a compact and convex control set. This yields conditions under which perturbed nonlinear delay controllable systems are controllable.

A new convexity measure for polygons.

PubMed

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.

Operator algebra as an application of logarithmic representation of infinitesimal generators

NASA Astrophysics Data System (ADS)

Iwata, Yoritaka

2018-02-01

The operator algebra is introduced based on the framework of logarithmic representation of infinitesimal generators. In conclusion a set of generally-unbounded infinitesimal generators is characterized as a module over the Banach algebra.

On conditions for invertibility of difference and differential operators in weight spaces

NASA Astrophysics Data System (ADS)

Bichegkuev, Mairbek S.

2011-08-01

We obtain necessary and sufficient conditions for the invertibility of the difference operator D_E\\colon D(D_E)\\subset l^p_\\alpha \\to l^p_\\alpha, (D_E x)(n)=x(n+1)-Bx(n), n\\in {Z}_+, whose domain D(D_E) is given by the condition x(0)\\in E, where l^p_\\alpha=l^p_\\alpha({Z}_+,X), p\\in \\lbrack 1,\\infty \\rbrack , is the Banach space of sequences (of vectors in a Banach space X) summable with weight \\alpha\\colon{Z}_+\\to (0,\\infty) for p\\in \\lbrack 1,\\infty) and bounded with respect to \\alpha for p=\\infty, B\\colon X\\to X is a bounded linear operator, and E is a closed B-invariant subspace of X. We give applications to the invertibility of differential operators with an unbounded operator coefficient (the generator of a strongly continuous operator semigroup) in weight spaces of functions.

Hypercyclic subspaces for Frechet space operators

NASA Astrophysics Data System (ADS)

Petersson, Henrik

2006-07-01

A continuous linear operator is hypercyclic if there is an such that the orbit {Tnx} is dense, and such a vector x is said to be hypercyclic for T. Recent progress show that it is possible to characterize Banach space operators that have a hypercyclic subspace, i.e., an infinite dimensional closed subspace of, except for zero, hypercyclic vectors. The following is known to hold: A Banach space operator T has a hypercyclic subspace if there is a sequence (ni) and an infinite dimensional closed subspace such that T is hereditarily hypercyclic for (ni) and Tni->0 pointwise on E. In this note we extend this result to the setting of Frechet spaces that admit a continuous norm, and study some applications for important function spaces. As an application we also prove that any infinite dimensional separable Frechet space with a continuous norm admits an operator with a hypercyclic subspace.

Solvability of some partial functional integrodifferential equations with finite delay and optimal controls in Banach spaces.

PubMed

Ezzinbi, Khalil; Ndambomve, Patrice

2016-01-01

In this work, we consider the control system governed by some partial functional integrodifferential equations with finite delay in Banach spaces. We assume that the undelayed part admits a resolvent operator in the sense of Grimmer. Firstly, some suitable conditions are established to guarantee the existence and uniqueness of mild solutions for a broad class of partial functional integrodifferential infinite dimensional control systems. Secondly, it is proved that, under generally mild conditions of cost functional, the associated Lagrange problem has an optimal solution, and that for each optimal solution there is a minimizing sequence of the problem that converges to the optimal solution with respect to the trajectory, the control, and the functional in appropriate topologies. Our results extend and complement many other important results in the literature. Finally, a concrete example of application is given to illustrate the effectiveness of our main results.

Independent functions and the geometry of Banach spaces

NASA Astrophysics Data System (ADS)

Astashkin, Sergey V.; Sukochev, Fedor A.

2010-12-01

The main objective of this survey is to present the `state of the art' of those parts of the theory of independent functions which are related to the geometry of function spaces. The `size' of a sum of independent functions is estimated in terms of classical moments and also in terms of general symmetric function norms. The exposition is centred on the Rosenthal inequalities and their various generalizations and sharp conditions under which the latter hold. The crucial tool here is the recently developed construction of the Kruglov operator. The survey also provides a number of applications to the geometry of Banach spaces. In particular, variants of the classical Khintchine-Maurey inequalities, isomorphisms between symmetric spaces on a finite interval and on the semi-axis, and a description of the class of symmetric spaces with any sequence of symmetrically and identically distributed independent random variables spanning a Hilbert subspace are considered. Bibliography: 87 titles.

[Design method of convex master gratings for replicating flat-field concave gratings].

PubMed

Zhou, Qian; Li, Li-Feng

2009-08-01

Flat-field concave diffraction grating is the key device of a portable grating spectrometer with the advantage of integrating dispersion, focusing and flat-field in a single device. It directly determines the quality of a spectrometer. The most important two performances determining the quality of the spectrometer are spectral image quality and diffraction efficiency. The diffraction efficiency of a grating depends mainly on its groove shape. But it has long been a problem to get a uniform predetermined groove shape across the whole concave grating area, because the incident angle of the ion beam is restricted by the curvature of the concave substrate, and this severely limits the diffraction efficiency and restricts the application of concave gratings. The authors present a two-step method for designing convex gratings, which are made holographically with two exposure point sources placed behind a plano-convex transparent glass substrate, to solve this problem. The convex gratings are intended to be used as the master gratings for making aberration-corrected flat-field concave gratings. To achieve high spectral image quality for the replicated concave gratings, the refraction effect at the planar back surface and the extra optical path lengths through the substrate thickness experienced by the two divergent recording beams are considered during optimization. This two-step method combines the optical-path-length function method and the ZEMAX software to complete the optimization with a high success rate and high efficiency. In the first step, the optical-path-length function method is used without considering the refraction effect to get an approximate optimization result. In the second step, the approximate result of the first step is used as the initial value for ZEMAX to complete the optimization including the refraction effect. An example of design problem was considered. The simulation results of ZEMAX proved that the spectral image quality of a replicated concave grating is comparable with that of a directly recorded concave grating.

A sequential solution for anisotropic total variation image denoising with interval constraints

NASA Astrophysics Data System (ADS)

Xu, Jingyan; Noo, Frédéric

2017-09-01

We show that two problems involving the anisotropic total variation (TV) and interval constraints on the unknown variables admit, under some conditions, a simple sequential solution. Problem 1 is a constrained TV penalized image denoising problem; problem 2 is a constrained fused lasso signal approximator. The sequential solution entails finding first the solution to the unconstrained problem, and then applying a thresholding to satisfy the constraints. If the interval constraints are uniform, this sequential solution solves problem 1. If the interval constraints furthermore contain zero, the sequential solution solves problem 2. Here uniform interval constraints refer to all unknowns being constrained to the same interval. A typical example of application is image denoising in x-ray CT, where the image intensities are non-negative as they physically represent linear attenuation coefficient in the patient body. Our results are simple yet seem unknown; we establish them using the Karush-Kuhn-Tucker conditions for constrained convex optimization.

Infrared target recognition based on improved joint local ternary pattern

NASA Astrophysics Data System (ADS)

Sun, Junding; Wu, Xiaosheng

2016-05-01

This paper presents a simple, efficient, yet robust approach, named joint orthogonal combination of local ternary pattern, for automatic forward-looking infrared target recognition. It gives more advantages to describe the macroscopic textures and microscopic textures by fusing variety of scales than the traditional LBP-based methods. In addition, it can effectively reduce the feature dimensionality. Further, the rotation invariant and uniform scheme, the robust LTP, and soft concave-convex partition are introduced to enhance its discriminative power. Experimental results demonstrate that the proposed method can achieve competitive results compared with the state-of-the-art methods.

High-voltage R-F feedthrough bushing

DOEpatents

Grotz, G.F.

1982-09-03

Described is a multi-element, high voltage radio frequency bushing for transmitting rf energy to an antenna located in a vacuum container. The bushing includes a center conductor of complex geometrical shape, an outer coaxial shield conductor, and a thin-walled hollow truncated cone insulator disposed between central and outer conductors. The shape of the center conductor, which includes a reverse curvature portion formed of a radially inwardly directed shoulder and a convex portion, controls the uniformity of the axial surface gradient on the insulator cone. The outer shield has a first substantially cylindrical portion and a second radially inwardly extending truncated cone portion.

High voltage RF feedthrough bushing

DOEpatents

Grotz, Glenn F.

1984-01-01

Described is a multi-element, high voltage radio frequency bushing for trmitting RF energy to an antenna located in a vacuum container. The bushing includes a center conductor of complex geometrical shape, an outer coaxial shield conductor, and a thin-walled hollow truncated cone insulator disposed between central and outer conductors. The shape of the center conductor, which includes a reverse curvature portion formed of a radially inwardly directed shoulder and a convex portion, controls the uniformity of the axial surface gradient on the insulator cone. The outer shield has a first substantially cylindrical portion and a second radially inwardly extending truncated cone portion.

Hyers-Ulam stability of a generalized Apollonius type quadratic mapping

NASA Astrophysics Data System (ADS)

Park, Chun-Gil; Rassias, Themistocles M.

2006-10-01

Let X,Y be linear spaces. It is shown that if a mapping satisfies the following functional equation: then the mapping is quadratic. We moreover prove the Hyers-Ulam stability of the functional equation (0.1) in Banach spaces.

Ground-state densities from the Rayleigh-Ritz variation principle and from density-functional theory.

PubMed

Kvaal, Simen; Helgaker, Trygve

2015-11-14

The relationship between the densities of ground-state wave functions (i.e., the minimizers of the Rayleigh-Ritz variation principle) and the ground-state densities in density-functional theory (i.e., the minimizers of the Hohenberg-Kohn variation principle) is studied within the framework of convex conjugation, in a generic setting covering molecular systems, solid-state systems, and more. Having introduced admissible density functionals as functionals that produce the exact ground-state energy for a given external potential by minimizing over densities in the Hohenberg-Kohn variation principle, necessary and sufficient conditions on such functionals are established to ensure that the Rayleigh-Ritz ground-state densities and the Hohenberg-Kohn ground-state densities are identical. We apply the results to molecular systems in the Born-Oppenheimer approximation. For any given potential v ∈ L(3/2)(ℝ(3)) + L(∞)(ℝ(3)), we establish a one-to-one correspondence between the mixed ground-state densities of the Rayleigh-Ritz variation principle and the mixed ground-state densities of the Hohenberg-Kohn variation principle when the Lieb density-matrix constrained-search universal density functional is taken as the admissible functional. A similar one-to-one correspondence is established between the pure ground-state densities of the Rayleigh-Ritz variation principle and the pure ground-state densities obtained using the Hohenberg-Kohn variation principle with the Levy-Lieb pure-state constrained-search functional. In other words, all physical ground-state densities (pure or mixed) are recovered with these functionals and no false densities (i.e., minimizing densities that are not physical) exist. The importance of topology (i.e., choice of Banach space of densities and potentials) is emphasized and illustrated. The relevance of these results for current-density-functional theory is examined.

Steven J. Ostro: Pioneer in Asteroid Lightcurve Inversion

NASA Astrophysics Data System (ADS)

Harris, Alan W.

2009-09-01

In 1906, Henry Norris Russell wrote a landmark paper (Astrophys. J. 24, 1-18, 1906) that set the field of lightcurve inversion back by more than three quarters of a century, until Steve Ostro and Robert Connolly published a paper on "convex profile inversion” (Icarus 57, 443-463, 1984). Russell's stifling contribution was innocent enough, and entirely correct: he showed that with "two cans of paint", one can decorate any arbitrarily shaped body in an infinite number of ways to yield any particular lightcurve, even, for example, a cigar shape that is brightest viewed end-on. This sufficed to discourage serious mathematical attack on the problem until Ostro & Connolly's landmark paper of 1984. They showed that if you have only "one can of paint", that is, in the absence of albedo variegation, the problem is tractable and one can make remarkable progress in lightcurve inversion to obtain shapes, or at least the "convex profile” of the real shape. As we now know, nature appears to have only one can of paint (per asteroid), that is, asteroids seem to paint themselves grey so that the uniform reflectivity assumption is quite excellent. Both radar and optical lightcurve inversion techniques are now quite mature, thanks to Steve's pioneering insights.

JPEG2000-coded image error concealment exploiting convex sets projections.

PubMed

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.

Ridge InGaAs/InP multi-quantum-well selective growth in nanoscale trenches on Si (001) substrate

DOE Office of Scientific and Technical Information (OSTI.GOV)

Li, S.; Zhou, X.; Li, M.

Metal organic chemical vapor deposition of InGaAs/InP multi-quantum-well in nanoscale V-grooved trenches on Si (001) substrate was studied using the aspect ratio trapping method. A high quality GaAs/InP buffer layer with two convex (111) B facets was selectively grown to promote the highly uniform, single-crystal ridge InP/InGaAs multi-quantum-well structure growth. Material quality was confirmed by transmission electron microscopy and room temperature micro-photoluminescence measurements. This approach shows great promise for the fabrication of photonics devices and nanolasers on Si substrate.

Convex Lattice Polygons

ERIC Educational Resources Information Center

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.

The Crystalline Dynamics of Spiral-Shaped Curves

NASA Astrophysics Data System (ADS)

Dudziński, Marcin; Górka, Przemysław

2015-07-01

We study the motion of spiral-shaped polygonal curves by crystalline curvature. We describe this dynamics by the corresponding infinitely dimensional system of ordinary differential equations and show that the considered model is uniquely solvable. Banach's Contraction Mapping Theorem and the Bellman-Gronwall inequality are the main tools applied in our proof.

Perceptual representation and effectiveness of local figure–ground cues in natural contours

PubMed Central

Sakai, Ko; Matsuoka, Shouhei; Kurematsu, Ken; Hatori, Yasuhiro

2015-01-01

A contour shape strongly influences the perceptual segregation of a figure from the ground. We investigated the contribution of local contour shape to figure–ground segregation. Although previous studies have reported local contour features that evoke figure–ground perception, they were often image features and not necessarily perceptual features. First, we examined whether contour features, specifically, convexity, closure, and symmetry, underlie the perceptual representation of natural contour shapes. We performed similarity tests between local contours, and examined the contribution of the contour features to the perceptual similarities between the contours. The local contours were sampled from natural contours so that their distribution was uniform in the space composed of the three contour features. This sampling ensured the equal appearance frequency of the factors and a wide variety of contour shapes including those comprised of contradictory factors that induce figure in the opposite directions. This sampling from natural contours is advantageous in order to randomly pickup a variety of contours that satisfy a wide range of cue combinations. Multidimensional scaling analyses showed that the combinations of convexity, closure, and symmetry contribute to perceptual similarity, thus they are perceptual quantities. Second, we examined whether the three features contribute to local figure–ground perception. We performed psychophysical experiments to judge the direction of the figure along the local contours, and examined the contribution of the features to the figure–ground judgment. Multiple linear regression analyses showed that closure was a significant factor, but that convexity and symmetry were not. These results indicate that closure is dominant in the local figure–ground perception with natural contours when the other cues coexist with equal probability including contradictory cases. PMID:26579057

Perceptual representation and effectiveness of local figure-ground cues in natural contours.

PubMed

Sakai, Ko; Matsuoka, Shouhei; Kurematsu, Ken; Hatori, Yasuhiro

2015-01-01

A contour shape strongly influences the perceptual segregation of a figure from the ground. We investigated the contribution of local contour shape to figure-ground segregation. Although previous studies have reported local contour features that evoke figure-ground perception, they were often image features and not necessarily perceptual features. First, we examined whether contour features, specifically, convexity, closure, and symmetry, underlie the perceptual representation of natural contour shapes. We performed similarity tests between local contours, and examined the contribution of the contour features to the perceptual similarities between the contours. The local contours were sampled from natural contours so that their distribution was uniform in the space composed of the three contour features. This sampling ensured the equal appearance frequency of the factors and a wide variety of contour shapes including those comprised of contradictory factors that induce figure in the opposite directions. This sampling from natural contours is advantageous in order to randomly pickup a variety of contours that satisfy a wide range of cue combinations. Multidimensional scaling analyses showed that the combinations of convexity, closure, and symmetry contribute to perceptual similarity, thus they are perceptual quantities. Second, we examined whether the three features contribute to local figure-ground perception. We performed psychophysical experiments to judge the direction of the figure along the local contours, and examined the contribution of the features to the figure-ground judgment. Multiple linear regression analyses showed that closure was a significant factor, but that convexity and symmetry were not. These results indicate that closure is dominant in the local figure-ground perception with natural contours when the other cues coexist with equal probability including contradictory cases.

CONVEX mini manual

NASA Technical Reports Server (NTRS)

Tennille, Geoffrey M.; Howser, Lona M.

1993-01-01

The use of the CONVEX computers that are an integral part of the Supercomputing Network Subsystems (SNS) of the Central Scientific Computing Complex of LaRC is briefly described. Features of the CONVEX computers that are significantly different than the CRAY supercomputers are covered, including: FORTRAN, C, architecture of the CONVEX computers, the CONVEX environment, batch job submittal, debugging, performance analysis, utilities unique to CONVEX, and documentation. This revision reflects the addition of the Applications Compiler and X-based debugger, CXdb. The document id intended for all CONVEX users as a ready reference to frequently asked questions and to more detailed information contained with the vendor manuals. It is appropriate for both the novice and the experienced user.

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

PubMed

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.

A General Iterative Shrinkage and Thresholding Algorithm for Non-convex Regularized Optimization Problems.

PubMed

Gong, Pinghua; Zhang, Changshui; Lu, Zhaosong; Huang, Jianhua Z; Ye, Jieping

2013-01-01

Non-convex sparsity-inducing penalties have recently received considerable attentions in sparse learning. Recent theoretical investigations have demonstrated their superiority over the convex counterparts in several sparse learning settings. However, solving the non-convex optimization problems associated with non-convex penalties remains a big challenge. A commonly used approach is the Multi-Stage (MS) convex relaxation (or DC programming), which relaxes the original non-convex problem to a sequence of convex problems. This approach is usually not very practical for large-scale problems because its computational cost is a multiple of solving a single convex problem. In this paper, we propose a General Iterative Shrinkage and Thresholding (GIST) algorithm to solve the nonconvex optimization problem for a large class of non-convex penalties. The GIST algorithm iteratively solves a proximal operator problem, which in turn has a closed-form solution for many commonly used penalties. At each outer iteration of the algorithm, we use a line search initialized by the Barzilai-Borwein (BB) rule that allows finding an appropriate step size quickly. The paper also presents a detailed convergence analysis of the GIST algorithm. The efficiency of the proposed algorithm is demonstrated by extensive experiments on large-scale data sets.

Mathematical analysis on the cosets of subgroup in the group of E-convex sets

NASA Astrophysics Data System (ADS)

Abbas, Nada Mohammed; Ajeena, Ruma Kareem K.

2018-05-01

In this work, analyzing the cosets of the subgroup in the group of L – convex sets is presented as a new and powerful tool in the topics of the convex analysis and abstract algebra. On L – convex sets, the properties of these cosets are proved mathematically. Most important theorem on a finite group of L – convex sets theory which is the Lagrange’s Theorem has been proved. As well as, the mathematical proof of the quotient group of L – convex sets is presented.

Homosexuality, Manliness and the United States

DTIC Science & Technology

2010-03-25

LIMITATION OF ABSTRACT 18 . NUMBER OF PAGES 19a. NAME OF RESPONSIBLE PERSON Stefan A. Banach, U.S. Army a. REPORT b. ABSTRACT c. THIS PAGE... 18 Australia...cause is masculine in its origin and subjugates women for fear that their “ erotic power threatens to infect him with feminine softness.” It is

Homosexuality, Manliness, and the United States Army

DTIC Science & Technology

2010-05-01

LIMITATION OF ABSTRACT 18 . NUMBER OF PAGES 19a. NAME OF RESPONSIBLE PERSON Stefan A. Banach, U.S. Army a. REPORT b. ABSTRACT c. THIS PAGE... 18 Australia...cause is masculine in its origin and subjugates women for fear that their “ erotic power threatens to infect him with feminine softness.” It is

Quadratic equations in Banach space, perturbation techniques and applications to Chandrasekhar's and related equations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Argyros, I.K.

1984-01-01

In this dissertation perturbation techniques are developed, based on the contraction mapping principle which can be used to prove existence and uniqueness for the quadratic equation x = y + lambdaB(x,x) (1) in a Banach space X; here B: XxX..-->..X is a bounded, symmetric bilinear operator, lambda is a positive parameter and y as a subset of X is fixed. The following is the main result. Theorem. Suppose F: XxX..-->..X is a bounded, symmetric bilinear operator and that the equation z = y + lambdaF(z,z) has a solution z/sup */ of sufficiently small norm. Then equation (1) has a uniquemore » solution in a certain closed ball centered at z/sup */. Applications. The theorem is applied to the famous Chandrasekhar equation and to the Anselone-Moore system which are of the form (1) above and yields existence and uniqueness for a solution of (1) for larger values of lambda than previously known, as well as more accurate information on the location of solutions.« less

Anisotropic Hardy Spaces of Musielak-Orlicz Type with Applications to Boundedness of Sublinear Operators

PubMed Central

Li, Baode; Yang, Dachun; Yuan, Wen

2014-01-01

Let φ : ℝn × [0, ∞)→[0, ∞) be a Musielak-Orlicz function and A an expansive dilation. In this paper, the authors introduce the anisotropic Hardy space of Musielak-Orlicz type, H A φ(ℝn), via the grand maximal function. The authors then obtain some real-variable characterizations of H A φ(ℝn) in terms of the radial, the nontangential, and the tangential maximal functions, which generalize the known results on the anisotropic Hardy space H A p(ℝn) with p ∈ (0,1] and are new even for its weighted variant. Finally, the authors characterize these spaces by anisotropic atomic decompositions. The authors also obtain the finite atomic decomposition characterization of H A φ(ℝn), and, as an application, the authors prove that, for a given admissible triplet (φ, q, s), if T is a sublinear operator and maps all (φ, q, s)-atoms with q < ∞ (or all continuous (φ, q, s)-atoms with q = ∞) into uniformly bounded elements of some quasi-Banach spaces ℬ, then T uniquely extends to a bounded sublinear operator from H A φ(ℝn) to ℬ. These results are new even for anisotropic Orlicz-Hardy spaces on ℝn. PMID:24757418

Asymptotic Behavior of Solutions of Systems of Neutral and Convolution Equations

NASA Astrophysics Data System (ADS)

Basit, Bolis; Günzler, Hans

1998-10-01

Suppose J=[α, ∞) for someα∈R or J=R and letXbe a Banach space. We study asymptotic behavior of solutions on J of neutral system of equations with values inX. This reduces to questions concerning the behavior of solutions of convolution equations (*)H∗Ω=b, whereH=(Hj, k) is anr×rmatrix,Hj, k∈D‧L1,b=(bj) andbj∈D‧(R, X), for 1⩽j, k⩽r. We prove that ifΩis a bounded uniformly continuous solution of (*) withbfrom some translation invariant suitably closed class A, thenΩbelongs to A, provided, for example, that det Hhas countably many zeros on R andc0⊄X. In particular, ifbis (asymptotically) almost periodic, almost automorphic or recurrent,Ωis too. Our results extend theorems of Bohr, Neugebauer, Bochner, Doss, Basit, and Zhikov and also, certain theorems of Fink, Madych, Staffans, and others. Also, we investigate bounded solutions of (*). This leads to an extension of the known classes of almost periodicity to larger classes called mean-classes. We explore mean-classes and prove that bounded solutions of (*) belong to mean-classes provided certain conditions hold. These results seem new even for the simplest difference equationΩ(t+1)-Ω(t)=b(t) with J=X=R andbStepanoff almost periodic.

Anisotropic hardy spaces of Musielak-Orlicz type with applications to boundedness of sublinear operators.

PubMed

Li, Baode; Yang, Dachun; Yuan, Wen

2014-01-01

Let φ : ℝ(n) × [0, ∞)→[0, ∞) be a Musielak-Orlicz function and A an expansive dilation. In this paper, the authors introduce the anisotropic Hardy space of Musielak-Orlicz type, H(A)(φ)(ℝ(n)), via the grand maximal function. The authors then obtain some real-variable characterizations of H(A)(φ)(ℝ(n)) in terms of the radial, the nontangential, and the tangential maximal functions, which generalize the known results on the anisotropic Hardy space H(A)(p) (ℝ(n)) with p ∈ (0,1] and are new even for its weighted variant. Finally, the authors characterize these spaces by anisotropic atomic decompositions. The authors also obtain the finite atomic decomposition characterization of H(A)(φ)(ℝ(n)), and, as an application, the authors prove that, for a given admissible triplet (φ, q, s), if T is a sublinear operator and maps all (φ, q, s)-atoms with q < ∞ (or all continuous (φ, q, s)-atoms with q = ∞) into uniformly bounded elements of some quasi-Banach spaces ℬ, then T uniquely extends to a bounded sublinear operator from H(A)(φ)(ℝ(n)) to ℬ. These results are new even for anisotropic Orlicz-Hardy spaces on ℝ(n).

Chromatically corrected virtual image visual display. [reducing eye strain in flight simulators

NASA Technical Reports Server (NTRS)

Kahlbaum, W. M., Jr. (Inventor)

1980-01-01

An in-line, three element, large diameter, optical display lens is disclosed which has a front convex-convex element, a central convex-concave element, and a rear convex-convex element. The lens, used in flight simulators, magnifies an image presented on a television monitor and, by causing light rays leaving the lens to be in essentially parallel paths, reduces eye strain of the simulator operator.

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

NASA Astrophysics Data System (ADS)

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 decomposition technique for an important biomedical signal processing problem: the detection of sleep spindles and K-complexes in human sleep electroencephalography (EEG). We propose a non-linear model for the EEG consisting of three components: (1) a transient (sparse piecewise constant) component, (2) a low-frequency component, and (3) an oscillatory component. The oscillatory component admits a sparse time-frequency representation. Using a convex objective function, we propose a fast non-linear optimization algorithm to estimate the three components in the proposed signal model. The low-frequency and oscillatory components are then used to estimate the K-complexes and sleep spindles respectively. The proposed detection method is shown to outperform several state-of-the-art automated sleep spindles detection methods.

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

PubMed

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

2015-09-21

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

Note: A contraction channel design for planar shock wave enhancement

NASA Astrophysics Data System (ADS)

Zhan, Dongwen; Li, Zhufei; Yang, Jianting; Zhu, Yujian; Yang, Jiming

2018-05-01

A two-dimensional contraction channel with a theoretically designed concave-oblique-convex wall profile is proposed to obtain a smooth planar-to-planar shock transition with shock intensity amplification that can easily overcome the limitations of a conventional shock tube. The concave segment of the wall profile, which is carefully determined based on shock dynamics theory, transforms the shock shape from an initial plane into a cylindrical arc. Then the level of shock enhancement is mainly contributed by the cylindrical shock convergence within the following oblique segment, after which the cylindrical shock is again "bent" back into a planar shape through the third section of the shock dynamically designed convex segment. A typical example is presented with a combination of experimental and numerical methods, where the shape of transmitted shock is almost planar and the post-shock flow has no obvious reflected waves. A quantitative investigation shows that the difference between the designed and experimental transmitted shock intensities is merely 1.4%. Thanks to its advantage that the wall profile design is insensitive to initial shock strength variations and high-temperature gas effects, this method exhibits attractive potential as an efficient approach to a certain, controllable, extreme condition of a strong shock wave with relatively uniform flow behind.

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

NASA Astrophysics Data System (ADS)

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

2015-09-01

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

Scoliosis convexity and organ anatomy are related.

PubMed

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

2017-06-01

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

Path planning and parameter optimization of uniform removal in active feed polishing

NASA Astrophysics Data System (ADS)

Liu, Jian; Wang, Shaozhi; Zhang, Chunlei; Zhang, Linghua; Chen, Huanan

2015-06-01

A high-quality ultrasmooth surface is demanded in short-wave optical systems. However, the existing polishing methods have difficulties meeting the requirement on spherical or aspheric surfaces. As a new kind of small tool polishing method, active feed polishing (AFP) could attain a surface roughness of less than 0.3 nm (RMS) on spherical elements, although AFP may magnify the residual figure error or mid-frequency error. The purpose of this work is to propose an effective algorithm to realize uniform removal of the surface in the processing. At first, the principle of the AFP and the mechanism of the polishing machine are introduced. In order to maintain the processed figure error, a variable pitch spiral path planning algorithm and the dwell time-solving model are proposed. For suppressing the possible mid-frequency error, the uniformity of the synthesis tool path, which is generated by an arbitrary point at the polishing tool bottom, is analyzed and evaluated, and the angular velocity ratio of the tool spinning motion to the revolution motion is optimized. Finally, an experiment is conducted on a convex spherical surface and an ultrasmooth surface is finally acquired. In conclusion, a high-quality ultrasmooth surface can be successfully obtained with little degradation of the figure and mid-frequency errors by the algorithm.

Use of Convexity in Ostomy Care

PubMed Central

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

Geometric convex cone volume analysis

NASA Astrophysics Data System (ADS)

Li, Hsiao-Chi; Chang, Chein-I.

2016-05-01

Convexity is a major concept used to design and develop endmember finding algorithms (EFAs). For abundance unconstrained techniques, Pixel Purity Index (PPI) and Automatic Target Generation Process (ATGP) which use Orthogonal Projection (OP) as a criterion, are commonly used method. For abundance partially constrained techniques, Convex Cone Analysis is generally preferred which makes use of convex cones to impose Abundance Non-negativity Constraint (ANC). For abundance fully constrained N-FINDR and Simplex Growing Algorithm (SGA) are most popular methods which use simplex volume as a criterion to impose ANC and Abundance Sum-to-one Constraint (ASC). This paper analyze an issue encountered in volume calculation with a hyperplane introduced to illustrate an idea of bounded convex cone. Geometric Convex Cone Volume Analysis (GCCVA) projects the boundary vectors of a convex cone orthogonally on a hyperplane to reduce the effect of background signatures and a geometric volume approach is applied to address the issue arose from calculating volume and further improve the performance of convex cone-based EFAs.

The effects of a convex rear-view mirror on ocular accommodative responses.

PubMed

Nagata, Tatsuo; Iwasaki, Tsuneto; Kondo, Hiroyuki; Tawara, Akihiko

2013-11-01

Convex mirrors are universally used as rear-view mirrors in automobiles. However, the ocular accommodative responses during the use of these mirrors have not yet been examined. This study investigated the effects of a convex mirror on the ocular accommodative systems. Seven young adults with normal visual functions were ordered to binocularly watch an object in a convex or plane mirror. The accommodative responses were measured with an infrared optometer. The average of the accommodation of all subjects while viewing the object in the convex mirror were significantly nearer than in the plane mirror, although all subjects perceived the position of the object in the convex mirror as being farther away. Moreover, the fluctuations of accommodation were significantly larger for the convex mirror. The convex mirror caused the 'false recognition of distance', which induced the large accommodative fluctuations and blurred vision. Manufactures should consider the ocular accommodative responses as a new indicator for increasing automotive safety. Copyright © 2013 Elsevier Ltd and The Ergonomics Society. All rights reserved.

Performance of intraclass correlation coefficient (ICC) as a reliability index under various distributions in scale reliability studies.

PubMed

Mehta, Shraddha; Bastero-Caballero, Rowena F; Sun, Yijun; Zhu, Ray; Murphy, Diane K; Hardas, Bhushan; Koch, Gary

2018-04-29

Many published scale validation studies determine inter-rater reliability using the intra-class correlation coefficient (ICC). However, the use of this statistic must consider its advantages, limitations, and applicability. This paper evaluates how interaction of subject distribution, sample size, and levels of rater disagreement affects ICC and provides an approach for obtaining relevant ICC estimates under suboptimal conditions. Simulation results suggest that for a fixed number of subjects, ICC from the convex distribution is smaller than ICC for the uniform distribution, which in turn is smaller than ICC for the concave distribution. The variance component estimates also show that the dissimilarity of ICC among distributions is attributed to the study design (ie, distribution of subjects) component of subject variability and not the scale quality component of rater error variability. The dependency of ICC on the distribution of subjects makes it difficult to compare results across reliability studies. Hence, it is proposed that reliability studies should be designed using a uniform distribution of subjects because of the standardization it provides for representing objective disagreement. In the absence of uniform distribution, a sampling method is proposed to reduce the non-uniformity. In addition, as expected, high levels of disagreement result in low ICC, and when the type of distribution is fixed, any increase in the number of subjects beyond a moderately large specification such as n = 80 does not have a major impact on ICC. Copyright © 2018 John Wiley & Sons, Ltd.

Revisiting separation properties of convex fuzzy sets

USDA-ARS?s Scientific Manuscript database

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

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

PubMed

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.

The Hartman-Grobman theorem for semilinear hyperbolic evolution equations

NASA Astrophysics Data System (ADS)

Hein, Marie-Luise; Prüss, Jan

2016-10-01

The famous Hartman-Grobman theorem for ordinary differential equations is extended to abstract semilinear hyperbolic evolution equations in Banach spaces by means of simple direct proof. It is also shown that the linearising map is Hölder continuous. Several applications to abstract and specific damped wave equations are given, to demonstrate the strength of our results.

Detection of Convexity and Concavity in Context

ERIC Educational Resources Information Center

Bertamini, Marco

2008-01-01

Sensitivity to shape changes was measured, in particular detection of convexity and concavity changes. The available data are contradictory. The author used a change detection task and simple polygons to systematically manipulate convexity/concavity. Performance was high for detecting a change of sign (a new concave vertex along a convex contour…

Airfoil

DOEpatents

Ristau, Neil; Siden, Gunnar Leif

2015-07-21

An airfoil includes a leading edge, a trailing edge downstream from the leading edge, a pressure surface between the leading and trailing edges, and a suction surface between the leading and trailing edges and opposite the pressure surface. A first convex section on the suction surface decreases in curvature downstream from the leading edge, and a throat on the suction surface is downstream from the first convex section. A second convex section is on the suction surface downstream from the throat, and a first convex segment of the second convex section increases in curvature.

Superiorization with level control

NASA Astrophysics Data System (ADS)

Cegielski, Andrzej; Al-Musallam, Fadhel

2017-04-01

The convex feasibility problem is to find a common point of a finite family of closed convex subsets. In many applications one requires something more, namely finding a common point of closed convex subsets which minimizes a continuous convex function. The latter requirement leads to an application of the superiorization methodology which is actually settled between methods for convex feasibility problem and the convex constrained minimization. Inspired by the superiorization idea we introduce a method which sequentially applies a long-step algorithm for a sequence of convex feasibility problems; the method employs quasi-nonexpansive operators as well as subgradient projections with level control and does not require evaluation of the metric projection. We replace a perturbation of the iterations (applied in the superiorization methodology) by a perturbation of the current level in minimizing the objective function. We consider the method in the Euclidean space in order to guarantee the strong convergence, although the method is well defined in a Hilbert space.

Hermite-Hadamard type inequality for φ{sub h}-convex stochastic processes

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sarıkaya, Mehmet Zeki, E-mail: sarikayamz@gmail.com; Kiriş, Mehmet Eyüp, E-mail: kiris@aku.edu.tr; Çelik, Nuri, E-mail: ncelik@bartin.edu.tr

2016-04-18

The main aim of the present paper is to introduce φ{sub h}-convex stochastic processes and we investigate main properties of these mappings. Moreover, we prove the Hadamard-type inequalities for φ{sub h}-convex stochastic processes. We also give some new general inequalities for φ{sub h}-convex stochastic processes.

A Bayesian observer replicates convexity context effects in figure-ground perception.

PubMed

Goldreich, Daniel; Peterson, Mary A

2012-01-01

Peterson and Salvagio (2008) demonstrated convexity context effects in figure-ground perception. Subjects shown displays consisting of unfamiliar alternating convex and concave regions identified the convex regions as foreground objects progressively more frequently as the number of regions increased; this occurred only when the concave regions were homogeneously colored. The origins of these effects have been unclear. Here, we present a two-free-parameter Bayesian observer that replicates convexity context effects. The Bayesian observer incorporates two plausible expectations regarding three-dimensional scenes: (1) objects tend to be convex rather than concave, and (2) backgrounds tend (more than foreground objects) to be homogeneously colored. The Bayesian observer estimates the probability that a depicted scene is three-dimensional, and that the convex regions are figures. It responds stochastically by sampling from its posterior distributions. Like human observers, the Bayesian observer shows convexity context effects only for images with homogeneously colored concave regions. With optimal parameter settings, it performs similarly to the average human subject on the four display types tested. We propose that object convexity and background color homogeneity are environmental regularities exploited by human visual perception; vision achieves figure-ground perception by interpreting ambiguous images in light of these and other expected regularities in natural scenes.

Gratings Fabricated on Flat Surfaces and Reproduced on Non-Flat Substrates

NASA Technical Reports Server (NTRS)

Content, David; Iazikov, Dmitri; Mossberg, Thomas W.; Greiner, Christopher M.

2009-01-01

A method has been developed for fabricating gratings on flat substrates, and then reproducing the groove pattern on a curved (concave or convex) substrate and a corresponding grating device. First, surface relief diffraction grating grooves are formed on flat substrates. For example, they may be fabricated using photolithography and reactive ion etching, maskless lithography, holography, or mechanical ruling. Then, an imprint of the grating is made on a deformable substrate, such as plastic, polymer, or other materials using thermoforming, hot or cold embossing, or other methods. Interim stamps using electroforming, or other methods, may be produced for the imprinting process or if the same polarity of the grating image is required. The imprinted, deformable substrate is then attached to a curved, rigid substrate using epoxy or other suitable adhesives. The imprinted surface is facing away from the curved rigid substrate. As an alternative fabrication method, after grating is imprinted on the deformable substrate as described above, the grating may be coated with thin conformal conductive layer (for example, using vacuum deposition of gold). Then the membrane may be mounted over an opening in a pressured vessel in a manner of a membrane on a drum, grating side out. The pressure inside of the vessel may be changed with respect to the ambient pressure to produce concave or convex membrane surface. The shape of the opening may control the type of the surface curvature (for example, a circular opening would create spherical surface, oval opening would create toroidal surface, etc.). After that, well-known electroforming methods may be used to create a replica of the grating on the concave or convex membrane. For example, the pressure vessel assembly may be submerged into an electro-forming solution and negative electric potential applied to the metal coated membrane using an insulated wire. Positive electric potential may be then applied to a nickel or other metal plate submerged into the same solution. Metal ions would transfer from the plate through the solution into the membrane, producing high fidelity metal replica of the grating on the membrane. In one variation, an adhesive may be deposited on the deformable substrate, and then cured without touching the rigid, curved substrate. Edges of the deformable substrate may be attached to the rigid substrate to ensure uniform deformation of the deformable substrate. The assembly may be performed in vacuum, and then taken out to atmospheric pressure conditions to ensure that no air is trapped between the deformable and rigid substrates. Alternatively, a rigid surface with complementary curvature to the rigid substrate may be used to ensure uniform adhesion of the deformable substrate to the rigid substrate. Liquid may be applied to the surface of the deformable substrate to uniformly distribute pressure across its surface during the curing or hardening of the adhesive, or the film may be pressed into the surface using a deformable object or surface. After the attachment is complete, the grooves may be coated with reflective or dielectric layers to improve diffraction efficiency.

Harmonizable Processes: Structure.

DTIC Science & Technology

1980-11-05

Grothendieck and Pietsch , for * the work below. Definition 5.2 Let 1,4 be a pair of Banach spaces andas usual, B(1,4) be the space of bounded linear...IP)P P i=l I - (58) xi E 1, 1 i < n , n where x* E 1* , the adjoint space of I The following result of Grothendieck- Pietsch with a short proof may

Effectiveness and Student Success: Transforming Community Colleges for the 1990's. Proceedings from the Conference. (Toronto, Ontario, Canada, June 24-26, 1990).

ERIC Educational Resources Information Center

Walleri, Dan, Ed.; And Others

The 27 papers included in this proceedings report focus on various aspects of institutional effectiveness and student outcomes. The papers are: (1) "Assessment Update: Ends, Means and Results" (Banta); (2) "The Top Ten Issues Facing America's Community Colleges" (Lorenzo and Banach); (3) "Assessing Institutional Effectiveness in Continuing…

Stability Properties of the Regular Set for the Navier-Stokes Equation

NASA Astrophysics Data System (ADS)

D'Ancona, Piero; Lucà, Renato

2018-06-01

We investigate the size of the regular set for small perturbations of some classes of strong large solutions to the Navier-Stokes equation. We consider perturbations of the data that are small in suitable weighted L2 spaces but can be arbitrarily large in any translation invariant Banach space. We give similar results in the small data setting.

The role of convexity in perception of symmetry and in visual short-term memory.

PubMed

Bertamini, Marco; Helmy, Mai Salah; Hulleman, Johan

2013-01-01

Visual perception of shape is affected by coding of local convexities and concavities. For instance, a recent study reported that deviations from symmetry carried by convexities were easier to detect than deviations carried by concavities. We removed some confounds and extended this work from a detection of reflection of a contour (i.e., bilateral symmetry), to a detection of repetition of a contour (i.e., translational symmetry). We tested whether any convexity advantage is specific to bilateral symmetry in a two-interval (Experiment 1) and a single-interval (Experiment 2) detection task. In both, we found a convexity advantage only for repetition. When we removed the need to choose which region of the contour to monitor (Experiment 3) the effect disappeared. In a second series of studies, we again used shapes with multiple convex or concave features. Participants performed a change detection task in which only one of the features could change. We did not find any evidence that convexities are special in visual short-term memory, when the to-be-remembered features only changed shape (Experiment 4), when they changed shape and changed from concave to convex and vice versa (Experiment 5), or when these conditions were mixed (Experiment 6). We did find a small advantage for coding convexity as well as concavity over an isolated (and thus ambiguous) contour. The latter is consistent with the known effect of closure on processing of shape. We conclude that convexity plays a role in many perceptual tasks but that it does not have a basic encoding advantage over concavity.

Consensus for multi-agent systems with time-varying input delays

NASA Astrophysics Data System (ADS)

Yuan, Chengzhi; Wu, Fen

2017-10-01

This paper addresses the consensus control problem for linear multi-agent systems subject to uniform time-varying input delays and external disturbance. A novel state-feedback consensus protocol is proposed under the integral quadratic constraint (IQC) framework, which utilises not only the relative state information from neighbouring agents but also the real-time information of delays by means of the dynamic IQC system states for feedback control. Based on this new consensus protocol, the associated IQC-based control synthesis conditions are established and fully characterised as linear matrix inequalities (LMIs), such that the consensus control solution with optimal ? disturbance attenuation performance can be synthesised efficiently via convex optimisation. A numerical example is used to demonstrate the proposed approach.

Device for installing rocket engines

NASA Technical Reports Server (NTRS)

George, T. R., Jr. (Inventor)

1976-01-01

A device for installing rocket engines is reported that is supported at a cant relative to vertical by an axially extensible, tiltable pedestal. A lifting platform supports the rocket engine at its thrust chamber exit, including a mount having a concentric base characterized by a concave bearing surface, a plurality of uniformly spaced legs extended radially from the base, and an annular receiver coaxially aligned with the base and affixed to the distal ends of said legs for receiving the thrust chamber exit. The lifting platform rests on a seat concentrically related to the pedestal and affixed to an extended end portion thereof having a convex bearing surface mated in sliding engagement with the concave bearing surface of the annular base for accommodating a rocking motion of the platform.

More vertical etch profile using a Faraday cage in plasma etching

NASA Astrophysics Data System (ADS)

Cho, Byeong-Ok; Hwang, Sung-Wook; Ryu, Jung-Hyun; Moon, Sang Heup

1999-05-01

Scanning electron microscope images of sidewalls obtained by plasma etching of an SiO2 film with and without a Faraday cage have been compared. When the substrate film is etched in the Faraday cage, faceting is effectively suppressed and the etch profile becomes more vertical regardless of the process conditions. This is because the electric potential in the cage is nearly uniform and therefore distortion of the electric field at the convex corner of a microfeature is prevented. The most vertical etch profile is obtained when the cage is used in fluorocarbon plasmas, where faceting is further suppressed due to the decrease in the chemical sputtering yield and the increase in the radical/ion flux on the substrate.

Multi-Fresnel lenses pumping approach for improving high-power Nd:YAG solar laser beam quality.

PubMed

Liang, Dawei; Almeida, Joana

2013-07-20

To significantly improve the present-day high-power solar laser beam quality, a three-stage multi-Fresnel lenses approach is proposed for side-pumping either a Nd:YAG single-crystal or a core-doped Sm(3+)Nd:YAG ceramic rod. Optimum pumping and laser beam parameters are found through ZEMAX and LASCAD numerical analysis. The proposed scheme offers a uniform absorption profile along the rod. 167 W laser power can be achieved, corresponding to 29.3 W/m(2) collection efficiency. High brightness figure of merit of 8.34 W is expected for the core-doped rod within a convex-concave resonator, which is 1300 times higher than that of the most-recent high-power solar laser.

Thermophoretic force on nonspherical particles in the free-molecule regime

NASA Astrophysics Data System (ADS)

Yu, Song; Wang, Jun; Xia, Guodong; Zong, Luxiang

2018-05-01

The present paper is devoted to studying the thermophoresis of a nonspherical convex particle suspended in a gas with nonuniform temperature distribution in the free-molecule regime. Based on the gas kinetic theory and the assumption of a rigid-body collision for the gas-particle interaction, analytical expressions for the thermophoretic forces are obtained for several typical nonspherical bodies, including cylinders, spheroids, needles, disks, and cuboids. The orientation dependences of the thermophoretic forces and thermophoretic velocities are evaluated based on these expressions. It is found that the influence of the pitching effect of the nonspheres can be significant. The expressions for the orientation-averaged thermophoretic forces are also obtained under the assumption of a uniform particle orientation distribution.

Point-in-convex polygon and point-in-convex polyhedron algorithms with O(1) complexity using space subdivision

NASA Astrophysics Data System (ADS)

Skala, Vaclav

2016-06-01

There are many space subdivision and space partitioning techniques used in many algorithms to speed up computations. They mostly rely on orthogonal space subdivision, resp. using hierarchical data structures, e.g. BSP trees, quadtrees, octrees, kd-trees, bounding volume hierarchies etc. However in some applications a non-orthogonal space subdivision can offer new ways for actual speed up. In the case of convex polygon in E2 a simple Point-in-Polygon test is of the O(N) complexity and the optimal algorithm is of O(log N) computational complexity. In the E3 case, the complexity is O(N) even for the convex polyhedron as no ordering is defined. New Point-in-Convex Polygon and Point-in-Convex Polyhedron algorithms are presented based on space subdivision in the preprocessing stage resulting to O(1) run-time complexity. The presented approach is simple to implement. Due to the principle of duality, dual problems, e.g. line-convex polygon, line clipping, can be solved in a similarly.

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

NASA Astrophysics Data System (ADS)

Grasmair, Markus

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

Study of the heat-transfer crisis on heat-release surfaces of annular channels with swirl and transit flows

NASA Astrophysics Data System (ADS)

Boltenko, E. A.

2016-10-01

The results of the experimental study of the heat-transfer crisis on heat-release surfaces of annular channels with swirl and transit flow are presented. The experiments were carried out using electric heated annular channels with one and (or) two heat-release surfaces. For the organization of transit flow on a convex heat-release surface, four longitudinal ribs were installed uniformly at its perimeter. Swirl flow was realized using a capillary wound tightly (without gaps) on the ribs. The ratio between swirl and transit flows in the annular gap was varied by applying longitudinal ribs of different height. The experiments were carried out using a closed-type circulatory system. The experimental data were obtained in a wide range of regime parameters. Both water heated to the temperature less than the saturation temperature and water-steam mixture were fed at the inlet of the channels. For the measurement of the temperature of the heat-release surfaces, chromel-copel thermocouples were used. It was shown that the presence of swirl flow on a convex heatrelease surface led to a significant decrease in critical heat flows (CHF) compared to a smooth surface. To increase CHF, it was proposed to use the interaction of swirl flows of the heat carrier. The second swirl flow was transit flow, i.e., swirl flow with the step equal to infinity. It was shown that CHF values for a channel with swirl and transit flow in all the studied range of regime parameters was higher than CHF values for both a smooth annular channel and a channel with swirl. The empirical ratios describing the dependence of CHF on convex and concave heat-release surfaces of annular channels with swirl and transit flow on the geometrical characteristics of channels and the regime parameters were obtained. The experiments were carried out at the pressure p = 3.0-16.0 MPa and the mass velocity ρw = 250-3000 kg/(m2s).

First Evaluation of the New Thin Convex Probe Endobronchial Ultrasound Scope: A Human Ex Vivo Lung Study.

PubMed

Patel, Priya; Wada, Hironobu; Hu, Hsin-Pei; Hirohashi, Kentaro; Kato, Tatsuya; Ujiie, Hideki; Ahn, Jin Young; Lee, Daiyoon; Geddie, William; Yasufuku, Kazuhiro

2017-04-01

Endobronchial ultrasonography (EBUS)-guided transbronchial needle aspiration allows for sampling of mediastinal lymph nodes. The external diameter, rigidity, and angulation of the convex probe EBUS renders limited accessibility. This study compares the accessibility and transbronchial needle aspiration capability of the prototype thin convex probe EBUS against the convex probe EBUS in human ex vivo lungs rejected for transplant. The prototype thin convex probe EBUS (BF-Y0055; Olympus, Tokyo, Japan) with a thinner tip (5.9 mm), greater upward angle (170 degrees), and decreased forward oblique direction of view (20 degrees) was compared with the current convex probe EBUS (6.9-mm tip, 120 degrees, and 35 degrees, respectively). Accessibility and transbronchial needle aspiration capability was assessed in ex vivo human lungs declined for lung transplant. The distance of maximum reach and sustainable endoscopic limit were measured. Transbronchial needle aspiration capability was assessed using the prototype 25G aspiration needle in segmental lymph nodes. In all evaluated lungs (n = 5), the thin convex probe EBUS demonstrated greater reach and a higher success rate, averaging 22.1 mm greater maximum reach and 10.3 mm further endoscopic visibility range than convex probe EBUS, and could assess selectively almost all segmental bronchi (98% right, 91% left), demonstrating nearly twice the accessibility as the convex probe EBUS (48% right, 47% left). The prototype successfully enabled cytologic assessment of subsegmental lymph nodes with adequate quality using the dedicated 25G aspiration needle. Thin convex probe EBUS has greater accessibility to peripheral airways in human lungs and is capable of sampling segmental lymph nodes using the aspiration needle. That will allow for more precise assessment of N1 nodes and, possibly, intrapulmonary lesions normally inaccessible to the conventional convex probe EBUS. Copyright © 2017 The Society of Thoracic Surgeons. Published by Elsevier Inc. All rights reserved.

Conformal Electroless Nickel Plating on Silicon Wafers, Convex and Concave Pyramids, and Ultralong Nanowires.

PubMed

Gill, Thomas Mark; Zhao, Jiheng; Berenschot, Erwin J W; Tas, Niels; Zheng, Xiaolin

2018-06-25

Nickel (Ni) plating has garnered great commercial interest, as it provides excellent hardness, corrosion resistance, and electrical conductivity. Though Ni plating on conducting substrates is commonly employed via electrodeposition, plating on semiconductors and insulators often necessitates electroless approaches. Corresponding plating theory for deposition on planar substrates was developed as early as 1946, but for substrates with micro- and nanoscale features, very little is known of the relationships between plating conditions, Ni deposition quality, and substrate morphology. Herein, we describe the general theory and mechanisms of electroless Ni deposition on semiconducting silicon (Si) substrates, detailing plating bath failures and establishing relationships between critical plating bath parameters and the deposited Ni film quality. Through this theory, we develop two different plating recipes: galvanic displacement (GD) and autocatalytic deposition (ACD). Neither recipe requires pretreatment of the Si substrate, and both methods are capable of depositing uniform Ni films on planar Si substrates and convex Si pyramids. In comparison, ACD has better tunability than GD, and it provides a more conformal Ni coating on complex and high-aspect-ratio Si structures, such as inverse fractal Si pyramids and ultralong Si nanowires. Our methodology and theoretical analyses can be leveraged to develop electroless plating processes for other metals and metal alloys and to generally provide direction for the adaptation of electroless deposition to modern applications.

Investigating the effect of tablet thickness and punch curvature on density distribution using finite elements method.

PubMed

Diarra, Harona; Mazel, Vincent; Busignies, Virginie; Tchoreloff, Pierre

2015-09-30

Finite elements method was used to study the influence of tablet thickness and punch curvature on the density distribution inside convex faced (CF) tablets. The modeling of the process was conducted on 2 pharmaceutical excipients (anhydrous calcium phosphate and microcrystalline cellulose) by using Drucker-Prager Cap model in Abaqus(®) software. The parameters of the model were obtained from experimental tests. Several punch shapes based on industrial standards were used. A flat-faced (FF) punch and 3 convex faced (CF) punches (8R11, 8R8 and 8R6) with a diameter of 8mm were chosen. Different tablet thicknesses were studied at a constant compression force. The simulation of the compaction of CF tablets with increasing thicknesses showed an important change on the density distribution inside the tablet. For smaller thicknesses, low density zones are located toward the center. The density is not uniform inside CF tablets and the center of the 2 faces appears with low density whereas the distribution inside FF tablets is almost independent of the tablet thickness. These results showed that FF and CF tablets, even obtained at the same compression force, do not have the same density at the center of the compact. As a consequence differences in tensile strength, as measured by diametral compression, are expected. This was confirmed by experimental tests. Copyright © 2015 Elsevier B.V. All rights reserved.

Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization

NASA Astrophysics Data System (ADS)

Yamagishi, Masao; Yamada, Isao

2017-04-01

Hierarchical convex optimization concerns two-stage optimization problems: the first stage problem is a convex optimization; the second stage problem is the minimization of a convex function over the solution set of the first stage problem. For the hierarchical convex optimization, the hybrid steepest descent method (HSDM) can be applied, where the solution set of the first stage problem must be expressed as the fixed point set of a certain nonexpansive operator. In this paper, we propose a nonexpansive operator that yields a computationally efficient update when it is plugged into the HSDM. The proposed operator is inspired by the update of the linearized augmented Lagrangian method. It is applicable to characterize the solution set of recent sophisticated convex optimization problems found in the context of inverse problems, where the sum of multiple proximable convex functions involving linear operators must be minimized to incorporate preferable properties into the minimizers. For such a problem formulation, there has not yet been reported any nonexpansive operator that yields an update free from the inversions of linear operators in cases where it is utilized in the HSDM. Unlike previously known nonexpansive operators, the proposed operator yields an inversion-free update in such cases. As an application of the proposed operator plugged into the HSDM, we also present, in the context of the so-called superiorization, an algorithmic solution to a convex optimization problem over the generalized convex feasible set where the intersection of the hard constraints is not necessarily simple.

Radius of convexity of a certain class of close-to-convex functions

NASA Astrophysics Data System (ADS)

Yahya, Abdullah; Soh, Shaharuddin Cik

2017-11-01

In the present paper, we consider and investigate a certain class of close-to-convex functions that defined in the unit disk, U = {z : |z| < 1}, which denotes as Re { ei αz/f '(z ) f (z )-f (-z ) } >δ where |α| < π, cos (α) > δ and 0 δ <1. Furthermore, we obtain preliminary result for bound f'(z) and determine result for radius of convexity.

Convex Graph Invariants

DTIC Science & Technology

2010-12-02

Motzkin, T. and Straus, E. (1965). Maxima for graphs and a new proof of a theorem of Turan . Canad. J. Math. 17 533–540. [33] Rendl, F. and Sotirov, R...Convex Graph Invariants Venkat Chandrasekaran, Pablo A . Parrilo, and Alan S. Willsky ∗ Laboratory for Information and Decision Systems Department of...this paper we study convex graph invariants, which are graph invariants that are convex functions of the adjacency matrix of a graph. Some examples

Allometric relationships between traveltime channel networks, convex hulls, and convexity measures

NASA Astrophysics Data System (ADS)

Tay, Lea Tien; Sagar, B. S. Daya; Chuah, Hean Teik

2006-06-01

The channel network (S) is a nonconvex set, while its basin [C(S)] is convex. We remove open-end points of the channel connectivity network iteratively to generate a traveltime sequence of networks (Sn). The convex hulls of these traveltime networks provide an interesting topological quantity, which has not been noted thus far. We compute lengths of shrinking traveltime networks L(Sn) and areas of corresponding convex hulls C(Sn), the ratios of which provide convexity measures CM(Sn) of traveltime networks. A statistically significant scaling relationship is found for a model network in the form L(Sn) ˜ A[C(Sn)]0.57. From the plots of the lengths of these traveltime networks and the areas of their corresponding convex hulls as functions of convexity measures, new power law relations are derived. Such relations for a model network are CM(Sn) ˜ ? and CM(Sn) ˜ ?. In addition to the model study, these relations for networks derived from seven subbasins of Cameron Highlands region of Peninsular Malaysia are provided. Further studies are needed on a large number of channel networks of distinct sizes and topologies to understand the relationships of these new exponents with other scaling exponents that define the scaling structure of river networks.

Time-frequency filtering and synthesis from convex projections

NASA Astrophysics Data System (ADS)

White, Langford B.

1990-11-01

This paper describes the application of the theory of projections onto convex sets to time-frequency filtering and synthesis problems. We show that the class of Wigner-Ville Distributions (WVD) of L2 signals form the boundary of a closed convex subset of L2(R2). This result is obtained by considering the convex set of states on the Heisenberg group of which the ambiguity functions form the extreme points. The form of the projection onto the set of WVDs is deduced. Various linear and non-linear filtering operations are incorporated by formulation as convex projections. An example algorithm for simultaneous time-frequency filtering and synthesis is suggested.

CPU timing routines for a CONVEX C220 computer system

NASA Technical Reports Server (NTRS)

Bynum, Mary Ann

1989-01-01

The timing routines available on the CONVEX C220 computer system in the Structural Mechanics Division (SMD) at NASA Langley Research Center are examined. The function of the timing routines, the use of the timing routines in sequential, parallel, and vector code, and the interpretation of the results from the timing routines with respect to the CONVEX model of computing are described. The timing routines available on the SMD CONVEX fall into two groups. The first group includes standard timing routines generally available with UNIX 4.3 BSD operating systems, while the second group includes routines unique to the SMD CONVEX. The standard timing routines described in this report are /bin/csh time,/bin/time, etime, and ctime. The routines unique to the SMD CONVEX are getinfo, second, cputime, toc, and a parallel profiling package made up of palprof, palinit, and palsum.

Image deblurring based on nonlocal regularization with a non-convex sparsity constraint

NASA Astrophysics Data System (ADS)

Zhu, Simiao; Su, Zhenming; Li, Lian; Yang, Yi

2018-04-01

In recent years, nonlocal regularization methods for image restoration (IR) have drawn more and more attention due to the promising results obtained when compared to the traditional local regularization methods. Despite the success of this technique, in order to obtain computational efficiency, a convex regularizing functional is exploited in most existing methods, which is equivalent to imposing a convex prior on the nonlocal difference operator output. However, our conducted experiment illustrates that the empirical distribution of the output of the nonlocal difference operator especially in the seminal work of Kheradmand et al. should be characterized with an extremely heavy-tailed distribution rather than a convex distribution. Therefore, in this paper, we propose a nonlocal regularization-based method with a non-convex sparsity constraint for image deblurring. Finally, an effective algorithm is developed to solve the corresponding non-convex optimization problem. The experimental results demonstrate the effectiveness of the proposed method.

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

PubMed

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.

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

PubMed

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

2018-03-16

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

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

Engberg, L; KTH Royal Institute of Technology, Stockholm; Eriksson, K

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

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ungun, B; Stanford University School of Medicine, Stanford, CA; Fu, A

2016-06-15

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

Improvement of magnetorheological finishing surface quality by nanoparticle jet polishing

NASA Astrophysics Data System (ADS)

Peng, Wenqiang; Li, Shengyi; Guan, Chaoliang; Shen, Xinmin; Dai, Yifan; Wang, Zhuo

2013-04-01

Nanoparticle jet polishing (NJP) is presented as a posttreatment to remove magnetorheological finishing (MRF) marks. In the NJP process the material is removed by chemical impact reaction, and the material removal rate of convex part is larger than that of the concave part. Smoothing thus can progress automatically in the NJP process. In the experiment, a silica glass sample polished by MRF was polished by NJP. Experiment results showed the MRF marks were removed clearly. The uniform polishing process shows that the NJP process can remove the MRF marks without destroying the original surface figure. The surface root-mean-square roughness is improved from 0.72 to 0.41 nm. power spectral density analysis indicates the surface quality is improved, and the experimental result validates effective removal of MRF marks by NJP.

CVXPY: A Python-Embedded Modeling Language for Convex Optimization

PubMed Central

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. PMID:27375369

A 'range test' for determining scatterers with unknown physical properties

NASA Astrophysics Data System (ADS)

Potthast, Roland; Sylvester, John; Kusiak, Steven

2003-06-01

We describe a new scheme for determining the convex scattering support of an unknown scatterer when the physical properties of the scatterers are not known. The convex scattering support is a subset of the scatterer and provides information about its location and estimates for its shape. For convex polygonal scatterers the scattering support coincides with the scatterer and we obtain full shape reconstructions. The method will be formulated for the reconstruction of the scatterers from the far field pattern for one or a few incident waves. The method is non-iterative in nature and belongs to the type of recently derived generalized sampling schemes such as the 'no response test' of Luke-Potthast. The range test operates by testing whether it is possible to analytically continue a far field to the exterior of any test domain Omegatest. By intersecting the convex hulls of various test domains we can produce a minimal convex set, the convex scattering support of which must be contained in the convex hull of the support of any scatterer which produces that far field. The convex scattering support is calculated by testing the range of special integral operators for a sampling set of test domains. The numerical results can be used as an approximation for the support of the unknown scatterer. We prove convergence and regularity of the scheme and show numerical examples for sound-soft, sound-hard and medium scatterers. We can apply the range test to non-convex scatterers as well. We can conclude that an Omegatest which passes the range test has a non-empty intersection with the infinity-support (the complement of the unbounded component of the complement of the support) of the true scatterer, but cannot find a minimal set which must be contained therein.

Algebraic Structure of Dynamical Systems

DTIC Science & Technology

2017-05-22

to suggest that the mathematics performed in this research will have such profound 10 implications, but just to demonstrate that studying math for...the sake of studying math can often reveal much about the world, even if not immediately obvious. Throughout the paper, we prove the following three...Banach and Alfred Tarski. Sur la décomposition des ensembles de points en parties respectivement congruentes. Fund. math , 6(1924):244–277, 1924. [3

Optimal Control of Evolution Mixed Variational Inclusions

DOE Office of Scientific and Technical Information (OSTI.GOV)

Alduncin, Gonzalo, E-mail: alduncin@geofisica.unam.mx

2013-12-15

Optimal control problems of primal and dual evolution mixed variational inclusions, in reflexive Banach spaces, are studied. The solvability analysis of the mixed state systems is established via duality principles. The optimality analysis is performed in terms of perturbation conjugate duality methods, and proximation penalty-duality algorithms to mixed optimality conditions are further presented. Applications to nonlinear diffusion constrained problems as well as quasistatic elastoviscoplastic bilateral contact problems exemplify the theory.

The stability of quadratic-reciprocal functional equation

NASA Astrophysics Data System (ADS)

Song, Aimin; Song, Minwei

2018-04-01

A new quadratic-reciprocal functional equation f ((k +1 )x +k y )+f ((k +1 )x -k y )=2/f (x )f (y )[(k+1 ) 2f (y )+k2f (x )] [(k+1)2f (y )-k2f (x )] 2 is introduced. The Hyers-Ulam stability for the quadratic-reciprocal functional equations is proved in Banach spaces using the direct method and the fixed point method, respectively.

Application of functional analysis to perturbation theory of differential equations. [nonlinear perturbation of the harmonic oscillator

NASA Technical Reports Server (NTRS)

Bogdan, V. M.; Bond, V. B.

1980-01-01

The deviation of the solution of the differential equation y' = f(t, y), y(O) = y sub O from the solution of the perturbed system z' = f(t, z) + g(t, z), z(O) = z sub O was investigated for the case where f and g are continuous functions on I x R sup n into R sup n, where I = (o, a) or I = (o, infinity). These functions are assumed to satisfy the Lipschitz condition in the variable z. The space Lip(I) of all such functions with suitable norms forms a Banach space. By introducing a suitable norm in the space of continuous functions C(I), introducing the problem can be reduced to an equivalent problem in terminology of operators in such spaces. A theorem on existence and uniqueness of the solution is presented by means of Banach space technique. Norm estimates on the rate of growth of such solutions are found. As a consequence, estimates of deviation of a solution due to perturbation are obtained. Continuity of the solution on the initial data and on the perturbation is established. A nonlinear perturbation of the harmonic oscillator is considered a perturbation of equations of the restricted three body problem linearized at libration point.

Duality of caustics in Minkowski billiards

NASA Astrophysics Data System (ADS)

Artstein-Avidan, S.; Florentin, D. I.; Ostrover, Y.; Rosen, D.

2018-04-01

In this paper we study convex caustics in Minkowski billiards. We show that for the Euclidean billiard dynamics in a planar smooth, centrally symmetric, strictly convex body K, for every convex caustic which K possesses, the ‘dual’ billiard dynamics in which the table is the Euclidean unit ball and the geometry that governs the motion is induced by the body K, possesses a dual convex caustic. Such a pair of caustics are dual in a strong sense, and in particular they have the same perimeter, Lazutkin parameter (both measured with respect to the corresponding geometries), and rotation number. We show moreover that for general Minkowski billiards this phenomenon fails, and one can construct a smooth caustic in a Minkowski billiard table which possesses no dual convex caustic.

Multi-Stage Convex Relaxation Methods for Machine Learning

DTIC Science & Technology

2013-03-01

Many problems in machine learning can be naturally formulated as non-convex optimization problems. However, such direct nonconvex formulations have...original nonconvex formulation. We will develop theoretical properties of this method and algorithmic consequences. Related convex and nonconvex machine learning methods will also be investigated.

Nonconvex Sparse Logistic Regression With Weakly Convex Regularization

NASA Astrophysics Data System (ADS)

Shen, Xinyue; Gu, Yuantao

2018-06-01

In this work we propose to fit a sparse logistic regression model by a weakly convex regularized nonconvex optimization problem. The idea is based on the finding that a weakly convex function as an approximation of the $\\ell_0$ pseudo norm is able to better induce sparsity than the commonly used $\\ell_1$ norm. For a class of weakly convex sparsity inducing functions, we prove the nonconvexity of the corresponding sparse logistic regression problem, and study its local optimality conditions and the choice of the regularization parameter to exclude trivial solutions. Despite the nonconvexity, a method based on proximal gradient descent is used to solve the general weakly convex sparse logistic regression, and its convergence behavior is studied theoretically. Then the general framework is applied to a specific weakly convex function, and a necessary and sufficient local optimality condition is provided. The solution method is instantiated in this case as an iterative firm-shrinkage algorithm, and its effectiveness is demonstrated in numerical experiments by both randomly generated and real datasets.

Assessing the influence of lower facial profile convexity on perceived attractiveness in the orthognathic patient, clinician, and layperson.

PubMed

Naini, Farhad B; Donaldson, Ana Nora A; McDonald, Fraser; Cobourne, Martyn T

2012-09-01

The aim was a quantitative evaluation of how the severity of lower facial profile convexity influences perceived attractiveness. The lower facial profile of an idealized image was altered incrementally between 14° to -16°. Images were rated on a Likert scale by orthognathic patients, laypeople, and clinicians. Attractiveness ratings were greater for straight profiles in relation to convex/concave, with no significant difference between convex and concave profiles. Ratings decreased by 0.23 of a level for every degree increase in the convexity angle. Class II/III patients gave significantly reduced ratings of attractiveness and had greater desire for surgery than class I. A straight profile is perceived as most attractive and greater degrees of convexity or concavity deemed progressively less attractive, but a range of 10° to -12° may be deemed acceptable; beyond these values surgical correction is desired. Patients are most critical, and clinicians are more critical than laypeople. Copyright © 2012 Elsevier Inc. All rights reserved.

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

NASA Astrophysics Data System (ADS)

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.

Improving LED CCT uniformity using micropatterned films optimized by combining ray tracing and FDTD methods.

PubMed

Ding, Xinrui; Li, Jiasheng; Chen, Qiu; Tang, Yong; Li, Zongtao; Yu, Binhai

2015-02-09

Although the light-emitting diode (LED) has revolutionized lighting, the non-uniformity of its correlated color temperature (CCT) still remains a major concern. In this context, to improve the light distribution performance of remote phosphor LED lamps, we employ a micropatterned array (MPA) optical film fabricated using a low-cost molding process. The parameters of the MPA, including different installation configurations, positioning, and diameters, are optimized by combining the finite-difference time-domain and ray-tracing methods. Results show that the sample with the upward-facing convex-cone MPA film that has a diameter of half of that of the remote phosphor glass, and is tightly affixed to the inward surface of the remote phosphor glass renders a superior light distribution performance. When compared with the case in which no MPA film is used, the deviation of the CCT distribution decreases from 1033 K to 223 K, and the corresponding output power of the sample is an acceptable level of 85.6%. We perform experiments to verify our simulation results, and the two sets of results exhibit a close agreement. We believe that our approach can be used to optimize MPA films for various lighting applications.

Probabilistic Guidance of Swarms using Sequential Convex Programming

DTIC Science & Technology

2014-01-01

quadcopter fleet [24]. In this paper, sequential convex programming (SCP) [25] is implemented using model predictive control (MPC) to provide real-time...in order to make Problem 1 convex. The details for convexifying this problem can be found in [26]. The main steps are discretizing the problem using

Rapid figure-ground responses to stereograms reveal an advantage for a convex foreground.

PubMed

Bertamini, Marco; Lawson, Rebecca

2008-01-01

Convexity has long been recognised as a factor that affects figure - ground segmentation, even when pitted against other factors such as symmetry [Kanizsa and Gerbino, 1976 Art and Artefacts Ed.M Henle (New York: Springer) pp 25-32]. It is accepted in the literature that the difference between concave and convex contours is important for the visual system, and that there is a prior expectation favouring convexities as figure. We used bipartite stimuli and a simple task in which observers had to report whether the foreground was on the left or the right. We report objective evidence that supports the idea that convexity affects figure-ground assignment, even though our stimuli were not pictorial in that depth order was specified unambiguously by binocular disparity.

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

PubMed

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.

Time Domain Version of the Uniform Geometrical Theory of Diffraction

NASA Astrophysics Data System (ADS)

Rousseau, Paul R.

1995-01-01

A time domain (TD) version of the uniform geometrical theory of diffraction which is referred to as the TD-UTD is developed to analyze the transient electromagnetic scattering from perfectly conducting objects that are large in terms of pulse width. In particular, the scattering from a perfectly conducting arbitrary curved wedge and an arbitrary smooth convex surface are treated in detail. Note that the canonical geometries of a circular cylinder and a sphere are special cases of the arbitrary smooth convex surface. These TD -UTD solutions are obtained in the form of relatively simple analytical expressions valid for early to intermediate times. The geometries treated here can be used to build up a transient solution to more complex radiating objects via space-time localization, in exactly the same way as is done by invoking spatial localization properties in the frequency domain UTD. The TD-UTD provides the response due to an excitation of a general astigmatic impulsive wavefront with any polarization. This generalized impulse response may then be convolved with other excitation time pulses, to find even more general solutions due to other excitation pulses. Since the TD-UTD uses the same rays as the frequency domain UTD, it provides a simple picture for transient radiation or scattering and is therefore just as physically appealing as the frequency domain UTD. The formulation of an analytic time transform (ATT), which produces an analytic time signal given a frequency response function, is given here. This ATT is used because it provides a very efficient method of inverting the asymptotic high frequency UTD representations to obtain the corresponding TD-UTD expressions even when there are special UTD transition functions which may not be well behaved at the low frequencies; also, using the ATT avoids the difficulties associated with the inversion of UTD ray fields that traverse line or smooth caustics. Another useful aspect of the ATT is the ability to perform an efficient convolution with a broad class of excitation pulse functions, where the frequency response of the excitation function must be expressed as a summation of complex exponential functions.

Irreducible structure, symmetry and average of Eshelby's tensor fields in isotropic elasticity

NASA Astrophysics Data System (ADS)

Zheng, Q.-S.; Zhao, Z.-H.; Du, D.-X.

2006-02-01

The strain field ɛ(x) in an infinitely large, homogenous, and isotropic elastic medium induced by a uniform eigenstrain ɛ0 in a domain ω depends linearly upon ɛ0 : ɛij(x)=Sijklω(x)ɛkl0. It has been a long-standing conjecture that the Eshelby's tensor field Sω(x) is uniform inside ω if and only if ω is ellipsoidally shaped. Because of the minor index symmetry Sijklω=Sjiklω=Sijlkω, Sω might have a maximum of 36 or nine independent components in three or two dimensions, respectively. In this paper, using the irreducible decomposition of Sω, we show that the isotropic part S of Sω vanishes outside ω and is uniform inside ω with the same value as the Eshelby's tensor S0 for 3D spherical or 2D circular domains. We further show that the anisotropic part Aω=Sω-S of Sω is characterized by a second- and a fourth-order deviatoric tensors and therefore have at maximum 14 or four independent components as characteristics of ω's geometry. Remarkably, the above irreducible structure of Sω is independent of ω's geometry (e.g., shape, orientation, connectedness, convexity, boundary smoothness, etc.). Interesting consequences have implication for a number of recently findings that, for example, both the values of Sω at the center of a 2D Cn(n⩾3,n≠4)-symmetric or 3D icosahedral ω and the average value of Sω over such a ω are equal to S0.

Convex reformulation of biologically-based multi-criteria intensity-modulated radiation therapy optimization including fractionation effects

NASA Astrophysics Data System (ADS)

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

2008-11-01

Finding fluence maps for intensity-modulated radiation therapy (IMRT) can be formulated as a multi-criteria optimization problem for which Pareto optimal treatment plans exist. To account for the dose-per-fraction effect of fractionated IMRT, it is desirable to exploit radiobiological treatment plan evaluation criteria based on the linear-quadratic (LQ) cell survival model as a means to balance the radiation benefits and risks in terms of biologic response. Unfortunately, the LQ-model-based radiobiological criteria are nonconvex functions, which make the optimization problem hard to solve. We apply the framework proposed by Romeijn et al (2004 Phys. Med. Biol. 49 1991-2013) to find transformations of LQ-model-based radiobiological functions and establish conditions under which transformed functions result in equivalent convex criteria that do not change the set of Pareto optimal treatment plans. The functions analysed are: the LQ-Poisson-based model for tumour control probability (TCP) with and without inter-patient heterogeneity in radiation sensitivity, the LQ-Poisson-based relative seriality s-model for normal tissue complication probability (NTCP), the equivalent uniform dose (EUD) under the LQ-Poisson model and the fractionation-corrected Probit-based model for NTCP according to Lyman, Kutcher and Burman. These functions differ from those analysed before in that they cannot be decomposed into elementary EUD or generalized-EUD functions. In addition, we show that applying increasing and concave transformations to the convexified functions is beneficial for the piecewise approximation of the Pareto efficient frontier.

A head-mounted compressive three-dimensional display system with polarization-dependent focus switching

NASA Astrophysics Data System (ADS)

Lee, Chang-Kun; Moon, Seokil; Lee, Byounghyo; Jeong, Youngmo; Lee, Byoungho

2016-10-01

A head-mounted compressive three-dimensional (3D) display system is proposed by combining polarization beam splitter (PBS), fast switching polarization rotator and micro display with high pixel density. According to the polarization state of the image controlled by polarization rotator, optical path of image in the PBS can be divided into transmitted and reflected components. Since optical paths of each image are spatially separated, it is possible to independently focus both images at different depth positions. Transmitted p-polarized and reflected s-polarized images can be focused by convex lens and mirror, respectively. When the focal lengths of the convex lens and mirror are properly determined, two image planes can be located in intended positions. The geometrical relationship is easily modulated by replacement of the components. The fast switching of polarization realizes the real-time operation of multi-focal image planes with a single display panel. Since it is possible to conserve the device characteristic of single panel, the high image quality, reliability and uniformity can be retained. For generating 3D images, layer images for compressive light field display between two image planes are calculated. Since the display panel with high pixel density is adopted, high quality 3D images are reconstructed. In addition, image degradation by diffraction between physically stacked display panels can be mitigated. Simple optical configuration of the proposed system is implemented and the feasibility of the proposed method is verified through experiments.

The Knaster-Kuratowski-Mazurkiewicz theorem and abstract convexities

NASA Astrophysics Data System (ADS)

Cain, George L., Jr.; González, Luis

2008-02-01

The Knaster-Kuratowski-Mazurkiewicz covering theorem (KKM), is the basic ingredient in the proofs of many so-called "intersection" theorems and related fixed point theorems (including the famous Brouwer fixed point theorem). The KKM theorem was extended from Rn to Hausdorff linear spaces by Ky Fan. There has subsequently been a plethora of attempts at extending the KKM type results to arbitrary topological spaces. Virtually all these involve the introduction of some sort of abstract convexity structure for a topological space, among others we could mention H-spaces and G-spaces. We have introduced a new abstract convexity structure that generalizes the concept of a metric space with a convex structure, introduced by E. Michael in [E. Michael, Convex structures and continuous selections, Canad. J. MathE 11 (1959) 556-575] and called a topological space endowed with this structure an M-space. In an article by Shie Park and Hoonjoo Kim [S. Park, H. Kim, Coincidence theorems for admissible multifunctions on generalized convex spaces, J. Math. Anal. Appl. 197 (1996) 173-187], the concepts of G-spaces and metric spaces with Michael's convex structure, were mentioned together but no kind of relationship was shown. In this article, we prove that G-spaces and M-spaces are close related. We also introduce here the concept of an L-space, which is inspired in the MC-spaces of J.V. Llinares [J.V. Llinares, Unified treatment of the problem of existence of maximal elements in binary relations: A characterization, J. Math. Econom. 29 (1998) 285-302], and establish relationships between the convexities of these spaces with the spaces previously mentioned.

Fractional representation theory - Robustness results with applications to finite dimensional control of a class of linear distributed systems

NASA Technical Reports Server (NTRS)

Nett, C. N.; Jacobson, C. A.; Balas, M. J.

1983-01-01

This paper reviews and extends the fractional representation theory. In particular, new and powerful robustness results are presented. This new theory is utilized to develop a preliminary design methodology for finite dimensional control of a class of linear evolution equations on a Banach space. The design is for stability in an input-output sense, but particular attention is paid to internal stability as well.

A path following algorithm for the graph matching problem.

PubMed

Zaslavskiy, Mikhail; Bach, Francis; Vert, Jean-Philippe

2009-12-01

We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted graph matching problem as a least-square problem on the set of permutation matrices and relaxing it to two different optimization problems: a quadratic convex and a quadratic concave optimization problem on the set of doubly stochastic matrices. The concave relaxation has the same global minimum as the initial graph matching problem, but the search for its global minimum is also a hard combinatorial problem. We, therefore, construct an approximation of the concave problem solution by following a solution path of a convex-concave problem obtained by linear interpolation of the convex and concave formulations, starting from the convex relaxation. This method allows to easily integrate the information on graph label similarities into the optimization problem, and therefore, perform labeled weighted graph matching. The algorithm is compared with some of the best performing graph matching methods on four data sets: simulated graphs, QAPLib, retina vessel images, and handwritten Chinese characters. In all cases, the results are competitive with the state of the art.

Nested Conjugate Gradient Algorithm with Nested Preconditioning for Non-linear Image Restoration.

PubMed

Skariah, Deepak G; Arigovindan, Muthuvel

2017-06-19

We develop a novel optimization algorithm, which we call Nested Non-Linear Conjugate Gradient algorithm (NNCG), for image restoration based on quadratic data fitting and smooth non-quadratic regularization. The algorithm is constructed as a nesting of two conjugate gradient (CG) iterations. The outer iteration is constructed as a preconditioned non-linear CG algorithm; the preconditioning is performed by the inner CG iteration that is linear. The inner CG iteration, which performs preconditioning for outer CG iteration, itself is accelerated by an another FFT based non-iterative preconditioner. We prove that the method converges to a stationary point for both convex and non-convex regularization functionals. We demonstrate experimentally that proposed method outperforms the well-known majorization-minimization method used for convex regularization, and a non-convex inertial-proximal method for non-convex regularization functional.

Convex set and linear mixing model

NASA Technical Reports Server (NTRS)

Xu, P.; Greeley, R.

1993-01-01

A major goal of optical remote sensing is to determine surface compositions of the earth and other planetary objects. For assessment of composition, single pixels in multi-spectral images usually record a mixture of the signals from various materials within the corresponding surface area. In this report, we introduce a closed and bounded convex set as a mathematical model for linear mixing. This model has a clear geometric implication because the closed and bounded convex set is a natural generalization of a triangle in n-space. The endmembers are extreme points of the convex set. Every point in the convex closure of the endmembers is a linear mixture of those endmembers, which is exactly how linear mixing is defined. With this model, some general criteria for selecting endmembers could be described. This model can lead to a better understanding of linear mixing models.

Fabrication of polymer micro-lens array with pneumatically diaphragm-driven drop-on-demand inkjet technology.

PubMed

Xie, Dan; Zhang, Honghai; Shu, Xiayun; Xiao, Junfeng

2012-07-02

The paper reports an effective method to fabricate micro-lens arrays with the ultraviolet-curable polymer, using an original pneumatically diaphragm-driven drop-on-demand inkjet system. An array of plano convex micro-lenses can be formed on the glass substrate due to surface tension and hydrophobic effect. The micro-lens arrays have uniform focusing function, smooth and real planar surface. The fabrication process showed good repeatability as well, fifty micro-lenses randomly selected form 9 × 9 miro-lens array with an average diameter of 333.28μm showed 1.1% variations. Also, the focal length, the surface roughness and optical property of the fabricated micro-lenses are measured, analyzed and proved satisfactory. The technique shows great potential for fabricating polymer micro-lens arrays with high flexibility, simple technological process and low production cost.

Method and system using power modulation for maskless vapor deposition of spatially graded thin film and multilayer coatings with atomic-level precision and accuracy

DOEpatents

Montcalm, Claude [Livermore, CA; Folta, James Allen [Livermore, CA; Tan, Swie-In [San Jose, CA; Reiss, Ira [New City, NY

2002-07-30

A method and system for producing a film (preferably a thin film with highly uniform or highly accurate custom graded thickness) on a flat or graded substrate (such as concave or convex optics), by sweeping the substrate across a vapor deposition source operated with time-varying flux distribution. In preferred embodiments, the source is operated with time-varying power applied thereto during each sweep of the substrate to achieve the time-varying flux distribution as a function of time. A user selects a source flux modulation recipe for achieving a predetermined desired thickness profile of the deposited film. The method relies on precise modulation of the deposition flux to which a substrate is exposed to provide a desired coating thickness distribution.

SU-D-BRA-04: Computerized Framework for Marker-Less Localization of Anatomical Feature Points in Range Images Based On Differential Geometry Features for Image-Guided Radiation Therapy

DOE Office of Scientific and Technical Information (OSTI.GOV)

Soufi, M; Arimura, H; Toyofuku, F

Purpose: To propose a computerized framework for localization of anatomical feature points on the patient surface in infrared-ray based range images by using differential geometry (curvature) features. Methods: The general concept was to reconstruct the patient surface by using a mathematical modeling technique for the computation of differential geometry features that characterize the local shapes of the patient surfaces. A region of interest (ROI) was firstly extracted based on a template matching technique applied on amplitude (grayscale) images. The extracted ROI was preprocessed for reducing temporal and spatial noises by using Kalman and bilateral filters, respectively. Next, a smooth patientmore » surface was reconstructed by using a non-uniform rational basis spline (NURBS) model. Finally, differential geometry features, i.e. the shape index and curvedness features were computed for localizing the anatomical feature points. The proposed framework was trained for optimizing shape index and curvedness thresholds and tested on range images of an anthropomorphic head phantom. The range images were acquired by an infrared ray-based time-of-flight (TOF) camera. The localization accuracy was evaluated by measuring the mean of minimum Euclidean distances (MMED) between reference (ground truth) points and the feature points localized by the proposed framework. The evaluation was performed for points localized on convex regions (e.g. apex of nose) and concave regions (e.g. nasofacial sulcus). Results: The proposed framework has localized anatomical feature points on convex and concave anatomical landmarks with MMEDs of 1.91±0.50 mm and 3.70±0.92 mm, respectively. A statistically significant difference was obtained between the feature points on the convex and concave regions (P<0.001). Conclusion: Our study has shown the feasibility of differential geometry features for localization of anatomical feature points on the patient surface in range images. The proposed framework might be useful for tasks involving feature-based image registration in range-image guided radiation therapy.« less

Anatomical study of the pelvis in patients with adolescent idiopathic scoliosis

PubMed Central

Qiu, Xu-Sheng; Zhang, Jun-Jie; Yang, Shang-Wen; Lv, Feng; Wang, Zhi-Wei; Chiew, Jonathan; Ma, Wei-Wei; Qiu, Yong

2012-01-01

Standing posterior–anterior (PA) radiographs from our clinical practice show that the concave and convex ilia are not always symmetrical in patients with adolescent idiopathic scoliosis (AIS). Transverse pelvic rotation may explain this observation, or pelvic asymmetry may be responsible. The present study investigated pelvic symmetry by examining the volume and linear measurements of the two hipbones in patients with AIS. Forty-two female patients with AIS were recruited for the study. Standing PA radiographs (covering the thoracic and lumbar spinal regions and the entire pelvis), CT scans and 3D reconstructions of the pelvis were obtained for all subjects. The concave/convex ratio of the inferior ilium at the sacroiliac joint medially (SI) and the anterior superior iliac spine laterally (ASIS) were measured on PA radiographs. Hipbone volumes and several distortion and abduction parameters were measured by post-processing software. The concave/convex ratio of SI–ASIS on PA radiographs was 0.97, which was significantly < 1 (P < 0.001). The concave and convex hipbone volumes were comparable in patients with AIS. The hipbone volumes were 257.3 ± 43.5 cm3 and 256.9 ± 42.6 cm3 at the concave and convex sides, respectively (P > 0.05). Furthermore, all distortion and abduction parameters were comparable between the convex and concave sides. Therefore, the present study showed that there was no pelvic asymmetry in patients with AIS, although the concave/convex ratio of SI–ASIS on PA radiographs was significantly < 1. The clinical phenomenon of asymmetrical concave and convex ilia in patients with AIS in preoperative standing PA radiographs may be caused by transverse pelvic rotation, but it is not due to developmental asymmetry or distortion of the pelvis. PMID:22133294

Anatomical study of the pelvis in patients with adolescent idiopathic scoliosis.

PubMed

Qiu, Xu-Sheng; Zhang, Jun-Jie; Yang, Shang-Wen; Lv, Feng; Wang, Zhi-Wei; Chiew, Jonathan; Ma, Wei-Wei; Qiu, Yong

2012-02-01

Standing posterior-anterior (PA) radiographs from our clinical practice show that the concave and convex ilia are not always symmetrical in patients with adolescent idiopathic scoliosis (AIS). Transverse pelvic rotation may explain this observation, or pelvic asymmetry may be responsible. The present study investigated pelvic symmetry by examining the volume and linear measurements of the two hipbones in patients with AIS. Forty-two female patients with AIS were recruited for the study. Standing PA radiographs (covering the thoracic and lumbar spinal regions and the entire pelvis), CT scans and 3D reconstructions of the pelvis were obtained for all subjects. The concave/convex ratio of the inferior ilium at the sacroiliac joint medially (SI) and the anterior superior iliac spine laterally (ASIS) were measured on PA radiographs. Hipbone volumes and several distortion and abduction parameters were measured by post-processing software. The concave/convex ratio of SI-ASIS on PA radiographs was 0.97, which was significantly < 1 (P < 0.001). The concave and convex hipbone volumes were comparable in patients with AIS. The hipbone volumes were 257.3 ± 43.5 cm(3) and 256.9 ± 42.6 cm(3) at the concave and convex sides, respectively (P > 0.05). Furthermore, all distortion and abduction parameters were comparable between the convex and concave sides. Therefore, the present study showed that there was no pelvic asymmetry in patients with AIS, although the concave/convex ratio of SI-ASIS on PA radiographs was significantly < 1. The clinical phenomenon of asymmetrical concave and convex ilia in patients with AIS in preoperative standing PA radiographs may be caused by transverse pelvic rotation, but it is not due to developmental asymmetry or distortion of the pelvis. © 2011 The Authors. Journal of Anatomy © 2011 Anatomical Society.

On the convexity of ROC curves estimated from radiological test results

PubMed Central

Pesce, Lorenzo L.; Metz, Charles E.; Berbaum, Kevin S.

2010-01-01

Rationale and Objectives Although an ideal observer’s receiver operating characteristic (ROC) curve must be convex — i.e., its slope must decrease monotonically — published fits to empirical data often display “hooks.” Such fits sometimes are accepted on the basis of an argument that experiments are done with real, rather than ideal, observers. However, the fact that ideal observers must produce convex curves does not imply that convex curves describe only ideal observers. This paper aims to identify the practical implications of non-convex ROC curves and the conditions that can lead to empirical and/or fitted ROC curves that are not convex. Materials and Methods This paper views non-convex ROC curves from historical, theoretical and statistical perspectives, which we describe briefly. We then consider population ROC curves with various shapes and analyze the types of medical decisions that they imply. Finally, we describe how sampling variability and curve-fitting algorithms can produce ROC curve estimates that include hooks. Results We show that hooks in population ROC curves imply the use of an irrational decision strategy, even when the curve doesn’t cross the chance line, and therefore usually are untenable in medical settings. Moreover, we sketch a simple approach to improve any non-convex ROC curve by adding statistical variation to the decision process. Finally, we sketch how to test whether hooks present in ROC data are likely to have been caused by chance alone and how some hooked ROCs found in the literature can be easily explained as fitting artifacts or modeling issues. Conclusion In general, ROC curve fits that show hooks should be looked upon with suspicion unless other arguments justify their presence. PMID:20599155

Investigations into the shape-preserving interpolants using symbolic computation

NASA Technical Reports Server (NTRS)

Lam, Maria

1988-01-01

Shape representation is a central issue in computer graphics and computer-aided geometric design. Many physical phenomena involve curves and surfaces that are monotone (in some directions) or are convex. The corresponding representation problem is given some monotone or convex data, and a monotone or convex interpolant is found. Standard interpolants need not be monotone or convex even though they may match monotone or convex data. Most of the methods of investigation of this problem involve the utilization of quadratic splines or Hermite polynomials. In this investigation, a similar approach is adopted. These methods require derivative information at the given data points. The key to the problem is the selection of the derivative values to be assigned to the given data points. Schemes for choosing derivatives were examined. Along the way, fitting given data points by a conic section has also been investigated as part of the effort to study shape-preserving quadratic splines.

Congruency effects in dot comparison tasks: convex hull is more important than dot area.

PubMed

Gilmore, Camilla; Cragg, Lucy; Hogan, Grace; Inglis, Matthew

2016-11-16

The dot comparison task, in which participants select the more numerous of two dot arrays, has become the predominant method of assessing Approximate Number System (ANS) acuity. Creation of the dot arrays requires the manipulation of visual characteristics, such as dot size and convex hull. For the task to provide a valid measure of ANS acuity, participants must ignore these characteristics and respond on the basis of number. Here, we report two experiments that explore the influence of dot area and convex hull on participants' accuracy on dot comparison tasks. We found that individuals' ability to ignore dot area information increases with age and display time. However, the influence of convex hull information remains stable across development and with additional time. This suggests that convex hull information is more difficult to inhibit when making judgements about numerosity and therefore it is crucial to control this when creating dot comparison tasks.

Space ultra-vacuum facility and method of operation

NASA Technical Reports Server (NTRS)

Naumann, Robert J. (Inventor)

1988-01-01

A wake shield space processing facility (10) for maintaining ultra-high levels of vacuum is described. The wake shield (12) is a truncated hemispherical section having a convex side (14) and a concave side (24). Material samples (68) to be processed are located on the convex side of the shield, which faces in the wake direction in operation in orbit. Necessary processing fixtures (20) and (22) are also located on the convex side. Support equipment including power supplies (40, 42), CMG package (46) and electronic control package (44) are located on the convex side (24) of the shield facing the ram direction. Prior to operation in orbit the wake shield is oriented in reverse with the convex side facing the ram direction to provide cleaning by exposure to ambient atomic oxygen. The shield is then baked-out by being pointed directed at the sun to obtain heating for a suitable period.

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

PubMed

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.

Semi-inner-products in Banach Spaces with Applications to Regularized Learning, Sampling, and Sparse Approximation

DTIC Science & Technology

2016-03-13

dynamics of percept formation modeled as operant (selectionist) process, Cognitive Neurodynamics , (08 2013): 0. doi: 10.1007/s11571-013-9262-0 Jun Zhang... cognitive principles for categorization. Our execution plan include three specific topics (“Aims”) 1. REPORT DATE (DD-MM-YYYY) 4. TITLE AND SUBTITLE 13...while rooted in human cognitive principles for categorization. Our execution plan include three specific topics (“Aims”) 1. Apply RKBS theory to

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

PubMed

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.

Natural-Scene Statistics Predict How the Figure–Ground Cue of Convexity Affects Human Depth Perception

PubMed Central

Fowlkes, Charless C.; Banks, Martin S.

2010-01-01

The shape of the contour separating two regions strongly influences judgments of which region is “figure” and which is “ground.” Convexity and other figure–ground cues are generally assumed to indicate only which region is nearer, but nothing about how much the regions are separated in depth. To determine the depth information conveyed by convexity, we examined natural scenes and found that depth steps across surfaces with convex silhouettes are likely to be larger than steps across surfaces with concave silhouettes. In a psychophysical experiment, we found that humans exploit this correlation. For a given binocular disparity, observers perceived more depth when the near surface's silhouette was convex rather than concave. We estimated the depth distributions observers used in making those judgments: they were similar to the natural-scene distributions. Our findings show that convexity should be reclassified as a metric depth cue. They also suggest that the dichotomy between metric and nonmetric depth cues is false and that the depth information provided many cues should be evaluated with respect to natural-scene statistics. Finally, the findings provide an explanation for why figure–ground cues modulate the responses of disparity-sensitive cells in visual cortex. PMID:20505093

Convex Banding of the Covariance Matrix

PubMed Central

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. PMID:28042189

Convex Banding of the Covariance Matrix.

PubMed

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.

Evolution inclusions governed by the difference of two subdifferentials in reflexive Banach spaces

NASA Astrophysics Data System (ADS)

Akagi, Goro; Ôtani, Mitsuharu

The existence of strong solutions of Cauchy problem for the following evolution equation du(t)/dt+∂ϕ1(u(t))-∂ϕ2(u(t))∋f(t) is considered in a real reflexive Banach space V, where ∂ϕ1 and ∂ϕ2 are subdifferential operators from V into its dual V*. The study for this type of problems has been done by several authors in the Hilbert space setting. The scope of our study is extended to the V- V* setting. The main tool employed here is a certain approximation argument in a Hilbert space and for this purpose we need to assume that there exists a Hilbert space H such that V⊂H≡H*⊂V* with densely defined continuous injections. The applicability of our abstract framework will be exemplified in discussing the existence of solutions for the nonlinear heat equation: ut(x,t)-Δpu(x,t)-|u|u(x,t)=f(x,t), x∈Ω, t>0, u|=0, where Ω is a bounded domain in RN. In particular, the existence of local (in time) weak solution is shown under the subcritical growth condition q

Statistical estimation via convex optimization for trending and performance monitoring

NASA Astrophysics Data System (ADS)

Samar, Sikandar

This thesis presents an optimization-based statistical estimation approach to find unknown trends in noisy data. A Bayesian framework is used to explicitly take into account prior information about the trends via trend models and constraints. The main focus is on convex formulation of the Bayesian estimation problem, which allows efficient computation of (globally) optimal estimates. There are two main parts of this thesis. The first part formulates trend estimation in systems described by known detailed models as a convex optimization problem. Statistically optimal estimates are then obtained by maximizing a concave log-likelihood function subject to convex constraints. We consider the problem of increasing problem dimension as more measurements become available, and introduce a moving horizon framework to enable recursive estimation of the unknown trend by solving a fixed size convex optimization problem at each horizon. We also present a distributed estimation framework, based on the dual decomposition method, for a system formed by a network of complex sensors with local (convex) estimation. Two specific applications of the convex optimization-based Bayesian estimation approach are described in the second part of the thesis. Batch estimation for parametric diagnostics in a flight control simulation of a space launch vehicle is shown to detect incipient fault trends despite the natural masking properties of feedback in the guidance and control loops. Moving horizon approach is used to estimate time varying fault parameters in a detailed nonlinear simulation model of an unmanned aerial vehicle. An excellent performance is demonstrated in the presence of winds and turbulence.

Piecewise convexity of artificial neural networks.

PubMed

Rister, Blaine; Rubin, Daniel L

2017-10-01

Although artificial neural networks have shown great promise in applications including computer vision and speech recognition, there remains considerable practical and theoretical difficulty in optimizing their parameters. The seemingly unreasonable success of gradient descent methods in minimizing these non-convex functions remains poorly understood. In this work we offer some theoretical guarantees for networks with piecewise affine activation functions, which have in recent years become the norm. We prove three main results. First, that the network is piecewise convex as a function of the input data. Second, that the network, considered as a function of the parameters in a single layer, all others held constant, is again piecewise convex. Third, that the network as a function of all its parameters is piecewise multi-convex, a generalization of biconvexity. From here we characterize the local minima and stationary points of the training objective, showing that they minimize the objective on certain subsets of the parameter space. We then analyze the performance of two optimization algorithms on multi-convex problems: gradient descent, and a method which repeatedly solves a number of convex sub-problems. We prove necessary convergence conditions for the first algorithm and both necessary and sufficient conditions for the second, after introducing regularization to the objective. Finally, we remark on the remaining difficulty of the global optimization problem. Under the squared error objective, we show that by varying the training data, a single rectifier neuron admits local minima arbitrarily far apart, both in objective value and parameter space. Copyright © 2017 Elsevier Ltd. All rights reserved.

On equivalent characterizations of convexity of functions

NASA Astrophysics Data System (ADS)

Gkioulekas, Eleftherios

2013-04-01

A detailed development of the theory of convex functions, not often found in complete form in most textbooks, is given. We adopt the strict secant line definition as the definitive definition of convexity. We then show that for differentiable functions, this definition becomes logically equivalent with the first derivative monotonicity definition and the tangent line definition. Consequently, for differentiable functions, all three characterizations are logically equivalent.

Asymmetric Bulkheads for Cylindrical Pressure Vessels

NASA Technical Reports Server (NTRS)

Ford, Donald B.

2007-01-01

Asymmetric bulkheads are proposed for the ends of vertically oriented cylindrical pressure vessels. These bulkheads, which would feature both convex and concave contours, would offer advantages over purely convex, purely concave, and flat bulkheads (see figure). Intended originally to be applied to large tanks that hold propellant liquids for launching spacecraft, the asymmetric-bulkhead concept may also be attractive for terrestrial pressure vessels for which there are requirements to maximize volumetric and mass efficiencies. A description of the relative advantages and disadvantages of prior symmetric bulkhead configurations is prerequisite to understanding the advantages of the proposed asymmetric configuration: In order to obtain adequate strength, flat bulkheads must be made thicker, relative to concave and convex bulkheads; the difference in thickness is such that, other things being equal, pressure vessels with flat bulkheads must be made heavier than ones with concave or convex bulkheads. Convex bulkhead designs increase overall tank lengths, thereby necessitating additional supporting structure for keeping tanks vertical. Concave bulkhead configurations increase tank lengths and detract from volumetric efficiency, even though they do not necessitate additional supporting structure. The shape of a bulkhead affects the proportion of residual fluid in a tank that is, the portion of fluid that unavoidably remains in the tank during outflow and hence cannot be used. In this regard, a flat bulkhead is disadvantageous in two respects: (1) It lacks a single low point for optimum placement of an outlet and (2) a vortex that forms at the outlet during outflow prevents a relatively large amount of fluid from leaving the tank. A concave bulkhead also lacks a single low point for optimum placement of an outlet. Like purely concave and purely convex bulkhead configurations, the proposed asymmetric bulkhead configurations would be more mass-efficient than is the flat bulkhead configuration. In comparison with both purely convex and purely concave configurations, the proposed asymmetric configurations would offer greater volumetric efficiency. Relative to a purely convex bulkhead configuration, the corresponding asymmetric configuration would result in a shorter tank, thus demanding less supporting structure. An asymmetric configuration provides a low point for optimum location of a drain, and the convex shape at the drain location minimizes the amount of residual fluid.

Convexity of quantum χ2-divergence.

PubMed

Hansen, Frank

2011-06-21

The general quantum χ(2)-divergence has recently been introduced by Temme et al. [Temme K, Kastoryano M, Ruskai M, Wolf M, Verstrate F (2010) J Math Phys 51:122201] and applied to quantum channels (quantum Markov processes). The quantum χ(2)-divergence is not unique, as opposed to the classical χ(2)-divergence, but depends on the choice of quantum statistics. It was noticed that the elements in a particular one-parameter family of quantum χ(2)-divergences are convex functions in the density matrices (ρ,σ), thus mirroring the convexity of the classical χ(2)(p,q)-divergence in probability distributions (p,q). We prove that any quantum χ(2)-divergence is a convex function in its two arguments.

Momentum distribution of the uniform electron gas: Improved parametrization and exact limits of the cumulant expansion

NASA Astrophysics Data System (ADS)

Gori-Giorgi, Paola; Ziesche, Paul

2002-12-01

The momentum distribution of the unpolarized uniform electron gas in its Fermi-liquid regime, n(k,rs), with the momenta k measured in units of the Fermi wave number kF and with the density parameter rs, is constructed with the help of the convex Kulik function G(x). It is assumed that n(0,rs),n(1±,rs), the on-top pair density g(0,rs), and the kinetic energy t(rs) are known (respectively, from accurate calculations for rs=1,…,5, from the solution of the Overhauser model, and from quantum Monte Carlo calculations via the virial theorem). Information from the high- and the low-density limit, corresponding to the random-phase approximation and to the Wigner crystal limit, is used. The result is an accurate parametrization of n(k,rs), which fulfills most of the known exact constraints. It is in agreement with the effective-potential calculations of Takada and Yasuhara [Phys. Rev. B 44, 7879 (1991)], is compatible with quantum Monte Carlo data, and is valid in the density range rs≲12. The corresponding cumulant expansions of the pair density and of the static structure factor are discussed, and some exact limits are derived.

Open-Mode Debonding Analysis of Curved Sandwich Panels Subjected to Heating and Cryogenic Cooling on Opposite Faces

NASA Technical Reports Server (NTRS)

Ko, William L.

1999-01-01

Increasing use of curved sandwich panels as aerospace structure components makes it vital to fully understand their thermostructural behavior and identify key factors affecting the open-mode debonding failure. Open-mode debonding analysis is performed on a family of curved honeycomb-core sandwich panels with different radii of curvature. The curved sandwich panels are either simply supported or clamped, and are subjected to uniform heating on the convex side and uniform cryogenic cooling on the concave side. The finite-element method was used to study the effects of panel curvature and boundary condition on the open-mode stress (radial tensile stress) and displacement fields in the curved sandwich panels. The critical stress point, where potential debonding failure could initiate, was found to be at the midspan (or outer span) of the inner bonding interface between the sandwich core and face sheet on the concave side, depending on the boundary condition and panel curvature. Open-mode stress increases with increasing panel curvature, reaching a maximum value at certain high curvature, and then decreases slightly as the panel curvature continues to increase and approach that of quarter circle. Changing the boundary condition from simply supported to clamped reduces the magnitudes of open-mode stresses and the associated sandwich core depth stretching.

Method and system for producing sputtered thin films with sub-angstrom thickness uniformity or custom thickness gradients

DOEpatents

Folta, James A.; Montcalm, Claude; Walton, Christopher

2003-01-01

A method and system for producing a thin film with highly uniform (or highly accurate custom graded) thickness on a flat or graded substrate (such as concave or convex optics), by sweeping the substrate across a vapor deposition source with controlled (and generally, time-varying) velocity. In preferred embodiments, the method includes the steps of measuring the source flux distribution (using a test piece that is held stationary while exposed to the source), calculating a set of predicted film thickness profiles, each film thickness profile assuming the measured flux distribution and a different one of a set of sweep velocity modulation recipes, and determining from the predicted film thickness profiles a sweep velocity modulation recipe which is adequate to achieve a predetermined thickness profile. Aspects of the invention include a practical method of accurately measuring source flux distribution, and a computer-implemented method employing a graphical user interface to facilitate convenient selection of an optimal or nearly optimal sweep velocity modulation recipe to achieve a desired thickness profile on a substrate. Preferably, the computer implements an algorithm in which many sweep velocity function parameters (for example, the speed at which each substrate spins about its center as it sweeps across the source) can be varied or set to zero.

A Sparse Representation-Based Deployment Method for Optimizing the Observation Quality of Camera Networks

PubMed Central

Wang, Chang; Qi, Fei; Shi, Guangming; Wang, Xiaotian

2013-01-01

Deployment is a critical issue affecting the quality of service of camera networks. The deployment aims at adopting the least number of cameras to cover the whole scene, which may have obstacles to occlude the line of sight, with expected observation quality. This is generally formulated as a non-convex optimization problem, which is hard to solve in polynomial time. In this paper, we propose an efficient convex solution for deployment optimizing the observation quality based on a novel anisotropic sensing model of cameras, which provides a reliable measurement of the observation quality. The deployment is formulated as the selection of a subset of nodes from a redundant initial deployment with numerous cameras, which is an ℓ0 minimization problem. Then, we relax this non-convex optimization to a convex ℓ1 minimization employing the sparse representation. Therefore, the high quality deployment is efficiently obtained via convex optimization. Simulation results confirm the effectiveness of the proposed camera deployment algorithms. PMID:23989826

Entropy and convexity for nonlinear partial differential equations

PubMed Central

Ball, John M.; Chen, Gui-Qiang G.

2013-01-01

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. PMID:24249768

DOE Office of Scientific and Technical Information (OSTI.GOV)

Skala, Vaclav

There are many space subdivision and space partitioning techniques used in many algorithms to speed up computations. They mostly rely on orthogonal space subdivision, resp. using hierarchical data structures, e.g. BSP trees, quadtrees, octrees, kd-trees, bounding volume hierarchies etc. However in some applications a non-orthogonal space subdivision can offer new ways for actual speed up. In the case of convex polygon in E{sup 2} a simple Point-in-Polygon test is of the O(N) complexity and the optimal algorithm is of O(log N) computational complexity. In the E{sup 3} case, the complexity is O(N) even for the convex polyhedron as no orderingmore » is defined. New Point-in-Convex Polygon and Point-in-Convex Polyhedron algorithms are presented based on space subdivision in the preprocessing stage resulting to O(1) run-time complexity. The presented approach is simple to implement. Due to the principle of duality, dual problems, e.g. line-convex polygon, line clipping, can be solved in a similarly.« less

Stochastic Dual Algorithm for Voltage Regulation in Distribution Networks with Discrete Loads: Preprint

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dall-Anese, Emiliano; Zhou, Xinyang; Liu, Zhiyuan

This paper considers distribution networks with distributed energy resources and discrete-rate loads, and designs an incentive-based algorithm that allows the network operator and the customers to pursue given operational and economic objectives, while concurrently ensuring that voltages are within prescribed limits. Four major challenges include: (1) the non-convexity from discrete decision variables, (2) the non-convexity due to a Stackelberg game structure, (3) unavailable private information from customers, and (4) different update frequency from two types of devices. In this paper, we first make convex relaxation for discrete variables, then reformulate the non-convex structure into a convex optimization problem together withmore » pricing/reward signal design, and propose a distributed stochastic dual algorithm for solving the reformulated problem while restoring feasible power rates for discrete devices. By doing so, we are able to statistically achieve the solution of the reformulated problem without exposure of any private information from customers. Stability of the proposed schemes is analytically established and numerically corroborated.« less

H∞ memory feedback control with input limitation minimization for offshore jacket platform stabilization

NASA Astrophysics Data System (ADS)

Yang, Jia Sheng

2018-06-01

In this paper, we investigate a H∞ memory controller with input limitation minimization (HMCIM) for offshore jacket platforms stabilization. The main objective of this study is to reduce the control consumption as well as protect the actuator when satisfying the requirement of the system performance. First, we introduce a dynamic model of offshore platform with low order main modes based on mode reduction method in numerical analysis. Then, based on H∞ control theory and matrix inequality techniques, we develop a novel H∞ memory controller with input limitation. Furthermore, a non-convex optimization model to minimize input energy consumption is proposed. Since it is difficult to solve this non-convex optimization model by optimization algorithm, we use a relaxation method with matrix operations to transform this non-convex optimization model to be a convex optimization model. Thus, it could be solved by a standard convex optimization solver in MATLAB or CPLEX. Finally, several numerical examples are given to validate the proposed models and methods.

Entropy and convexity for nonlinear partial differential equations.

PubMed

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.

The roles of the convex hull and the number of potential intersections in performance on visually presented traveling salesperson problems.

PubMed

Vickers, Douglas; Lee, Michael D; Dry, Matthew; Hughes, Peter

2003-10-01

The planar Euclidean version of the traveling salesperson problem requires finding the shortest tour through a two-dimensional array of points. MacGregor and Ormerod (1996) have suggested that people solve such problems by using a global-to-local perceptual organizing process based on the convex hull of the array. We review evidence for and against this idea, before considering an alternative, local-to-global perceptual process, based on the rapid automatic identification of nearest neighbors. We compare these approaches in an experiment in which the effects of number of convex hull points and number of potential intersections on solution performance are measured. Performance worsened with more points on the convex hull and with fewer potential intersections. A measure of response uncertainty was unaffected by the number of convex hull points but increased with fewer potential intersections. We discuss a possible interpretation of these results in terms of a hierarchical solution process based on linking nearest neighbor clusters.

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhao Yunbin, E-mail: zhaoyy@maths.bham.ac.u

2010-12-15

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

CudaChain: an alternative algorithm for finding 2D convex hulls on the GPU.

PubMed

Mei, Gang

2016-01-01

This paper presents an alternative GPU-accelerated convex hull algorithm and a novel S orting-based P reprocessing A pproach (SPA) for planar point sets. The proposed convex hull algorithm termed as CudaChain consists of two stages: (1) two rounds of preprocessing performed on the GPU and (2) the finalization of calculating the expected convex hull on the CPU. Those interior points locating inside a quadrilateral formed by four extreme points are first discarded, and then the remaining points are distributed into several (typically four) sub regions. For each subset of points, they are first sorted in parallel; then the second round of discarding is performed using SPA; and finally a simple chain is formed for the current remaining points. A simple polygon can be easily generated by directly connecting all the chains in sub regions. The expected convex hull of the input points can be finally obtained by calculating the convex hull of the simple polygon. The library Thrust is utilized to realize the parallel sorting, reduction, and partitioning for better efficiency and simplicity. Experimental results show that: (1) SPA can very effectively detect and discard the interior points; and (2) CudaChain achieves 5×-6× speedups over the famous Qhull implementation for 20M points.

Existence and amplitude bounds for irrotational water waves in finite depth

NASA Astrophysics Data System (ADS)

Kogelbauer, Florian

2017-12-01

We prove the existence of solutions to the irrotational water-wave problem in finite depth and derive an explicit upper bound on the amplitude of the nonlinear solutions in terms of the wavenumber, the total hydraulic head, the wave speed and the relative mass flux. Our approach relies upon a reformulation of the water-wave problem as a one-dimensional pseudo-differential equation and the Newton-Kantorovich iteration for Banach spaces. This article is part of the theme issue 'Nonlinear water waves'.

Extrapolation of operators acting into quasi-Banach spaces

NASA Astrophysics Data System (ADS)

Lykov, K. V.

2016-01-01

Linear and sublinear operators acting from the scale of L_p spaces to a certain fixed quasinormed space are considered. It is shown how the extrapolation construction proposed by Jawerth and Milman at the end of 1980s can be used to extend a bounded action of an operator from the L_p scale to wider spaces. Theorems are proved which generalize Yano's extrapolation theorem to the case of a quasinormed target space. More precise results are obtained under additional conditions on the quasinorm. Bibliography: 35 titles.

REPRESENTATIONS OF WEAK AND STRONG INTEGRALS IN BANACH SPACES

PubMed Central

Brooks, James K.

1969-01-01

We establish a representation of the Gelfand-Pettis (weak) integral in terms of unconditionally convergent series. Moreover, absolute convergence of the series is a necessary and sufficient condition in order that the weak integral coincide with the Bochner integral. Two applications of the representation are given. The first is a simplified proof of the countable additivity and absolute continuity of the indefinite weak integral. The second application is to probability theory; we characterize the conditional expectation of a weakly integrable function. PMID:16591755

A parallel Discrete Element Method to model collisions between non-convex particles

NASA Astrophysics Data System (ADS)

Rakotonirina, Andriarimina Daniel; Delenne, Jean-Yves; Wachs, Anthony

2017-06-01

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.

The aerodynamic properties of thick aerofoils suitable for internal bracing

NASA Technical Reports Server (NTRS)

Norton, F H

1920-01-01

The object of this investigation was to determine the characteristics of various types of wings having sufficient depth to entirely inclose the wing bracing, and also to provide data for the further design of such sections. This type of wing is of interest because it eliminates the resistance of the interplane bracing, a portion of the airplane that sometimes absorbs one-quarter of the total power required to fly, and because these wings may be made to give a very high maximum lift. Results of the investigation of the following subjects are given: (1) effect of changing the upper and lower camber of thick aerofoils of uniform section; (2) effect of thickening the center and thinning the tips of a thin aerofoil; (3) effect of adding a convex lower surface to a tapered section; (4) effect of changing the mean thickness with constant center and tip sections; and (5) effect of varying the chord along the span.

Progress in turbulence modeling for complex flow fields including effects of compressibility

NASA Technical Reports Server (NTRS)

Wilcox, D. C.; Rubesin, M. W.

1980-01-01

Two second-order-closure turbulence models were devised that are suitable for predicting properties of complex turbulent flow fields in both incompressible and compressible fluids. One model is of the "two-equation" variety in which closure is accomplished by introducing an eddy viscosity which depends on both a turbulent mixing energy and a dissipation rate per unit energy, that is, a specific dissipation rate. The other model is a "Reynolds stress equation" (RSE) formulation in which all components of the Reynolds stress tensor and turbulent heat-flux vector are computed directly and are scaled by the specific dissipation rate. Computations based on these models are compared with measurements for the following flow fields: (a) low speed, high Reynolds number channel flows with plane strain or uniform shear; (b) equilibrium turbulent boundary layers with and without pressure gradients or effects of compressibility; and (c) flow over a convex surface with and without a pressure gradient.

Research on the innovative hybrid impact hydroforming

NASA Astrophysics Data System (ADS)

Lang, Lihui; Wang, Shaohua; Yang, Chunlei

2013-12-01

The innovative hybrid impact hydro-forming (IHF) technology is a kind of high strain rate forming technique which can be used for forming complex parts with small features, such as convex tables, bars etc. The present work investigates IHF using a numerical /experimental approach. In this paper, the theory of IHF is presented and finite element simulation was carried out by using MSC. The pressure distribution changes in the depth direction, but not in the width direction. However, the pressure is uniform everywhere in traditional hydro-forming. Using this shock wave loading conditions, forming experiments were carried out. Punching occurred as a result of combined tensile and shear stress effects. Furthermore, results show that using IHF technology, the design constraint to make precise die may be considerably reduced. The need to accurately control punch-die clearance may also be eliminated. Therefore, the research is very useful for forming complicated products.

Component having cooling channel with hourglass cross section

DOEpatents

Campbell, Christian X; Lee, Ching-Pang

2015-04-28

A cooling channel (36, 36B, 63-66) cools inner surfaces (48, 50) of exterior walls (41, 43) of a component (20, 60). Interior side surfaces (52, 54) of the channel converge to a waist (W2), forming an hourglass shaped transverse profile (46). The inner surfaces (48, 50) may have fins (44) aligned with the coolant flow (22). The fins may have a transverse profile (56A, 56B) highest at mid-width of the inner surfaces (48, 50). Turbulators (92) may be provided on the side surfaces (52, 54) of the channel, and may urge the coolant flow toward the inner surfaces (48, 50). Each turbulator (92) may have a peak (97) that defines the waist of the cooling channel. Each turbulator may have a convex upstream side (93). These elements increase coolant flow in the corners (C) of the channel to more uniformly and efficiently cool the exterior walls (41, 43).

Mirrors for High Resolution X-Ray Optics---Figure Preserving IR/PT Coating

NASA Technical Reports Server (NTRS)

Chan, Kai-Wing; Olsen, Lawrence; Sharpe, Marton; Numata, Ai; McClelland, Ryan; Saha, Timo; Zhang, Will

2016-01-01

Coating stress of 10 - 20 nm of Ir is sufficiently high to distort the figure of arc-second thin lightweight mirrors. For iridium: --Stress sigma 4 GPa for 15 nm film implies 60 Nm integrated stress-- Need less than 3 N/m (or stress less than 200 MPa) for sub-arcsecond optics. Basic Approaches for Mitigation. A. Annealing the film-- Glass can be heat up to 400 C without distortion. Silicon is even more resistant.-- It was found that recovery is limited by residual thermal stress from taking the mirror down from high T. B. Coating bi-layer films with compressive stress with tensile stress. C. Front-and-back coating with magnetron sputtering or atomic layer deposition-- Sputtering involve spanning of substrates. Geometric difference in setup (convexness/concaveness of curved mirrors) does not permit precise front-and-back matching-- Atomic layer deposition can provide a uniform deposition front and back simultaneously.

Quantitative Compactness Estimates for Hamilton-Jacobi Equations

NASA Astrophysics Data System (ADS)

Ancona, Fabio; Cannarsa, Piermarco; Nguyen, Khai T.

2016-02-01

We study quantitative compactness estimates in {W^{1,1}_{loc}} for the map {S_t}, {t > 0} that is associated with the given initial data {u_0in Lip (R^N)} for the corresponding solution {S_t u_0} of a Hamilton-Jacobi equation u_t+Hbig(nabla_{x} ubig)=0, qquad t≥ 0,quad xinR^N, with a uniformly convex Hamiltonian {H=H(p)}. We provide upper and lower estimates of order {1/\\varepsilon^N} on the Kolmogorov {\\varepsilon}-entropy in {W^{1,1}} of the image through the map S t of sets of bounded, compactly supported initial data. Estimates of this type are inspired by a question posed by Lax (Course on Hyperbolic Systems of Conservation Laws. XXVII Scuola Estiva di Fisica Matematica, Ravello, 2002) within the context of conservation laws, and could provide a measure of the order of "resolution" of a numerical method implemented for this equation.

Computational Efficiency of the Simplex Embedding Method in Convex Nondifferentiable Optimization

NASA Astrophysics Data System (ADS)

Kolosnitsyn, A. V.

2018-02-01

The simplex embedding method for solving convex nondifferentiable optimization problems is considered. A description of modifications of this method based on a shift of the cutting plane intended for cutting off the maximum number of simplex vertices is given. These modification speed up the problem solution. A numerical comparison of the efficiency of the proposed modifications based on the numerical solution of benchmark convex nondifferentiable optimization problems is presented.

Another convex combination of product states for the separable Werner state

DOE Office of Scientific and Technical Information (OSTI.GOV)

Azuma, Hiroo; Ban, Masashi; CREST, Japan Science and Technology Agency, 1-1-9 Yaesu, Chuo-ku, Tokyo 103-0028

2006-03-15

In this paper, we write down the separable Werner state in a two-qubit system explicitly as a convex combination of product states, which is different from the convex combination obtained by Wootters' method. The Werner state in a two-qubit system has a single real parameter and varies from inseparable to separable according to the value of its parameter. We derive a hidden variable model that is induced by our decomposed form for the separable Werner state. From our explicit form of the convex combination of product states, we understand the following: The critical point of the parameter for separability ofmore » the Werner state comes from positivity of local density operators of the qubits.« less

Thermal Protection System with Staggered Joints

NASA Technical Reports Server (NTRS)

Simon, Xavier D. (Inventor); Robinson, Michael J. (Inventor); Andrews, Thomas L. (Inventor)

2014-01-01

The thermal protection system disclosed herein is suitable for use with a spacecraft such as a reentry module or vehicle, where the spacecraft has a convex surface to be protected. An embodiment of the thermal protection system includes a plurality of heat resistant panels, each having an outer surface configured for exposure to atmosphere, an inner surface opposite the outer surface and configured for attachment to the convex surface of the spacecraft, and a joint edge defined between the outer surface and the inner surface. The joint edges of adjacent ones of the heat resistant panels are configured to mate with each other to form staggered joints that run between the peak of the convex surface and the base section of the convex surface.

A fast adaptive convex hull algorithm on two-dimensional processor arrays with a reconfigurable BUS system

NASA Technical Reports Server (NTRS)

Olariu, S.; Schwing, J.; Zhang, J.

1991-01-01

A bus system that can change dynamically to suit computational needs is referred to as reconfigurable. We present a fast adaptive convex hull algorithm on a two-dimensional processor array with a reconfigurable bus system (2-D PARBS, for short). Specifically, we show that computing the convex hull of a planar set of n points taken O(log n/log m) time on a 2-D PARBS of size mn x n with 3 less than or equal to m less than or equal to n. Our result implies that the convex hull of n points in the plane can be computed in O(1) time in a 2-D PARBS of size n(exp 1.5) x n.

The concave cusp as a determiner of figure-ground.

PubMed

Stevens, K A; Brookes, A

1988-01-01

The tendency to interpret as figure, relative to background, those regions that are lighter, smaller, and, especially, more convex is well known. Wherever convex opaque objects abut or partially occlude one another in an image, the points of contact between the silhouettes form concave cusps, each indicating the local assignment of figure versus ground across the contour segments. It is proposed that this local geometric feature is a preattentive determiner of figure-ground perception and that it contributes to the previously observed tendency for convexity preference. Evidence is presented that figure-ground assignment can be determined solely on the basis of the concave cusp feature, and that the salience of the cusp derives from local geometry and not from adjacent contour convexity.

Remodelling of the bovine placenta: Comprehensive morphological and histomorphological characterization at the late embryonic and early accelerated fetal growth stages.

PubMed

Estrella, Consuelo Amor S; Kind, Karen L; Derks, Anna; Xiang, Ruidong; Faulkner, Nicole; Mohrdick, Melina; Fitzsimmons, Carolyn; Kruk, Zbigniew; Grutzner, Frank; Roberts, Claire T; Hiendleder, Stefan

2017-07-01

Placental function impacts growth and development with lifelong consequences for performance and health. We provide novel insights into placental development in bovine, an important agricultural species and biomedical model. Concepti with defined genetics and sex were recovered from nulliparous dams managed under standardized conditions to study placental gross morphological and histomorphological parameters at the late embryo (Day48) and early accelerated fetal growth (Day153) stages. Placentome number increased 3-fold between Day48 and Day153. Placental barrier thickness was thinner, and volume of placental components, and surface areas and densities were higher at Day153 than Day48. We confirmed two placentome types, flat and convex. At Day48, there were more convex than flat placentomes, and convex placentomes had a lower proportion of maternal connective tissue (P < 0.01). However, this was reversed at Day153, where convex placentomes were lower in number and had greater volume of placental components (P < 0.01- P < 0.001) and greater surface area (P < 0.001) than flat placentomes. Importantly, embryo (r = 0.50) and fetal (r = 0.30) weight correlated with total number of convex but not flat placentomes. Extensive remodelling of the placenta increases capacity for nutrient exchange to support rapidly increasing embryo-fetal weight from Day48 to Day153. The cellular composition of convex placentomes, and exclusive relationships between convex placentome number and embryo-fetal weight, provide strong evidence for these placentomes as drivers of prenatal growth. The difference in proportion of maternal connective tissue between placentome types at Day48 suggests that this tissue plays a role in determining placentome shape, further highlighting the importance of early placental development. Copyright © 2017 Elsevier Ltd. All rights reserved.

Polar DuaLs of Convex Bodies

DTIC Science & Technology

1990-01-01

Verlag 1976. 17. C. G. Lekkerkerker, Geometry of Numbers, Wolters-Noordhoff, Groningen, 1969. 18. E . Lutwak , "Dual Mixed Volumes," Pacific Journal of...Mathematics, Vol. 58, No. 2, 1975. 19. E . Lutwak , "On Cross-Sectional Measures of Polar Reciprocal Convex Bodies," Geometriae Dedicata 5, (1976) 79-80...20. E . Lutwak , "Blaschke-Santal6 Inequality, Discrete Geometry and Convexity," Annals of the New York Academy of Sciences 440 (1985) pp 106-112. 21. V

Single lens laser beam shaper

DOEpatents

Liu, Chuyu [Newport News, VA; Zhang, Shukui [Yorktown, VA

2011-10-04

A single lens bullet-shaped laser beam shaper capable of redistributing an arbitrary beam profile into any desired output profile comprising a unitary lens comprising: a convex front input surface defining a focal point and a flat output portion at the focal point; and b) a cylindrical core portion having a flat input surface coincident with the flat output portion of the first input portion at the focal point and a convex rear output surface remote from the convex front input surface.

ON THE STRUCTURE OF \\mathcal{H}_{n - 1}-ALMOST EVERYWHERE CONVEX HYPERSURFACES IN \\mathbf{R}^{n + 1}

NASA Astrophysics Data System (ADS)

Dmitriev, V. G.

1982-04-01

It is proved that a hypersurface f imbedded in \\mathbf{R}^{n + 1}, n \\geq 2, which is locally convex at all points except for a closed set E with (n - 1)-dimensional Hausdorff measure \\mathcal{K}_{n - 1}(E) = 0, and strictly convex near E is in fact locally convex everywhere. The author also gives various corollaries. In particular, let M be a complete two-dimensional Riemannian manifold of nonnegative curvature K and E \\subset M a closed subset for which \\mathcal{K}_1(E) = 0. Assume further that there exists a neighborhood U \\supset E such that K(x) > 0 for x \\in U \\setminus E, f \\colon M \\to \\mathbf{R}^3 is such that f\\big\\vert _{U \\setminus E} is an imbedding, and f\\big\\vert _{M \\setminus E} \\in C^{1, \\alpha}, \\alpha > 2/3. Then f(M) is a complete convex surface in \\mathbf{R}^3. This result is an generalization of results in the paper reviewed in MR 51 # 11374.Bibliography: 19 titles.

Turbulent boundary layers subjected to multiple curvatures and pressure gradients

NASA Technical Reports Server (NTRS)

Bandyopadhyay, Promode R.; Ahmed, Anwar

1993-01-01

The effects of abruptly applied cycles of curvatures and pressure gradients on turbulent boundary layers are examined experimentally. Two two-dimensional curved test surfaces are considered: one has a sequence of concave and convex longitudinal surface curvatures and the other has a sequence of convex and concave curvatures. The choice of the curvature sequences were motivated by a desire to study the asymmetric response of turbulent boundary layers to convex and concave curvatures. The relaxation of a boundary layer from the effects of these two opposite sequences has been compared. The effect of the accompaying sequences of pressure gradient has also been examined but the effect of curvature dominates. The growth of internal layers at the curvature junctions have been studied. Measurements of the Gortler and corner vortex systems have been made. The boundary layer recovering from the sequence of concave to convex curvature has a sustained lower skin friction level than in that recovering from the sequence of convex to concave curvature. The amplification and suppression of turbulence due to the curvature sequences have also been studied.

Beam’s-eye-view dosimetrics (BEVD) guided rotational station parameter optimized radiation therapy (SPORT) planning based on reweighted total-variation minimization

NASA Astrophysics Data System (ADS)

Kim, Hojin; Li, Ruijiang; Lee, Rena; Xing, Lei

2015-03-01

Conventional VMAT optimizes aperture shapes and weights at uniformly sampled stations, which is a generalization of the concept of a control point. Recently, rotational station parameter optimized radiation therapy (SPORT) has been proposed to improve the plan quality by inserting beams to the regions that demand additional intensity modulations, thus formulating non-uniform beam sampling. This work presents a new rotational SPORT planning strategy based on reweighted total-variation (TV) minimization (min.), using beam’s-eye-view dosimetrics (BEVD) guided beam selection. The convex programming based reweighted TV min. assures the simplified fluence-map, which facilitates single-aperture selection at each station for single-arc delivery. For the rotational arc treatment planning and non-uniform beam angle setting, the mathematical model needs to be modified by additional penalty term describing the fluence-map similarity and by determination of appropriate angular weighting factors. The proposed algorithm with additional penalty term is capable of achieving more efficient and deliverable plans adaptive to the conventional VMAT and SPORT planning schemes by reducing the dose delivery time about 5 to 10 s in three clinical cases (one prostate and two head-and-neck (HN) cases with a single and multiple targets). The BEVD guided beam selection provides effective and yet easy calculating methodology to select angles for denser, non-uniform angular sampling in SPORT planning. Our BEVD guided SPORT treatment schemes improve the dose sparing to femoral heads in the prostate and brainstem, parotid glands and oral cavity in the two HN cases, where the mean dose reduction of those organs ranges from 0.5 to 2.5 Gy. Also, it increases the conformation number assessing the dose conformity to the target from 0.84, 0.75 and 0.74 to 0.86, 0.79 and 0.80 in the prostate and two HN cases, while preserving the delivery efficiency, relative to conventional single-arc VMAT plans.

Control of Meridional Flow by a Non-Uniform Rotational Magnetic Field

NASA Technical Reports Server (NTRS)

Mazuruk, Konstantin; Ramachandran, Narayanan

1999-01-01

The diffusive mass transfer of species during crystal growth in vertical ampoules is significantly affected by fluid flow in the liquid mother phase (melt). For electrically conductive melts, an elegant way of remotely inducing and controlling this flow is by utilizing a uniform rotational magnetic field (RMF) in the transverse direction. It induces an azimuthal flow which tends to homogenize the thermal and solutal fields. The rotating field also reduces the diffusion boundary layer, stabilizes temperature fluctuations, and promotes better overall crystal growth. For moderate strengths of the applied magnetic field (2-20 m Tesla) with frequencies of up to 400 Hz, the induced secondary meridional flow becomes significant. It typically consists of one roll at the bottom of the liquid column and a second roll (vortex) at the top. The flow along the centerline (ampoule axis) is directed from the growing solid (interface) towards the liquid (melt). In case of convex interfaces (e.g. in floating zone crystal growth) such flow behavior is beneficial since it suppresses diffusion at the center. However, for concave interfaces (e.g. vertical Bridgman crystal growth) such a flow tends to exacerbate the situation in making the interface shape more concave. It would be beneficial to have some control of this meridional flow- for example, a single recirculating cell with controllable direction and flow magnitude will make this technique even more attractive for crystal growth. Such flow control is a possibility if a non-uniform PNE field is utilized for this purpose. Although this idea has been proposed earlier, it has not been conclusively demonstrated so far. In this work, we derive the governing equations for the fluid dynamics for such a system and obtain solutions for a few important cases. Results from parallel experimental measurements of fluid flow in a mercury column subjected to non-uniform RMF will also be presented.

Non-convex dissipation potentials in multiscale non-equilibrium thermodynamics

NASA Astrophysics Data System (ADS)

Janečka, Adam; Pavelka, Michal

2018-04-01

Reformulating constitutive relation in terms of gradient dynamics (being derivative of a dissipation potential) brings additional information on stability, metastability and instability of the dynamics with respect to perturbations of the constitutive relation, called CR-stability. CR-instability is connected to the loss of convexity of the dissipation potential, which makes the Legendre-conjugate dissipation potential multivalued and causes dissipative phase transitions that are not induced by non-convexity of free energy, but by non-convexity of the dissipation potential. CR-stability of the constitutive relation with respect to perturbations is then manifested by constructing evolution equations for the perturbations in a thermodynamically sound way (CR-extension). As a result, interesting experimental observations of behavior of complex fluids under shear flow and supercritical boiling curve can be explained.

Modified surface testing method for large convex aspheric surfaces based on diffraction optics.

PubMed

Zhang, Haidong; Wang, Xiaokun; Xue, Donglin; Zhang, Xuejun

2017-12-01

Large convex aspheric optical elements have been widely applied in advanced optical systems, which have presented a challenging metrology problem. Conventional testing methods cannot satisfy the demand gradually with the change of definition of "large." A modified method is proposed in this paper, which utilizes a relatively small computer-generated hologram and an illumination lens with certain feasibility to measure the large convex aspherics. Two example systems are designed to demonstrate the applicability, and also, the sensitivity of this configuration is analyzed, which proves the accuracy of the configuration can be better than 6 nm with careful alignment and calibration of the illumination lens in advance. Design examples and analysis show that this configuration is applicable to measure the large convex aspheric surfaces.

On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces

PubMed Central

Butnariu, Dan; Censor, Yair; Gurfil, Pini; Hadar, Ethan

2010-01-01

We study some methods of subgradient projections for solving a convex feasibility problem with general (not necessarily hyperplanes or half-spaces) convex sets in the inconsistent case and propose a strategy that controls the relaxation parameters in a specific self-adapting manner. This strategy leaves enough user-flexibility but gives a mathematical guarantee for the algorithm’s behavior in the inconsistent case. We present numerical results of computational experiments that illustrate the computational advantage of the new method. PMID:20182556

On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces.

PubMed

Butnariu, Dan; Censor, Yair; Gurfil, Pini; Hadar, Ethan

2008-07-03

We study some methods of subgradient projections for solving a convex feasibility problem with general (not necessarily hyperplanes or half-spaces) convex sets in the inconsistent case and propose a strategy that controls the relaxation parameters in a specific self-adapting manner. This strategy leaves enough user-flexibility but gives a mathematical guarantee for the algorithm's behavior in the inconsistent case. We present numerical results of computational experiments that illustrate the computational advantage of the new method.

Invariant Measures for Dissipative Dynamical Systems: Abstract Results and Applications

NASA Astrophysics Data System (ADS)

Chekroun, Mickaël D.; Glatt-Holtz, Nathan E.

2012-12-01

In this work we study certain invariant measures that can be associated to the time averaged observation of a broad class of dissipative semigroups via the notion of a generalized Banach limit. Consider an arbitrary complete separable metric space X which is acted on by any continuous semigroup { S( t)} t ≥ 0. Suppose that { S( t)} t ≥ 0 possesses a global attractor {{A}}. We show that, for any generalized Banach limit LIM T → ∞ and any probability distribution of initial conditions {{m}_0}, that there exists an invariant probability measure {{m}}, whose support is contained in {{A}}, such that intX \\varphi(x) d{m}(x) = \\underset{t rightarrow infty}LIM1/T int_0^T int_X \\varphi(S(t) x) d{m}_0(x) dt, for all observables φ living in a suitable function space of continuous mappings on X. This work is based on the framework of Foias et al. (Encyclopedia of mathematics and its applications, vol 83. Cambridge University Press, Cambridge, 2001); it generalizes and simplifies the proofs of more recent works (Wang in Disc Cont Dyn Syst 23(1-2):521-540, 2009; Lukaszewicz et al. in J Dyn Diff Eq 23(2):225-250, 2011). In particular our results rely on the novel use of a general but elementary topological observation, valid in any metric space, which concerns the growth of continuous functions in the neighborhood of compact sets. In the case when { S( t)} t ≥ 0 does not possess a compact absorbing set, this lemma allows us to sidestep the use of weak compactness arguments which require the imposition of cumbersome weak continuity conditions and thus restricts the phase space X to the case of a reflexive Banach space. Two examples of concrete dynamical systems where the semigroup is known to be non-compact are examined in detail. We first consider the Navier-Stokes equations with memory in the diffusion terms. This is the so called Jeffery's model which describes certain classes of viscoelastic fluids. We then consider a family of neutral delay differential equations, that is equations with delays in the time derivative terms. These systems may arise in the study of wave propagation problems coming from certain first order hyperbolic partial differential equations; for example for the study of line transmission problems. For the second example the phase space is {X= C([-tau,0],{R}^n)}, for some delay τ > 0, so that X is not reflexive in this case.

Improved flight-simulator viewing lens

NASA Technical Reports Server (NTRS)

Kahlbaum, W. M.

1979-01-01

Triplet lens system uses two acrylic plastic double convex lenses and one polystyrene plastic single convex lens to reduce chromatic distortion and lateral aberation, especially at large field angles within in-line systems of flight simulators.

Stereotype locally convex spaces

NASA Astrophysics Data System (ADS)

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.

Interface Shape Control Using Localized Heating during Bridgman Growth

NASA Technical Reports Server (NTRS)

Volz, M. P.; Mazuruk, K.; Aggarwal, M. D.; Croll, A.

2008-01-01

Numerical calculations were performed to assess the effect of localized radial heating on the melt-crystal interface shape during vertical Bridgman growth. System parameters examined include the ampoule, melt and crystal thermal conductivities, the magnitude and width of localized heating, and the latent heat of crystallization. Concave interface shapes, typical of semiconductor systems, could be flattened or made convex with localized heating. Although localized heating caused shallower thermal gradients ahead of the interface, the magnitude of the localized heating required for convexity was less than that which resulted in a thermal inversion ahead of the interface. A convex interface shape was most readily achieved with ampoules of lower thermal conductivity. Increasing melt convection tended to flatten the interface, but the amount of radial heating required to achieve a convex interface was essentially independent of the convection intensity.

Pin stack array for thermoacoustic energy conversion

DOEpatents

Keolian, Robert M.; Swift, Gregory W.

1995-01-01

A thermoacoustic stack for connecting two heat exchangers in a thermoacoustic energy converter provides a convex fluid-solid interface in a plane perpendicular to an axis for acoustic oscillation of fluid between the two heat exchangers. The convex surfaces increase the ratio of the fluid volume in the effective thermoacoustic volume that is displaced from the convex surface to the fluid volume that is adjacent the surface within which viscous energy losses occur. Increasing the volume ratio results in an increase in the ratio of transferred thermal energy to viscous energy losses, with a concomitant increase in operating efficiency of the thermoacoustic converter. The convex surfaces may be easily provided by a pin array having elements arranged parallel to the direction of acoustic oscillations and with effective radial dimensions much smaller than the thicknesses of the viscous energy loss and thermoacoustic energy transfer volumes.

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

NASA Astrophysics Data System (ADS)

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.

Optimal Harvesting in a Periodic Food Chain Model with Size Structures in Predators

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhang, Feng-Qin, E-mail: zhafq@263.net; Liu, Rong; Chen, Yuming, E-mail: ychen@wlu.ca

In this paper, we investigate a periodic food chain model with harvesting, where the predators have size structures and are described by first-order partial differential equations. First, we establish the existence of a unique non-negative solution by using the Banach fixed point theorem. Then, we provide optimality conditions by means of normal cone and adjoint system. Finally, we derive the existence of an optimal strategy by means of Ekeland’s variational principle. Here the objective functional represents the net economic benefit yielded from harvesting.

A generalization of Cesàro sequence spaces in the Orlicz space

NASA Astrophysics Data System (ADS)

Haryadi; Supama; Zulijanto, A.

2018-04-01

In this paper, we generalize the Cesàro sequence spaces in the classic Banach space Lp to the generalized Orlicz space Lφ . We construct the space by replacing the norm {\\Vert \\cdot \\Vert }p in Lp with modular ρφ in Lφ . This generalization has lead to the use of the Luxemburg norm to discuss some topological properties of the spaces. We prove results regarding to modular and norm convergence. We also describe some properties of the spaces and a closed subspaces of the space.

Strong Convergence for a Finite Family of Generalized Asymptotically Nonexpansive Mappings

NASA Astrophysics Data System (ADS)

Ma, Zhi-Hong; Chen, Ru-Dond

The purpose of this paper is to show the convergence theorems for generalized asymptotically nonexpansive mappings and asymptotically nonexpansive mappings in Banach spaces by using a new iteration which is a natural generalization of the implicit iteration. In the meantime, we give the necessary and sufficient conditions of the strong convergence to approximate a common fixed point and modify some flaw in the results of Thakur [11]. As one will see, the results presented in this paper are an extension of the corresponding results [8,11].

Necessary optimality conditions for infinite dimensional state constrained control problems

NASA Astrophysics Data System (ADS)

Frankowska, H.; Marchini, E. M.; Mazzola, M.

2018-06-01

This paper is concerned with first order necessary optimality conditions for state constrained control problems in separable Banach spaces. Assuming inward pointing conditions on the constraint, we give a simple proof of Pontryagin maximum principle, relying on infinite dimensional neighboring feasible trajectories theorems proved in [20]. Further, we provide sufficient conditions guaranteeing normality of the maximum principle. We work in the abstract semigroup setting, but nevertheless we apply our results to several concrete models involving controlled PDEs. Pointwise state constraints (as positivity of the solutions) are allowed.

Preconditioning 2D Integer Data for Fast Convex Hull Computations.

PubMed

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.

Shear thickening and jamming in suspensions of different particle shapes

NASA Astrophysics Data System (ADS)

Brown, Eric; Zhang, Hanjun; Forman, Nicole; Betts, Douglas; Desimone, Joseph; Maynor, Benjamin; Jaeger, Heinrich

2012-02-01

We investigated the role of particle shape on shear thickening and jamming in densely packed suspensions. Various particle shapes were fabricated including rods of different aspect ratios and non-convex hooked rods. A rheometer was used to measure shear stress vs. shear rate for a wide range of packing fractions for each shape. Each suspensions exhibits qualitatively similar Discontinuous Shear Thickening, in which the logarithmic slope of the stress vs. shear rate has the same scaling for each convex shape and diverges at a critical packing fraction φc. The value of φc varies with particle shape, and coincides with the onset of a yield stress, a.k.a. the jamming transition. This suggests the jamming transition controls shear thickening, and the only effect of particle shape on steady state bulk rheology of convex particles is a shift of φc. Intriguingly, viscosity curves for non-convex particles do not collapse on the same set as convex particles, showing strong shear thickening over a wider range of packing fraction. Qualitative shape dependence was only found in steady state rheology when the system was confined to small gaps where large aspect ratio particle are forced to order.

Convex Curved Crystal Spectograph for Pulsed Plasma Sources.

DTIC Science & Technology

The geometry of a convex curved crystal spectrograph as applied to pulsed plasma sources is presented. Also presented are data from the dense plasma focus with particular emphasis on the absolute intensity of line radiations.

Spatially-global integration of closed, fragmented contours by finding the shortest-path in a log-polar representation

PubMed Central

Kwon, TaeKyu; Agrawal, Kunal; Li, Yunfeng; Pizlo, Zygmunt

2015-01-01

Finding the occluding contours of objects in real 2D retinal images of natural 3D scenes is done by determining, which contour fragments are relevant, and the order in which they should be connected. We developed a model that finds the closed contour represented in the image by solving a shortest path problem that uses a log-polar representation of the image; the kind of representation known to exist in area V1 of the primate cortex. The shortest path in a log-polar representation favors the smooth, convex and closed contours in the retinal image that have the smallest number of gaps. This approach is practical because finding a globally-optimal solution to a shortest path problem is computationally easy. Our model was tested in four psychophysical experiments. In the first two experiments, the subject was presented with a fragmented convex or concave polygon target among a large number of unrelated pieces of contour (distracters). The density of these pieces of contour was uniform all over the screen to minimize spatially-local cues. The orientation of each target contour fragment was randomly perturbed by varying the levels of jitter. Subjects drew a closed contour that represented the target’s contour on a screen. The subjects’ performance was nearly perfect when the jitter-level was low. Their performance deteriorated as jitter-levels were increased. The performance of our model was very similar to our subjects’. In two subsequent experiments, the subject was asked to discriminate a briefly-presented egg-shaped object while maintaining fixation at several different positions relative to the closed contour of the shape. The subject’s discrimination performance was affected by the fixation position in much the same way as the model’s. PMID:26241462

Maximum Entropy Methods as the Bridge Between Microscopic and Macroscopic Theory

NASA Astrophysics Data System (ADS)

Taylor, Jamie M.

2016-09-01

This paper is concerned with an investigation into a function of macroscopic variables known as the singular potential, building on previous work by Ball and Majumdar. The singular potential is a function of the admissible statistical averages of probability distributions on a state space, defined so that it corresponds to the maximum possible entropy given known observed statistical averages, although non-classical entropy-like objective functions will also be considered. First the set of admissible moments must be established, and under the conditions presented in this work the set is open, bounded and convex allowing a description in terms of supporting hyperplanes, which provides estimates on the development of singularities for related probability distributions. Under appropriate conditions it is shown that the singular potential is strictly convex, as differentiable as the microscopic entropy, and blows up uniformly as the macroscopic variable tends to the boundary of the set of admissible moments. Applications of the singular potential are then discussed, and particular consideration will be given to certain free-energy functionals typical in mean-field theory, demonstrating an equivalence between certain microscopic and macroscopic free-energy functionals. This allows statements about L^1-local minimisers of Onsager's free energy to be obtained which cannot be given by two-sided variations, and overcomes the need to ensure local minimisers are bounded away from zero and +∞ before taking L^∞ variations. The analysis also permits the definition of a dual order parameter for which Onsager's free energy allows an explicit representation. Also, the difficulties in approximating the singular potential by everywhere defined functions, in particular by polynomial functions, are addressed, with examples demonstrating the failure of the Taylor approximation to preserve relevant shape properties of the singular potential.

Unraveling origins of the heterogeneous curvature dependence of polypeptide interactions with carbon nanostructures.

PubMed

Jana, Asis K; Tiwari, Mrityunjay K; Vanka, Kumar; Sengupta, Neelanjana

2016-02-17

Emerging nanotechnology has rapidly broadened interfacial prospects of biological molecules with carbon nanomaterials (CNs). A prerequisite for effectively harnessing such hybrid materials is a multi-faceted understanding of their complex interfacial interactions as functions of the physico-chemical characteristics and the surface topography of the individual components. In this article, we address the origins of the curvature dependence of polypeptide adsorption on CN surfaces (CNSs), a phenomenon bearing an acute influence upon the behavior and activity of CN-protein conjugates. Our benchmark molecular dynamics (MD) simulations with the amphiphilic full-length amyloid beta (Aβ) peptide demonstrate that protein adsorption is strongest on the concave (inner) CN surface, weakest on the convex (outer) surface, and intermediary on the planar surface, in agreement with recent experimental reports. The curvature effects, however, are found to manifest non-uniformly between the amino acid subtypes. To understand the underlying interplay of the chemical nature of the amino acids and surface topography of the CNs, we performed high-level quantum chemical (QM) calculations with amino acid analogs (AAA) representing their five prominent classes, and convex, concave and planar CN fragments. Molecular electrostatic potential maps reveal pronounced curvature dependence in the mixing of electron densities, and a resulting variance in the stabilization of the non-covalently bound molecular complexes. Interestingly, our study revealed that the interaction trends of the high-level QM calculations were captured well by the empirical force field. The findings in this study have important bearing upon the design of carbon based bio-nanomaterials, and additionally, provide valuable insights into the accuracy of various computational techniques for probing non-bonded interfacial interactions.

Synchrotron X-ray nano computed tomography based simulation of stress evolution in LiMn 2O 4 electrodes

DOE PAGES

Ghorbani Kashkooli, Ali; Foreman, Evan; Farhad, Siamak; ...

2017-07-18

Here in this study, synchrotron X-ray nano-computed tomography at Advanced Photon Source in Argonne National Laboratory has been employed to reconstruct real 3D active particle morphology of LiMn 2O 4 (LMO) commonly used in lithium-ion batteries (LIBs). For the first time, carbon-doped binder domain (CBD) has been included in the electrode structure as a 108 nm thick uniform layer using image processing technique. With this unique model, stress generated inside four LMO particles with a uniform layer of CBD has been simulated, demonstrating its strong dependence on local morphology (surface concavity and convexity), and the mechanical properties of CBD suchmore » as Young’s modulus. Specifically, high levels of stress have been found in vicinity of particle’s center or near surface concave regions, however much lower than the material failure limits even after discharging at the rate as high as 5C. On the other hand, the stress inside CBD has reached its mechanical limits when discharged at 5C, suggesting that it can potentially lead to failure by plastic deformation. The findings in this study highlight the importance of modeling LIB active particles with CBD and its appropriate compositional design and development to prevent the loss of electrical connectivity of the active particles from the percolated solid network and power losses due to CBD failure.« less

Synchrotron X-ray nano computed tomography based simulation of stress evolution in LiMn 2O 4 electrodes

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ghorbani Kashkooli, Ali; Foreman, Evan; Farhad, Siamak

Here in this study, synchrotron X-ray nano-computed tomography at Advanced Photon Source in Argonne National Laboratory has been employed to reconstruct real 3D active particle morphology of LiMn 2O 4 (LMO) commonly used in lithium-ion batteries (LIBs). For the first time, carbon-doped binder domain (CBD) has been included in the electrode structure as a 108 nm thick uniform layer using image processing technique. With this unique model, stress generated inside four LMO particles with a uniform layer of CBD has been simulated, demonstrating its strong dependence on local morphology (surface concavity and convexity), and the mechanical properties of CBD suchmore » as Young’s modulus. Specifically, high levels of stress have been found in vicinity of particle’s center or near surface concave regions, however much lower than the material failure limits even after discharging at the rate as high as 5C. On the other hand, the stress inside CBD has reached its mechanical limits when discharged at 5C, suggesting that it can potentially lead to failure by plastic deformation. The findings in this study highlight the importance of modeling LIB active particles with CBD and its appropriate compositional design and development to prevent the loss of electrical connectivity of the active particles from the percolated solid network and power losses due to CBD failure.« less

Optimal boundary regularity for a singular Monge-Ampère equation

NASA Astrophysics Data System (ADS)

Jian, Huaiyu; Li, You

2018-06-01

In this paper we study the optimal global regularity for a singular Monge-Ampère type equation which arises from a few geometric problems. We find that the global regularity does not depend on the smoothness of domain, but it does depend on the convexity of the domain. We introduce (a , η) type to describe the convexity. As a result, we show that the more convex is the domain, the better is the regularity of the solution. In particular, the regularity is the best near angular points.

Compliant tactile sensor that delivers a force vector

NASA Technical Reports Server (NTRS)

Torres-Jara, Eduardo (Inventor)

2010-01-01

Tactile Sensor. The sensor includes a compliant convex surface disposed above a sensor array, the sensor array adapted to respond to deformation of the convex surface to generate a signal related to an applied force vector. The applied force vector has three components to establish the direction and magnitude of an applied force. The compliant convex surface defines a dome with a hollow interior and has a linear relation between displacement and load including a magnet disposed substantially at the center of the dome above a sensor array that responds to magnetic field intensity.

Convexity of level lines of Martin functions and applications

NASA Astrophysics Data System (ADS)

Gallagher, A.-K.; Lebl, J.; Ramachandran, K.

2018-01-01

Let Ω be an unbounded domain in R× Rd. A positive harmonic function u on Ω that vanishes on the boundary of Ω is called a Martin function. In this note, we show that, when Ω is convex, the superlevel sets of a Martin function are also convex. As a consequence we obtain that if in addition Ω has certain symmetry with respect to the t-axis, and partial Ω is sufficiently flat, then the maximum of any Martin function along a slice Ω \\cap ({t}× R^d) is attained at (t, 0).

The Compressible Stokes Flows with No-Slip Boundary Condition on Non-Convex Polygons

NASA Astrophysics Data System (ADS)

Kweon, Jae Ryong

2017-03-01

In this paper we study the compressible Stokes equations with no-slip boundary condition on non-convex polygons and show a best regularity result that the solution can have without subtracting corner singularities. This is obtained by a suitable Helmholtz decomposition: {{{u}}={{w}}+nablaφ_R} with div w = 0 and a potential φ_R. Here w is the solution for the incompressible Stokes problem and φ_R is defined by subtracting from the solution of the Neumann problem the leading two corner singularities at non-convex vertices.

Worst case estimation of homology design by convex analysis

NASA Technical Reports Server (NTRS)

Yoshikawa, N.; Elishakoff, Isaac; Nakagiri, S.

1998-01-01

The methodology of homology design is investigated for optimum design of advanced structures. for which the achievement of delicate tasks by the aid of active control system is demanded. The proposed formulation of homology design, based on the finite element sensitivity analysis, necessarily requires the specification of external loadings. The formulation to evaluate the worst case for homology design caused by uncertain fluctuation of loadings is presented by means of the convex model of uncertainty, in which uncertainty variables are assigned to discretized nodal forces and are confined within a conceivable convex hull given as a hyperellipse. The worst case of the distortion from objective homologous deformation is estimated by the Lagrange multiplier method searching the point to maximize the error index on the boundary of the convex hull. The validity of the proposed method is demonstrated in a numerical example using the eleven-bar truss structure.

A search asymmetry reversed by figure-ground assignment.

PubMed

Humphreys, G W; Müller, H

2000-05-01

We report evidence demonstrating that a search asymmetry favoring concave over convex targets can be reversed by altering the figure-ground assignment of edges in shapes. Visual search for a concave target among convex distractors is faster than search for a convex target among concave distractors (a search asymmetry). By using shapes with ambiguous local figure-ground relations, we demonstrated that search can be efficient (with search slopes around 10 ms/item) or inefficient (with search slopes around 30-40 ms/item) with the same stimuli, depending on whether edges are assigned to concave or convex "figures." This assignment process can operate in a top-down manner, according to the task set. The results suggest that attention is allocated to spatial regions following the computation of figure-ground relations in parallel across the elements present. This computation can also be modulated by top-down processes.

Transient disturbance growth in flows over convex surfaces

NASA Astrophysics Data System (ADS)

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.

Clearance detector and method for motion and distance

DOEpatents

Xavier, Patrick G [Albuquerque, NM

2011-08-09

A method for correct and efficient detection of clearances between three-dimensional bodies in computer-based simulations, where one or both of the volumes is subject to translation and/or rotations. The method conservatively determines of the size of such clearances and whether there is a collision between the bodies. Given two bodies, each of which is undergoing separate motions, the method utilizes bounding-volume hierarchy representations for the two bodies and, mappings and inverse mappings for the motions of the two bodies. The method uses the representations, mappings and direction vectors to determine the directionally furthest locations of points on the convex hulls of the volumes virtually swept by the bodies and hence the clearance between the bodies, without having to calculate the convex hulls of the bodies. The method includes clearance detection for bodies comprising convex geometrical primitives and more specific techniques for bodies comprising convex polyhedra.

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

NASA Astrophysics Data System (ADS)

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.

Computing convex quadrangulations☆

PubMed Central

Schiffer, T.; Aurenhammer, F.; Demuth, M.

2012-01-01

We use projected Delaunay tetrahedra and a maximum independent set approach to compute large subsets of convex quadrangulations on a given set of points in the plane. The new method improves over the popular pairing method based on triangulating the point set. PMID:22389540

The Quest for the Ultimate Anisotropic Banach Space

NASA Astrophysics Data System (ADS)

Baladi, Viviane

2017-02-01

We present a new scale U^{t,s}_p (s<-t<0 and 1≤p <∞) of anisotropic Banach spaces, defined via Paley-Littlewood, on which the transfer operator L_g φ = (g \\cdot φ) circ T^{-1} associated to a hyperbolic dynamical system T has good spectral properties. When p=1 and t is an integer, the spaces are analogous to the "geometric" spaces B^{t,|s+t|} considered by Gouëzel and Liverani (Ergod Theory Dyn Syst 26:189-217, 2006). When p>1 and -1+1/p

Compliant tactile sensor for generating a signal related to an applied force

NASA Technical Reports Server (NTRS)

Torres-Jara, Eduardo (Inventor)

2012-01-01

Tactile sensor. The sensor includes a compliant convex surface disposed above a sensor array, the sensor array adapted to respond to deformation of the convex surface to generate a signal related to an applied force vector.

Distributed Nash Equilibrium Seeking for Generalized Convex Games with Shared Constraints

NASA Astrophysics Data System (ADS)

Sun, Chao; Hu, Guoqiang

2018-05-01

In this paper, we deal with the problem of finding a Nash equilibrium for a generalized convex game. Each player is associated with a convex cost function and multiple shared constraints. Supposing that each player can exchange information with its neighbors via a connected undirected graph, the objective of this paper is to design a Nash equilibrium seeking law such that each agent minimizes its objective function in a distributed way. Consensus and singular perturbation theories are used to prove the stability of the system. A numerical example is given to show the effectiveness of the proposed algorithms.

Convex Regression with Interpretable Sharp Partitions

PubMed Central

Petersen, Ashley; Simon, Noah; Witten, Daniela

2016-01-01

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

Optshrink LR + S: accelerated fMRI reconstruction using non-convex optimal singular value shrinkage.

PubMed

Aggarwal, Priya; Shrivastava, Parth; Kabra, Tanay; Gupta, Anubha

2017-03-01

This paper presents a new accelerated fMRI reconstruction method, namely, OptShrink LR + S method that reconstructs undersampled fMRI data using a linear combination of low-rank and sparse components. The low-rank component has been estimated using non-convex optimal singular value shrinkage algorithm, while the sparse component has been estimated using convex l 1 minimization. The performance of the proposed method is compared with the existing state-of-the-art algorithms on real fMRI dataset. The proposed OptShrink LR + S method yields good qualitative and quantitative results.

The role of spinal concave–convex biases in the progression of idiopathic scoliosis

PubMed Central

Driscoll, Mark; Moreau, Alain; Villemure, Isabelle; Parent, Stefan

2009-01-01

Inadequate understanding of risk factors involved in the progression of idiopathic scoliosis restrains initial treatment to observation until the deformity shows signs of significant aggravation. The purpose of this analysis is to explore whether the concave–convex biases associated with scoliosis (local degeneration of the intervertebral discs, nucleus migration, and local increase in trabecular bone-mineral density of vertebral bodies) may be identified as progressive risk factors. Finite element models of a 26° right thoracic scoliotic spine were constructed based on experimental and clinical observations that included growth dynamics governed by mechanical stimulus. Stress distribution over the vertebral growth plates, progression of Cobb angles, and vertebral wedging were explored in models with and without the biases of concave–convex properties. The inclusion of the bias of concave–convex properties within the model both augmented the asymmetrical loading of the vertebral growth plates by up to 37% and further amplified the progression of Cobb angles and vertebral wedging by as much as 5.9° and 0.8°, respectively. Concave–convex biases are factors that influence the progression of scoliotic curves. Quantifying these parameters in a patient with scoliosis may further provide a better clinical assessment of the risk of progression. PMID:19130096

Organizing principles for dense packings of nonspherical hard particles: Not all shapes are created equal

NASA Astrophysics Data System (ADS)

Torquato, Salvatore; Jiao, Yang

2012-07-01

We have recently devised organizing principles to obtain maximally dense packings of the Platonic and Archimedean solids and certain smoothly shaped convex nonspherical particles [Torquato and Jiao, Phys. Rev. EPLEEE81539-375510.1103/PhysRevE.81.041310 81, 041310 (2010)]. Here we generalize them in order to guide one to ascertain the densest packings of other convex nonspherical particles as well as concave shapes. Our generalized organizing principles are explicitly stated as four distinct propositions. All of our organizing principles are applied to and tested against the most comprehensive set of both convex and concave particle shapes examined to date, including Catalan solids, prisms, antiprisms, cylinders, dimers of spheres, and various concave polyhedra. We demonstrate that all of the densest known packings associated with this wide spectrum of nonspherical particles are consistent with our propositions. Among other applications, our general organizing principles enable us to construct analytically the densest known packings of certain convex nonspherical particles, including spherocylinders, “lens-shaped” particles, square pyramids, and rhombic pyramids. Moreover, we show how to apply these principles to infer the high-density equilibrium crystalline phases of hard convex and concave particles. We also discuss the unique packing attributes of maximally random jammed packings of nonspherical particles.

Preconditioning 2D Integer Data for Fast Convex Hull Computations

PubMed Central

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. PMID:26938221

Convex Formulations of Learning from Crowds

NASA Astrophysics Data System (ADS)

Kajino, Hiroshi; Kashima, Hisashi

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

How to Deal with Interval-Censored Data Practically while Assessing the Progression-Free Survival: A Step-by-Step Guide Using SAS and R Software.

PubMed

Dugué, Audrey Emmanuelle; Pulido, Marina; Chabaud, Sylvie; Belin, Lisa; Gal, Jocelyn

2016-12-01

We describe how to estimate progression-free survival while dealing with interval-censored data in the setting of clinical trials in oncology. Three procedures with SAS and R statistical software are described: one allowing for a nonparametric maximum likelihood estimation of the survival curve using the EM-ICM (Expectation and Maximization-Iterative Convex Minorant) algorithm as described by Wellner and Zhan in 1997; a sensitivity analysis procedure in which the progression time is assigned (i) at the midpoint, (ii) at the upper limit (reflecting the standard analysis when the progression time is assigned at the first radiologic exam showing progressive disease), or (iii) at the lower limit of the censoring interval; and finally, two multiple imputations are described considering a uniform or the nonparametric maximum likelihood estimation (NPMLE) distribution. Clin Cancer Res; 22(23); 5629-35. ©2016 AACR. ©2016 American Association for Cancer Research.

Automated exterior inspection of an aircraft with a pan-tilt-zoom camera mounted on a mobile robot

NASA Astrophysics Data System (ADS)

Jovančević, Igor; Larnier, Stanislas; Orteu, Jean-José; Sentenac, Thierry

2015-11-01

This paper deals with an automated preflight aircraft inspection using a pan-tilt-zoom camera mounted on a mobile robot moving autonomously around the aircraft. The general topic is image processing framework for detection and exterior inspection of different types of items, such as closed or unlatched door, mechanical defect on the engine, the integrity of the empennage, or damage caused by impacts or cracks. The detection step allows to focus on the regions of interest and point the camera toward the item to be checked. It is based on the detection of regular shapes, such as rounded corner rectangles, circles, and ellipses. The inspection task relies on clues, such as uniformity of isolated image regions, convexity of segmented shapes, and periodicity of the image intensity signal. The approach is applied to the inspection of four items of Airbus A320: oxygen bay handle, air-inlet vent, static ports, and fan blades. The results are promising and demonstrate the feasibility of an automated exterior inspection.

Optimization of electrostatic dual-grid beam-deflection system

NASA Technical Reports Server (NTRS)

Hudson, W. R.; Lathem, W. C.; Power, J. L.; Banks, B. A.

1972-01-01

Tests were performed to minimize accelerator grid erosion of a 5-cm diameter Kaufman ion thruster due to direct beam impingement. Several different screen hole diameters, pillow-shape-square screen holes, and dished screen grids were tried. The optimization was accomplished by copper plating the accelerator grid before testing each grid configuration on a thruster for a 2-hour run. The thruster beam sputtered copper and molybdenum from the accelerator grid where the beam impinged. The observed erosion patterns and measured accelerator currents were used to determine how to modify the accelerator system. The lowest erosion was obtained for a 50-percent open area pillow-shape-square-aperture screen grid, dished 0.043 centimeter convex toward the accelerator grid, which was positioned with the center of the screen grid 0.084 centimeter from the accelerator grid. During this investigation the accelerator current was reduced from 120 to 55 microamperes and was also more uniformly distributed over the area of the accelerator grid.

Kinematic Treatment of CME Evolution in the Solar Wind

NASA Technical Reports Server (NTRS)

Riley, Pete; Crooker, N. U.

2004-01-01

We present a kinematic study of the evolution of coronal mass ejections (CMEs) in the solar wind. Specifically, we consider the effects of: (1) spherical expansion; and (2) uniform expansion due to pressure gradients between the Interplanetary CME (ICME) and the ambient solar wind. We compare these results with an MHD model, which allows us to isolate these effects from the combined kinematic and dynamical effects, which are included in MHD models. They also provide compelling evidence that the fundamental cross section of so-called "force-free" flux ropes (or magnetic clouds) is neither circular or elliptical, but rather a convex-outward, "pancake" shape. We apply a force-free fitting to the magnetic vectors from the MHD simulation to assess how the distortion of the flux rope affects the fitting. In spite of these limitations, force-free fittings, which are straightforward to apply, do provide an important description of a number of parameters, including the radial dimension, orientation and chirality of the ICME.

Plane stress problems using hysteretic rigid body spring network models

NASA Astrophysics Data System (ADS)

Christos, Sofianos D.; Vlasis, Koumousis K.

2017-10-01

In this work, a discrete numerical scheme is presented capable of modeling the hysteretic behavior of 2D structures. Rigid Body Spring Network (RBSN) models that were first proposed by Kawai (Nucl Eng Des 48(1):29-207, 1978) are extended to account for hysteretic elastoplastic behavior. Discretization is based on Voronoi tessellation, as proposed specifically for RBSN models to ensure uniformity. As a result, the structure is discretized into convex polygons that form the discrete rigid bodies of the model. These are connected with three zero length, i.e., single-node springs in the middle of their common facets. The springs follow the smooth hysteretic Bouc-Wen model which efficiently incorporates classical plasticity with no direct reference to a yield surface. Numerical results for both static and dynamic loadings are presented, which validate the proposed simplified spring-mass formulation. In addition, they verify the model's applicability on determining primarily the displacement field and plastic zones compared to the standard elastoplastic finite element method.

First-order convex feasibility algorithms for x-ray CT

PubMed Central

Sidky, Emil Y.; Jørgensen, Jakob S.; 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, however, it is impractical to achieve accurate solution to the optimization of interest, which complicates design of IIR algorithms. This issue is particularly acute for CT with a limited angular-range scan, which leads to poorly conditioned system matrices and difficult to solve optimization problems. In this paper, we develop IIR algorithms which solve a certain type of optimization called convex feasibility. The convex feasibility approach can provide alternatives to unconstrained optimization approaches and at the same time allow for rapidly convergent algorithms for their solution—thereby facilitating the IIR algorithm design process. Methods: An accelerated version of the Chambolle−Pock (CP) algorithm is adapted to various convex feasibility problems of potential interest to IIR in CT. One of the proposed problems is seen to be equivalent to least-squares minimization, and two other problems provide alternatives to penalized, least-squares minimization. Results: The accelerated CP algorithms are demonstrated on a simulation of circular fan-beam CT with a limited scanning arc of 144°. The CP algorithms are seen in the empirical results to converge to the solution of their respective convex feasibility 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 angular-range scanning. The present paper demonstrates the methodology, and future work will illustrate its utility in actual CT application. PMID:23464295

Asteroid shape and spin statistics from convex models

NASA Astrophysics Data System (ADS)

Torppa, J.; Hentunen, V.-P.; Pääkkönen, P.; Kehusmaa, P.; Muinonen, K.

2008-11-01

We introduce techniques for characterizing convex shape models of asteroids with a small number of parameters, and apply these techniques to a set of 87 models from convex inversion. We present three different approaches for determining the overall dimensions of an asteroid. With the first technique, we measured the dimensions of the shapes in the direction of the rotation axis and in the equatorial plane and with the two other techniques, we derived the best-fit ellipsoid. We also computed the inertia matrix of the model shape to test how well it represents the target asteroid, i.e., to find indications of possible non-convex features or albedo variegation, which the convex shape model cannot reproduce. We used shape models for 87 asteroids to perform statistical analyses and to study dependencies between shape and rotation period, size, and taxonomic type. We detected correlations, but more data are required, especially on small and large objects, as well as slow and fast rotators, to reach a more thorough understanding about the dependencies. Results show, e.g., that convex models of asteroids are not that far from ellipsoids in root-mean-square sense, even though clearly irregular features are present. We also present new spin and shape solutions for Asteroids (31) Euphrosyne, (54) Alexandra, (79) Eurynome, (93) Minerva, (130) Elektra, (376) Geometria, (471) Papagena, and (776) Berbericia. We used a so-called semi-statistical approach to obtain a set of possible spin state solutions. The number of solutions depends on the abundancy of the data, which for Eurynome, Elektra, and Geometria was extensive enough for determining an unambiguous spin and shape solution. Data of Euphrosyne, on the other hand, provided a wide distribution of possible spin solutions, whereas the rest of the targets have two or three possible solutions.

Directional Convexity and Finite Optimality Conditions.

DTIC Science & Technology

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

Localized Multiple Kernel Learning A Convex Approach

DTIC Science & Technology

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

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

NASA Astrophysics Data System (ADS)

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

2017-02-01

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

Solution of monotone complementarity and general convex programming problems using a modified potential reduction interior point method

DOE PAGES

Huang, Kuo -Ling; Mehrotra, Sanjay

2016-11-08

We present a homogeneous algorithm equipped with a modified potential function for the monotone complementarity problem. We show that this potential function is reduced by at least a constant amount if a scaled Lipschitz condition (SLC) is satisfied. A practical algorithm based on this potential function is implemented in a software package named iOptimize. The implementation in iOptimize maintains global linear and polynomial time convergence properties, while achieving practical performance. It either successfully solves the problem, or concludes that the SLC is not satisfied. When compared with the mature software package MOSEK (barrier solver version 6.0.0.106), iOptimize solves convex quadraticmore » programming problems, convex quadratically constrained quadratic programming problems, and general convex programming problems in fewer iterations. Moreover, several problems for which MOSEK fails are solved to optimality. In addition, we also find that iOptimize detects infeasibility more reliably than the general nonlinear solvers Ipopt (version 3.9.2) and Knitro (version 8.0).« less

Strain relaxation in convex-graded InxAl1-xAs (x = 0.05-0.79) metamorphic buffer layers grown by molecular beam epitaxy on GaAs(001)

NASA Astrophysics Data System (ADS)

Solov'ev, V. A.; Chernov, M. Yu; Baidakova, M. V.; Kirilenko, D. A.; Yagovkina, M. A.; Sitnikova, A. A.; Komissarova, T. A.; Kop'ev, P. S.; Ivanov, S. V.

2018-01-01

This paper presents a study of structural properties of InGaAs/InAlAs quantum well (QW) heterostructures with convex-graded InxAl1-xAs (x = 0.05-0.79) metamorphic buffer layers (MBLs) grown by molecular beam epitaxy on GaAs substrates. Mechanisms of elastic strain relaxation in the convex-graded MBLs were studied by the X-ray reciprocal space mapping combined with the data of spatially-resolved selected area electron diffraction implemented in a transmission electron microscope. The strain relaxation degree was approximated for the structures with different values of an In step-back. Strong contribution of the strain relaxation via lattice tilt in addition to the formation of the misfit dislocations has been observed for the convex-graded InAlAs MBL, which results in a reduced threading dislocation density in the QW region as compared to a linear-graded MBL.

Efficient Compressed Sensing Based MRI Reconstruction using Nonconvex Total Variation Penalties

NASA Astrophysics Data System (ADS)

Lazzaro, D.; Loli Piccolomini, E.; Zama, F.

2016-10-01

This work addresses the problem of Magnetic Resonance Image Reconstruction from highly sub-sampled measurements in the Fourier domain. It is modeled as a constrained minimization problem, where the objective function is a non-convex function of the gradient of the unknown image and the constraints are given by the data fidelity term. We propose an algorithm, Fast Non Convex Reweighted (FNCR), where the constrained problem is solved by a reweighting scheme, as a strategy to overcome the non-convexity of the objective function, with an adaptive adjustment of the penalization parameter. We propose a fast iterative algorithm and we can prove that it converges to a local minimum because the constrained problem satisfies the Kurdyka-Lojasiewicz property. Moreover the adaptation of non convex l0 approximation and penalization parameters, by means of a continuation technique, allows us to obtain good quality solutions, avoiding to get stuck in unwanted local minima. Some numerical experiments performed on MRI sub-sampled data show the efficiency of the algorithm and the accuracy of the solution.

Liquid phase heteroepitaxial growth on convex substrate using binary phase field crystal model

NASA Astrophysics Data System (ADS)

Lu, Yanli; Zhang, Tinghui; Chen, Zheng

2018-06-01

The liquid phase heteroepitaxial growth on convex substrate is investigated with the binary phase field crystal (PFC) model. The paper aims to focus on the transformation of the morphology of epitaxial films on convex substrate with two different radiuses of curvature (Ω) as well as influences of substrate vicinal angles on films growth. It is found that films growth experience different stages on convex substrate with different radiuses of curvature (Ω). For Ω = 512 Δx , the process of epitaxial film growth includes four stages: island coupled with layer-by-layer growth, layer-by-layer growth, island coupled with layer-by-layer growth, layer-by-layer growth. For Ω = 1024 Δx , film growth only experience islands growth and layer-by-layer growth. Also, substrate vicinal angle (π) is an important parameter for epitaxial film growth. We find the film can grow well when π = 2° for Ω = 512 Δx , while the optimized film can be obtained when π = 4° for Ω = 512 Δx .

Torsional deformity of apical vertebra in adolescent idiopathic scoliosis.

PubMed

Kotwicki, Tomasz; Napiontek, Marek

2002-01-01

CT scans of structural thoracic idiopathic scoliosis were reviewed in nine patients admitted to our department for scoliosis surgery. The apical vertebra scans were chosen and the following parameters were evaluated: 1) alpha angle formed by the axis of vertebra and the axis of spinous process 2) beta concave and beta convex angle between the spinous process and the left and right transverse process, respectively, 3) gamma concave and gamma convex angle between the axis of vertebra and the left and right transverse process, respectively, 4) the rotation angle to the sagittal plane. The constant deviation of the spinous process towards the convex side of the curve was observed. The vertebral body itself was distorted towards the concavity of the curve. The angle between the spinous process and the transverse process was smaller on the convex side of the curve. The torsional, intravertebral deformity of the apical vertebra was a factor acting in the direction opposite to the rotation, in the sense to reduce the deformity of the spine in idiopathic scoliosis.

An axial temperature profile curvature criterion for the engineering of convex crystal growth interfaces in Bridgman systems

NASA Astrophysics Data System (ADS)

Peterson, Jeffrey H.; Derby, Jeffrey J.

2017-06-01

A unifying idea is presented for the engineering of convex melt-solid interface shapes in Bridgman crystal growth systems. Previous approaches to interface control are discussed with particular attention paid to the idea of a "booster" heater. Proceeding from the idea that a booster heater promotes a converging heat flux geometry and from the energy conservation equation, we show that a convex interface shape will naturally result when the interface is located in regions of the furnace where the axial thermal profile exhibits negative curvature, i.e., where d2 T / dz2 < 0 . This criterion is effective in explaining prior literature results on interface control and promising for the evaluation of new furnace designs. We posit that the negative curvature criterion may be applicable to the characterization of growth systems via temperature measurements in an empty furnace, providing insight about the potential for achieving a convex interface shape, without growing a crystal or conducting simulations.

New Convex and Spherical Structures of Bare Boron Clusters

NASA Astrophysics Data System (ADS)

Boustani, Ihsan

1997-10-01

New stable structures of bare boron clusters can easily be obtained and constructed with the help of an "Aufbau Principle" suggested by a systematicab initioHF-SCF and direct CI study. It is concluded that boron cluster formation can be established by elemental units of pentagonal and hexagonal pyramids. New convex and small spherical clusters different from the classical known forms of boron crystal structures are obtained by a combination of both basic units. Convex structures simulate boron surfaces which can be considered as segments of open or closed spheres. Both convex clusters B16and B46have energies close to those of their conjugate quasi-planar clusters, which are relatively stable and can be considered to act as a calibration mark. The closed spherical clusters B12, B22, B32, and B42are less stable than the corresponding conjugated quasi-planar structures. As a consequence, highly stable spherical boron clusters can systematically be predicted when their conjugate quasi-planar clusters are determined and energies are compared.

A direct method for nonlinear ill-posed problems

NASA Astrophysics Data System (ADS)

Lakhal, A.

2018-02-01

We propose a direct method for solving nonlinear ill-posed problems in Banach-spaces. The method is based on a stable inversion formula we explicitly compute by applying techniques for analytic functions. Furthermore, we investigate the convergence and stability of the method and prove that the derived noniterative algorithm is a regularization. The inversion formula provides a systematic sensitivity analysis. The approach is applicable to a wide range of nonlinear ill-posed problems. We test the algorithm on a nonlinear problem of travel-time inversion in seismic tomography. Numerical results illustrate the robustness and efficiency of the algorithm.

Kato type operators and Weyl's theorem

NASA Astrophysics Data System (ADS)

Duggal, B. P.; Djordjevic, S. V.; Kubrusly, Carlos

2005-09-01

A Banach space operator T satisfies Weyl's theorem if and only if T or T* has SVEP at all complex numbers [lambda] in the complement of the Weyl spectrum of T and T is Kato type at all [lambda] which are isolated eigenvalues of T of finite algebraic multiplicity. If T* (respectively, T) has SVEP and T is Kato type at all [lambda] which are isolated eigenvalues of T of finite algebraic multiplicity (respectively, T is Kato type at all [lambda][set membership, variant]iso[sigma](T)), then T satisfies a-Weyl's theorem (respectively, T* satisfies a-Weyl's theorem).

A Nonlinear Functional Differential Equation in Banach Space with Applications to Materials with Fading Memory.

DTIC Science & Technology

1982-08-01

memory can be interpreted * mathematically as a smoothness requirement for Y. Following Coleman and Noll [ 4,5 ], we introduce an influence function , intended...to characterize the rate at which memory fades, and construct an LP-type space of admissible strain histories, using the influence function as a...that f h(s)fw(s)I ds < c, 0 equipped with the norm* given by (1.8) IwIl h = w(o)l + f h(s)w(s) 2d 0 We refer to h as an influence function and to the

The Cr dependence problem of eigenvalues of the Laplace operator on domains in the plane

NASA Astrophysics Data System (ADS)

Haddad, Julian; Montenegro, Marcos

2018-03-01

The Cr dependence problem of multiple Dirichlet eigenvalues on domains is discussed for elliptic operators by regarding C r + 1-smooth one-parameter families of C1 perturbations of domains in Rn. As applications of our main theorem (Theorem 1), we provide a fairly complete description for all eigenvalues of the Laplace operator on disks and squares in R2 and also for its second eigenvalue on balls in Rn for any n ≥ 3. The central tool used in our proof is a degenerate implicit function theorem on Banach spaces (Theorem 2) of independent interest.

Scaling of Convex Hull Volume to Body Mass in Modern Primates, Non-Primate Mammals and Birds

PubMed Central

Brassey, Charlotte A.; Sellers, William I.

2014-01-01

The volumetric method of ‘convex hulling’ has recently been put forward as a mass prediction technique for fossil vertebrates. Convex hulling involves the calculation of minimum convex hull volumes (vol CH) from the complete mounted skeletons of modern museum specimens, which are subsequently regressed against body mass (M b) to derive predictive equations for extinct species. The convex hulling technique has recently been applied to estimate body mass in giant sauropods and fossil ratites, however the biomechanical signal contained within vol CH has remained unclear. Specifically, when vol CH scaling departs from isometry in a group of vertebrates, how might this be interpreted? Here we derive predictive equations for primates, non-primate mammals and birds and compare the scaling behaviour of M b to vol CH between groups. We find predictive equations to be characterised by extremely high correlation coefficients (r 2 = 0.97–0.99) and low mean percentage prediction error (11–20%). Results suggest non-primate mammals scale body mass to vol CH isometrically (b = 0.92, 95%CI = 0.85–1.00, p = 0.08). Birds scale body mass to vol CH with negative allometry (b = 0.81, 95%CI = 0.70–0.91, p = 0.011) and apparent density (vol CH/M b) therefore decreases with mass (r 2 = 0.36, p<0.05). In contrast, primates scale body mass to vol CH with positive allometry (b = 1.07, 95%CI = 1.01–1.12, p = 0.05) and apparent density therefore increases with size (r 2 = 0.46, p = 0.025). We interpret such departures from isometry in the context of the ‘missing mass’ of soft tissues that are excluded from the convex hulling process. We conclude that the convex hulling technique can be justifiably applied to the fossil record when a large proportion of the skeleton is preserved. However we emphasise the need for future studies to quantify interspecific variation in the distribution of soft tissues such as muscle, integument and body fat. PMID:24618736

Integrating NOE and RDC using sum-of-squares relaxation for protein structure determination.

PubMed

Khoo, Y; Singer, A; Cowburn, D

2017-07-01

We revisit the problem of protein structure determination from geometrical restraints from NMR, using convex optimization. It is well-known that the NP-hard distance geometry problem of determining atomic positions from pairwise distance restraints can be relaxed into a convex semidefinite program (SDP). However, often the NOE distance restraints are too imprecise and sparse for accurate structure determination. Residual dipolar coupling (RDC) measurements provide additional geometric information on the angles between atom-pair directions and axes of the principal-axis-frame. The optimization problem involving RDC is highly non-convex and requires a good initialization even within the simulated annealing framework. In this paper, we model the protein backbone as an articulated structure composed of rigid units. Determining the rotation of each rigid unit gives the full protein structure. We propose solving the non-convex optimization problems using the sum-of-squares (SOS) hierarchy, a hierarchy of convex relaxations with increasing complexity and approximation power. Unlike classical global optimization approaches, SOS optimization returns a certificate of optimality if the global optimum is found. Based on the SOS method, we proposed two algorithms-RDC-SOS and RDC-NOE-SOS, that have polynomial time complexity in the number of amino-acid residues and run efficiently on a standard desktop. In many instances, the proposed methods exactly recover the solution to the original non-convex optimization problem. To the best of our knowledge this is the first time SOS relaxation is introduced to solve non-convex optimization problems in structural biology. We further introduce a statistical tool, the Cramér-Rao bound (CRB), to provide an information theoretic bound on the highest resolution one can hope to achieve when determining protein structure from noisy measurements using any unbiased estimator. Our simulation results show that when the RDC measurements are corrupted by Gaussian noise of realistic variance, both SOS based algorithms attain the CRB. We successfully apply our method in a divide-and-conquer fashion to determine the structure of ubiquitin from experimental NOE and RDC measurements obtained in two alignment media, achieving more accurate and faster reconstructions compared to the current state of the art.

Evaluating convex roof entanglement measures.

PubMed

Tóth, Géza; Moroder, Tobias; Gühne, Otfried

2015-04-24

We show a powerful method to compute entanglement measures based on convex roof constructions. In particular, our method is applicable to measures that, for pure states, can be written as low order polynomials of operator expectation values. We show how to compute the linear entropy of entanglement, the linear entanglement of assistance, and a bound on the dimension of the entanglement for bipartite systems. We discuss how to obtain the convex roof of the three-tangle for three-qubit states. We also show how to calculate the linear entropy of entanglement and the quantum Fisher information based on partial information or device independent information. We demonstrate the usefulness of our method by concrete examples.

Impact of trailing edge shape on the wake and propulsive performance of pitching panels

NASA Astrophysics Data System (ADS)

Van Buren, T.; Floryan, D.; Brunner, D.; Senturk, U.; Smits, A. J.

2017-01-01

The effects of changing the trailing edge shape on the wake and propulsive performance of a pitching rigid panel are examined experimentally. The panel aspect ratio is AR=1 , and the trailing edges are symmetric chevron shapes with convex and concave orientations of varying degree. Concave trailing edges delay the natural vortex bending and compression of the wake, and the mean streamwise velocity field contains a single jet. Conversely, convex trailing edges promote wake compression and produce a quadfurcated wake with four jets. As the trailing edge shape changes from the most concave to the most convex, the thrust and efficiency increase significantly.

A Convex Approach to Fault Tolerant Control

NASA Technical Reports Server (NTRS)

Maghami, Peiman G.; Cox, David E.; Bauer, Frank (Technical Monitor)

2002-01-01

The design of control laws for dynamic systems with the potential for actuator failures is considered in this work. The use of Linear Matrix Inequalities allows more freedom in controller design criteria than typically available with robust control. This work proposes an extension of fault-scheduled control design techniques that can find a fixed controller with provable performance over a set of plants. Through convexity of the objective function, performance bounds on this set of plants implies performance bounds on a range of systems defined by a convex hull. This is used to incorporate performance bounds for a variety of soft and hard failures into the control design problem.

Rapid Generation of Optimal Asteroid Powered Descent Trajectories Via Convex Optimization

NASA Technical Reports Server (NTRS)

Pinson, Robin; Lu, Ping

2015-01-01

This paper investigates a convex optimization based method that can rapidly generate the fuel optimal asteroid powered descent trajectory. The ultimate goal is to autonomously design the optimal powered descent trajectory on-board the spacecraft immediately prior to the descent burn. Compared to a planetary powered landing problem, the major difficulty is the complex gravity field near the surface of an asteroid that cannot be approximated by a constant gravity field. This paper uses relaxation techniques and a successive solution process that seeks the solution to the original nonlinear, nonconvex problem through the solutions to a sequence of convex optimal control problems.

Relaxation in control systems of subdifferential type

NASA Astrophysics Data System (ADS)

Tolstonogov, A. A.

2006-02-01

In a separable Hilbert space we consider a control system with evolution operators that are subdifferentials of a proper convex lower semicontinuous function depending on time. The constraint on the control is given by a multivalued function with non-convex values that is lower semicontinuous with respect to the variable states. Along with the original system we consider the system in which the constraint on the control is the upper semicontinuous convex-valued regularization of the original constraint. We study relations between the solution sets of these systems. As an application we consider a control variational inequality. We give an example of a control system of parabolic type with an obstacle.

Density of convex intersections and applications

PubMed Central

Rautenberg, C. N.; Rösel, S.

2017-01-01

In this paper, we address density properties of intersections of convex sets in several function spaces. Using the concept of Γ-convergence, it is shown in a general framework, how these density issues naturally arise from the regularization, discretization or dualization of constrained optimization problems and from perturbed variational inequalities. A variety of density results (and counterexamples) for pointwise constraints in Sobolev spaces are presented and the corresponding regularity requirements on the upper bound are identified. The results are further discussed in the context of finite-element discretizations of sets associated with convex constraints. Finally, two applications are provided, which include elasto-plasticity and image restoration problems. PMID:28989301

Reducing the duality gap in partially convex programming

DOE Office of Scientific and Technical Information (OSTI.GOV)

Correa, R.

1994-12-31

We consider the non-linear minimization program {alpha} = min{sub z{element_of}D, x{element_of}C}{l_brace}f{sub 0}(z, x) : f{sub i}(z, x) {<=} 0, i {element_of} {l_brace}1, ..., m{r_brace}{r_brace} where f{sub i}(z, {center_dot}) are convex functions, C is convex and D is compact. Following Ben-Tal, Eiger and Gershowitz we prove the existence of a partial dual program whose optimum is arbitrarily close to {alpha}. The idea, corresponds to the branching principle in Branch and Bound methods. We describe such a kind of algorithm for obtaining the desired partial dual.

On the polarizability dyadics of electrically small, convex objects

NASA Astrophysics Data System (ADS)

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.

On new fractional Hermite-Hadamard type inequalities for n-time differentiable quasi-convex functions and P-functions

NASA Astrophysics Data System (ADS)

Set, Erhan; Özdemir, M. Emin; Alan, E. Aykan

2017-04-01

In this article, by using the Hölder's inequality and power mean inequality the authors establish several inequalities of Hermite-Hadamard type for n- time differentiable quasi-convex functions and P- functions involving Riemann-Liouville fractional integrals.

Convexity of Energy-Like Functions: Theoretical Results and Applications to Power System Operations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dvijotham, Krishnamurthy; Low, Steven; Chertkov, Michael

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 designmore » 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.« less

L 1-2 minimization for exact and stable seismic attenuation compensation

NASA Astrophysics Data System (ADS)

Wang, Yufeng; Ma, Xiong; Zhou, Hui; Chen, Yangkang

2018-06-01

Frequency-dependent amplitude absorption and phase velocity dispersion are typically linked by the causality-imposed Kramers-Kronig relations, which inevitably degrade the quality of seismic data. Seismic attenuation compensation is an important processing approach for enhancing signal resolution and fidelity, which can be performed on either pre-stack or post-stack data so as to mitigate amplitude absorption and phase dispersion effects resulting from intrinsic anelasticity of subsurface media. Inversion-based compensation with L1 norm constraint, enlightened by the sparsity of the reflectivity series, enjoys better stability over traditional inverse Q filtering. However, constrained L1 minimization serving as the convex relaxation of the literal L0 sparsity count may not give the sparsest solution when the kernel matrix is severely ill conditioned. Recently, non-convex metric for compressed sensing has attracted considerable research interest. In this paper, we propose a nearly unbiased approximation of the vector sparsity, denoted as L1-2 minimization, for exact and stable seismic attenuation compensation. Non-convex penalty function of L1-2 norm can be decomposed into two convex subproblems via difference of convex algorithm, each subproblem can be solved efficiently by alternating direction method of multipliers. The superior performance of the proposed compensation scheme based on L1-2 metric over conventional L1 penalty is further demonstrated by both synthetic and field examples.

Lateral facial profile may reveal the risk for sleep disordered breathing in children--the PANIC-study.

PubMed

Ikävalko, Tiina; Närhi, Matti; Lakka, Timo; Myllykangas, Riitta; Tuomilehto, Henri; Vierola, Anu; Pahkala, Riitta

2015-01-01

To evaluate the lateral view photography of the face as a tool for assessing morphological properties (i.e. facial convexity) as a risk factor for sleep disordered breathing (SDB) in children and to test how reliably oral health and non-oral healthcare professionals can visually discern the lateral profile of the face from the photographs. The present study sample consisted of 382 children 6-8 years of age who were participants in the Physical Activity and Nutrition in Children (PANIC) Study. Sleep was assessed by a sleep questionnaire administered by the parents. SDB was defined as apnoeas, frequent or loud snoring or nocturnal mouth breathing observed by the parents. The facial convexity was assessed with three different methods. First, it was clinically evaluated by the reference orthodontist (T.I.). Second, lateral view photographs were taken to visually sub-divide the facial profile into convex, normal or concave. The photos were examined by a reference orthodontist and seven different healthcare professionals who work with children and also by a dental student. The inter- and intra-examiner consistencies were calculated by Kappa statistics. Three soft tissue landmarks of the facial profile, soft tissue Glabella (G`), Subnasale (Sn) and soft tissue Pogonion (Pg`) were digitally identified to analyze convexity of the face and the intra-examiner reproducibility of the reference orthodontist was determined by calculating intra-class correlation coefficients (ICCs). The third way to express the convexity of the face was to calculate the angle of facial convexity (G`-Sn-Pg`) and to group it into quintiles. For analysis the lowest quintile (≤164.2°) was set to represent the most convex facial profile. The prevalence of the SDB in children with the most convex profiles expressed with the lowest quintile of the angle G`-Sn-Pg` (≤164.2°) was almost 2-fold (14.5%) compared to those with normal profile (8.1%) (p = 0.084). The inter-examiner Kappa values between the reference orthodontist and the other examiners for visually assessing the facial profile with the photographs ranged from poor-to-moderate (0.000-0.579). The best Kappa values were achieved between the two orthodontists (0.579). The intra-examiner Kappa value of the reference orthodontist for assessing the profiles was 0.920, with the agreement of 93.3%. In the ICC and its 95% CI between the two digital measurements, the angles of convexity of the facial profile (G`-Sn-Pg`) of the reference orthodontist were 0.980 and 0.951-0.992. In addition to orthodontists, it would be advantageous if also other healthcare professionals could play a key role in identifying certain risk features for SDB. However, the present results indicate that, in order to recognize the morphological risk for SDB, one would need to be trained for the purpose and, as well, needs sufficient knowledge of the growth and development of the face.

Linear Controller Design: Limits of Performance

DTIC Science & Technology

1991-01-01

where a sensor should be placed eg where an accelerometer is to be positioned on an aircraft or where a strain gauge is placed along a beam The...309 VIII CONTENTS 14 Special Algorithms for Convex Optimization 311 Notation and Problem Denitions...311 On Algorithms for Convex Optimization 312 CuttingPlane Algorithms

Algorithms for Mathematical Programming with Emphasis on Bi-level Models

DOE Office of Scientific and Technical Information (OSTI.GOV)

Goldfarb, Donald; Iyengar, Garud

2014-05-22

The research supported by this grant was focused primarily on first-order methods for solving large scale and structured convex optimization problems and convex relaxations of nonconvex problems. These include optimal gradient methods, operator and variable splitting methods, alternating direction augmented Lagrangian methods, and block coordinate descent methods.

Transrectal real-time elastography of the prostate: Normal patterns

PubMed Central

Goddi, A.; Sacchi, A.; Magistretti, G.; Almolla, J.

2011-01-01

Introduction Given the growing importance in clinical practice of transrectal real-time sonoelastography of the prostate, it is important to define normal patterns correlated to volume growth and reconsider the technical problems. Materials and methods We selected a sample of 100 men aged 30 to 87 with prostate volumes ranging from 20 to 100 cc. Strain images were obtained using an end-fire convex probe. The elasticity patterns of the various anatomical zones of the prostate were compared with the volume. Results The peripheral zone showed intermediate elasticity in 100% of cases regardless of the volume. We found some rare small areas of more limited elasticity in 23% of cases, among patients over 40. The posterior side of the central zone exhibited intermediate elasticity, and relative inelasticity was observed on the lateral side and at the base in 79% of cases. The entire central zone appeared compliant in 15% of cases and inelastic in 6%. The transition zone findings were stratified according to gland volume. When the volume was less than 45 cc, the transition zone was elastic in 67% of cases, inhomogeneously inelastic in 22%, and uniformly inelastic in 11%. In glands larger than 45 cc, the appearance was mainly elastic in 31% of cases, inhomogeneously inelastic in 57%, and uniformly inelastic in 12%. Conclusions Real-time elastography can distinguish the elastic properties of the prostate and define the normal patterns associated with increases in gland volume. PMID:23396618

Convex central configurations for the n-body problem

NASA Astrophysics Data System (ADS)

Xia, Zhihong

We give a simple proof of a classical result of MacMillan and Bartky (Trans. Amer. Math. Soc. 34 (1932) 838) which states that, for any four positive masses and any assigned order, there is a convex planar central configuration. Moreover, we show that the central configurations we find correspond to local minima of the potential function with fixed moment of inertia. This allows us to show that there are at least six local minimum central configurations for the planar four-body problem. We also show that for any assigned order of five masses, there is at least one convex spatial central configuration of local minimum type. Our method also applies to some other cases.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Livine, Etera R.

We introduce the set of framed (convex) polyhedra with N faces as the symplectic quotient C{sup 2N}//SU(2). A framed polyhedron is then parametrized by N spinors living in C{sup 2} satisfying suitable closure constraints and defines a usual convex polyhedron plus extra U(1) phases attached to each face. We show that there is a natural action of the unitary group U(N) on this phase space, which changes the shape of faces and allows to map any (framed) polyhedron onto any other with the same total (boundary) area. This identifies the space of framed polyhedra to the Grassmannian space U(N)/ (SU(2)×U(N−2)).more » We show how to write averages of geometrical observables (polynomials in the faces' area and the angles between them) over the ensemble of polyhedra (distributed uniformly with respect to the Haar measure on U(N)) as polynomial integrals over the unitary group and we provide a few methods to compute these integrals systematically. We also use the Itzykson-Zuber formula from matrix models as the generating function for these averages and correlations. In the quantum case, a canonical quantization of the framed polyhedron phase space leads to the Hilbert space of SU(2) intertwiners (or, in other words, SU(2)-invariant states in tensor products of irreducible representations). The total boundary area as well as the individual face areas are quantized as half-integers (spins), and the Hilbert spaces for fixed total area form irreducible representations of U(N). We define semi-classical coherent intertwiner states peaked on classical framed polyhedra and transforming consistently under U(N) transformations. And we show how the U(N) character formula for unitary transformations is to be considered as an extension of the Itzykson-Zuber to the quantum level and generates the traces of all polynomial observables over the Hilbert space of intertwiners. We finally apply the same formalism to two dimensions and show that classical (convex) polygons can be described in a similar fashion trading the unitary group for the orthogonal group. We conclude with a discussion of the possible (deformation) dynamics that one can define on the space of polygons or polyhedra. This work is a priori useful in the context of discrete geometry but it should hopefully also be relevant to (loop) quantum gravity in 2+1 and 3+1 dimensions when the quantum geometry is defined in terms of gluing of (quantized) polygons and polyhedra.« less

Asteroid models from the Lowell photometric database

NASA Astrophysics Data System (ADS)

Ďurech, J.; Hanuš, J.; Oszkiewicz, D.; Vančo, R.

2016-03-01

Context. Information about shapes and spin states of individual asteroids is important for the study of the whole asteroid population. For asteroids from the main belt, most of the shape models available now have been reconstructed from disk-integrated photometry by the lightcurve inversion method. Aims: We want to significantly enlarge the current sample (~350) of available asteroid models. Methods: We use the lightcurve inversion method to derive new shape models and spin states of asteroids from the sparse-in-time photometry compiled in the Lowell Photometric Database. To speed up the time-consuming process of scanning the period parameter space through the use of convex shape models, we use the distributed computing project Asteroids@home, running on the Berkeley Open Infrastructure for Network Computing (BOINC) platform. This way, the period-search interval is divided into hundreds of smaller intervals. These intervals are scanned separately by different volunteers and then joined together. We also use an alternative, faster, approach when searching the best-fit period by using a model of triaxial ellipsoid. By this, we can independently confirm periods found with convex models and also find rotation periods for some of those asteroids for which the convex-model approach gives too many solutions. Results: From the analysis of Lowell photometric data of the first 100 000 numbered asteroids, we derived 328 new models. This almost doubles the number of available models. We tested the reliability of our results by comparing models that were derived from purely Lowell data with those based on dense lightcurves, and we found that the rate of false-positive solutions is very low. We also present updated plots of the distribution of spin obliquities and pole ecliptic longitudes that confirm previous findings about a non-uniform distribution of spin axes. However, the models reconstructed from noisy sparse data are heavily biased towards more elongated bodies with high lightcurve amplitudes. Conclusions: The Lowell Photometric Database is a rich and reliable source of information about the spin states of asteroids. We expect hundreds of other asteroid models for asteroids with numbers larger than 100 000 to be derivable from this data set. More models will be able to be reconstructed when Lowell data are merged with other photometry. Tables 1 and 2 are only available at the CDS via anonymous ftp to http://cdsarc.u-strasbg.fr (ftp://130.79.128.5) or via http://cdsarc.u-strasbg.fr/viz-bin/qcat?J/A+A/587/A48

78 FR 68833 - Combined Notice of Filings #1

Federal Register 2010, 2011, 2012, 2013, 2014

2013-11-15

... DEPARTMENT OF ENERGY Federal Energy Regulatory Commission Combined Notice of Filings 1 Take notice... Wallingford--CONVEX Services CL&P Electric Rate Schedule FERC No. 583 to be effective 1/1/2014. Filed Date: 11... Company submits CMEEC--CONVEX Services First Revised Rate Schedule FERC No. 576 to be effective 1/1/2014...

Convexities move because they contain matter.

PubMed

Barenholtz, Elan

2010-09-22

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

A distributed approach to the OPF problem

NASA Astrophysics Data System (ADS)

Erseghe, Tomaso

2015-12-01

This paper presents a distributed approach to optimal power flow (OPF) in an electrical network, suitable for application in a future smart grid scenario where access to resource and control is decentralized. The non-convex OPF problem is solved by an augmented Lagrangian method, similar to the widely known ADMM algorithm, with the key distinction that penalty parameters are constantly increased. A (weak) assumption on local solver reliability is required to always ensure convergence. A certificate of convergence to a local optimum is available in the case of bounded penalty parameters. For moderate sized networks (up to 300 nodes, and even in the presence of a severe partition of the network), the approach guarantees a performance very close to the optimum, with an appreciably fast convergence speed. The generality of the approach makes it applicable to any (convex or non-convex) distributed optimization problem in networked form. In the comparison with the literature, mostly focused on convex SDP approximations, the chosen approach guarantees adherence to the reference problem, and it also requires a smaller local computational complexity effort.

Efficient convex-elastic net algorithm to solve the Euclidean traveling salesman problem.

PubMed

Al-Mulhem, M; Al-Maghrabi, T

1998-01-01

This paper describes a hybrid algorithm that combines an adaptive-type neural network algorithm and a nondeterministic iterative algorithm to solve the Euclidean traveling salesman problem (E-TSP). It begins with a brief introduction to the TSP and the E-TSP. Then, it presents the proposed algorithm with its two major components: the convex-elastic net (CEN) algorithm and the nondeterministic iterative improvement (NII) algorithm. These two algorithms are combined into the efficient convex-elastic net (ECEN) algorithm. The CEN algorithm integrates the convex-hull property and elastic net algorithm to generate an initial tour for the E-TSP. The NII algorithm uses two rearrangement operators to improve the initial tour given by the CEN algorithm. The paper presents simulation results for two instances of E-TSP: randomly generated tours and tours for well-known problems in the literature. Experimental results are given to show that the proposed algorithm ran find the nearly optimal solution for the E-TSP that outperform many similar algorithms reported in the literature. The paper concludes with the advantages of the new algorithm and possible extensions.

Convex Clustering: An Attractive Alternative to Hierarchical Clustering

PubMed Central

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

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

NASA Astrophysics Data System (ADS)

Shah, S.; Gray, F.; Yang, J.; Crawshaw, J.; Boek, E.

2016-12-01

Advances in 3D pore-scale imaging and computational methods have allowed an exceptionally detailed quantitative and qualitative analysis of the fluid flow in complex porous media. A fundamental problem in pore-scale imaging and modelling is how to represent and model the range of scales encountered in porous media, starting from the smallest pore spaces. In this study, a novel method is presented for determining the representative elementary volume (REV) of a rock for several parameters simultaneously. We calculate the two main macroscopic petrophysical parameters, porosity and single-phase permeability, using micro CT imaging and Lattice Boltzmann (LB) simulations for 14 different porous media, including sandpacks, sandstones and carbonates. The concept of the `Convex Hull' is then applied to calculate the REV for both parameters simultaneously using a plot of the area of the convex hull as a function of the sub-volume, capturing the different scales of heterogeneity from the pore-scale imaging. The results also show that the area of the convex hull (for well-chosen parameters such as the log of the permeability and the porosity) decays exponentially with sub-sample size suggesting a computationally efficient way to determine the system size needed to calculate the parameters to high accuracy (small convex hull area). Finally we propose using a characteristic length such as the pore size to choose an efficient absolute voxel size for the numerical rock.

Detection of longitudinal ulcer using roughness value for computer aided diagnosis of Crohn's disease

NASA Astrophysics Data System (ADS)

Oda, Masahiro; Kitasaka, Takayuki; Furukawa, Kazuhiro; Watanabe, Osamu; Ando, Takafumi; Goto, Hidemi; Mori, Kensaku

2011-03-01

The purpose of this paper is to present a new method to detect ulcers, which is one of the symptoms of Crohn's disease, from CT images. Crohn's disease is an inflammatory disease of the digestive tract. Crohn's disease commonly affects the small intestine. An optical or a capsule endoscope is used for small intestine examinations. However, these endoscopes cannot pass through intestinal stenosis parts in some cases. A CT image based diagnosis allows a physician to observe whole intestine even if intestinal stenosis exists. However, because of the complicated shape of the small and large intestines, understanding of shapes of the intestines and lesion positions are difficult in the CT image based diagnosis. Computer-aided diagnosis system for Crohn's disease having automated lesion detection is required for efficient diagnosis. We propose an automated method to detect ulcers from CT images. Longitudinal ulcers make rough surface of the small and large intestinal wall. The rough surface consists of combination of convex and concave parts on the intestinal wall. We detect convex and concave parts on the intestinal wall by a blob and an inverse-blob structure enhancement filters. A lot of convex and concave parts concentrate on roughed parts. We introduce a roughness value to differentiate convex and concave parts concentrated on the roughed parts from the other on the intestinal wall. The roughness value effectively reduces false positives of ulcer detection. Experimental results showed that the proposed method can detect convex and concave parts on the ulcers.

“Soft that molds the hard:” Geometric morphometry of lateral atlantoaxial joints focusing on the role of cartilage in changing the contour of bony articular surfaces

PubMed Central

Prasad, Prashant Kumar; Salunke, Pravin; Sahni, Daisy; Kalra, Parveen

2017-01-01

Purpose: The existing literature on lateral atlantoaxial joints is predominantly on bony facets and is unable to explain various C1-2 motions observed. Geometric morphometry of facets would help us in understanding the role of cartilages in C1-2 biomechanics/kinematics. Objective: Anthropometric measurements (bone and cartilage) of the atlantoaxial joint and to assess the role of cartilages in joint biomechanics. Materials and Methods: The authors studied 10 cadaveric atlantoaxial lateral joints with the articular cartilage in situ and after removing it, using three-dimensional laser scanner. The data were compared using geometric morphometry with emphasis on surface contours of articulating surfaces. Results: The bony inferior articular facet of atlas is concave in both sagittal and coronal plane. The bony superior articular facet of axis is convex in sagittal plane and is concave (laterally) and convex medially in the coronal plane. The bony articulating surfaces were nonconcordant. The articular cartilages of both C1 and C2 are biconvex in both planes and are thicker than the concavities of bony articulating surfaces. Conclusion: The biconvex structure of cartilage converts the surface morphology of C1-C2 bony facets from concave on concavo-convex to convex on convex. This reduces the contact point making the six degrees of freedom of motion possible and also makes the joint gyroscopic. PMID:29403249

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

PubMed

Kong, Adams Wai-Kin

2013-03-01

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

Convex clustering: an attractive alternative to hierarchical clustering.

PubMed

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

2015-05-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/.

SINDA'85/FLUINT - SYSTEMS IMPROVED NUMERICAL DIFFERENCING ANALYZER AND FLUID INTEGRATOR (CONVEX VERSION)

NASA Technical Reports Server (NTRS)

Cullimore, B.

1994-01-01

SINDA, the Systems Improved Numerical Differencing Analyzer, is a software system for solving lumped parameter representations of physical problems governed by diffusion-type equations. SINDA was originally designed for analyzing thermal systems represented in electrical analog, lumped parameter form, although its use may be extended to include other classes of physical systems which can be modeled in this form. As a thermal analyzer, SINDA can handle such interrelated phenomena as sublimation, diffuse radiation within enclosures, transport delay effects, and sensitivity analysis. FLUINT, the FLUid INTegrator, is an advanced one-dimensional fluid analysis program that solves arbitrary fluid flow networks. The working fluids can be single phase vapor, single phase liquid, or two phase. The SINDA'85/FLUINT system permits the mutual influences of thermal and fluid problems to be analyzed. The SINDA system consists of a programming language, a preprocessor, and a subroutine library. The SINDA language is designed for working with lumped parameter representations and finite difference solution techniques. The preprocessor accepts programs written in the SINDA language and converts them into standard FORTRAN. The SINDA library consists of a large number of FORTRAN subroutines that perform a variety of commonly needed actions. The use of these subroutines can greatly reduce the programming effort required to solve many problems. A complete run of a SINDA'85/FLUINT model is a four step process. First, the user's desired model is run through the preprocessor which writes out data files for the processor to read and translates the user's program code. Second, the translated code is compiled. The third step requires linking the user's code with the processor library. Finally, the processor is executed. SINDA'85/FLUINT program features include 20,000 nodes, 100,000 conductors, 100 thermal submodels, and 10 fluid submodels. SINDA'85/FLUINT can also model two phase flow, capillary devices, user defined fluids, gravity and acceleration body forces on a fluid, and variable volumes. SINDA'85/FLUINT offers the following numerical solution techniques. The Finite difference formulation of the explicit method is the Forward-difference explicit approximation. The formulation of the implicit method is the Crank-Nicolson approximation. The program allows simulation of non-uniform heating and facilitates modeling thin-walled heat exchangers. The ability to model non-equilibrium behavior within two-phase volumes is included. Recent improvements to the program were made in modeling real evaporator-pumps and other capillary-assist evaporators. SINDA'85/FLUINT is available by license for a period of ten (10) years to approved licensees. The licensed program product includes the source code and one copy of the supporting documentation. Additional copies of the documentation may be purchased separately at any time. SINDA'85/FLUINT is written in FORTRAN 77. Version 2.3 has been implemented on Cray series computers running UNICOS, CONVEX computers running CONVEX OS, and DEC RISC computers running ULTRIX. Binaries are included with the Cray version only. The Cray version of SINDA'85/FLUINT also contains SINGE, an additional graphics program developed at Johnson Space Flight Center. Both source and executable code are provided for SINGE. Users wishing to create their own SINGE executable will also need the NASA Device Independent Graphics Library (NASADIG, previously known as SMDDIG; UNIX version, MSC-22001). The Cray and CONVEX versions of SINDA'85/FLUINT are available on 9-track 1600 BPI UNIX tar format magnetic tapes. The CONVEX version is also available on a .25 inch streaming magnetic tape cartridge in UNIX tar format. The DEC RISC ULTRIX version is available on a TK50 magnetic tape cartridge in UNIX tar format. SINDA was developed in 1971, and first had fluid capability added in 1975. SINDA'85/FLUINT version 2.3 was released in 1990.

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

PubMed

Fourie, Zacharias; Ozcan, Mutlu; Sandham, Andrew

2009-07-01

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 dental arch setups, and to evaluate the effect of different archwires on friction in both dental arch models. Two stainless steel models were designed and manufactured simulating flat and convex maxillary right buccal dental arches. Five stainless steel brackets from the maxillary incisor to the second premolar (slot size, 0.22 in, Victory, 3M Unitek, Monrovia, Calif) and a first molar tube were aligned and clamped on the metal model at equal distances of 6 mm. Four kinds of orthodontic wires were tested: (1) A. J. Wilcock Australian wire (0.016 in, G&H Wire, Hannover, Germany); and (2) 0.016 x 0.022 in, (3) 0.018 x 0.022 in, and (4) 0.019 x 0.025 in (3M Unitek GmbH, Seefeld, Germany). Gray elastomeric modules (Power O 110, Ormco, Glendora, Calif) were used for ligation. Friction tests were performed in the wet state with artificial saliva lubrication and by pulling 5 mm of the whole length of the archwire. Six measurements were made from each bracket-wire combination, and each test was performed with new combinations of materials for both arch setups (n = 48, 6 per group) in a universal testing machine (crosshead speed: 20 mm/min). Significant effects of arch model (P = 0.0000) and wire types (P = 0.0000) were found. The interaction term between the tested factors was not significant (P = 0.1581) (2-way ANOVA and Tukey test). Convex models resulted in significantly higher frictional forces (1015-1653 g) than flat models (680-1270 g) (P <0.05). In the flat model, significantly lower frictional forces were obtained with wire types 1 (679 g) and 3 (1010 g) than with types 2 (1146 g) and 4 (1270 g) (P <0.05). In the convex model, the lowest friction was obtained with wire types 1 (1015 g) and 3 (1142 g) (P >0.05). Type 1 wire tended to create the least overall friction in both flat and convex dental arch simulation models.

Convergence dynamics and pseudo almost periodicity of a class of nonautonomous RFDEs with applications

NASA Astrophysics Data System (ADS)

Fan, Meng; Ye, Dan

2005-09-01

This paper studies the dynamics of a system of retarded functional differential equations (i.e., RF=Es), which generalize the Hopfield neural network models, the bidirectional associative memory neural networks, the hybrid network models of the cellular neural network type, and some population growth model. Sufficient criteria are established for the globally exponential stability and the existence and uniqueness of pseudo almost periodic solution. The approaches are based on constructing suitable Lyapunov functionals and the well-known Banach contraction mapping principle. The paper ends with some applications of the main results to some neural network models and population growth models and numerical simulations.

Rigorous Model Reduction for a Damped-Forced Nonlinear Beam Model: An Infinite-Dimensional Analysis

NASA Astrophysics Data System (ADS)

Kogelbauer, Florian; Haller, George

2018-06-01

We use invariant manifold results on Banach spaces to conclude the existence of spectral submanifolds (SSMs) in a class of nonlinear, externally forced beam oscillations. SSMs are the smoothest nonlinear extensions of spectral subspaces of the linearized beam equation. Reduction in the governing PDE to SSMs provides an explicit low-dimensional model which captures the correct asymptotics of the full, infinite-dimensional dynamics. Our approach is general enough to admit extensions to other types of continuum vibrations. The model-reduction procedure we employ also gives guidelines for a mathematically self-consistent modeling of damping in PDEs describing structural vibrations.

A class of fractional differential hemivariational inequalities with application to contact problem

NASA Astrophysics Data System (ADS)

Zeng, Shengda; Liu, Zhenhai; Migorski, Stanislaw

2018-04-01

In this paper, we study a class of generalized differential hemivariational inequalities of parabolic type involving the time fractional order derivative operator in Banach spaces. We use the Rothe method combined with surjectivity of multivalued pseudomonotone operators and properties of the Clarke generalized gradient to establish existence of solution to the abstract inequality. As an illustrative application, a frictional quasistatic contact problem for viscoelastic materials with adhesion is investigated, in which the friction and contact conditions are described by the Clarke generalized gradient of nonconvex and nonsmooth functionals, and the constitutive relation is modeled by the fractional Kelvin-Voigt law.

A semigroup approach to the strong ergodic theorem of the multistate stable population process.

PubMed

Inaba, H

1988-01-01

"In this paper we first formulate the dynamics of multistate stable population processes as a partial differential equation. Next, we rewrite this equation as an abstract differential equation in a Banach space, and solve it by using the theory of strongly continuous semigroups of bounded linear operators. Subsequently, we investigate the asymptotic behavior of this semigroup to show the strong ergodic theorem which states that there exists a stable distribution independent of the initial distribution. Finally, we introduce the dual problem in order to obtain a logical definition for the reproductive value and we discuss its applications." (SUMMARY IN FRE) excerpt

Reflections From a Fresnel Lens

ERIC Educational Resources Information Center

Keeports, David

2005-01-01

Reflection of light by a convex Fresnel lens gives rise to two distinct images. A highly convex inverted real reflective image forms on the object side of the lens, while an upright virtual reflective image forms on the opposite side of the lens. I describe here a set of laser experiments performed upon a Fresnel lens. These experiments provide…

Influence of crucible support and radial heating on the interface shape during vertical Bridgman GaAs growth

NASA Astrophysics Data System (ADS)

Koai, K.; Sonnenberg, K.; Wenzl, H.

1994-03-01

Crucible assembly in a vertical Bridgman furnace is investigated by a numerical finite element model with the aim to obtain convex interfaces during the growth of GaAs crystals. During the growth stage of the conic section, a new funnel shaped crucible support has been found more effective than the concentric cylinders design similar to that patented by AT & T in promoting interface convexity. For the growth stages of the constant diameter section, the furnace profile can be effectively modulated by localized radial heating at the gradient zone. With these two features being introduced into a new furnace design, it is shown numerically that enhancement of interface convexity can be achieved using the presently available crucible materials.

[Objective accommodation parameters depending on accommodation task].

PubMed

Tarutta, E P; Tarasova, N A; Dolzhenko, O O

2011-01-01

62 myopic patients were examined to study objective accommodation parameters in different conditions of accommodation stimulus presenting (use of convex lenses). Objective accommodation response (OAR) was studied using binocular open-field autorefractometer in different conditions of stimulus presenting: complete myopia correction and adding of convex lenses with increasing power from +1.0 till +3.0 D. In 88,5% of children and adolescents showed significant decrease of OAR for 1,5-2,75D in 3.0D stimulus. Additional correction with convex lenses with increasing power leads to further reduce of accommodation response. As a result induced dynamic refraction in eye-lens system is lower than accommodation task. Only addition of +2,5D lense approximates it to required index of -3.0D.

ɛ-subgradient algorithms for bilevel convex optimization

NASA Astrophysics Data System (ADS)

Helou, Elias S.; Simões, Lucas E. A.

2017-05-01

This paper introduces and studies the convergence properties of a new class of explicit ɛ-subgradient methods for the task of minimizing a convex function over a set of minimizers of another convex minimization problem. The general algorithm specializes to some important cases, such as first-order methods applied to a varying objective function, which have computationally cheap iterations. We present numerical experimentation concerning certain applications where the theoretical framework encompasses efficient algorithmic techniques, enabling the use of the resulting methods to solve very large practical problems arising in tomographic image reconstruction. ES Helou was supported by FAPESP grants 2013/07375-0 and 2013/16508-3 and CNPq grant 311476/2014-7. LEA Simões was supported by FAPESP grants 2011/02219-4 and 2013/14615-7.

Laser backscattering analytical model of Doppler power spectra about rotating convex quadric bodies of revolution

NASA Astrophysics Data System (ADS)

Gong, YanJun; Wu, ZhenSen; Wang, MingJun; Cao, YunHua

2010-01-01

We propose an analytical model of Doppler power spectra in backscatter from arbitrary rough convex quadric bodies of revolution (whose lateral surface is a quadric) rotating around axes. In the global Cartesian coordinate system, the analytical model deduced is suitable for general convex quadric body of revolution. Based on this analytical model, the Doppler power spectra of cones, cylinders, paraboloids of revolution, and sphere-cones combination are proposed. We analyze numerically the influence of geometric parameters, aspect angle, wavelength and reflectance of rough surface of the objects on the broadened spectra because of the Doppler effect. This analytical solution may contribute to laser Doppler velocimetry, and remote sensing of ballistic missile that spin.

Safe Onboard Guidance and Control Under Probabilistic Uncertainty

NASA Technical Reports Server (NTRS)

Blackmore, Lars James

2011-01-01

An algorithm was developed that determines the fuel-optimal spacecraft guidance trajectory that takes into account uncertainty, in order to guarantee that mission safety constraints are satisfied with the required probability. The algorithm uses convex optimization to solve for the optimal trajectory. Convex optimization is amenable to onboard solution due to its excellent convergence properties. The algorithm is novel because, unlike prior approaches, it does not require time-consuming evaluation of multivariate probability densities. Instead, it uses a new mathematical bounding approach to ensure that probability constraints are satisfied, and it is shown that the resulting optimization is convex. Empirical results show that the approach is many orders of magnitude less conservative than existing set conversion techniques, for a small penalty in computation time.

Convex Accelerated Maximum Entropy Reconstruction

PubMed Central

Worley, Bradley

2016-01-01

Maximum entropy (MaxEnt) spectral reconstruction methods provide a powerful framework for spectral estimation of nonuniformly sampled datasets. Many methods exist within this framework, usually defined based on the magnitude of a Lagrange multiplier in the MaxEnt objective function. An algorithm is presented here that utilizes accelerated first-order convex optimization techniques to rapidly and reliably reconstruct nonuniformly sampled NMR datasets using the principle of maximum entropy. This algorithm – called CAMERA for Convex Accelerated Maximum Entropy Reconstruction Algorithm – is a new approach to spectral reconstruction that exhibits fast, tunable convergence in both constant-aim and constant-lambda modes. A high-performance, open source NMR data processing tool is described that implements CAMERA, and brief comparisons to existing reconstruction methods are made on several example spectra. PMID:26894476

SU-E-T-549: A Combinatorial Optimization Approach to Treatment Planning with Non-Uniform Fractions in Intensity Modulated Proton Therapy

DOE Office of Scientific and Technical Information (OSTI.GOV)

Papp, D; Unkelbach, J

2014-06-01

Purpose: Non-uniform fractionation, i.e. delivering distinct dose distributions in two subsequent fractions, can potentially improve outcomes by increasing biological dose to the target without increasing dose to healthy tissues. This is possible if both fractions deliver a similar dose to normal tissues (exploit the fractionation effect) but high single fraction doses to subvolumes of the target (hypofractionation). Optimization of such treatment plans can be formulated using biological equivalent dose (BED), but leads to intractable nonconvex optimization problems. We introduce a novel optimization approach to address this challenge. Methods: We first optimize a reference IMPT plan using standard techniques that deliversmore » a homogeneous target dose in both fractions. The method then divides the pencil beams into two sets, which are assigned to either fraction one or fraction two. The total intensity of each pencil beam, and therefore the physical dose, remains unchanged compared to the reference plan. The objectives are to maximize the mean BED in the target and to minimize the mean BED in normal tissues, which is a quadratic function of the pencil beam weights. The optimal reassignment of pencil beams to one of the two fractions is formulated as a binary quadratic optimization problem. A near-optimal solution to this problem can be obtained by convex relaxation and randomized rounding. Results: The method is demonstrated for a large arteriovenous malformation (AVM) case treated in two fractions. The algorithm yields a treatment plan, which delivers a high dose to parts of the AVM in one of the fractions, but similar doses in both fractions to the normal brain tissue adjacent to the AVM. Using the approach, the mean BED in the target was increased by approximately 10% compared to what would have been possible with a uniform reference plan for the same normal tissue mean BED.« less

Slope gradient and shape effects on soil profiles in the northern mountainous forests of Iran

NASA Astrophysics Data System (ADS)

Fazlollahi Mohammadi, M.; Jalali, S. G. H.; Kooch, Y.; Said-Pullicino, D.

2016-12-01

In order to evaluate the variability of the soil profiles at two shapes (concave and convex) and five positions (summit, shoulder, back slope, footslope and toeslope) of a slope, a study of a virgin area was made in a Beech stand of mountain forests, northern Iran. Across the slope positions, the soil profiles demonstrated significant changes due to topography for two shape slopes. The solum depth of the convex slope was higher than the concave one in all five positions, and it decreased from the summit to shoulder and increased from the mid to lower slope positions for both convex and concave slopes. The thin solum at the upper positions and concave slope demonstrated that pedogenetic development is least at upper slope positions and concave slope where leaching and biomass productivity are less than at lower slopes and concave slope. A large decrease in the thickness of O and A horizons from the summit to back slope was noted for both concave and convex slopes, but it increased from back slope toward down slope for both of them. The average thickness of B horizons increased from summit to down slopes in the case of the concave slope, but in the case of convex slope it decreased from summit to shoulder and afterwards it increased to the down slope. The thicknesses of the different horizons varied in part in the different positions and shape slopes because they had different plant species cover and soil features, which were related to topography.

Powered Descent Guidance with General Thrust-Pointing Constraints

NASA Technical Reports Server (NTRS)

Carson, John M., III; Acikmese, Behcet; Blackmore, Lars

2013-01-01

The Powered Descent Guidance (PDG) algorithm and software for generating Mars pinpoint or precision landing guidance profiles has been enhanced to incorporate thrust-pointing constraints. Pointing constraints would typically be needed for onboard sensor and navigation systems that have specific field-of-view requirements to generate valid ground proximity and terrain-relative state measurements. The original PDG algorithm was designed to enforce both control and state constraints, including maximum and minimum thrust bounds, avoidance of the ground or descent within a glide slope cone, and maximum speed limits. The thrust-bound and thrust-pointing constraints within PDG are non-convex, which in general requires nonlinear optimization methods to generate solutions. The short duration of Mars powered descent requires guaranteed PDG convergence to a solution within a finite time; however, nonlinear optimization methods have no guarantees of convergence to the global optimal or convergence within finite computation time. A lossless convexification developed for the original PDG algorithm relaxed the non-convex thrust bound constraints. This relaxation was theoretically proven to provide valid and optimal solutions for the original, non-convex problem within a convex framework. As with the thrust bound constraint, a relaxation of the thrust-pointing constraint also provides a lossless convexification that ensures the enhanced relaxed PDG algorithm remains convex and retains validity for the original nonconvex problem. The enhanced PDG algorithm provides guidance profiles for pinpoint and precision landing that minimize fuel usage, minimize landing error to the target, and ensure satisfaction of all position and control constraints, including thrust bounds and now thrust-pointing constraints.

Integer Partitions and Convexity

NASA Astrophysics Data System (ADS)

Bouroubi, Sadek

2007-06-01

Let n be an integer >=1, and let p(n,k) and P(n,k) count the number of partitions of n into k parts, and the number of partitions of n into parts less than or equal to k, respectively. In this paper, we show that these functions are convex. The result includes the actual value of the constant of Bateman and Erdos.

Testing and inspecting lens by holographic means

DOEpatents

Hildebrand, Bernard P.

1976-01-01

Processes for the accurate, rapid and inexpensive testing and inspecting of oncave and convex lens surfaces through holographic means requiring no beamsplitters, mirrors or overpower optics, and wherein a hologram formed in accordance with one aspect of the invention contains the entire interferometer and serves as both a master and illuminating source for both concave and said convex surfaces to be so tested.

Some Tours Are More Equal than Others: The Convex-Hull Model Revisited with Lessons for Testing Models of the Traveling Salesperson Problem

ERIC Educational Resources Information Center

Tak, Susanne; Plaisier, Marco; van Rooij, Iris

2008-01-01

To explain human performance on the "Traveling Salesperson" problem (TSP), MacGregor, Ormerod, and Chronicle (2000) proposed that humans construct solutions according to the steps described by their convex-hull algorithm. Focusing on tour length as the dependent variable, and using only random or semirandom point sets, the authors…

Higher order sensitivity of solutions to convex programming problems without strict complementarity

NASA Technical Reports Server (NTRS)

Malanowski, Kazimierz

1988-01-01

Consideration is given to a family of convex programming problems which depend on a vector parameter. It is shown that the solutions of the problems and the associated Lagrange multipliers are arbitrarily many times directionally differentiable functions of the parameter, provided that the data of the problems are sufficiently regular. The characterizations of the respective derivatives are given.

Beam aperture modifier design with acoustic metasurfaces

NASA Astrophysics Data System (ADS)

Tang, Weipeng; Ren, Chunyu

2017-10-01

In this paper, we present a design concept of acoustic beam aperture modifier using two metasurface-based planar lenses. By appropriately designing the phase gradient profile along the metasurface, we obtain a class of acoustic convex lenses and concave lenses, which can focus the incoming plane waves and collimate the converging waves, respectively. On the basis of the high converging and diverging capability of these lenses, two kinds of lens combination scheme, including the convex-concave type and convex-convex type, are proposed to tune up the incoming beam aperture as needed. To be specific, the aperture of the acoustic beam can be shrunk or expanded through adjusting the phase gradient of the pair of lenses and the spacing between them. These lenses and the corresponding aperture modifiers are constructed by the stacking ultrathin labyrinthine structures, which are obtained by the geometry optimization procedure and exhibit high transmission coefficient and a full range of phase shift. The simulation results demonstrate the effectiveness of our proposed beam aperture modifiers. Due to the flexibility in aperture controlling and the simplicity in fabrication, the proposed modifiers have promising potential in applications, such as acoustic imaging, nondestructive evaluation, and communication.

Scalable splitting algorithms for big-data interferometric imaging in the SKA era

NASA Astrophysics Data System (ADS)

Onose, Alexandru; Carrillo, Rafael E.; Repetti, Audrey; McEwen, Jason D.; Thiran, Jean-Philippe; Pesquet, Jean-Christophe; Wiaux, Yves

2016-11-01

In the context of next-generation radio telescopes, like the Square Kilometre Array (SKA), the efficient processing of large-scale data sets is extremely important. Convex optimization tasks under the compressive sensing framework have recently emerged and provide both enhanced image reconstruction quality and scalability to increasingly larger data sets. We focus herein mainly on scalability and propose two new convex optimization algorithmic structures able to solve the convex optimization tasks arising in radio-interferometric imaging. They rely on proximal splitting and forward-backward iterations and can be seen, by analogy, with the CLEAN major-minor cycle, as running sophisticated CLEAN-like iterations in parallel in multiple data, prior, and image spaces. Both methods support any convex regularization function, in particular, the well-studied ℓ1 priors promoting image sparsity in an adequate domain. Tailored for big-data, they employ parallel and distributed computations to achieve scalability, in terms of memory and computational requirements. One of them also exploits randomization, over data blocks at each iteration, offering further flexibility. We present simulation results showing the feasibility of the proposed methods as well as their advantages compared to state-of-the-art algorithmic solvers. Our MATLAB code is available online on GitHub.

Multiple cues add up in defining a figure on a ground.

PubMed

Devinck, Frédéric; Spillmann, Lothar

2013-01-25

We studied the contribution of multiple cues to figure-ground segregation. Convexity, symmetry, and top-down polarity (henceforth called wide base) were used as cues. Single-cue displays as well as ambiguous stimulus patterns containing two or three cues were presented. Error rate (defined by responses to uncued stimuli) and reaction time were used to quantify the figural strength of a given cue. In the first experiment, observers were asked to report which of two regions, left or right, appeared as foreground figure. Error rate did not benefit from adding additional cues if convexity was present, suggesting that responses were based on convexity as the predominant figural determinant. However, reaction time became shorter with additional cues even if convexity was present. For example, when symmetry and wide base were added, figure-ground segregation was facilitated. In a second experiment, stimulus patterns were exposed for 150ms to rule out eye movements. Results were similar to those found in the first experiment. Both experiments suggest that under the conditions of our experiment figure-ground segregation is perceived more readily, when several cues cooperate in defining the figure. Copyright © 2012 Elsevier Ltd. All rights reserved.

Experimental Study of Reciprocating Friction between Rape Stalk and Bionic Nonsmooth Surface Units

PubMed Central

Ma, Zheng; Li, Yaoming; Xu, Lizhang

2015-01-01

Background. China is the largest producer of rape oilseed in the world; however, the mechanization level of rape harvest is relatively low, because rape materials easily adhere to the cleaning screens of combine harvesters, resulting in significant cleaning losses. Previous studies have shown that bionic nonsmooth surface cleaning screens restrain the adhesion of rape materials, but the underlying mechanisms remain unclear. Objective. The reciprocating friction between rape stalk and bionic nonsmooth metal surface was examined. Methods. The short-time Fourier transform method was used to discriminate the stable phase of friction signals and the stick-lag distance was defined to analyze the stable reciprocating friction in a phase diagram. Results. The reciprocating friction between rape stalk and metal surface is a typical stick-slip friction, and the bionic nonsmooth metal surfaces with concave or convex units reduced friction force with increasing reciprocating frequency. The results also showed that the stick-lag distance of convex surface increased with reciprocating frequency, which indicated that convex surface reduces friction force more efficiently. Conclusions. We suggest that bionic nonsmooth surface cleaning screens, especially with convex units, restrain the adhesion of rape materials more efficiently compared to the smooth surface cleaning screens. PMID:27034611

Ultrasound-guided Subclavian Vein Cannulation Using a Micro-Convex Ultrasound Probe

PubMed Central

Fair, James; Hirshberg, Eliotte L.; Grissom, Colin K.; Brown, Samuel M.

2014-01-01

Background: The subclavian vein is the preferred site for central venous catheter placement due to infection risk and patient comfort. Ultrasound guidance is useful in cannulation of other veins, but for the subclavian vein, current ultrasound-guided techniques using high-frequency linear array probes are generally limited to axillary vein cannulation. Methods: We report a series of patients who underwent clinically indicated subclavian venous catheter placement using a micro-convex pediatric probe for real-time guidance in the vein’s longitudinal axis. We identified rates of successful placement and complications by chart review. Results: Twenty-four catheters were placed using the micro-convex pediatric probe with confirmation of placement of the needle medial to the lateral border of the first rib. Sixteen of the catheters were placed by trainee physicians. In 23 patients, the catheter was placed without complication (hematoma, pneumothorax, infection). In one patient, the vein could not be safely cannulated without risk of arterial puncture, so an alternative site was selected. Conclusions: Infraclavicular subclavian vein cannulation using real-time ultrasound with a micro-convex pediatric probe appears to be a safe and effective method of placing subclavian vascular catheters. This technique merits further study to confirm safety and efficacy. PMID:24611628

Systematization, distribution and territory of the middle cerebral artery on the brain surface in chinchilla (Chinchilla lanigera).

PubMed

De Araujo, A C P; Campos, R

2009-02-01

The aim of the present study was to analyse thirty chinchilla (Chinchilla lanigera) brains, injected with latex, and to systematize and describe the distribution and the vascularization territories of the middle cerebral artery. This long vessel, after it has originated from the terminal branch of the basilar artery, formed the following collateral branches: rostral, caudal and striated (perforating) central branches. After crossing the lateral rhinal sulcus, the middle cerebral artery emitted a sequence of rostral and caudal convex hemispheric cortical collateral branches on the convex surface of the cerebral hemisphere to the frontal, parietal, temporal and occipital lobes. Among the rostral convex hemispheric branches, a trunk was observed, which reached the frontal and parietal lobes and, in a few cases, the occipital lobe. The vascular territory of the chinchilla's middle cerebral artery included, in the cerebral hemisphere basis, the lateral cerebral fossa, the caudal third of the olfactory trigone, the rostral two-thirds of the piriform lobe, the lateral olfactory tract, and most of the convex surface of the cerebral hemisphere, except for a strip between the cerebral longitudinal fissure and the vallecula, which extended from the rostral to the caudal poles bordering the cerebral transverse fissure.

Minimal norm constrained interpolation. Ph.D. Thesis

NASA Technical Reports Server (NTRS)

Irvine, L. D.

1985-01-01

In computational fluid dynamics and in CAD/CAM, a physical boundary is usually known only discreetly and most often must be approximated. An acceptable approximation preserves the salient features of the data such as convexity and concavity. In this dissertation, a smooth interpolant which is locally concave where the data are concave and is locally convex where the data are convex is described. The interpolant is found by posing and solving a minimization problem whose solution is a piecewise cubic polynomial. The problem is solved indirectly by using the Peano Kernal theorem to recast it into an equivalent minimization problem having the second derivative of the interpolant as the solution. This approach leads to the solution of a nonlinear system of equations. It is shown that Newton's method is an exceptionally attractive and efficient method for solving the nonlinear system of equations. Examples of shape-preserving interpolants, as well as convergence results obtained by using Newton's method are also shown. A FORTRAN program to compute these interpolants is listed. The problem of computing the interpolant of minimal norm from a convex cone in a normal dual space is also discussed. An extension of de Boor's work on minimal norm unconstrained interpolation is presented.

Dynamical tunneling versus fast diffusion for a non-convex Hamiltonian

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pittman, S. M.; Tannenbaum, E.; Heller, E. J.

This paper attempts to resolve the issue of the nature of the 0.01-0.1 cm{sup −1} peak splittings observed in high-resolution IR spectra of polyatomic molecules. One hypothesis is that these splittings are caused by dynamical tunneling, a quantum-mechanical phenomenon whereby energy flows between two disconnected regions of phase-space across dynamical barriers. However, a competing classical mechanism for energy flow is Arnol’d diffusion, which connects different regions of phase-space by a resonance network known as the Arnol’d web. The speed of diffusion is bounded by the Nekhoroshev theorem, which guarantees stability on exponentially long time scales if the Hamiltonian is steep.more » Here we consider a non-convex Hamiltonian that contains the characteristics of a molecular Hamiltonian, but does not satisfy the Nekhoroshev theorem. The diffusion along the Arnol’d web is expected to be fast for a non-convex Hamiltonian. While fast diffusion is an unlikely competitor for longtime energy flow in molecules, we show how dynamical tunneling dominates compared to fast diffusion in the nearly integrable regime for a non-convex Hamiltonian, as well as present a new kind of dynamical tunneling.« less

Temperature actuated shutdown assembly for a nuclear reactor

DOEpatents

Sowa, Edmund S.

1976-01-01

Three identical bimetallic disks, each shaped as a spherical cap with its convex side composed of a layer of metal such as molybdenum and its concave side composed of a metal of a relatively higher coefficient of thermal expansion such as stainless steel, are retained within flanges attached to three sides of an inner hexagonal tube containing a neutron absorber to be inserted into a nuclear reactor core. Each disk holds a metal ball against its normally convex side so that the ball projects partially through a hole in the tube located concentrically with the center of each disk; at a predetermined temperature an imbalance of thermally induced stresses in at least one of the disks will cause its convex side to become concave and its concave side to become convex, thus pulling the ball from the hole in which it is located. The absorber has a conical bottom supported by the three balls and is small enough in relation to the internal dimensions of the tube to allow it to slip toward the removed ball or balls, thus clearing the unremoved balls or ball so that it will fall into the reactor core.

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

NASA Astrophysics Data System (ADS)

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.

Convex relaxations for gas expansion planning

DOE PAGES

Borraz-Sanchez, Conrado; Bent, Russell Whitford; Backhaus, Scott N.; ...

2016-01-01

Expansion of natural gas networks is a critical process involving substantial capital expenditures with complex decision-support requirements. Here, given the non-convex nature of gas transmission constraints, global optimality and infeasibility guarantees can only be offered by global optimisation approaches. Unfortunately, state-of-the-art global optimisation solvers are unable to scale up to real-world size instances. In this study, we present a convex mixed-integer second-order cone relaxation for the gas expansion planning problem under steady-state conditions. The underlying model offers tight lower bounds with high computational efficiency. In addition, the optimal solution of the relaxation can often be used to derive high-quality solutionsmore » to the original problem, leading to provably tight optimality gaps and, in some cases, global optimal solutions. The convex relaxation is based on a few key ideas, including the introduction of flux direction variables, exact McCormick relaxations, on/off constraints, and integer cuts. Numerical experiments are conducted on the traditional Belgian gas network, as well as other real larger networks. The results demonstrate both the accuracy and computational speed of the relaxation and its ability to produce high-quality solution« less

Low-rank structure learning via nonconvex heuristic recovery.

PubMed

Deng, Yue; Dai, Qionghai; Liu, Risheng; Zhang, Zengke; Hu, Sanqing

2013-03-01

In this paper, we propose a nonconvex framework to learn the essential low-rank structure from corrupted data. Different from traditional approaches, which directly utilizes convex norms to measure the sparseness, our method introduces more reasonable nonconvex measurements to enhance the sparsity in both the intrinsic low-rank structure and the sparse corruptions. We will, respectively, introduce how to combine the widely used ℓp norm (0 < p < 1) and log-sum term into the framework of low-rank structure learning. Although the proposed optimization is no longer convex, it still can be effectively solved by a majorization-minimization (MM)-type algorithm, with which the nonconvex objective function is iteratively replaced by its convex surrogate and the nonconvex problem finally falls into the general framework of reweighed approaches. We prove that the MM-type algorithm can converge to a stationary point after successive iterations. The proposed model is applied to solve two typical problems: robust principal component analysis and low-rank representation. Experimental results on low-rank structure learning demonstrate that our nonconvex heuristic methods, especially the log-sum heuristic recovery algorithm, generally perform much better than the convex-norm-based method (0 < p < 1) for both data with higher rank and with denser corruptions.

Application of the phase shifting diffraction interferometer for measuring convex mirrors and negative lenses

DOEpatents

Sommargren, Gary E.; Campbell, Eugene W.

2004-03-09

To measure a convex mirror, a reference beam and a measurement beam are both provided through a single optical fiber. A positive auxiliary lens is placed in the system to give a converging wavefront onto the convex mirror under test. A measurement is taken that includes the aberrations of the convex mirror as well as the errors due to two transmissions through the positive auxiliary lens. A second, measurement provides the information to eliminate this error. A negative lens can also be measured in a similar way. Again, there are two measurement set-ups. A reference beam is provided from a first optical fiber and a measurement beam is provided from a second optical fiber. A positive auxiliary lens is placed in the system to provide a converging wavefront from the reference beam onto the negative lens under test. The measurement beam is combined with the reference wavefront and is analyzed by standard methods. This measurement includes the aberrations of the negative lens, as well as the errors due to a single transmission through the positive auxiliary lens. A second measurement provides the information to eliminate this error.

Application Of The Phase Shifting Diffraction Interferometer For Measuring Convex Mirrors And Negative Lenses

DOEpatents

Sommargren, Gary E.; Campbell, Eugene W.

2005-06-21

To measure a convex mirror, a reference beam and a measurement beam are both provided through a single optical fiber. A positive auxiliary lens is placed in the system to give a converging wavefront onto the convex mirror under test. A measurement is taken that includes the aberrations of the convex mirror as well as the errors due to two transmissions through the positive auxiliary lens. A second measurement provides the information to eliminate this error. A negative lens can also be measured in a similar way. Again, there are two measurement set-ups. A reference beam is provided from a first optical fiber and a measurement beam is provided from a second optical fiber. A positive auxiliary lens is placed in the system to provide a converging wavefront from the reference beam onto the negative lens under test. The measurement beam is combined with the reference wavefront and is analyzed by standard methods. This measurement includes the aberrations of the negative lens, as well as the errors due to a single transmission through the positive auxiliary lens. A second measurement provides the information to eliminate this error.

Extremal edges: a powerful cue to depth perception and figure-ground organization.

PubMed

Palmer, Stephen E; Ghose, Tandra

2008-01-01

Extremal edges (EEs) are projections of viewpoint-specific horizons of self-occlusion on smooth convex surfaces. An ecological analysis of viewpoint constraints suggests that an EE surface is likely to be closer to the observer than the non-EE surface on the other side of the edge. In two experiments, one using shading gradients and the other using texture gradients, we demonstrated that EEs operate as strong cues to relative depth perception and figure-ground organization. Image regions with an EE along the shared border were overwhelmingly perceived as closer than either flat or equally convex surfaces without an EE along that border. A further demonstration suggests that EEs are more powerful than classical figure-ground cues, including even the joint effects of small size, convexity, and surroundedness.

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

PubMed

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.

String-averaging incremental subgradients for constrained convex optimization with applications to reconstruction of tomographic images

NASA Astrophysics Data System (ADS)

Massambone de Oliveira, Rafael; Salomão Helou, Elias; Fontoura Costa, Eduardo

2016-11-01

We present a method for non-smooth convex minimization which is based on subgradient directions and string-averaging techniques. In this approach, the set of available data is split into sequences (strings) and a given iterate is processed independently along each string, possibly in parallel, by an incremental subgradient method (ISM). The end-points of all strings are averaged to form the next iterate. The method is useful to solve sparse and large-scale non-smooth convex optimization problems, such as those arising in tomographic imaging. A convergence analysis is provided under realistic, standard conditions. Numerical tests are performed in a tomographic image reconstruction application, showing good performance for the convergence speed when measured as the decrease ratio of the objective function, in comparison to classical ISM.

A free boundary approach to the Rosensweig instability of ferrofluids

NASA Astrophysics Data System (ADS)

Parini, Enea; Stylianou, Athanasios

2018-04-01

We establish the existence of saddle points for a free boundary problem describing the two-dimensional free surface of a ferrofluid undergoing normal field instability. The starting point is the ferrohydrostatic equations for the magnetic potentials in the ferrofluid and air, and the function describing their interface. These constitute the strong form for the Euler-Lagrange equations of a convex-concave functional, which we extend to include interfaces that are not necessarily graphs of functions. Saddle points are then found by iterating the direct method of the calculus of variations and applying classical results of convex analysis. For the existence part, we assume a general nonlinear magnetization law; for a linear law, we also show, via convex duality, that the saddle point is a constrained minimizer of the relevant energy functional.

Dropwise condensation on hydrophobic bumps and dimples

NASA Astrophysics Data System (ADS)

Yao, Yuehan; Aizenberg, Joanna; Park, Kyoo-Chul

2018-04-01

Surface topography plays an important role in promoting or suppressing localized condensation. In this work, we study the growth of water droplets on hydrophobic convex surface textures such as bumps and concave surface textures such as dimples with a millimeter scale radius of curvature. We analyze the spatio-temporal droplet size distribution under a supersaturation condition created by keeping the uniform surface temperature below the dew point and show its relationship with the sign and magnitude of the surface curvature. In particular, in contrast to the well-known capillary condensation effect, we report an unexpectedly less favorable condensation on smaller, millimeter-scale dimples where the capillary condensation effect is negligible. To explain these experimental results, we numerically calculated the diffusion flux of water vapor around the surface textures, showing that its magnitude is higher on bumps and lower on dimples compared to a flat surface. We envision that our understanding of millimetric surface topography can be applied to improve the energy efficiency of condensation in applications such as water harvesting, heating, ventilation, and air conditioning systems for buildings and transportation, heat exchangers, thermal desalination plants, and fuel processing systems.

Aberration influence and active compensation on laser mode properties for asymmetric folded resonators

NASA Astrophysics Data System (ADS)

Zhang, Xiang; Hu, Zhiqiu; Yang, Wentao; Su, Likun

2017-09-01

We demonstrate the influence on mode features with introducing typical intracavity perturbation and results of aberrated wavefront compensation in a folded-type unstable resonator used in high energy lasers. The mode properties and aberration coefficient with intracavity misalignment are achieved by iterative calculation and Zernike polynomial fitting. Experimental results for the relation of intracavity maladjustment and mode characteristics are further obtained in terms of S-H detection and model wavefront reconstruction. It indicates that intracavity phase perturbation has significant influence on out coupling beam properties, and the uniform and symmetry of the mode is rapidly disrupted even by a slight misalignment of the resonator mirrors. Meanwhile, the far-field beam patterns will obviously degrade with increasing the distance between the convex mirror and the phase perturbation position even if the equivalent disturbation is inputted into such the resonator. The closed-loop device for compensating intracavity low order aberration is successfully fabricated. Moreover, Zernike defocus aberration is also effectively controlled by precisely adjusting resonator length, and the beam quality is noticeably improved.

On physical-constraints-preserving schemes for special relativistic magnetohydrodynamics with a general equation of state

NASA Astrophysics Data System (ADS)

Wu, Kailiang; Tang, Huazhong

2018-06-01

The paper studies the physical-constraints-preserving (PCP) schemes for multi-dimensional special relativistic magnetohydrodynamics with a general equation of state (EOS) on more general meshes. It is an extension of the work (Wu and Tang in Math. Models Methods Appl. Sci. 27:1871-1928, 2017) which focuses on the ideal EOS and uniform Cartesian meshes. The general EOS without a special expression poses some additional difficulties in discussing the mathematical properties of admissible state set with the physical constraints on the fluid velocity, density and pressure. Rigorous analyses are provided for the PCP property of finite volume or discontinuous Galerkin schemes with the Lax-Friedrichs (LxF)-type flux on a general mesh with non-self-intersecting polytopes. Those are built on a more general form of generalized LxF splitting property and a different convex decomposition technique. It is shown in theory that the PCP property is closely connected with a discrete divergence-free condition, which is proposed on the general mesh and milder than that in Wu and Tang (2017).

KINEMATIC TREATMENT OF CORONAL MASS EJECTION EVOLUTION IN THE SOLAR WIND

NASA Technical Reports Server (NTRS)

Riley, Pete; Crooker, N. U.

2004-01-01

We present a kinematic study of the evolution of coronal mass ejections (CMEs) in the solar wind. Specifically, we consider the effects of (1) spherical expansion and (2) uniform expansion due to pressure gradients between the interplanetary CME (ICME) and the ambient solar wind. We compare these results with an MHD model that allows us to isolate these effects h m the combined kinematic and dynamical effects, which are included in MHD models. They also provide compelling evidence that the fundamental cross section of so-called "force-free" flux ropes (or magnetic clouds) is neither circular or elliptical, but rather a convex-outward, "pancake" shape. We apply a force-free fit to the magnetic vectors from the MHD simulation to assess how the distortion of the flux rope affects the fit. In spite of these limitations, force-free fits, which are straightforward to apply, do provide an important description of a number of parameters, including the radial dimension, orientation, and chirality of the ICME. Subject headings: MHD - solar wind - Sun: activity - Sun: corona - Sun: coronal mass ejections (CMEs) - On-line material color figures Sun: magnetic fields

Physical Model of the Dynamic Instability in an Expanding Cell Culture

PubMed Central

Mark, Shirley; Shlomovitz, Roie; Gov, Nir S.; Poujade, Mathieu; Grasland-Mongrain, Erwan; Silberzan, Pascal

2010-01-01

Abstract Collective cell migration is of great significance in many biological processes. The goal of this work is to give a physical model for the dynamics of cell migration during the wound healing response. Experiments demonstrate that an initially uniform cell-culture monolayer expands in a nonuniform manner, developing fingerlike shapes. These fingerlike shapes of the cell culture front are composed of columns of cells that move collectively. We propose a physical model to explain this phenomenon, based on the notion of dynamic instability. In this model, we treat the first layers of cells at the front of the moving cell culture as a continuous one-dimensional membrane (contour), with the usual elasticity of a membrane: curvature and surface-tension. This membrane is active, due to the forces of cellular motility of the cells, and we propose that this motility is related to the local curvature of the culture interface; larger convex curvature correlates with a stronger cellular motility force. This shape-force relation gives rise to a dynamic instability, which we then compare to the patterns observed in the wound healing experiments. PMID:20141748

Photovoltaic modules with cylindrical waveguides in a system for the secondary concentration of solar radiation

NASA Astrophysics Data System (ADS)

Andreev, V. M.; Davidyuk, N. Yu.; Ionova, E. A.; Rumyantsev, V. D.

2013-09-01

The parameters of the concentrating photoelectric modules with triple-junction (InGaP/GaAs/Ge) solar cells whose focusing system contains an original secondary optical element are studied. The element consists of a plane-convex lens in optical contact with the front surface of an intermediate glass plate and a cylindrical waveguide that is located on the rear side of the glass plate above the surface of the solar element. It is demonstrated that the structure of the secondary optical element provides a wide misorientation characteristic of the concentrator and the cylindrical waveguide allows a more uniform radiation density over the surface of the solar cell. The effect of chromatic aberration in the primary and secondary optical systems on the parameters of photoelectric modules is analyzed. It is demonstrated that the presence of waveguides with a length of 3-5 mm leads to effective redistribution of radiation over the surface of the solar cell whereas shorter and longer waveguides provide the local concentration of radiation at the center of the photodetecting area.

The watercolor effect: a new principle of grouping and figure-ground organization.

PubMed

Pinna, Baingio; Werner, John S; Spillmann, Lothar

2003-01-01

The watercolor effect is perceived when a dark (e.g., purple) contour is flanked by a lighter chromatic contour (e.g., orange). Under these conditions, the lighter color will assimilate over the entire enclosed area. This filling-in determines figure-ground organization when it is pitted against the classical Gestalt factors of proximity, good continuation, closure, symmetry, convexity, as well as amodal completion, and past experience. When it is combined with a given Gestalt factor, the resulting effect on figure-ground organization is stronger than for each factor alone. When the watercolor effect is induced by a dark red edge instead of an orange edge, its figural strength is reduced, but still stronger than without it. Finally, when a uniform surface is filled physically using the color of the orange fringe, figure-ground organization is not different from that for the purple contour only. These findings show that the watercolor effect induced by the edge could be an independent factor, different from the classical Gestalt factors of figure-ground organization. Copyright 2002 Elsevier Science Ltd.

Approximate Dynamic Programming: Combining Regional and Local State Following Approximations.

PubMed

Deptula, Patryk; Rosenfeld, Joel A; Kamalapurkar, Rushikesh; Dixon, Warren E

2018-06-01

An infinite-horizon optimal regulation problem for a control-affine deterministic system is solved online using a local state following (StaF) kernel and a regional model-based reinforcement learning (R-MBRL) method to approximate the value function. Unlike traditional methods such as R-MBRL that aim to approximate the value function over a large compact set, the StaF kernel approach aims to approximate the value function in a local neighborhood of the state that travels within a compact set. In this paper, the value function is approximated using a state-dependent convex combination of the StaF-based and the R-MBRL-based approximations. As the state enters a neighborhood containing the origin, the value function transitions from being approximated by the StaF approach to the R-MBRL approach. Semiglobal uniformly ultimately bounded (SGUUB) convergence of the system states to the origin is established using a Lyapunov-based analysis. Simulation results are provided for two, three, six, and ten-state dynamical systems to demonstrate the scalability and performance of the developed method.

Automated 3D closed surface segmentation: application to vertebral body segmentation in CT images.

PubMed

Liu, Shuang; Xie, Yiting; Reeves, Anthony P

2016-05-01

A fully automated segmentation algorithm, progressive surface resolution (PSR), is presented in this paper to determine the closed surface of approximately convex blob-like structures that are common in biomedical imaging. The PSR algorithm was applied to the cortical surface segmentation of 460 vertebral bodies on 46 low-dose chest CT images, which can be potentially used for automated bone mineral density measurement and compression fracture detection. The target surface is realized by a closed triangular mesh, which thereby guarantees the enclosure. The surface vertices of the triangular mesh representation are constrained along radial trajectories that are uniformly distributed in 3D angle space. The segmentation is accomplished by determining for each radial trajectory the location of its intersection with the target surface. The surface is first initialized based on an input high confidence boundary image and then resolved progressively based on a dynamic attraction map in an order of decreasing degree of evidence regarding the target surface location. For the visual evaluation, the algorithm achieved acceptable segmentation for 99.35 % vertebral bodies. Quantitative evaluation was performed on 46 vertebral bodies and achieved overall mean Dice coefficient of 0.939 (with max [Formula: see text] 0.957, min [Formula: see text] 0.906 and standard deviation [Formula: see text] 0.011) using manual annotations as the ground truth. Both visual and quantitative evaluations demonstrate encouraging performance of the PSR algorithm. This novel surface resolution strategy provides uniform angular resolution for the segmented surface with computation complexity and runtime that are linearly constrained by the total number of vertices of the triangular mesh representation.

Method and system using power modulation and velocity modulation producing sputtered thin films with sub-angstrom thickness uniformity or custom thickness gradients

DOEpatents

Montcalm, Claude [Livermore, CA; Folta, James Allen [Livermore, CA; Walton, Christopher Charles [Berkeley, CA

2003-12-23

A method and system for determining a source flux modulation recipe for achieving a selected thickness profile of a film to be deposited (e.g., with highly uniform or highly accurate custom graded thickness) over a flat or curved substrate (such as concave or convex optics) by exposing the substrate to a vapor deposition source operated with time-varying flux distribution as a function of time. Preferably, the source is operated with time-varying power applied thereto during each sweep of the substrate to achieve the time-varying flux distribution as a function of time. Preferably, the method includes the steps of measuring the source flux distribution (using a test piece held stationary while exposed to the source with the source operated at each of a number of different applied power levels), calculating a set of predicted film thickness profiles, each film thickness profile assuming the measured flux distribution and a different one of a set of source flux modulation recipes, and determining from the predicted film thickness profiles a source flux modulation recipe which is adequate to achieve a predetermined thickness profile. Aspects of the invention include a computer-implemented method employing a graphical user interface to facilitate convenient selection of an optimal or nearly optimal source flux modulation recipe to achieve a desired thickness profile on a substrate. The method enables precise modulation of the deposition flux to which a substrate is exposed to provide a desired coating thickness distribution.

Iterating the Number of Intersection Points of the Diagonals of Irregular Convex Polygons, or C (n, 4) the Hard Way!

ERIC Educational Resources Information Center

Hathout, Leith

2007-01-01

Counting the number of internal intersection points made by the diagonals of irregular convex polygons where no three diagonals are concurrent is an interesting problem in discrete mathematics. This paper uses an iterative approach to develop a summation relation which tallies the total number of intersections, and shows that this total can be…

Scalable Rapidly Deployable Convex Optimization for Data Analytics

DTIC Science & Technology

SOCPs , SDPs, exponential cone programs, and power cone programs. CVXPY supports basic methods for distributed optimization, on...multiple heterogenous platforms. We have also done basic research in various application areas , using CVXPY , to demonstrate its usefulness. See attached report for publication information....Over the period of the contract we have developed the full stack for wide use of convex optimization, in machine learning and many other areas .

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

NASA Astrophysics Data System (ADS)

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.

The 1980 Archeological Investigations at the Big Hill Lake, Kansas.

DTIC Science & Technology

1980-01-01

implements as plano -convex scrapers. The modified flake categories are comprised of those specimens which exhibit edge alterations resulting from...stone projectile points, chipped stone blades, polished celts and gorgets, cut deer mandibles, an incised canine tooth and grinding and milling...are characteristic at this Middle Ceramic group of sites, along with plano -convex end scrapers and medium to small-sized projectile points. 31 Many

Effects of orientation and downward-facing convex curvature on pool-boiling critical heat flux

NASA Astrophysics Data System (ADS)

Howard, Alicia Ann Harris

Photographic studies of near-saturated pool boiling on both inclined flat surfaces and a downward-facing convex surface were conducted in order to determine the physical mechanisms that trigger critical heat flux (CHF). Based on the vapor behavior observed just prior to CHF, it is shown for the flat surfaces that the surface orientations can be divided into three regions: upward-facing (0-60°), near-vertical (60-165°), and downward-facing (165-180°) each region is associated with a unique CHIP trigger mechanism. In the upward-facing region, the buoyancy forces remove the vapor vertically off the heater surface. The near- vertical region is characterized by a wavy liquid-vapor interface which sweeps along the heater surface. In the downward-facing region, the vapor repeatedly stratifies on the heater surface, greatly decreasing CHF. The vapor behavior along the convex surface is cyclic in nature and similar to the nucleation/coalescence/stratification/release procedure observed for flat surfaces in the downward-facing region. The vapor stratification occurred at the bottom (downward-facing) heaters on the convex surface. CHF is always triggered on these downward-facing heaters and then propagates up the convex surface, and the orientations of these heaters are comparable with the orientation range of the flat surface downward-facing region. The vast differences between the observed vapor behavior within the three regions and on the convex surface indicate that a single overall pool boiling CHF model cannot possibly account for all the observed effects. Upward-facing surfaces have been examined and modeled extensively by many investigators and a few investigators have addressed downward-facing surfaces, so this investigation focuses on modeling the near-vertical region. The near-vertical CHF model incorporates classical two-dimensional interfacial instability theory, a separated flow model, an energy balance, and a criterion for separation of the wavy interface from the surface at CHF. The model was tested for different fluids and shows good agreement with CHF data. Additionally, the instability theory incorporated into this model accurately predicts the angle of transition between the near-vertical and downward-facing regions.

On the convexity of ROC curves estimated from radiological test results.

PubMed

Pesce, Lorenzo L; Metz, Charles E; Berbaum, Kevin S

2010-08-01

Although an ideal observer's receiver operating characteristic (ROC) curve must be convex-ie, its slope must decrease monotonically-published fits to empirical data often display "hooks." Such fits sometimes are accepted on the basis of an argument that experiments are done with real, rather than ideal, observers. However, the fact that ideal observers must produce convex curves does not imply that convex curves describe only ideal observers. This article aims to identify the practical implications of nonconvex ROC curves and the conditions that can lead to empirical or fitted ROC curves that are not convex. This article views nonconvex ROC curves from historical, theoretical, and statistical perspectives, which we describe briefly. We then consider population ROC curves with various shapes and analyze the types of medical decisions that they imply. Finally, we describe how sampling variability and curve-fitting algorithms can produce ROC curve estimates that include hooks. We show that hooks in population ROC curves imply the use of an irrational decision strategy, even when the curve does not cross the chance line, and therefore usually are untenable in medical settings. Moreover, we sketch a simple approach to improve any nonconvex ROC curve by adding statistical variation to the decision process. Finally, we sketch how to test whether hooks present in ROC data are likely to have been caused by chance alone and how some hooked ROCs found in the literature can be easily explained as fitting artifacts or modeling issues. In general, ROC curve fits that show hooks should be looked on with suspicion unless other arguments justify their presence. 2010 AUR. Published by Elsevier Inc. All rights reserved.

Image analysis of open-door laminoplasty for cervical spondylotic myelopathy: comparing the influence of cord morphology and spine alignment.

PubMed

Lin, Bon-Jour; Lin, Meng-Chi; Lin, Chin; Lee, Meei-Shyuan; Feng, Shao-Wei; Ju, Da-Tong; Ma, Hsin-I; Liu, Ming-Ying; Hueng, Dueng-Yuan

2015-10-01

Previous studies have identified the factors affecting the surgical outcome of cervical spondylotic myelopathy (CSM) following laminoplasty. Nonetheless, the effect of these factors remains controversial. It is unknown about the association between pre-operative cervical spinal cord morphology and post-operative imaging result following laminoplasty. The goal of this study is to analyze the impact of pre-operative cervical spinal cord morphology on post-operative imaging in patients with CSM. Twenty-six patients with CSM undergoing open-door laminoplasty were classified according to pre-operative cervical spine bony alignment and cervical spinal cord morphology, and the results were evaluated in terms of post-operative spinal cord posterior drift, and post-operative expansion of the antero-posterior dura diameter. By the result of study, pre-operative spinal cord morphology was an effective classification in predicting surgical outcome - patients with anterior convexity type, description of cervical spinal cord morphology, had more spinal cord posterior migration than those with neutral or posterior convexity type after open-door laminoplasty. Otherwise, the interesting finding was that cervical spine Cobb's angle had an impact on post-operative spinal cord posterior drift in patients with neutral or posterior convexity type spinal cord morphology - the degree of kyphosis was inversely proportional to the distance of post-operative spinal cord posterior drift, but not in the anterior convexity type. These findings supported that pre-operative cervical spinal cord morphology may be used as screening for patients undergoing laminoplasty. Patients having neutral or posterior convexity type spinal cord morphology accompanied with kyphotic deformity were not suitable candidates for laminoplasty. Copyright © 2015 Elsevier B.V. All rights reserved.

Maximally dense packings of two-dimensional convex and concave noncircular particles.

PubMed

Atkinson, Steven; Jiao, Yang; Torquato, Salvatore

2012-09-01

Dense packings of hard particles have important applications in many fields, including condensed matter physics, discrete geometry, and cell biology. In this paper, we employ a stochastic search implementation of the Torquato-Jiao adaptive-shrinking-cell (ASC) optimization scheme [Nature (London) 460, 876 (2009)] to find maximally dense particle packings in d-dimensional Euclidean space R(d). While the original implementation was designed to study spheres and convex polyhedra in d≥3, our implementation focuses on d=2 and extends the algorithm to include both concave polygons and certain complex convex or concave nonpolygonal particle shapes. We verify the robustness of this packing protocol by successfully reproducing the known putative optimal packings of congruent copies of regular pentagons and octagons, then employ it to suggest dense packing arrangements of congruent copies of certain families of concave crosses, convex and concave curved triangles (incorporating shapes resembling the Mercedes-Benz logo), and "moonlike" shapes. Analytical constructions are determined subsequently to obtain the densest known packings of these particle shapes. For the examples considered, we find that the densest packings of both convex and concave particles with central symmetry are achieved by their corresponding optimal Bravais lattice packings; for particles lacking central symmetry, the densest packings obtained are nonlattice periodic packings, which are consistent with recently-proposed general organizing principles for hard particles. Moreover, we find that the densest known packings of certain curved triangles are periodic with a four-particle basis, and we find that the densest known periodic packings of certain moonlike shapes possess no inherent symmetries. Our work adds to the growing evidence that particle shape can be used as a tuning parameter to achieve a diversity of packing structures.

Maximally dense packings of two-dimensional convex and concave noncircular particles

NASA Astrophysics Data System (ADS)

Atkinson, Steven; Jiao, Yang; Torquato, Salvatore

2012-09-01

Dense packings of hard particles have important applications in many fields, including condensed matter physics, discrete geometry, and cell biology. In this paper, we employ a stochastic search implementation of the Torquato-Jiao adaptive-shrinking-cell (ASC) optimization scheme [Nature (London)NATUAS0028-083610.1038/nature08239 460, 876 (2009)] to find maximally dense particle packings in d-dimensional Euclidean space Rd. While the original implementation was designed to study spheres and convex polyhedra in d≥3, our implementation focuses on d=2 and extends the algorithm to include both concave polygons and certain complex convex or concave nonpolygonal particle shapes. We verify the robustness of this packing protocol by successfully reproducing the known putative optimal packings of congruent copies of regular pentagons and octagons, then employ it to suggest dense packing arrangements of congruent copies of certain families of concave crosses, convex and concave curved triangles (incorporating shapes resembling the Mercedes-Benz logo), and “moonlike” shapes. Analytical constructions are determined subsequently to obtain the densest known packings of these particle shapes. For the examples considered, we find that the densest packings of both convex and concave particles with central symmetry are achieved by their corresponding optimal Bravais lattice packings; for particles lacking central symmetry, the densest packings obtained are nonlattice periodic packings, which are consistent with recently-proposed general organizing principles for hard particles. Moreover, we find that the densest known packings of certain curved triangles are periodic with a four-particle basis, and we find that the densest known periodic packings of certain moonlike shapes possess no inherent symmetries. Our work adds to the growing evidence that particle shape can be used as a tuning parameter to achieve a diversity of packing structures.

Convex geometry of quantum resource quantification

NASA Astrophysics Data System (ADS)

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 \

Riemannian and Lorentzian flow-cut theorems

NASA Astrophysics Data System (ADS)

Headrick, Matthew; Hubeny, Veronika E.

2018-05-01

We prove several geometric theorems using tools from the theory of convex optimization. In the Riemannian setting, we prove the max flow-min cut (MFMC) theorem for boundary regions, applied recently to develop a ‘bit-thread’ interpretation of holographic entanglement entropies. We also prove various properties of the max flow and min cut, including respective nesting properties. In the Lorentzian setting, we prove the analogous MFMC theorem, which states that the volume of a maximal slice equals the flux of a minimal flow, where a flow is defined as a divergenceless timelike vector field with norm at least 1. This theorem includes as a special case a continuum version of Dilworth’s theorem from the theory of partially ordered sets. We include a brief review of the necessary tools from the theory of convex optimization, in particular Lagrangian duality and convex relaxation.

Non-convex Statistical Optimization for Sparse Tensor Graphical Model

PubMed Central

Sun, Wei; Wang, Zhaoran; Liu, Han; Cheng, Guang

2016-01-01

We consider the estimation of sparse graphical models that characterize the dependency structure of high-dimensional tensor-valued data. To facilitate the estimation of the precision matrix corresponding to each way of the tensor, we assume the data follow a tensor normal distribution whose covariance has a Kronecker product structure. The penalized maximum likelihood estimation of this model involves minimizing a non-convex objective function. In spite of the non-convexity of this estimation problem, we prove that an alternating minimization algorithm, which iteratively estimates each sparse precision matrix while fixing the others, attains an estimator with the optimal statistical rate of convergence as well as consistent graph recovery. Notably, such an estimator achieves estimation consistency with only one tensor sample, which is unobserved in previous work. Our theoretical results are backed by thorough numerical studies. PMID:28316459

Distance majorization and its applications.

PubMed

Chi, Eric C; Zhou, Hua; Lange, Kenneth

2014-08-01

The problem of minimizing a continuously differentiable convex function over an intersection of closed convex sets is ubiquitous in applied mathematics. It is particularly interesting when it is easy to project onto each separate set, but nontrivial to project onto their intersection. Algorithms based on Newton's method such as the interior point method are viable for small to medium-scale problems. However, modern applications in statistics, engineering, and machine learning are posing problems with potentially tens of thousands of parameters or more. We revisit this convex programming problem and propose an algorithm that scales well with dimensionality. Our proposal is an instance of a sequential unconstrained minimization technique and revolves around three ideas: the majorization-minimization principle, the classical penalty method for constrained optimization, and quasi-Newton acceleration of fixed-point algorithms. The performance of our distance majorization algorithms is illustrated in several applications.

Optimal Micropatterns in 2D Transport Networks and Their Relation to Image Inpainting

NASA Astrophysics Data System (ADS)

Brancolini, Alessio; Rossmanith, Carolin; Wirth, Benedikt

2018-04-01

We consider two different variational models of transport networks: the so-called branched transport problem and the urban planning problem. Based on a novel relation to Mumford-Shah image inpainting and techniques developed in that field, we show for a two-dimensional situation that both highly non-convex network optimization tasks can be transformed into a convex variational problem, which may be very useful from analytical and numerical perspectives. As applications of the convex formulation, we use it to perform numerical simulations (to our knowledge this is the first numerical treatment of urban planning), and we prove a lower bound for the network cost that matches a known upper bound (in terms of how the cost scales in the model parameters) which helps better understand optimal networks and their minimal costs.

A Walking Method for Non-Decomposition Intersection and Union of Arbitrary Polygons and Polyhedrons

DOE Office of Scientific and Technical Information (OSTI.GOV)

Graham, M.; Yao, J.

We present a method for computing the intersection and union of non- convex polyhedrons without decomposition in O(n log n) time, where n is the total number of faces of both polyhedrons. We include an accompanying Python package which addresses many of the practical issues associated with implementation and serves as a proof of concept. The key to the method is that by considering the edges of the original ob- jects and the intersections between faces as walking routes, we can e ciently nd the boundary of the intersection of arbitrary objects using directional walks, thus handling the concave casemore » in a natural manner. The method also easily extends to plane slicing and non-convex polyhedron unions, and both the polyhedron and its constituent faces may be non-convex.« less

A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming.

PubMed

Liu, Jing; Duan, Yongrui; Sun, Min

2017-01-01

This paper introduces a symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming with linear equality constraints, which inherits the superiorities of the classical alternating direction method of multipliers (ADMM), and which extends the feasible set of the relaxation factor α of the generalized ADMM to the infinite interval [Formula: see text]. Under the conditions that the objective function is convex and the solution set is nonempty, we establish the convergence results of the proposed method, including the global convergence, the worst-case [Formula: see text] convergence rate in both the ergodic and the non-ergodic senses, where k denotes the iteration counter. Numerical experiments to decode a sparse signal arising in compressed sensing are included to illustrate the efficiency of the new method.

Maximal regularity in lp spaces for discrete time fractional shifted equations

NASA Astrophysics Data System (ADS)

Lizama, Carlos; Murillo-Arcila, Marina

2017-09-01

In this paper, we are presenting a new method based on operator-valued Fourier multipliers to characterize the existence and uniqueness of ℓp-solutions for discrete time fractional models in the form where A is a closed linear operator defined on a Banach space X and Δα denotes the Grünwald-Letnikov fractional derivative of order α > 0. If X is a UMD space, we provide this characterization only in terms of the R-boundedness of the operator-valued symbol associated to the abstract model. To illustrate our results, we derive new qualitative properties of nonlinear difference equations with shiftings, including fractional versions of the logistic and Nagumo equations.

Rigorous Numerics for ill-posed PDEs: Periodic Orbits in the Boussinesq Equation

NASA Astrophysics Data System (ADS)

Castelli, Roberto; Gameiro, Marcio; Lessard, Jean-Philippe

2018-04-01

In this paper, we develop computer-assisted techniques for the analysis of periodic orbits of ill-posed partial differential equations. As a case study, our proposed method is applied to the Boussinesq equation, which has been investigated extensively because of its role in the theory of shallow water waves. The idea is to use the symmetry of the solutions and a Newton-Kantorovich type argument (the radii polynomial approach) to obtain rigorous proofs of existence of the periodic orbits in a weighted ℓ1 Banach space of space-time Fourier coefficients with exponential decay. We present several computer-assisted proofs of the existence of periodic orbits at different parameter values.

Optimal control problems with mixed control-phase variable equality and inequality constraints

NASA Technical Reports Server (NTRS)

Makowski, K.; Neustad, L. W.

1974-01-01

In this paper, necessary conditions are obtained for optimal control problems containing equality constraints defined in terms of functions of the control and phase variables. The control system is assumed to be characterized by an ordinary differential equation, and more conventional constraints, including phase inequality constraints, are also assumed to be present. Because the first-mentioned equality constraint must be satisfied for all t (the independent variable of the differential equation) belonging to an arbitrary (prescribed) measurable set, this problem gives rise to infinite-dimensional equality constraints. To obtain the necessary conditions, which are in the form of a maximum principle, an implicit-function-type theorem in Banach spaces is derived.

Algorithm for Overcoming the Curse of Dimensionality for Certain Non-convex Hamilton-Jacobi Equations, Projections and Differential Games

DTIC Science & Technology

2016-05-01

Algorithm for Overcoming the Curse of Dimensionality for Certain Non-convex Hamilton-Jacobi Equations, Projections and Differential Games Yat Tin...subproblems. Our approach is expected to have wide applications in continuous dynamic games , control theory problems, and elsewhere. Mathematics...differential dynamic games , control theory problems, and dynamical systems coming from the physical world, e.g. [11]. An important application is to

Reflective optical imaging system

DOEpatents

Shafer, David R.

2000-01-01

An optical system compatible with short wavelength (extreme ultraviolet) radiation comprising four reflective elements for projecting a mask image onto a substrate. The four optical elements are characterized in order from object to image as convex, concave, convex and concave mirrors. The optical system is particularly suited for step and scan lithography methods. The invention increases the slit dimensions associated with ringfield scanning optics, improves wafer throughput and allows higher semiconductor device density.

Reflective optical imaging method and circuit

DOEpatents

Shafer, David R.

2001-01-01

An optical system compatible with short wavelength (extreme ultraviolet) radiation comprising four reflective elements for projecting a mask image onto a substrate. The four optical elements are characterized in order from object to image as convex, concave, convex and concave mirrors. The optical system is particularly suited for step and scan lithography methods. The invention increases the slit dimensions associated with ringfield scanning optics, improves wafer throughput and allows higher semiconductor device density.

Determination of refractive index of a simple negative, positive, or zero power lens using wedged plated interferometer

NASA Technical Reports Server (NTRS)

Shukla, R. P.; Perera, G. M.; George, M. C.; Venkateswarlu, P.

1990-01-01

A nondestructive technique for measuring the refractive index of a negative lens using a wedged plate interferometer is described. The method can be also used for measuring the refractive index of convex or zero power lenses. Schematic diagrams are presented for the use of a wedged plate interferometer for measuring the refractive index of a concave lens and of a convex lens.

Core-softened potentials, multiple liquid-liquid critical points, and density anomaly regions: An exact solution

NASA Astrophysics Data System (ADS)

Rizzatti, Eduardo O.; Barbosa, Marco Aurélio A.; Barbosa, Marcia C.

2018-02-01

The pressure versus temperature phase diagram of a system of particles interacting through a multiscale shoulder-like potential is exactly computed in one dimension. The N-shoulder potential exhibits N density anomaly regions in the phase diagram if the length scales can be connected by a convex curve. The result is analyzed in terms of the convexity of the Gibbs free energy.

Performance Analysis of the Unitree Central File

NASA Technical Reports Server (NTRS)

Pentakalos, Odysseas I.; Flater, David

1994-01-01

This report consists of two parts. The first part briefly comments on the documentation status of two major systems at NASA#s Center for Computational Sciences, specifically the Cray C98 and the Convex C3830. The second part describes the work done on improving the performance of file transfers between the Unitree Mass Storage System running on the Convex file server and the users workstations distributed over a large georgraphic area.

Survey and Assessment of the Cultural Resources, Toronto Lake Project.

DTIC Science & Technology

1981-01-01

impressions, cross hatching, rocker stamping, cord- wrapped stick impressions, and roulette impressions generally con- fined within incised zoning...Its surface collection included one fragment of a plano -convex end scraper, one biface midsection probably from a large point (Fig. 3b), one possible...recovered during the entire survey. Eight point or knife tips were found and seven midsections. Scrapers included five plano - convex end scrapers, three

Morphological decomposition of 2-D binary shapes into convex polygons: a heuristic algorithm.

PubMed

Xu, J

2001-01-01

In many morphological shape decomposition algorithms, either a shape can only be decomposed into shape components of extremely simple forms or a time consuming search process is employed to determine a decomposition. In this paper, we present a morphological shape decomposition algorithm that decomposes a two-dimensional (2-D) binary shape into a collection of convex polygonal components. A single convex polygonal approximation for a given image is first identified. This first component is determined incrementally by selecting a sequence of basic shape primitives. These shape primitives are chosen based on shape information extracted from the given shape at different scale levels. Additional shape components are identified recursively from the difference image between the given image and the first component. Simple operations are used to repair certain concavities caused by the set difference operation. The resulting hierarchical structure provides descriptions for the given shape at different detail levels. The experiments show that the decomposition results produced by the algorithm seem to be in good agreement with the natural structures of the given shapes. The computational cost of the algorithm is significantly lower than that of an earlier search-based convex decomposition algorithm. Compared to nonconvex decomposition algorithms, our algorithm allows accurate approximations for the given shapes at low coding costs.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Valentino, Eleonora Di; Mersini-Houghton, Laura, E-mail: valentin@iap.fr, E-mail: mersini@physics.unc.edu

The 2015 Planck data release tightened the region of the allowed inflationary models. Inflationary models with convex potentials have now been ruled out since they produce a large tensor to scalar ratio. Meanwhile the same data offers interesting hints on possible deviations from the standard picture of CMB perturbations. Here we revisit the predictions of the theory of the origin of the universe from the landscape multiverse for the case of exponential inflation, for two reasons: firstly to check the status of the anomalies associated with this theory, in the light of the recent Planck data; secondly, to search formore » a counterexample whereby new physics modifications may bring convex inflationary potentials, thought to have been ruled out, back into the region of potentials allowed by data. Using the exponential inflation as an example of convex potentials, we find that the answer to both tests is positive: modifications to the perturbation spectrum and to the Newtonian potential of the universe originating from the quantum entanglement, bring the exponential potential, back within the allowed region of current data; and, the series of anomalies previously predicted in this theory, is still in good agreement with current data. Hence our finding for this convex potential comes at the price of allowing for additional thermal relic particles, equivalently dark radiation, in the early universe.« less

Towards reproducible experimental studies for non-convex polyhedral shaped particles

NASA Astrophysics Data System (ADS)

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.

Testing predictions of the quantum landscape multiverse 2: the exponential inflationary potential

NASA Astrophysics Data System (ADS)

Di Valentino, Eleonora; Mersini-Houghton, Laura

2017-03-01

The 2015 Planck data release tightened the region of the allowed inflationary models. Inflationary models with convex potentials have now been ruled out since they produce a large tensor to scalar ratio. Meanwhile the same data offers interesting hints on possible deviations from the standard picture of CMB perturbations. Here we revisit the predictions of the theory of the origin of the universe from the landscape multiverse for the case of exponential inflation, for two reasons: firstly to check the status of the anomalies associated with this theory, in the light of the recent Planck data; secondly, to search for a counterexample whereby new physics modifications may bring convex inflationary potentials, thought to have been ruled out, back into the region of potentials allowed by data. Using the exponential inflation as an example of convex potentials, we find that the answer to both tests is positive: modifications to the perturbation spectrum and to the Newtonian potential of the universe originating from the quantum entanglement, bring the exponential potential, back within the allowed region of current data; and, the series of anomalies previously predicted in this theory, is still in good agreement with current data. Hence our finding for this convex potential comes at the price of allowing for additional thermal relic particles, equivalently dark radiation, in the early universe.

Direct single-layered fabrication of 3D concavo convex patterns in nano-stereolithography

NASA Astrophysics Data System (ADS)

Lim, T. W.; Park, S. H.; Yang, D. Y.; Kong, H. J.; Lee, K. S.

2006-09-01

A nano-surfacing process (NSP) is proposed to directly fabricate three-dimensional (3D) concavo convex-shaped microstructures such as micro-lens arrays using two-photon polymerization (TPP), a promising technique for fabricating arbitrary 3D highly functional micro-devices. In TPP, commonly utilized methods for fabricating complex 3D microstructures to date are based on a layer-by-layer accumulating technique employing two-dimensional sliced data derived from 3D computer-aided design data. As such, this approach requires much time and effort for precise fabrication. In this work, a novel single-layer exposure method is proposed in order to improve the fabricating efficiency for 3D concavo convex-shaped microstructures. In the NSP, 3D microstructures are divided into 13 sub-regions horizontally with consideration of the heights. Those sub-regions are then expressed as 13 characteristic colors, after which a multi-voxel matrix (MVM) is composed with the characteristic colors. Voxels with various heights and diameters are generated to construct 3D structures using a MVM scanning method. Some 3D concavo convex-shaped microstructures were fabricated to estimate the usefulness of the NSP, and the results show that it readily enables the fabrication of single-layered 3D microstructures.

A Depth-Adjustment Deployment Algorithm Based on Two-Dimensional Convex Hull and Spanning Tree for Underwater Wireless Sensor Networks.

PubMed

Jiang, Peng; Liu, Shuai; Liu, Jun; Wu, Feng; Zhang, Le

2016-07-14

Most of the existing node depth-adjustment deployment algorithms for underwater wireless sensor networks (UWSNs) just consider how to optimize network coverage and connectivity rate. However, these literatures don't discuss full network connectivity, while optimization of network energy efficiency and network reliability are vital topics for UWSN deployment. Therefore, in this study, a depth-adjustment deployment algorithm based on two-dimensional (2D) convex hull and spanning tree (NDACS) for UWSNs is proposed. First, the proposed algorithm uses the geometric characteristics of a 2D convex hull and empty circle to find the optimal location of a sleep node and activate it, minimizes the network coverage overlaps of the 2D plane, and then increases the coverage rate until the first layer coverage threshold is reached. Second, the sink node acts as a root node of all active nodes on the 2D convex hull and then forms a small spanning tree gradually. Finally, the depth-adjustment strategy based on time marker is used to achieve the three-dimensional overall network deployment. Compared with existing depth-adjustment deployment algorithms, the simulation results show that the NDACS algorithm can maintain full network connectivity with high network coverage rate, as well as improved network average node degree, thus increasing network reliability.

A Depth-Adjustment Deployment Algorithm Based on Two-Dimensional Convex Hull and Spanning Tree for Underwater Wireless Sensor Networks

PubMed Central

Jiang, Peng; Liu, Shuai; Liu, Jun; Wu, Feng; Zhang, Le

2016-01-01

Most of the existing node depth-adjustment deployment algorithms for underwater wireless sensor networks (UWSNs) just consider how to optimize network coverage and connectivity rate. However, these literatures don’t discuss full network connectivity, while optimization of network energy efficiency and network reliability are vital topics for UWSN deployment. Therefore, in this study, a depth-adjustment deployment algorithm based on two-dimensional (2D) convex hull and spanning tree (NDACS) for UWSNs is proposed. First, the proposed algorithm uses the geometric characteristics of a 2D convex hull and empty circle to find the optimal location of a sleep node and activate it, minimizes the network coverage overlaps of the 2D plane, and then increases the coverage rate until the first layer coverage threshold is reached. Second, the sink node acts as a root node of all active nodes on the 2D convex hull and then forms a small spanning tree gradually. Finally, the depth-adjustment strategy based on time marker is used to achieve the three-dimensional overall network deployment. Compared with existing depth-adjustment deployment algorithms, the simulation results show that the NDACS algorithm can maintain full network connectivity with high network coverage rate, as well as improved network average node degree, thus increasing network reliability. PMID:27428970

Convex Hull Aided Registration Method (CHARM).

PubMed

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.

Transverse plane of apical vertebra of structural thoracic curve: vertebra displacement versus vertebral deformation.

PubMed

Kotwicki, Tomasz; Napiontek, Marek; Nowakowski, Andrzej

2006-01-01

CT transversal scans of the trunk provided at the level of Th8 or Th9 (apical vertebra) of 23 patients with structural thoracic scoliosis were reviewed. The following parameters were studied: 1) alpha angle formed by the axis of vertebra and the axis of spinous process, 2) beta concave and beta convex angle between the spinous process and the left and right transverse process respectively, 3) gamma concave and gamma convex angle between the axis of vertebra and the left and right transverse process respectively, 4) rotation angle to the sagittal plane according to Aaro and Dahlborn, 5) Cobb angle. Values of measured parameters demonstrated a common pattern of intravertebral deformity: counter clockwise deviation of the spinous process (alpha angle 15,0 +/-8,5 degrees), beta concave (69,8 +/-8,5 degrees) significantly greater than beta convex (38,8 +/-8,5 degrees), gamma concave (54,3 +/-7,8 degrees) not different from gamma convex (56,0 +/-8,0 degrees). Strong linear positive correlation between alpha angle and Aaro-Dahlborn angle was observed (r=0,78, p<0,05). Changes in morphology of apical vertebra due to intravertebral bone remodelling followed the vertebral spatial displacement and there existed a linear correlation in between. The two processes develop in opposite directions.

Stimulation of Cl- uptake and morphological changes in gill mitochondria-rich cells in freshwater tilapia (Oreochromis mossambicus).

PubMed

Chang, Il-Chi; Wei, Yuan-Yaw; Chou, Fong-In; Hwang, Pung-Pung

2003-01-01

The purpose of the present article is to examine the relationships between ion uptakes and morphologies of gill mitochondria-rich (MR) cells in freshwater tilapia. Tilapia were acclimated to three different artificial freshwaters (high Na [10 mM], high Cl [7.5 mM]; high Na, low Cl [0.02-0.07 mM], and low Na [0.5 mM], low Cl) for 1 wk, and then morphological measurements of gill MR cells were made and ion influxes were determined. The number and the apical size of wavy-convex MR cells positively associated with the level of Cl(-) influx. Conversely, Na(+) influx showed no positive correlation with the morphologies of MR cells. The dominant MR cell type in tilapia gills changed from deep-hole to wavy-convex within 6 h after acute transfer from a high-Cl(-) to a low-Cl(-) environment. Deep-hole MR cells became dominant 24-96 h after acute transfer from a low-Cl(-) to a high-Cl(-) environment. We conclude that wavy-convex MR cells associate with Cl(-) uptake but not Na(+) uptake, and the rapid formation of wavy-convex MR cells reflects the timely stimulation of Cl(-) uptake to recover the homeostasis of internal Cl(-) levels on acute challenge with low environmental Cl(-).

Measurement system for diffraction efficiency of convex gratings

NASA Astrophysics Data System (ADS)

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.

Trade-off between reservoir yield and evaporation losses as a function of lake morphology in semi-arid Brazil.

PubMed

Campos, José N B; Lima, Iran E; Studart, Ticiana M C; Nascimento, Luiz S V

2016-05-31

This study investigates the relationships between yield and evaporation as a function of lake morphology in semi-arid Brazil. First, a new methodology was proposed to classify the morphology of 40 reservoirs in the Ceará State, with storage capacities ranging from approximately 5 to 4500 hm3. Then, Monte Carlo simulations were conducted to study the effect of reservoir morphology (including real and simplified conical forms) on the water storage process at different reliability levels. The reservoirs were categorized as convex (60.0%), slightly convex (27.5%) or linear (12.5%). When the conical approximation was used instead of the real lake form, a trade-off occurred between reservoir yield and evaporation losses, with different trends for the convex, slightly convex and linear reservoirs. Using the conical approximation, the water yield prediction errors reached approximately 5% of the mean annual inflow, which is negligible for large reservoirs. However, for smaller reservoirs, this error became important. Therefore, this paper presents a new procedure for correcting the yield-evaporation relationships that were obtained by assuming a conical approximation rather than the real reservoir morphology. The combination of this correction with the Regulation Triangle Diagram is useful for rapidly and objectively predicting reservoir yield and evaporation losses in semi-arid environments.

Scalable Metropolis Monte Carlo for simulation of hard shapes

NASA Astrophysics Data System (ADS)

Anderson, Joshua A.; Eric Irrgang, M.; Glotzer, Sharon C.

2016-07-01

We design and implement a scalable hard particle Monte Carlo simulation toolkit (HPMC), and release it open source as part of HOOMD-blue. HPMC runs in parallel on many CPUs and many GPUs using domain decomposition. We employ BVH trees instead of cell lists on the CPU for fast performance, especially with large particle size disparity, and optimize inner loops with SIMD vector intrinsics on the CPU. Our GPU kernel proposes many trial moves in parallel on a checkerboard and uses a block-level queue to redistribute work among threads and avoid divergence. HPMC supports a wide variety of shape classes, including spheres/disks, unions of spheres, convex polygons, convex spheropolygons, concave polygons, ellipsoids/ellipses, convex polyhedra, convex spheropolyhedra, spheres cut by planes, and concave polyhedra. NVT and NPT ensembles can be run in 2D or 3D triclinic boxes. Additional integration schemes permit Frenkel-Ladd free energy computations and implicit depletant simulations. In a benchmark system of a fluid of 4096 pentagons, HPMC performs 10 million sweeps in 10 min on 96 CPU cores on XSEDE Comet. The same simulation would take 7.6 h in serial. HPMC also scales to large system sizes, and the same benchmark with 16.8 million particles runs in 1.4 h on 2048 GPUs on OLCF Titan.

Group Variable Selection Via Convex Log-Exp-Sum Penalty with Application to a Breast Cancer Survivor Study

PubMed Central

Geng, Zhigeng; Wang, Sijian; Yu, Menggang; Monahan, Patrick O.; Champion, Victoria; Wahba, Grace

2017-01-01

Summary In many scientific and engineering applications, covariates are naturally grouped. When the group structures are available among covariates, people are usually interested in identifying both important groups and important variables within the selected groups. Among existing successful group variable selection methods, some methods fail to conduct the within group selection. Some methods are able to conduct both group and within group selection, but the corresponding objective functions are non-convex. Such a non-convexity may require extra numerical effort. In this article, we propose a novel Log-Exp-Sum(LES) penalty for group variable selection. The LES penalty is strictly convex. It can identify important groups as well as select important variables within the group. We develop an efficient group-level coordinate descent algorithm to fit the model. We also derive non-asymptotic error bounds and asymptotic group selection consistency for our method in the high-dimensional setting where the number of covariates can be much larger than the sample size. Numerical results demonstrate the good performance of our method in both variable selection and prediction. We applied the proposed method to an American Cancer Society breast cancer survivor dataset. The findings are clinically meaningful and may help design intervention programs to improve the qualify of life for breast cancer survivors. PMID:25257196

Group theoretical methods and wavelet theory: coorbit theory and applications

NASA Astrophysics Data System (ADS)

Feichtinger, Hans G.

2013-05-01

Before the invention of orthogonal wavelet systems by Yves Meyer1 in 1986 Gabor expansions (viewed as discretized inversion of the Short-Time Fourier Transform2 using the overlap and add OLA) and (what is now perceived as) wavelet expansions have been treated more or less at an equal footing. The famous paper on painless expansions by Daubechies, Grossman and Meyer3 is a good example for this situation. The description of atomic decompositions for functions in modulation spaces4 (including the classical Sobolev spaces) given by the author5 was directly modeled according to the corresponding atomic characterizations by Frazier and Jawerth,6, 7 more or less with the idea of replacing the dyadic partitions of unity of the Fourier transform side by uniform partitions of unity (so-called BUPU's, first named as such in the early work on Wiener-type spaces by the author in 19808). Watching the literature in the subsequent two decades one can observe that the interest in wavelets "took over", because it became possible to construct orthonormal wavelet systems with compact support and of any given degree of smoothness,9 while in contrast the Balian-Low theorem is prohibiting the existence of corresponding Gabor orthonormal bases, even in the multi-dimensional case and for general symplectic lattices.10 It is an interesting historical fact that* his construction of band-limited orthonormal wavelets (the Meyer wavelet, see11) grew out of an attempt to prove the impossibility of the existence of such systems, and the final insight was that it was not impossible to have such systems, and in fact quite a variety of orthonormal wavelet system can be constructed as we know by now. Meanwhile it is established wisdom that wavelet theory and time-frequency analysis are two different ways of decomposing signals in orthogonal resp. non-orthogonal ways. The unifying theory, covering both cases, distilling from these two situations the common group theoretical background lead to the theory of coorbit spaces,12, 13 established by the author jointly with K. Gröchenig. Starting from an integrable and irreducible representation of some locally compact group (such as the "ax+b"-group or the Heisenberg group) one can derive families of Banach spaces having natural atomic characterizations, or alternatively a continuous transform associated to it. So at the end function spaces of locally compact groups come into play, and their generic properties help to explain why and how it is possible to obtain (nonorthogonal) decompositions. While unification of these two groups was one important aspect of the approach given in the late 80th, it was also clear that this approach allows to formulate and exploit the analogy to Banach spaces of analytic functions invariant under the Moebius group have been at the heart in this context. Recent years have seen further new instances and generalizations. Among them shearlets or the Blaschke product should be mentioned here, and the increased interest in the connections between wavelet theory and complex analysis. The talk will try to summarize a few of the general principles which can be derived from the general theory, but also highlight the difference between the different groups and signal expansions arising from corresponding group representations. There is still a lot more to be done, also from the point of view of applications and the numerical realization of such non-orthogonal expansions.

Generalized Convexity and Concavity Properties of the Optimal Value Function in Parametric Nonlinear Programming.

DTIC Science & Technology

1983-04-11

existing ones. * -37- !I T-472 REFERENCES [1] Avriel, M., W. E. Diewert, S. Schaible and W. T. Ziemba (1981). Introduction to concave and generalized concave...functions. In Generalized Concavity in Optimization and Economics (S. Schaible and W. T. Ziemba , eds.), Academic Press, New York, pp. 21-50. (21 Bank...Optimality conditions involving generalized convex mappings. In Generalized Concavity in Optimization and Economics (S. Schaible and W. T. Ziemba

Inequalities of extended beta and extended hypergeometric functions.

PubMed

Mondal, Saiful R

2017-01-01

We study the log-convexity of the extended beta functions. As a consequence, we establish Turán-type inequalities. The monotonicity, log-convexity, log-concavity of extended hypergeometric functions are deduced by using the inequalities on extended beta functions. The particular cases of those results also give the Turán-type inequalities for extended confluent and extended Gaussian hypergeometric functions. Some reverses of Turán-type inequalities are also derived.

The Role of Hellinger Processes in Mathematical Finance

NASA Astrophysics Data System (ADS)

Choulli, T.; Hurd, T. R.

2001-09-01

This paper illustrates the natural role that Hellinger processes can play in solving problems from ¯nance. We propose an extension of the concept of Hellinger process applicable to entropy distance and f-divergence distances, where f is a convex logarithmic function or a convex power function with general order q, 0 6= q < 1. These concepts lead to a new approach to Merton's optimal portfolio problem and its dual in general L¶evy markets.

A convex penalty for switching control of partial differential equations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Clason, Christian; Rund, Armin; Kunisch, Karl

2016-01-19

A convex penalty for promoting switching controls for partial differential equations is introduced; such controls consist of an arbitrary number of components of which at most one should be simultaneously active. Using a Moreau–Yosida approximation, a family of approximating problems is obtained that is amenable to solution by a semismooth Newton method. In conclusion, the efficiency of this approach and the structure of the obtained controls are demonstrated by numerical examples.

End-point controller design for an experimental two-link flexible manipulator using convex optimization

NASA Technical Reports Server (NTRS)

Oakley, Celia M.; Barratt, Craig H.

1990-01-01

Recent results in linear controller design are used to design an end-point controller for an experimental two-link flexible manipulator. A nominal 14-state linear-quadratic-Gaussian (LQG) controller was augmented with a 528-tap finite-impulse-response (FIR) filter designed using convex optimization techniques. The resulting 278-state controller produced improved end-point trajectory tracking and disturbance rejection in simulation and experimentally in real time.

A Maximal Element Theorem in FWC-Spaces and Its Applications

PubMed Central

Hu, Qingwen; Miao, Yulin

2014-01-01

A maximal element theorem is proved in finite weakly convex spaces (FWC-spaces, in short) which have no linear, convex, and topological structure. Using the maximal element theorem, we develop new existence theorems of solutions to variational relation problem, generalized equilibrium problem, equilibrium problem with lower and upper bounds, and minimax problem in FWC-spaces. The results represented in this paper unify and extend some known results in the literature. PMID:24782672

Central Schemes for Multi-Dimensional Hamilton-Jacobi Equations

NASA Technical Reports Server (NTRS)

Bryson, Steve; Levy, Doron; Biegel, Bryan (Technical Monitor)

2002-01-01

We present new, efficient central schemes for multi-dimensional Hamilton-Jacobi equations. These non-oscillatory, non-staggered schemes are first- and second-order accurate and are designed to scale well with an increasing dimension. Efficiency is obtained by carefully choosing the location of the evolution points and by using a one-dimensional projection step. First-and second-order accuracy is verified for a variety of multi-dimensional, convex and non-convex problems.

Method and Apparatus for Powered Descent Guidance

NASA Technical Reports Server (NTRS)

Acikmese, Behcet (Inventor); Blackmore, James C. L. (Inventor); Scharf, Daniel P. (Inventor)

2013-01-01

A method and apparatus for landing a spacecraft having thrusters with non-convex constraints is described. The method first computes a solution to a minimum error landing problem for a convexified constraints, then applies that solution to a minimum fuel landing problem for convexified constraints. The result is a solution that is a minimum error and minimum fuel solution that is also a feasible solution to the analogous system with non-convex thruster constraints.

Image restoration by the method of convex projections: part 2 applications and numerical results.

PubMed

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.

Variation of telencephalon morphology of the threespine stickleback (Gasterosteus aculeatus) in relation to inferred ecology.

PubMed

Park, Peter J; Bell, M A

2010-06-01

We tested the hypothesis that increased telencephalon size has evolved in threespine stickleback fish (Gasterosteus aculeatus) from structurally complex habitats using field-caught samples from one sea-run (ancestral) and 18 ecologically diverse freshwater (descendant) populations. Freshwater habitats ranged from shallow, structurally complex lakes with benthic-foraging stickleback (benthics), to deeper, structurally simple lakes in which stickleback depend more heavily on plankton for prey (generalists). Contrary to our expectations, benthics had smaller telencephala than generalists, but the shape of the telencephalon of the sea-run and benthic populations were more convex laterally. Convex telencephalon shape may indicate enlargement of the dorsolateral region, which is homologous with the tetrapod hippocampus. Telencephalon morphology is also sexually dimorphic, with larger, less convex telencephala in males. Freshwater stickleback from structurally complex habitats have retained the ancestral telencephalon morphology, but populations that feed more in open habitats on plankton have evolved larger, laterally concave telencephala.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Huang, Kuo -Ling; Mehrotra, Sanjay

We present a homogeneous algorithm equipped with a modified potential function for the monotone complementarity problem. We show that this potential function is reduced by at least a constant amount if a scaled Lipschitz condition (SLC) is satisfied. A practical algorithm based on this potential function is implemented in a software package named iOptimize. The implementation in iOptimize maintains global linear and polynomial time convergence properties, while achieving practical performance. It either successfully solves the problem, or concludes that the SLC is not satisfied. When compared with the mature software package MOSEK (barrier solver version 6.0.0.106), iOptimize solves convex quadraticmore » programming problems, convex quadratically constrained quadratic programming problems, and general convex programming problems in fewer iterations. Moreover, several problems for which MOSEK fails are solved to optimality. In addition, we also find that iOptimize detects infeasibility more reliably than the general nonlinear solvers Ipopt (version 3.9.2) and Knitro (version 8.0).« less

Non-Convex Sparse and Low-Rank Based Robust Subspace Segmentation for Data Mining.

PubMed

Cheng, Wenlong; Zhao, Mingbo; Xiong, Naixue; Chui, Kwok Tai

2017-07-15

Parsimony, including sparsity and low-rank, has shown great importance for data mining in social networks, particularly in tasks such as segmentation and recognition. Traditionally, such modeling approaches rely on an iterative algorithm that minimizes an objective function with convex l ₁-norm or nuclear norm constraints. However, the obtained results by convex optimization are usually suboptimal to solutions of original sparse or low-rank problems. In this paper, a novel robust subspace segmentation algorithm has been proposed by integrating l p -norm and Schatten p -norm constraints. Our so-obtained affinity graph can better capture local geometrical structure and the global information of the data. As a consequence, our algorithm is more generative, discriminative and robust. An efficient linearized alternating direction method is derived to realize our model. Extensive segmentation experiments are conducted on public datasets. The proposed algorithm is revealed to be more effective and robust compared to five existing algorithms.

Fast globally optimal segmentation of 3D prostate MRI with axial symmetry prior.

PubMed

Qiu, Wu; Yuan, Jing; Ukwatta, Eranga; Sun, Yue; Rajchl, Martin; Fenster, Aaron

2013-01-01

We propose a novel global optimization approach to segmenting a given 3D prostate T2w magnetic resonance (MR) image, which enforces the inherent axial symmetry of the prostate shape and simultaneously performs a sequence of 2D axial slice-wise segmentations with a global 3D coherence prior. We show that the proposed challenging combinatorial optimization problem can be solved globally and exactly by means of convex relaxation. With this regard, we introduce a novel coupled continuous max-flow model, which is dual to the studied convex relaxed optimization formulation and leads to an efficient multiplier augmented algorithm based on the modern convex optimization theory. Moreover, the new continuous max-flow based algorithm was implemented on GPUs to achieve a substantial improvement in computation. Experimental results using public and in-house datasets demonstrate great advantages of the proposed method in terms of both accuracy and efficiency.

Distance majorization and its applications

PubMed Central

Chi, Eric C.; Zhou, Hua; Lange, Kenneth

2014-01-01

The problem of minimizing a continuously differentiable convex function over an intersection of closed convex sets is ubiquitous in applied mathematics. It is particularly interesting when it is easy to project onto each separate set, but nontrivial to project onto their intersection. Algorithms based on Newton’s method such as the interior point method are viable for small to medium-scale problems. However, modern applications in statistics, engineering, and machine learning are posing problems with potentially tens of thousands of parameters or more. We revisit this convex programming problem and propose an algorithm that scales well with dimensionality. Our proposal is an instance of a sequential unconstrained minimization technique and revolves around three ideas: the majorization-minimization principle, the classical penalty method for constrained optimization, and quasi-Newton acceleration of fixed-point algorithms. The performance of our distance majorization algorithms is illustrated in several applications. PMID:25392563

Convex Arrhenius plots and their interpretation

PubMed Central

Truhlar, Donald G.; Kohen, Amnon

2001-01-01

This paper draws attention to selected experiments on enzyme-catalyzed reactions that show convex Arrhenius plots, which are very rare, and points out that Tolman's interpretation of the activation energy places a fundamental model-independent constraint on any detailed explanation of these reactions. The analysis presented here shows that in such systems, the rate coefficient as a function of energy is not just increasing more slowly than expected, it is actually decreasing. This interpretation of the data provides a constraint on proposed microscopic models, i.e., it requires that any successful model of a reaction with a convex Arrhenius plot should be consistent with the microcanonical rate coefficient being a decreasing function of energy. The implications and limitations of this analysis to interpreting enzyme mechanisms are discussed. This model-independent conclusion has broad applicability to all fields of kinetics, and we also draw attention to an analogy with diffusion in metastable fluids and glasses. PMID:11158559

A trait-based test for habitat filtering: Convex hull volume

USGS Publications Warehouse

Cornwell, W.K.; Schwilk, D.W.; Ackerly, D.D.

2006-01-01

Community assembly theory suggests that two processes affect the distribution of trait values within communities: competition and habitat filtering. Within a local community, competition leads to ecological differentiation of coexisting species, while habitat filtering reduces the spread of trait values, reflecting shared ecological tolerances. Many statistical tests for the effects of competition exist in the literature, but measures of habitat filtering are less well-developed. Here, we present convex hull volume, a construct from computational geometry, which provides an n-dimensional measure of the volume of trait space occupied by species in a community. Combined with ecological null models, this measure offers a useful test for habitat filtering. We use convex hull volume and a null model to analyze California woody-plant trait and community data. Our results show that observed plant communities occupy less trait space than expected from random assembly, a result consistent with habitat filtering. ?? 2006 by the Ecological Society of America.

Static and high frequency magnetic properties of FeGa thin films deposited on convex flexible substrates

NASA Astrophysics Data System (ADS)

Yu, Ying; Zhan, Qingfeng; Wei, Jinwu; Wang, Jianbo; Dai, Guohong; Zuo, Zhenghu; Zhang, Xiaoshan; Liu, Yiwei; Yang, Huali; Zhang, Yao; Xie, Shuhong; Wang, Baomin; Li, Run-Wei

2015-04-01

Magnetostrictive FeGa thin films were deposited on the bowed flexible polyethylene terephthalate (PET) substrates, which were fixed on the convex mold. A compressive stress was induced in FeGa films when the PET substrates were shaped from convex to flat. Due to the effect of magnetostriction, FeGa films exhibit an obvious in-plane uniaxial magnetic anisotropy which could be enhanced by increasing the applied pre-strains on the substrates during growth. Consequently, the ferromagnetic resonance frequency of the films was significantly increased, but the corresponding initial permeability was decreased. Moreover, the films with pre-strains less than 0.78% exhibit a working bandwidth of microwave absorption about 2 GHz. Our investigations demonstrated a convenient method via the pre-strained substrates to tune the high frequency properties of magnetic thin films which could be applied in flexible microwave devices.

H∞ control for uncertain linear system over networks with Bernoulli data dropout and actuator saturation.

PubMed

Yu, Jimin; Yang, Chenchen; Tang, Xiaoming; Wang, Ping

2018-03-01

This paper investigates the H ∞ control problems for uncertain linear system over networks with random communication data dropout and actuator saturation. The random data dropout process is modeled by a Bernoulli distributed white sequence with a known conditional probability distribution and the actuator saturation is confined in a convex hull by introducing a group of auxiliary matrices. By constructing a quadratic Lyapunov function, effective conditions for the state feedback-based H ∞ controller and the observer-based H ∞ controller are proposed in the form of non-convex matrix inequalities to take the random data dropout and actuator saturation into consideration simultaneously, and the problem of non-convex feasibility is solved by applying cone complementarity linearization (CCL) procedure. Finally, two simulation examples are given to demonstrate the effectiveness of the proposed new design techniques. Copyright © 2018 ISA. Published by Elsevier Ltd. All rights reserved.

Evaluating visual discomfort in stereoscopic projection-based CAVE system with a close viewing distance

NASA Astrophysics Data System (ADS)

Song, Weitao; Weng, Dongdong; Feng, Dan; Li, Yuqian; Liu, Yue; Wang, Yongtian

2015-05-01

As one of popular immersive Virtual Reality (VR) systems, stereoscopic cave automatic virtual environment (CAVE) system is typically consisted of 4 to 6 3m-by-3m sides of a room made of rear-projected screens. While many endeavors have been made to reduce the size of the projection-based CAVE system, the issue of asthenopia caused by lengthy exposure to stereoscopic images in such CAVE with a close viewing distance was seldom tangled. In this paper, we propose a light-weighted approach which utilizes a convex eyepiece to reduce visual discomfort induced by stereoscopic vision. An empirical experiment was conducted to examine the feasibility of convex eyepiece in a large depth of field (DOF) at close viewing distance both objectively and subjectively. The result shows the positive effects of convex eyepiece on the relief of eyestrain.

Turbulent boundary layer on a convex, curved surface

NASA Technical Reports Server (NTRS)

Gillis, J. C.; Johnston, J. P.; Kays, W. M.; Moffat, R. J.

1980-01-01

The effects of strong convex curvature on boundary layer turbulence were investigated. The data gathered on the behavior of Reynolds stress suggested the formulation of a simple turbulence model. Three sets of data were taken on two separate facilities. Both rigs had flow from a flat surface, over a convex surface with 90 deg of turning, and then onto a flat recovery surface. The geometry was adjusted so that, for both rigs, the pressure gradient along the test surface was zero - thus avoiding any effects of streamwise acceleration on the wall layers. Results show that after a sudden introduction of curvature, the shear stress in the outer part of the boundary layer is sharply diminished and is even slightly negative near the edge. The wall shear also drops off quickly downstream. In contrast, when the surface suddenly becomes flat again, the wall shear and shear stress profiles recover very slowly towards flat wall conditions.

Efficient globally optimal segmentation of cells in fluorescence microscopy images using level sets and convex energy functionals.

PubMed

Bergeest, Jan-Philip; Rohr, Karl

2012-10-01

In high-throughput applications, accurate and efficient segmentation of cells in fluorescence microscopy images is of central importance for the quantification of protein expression and the understanding of cell function. We propose an approach for segmenting cell nuclei which is based on active contours using level sets and convex energy functionals. Compared to previous work, our approach determines the global solution. Thus, the approach does not suffer from local minima and the segmentation result does not depend on the initialization. We consider three different well-known energy functionals for active contour-based segmentation and introduce convex formulations of these functionals. We also suggest a numeric approach for efficiently computing the solution. The performance of our approach has been evaluated using fluorescence microscopy images from different experiments comprising different cell types. We have also performed a quantitative comparison with previous segmentation approaches. Copyright © 2012 Elsevier B.V. All rights reserved.

High numerical aperture ring field projection system for extreme ultraviolet lithography

DOEpatents

Hudyma, Russell; Shafer, David R.

2001-01-01

An all-reflective optical system for a projection photolithography camera has a source of EUV radiation, a wafer and a mask to be imaged on the wafer. The optical system includes a first convex mirror, a second mirror, a third convex mirror, a fourth concave mirror, a fifth convex mirror and a sixth concave mirror. The system is configured such that five of the six mirrors receive a chief ray at an incidence angle of less than substantially 9.degree., and each of the six mirrors receives a chief ray at an incidence angle of less than substantially 14.degree.. Four of the six reflecting surfaces have an aspheric departure of less than substantially 12 .mu.m. Five of the six reflecting surfaces have an aspheric departure of less than substantially 12 .mu.m. Each of the six reflecting surfaces has an aspheric departure of less than substantially 16 .mu.m.

High numerical aperture ring field projection system for extreme ultraviolet lithography

DOEpatents

Hudyma, Russell; Shafer, David

2001-01-01

An all-reflective optical system for a projection photolithography camera has a source of EUV radiation, a wafer and a mask to be imaged on the wafer. The optical system includes a first convex mirror, a second mirror, a third convex mirror, a fourth concave mirror, a fifth convex mirror and a sixth concave mirror. The system is configured such that five of the six mirrors receives a chief ray at an incidence angle of less than substantially 9.degree., and each of the six mirrors receives a chief ray at an incidence angle of less than substantially 14.degree.. Four of the six reflecting surfaces have an aspheric departure of less than substantially 12 .mu.m. Five of the six reflecting surfaces have an aspheric departure of less than substantially 12 .mu.m. Each of the six reflecting surfaces has an aspheric departure of less than substantially 16 .mu.m.

Fabrication of ф 160 mm convex hyperbolic mirror for remote sensing instrument

NASA Astrophysics Data System (ADS)

Kuo, Ching-Hsiang; Yu, Zong-Ru; Ho, Cheng-Fang; Hsu, Wei-Yao; Chen, Fong-Zhi

2012-10-01

In this study, efficient polishing processes with inspection procedures for a large convex hyperbolic mirror of Cassegrain optical system are presented. The polishing process combines the techniques of conventional lapping and CNC polishing. We apply the conventional spherical lapping process to quickly remove the sub-surface damage (SSD) layer caused by grinding process and to get the accurate radius of best-fit sphere (BFS) of aspheric surface with fine surface texture simultaneously. Thus the removed material for aspherization process can be minimized and the polishing time for SSD removal can also be reduced substantially. The inspection procedure was carried out by using phase shift interferometer with CGH and stitching technique. To acquire the real surface form error of each sub aperture, the wavefront errors of the reference flat and CGH flat due to gravity effect of the vertical setup are calibrated in advance. Subsequently, we stitch 10 calibrated sub-aperture surface form errors to establish the whole irregularity of the mirror in 160 mm diameter for correction polishing. The final result of the In this study, efficient polishing processes with inspection procedures for a large convex hyperbolic mirror of Cassegrain optical system are presented. The polishing process combines the techniques of conventional lapping and CNC polishing. We apply the conventional spherical lapping process to quickly remove the sub-surface damage (SSD) layer caused by grinding process and to get the accurate radius of best-fit sphere (BFS) of aspheric surface with fine surface texture simultaneously. Thus the removed material for aspherization process can be minimized and the polishing time for SSD removal can also be reduced substantially. The inspection procedure was carried out by using phase shift interferometer with CGH and stitching technique. To acquire the real surface form error of each sub aperture, the wavefront errors of the reference flat and CGH flat due to gravity effect of the vertical setup are calibrated in advance. Subsequently, we stitch 10 calibrated sub-aperture surface form errors to establish the whole irregularity of the mirror in 160 mm diameter for correction polishing. The final result of the Fabrication of ф160 mm Convex Hyperbolic Mirror for Remote Sensing Instrument160 mm convex hyperbolic mirror is 0.15 μm PV and 17.9 nm RMS.160 mm convex hyperbolic mirror is 0.15 μm PV and 17.9 nm RMS.

Photometric survey, modelling, and scaling of long-period and low-amplitude asteroids

NASA Astrophysics Data System (ADS)

Marciniak, A.; Bartczak, P.; Müller, T.; Sanabria, J. J.; Alí-Lagoa, V.; Antonini, P.; Behrend, R.; Bernasconi, L.; Bronikowska, M.; Butkiewicz-Bąk, M.; Cikota, A.; Crippa, R.; Ditteon, R.; Dudziński, G.; Duffard, R.; Dziadura, K.; Fauvaud, S.; Geier, S.; Hirsch, R.; Horbowicz, J.; Hren, M.; Jerosimic, L.; Kamiński, K.; Kankiewicz, P.; Konstanciak, I.; Korlevic, P.; Kosturkiewicz, E.; Kudak, V.; Manzini, F.; Morales, N.; Murawiecka, M.; Ogłoza, W.; Oszkiewicz, D.; Pilcher, F.; Polakis, T.; Poncy, R.; Santana-Ros, T.; Siwak, M.; Skiff, B.; Sobkowiak, K.; Stoss, R.; Żejmo, M.; Żukowski, K.

2018-02-01

Context. The available set of spin and shape modelled asteroids is strongly biased against slowly rotating targets and those with low lightcurve amplitudes. This is due to the observing selection effects. As a consequence, the current picture of asteroid spin axis distribution, rotation rates, radiometric properties, or aspects related to the object's internal structure might be affected too. Aims: To counteract these selection effects, we are running a photometric campaign of a large sample of main belt asteroids omitted in most previous studies. Using least chi-squared fitting we determined synodic rotation periods and verified previous determinations. When a dataset for a given target was sufficiently large and varied, we performed spin and shape modelling with two different methods to compare their performance. Methods: We used the convex inversion method and the non-convex SAGE algorithm, applied on the same datasets of dense lightcurves. Both methods search for the lowest deviations between observed and modelled lightcurves, though using different approaches. Unlike convex inversion, the SAGE method allows for the existence of valleys and indentations on the shapes based only on lightcurves. Results: We obtain detailed spin and shape models for the first five targets of our sample: (159) Aemilia, (227) Philosophia, (329) Svea, (478) Tergeste, and (487) Venetia. When compared to stellar occultation chords, our models obtained an absolute size scale and major topographic features of the shape models were also confirmed. When applied to thermophysical modelling (TPM), they provided a very good fit to the infrared data and allowed their size, albedo, and thermal inertia to be determined. Conclusions: Convex and non-convex shape models provide comparable fits to lightcurves. However, some non-convex models fit notably better to stellar occultation chords and to infrared data in sophisticated thermophysical modelling (TPM). In some cases TPM showed strong preference for one of the spin and shape solutions. Also, we confirmed that slowly rotating asteroids tend to have higher-than-average values of thermal inertia, which might be caused by properties of the surface layers underlying the skin depth. The photometric data is only available at the CDS via anonymous ftp to http://cdsarc.u-strasbg.fr (http://130.79.128.5) or via http://cdsarc.u-strasbg.fr/viz-bin/qcat?J/A+A/610/A7

SNS programming environment user's guide

NASA Technical Reports Server (NTRS)

Tennille, Geoffrey M.; Howser, Lona M.; Humes, D. Creig; Cronin, Catherine K.; Bowen, John T.; Drozdowski, Joseph M.; Utley, Judith A.; Flynn, Theresa M.; Austin, Brenda A.

1992-01-01

The computing environment is briefly described for the Supercomputing Network Subsystem (SNS) of the Central Scientific Computing Complex of NASA Langley. The major SNS computers are a CRAY-2, a CRAY Y-MP, a CONVEX C-210, and a CONVEX C-220. The software is described that is common to all of these computers, including: the UNIX operating system, computer graphics, networking utilities, mass storage, and mathematical libraries. Also described is file management, validation, SNS configuration, documentation, and customer services.

Structured and Collaborative Signal Models: Theory and Applications in Image, Video, and Audio Analysis

DTIC Science & Technology

2013-01-01

Received Paper 01/22/2013 12.00 E. Esser, M. Moller, S. Osher, G. Sapiro, and J . Xin. A convex modelfor non-negative matrix factorization and...Ernie Esser, Michael M¨ oller , Stanley Osher, Guillermo Sapiro, Jack Xin. A convex model for non-negative matrixfactorization and dimensionality...still have one patent pending (with Adobe): X. Bai, J . Wang, and G. Sapiro, Methods and apparatus for dynamic color modeling. Patents Awarded Awards

A linearization of quantum channels

NASA Astrophysics Data System (ADS)

Crowder, Tanner

2015-06-01

Because the quantum channels form a compact, convex set, we can express any quantum channel as a convex combination of extremal channels. We give a Euclidean representation for the channels whose inverses are also valid channels; these are a subset of the extreme points. They form a compact, connected Lie group, and we calculate its Lie algebra. Lastly, we calculate a maximal torus for the group and provide a constructive approach to decomposing any invertible channel into a product of elementary channels.

The baker’s map with a convex hole

NASA Astrophysics Data System (ADS)

Clark, Lyndsey; Hare, Kevin G.; Sidorov, Nikita

2018-07-01

We consider the baker’s map B on the unit square X and an open convex set which we regard as a hole. The survivor set is defined as the set of all points in X whose B-trajectories are disjoint from H. The main purpose of this paper is to study holes H for which (dimension traps) as well as those for which any periodic trajectory of B intersects (cycle traps). We show that any H which lies in the interior of X is not a dimension trap. This means that, unlike the doubling map and other one-dimensional examples, we can have for H whose Lebesgue measure is arbitrarily close to one. Also, we describe holes which are dimension or cycle traps, critical in the sense that if we consider a strictly convex subset, then the corresponding property in question no longer holds. We also determine such that for all convex H whose Lebesgue measure is less than δ. This paper may be seen as a first extension of our work begun in Clark (2016 Discrete Continuous Dyn. Syst. A 6 1249–69 Clark 2016 PhD Dissertation The University of Manchester; Glendinning and Sidorov 2015 Ergod. Theor. Dynam. Syst. 35 1208–28 Hare and Sidorov 2014 Mon.hefte Math. 175 347–65 Sidorov 2014 Acta Math. Hung. 143 298–312) to higher dimensions.

A Convex Hull-Based New Metric for Quantification of Bladder Wall Irregularity in Pediatric Patients With Congenital Anomalies of the Kidney and Urinary Tract.

PubMed

Stember, Joseph N; Newhouse, Jeffrey; Behr, Gerald; Alam, Shumyle

2017-11-01

Early identification and quantification of bladder damage in pediatric patients with congenital anomalies of the kidney and urinary tract (CAKUT) is crucial to guiding effective treatment and may affect the eventual clinical outcome, including progression of renal disease. We have developed a novel approach based on the convex hull to calculate bladder wall trabecularity in pediatric patients with CAKUT. The objective of this study was to test whether our approach can accurately predict bladder wall irregularity. Twenty pediatric patients, half with renal compromise and CAKUT and half with normal renal function, were evaluated. We applied the convex hull approach to calculate T, a metric proposed to reflect the degree of trabeculation/bladder wall irregularity, in this set of patients. The average T value was roughly 3 times higher for diseased than healthy patients (0.14 [95% confidence interval, 0.10-0.17] versus 0.05 [95% confidence interval, 0.03-0.07] for normal bladders). This disparity was statistically significant (P < .01). We have demonstrated that a convex hull-based procedure can measure bladder wall irregularity. Because bladder damage is a reversible precursor to irreversible renal parenchymal damage, applying such a measure to at-risk pediatric patients can help guide prompt interventions to avert disease progression. © 2017 by the American Institute of Ultrasound in Medicine.

Study on the method to test large-aperture hyperboloid convex mirror

NASA Astrophysics Data System (ADS)

Meng, Xiaohui; Dong, Huiwen; Guo, Wen; Wang, Huijun

2014-08-01

There are numerous reflecting optical system designs that call for large-aperture convex surfaces, such as secondary mirror in on-axis three mirror anastigmatic (TMA). Several methods to test high accuracy hyperboloid convex surfaces are introduced separately in this paper. A kind of arrangement is chosen to test a surface with diameter of 420mm, radius of 1371mm, and conic K -2.1229. The CGH compensator for testing is designed, which is made up of illumination lens and hologram test plate with designed residual wavefront aberration less than 0.001λ (RMS). The second transmitted method that is equipped with a technical flat surface coating by Ag film in the bottom of surface mirror under test, which form an auto-collimation optical system to eliminate the aberration. The Hindle-Simpson test that requires a larger meniscus lens to compensate the optical aberration, and the designed result of optical test system is less than 0.0016λ. Contrasting the CGH compensator and the second transmitted method, the Hindle-Simpson testing method has the advantage of it is easily to manufacture and adjust; meanwhile the test result is stable and has been less affected by the environment. It has been found that the method is rational and reliable, and it can fulfill the requirement of manufacturing and testing process for hyperboloid convex mirrors.

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

NASA Astrophysics Data System (ADS)

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.

Six-month-old infants' perception of the hollow face illusion: evidence for a general convexity bias.

PubMed

Corrow, Sherryse L; Mathison, Jordan; Granrud, Carl E; Yonas, Albert

2014-01-01

Corrow, Granrud, Mathison, and Yonas (2011, Perception, 40, 1376-1383) found evidence that 6-month-old infants perceive the hollow face illusion. In the present study we asked whether 6-month-old infants perceive illusory depth reversal for a nonface object and whether infants' perception of the hollow face illusion is affected by mask orientation inversion. In experiment 1 infants viewed a concave bowl, and their reaches were recorded under monocular and binocular viewing conditions. Infants reached to the bowl as if it were convex significantly more often in the monocular than in the binocular viewing condition. These results suggest that infants perceive illusory depth reversal with a nonface stimulus and that the infant visual system has a bias to perceive objects as convex. Infants in experiment 2 viewed a concave face-like mask in upright and inverted orientations. Infants reached to the display as if it were convex more in the monocular than in the binocular condition; however, mask orientation had no effect on reaching. Previous findings that adults' perception of the hollow face illusion is affected by mask orientation inversion have been interpreted as evidence of stored-knowledge influences on perception. However, we found no evidence of such influences in infants, suggesting that their perception of this illusion may not be affected by stored knowledge, and that perceived depth reversal is not face-specific in infants.

Ultrasonographic evaluation of equine fetal growth throughout gestation in normal mares using a convex transducer.

PubMed

Murase, Harutaka; Endo, Yoshiro; Tsuchiya, Takeru; Kotoyori, Yasumitsu; Shikichi, Mitsumori; Ito, Katsumi; Sato, Fumio; Nambo, Yasuo

2014-07-01

It has not been common to perform regular ultrasound examination of the fetus in equine practice, due to the increasing volume of the uterus caused by fetal development. The convex three-dimensional transducer is bulb-shaped and is able to observe wide areas. In addition, its operation is simple, making it easy to create appropriate angles for various indices using a transrectal approach. The aim of this study was to measure Thoroughbred fetal growth indices throughout gestation using a convex transducer and to clarify the detectable period of some indices for clinical use. We demonstrated changes in fetal indices, such as crown rump length (CRL), fetal heart rate (FHR), fetal eye and kidney and the combined thickness of uterus and placenta (CTUP). CTUP increased from 30 weeks of gestation, and FHR peaked at 8 weeks and then decreased to term. CRL could be observed until 13 weeks due to its wide angle, longer than in previous reports. Fetal eye and kidney could be observed from 10 and 28 weeks, respectively, and these increased with pregnancy progress. The present results showed the advantage of transrectal examination using a convex transducer for evaluation of normal fetal development. Although ultrasonographic examination in mid- to late-gestation is not common in equine reproductive practice, our comprehensive results would be a useful basis for equine pregnancy examination.

The Homo sapiens 'hemibun': its developmental pattern and the problem of homology.

PubMed

Nowaczewska, W; Kuźmiński, L

2009-01-01

The occipital bun is widely considered a Neanderthal feature. Its homology to the 'hemibun' observed in some European Upper Palaeolithic anatomically modern humans is a current problem. This study quantitatively evaluates the degree of occipital plane convexity in African and Australian modern human crania to analyse a relationship between this feature and some neurocranial variables. Neanderthal and European Upper Palaeolithic Homo sapiens crania were included in the analysis as well. The results of this study indicated that there is a significant relationship between the degree of occipital plane convexity and the following two features in the examined crania of modern humans: the ratio of the maximum neurocranial height to the maximum width of the vault and the ratio of bregma-lambda chord to bregma-lambda arc. The results also revealed that some H. sapiens crania (modern and fossil) show the Neanderthal shape of the occipital plane and that the neurocranial height and shape of parietal midsagittal profile has an influence on occipital plane convexity in the hominins included in this study. This study suggests that the occurrence of the great convexity of the occipital plane in the Neanderthals and H. sapiens is a "by-product" of the relationship between the same neurocranial features and there is no convincing evidence that the Neanderthal occipital bun and the similar structure in H. sapiens develop during ontogeny in the same way.

Geometric approach to segmentation and protein localization in cell culture assays.

PubMed

Raman, S; Maxwell, C A; Barcellos-Hoff, M H; Parvin, B

2007-01-01

Cell-based fluorescence imaging assays are heterogeneous and require the collection of a large number of images for detailed quantitative analysis. Complexities arise as a result of variation in spatial nonuniformity, shape, overlapping compartments and scale (size). A new technique and methodology has been developed and tested for delineating subcellular morphology and partitioning overlapping compartments at multiple scales. This system is packaged as an integrated software platform for quantifying images that are obtained through fluorescence microscopy. Proposed methods are model based, leveraging geometric shape properties of subcellular compartments and corresponding protein localization. From the morphological perspective, convexity constraint is imposed to delineate and partition nuclear compartments. From the protein localization perspective, radial symmetry is imposed to localize punctate protein events at submicron resolution. Convexity constraint is imposed against boundary information, which are extracted through a combination of zero-crossing and gradient operator. If the convexity constraint fails for the boundary then positive curvature maxima are localized along the contour and the entire blob is partitioned into disjointed convex objects representing individual nuclear compartment, by enforcing geometric constraints. Nuclear compartments provide the context for protein localization, which may be diffuse or punctate. Punctate signal are localized through iterative voting and radial symmetries for improved reliability and robustness. The technique has been tested against 196 images that were generated to study centrosome abnormalities. Corresponding computed representations are compared against manual counts for validation.

Generalized vector calculus on convex domain

NASA Astrophysics Data System (ADS)

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.

Sensitivity analysis for parametric generalized implicit quasi-variational-like inclusions involving P-[eta]-accretive mappings

NASA Astrophysics Data System (ADS)

Kazmi, K. R.; Khan, F. A.

2008-01-01

In this paper, using proximal-point mapping technique of P-[eta]-accretive mapping and the property of the fixed-point set of set-valued contractive mappings, we study the behavior and sensitivity analysis of the solution set of a parametric generalized implicit quasi-variational-like inclusion involving P-[eta]-accretive mapping in real uniformly smooth Banach space. Further, under suitable conditions, we discuss the Lipschitz continuity of the solution set with respect to the parameter. The technique and results presented in this paper can be viewed as extension of the techniques and corresponding results given in [R.P. Agarwal, Y.-J. Cho, N.-J. Huang, Sensitivity analysis for strongly nonlinear quasi-variational inclusions, Appl. MathE Lett. 13 (2002) 19-24; S. Dafermos, Sensitivity analysis in variational inequalities, Math. Oper. Res. 13 (1988) 421-434; X.-P. Ding, Sensitivity analysis for generalized nonlinear implicit quasi-variational inclusions, Appl. Math. Lett. 17 (2) (2004) 225-235; X.-P. Ding, Parametric completely generalized mixed implicit quasi-variational inclusions involving h-maximal monotone mappings, J. Comput. Appl. Math. 182 (2) (2005) 252-269; X.-P. Ding, C.L. Luo, On parametric generalized quasi-variational inequalities, J. Optim. Theory Appl. 100 (1999) 195-205; Z. Liu, L. Debnath, S.M. Kang, J.S. Ume, Sensitivity analysis for parametric completely generalized nonlinear implicit quasi-variational inclusions, J. Math. Anal. Appl. 277 (1) (2003) 142-154; R.N. Mukherjee, H.L. Verma, Sensitivity analysis of generalized variational inequalities, J. Math. Anal. Appl. 167 (1992) 299-304; M.A. Noor, Sensitivity analysis framework for general quasi-variational inclusions, Comput. Math. Appl. 44 (2002) 1175-1181; M.A. Noor, Sensitivity analysis for quasivariational inclusions, J. Math. Anal. Appl. 236 (1999) 290-299; J.Y. Park, J.U. Jeong, Parametric generalized mixed variational inequalities, Appl. Math. Lett. 17 (2004) 43-48].

Effect of Asymmetric Tension on Biomechanics and Metabolism of Vertebral Epiphyseal Plate in a Rodent Model of Scoliosis.

PubMed

Li, Qian-Yi; Zhong, Gui-Bin; Liu, Zu-de; Lao, Li-Feng

2017-08-01

To investigate the effect of asymmetric tension on idiopathic scoliosis (IS) and to understand its pathogenic mechanism. The rodent model of scoliosis was established using Sprague-Dawley rats with left rib-tethering from T 6 to T 12 , tail and shoulder amputation, and high-cage feeding. Vertebrae epiphyseal cartilage plates were harvested from the convex and concave sides. To analyze differences on the convex and concave sides, finite element analysis was carried out to determine the mechanical stress. Protein expression on epiphyseal cartilage was evaluated by western blot. Micro-CT was taken to evaluate the bone quality of vertebral on both sides. Scoliosis curves presented in X-ray radiographs of the rats. Finite element analysis was carried out on the axial and transverse tension of the spine. Stresses of the convex side were -170.14, -373.18, and -3832.32 MPa (X, Y, and Z axis, respectively), while the concave side showed stresses of 361.99, 605.55, and 3661.95 MPa. Collagen type II, collagen type X, Sox 9, RunX2, VEGF, and aggrecan were expressed significantly more on the convex side (P < 0.05). There was asymmetric expression of protein on the epiphyseal cartilage plate at molecular level. Compared with the convex side, the concave side had significantly lower value in the BV/TV and Tb.N, but higher value in the Tb.Sp (P < 0.05). There was asymmetry of bone quality in micro-architecture. In this study, asymmetric tension contributed to asymmetry in protein expression and bone quality on vertebral epiphyseal plates, ultimately resulting in asymmetry of anatomy. In addition, asymmetry of anatomy aggravated asymmetric tension. It is the first study to show that there is an asymmetrical vicious circle in IS. © 2017 Chinese Orthopaedic Association and John Wiley & Sons Australia, Ltd.

Galerkin approximation for inverse problems for nonautonomous nonlinear distributed systems

NASA Technical Reports Server (NTRS)

Banks, H. T.; Reich, Simeon; Rosen, I. G.

1988-01-01

An abstract framework and convergence theory is developed for Galerkin approximation for inverse problems involving the identification of nonautonomous nonlinear distributed parameter systems. A set of relatively easily verified conditions is provided which are sufficient to guarantee the existence of optimal solutions and their approximation by a sequence of solutions to a sequence of approximating finite dimensional identification problems. The approach is based on the theory of monotone operators in Banach spaces and is applicable to a reasonably broad class of nonlinear distributed systems. Operator theoretic and variational techniques are used to establish a fundamental convergence result. An example involving evolution systems with dynamics described by nonstationary quasilinear elliptic operators along with some applications are presented and discussed.

Elliptic complexes over C∗-algebras of compact operators

NASA Astrophysics Data System (ADS)

Krýsl, Svatopluk

2016-03-01

For a C∗-algebra A of compact operators and a compact manifold M, we prove that the Hodge theory holds for A-elliptic complexes of pseudodifferential operators acting on smooth sections of finitely generated projective A-Hilbert bundles over M. For these C∗-algebras and manifolds, we get a topological isomorphism between the cohomology groups of an A-elliptic complex and the space of harmonic elements of the complex. Consequently, the cohomology groups appear to be finitely generated projective C∗-Hilbert modules and especially, Banach spaces. We also prove that in the category of Hilbert A-modules and continuous adjointable Hilbert A-module homomorphisms, the property of a complex of being self-adjoint parametrix possessing characterizes the complexes of Hodge type.

Fuglede–Kadison determinant: theme and variations

PubMed Central

de la Harpe, Pierre

2013-01-01

We review the definition of determinants for finite von Neumann algebras, due to Fuglede and Kadison [Fuglede B, Kadison R (1952) Ann Math 55:520–530], and a generalization for appropriate groups of invertible elements in Banach algebras, from a paper by Skandalis and the author (1984). After some discussion of K-theory and Whitehead torsion, we indicate the relevance of these determinants to the study of -torsion in topology. Contents are as follows:1. The classical setting.2. On von Neumann algebras and traces.3. Fuglede–Kadison determinant for finite von Neumann algebras.4. Motivating question.5. Brief reminder of , , , and Bott periodicity.6. Revisiting the Fuglede–Kadison and other determinants.7. On Whitehead torsion.8. A few lines on -torsion. PMID:24082099

Characteristic Functional of a Probability Measure Absolutely Continuous with Respect to a Gaussian Radon Measure

DTIC Science & Technology

1984-08-01

12. PERSONAL AUTHORISI Hiroshi Sato 13* TYPE OF REPORT TECHNICAL 13b. TIME COVERED PROM TO 14. OATE OF REPORT (Yr. Mo., Day) Aug. 1984...nectuary and identify by bloc* number) Let p and p.. be probability measures on a locally convex Hausdorff real topological linear space E. C.R. Baker [1...THIS PAGE ABSTRACT Let y and y1 be probability measures on a locally convex Hausdorff real topological linear space E. C.R. Baker [1] posed the

Convexity of the entanglement entropy of SU(2N)-symmetric fermions with attractive interactions.

PubMed

Drut, Joaquín E; Porter, William J

2015-02-06

The positivity of the probability measure of attractively interacting systems of 2N-component fermions enables the derivation of an exact convexity property for the ground-state energy of such systems. Using analogous arguments, applied to path-integral expressions for the entanglement entropy derived recently, we prove nonperturbative analytic relations for the Rényi entropies of those systems. These relations are valid for all subsystem sizes, particle numbers, and dimensions, and in arbitrary external trapping potentials.

Structural Evolution and Kinetics in Cu-Zr Metallic Liquids from Molecular Dynamics Simulations (Postprint)

DTIC Science & Technology

2013-10-23

compensate for overcounting due to numerical issues inherent in the tessellation.16 The shape of the coordination polyhedron was determined by the shape...work by Yang et al.21 The total volume can be determined by finding the volume of the convex polyhedron whose vertices are given by the centers of...atoms in the nearest-neighbor shell. In order to determine the volume of the atoms inside the clusters, the convex hull polyhedron is first segmented

Geometric Transforms for Fast Geometric Algorithms.

DTIC Science & Technology

1979-12-01

representation is not an important issue in a real RAM.) For more complicated geometrical objects such as polygons, polyhedrons , and Voronoi diagrams the issue...of N disks canl be represented as a convex polyhedron in O(N log N) time. Proof: We illustrate thle construction in Figurc 3-1 1. We first embed the N...or intersection of N arbitrary planar disks by a convex polyhedron in O(N log N) time. 0. Figure 3-11: General case for intersection or union of N

Explicit finite difference predictor and convex corrector with applications to hyperbolic partial differential equations

NASA Technical Reports Server (NTRS)

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.

Semilinear (topological) spaces and applications

NASA Technical Reports Server (NTRS)

Prakash, P.; Sertel, M. R.

1971-01-01

Semivector spaces are defined and some of their algebraic aspects are developed including some structure theory. These spaces are then topologized to obtain semilinear topological spaces for which a hierarchy of local convexity axioms is identified. A number of fixed point and minmax theorems for spaces with various local convexity properties are established. The spaces of concern arise naturally as various hyperspaces of linear and semilinear (topological) spaces. It is indicated briefly how all this can be applied in socio-economic analysis and optimization.

Analysis and Design of the NASA Langley Cryogenic Pressure Box

NASA Technical Reports Server (NTRS)

Glass, David E.; Stevens, Jonathan C.; Vause, R. Frank; Winn, Peter M.; Maguire, James F.; Driscoll, Glenn C.; Blackburn, Charles L.; Mason, Brian H.

1999-01-01

A cryogenic pressure box was designed and fabricated for use at NASA Langley Research Center (LaRC) to subject 72 in. x 60 in. curved panels to cryogenic temperatures and biaxial tensile loads. The cryogenic pressure box is capable of testing curved panels down to -423 F (20K) with 54 psig maximum pressure on the concave side, and elevated temperatures and atmospheric pressure on the convex surface. The internal surface of the panel is cooled by high pressure helium as that is cooled to -423 F by liquid helium heat exchangers. An array of twelve independently controlled fans circulate the high pressure gaseous helium to provide uniform cooling on the panel surface. The load introduction structure, consisting of four stainless steel load plates and numerous fingers attaching the load plates to the test panel, is designed to introduce loads into the test panel that represent stresses that will he observed in the actual tank structure. The load plates are trace cooled with liquid nitrogen to reduce thermal gradients that may result in bending the load plates, and thus additional stresses in the test panel. The design of the cryogenic systems, load introduction structure, and control system are discussed in this report.

The Influence of Low Frequency Mechanical Vibrations on the Growth of Single Crystals

NASA Technical Reports Server (NTRS)

Feigelson, R. S.; Elwell, D.

1985-01-01

The optimum conditions for crystal growth are usually achieved either by suppressing convective fluid flows (e.g., by the use of a low-gravity environment) or by over-riding thermal and solutal convection by the use of a strong stirring action. A novel stirring technique has been developed which involves subjecting a vertical crucible to a circle in a horizontal plane (without rotation). Use of an amplitude of 3 mm at a frequency of approx 6 Hz produced complete mixing of a non-uniform aqueous liquid in a few seconds. The mixing action involved the downward flow of liquid in the outer annulus of the liquid, driven by surface waves. When the downward flowing liquid reaches the bottom of the crucible, it is reflected in a central, upward flowing spiral. This flow pattern should be beneficial for crystal growth by the Bridgman method since it will sweep impurities away from the walls and produce a more convex solid-liquid interface. Initial attempts to apply the new stirring technique to CdTe crystal growth did not show significant improvement in the number of crystals nucleated, but the interface shape appeared to be close to that predicted.

Summary of Research Report

NASA Technical Reports Server (NTRS)

Elishakoff, Isaac

1998-01-01

Ten papers, published in various publications, on buckling, and the effects of imperfections on various structures are presented. These papers are: (1) Buckling mode localization in elastic plates due to misplacement in the stiffner location; (2) On vibrational imperfection sensitivity on Augusti's model structure in the vicinity of a non-linear static state; (3) Imperfection sensitivity due to elastic moduli in the Roorda Koiter frame; (4) Buckling mode localization in a multi-span periodic structure with a disorder in a single span; (5) Prediction of natural frequency and buckling load variability due to uncertainty in material properties by convex modeling; (6) Derivation of multi-dimensional ellipsoidal convex model for experimental data; (7) Passive control of buckling deformation via Anderson localization phenomenon; (8)Effect of the thickness and initial im perfection on buckling on composite cylindrical shells: asymptotic analysis and numerical results by BOSOR4 and PANDA2; (9) Worst case estimation of homology design by convex analysis; (10) Buckling of structures with uncertain imperfections - Personal perspective.

Undulated Nozzle for Enhanced Exit Area Mixing

NASA Technical Reports Server (NTRS)

Seiner, John M. (Inventor); Gilinsky, Mikhail M. (Inventor)

2000-01-01

A nozzle having an undulating surface for enhancing the mixing of a primary flow with a secondary flow or ambient air, without requiring an ejector. The nozzle includes a nozzle structure and design for introducing counter-rotating vorticity into the primary flow either through (i) internal surface corrugations where an axisymmetric line through each corrugation is coincident with an axisymmetric line through the center of the flow passageway or (ii) through one or more sets of alternating convexities and cavities in the internal surface of the nozzle where an axisymmetric line through each convexity and cavity is coincident with an axisymmetric line through the center of the flow passageway, and where the convexities contract from the entrance end towards the exit end. Exit area mixing is also enhanced by one or more chevrons attached to the exit edge of the nozzle. The nozzle is ideally suited for application as a jet engine nozzle. When used as a jet engine nozzle, noise suppression with simultaneous thrust augmentation/minimal thrust loss is achieved.

Joint terminals and relay optimization for two-way power line information exchange systems with QoS constraints

NASA Astrophysics Data System (ADS)

Wu, Xiaolin; Rong, Yue

2015-12-01

The quality-of-service (QoS) criteria (measured in terms of the minimum capacity requirement in this paper) are very important to practical indoor power line communication (PLC) applications as they greatly affect the user experience. With a two-way multicarrier relay configuration, in this paper we investigate the joint terminals and relay power optimization for the indoor broadband PLC environment, where the relay node works in the amplify-and-forward (AF) mode. As the QoS-constrained power allocation problem is highly non-convex, the globally optimal solution is computationally intractable to obtain. To overcome this challenge, we propose an alternating optimization (AO) method to decompose this problem into three convex/quasi-convex sub-problems. Simulation results demonstrate the fast convergence of the proposed algorithm under practical PLC channel conditions. Compared with the conventional bidirectional direct transmission (BDT) system, the relay-assisted two-way information exchange (R2WX) scheme can meet the same QoS requirement with less total power consumption.

Spatial trends in tidal flat shape and associated environmental parameters in South San Francisco Bay

USGS Publications Warehouse

Bearman, J.A.; Friedrichs, Carl T.; Jaffe, B.E.; Foxgrover, A.C.

2010-01-01

Spatial trends in the shape of profiles of South San Francisco Bay (SSFB) tidal flats are examined using bathymetric and lidar data collected in 2004 and 2005. Eigenfunction analysis reveals a dominant mode of morphologic variability related to the degree of convexity or concavity in the cross-shore profileindicative of (i) depositional, tidally dominant or (ii) erosional, wave impacted conditions. Two contrasting areas of characteristic shapenorth or south of a constriction in estuary width located near the Dumbarton Bridgeare recognized. This pattern of increasing or decreasing convexity in the inner or outer estuary is correlated to spatial variability in external and internal environmental parameters, and observational results are found to be largely consistent with theoretical expectations. Tidal flat convexity in SSFB is observed to increase (in decreasing order of significance) in response to increased deposition, increased tidal range, decreased fetch length, decreased sediment grain size, and decreased tidal flat width. ?? 2010 Coastal Education and Research Foundation.

Hydrodynamic Trapping of Swimming Bacteria by Convex Walls

NASA Astrophysics Data System (ADS)

Sipos, O.; Nagy, K.; Di Leonardo, R.; Galajda, P.

2015-06-01

Swimming bacteria display a remarkable tendency to move along flat surfaces for prolonged times. This behavior may have a biological importance but can also be exploited by using microfabricated structures to manipulate bacteria. The main physical mechanism behind the surface entrapment of swimming bacteria is, however, still an open question. By studying the swimming motion of Escherichia coli cells near microfabricated pillars of variable size, we show that cell entrapment is also present for convex walls of sufficiently low curvature. Entrapment is, however, markedly reduced below a characteristic radius. Using a simple hydrodynamic model, we predict that trapped cells swim at a finite angle with the wall and a precise relation exists between the swimming angle at a flat wall and the critical radius of curvature for entrapment. Both predictions are quantitatively verified by experimental data. Our results demonstrate that the main mechanism for wall entrapment is hydrodynamic in nature and show the possibility of inhibiting cell adhesion, and thus biofilm formation, using convex features of appropriate curvature.

A Genealogy of Convex Solids Via Local and Global Bifurcations of Gradient Vector Fields

NASA Astrophysics Data System (ADS)

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.

Delivering Sound Energy along an Arbitrary Convex Trajectory

PubMed Central

Zhao, Sipei; Hu, Yuxiang; Lu, Jing; Qiu, Xiaojun; Cheng, Jianchun; Burnett, Ian

2014-01-01

Accelerating beams have attracted considerable research interest due to their peculiar properties and various applications. Although there have been numerous research on the generation and application of accelerating light beams, few results have been published on the generation of accelerating acoustic beams. Here we report on the experimental observation of accelerating acoustic beams along arbitrary convex trajectories. The desired trajectory is projected to the spatial phase profile on the boundary which is discretized and sampled spatially. The sound field distribution is formulated with the Green function and the integral equation method. Both the paraxial and the non-paraxial regimes are examined and observed in the experiments. The effect of obstacle scattering in the sound field is also investigated and the results demonstrate that the approach is robust against obstacle scattering. The realization of accelerating acoustic beams will have an impact on various applications where acoustic information and energy are required to be delivered along an arbitrary convex trajectory. PMID:25316353

An optimized algorithm for multiscale wideband deconvolution of radio astronomical images

NASA Astrophysics Data System (ADS)

Offringa, A. R.; Smirnov, O.

2017-10-01

We describe a new multiscale deconvolution algorithm that can also be used in a multifrequency mode. The algorithm only affects the minor clean loop. In single-frequency mode, the minor loop of our improved multiscale algorithm is over an order of magnitude faster than the casa multiscale algorithm, and produces results of similar quality. For multifrequency deconvolution, a technique named joined-channel cleaning is used. In this mode, the minor loop of our algorithm is two to three orders of magnitude faster than casa msmfs. We extend the multiscale mode with automated scale-dependent masking, which allows structures to be cleaned below the noise. We describe a new scale-bias function for use in multiscale cleaning. We test a second deconvolution method that is a variant of the moresane deconvolution technique, and uses a convex optimization technique with isotropic undecimated wavelets as dictionary. On simple well-calibrated data, the convex optimization algorithm produces visually more representative models. On complex or imperfect data, the convex optimization algorithm has stability issues.

Cavity Versus Ligand Shape Descriptors: Application to Urokinase Binding Pockets.

PubMed

Cerisier, Natacha; Regad, Leslie; Triki, Dhoha; Camproux, Anne-Claude; Petitjean, Michel

2017-11-01

We analyzed 78 binding pockets of the human urokinase plasminogen activator (uPA) catalytic domain extracted from a data set of crystallized uPA-ligand complexes. These binding pockets were computed with an original geometric method that does NOT involve any arbitrary parameter, such as cutoff distances, angles, and so on. We measured the deviation from convexity of each pocket shape with the pocket convexity index (PCI). We defined a new pocket descriptor called distributional sphericity coefficient (DISC), which indicates to which extent the protein atoms of a given pocket lie on the surface of a sphere. The DISC values were computed with the freeware PCI. The pocket descriptors and their high correspondences with ligand descriptors are crucial for polypharmacology prediction. We found that the protein heavy atoms lining the urokinases binding pockets are either located on the surface of their convex hull or lie close to this surface. We also found that the radii of the urokinases binding pockets and the radii of their ligands are highly correlated (r = 0.9).

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

NASA Astrophysics Data System (ADS)

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.

Nanoantennas for enhancing and confining the magnetic optical field

NASA Astrophysics Data System (ADS)

Grosjean, Thierry; Mivelle, Mathieu; Baida, Fadi I.; Burr, Geoffrey W.; Fischer, Ulrich C.

2011-05-01

We propose different optical antenna structures for enhancing and confining the magnetic optical field. A common feature of these structures are concave corners in thin metal films as locations of the enhanced magnetic field. This proposal is inspired by Babinet's principle as the concave edges are the complementary structures to convex metal corners, which are known to be locations of a strongly enhanced electric field. Bowtie antennas and the bowtie apertures of appropriate size were shown to exhibit resonances in the infrared frequency range with an especially strong enhancement of the electrical field in the gap between 2 convex metal corners. We show by numerical calculations, that the complementary structures, the complementary bowtie aperture - the diabolo antenna - and the complementary bow tie antenna - two closely spaced triangular apertures in a metal film with a narrow gap between two opposing concave corners - exhibit resonances with a strongly enhanced magnetic field at the narrow metal constriction between the concave corners. We suggest sub-wavelength circuits of concave and convex corners as building blocks of planar metamaterials.

Thermodynamics of water structural reorganization due to geometric confinement

NASA Astrophysics Data System (ADS)

Stroberg, Wylie; Lichter, Seth

2015-03-01

Models of aqueous solvation have successfully quantified the behavior of water near convex bodies. However, many important processes occurring in aqueous solution involve interactions between solutes and surfaces with complicated non-convex geometries. Examples include the folding of proteins, hydrophobic association of solutes, ligand-receptor binding, and water confined within nanotubes and pores. For these geometries, models for solvation of convex bodies fail to account for the added interactions associated with structural confinement. Due to water's propensity to form networks of hydrogen bonds, small alterations to the confining geometry can induce large structural rearrangement within the water. We perform systematic Monte Carlo simulations of water confined to cylindrical cavities of varying aspect ratio to investigate how small geometric changes to the confining geometry may cause large changes to the structure and thermodynamic state of water. Using the Wang-Landau algorithm, we obtain free energies, enthalpies, entropies, and heat capacities across a broad range of temperatures, and show how these quantities are influenced by the structural rearrangement of water molecules due to geometric perturbations.

Experimental investigation on in-plane/out-of-plane vortex-induced vibrations of curved cylinder in parallel and perpendicular flows

NASA Astrophysics Data System (ADS)

Srinil, Narakorn; Ma, Bowen; Zhang, Licong

2018-05-01

This study is motivated by an industrial need to better understand the vortex-induced vibration (VIV) of a curved structure subject to current flows with varying directions whose data for model calibration and validation are lacking. In this paper, new experimental investigations on the two-degree-of-freedom in-plane/out-of-plane VIV of a rigid curved circular cylinder immersed in steady and uniform free-stream flows are presented. The principal objective is to examine how the approaching flow direction versus the cylinder curvature plane affects cross-flow and in-line VIV and the associated hydrodynamic properties. This is achieved by testing the curved cylinder in 3 different flow orientations comprising the parallel flows aligned with the curvature vertical plane in convex and concave configurations, and the flows perpendicular to the curvature plane. The case of varying flow velocities in a subcritical flow range with a maximum Reynolds number of about 50,000 is considered for the curved cylinder with a low mass ratio and damping ratio. Experimental results are presented and discussed in terms of the cylinder response amplitudes, inclination angles, mean displacements, motion trajectories, oscillation frequencies, hydrodynamic forces, relative phases, fluid excitation and added inertia coefficients. Comparisons with other experimental results of curved and straight cylinder VIV are also presented. The experiments highlight the important effects of cylinder curvature versus flow orientation on the combined cross-flow/in-line VIV. The maximum (minimum) responses occur in the perpendicular (convex) flow case whereas the extended lower-branch responses occur in the concave flow case. For perpendicular flows, some meaningful features are observed, including the appearances of cross-flow mean displacements and asymmetric eight-shaped motion trajectories due to multiple 2:1:1 resonances where two out-of-plane and one in-plane dominant frequencies are simultaneously excited. Overall VIV phenomena caused by the system asymmetry should be recognised in a prediction model and design codes to capture the combined effects of curved configuration and approaching flow direction.

Constrained spacecraft reorientation using mixed integer convex programming

NASA Astrophysics Data System (ADS)

Tam, Margaret; Glenn Lightsey, E.

2016-10-01

A constrained attitude guidance (CAG) system is developed using convex optimization to autonomously achieve spacecraft pointing objectives while meeting the constraints imposed by on-board hardware. These constraints include bounds on the control input and slew rate, as well as pointing constraints imposed by the sensors. The pointing constraints consist of inclusion and exclusion cones that dictate permissible orientations of the spacecraft in order to keep objects in or out of the field of view of the sensors. The optimization scheme drives a body vector towards a target inertial vector along a trajectory that consists solely of permissible orientations in order to achieve the desired attitude for a given mission mode. The non-convex rotational kinematics are handled by discretization, which also ensures that the quaternion stays unity norm. In order to guarantee an admissible path, the pointing constraints are relaxed. Depending on how strict the pointing constraints are, the degree of relaxation is tuneable. The use of binary variables permits the inclusion of logical expressions in the pointing constraints in the case that a set of sensors has redundancies. The resulting mixed integer convex programming (MICP) formulation generates a steering law that can be easily integrated into an attitude determination and control (ADC) system. A sample simulation of the system is performed for the Bevo-2 satellite, including disturbance torques and actuator dynamics which are not modeled by the controller. Simulation results demonstrate the robustness of the system to disturbances while meeting the mission requirements with desirable performance characteristics.

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

PubMed Central

Schein, Stan; Gayed, James Maurice

2014-01-01

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. PMID:24516137

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

PubMed

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.

Hard convex lens-shaped particles: Densest-known packings and phase behavior

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cinacchi, Giorgio, E-mail: giorgio.cinacchi@uam.es; Torquato, Salvatore, E-mail: torquato@princeton.edu

2015-12-14

By using theoretical methods and Monte Carlo simulations, this work investigates dense ordered packings and equilibrium phase behavior (from the low-density isotropic fluid regime to the high-density crystalline solid regime) of monodisperse systems of hard convex lens-shaped particles as defined by the volume common to two intersecting congruent spheres. We show that, while the overall similarity of their shape to that of hard oblate ellipsoids is reflected in a qualitatively similar phase diagram, differences are more pronounced in the high-density crystal phase up to the densest-known packings determined here. In contrast to those non-(Bravais)-lattice two-particle basis crystals that are themore » densest-known packings of hard (oblate) ellipsoids, hard convex lens-shaped particles pack more densely in two types of degenerate crystalline structures: (i) non-(Bravais)-lattice two-particle basis body-centered-orthorhombic-like crystals and (ii) (Bravais) lattice monoclinic crystals. By stacking at will, regularly or irregularly, laminae of these two crystals, infinitely degenerate, generally non-periodic in the stacking direction, dense packings can be constructed that are consistent with recent organizing principles. While deferring the assessment of which of these dense ordered structures is thermodynamically stable in the high-density crystalline solid regime, the degeneracy of their densest-known packings strongly suggests that colloidal convex lens-shaped particles could be better glass formers than colloidal spheres because of the additional rotational degrees of freedom.« less

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

PubMed

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.

Non-convex optimization for self-calibration of direction-dependent effects in radio interferometric imaging

NASA Astrophysics Data System (ADS)

Repetti, Audrey; Birdi, Jasleen; Dabbech, Arwa; Wiaux, Yves

2017-10-01

Radio interferometric imaging aims to estimate an unknown sky intensity image from degraded observations, acquired through an antenna array. In the theoretical case of a perfectly calibrated array, it has been shown that solving the corresponding imaging problem by iterative algorithms based on convex optimization and compressive sensing theory can be competitive with classical algorithms such as clean. However, in practice, antenna-based gains are unknown and have to be calibrated. Future radio telescopes, such as the Square Kilometre Array, aim at improving imaging resolution and sensitivity by orders of magnitude. At this precision level, the direction-dependency of the gains must be accounted for, and radio interferometric imaging can be understood as a blind deconvolution problem. In this context, the underlying minimization problem is non-convex, and adapted techniques have to be designed. In this work, leveraging recent developments in non-convex optimization, we propose the first joint calibration and imaging method in radio interferometry, with proven convergence guarantees. Our approach, based on a block-coordinate forward-backward algorithm, jointly accounts for visibilities and suitable priors on both the image and the direction-dependent effects (DDEs). As demonstrated in recent works, sparsity remains the prior of choice for the image, while DDEs are modelled as smooth functions of the sky, I.e. spatially band-limited. Finally, we show through simulations the efficiency of our method, for the reconstruction of both images of point sources and complex extended sources. matlab code is available on GitHub.

A new corrective technique for adolescent idiopathic scoliosis: convex manipulation using 6.35 mm diameter pure titanium rod followed by concave fixation using 6.35 mm diameter titanium alloy

PubMed Central

2015-01-01

Background It has been thought that corrective posterior surgery for adolescent idiopathic scoliosis (AIS) should be started on the concave side because initial convex manipulation would increase the risk of vertebral malrotation, worsening the rib hump. With the many new materials, implants, and manipulation techniques (e.g., direct vertebral rotation) now available, we hypothesized that manipulating the convex side first is no longer taboo. Methods Our technique has two major facets. (1) Curve correction is started from the convex side with a derotation maneuver and in situ bending followed by concave rod application. (2) A 6.35 mm diameter pure titanium rod is used on the convex side and a 6.35 mm diameter titanium alloy rod on the concave side. Altogether, 52 patients were divided into two groups. Group N included 40 patients (3 male, 37 female; average age 15.9 years) of Lenke type 1 (23 patients), type 2 (2), type 3 (3), type 5 (10), type 6 (2). They were treated with a new technique using 6.35 mm diameter different-stiffness titanium rods. Group C included 12 patients (all female, average age 18.8 years) of Lenke type 1 (6 patients), type 2 (3), type 3 (1), type 5 (1), type 6 (1). They were treated with conventional methods using 5.5 mm diameter titanium alloy rods. Radiographic parameters (Cobb angle/thoracic kyphosis/correction rates) and perioperative data were retrospectively collected and analyzed. Results Preoperative main Cobb angles (groups N/C) were 56.8°/60.0°, which had improved to 15.2°/17.1° at the latest follow-up. Thoracic kyphosis increased from 16.8° to 21.3° in group N and from 16.0° to 23.4° in group C. Correction rates were 73.2% in group N and 71.7% in group C. There were no significant differences for either parameter. Mean operating time, however, was significantly shorter in group N (364 min) than in group C (456 min). Conclusion We developed a new corrective surgical technique for AIS using a 6.35 mm diameter pure titanium rod initially on the convex side. Correction rates in the coronal, sagittal, and axial planes were the same as those achieved with conventional methods, but the operation time was significantly shorter. PMID:25815053

Living on the Edge: A Geometric Theory of Phase Transitions in Convex Optimization

DTIC Science & Technology

2013-03-24

framework for constructing a regularizer f that promotes a specified type of structure, as well as many additional examples. We say that the...Rd that promote the structures we expect to find in x0 8 D. AMELUNXEN, M. LOTZ, M. B. MCCOY, AND J. A. TROPP and y0. Then we can frame the convex...signal x0 is sparse in the standard basis, and the second signal U y0 is sparse in a known basis U . In this case, we can use `1 norms to promote

Robust Controller Design: Minimizing Peak-to-Peak Gain

DTIC Science & Technology

1992-09-01

hold, i.e., that p(M) > 1. The Perron - Frobenius theory for nonnegative matrices states that p(M) is itself an eigenvalue of M. Moreover, associated...vector space. A convex cone P is a convex set such that if x E P then ax E P for all real ac > 0. Given such P, it is possible to define an ordering...relation on X as follows: x > y if and only if x - y E P. Then it is natural to define a dual cone P* (with an abuse of notation) inside X* in the

Computed tomography of the azygo-oesophageal recess. Normal appearances.

PubMed

Lund, G; Lien, H H

1982-01-01

Computed tomography of the azygo--oesophageal recess was performed in 85 normal subjects. The recess was convex towards the left or had an approximately straight left wall. Convexity towards the right did not occur. Localized bulges caused by the azygos vein, oesophagus and aorta were frequent. The recess became gradually deeper caudally in patients below 50 years of age. Above that age a marked posterior extension of the heart and a prevertebral position of the aorta often caused a localized shallowing at the level of the inferior pulmonary veins or the ventricles.