Statistical Mechanics of Optimal Convex Inference in High Dimensions
Directory of Open Access Journals (Sweden)
Madhu Advani
2016-08-01
Full Text Available A fundamental problem in modern high-dimensional data analysis involves efficiently inferring a set of P unknown model parameters governing the relationship between the inputs and outputs of N noisy measurements. Various methods have been proposed to regress the outputs against the inputs to recover the P parameters. What are fundamental limits on the accuracy of regression, given finite signal-to-noise ratios, limited measurements, prior information, and computational tractability requirements? How can we optimally combine prior information with measurements to achieve these limits? Classical statistics gives incisive answers to these questions as the measurement density α=(N/P→∞. However, these classical results are not relevant to modern high-dimensional inference problems, which instead occur at finite α. We employ replica theory to answer these questions for a class of inference algorithms, known in the statistics literature as M-estimators. These algorithms attempt to recover the P model parameters by solving an optimization problem involving minimizing the sum of a loss function that penalizes deviations between the data and model predictions, and a regularizer that leverages prior information about model parameters. Widely cherished algorithms like maximum likelihood (ML and maximum-a posteriori (MAP inference arise as special cases of M-estimators. Our analysis uncovers fundamental limits on the inference accuracy of a subclass of M-estimators corresponding to computationally tractable convex optimization problems. These limits generalize classical statistical theorems like the Cramer-Rao bound to the high-dimensional setting with prior information. We further discover the optimal M-estimator for log-concave signal and noise distributions; we demonstrate that it can achieve our high-dimensional limits on inference accuracy, while ML and MAP cannot. Intriguingly, in high dimensions, these optimal algorithms become computationally
High-Dimensional Analysis of Convex Optimization-Based Massive MIMO Decoders
Ben Atitallah, Ismail
2017-04-01
A wide range of modern large-scale systems relies on recovering a signal from noisy linear measurements. In many applications, the useful signal has inherent properties, such as sparsity, low-rankness, or boundedness, and making use of these properties and structures allow a more efficient recovery. Hence, a significant amount of work has been dedicated to developing and analyzing algorithms that can take advantage of the signal structure. Especially, since the advent of Compressed Sensing (CS) there has been significant progress towards this direction. Generally speaking, the signal structure can be harnessed by solving an appropriate regularized or constrained M-estimator. In modern Multi-input Multi-output (MIMO) communication systems, all transmitted signals are drawn from finite constellations and are thus bounded. Besides, most recent modulation schemes such as Generalized Space Shift Keying (GSSK) or Generalized Spatial Modulation (GSM) yield signals that are inherently sparse. In the recovery procedure, boundedness and sparsity can be promoted by using the ℓ1 norm regularization and by imposing an ℓ∞ norm constraint respectively. In this thesis, we propose novel optimization algorithms to recover certain classes of structured signals with emphasis on MIMO communication systems. The exact analysis permits a clear characterization of how well these systems perform. Also, it allows an automatic tuning of the parameters. In each context, we define the appropriate performance metrics and we analyze them exactly in the High Dimentional Regime (HDR). The framework we use for the analysis is based on Gaussian process inequalities; in particular, on a new strong and tight version of a classical comparison inequality (due to Gordon, 1988) in the presence of additional convexity assumptions. The new framework that emerged from this inequality is coined as Convex Gaussian Min-max Theorem (CGMT).
DEFF Research Database (Denmark)
M. Gaspar, Raquel; Murgoci, Agatha
2010-01-01
A convexity adjustment (or convexity correction) in fixed income markets arises when one uses prices of standard (plain vanilla) products plus an adjustment to price nonstandard products. We explain the basic and appealing idea behind the use of convexity adjustments and focus on the situations...
Surface tension-induced high aspect-ratio PDMS micropillars with concave and convex lens tips
Li, Huawei
2013-04-01
This paper reports a novel method for the fabrication of 3-dimensional (3D) Polydimethylsiloxane (PDMS) micropillars with concave and convex lens tips in a one-step molding process, using a CO2 laser-machined Poly(methyl methacrylate) (PMMA) mold with through holes. The PDMS micropillars are 4 mm high and have an aspect ratio of 251. The micropillars are formed by capillary force drawing up PDMS into the through hole mold. The concave and convex lens tips of the PDMS cylindrical micropillars are induced by surface tension and are controllable by changing the surface wetting properties of the through holes in the PMMA mold. This technique eliminates the requirements of expensive and complicated facilities to prepare a 3D mold, and it provides a simple and rapid method to fabricate 3D PDMS micropillars with controllable dimensions and tip shapes. © 2013 IEEE.
DEFF Research Database (Denmark)
Lauritzen, Niels
Based on undergraduate teaching to students in computer science, economics and mathematics at Aarhus University, this is an elementary introduction to convex sets and convex functions with emphasis on concrete computations and examples. Starting from linear inequalities and Fourier-Motzkin elimin......Based on undergraduate teaching to students in computer science, economics and mathematics at Aarhus University, this is an elementary introduction to convex sets and convex functions with emphasis on concrete computations and examples. Starting from linear inequalities and Fourier......-Motzkin elimination, the theory is developed by introducing polyhedra, the double description method and the simplex algorithm, closed convex subsets, convex functions of one and several variables ending with a chapter on convex optimization with the Karush-Kuhn-Tucker conditions, duality and an interior point...... algorithm....
DEFF Research Database (Denmark)
Huang, Shaojun; Wu, Qiuwei; Zhao, Haoran
2016-01-01
in the applications such as curtailment management and reactive power control. Nonconvex nature of the OPF makes it difficult to solve and convex relaxation is a promising method to solve the OPF very efficiently. This paper investigates the geometry of the power flows and the convex-relaxed power flows when high...... penetration level of renewables is present in the distribution networks. The geometry study helps understand the fundamental nature of the OPF and its convex-relaxed problem, such as the second-order cone programming (SOCP) problem. A case study based on a three-node system is used to illustrate the geometry...
Krantz, Steven G
2014-01-01
Why Convexity?Basic IdeasIntroductionThe Classical TheorySeparation TheoremsApproximationFunctionsDefining FunctionAnalytic DefinitionConvex FunctionsExhaustion FunctionsMore on FunctionsOther CharacterizationsConvexity of Finite OrderExtreme PointsSupport FunctionsApproximation from BelowBumpingApplicationsThe Krein-Milman TheoremThe Minkowski SumBrunn-MinkowskiMore Sophisticated IdeasThe Polar of a SetOptimizationIntroductory
Rockafellar, Ralph Tyrell
2015-01-01
Available for the first time in paperback, R. Tyrrell Rockafellar's classic study presents readers with a coherent branch of nonlinear mathematical analysis that is especially suited to the study of optimization problems. Rockafellar's theory differs from classical analysis in that differentiability assumptions are replaced by convexity assumptions. The topics treated in this volume include: systems of inequalities, the minimum or maximum of a convex function over a convex set, Lagrange multipliers, minimax theorems and duality, as well as basic results about the structure of convex sets and
DEFF Research Database (Denmark)
Lauritzen, Niels
Based on undergraduate teaching to students in computer science, economics and mathematics at Aarhus University, this is an elementary introduction to convex sets and convex functions with emphasis on concrete computations and examples. Starting from linear inequalities and Fourier-Motzkin elimin...
Busemann, Herbert
2008-01-01
This exploration of convex surfaces focuses on extrinsic geometry and applications of the Brunn-Minkowski theory. It also examines intrinsic geometry and the realization of intrinsic metrics. 1958 edition.
Klee, Victor; Ziegler, Günter
2003-01-01
"The appearance of Grünbaum's book Convex Polytopes in 1967 was a moment of grace to geometers and combinatorialists. The special spirit of the book is very much alive even in those chapters where the book's immense influence made them quickly obsolete. Some other chapters promise beautiful unexplored land for future research. The appearance of the new edition is going to be another moment of grace. Kaibel, Klee and Ziegler were able to update the convex polytope saga in a clear, accurate, lively, and inspired way." (Gil Kalai, The Hebrew University of Jerusalem) "The original book of Grünbaum has provided the central reference for work in this active area of mathematics for the past 35 years...I first consulted this book as a graduate student in 1967; yet, even today, I am surprised again and again by what I find there. It is an amazingly complete reference for work on this subject up to that time and continues to be a major influence on research to this day." (Louis J. Billera, Cornell University) "The or...
Highly efficient absorption of visible and near infrared light in convex gold and nickel grooves
DEFF Research Database (Denmark)
Eriksen, René Lynge; Beermann, Jonas; Søndergaard, Thomas
The realization of nonresonant light absorption with nanostructured metal surfaces by making practical use of nanofocusing optical energy in tapered plasmonic waveguides, is of one of the most fascinating and fundamental phenomena in plasmonics [1,2]. We recently realized broadband light absorption...... in gold via adiabatic nanofocusing of gap surface plasmon modes in well-defined geometries of ultra-sharp convex grooves and being excited by scattering off subwavelength-sized wedges [3]....
International Nuclear Information System (INIS)
Sasaki, Makoto; Honda, Satoshi; Yuasa, Tatsuhiko; Iwamura, Akihide; Shibata, Eri; Ohba, Hideki
2008-01-01
The aim of this study was to determine the performance of axial and coronal magnetic resonance imaging (MRI) in detecting the narrowing of the cerebrospinal fluid (CSF) space at the high convexity and high midline areas, which is speculated to be one of the clinical characteristics of idiopathic normal pressure hydrocephalus (iNPH). We retrospectively examined axial and coronal T1-weighted images of 14 iNPH patients and 12 age-matched controls. The narrowness of the CSF space at the high convexity/midline was blindly evaluated by five raters using a continuous confidence rating scale for receiver operating characteristic (ROC) analysis. Axial and coronal imaging accurately determined the presence of the narrow cisterns/sulci at the high convexity/midline and was capable of predicting probable/definite iNPH with a high degree of accuracy. there were also no significant differences in the detection of this finding between the axial and coronal images. Both axial and coronal T1-weighted MRI can detect the narrow CSF space at the high convexity/midline accurately and may therefore facilitate clinicians in choosing a management strategy for iNPH patients. (orig.)
Energy Technology Data Exchange (ETDEWEB)
Sasaki, Makoto [Iwate Medical University, Department of Radiology, Morioka (Japan); Honda, Satoshi [St. Luke' s International Hospital, Department of Radiology, Tokyo (Japan); Yuasa, Tatsuhiko; Iwamura, Akihide [Kohnodai Hospital, National Center of Neurology and Psychiatry, Department of Neurology, Ichikawa (Japan); Shibata, Eri [Iwate Medical University, Department of Neuropsychiatry, Morioka (Japan); Ohba, Hideki [Iwate Medical University, Department of Neurology, Morioka (Japan)
2008-02-15
The aim of this study was to determine the performance of axial and coronal magnetic resonance imaging (MRI) in detecting the narrowing of the cerebrospinal fluid (CSF) space at the high convexity and high midline areas, which is speculated to be one of the clinical characteristics of idiopathic normal pressure hydrocephalus (iNPH). We retrospectively examined axial and coronal T1-weighted images of 14 iNPH patients and 12 age-matched controls. The narrowness of the CSF space at the high convexity/midline was blindly evaluated by five raters using a continuous confidence rating scale for receiver operating characteristic (ROC) analysis. Axial and coronal imaging accurately determined the presence of the narrow cisterns/sulci at the high convexity/midline and was capable of predicting probable/definite iNPH with a high degree of accuracy. there were also no significant differences in the detection of this finding between the axial and coronal images. Both axial and coronal T1-weighted MRI can detect the narrow CSF space at the high convexity/midline accurately and may therefore facilitate clinicians in choosing a management strategy for iNPH patients. (orig.)
On Convex Quadratic Approximation
den Hertog, D.; de Klerk, E.; Roos, J.
2000-01-01
In this paper we prove the counterintuitive result that the quadratic least squares approximation of a multivariate convex function in a finite set of points is not necessarily convex, even though it is convex for a univariate convex function. This result has many consequences both for the field of
Minimum convex partitions and maximum empty polytopes
Directory of Open Access Journals (Sweden)
Adrian Dumitrescu
2014-05-01
Full Text Available Let S be a set of n points in Rd. A Steiner convex partition is a tiling of conv(S with empty convex bodies. For every integer d, we show that S admits a Steiner convex partition with at most ⌈(n-1/d⌉ tiles. This bound is the best possible for points in general position in the plane, and it is the best possible apart from constant factors in every fixed dimension d≥3. We also give the first constant-factor approximation algorithm for computing a minimum Steiner convex partition of a planar point set in general position.Establishing a tight lower bound for the maximum volume of a tile in a Steiner convex partition of any n points in the unit cube is equivalent to a famous problem of Danzer and Rogers. It is conjectured that the volume of the largest tile is ω(1/n. Here we give a (1-\\epsilon-approximation algorithm for computing the maximum volume of an empty convex body amidst n given points in the d-dimensional unit box [0,1]d.
Bornological Locally Convex Cones
Directory of Open Access Journals (Sweden)
Davood Ayaseh
2014-10-01
Full Text Available In this paper we define bornological and b-bornological cones and investigate their properties. We give some characterization for these cones. In the special case of locally convex topological vector space both these concepts reduce to the known concept of bornological spaces. We introduce and investigate the convex quasiuniform structures U_{tau}, U_{sigma}(P,P* and \\U_{beta}(P,P* on locally convex cone (P,U.
van de Vel, MLJ
1993-01-01
Presented in this monograph is the current state-of-the-art in the theory of convex structures. The notion of convexity covered here is considerably broader than the classic one; specifically, it is not restricted to the context of vector spaces. Classical concepts of order-convex sets (Birkhoff) and of geodesically convex sets (Menger) are directly inspired by intuition; they go back to the first half of this century. An axiomatic approach started to develop in the early Fifties. The author became attracted to it in the mid-Seventies, resulting in the present volume, in which graphs appear si
Colesanti, Andrea; Gronchi, Paolo
2018-01-01
This book presents the proceedings of the international conference Analytic Aspects in Convexity, which was held in Rome in October 2016. It offers a collection of selected articles, written by some of the world’s leading experts in the field of Convex Geometry, on recent developments in this area: theory of valuations; geometric inequalities; affine geometry; and curvature measures. The book will be of interest to a broad readership, from those involved in Convex Geometry, to those focusing on Functional Analysis, Harmonic Analysis, Differential Geometry, or PDEs. The book is a addressed to PhD students and researchers, interested in Convex Geometry and its links to analysis.
Convex Congestion Network Problems
Quant, M.; Reijnierse, J.H.
2004-01-01
This paper analyzes convex congestion network problems.It is shown that for network problems with convex congestion costs, an algorithm based on a shortest path algorithm, can be used to find an optimal network for any coalition. Furthermore an easy way of determining if a given network is optimal
Alparslan-Gok, S.Z.; Brânzei, R.; Tijs, S.H.
2008-01-01
In this paper, convex interval games are introduced and some characterizations are given. Some economic situations leading to convex interval games are discussed. The Weber set and the Shapley value are defined for a suitable class of interval games and their relations with the interval core for
Stereotype locally convex spaces
Energy Technology Data Exchange (ETDEWEB)
Akbarov, S S
2000-08-31
We give complete proofs of some previously announced results in the theory of stereotype (that is, reflexive in the sense of Pontryagin duality) locally convex spaces. These spaces have important applications in topological algebra and functional analysis.
Stereotype locally convex spaces
Akbarov, S. S.
2000-08-01
We give complete proofs of some previously announced results in the theory of stereotype (that is, reflexive in the sense of Pontryagin duality) locally convex spaces. These spaces have important applications in topological algebra and functional analysis.
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
Fredlund, Jennifer; Santos, José Carlos; Stévenin, Virginie; Weiner, Allon; Latour-Lambert, Patricia; Rechav, Katya; Mallet, Adeline; Krijnse-Locker, Jacomine; Elbaum, Michael; Enninga, Jost
2018-04-01
Salmonella enterica induces membrane ruffling and genesis of macropinosomes during its interactions with epithelial cells. This is achieved through the type three secretion system-1, which first mediates bacterial attachment to host cells and then injects bacterial effector proteins to alter host behaviour. Next, Salmonella enters into the targeted cell within an early membrane-bound compartment that matures into a slow growing, replicative niche called the Salmonella Containing Vacuole (SCV). Alternatively, the pathogen disrupts the membrane of the early compartment and replicate at high rate in the cytosol. Here, we show that the in situ formed macropinosomes, which have been previously postulated to be relevant for the step of Salmonella entry, are key contributors for the formation of the mature intracellular niche of Salmonella. We first clarify the primary mode of type three secretion system-1 induced Salmonella entry into epithelial cells by combining classical fluorescent microscopy with cutting edge large volume electron microscopy. We observed that Salmonella, similarly to Shigella, enters epithelial cells inside tight vacuoles rather than in large macropinosomes. We next apply this technology to visualise rupturing Salmonella containing compartments, and we use extended time-lapse microscopy to establish early markers that define which Salmonella will eventually hyper replicate. We show that at later infection stages, SCVs harbouring replicating Salmonella have previously fused with the in situ formed macropinosomes. In contrast, such fusion events could not be observed for hyper-replicating Salmonella, suggesting that fusion of the Salmonella entry compartment with macropinosomes is the first committed step of SCV formation. © 2017 John Wiley & Sons Ltd.
Directory of Open Access Journals (Sweden)
Mazzone G
2016-09-01
Full Text Available Background: Recent evidence indicates that gut microbiota plays a key role in the development of NAFLD through the gut-liver axis. An altered gut permeability induced by alterations of tight junction (TJ proteins allows the passage of bacteria and substances leading to liver inflammation, hepatocyte damage and fibrosis. This study aims to evaluate the influence of decaffeinated coffee on gut permeability in a rat model of fat liver damage induced by a high fat diet (HFD. Methods: Twelve male Wistar rats were assigned to 3 groups. The first group received HFD for 5 months and drank water. The second group received HFD for 5 months and drank water added with 1.2mL decaffeinated coffee/day starting from the 4th month. The third group received standard diet (SD and drank water. Protein and mRNA expression levels of Toll-Like Receptor- 4 (TLR-4, Occludin and Zonula occludens-1 (ZO-1 were assessed in rat intestines. Results: A significant reduction of Occludin and ZO-1 was observed in HFD fed rats (0.97±0.05 vs 0.15±0.08 p˂0.01, and 0.97±0.05 vs 0.57±0.14 p˂0.001 respectively. This reduction was reverted in HFD+COFFEE rats (0.15±0.08 vs 0.83±0.27 p˂0.01 and 0.57±0.14 vs 0.85±0.12 p˂0.01 respectively. The TLR-4 expression up-regulated by HFD was partially reduced by coffee administration. Conclusions: HFD impairs the intestinal TJ barrier integrity. Coffee increases the expression of TJ proteins, reverting the altered gut permeability and reducing TLR-4 expression.
Statistical properties of convex clustering
Tan, Kean Ming; Witten, Daniela
2015-01-01
In this manuscript, we study the statistical properties of convex clustering. We establish that convex clustering is closely related to single linkage hierarchical clustering and $k$-means clustering. In addition, we derive the range of the tuning parameter for convex clustering that yields a non-trivial solution. We also provide an unbiased estimator of the degrees of freedom, and provide a finite sample bound for the prediction error for convex clustering. We compare convex clustering to so...
Czech Academy of Sciences Publication Activity Database
Moltó, A.; Orihuela, J.; Troyanski, S.; Zizler, Václav
2007-01-01
Roč. 75, č. 3 (2007), s. 647-658 ISSN 0024-6107 R&D Projects: GA AV ČR IAA100190502 Institutional research plan: CEZ:AV0Z10190503 Keywords : strictly convex norms * lattice norm * quasi-diagonal sets Subject RIV: BA - General Mathematics Impact factor: 0.733, year: 2007
DEFF Research Database (Denmark)
Brodal, Gerth Stølfting; Jacob, Rico
2002-01-01
In this paper we determine the computational complexity of the dynamic convex hull problem in the planar case. We present a data structure that maintains a finite set of n points in the plane under insertion and deletion of points in amortized O(log n) time per operation. The space usage of the d...
Directory of Open Access Journals (Sweden)
Roger Koenker
2014-09-01
Full Text Available Convex optimization now plays an essential role in many facets of statistics. We briefly survey some recent developments and describe some implementations of these methods in R . Applications of linear and quadratic programming are introduced including quantile regression, the Huber M-estimator and various penalized regression methods. Applications to additively separable convex problems subject to linear equality and inequality constraints such as nonparametric density estimation and maximum likelihood estimation of general nonparametric mixture models are described, as are several cone programming problems. We focus throughout primarily on implementations in the R environment that rely on solution methods linked to R, like MOSEK by the package Rmosek. Code is provided in R to illustrate several of these problems. Other applications are available in the R package REBayes, dealing with empirical Bayes estimation of nonparametric mixture models.
Indian Academy of Sciences (India)
A subset C of an arbitrary vector space. V is called convex .... C c IR n is the set of those points X E IRn for which it is possible to find a sequence {Xk : k = 1, 2 } in C which converges to X (meaning that limk_oo Ilxk - xii = 0).) (3) Prove that if S ..... subject of linear programming which deals with extrema of linear forms subject to.
Czech Academy of Sciences Publication Activity Database
Hrubeš, P.; Jukna, S.; Kulikov, A.; Pudlák, Pavel
2010-01-01
Roč. 411, 16-18 (2010), s. 1842-1854 ISSN 0304-3975 R&D Projects: GA AV ČR IAA1019401 Institutional research plan: CEZ:AV0Z10190503 Keywords : boolean formula * complexity measure * combinatorial rectangle * convexity Subject RIV: BA - General Mathematics Impact factor: 0.838, year: 2010 http://www.sciencedirect.com/science/article/pii/S0304397510000885
2010-12-02
evaluating the function ΘP (A) for any fixed A,P is equivalent to solving the so-called Quadratic Assignment Problem ( QAP ), and thus we can employ various...tractable linear programming, spectral, and SDP relaxations of QAP [40, 11, 33]. In particular we discuss recent work [14] on exploiting group...symmetry in SDP relaxations of QAP , which is useful for approximately computing elementary convex graph invariants in many interesting cases. Finally in
Anaïs Schaeffer
2012-01-01
The Italian National Institute for Nuclear Physics (INFN) has successfully tested the first model of a new fast-ramping curved dipole magnet. This is great news for CERN, which sees the advance as holding potential for the future of the SPS. The first model of a new fast-ramping curved dipole magnet being prepared for cryogenic testing at the LASA laboratory (INFN Milano, Italy). On 16 July INFN introduced an innovative dipole magnet. With a length of some 4 metres, it can produce a 4.5 Tesla magnetic field and achieve a tighter bend than ever before (the bending radius has been squeezed to a remarkable 66.7 metres). This new magnet was designed in the first instance for GSI’s SIS300 synchrotron (in Germany), which will require 60 dipoles of this type. "Achieving such a tight bend demanded a major R&D effort," stressed Pasquale Fabbricatore, the spokesman of the INFN collaboration responsible for the magnet’s development. "We had to not o...
A tightly-coupled domain-decomposition approach for highly nonlinear stochastic multiphysics systems
Taverniers, Søren; Tartakovsky, Daniel M.
2017-02-01
Multiphysics simulations often involve nonlinear components that are driven by internally generated or externally imposed random fluctuations. When used with a domain-decomposition (DD) algorithm, such components have to be coupled in a way that both accurately propagates the noise between the subdomains and lends itself to a stable and cost-effective temporal integration. We develop a conservative DD approach in which tight coupling is obtained by using a Jacobian-free Newton-Krylov (JfNK) method with a generalized minimum residual iterative linear solver. This strategy is tested on a coupled nonlinear diffusion system forced by a truncated Gaussian noise at the boundary. Enforcement of path-wise continuity of the state variable and its flux, as opposed to continuity in the mean, at interfaces between subdomains enables the DD algorithm to correctly propagate boundary fluctuations throughout the computational domain. Reliance on a single Newton iteration (explicit coupling), rather than on the fully converged JfNK (implicit) coupling, may increase the solution error by an order of magnitude. Increase in communication frequency between the DD components reduces the explicit coupling's error, but makes it less efficient than the implicit coupling at comparable error levels for all noise strengths considered. Finally, the DD algorithm with the implicit JfNK coupling resolves temporally-correlated fluctuations of the boundary noise when the correlation time of the latter exceeds some multiple of an appropriately defined characteristic diffusion time.
CVXPY: A Python-Embedded Modeling Language for Convex Optimization.
Diamond, Steven; Boyd, Stephen
2016-04-01
CVXPY is a domain-specific language for convex optimization embedded in Python. It allows the user to express convex optimization problems in a natural syntax that follows the math, rather than in the restrictive standard form required by solvers. CVXPY makes it easy to combine convex optimization with high-level features of Python such as parallelism and object-oriented design. CVXPY is available at http://www.cvxpy.org/ under the GPL license, along with documentation and examples.
Subordination by convex functions
Directory of Open Access Journals (Sweden)
Rosihan M. Ali
2006-01-01
Full Text Available For a fixed analytic function g(z=z+∑n=2∞gnzn defined on the open unit disk and γ<1, let Tg(γ denote the class of all analytic functions f(z=z+∑n=2∞anzn satisfying ∑n=2∞|angn|≤1−γ. For functions in Tg(γ, a subordination result is derived involving the convolution with a normalized convex function. Our result includes as special cases several earlier works.
Fuzzy efficiency without convexity
DEFF Research Database (Denmark)
Hougaard, Jens Leth; Balezentis, Tomas
2014-01-01
In this paper we develop a fuzzy version of the crisp Free Disposal Hull (FDH) method for measuring technical efficiency for samples of similar production units. The FDH-method is basically Data Envelopment Analysis (DEA) without the underlying assumption of convexity of the technology set. Our...... approach builds directly upon the definition of Farrell's indexes of technical efficiency used in crisp FDH. Therefore we do not require the use of fuzzy programming techniques but only utilize ranking probabilities of intervals as well as a related definition of dominance between pairs of intervals. We...
Directory of Open Access Journals (Sweden)
Hui Chen
2017-07-01
Full Text Available Seismic time-frequency analysis methods can be used for hydrocarbon detection because of the phenomena of energy and abnormal attenuation of frequency when the seismic waves travel across reservoirs. A high-resolution method based on variational mode decomposition (VMD, continuous-wavelet transform (CWT and frequency-weighted energy operator (FWEO is proposed for hydrocarbon detection in tight sandstone gas reservoirs. VMD can decompose seismic signals into a set of intrinsic mode functions (IMF in the frequency domain. In order to avoid meaningful frequency loss, the CWT method is used to obtain the time-frequency spectra of the selected IMFs. The energy separation algorithm based on FWEO can improve the resolution of time-frequency spectra and highlight abnormal energy, which is applied to track the instantaneous energy in the time-frequency spectra. The difference between the high-frequency section and low-frequency section acquired by applying the proposed method is utilized to detect hydrocarbons. Applications using the model and field data further demonstrate that the proposed method can effectively detect hydrocarbons in tight sandstone reservoirs, with good anti-noise performance. The newly-proposed method can be used as an analysis tool to detect hydrocarbons.
Convex probe endobronchial ultrasound.
Bade, Brett; Furukawa, Brian; Tanner, Nichole T
2014-12-01
Convex probe endobronchial ultrasound (EBUS) is a minimally invasive diagnostic technique that allows real-time sampling of mediastinal and hilar lymph nodes and central pulmonary lesions. Its utility in diagnosing both malignant and nonmalignant diseases has led to an increased uptake and use by pulmonologists over the past decade. Because of the robust evidence supporting its safety and diagnostic yield, EBUS is now the first guideline recommended test for staging in non-small cell lung cancer (NSCLC). It has also a role in providing tissue for molecular analysis, thereby guiding in the selection of agents in the new era of personalized chemotherapies in the treatment of NSCLC. The following review highlights the evidence for EBUS in diagnosing mediastinal pathology and addresses technique, training, and competency and future directions for this technology. Thieme Medical Publishers 333 Seventh Avenue, New York, NY 10001, USA.
Convex Games versus Clan Games
Brânzei, R.; Dimitrov, D.A.; Tijs, S.H.
2006-01-01
In this paper we provide characterizations of convex games and total clan games by using properties of their corresponding marginal games.We show that a "dualize and restrict" procedure transforms total clan games with zero worth for the clan into monotonic convex games.Furthermore, each monotonic
Convex games versus clan games
Brânzei, R.; Dimitrov, D.A.; Tijs, S.H.
2008-01-01
In this paper we provide characterizations of convex games and total clan games by using properties of their corresponding marginal games. We show that a "dualize and restrict" procedure transforms total clan games with zero worth for the clan into monotonic convex games. Furthermore, each monotonic
Emittance evolution of a tightly focused electron bunch with high energy spread
Rossi, A R
2011-01-01
The production of a self injected high energy electron beam from laser-plasma interaction is one of the goals at the LI2FE infrastructure at LNF. The formation and acceleration of a beam produced with the experimental setting available in Frascati has been simulated by C. Benedetti et al. by means of the code AlaDyn [1]; the results, shown in Figure 1, foresee that the bunch should have a total charge of about 3.5 nC, a transverse size of few microns and a very broad spectrum, ranging from a few MeV up to about 1 GeV, in agreement with other numerical and experimental results produced world wide. In particular, a neatly separated charge portion at high energy is present (Figure 2), whose main parameters are reported in Table 1, which constitutes the most interesting product of the plasma based accelerator.
Vital signs: oil supplies improving but natural gas tight enough to keep prices high
International Nuclear Information System (INIS)
Lunan, D.
2000-01-01
Canada's 1999 year-end oil reserves were boosted by 2.1 million barrels by the launch of new oil sands mining projects near Fort McMurray and revisions in two existing operations, offsetting a decline of 3.7 per cent in remaining conventional reserves. Total oil reserves at year end stood at some 11.9 billion barrels, up from 9.8 billion barrels a year earlier. Conventional crude reserves dropped to 4.37 billion barrels. Despite the decline, the Canadian Association of Petroleum Producers (CAPP) were encouraged by a 70 per cent replacement rate, on production of 441 million barrels of oil, despite low activity resulting from soft prices in early part of 1999. Production from offshore Newfoundland sites amounted to 38.6 million barrels; remaining reserves in the Hibernia and Terra Nova field are estimated at 868 million barrels. Meanwhile, natural gas reserves slipped by about a trillion cubic feet to about 61 trillion cubic feet, reflecting an 83 per cent replacement rate which, however, represented an improvement from 76 per cent in 1998. Reserves replacement in 2000 is expected to improve over 1999 due to improved prices resulting in increased activity in 2000 which is expected to continue into 2001. Despite improvements in replacement, consumers have much to worry about as far as further consumer price increases are concerned. The situation can be traced back to the summer 2000 storage injection period when supplies normally stored for use in the winter were sold instead, to take advantage of high prices. The injection for storage was reduced due largely to continued strong demand from the US electric power generating sector. This situation will continue, barring a dramatic softening of the US economy
Analyse convexe et quasi-convexe ; applications en optimisation
DANIILIDIS, Aris
2002-01-01
Rapporteurs : R. Deville (Bordeaux) D.T. Luc (Avignon) J.-E. Martinez-Legaz (Barcelone, Espagne) Examinateurs : J.-P. Crouzeix (Clermont-Ferrand) (President du jury) S. Gautier (Pau) N. Hadjisavvas (Samos, Grece) J.-P. Penot (Pau) L. Thibault (Montpellier); This document is a research contribution on Convex Analysis, on Generalized Convexity and on their applications in Optimization Theory. The first part deals with several fundamental questions concerning continuity, differentiability and cr...
The Convex Coordinates of the Symmedian Point
Boyd, J. N.; Raychowdhury, P. N.
2006-01-01
In this note, we recall the convex (or barycentric) coordinates of the points of a closed triangular region. We relate the convex and trilinear coordinates of the interior points of the triangular region. We use the relationship between convex and trilinear coordinates to calculate the convex coordinates of the symmedian point of the triangular…
A class of free locally convex spaces
International Nuclear Information System (INIS)
Sipacheva, O V
2003-01-01
Stratifiable spaces are a natural generalization of metrizable spaces for which Dugundji's theorem holds. It is proved that the free locally convex space of a stratifiable space is stratifiable. This means, in particular, that the space of finitely supported probability measures on a stratifiable space is a retract of a locally convex space, and that each stratifiable convex subset of a locally convex space is a retract of a locally convex space
Final Technical Report Radiation Hard Tight Pitch GaInP SPAD Arrays for High Energy Physics
Energy Technology Data Exchange (ETDEWEB)
Harmon, Eric
2018-01-26
The specialized photodetectors used in high energy physics experiments often need to remain extremely sensitive for years despite radiation induced damage caused by the constant bombardment of high energy particles. To solve this problem, LightSpin Technologies, Inc. in collaboration with Prof. Bradley Cox and the University of Virginia is developing radiation-hard GaInP photodetectors which are projected to be extraordinarily radiation hard, theoretically capable of withstanding a 100,000-fold higher radiation dose than silicon. In this Phase I SBIR project, LightSpin investigated the performance and radiation hardness of fifth generation GaInP SPAD arrays. These fifth generation devices used a new planar processing approach that enables very tight pitch arrays to be produced. High performance devices with SPAD pitches of 11, 15, and 25 μm were successfully demonstrated, which greatly increased the dynamic range and maximum count rate of the devices. High maximum count rates are critical when considering radiation hardness, since radiation damage causes a proportional increase in the dark count rate, causing SPAD arrays with low maximum count rates (large SPAD pitches) to fail. These GaInP SPAD array Photomultiplier Chips™ were irradiated with protons, electrons, and neutrons. Initial irradiation results were disappointing, with the post-irradiation devices exhibiting excessively high dark currents. The degradation was traced to surface leakage currents that were largely eliminated through the use of trenches etched around the exterior of the Photomultiplier Chip™ (not between SPAD elements). A second round of irradiations on Photomultiplier Chips™ with trenches proved substantially more successful, with post-irradiation dark currents remaining relatively low, though dark count rates were observed to increase at the highest doses. Preliminary analysis of the post-irradiation devices is promising … many of the irradiated Photomultiplier Chips™ still
Solving ptychography with a convex relaxation
Horstmeyer, Roarke; Chen, Richard Y.; Ou, Xiaoze; Ames, Brendan; Tropp, Joel A.; Yang, Changhuei
2015-05-01
Ptychography is a powerful computational imaging technique that transforms a collection of low-resolution images into a high-resolution sample reconstruction. Unfortunately, algorithms that currently solve this reconstruction problem lack stability, robustness, and theoretical guarantees. Recently, convex optimization algorithms have improved the accuracy and reliability of several related reconstruction efforts. This paper proposes a convex formulation of the ptychography problem. This formulation has no local minima, it can be solved using a wide range of algorithms, it can incorporate appropriate noise models, and it can include multiple a priori constraints. The paper considers a specific algorithm, based on low-rank factorization, whose runtime and memory usage are near-linear in the size of the output image. Experiments demonstrate that this approach offers a 25% lower background variance on average than alternating projections, the ptychographic reconstruction algorithm that is currently in widespread use.
NP-completeness of weakly convex and convex dominating set decision problems
Directory of Open Access Journals (Sweden)
Joanna Raczek
2004-01-01
Full Text Available The convex domination number and the weakly convex domination number are new domination parameters. In this paper we show that the decision problems of convex and weakly convex dominating sets are \\(NP\\-complete for bipartite and split graphs. Using a modified version of Warshall algorithm we can verify in polynomial time whether a given subset of vertices of a graph is convex or weakly convex.
Nonsmooth Mechanics and Convex Optimization
Kanno, Yoshihiro
2011-01-01
"This book concerns matter that is intrinsically difficult: convex optimization, complementarity and duality, nonsmooth analysis, linear and nonlinear programming, etc. The author has skillfully introduced these and many more concepts, and woven them into a seamless whole by retaining an easy and consistent style throughout. The book is not all theory: There are many real-life applications in structural engineering, cable networks, frictional contact problems, and plasticity! I recommend it to any reader who desires a modern, authoritative account of nonsmooth mechanics and convex optimiz
Convexity Adjustments for ATS Models
DEFF Research Database (Denmark)
Murgoci, Agatha; Gaspar, Raquel M.
. As a result we classify convexity adjustments into forward adjustments and swaps adjustments. We, then, focus on affine term structure (ATS) models and, in this context, conjecture convexity adjustments should be related of affine functionals. In the case of forward adjustments, we show how to obtain exact...... formulas. Concretely for LIBOR in arrears (LIA) contracts, we derive the system of Riccatti ODE-s one needs to compute to obtain the exact adjustment. Based upon the ideas of Schrager and Pelsser (2006) we are also able to derive general swap adjustments useful, in particular, when dealing with constant...
Directory of Open Access Journals (Sweden)
Tongwen Jiang
2017-01-01
Full Text Available The unusually ultra-deep and ultra-high-pressure gas reservoirs in the Keshen 8 Block on the Kelasu structural belt of the Tarim Basin are also featured by high temperature, well-developed fault fissures, huge thickness, tight matrix, complex oil–water distribution, etc., which brings about great difficulties to reserves evaluation and further development. In view of this, an overall study was made on the fine description of reservoir fractures and their seepage mechanism, technical problems were being tackled on seismic data processing and interpretation of complex and high & steep structural zones, optimal development design, safe & rapid drilling and completion wells, reservoir stimulation, dynamic monitoring, etc. to promote the development level of such ultra-deep tight gas reservoirs, and 22 complete sets of specific techniques were formulated in the fields of high-efficiency well spacing, safe and fast drilling, recovery enhancement by well completion transformation, efficient development of optimization design, and so on. Through the technical progress and innovative management of integrated exploration & development, reserves evaluation and productivity construction have been completed on the Keshen 8 Block in the last three years of the 12th Five-Year Plan period (2011–2015, as a result, rapid and high-efficiency productivity construction is realized, and a new area is explored in the development of ultra-deep and ultra-high-pressure fractured tight sand gas reservoirs. This study is of great reference to the development of similar gas reservoirs at home and abroad.
Quantum information and convex optimization
Energy Technology Data Exchange (ETDEWEB)
Reimpell, Michael
2008-07-01
This thesis is concerned with convex optimization problems in quantum information theory. It features an iterative algorithm for optimal quantum error correcting codes, a postprocessing method for incomplete tomography data, a method to estimate the amount of entanglement in witness experiments, and it gives necessary and sufficient criteria for the existence of retrodiction strategies for a generalized mean king problem. (orig.)
Quantum information and convex optimization
International Nuclear Information System (INIS)
Reimpell, Michael
2008-01-01
This thesis is concerned with convex optimization problems in quantum information theory. It features an iterative algorithm for optimal quantum error correcting codes, a postprocessing method for incomplete tomography data, a method to estimate the amount of entanglement in witness experiments, and it gives necessary and sufficient criteria for the existence of retrodiction strategies for a generalized mean king problem. (orig.)
CONVEX BODIES AND GAUSSIAN PROCESSES
Directory of Open Access Journals (Sweden)
Richard A Vitale
2011-05-01
Full Text Available For several decades, the topics of the title have had a fruitful interaction. This survey will describe some of these connections, including the GB/GC classification of convex bodies, Ito-Nisio singularities from a geometric viewpoint, Gaussian representation of intrinsic volumes, theWills functional in a Gaussian context, and inequalities.
Czech Academy of Sciences Publication Activity Database
Guirao, A. J.; Hájek, Petr Pavel
2007-01-01
Roč. 135, č. 10 (2007), s. 3233-3240 ISSN 0002-9939 R&D Projects: GA AV ČR IAA100190502 Institutional research plan: CEZ:AV0Z10190503 Keywords : Banach spaces * moduli of convexity * uniformly rotund norms Subject RIV: BA - General Mathematics Impact factor: 0.520, year: 2007
Fixed point theorems for paracompact convex sets
International Nuclear Information System (INIS)
Jiang Jiahe.
1986-08-01
In the present paper a few fixed point theorems are given for upper hemi-continuous mappings from a paracompact convex set to its embracing space, a real, locally convex, Hausdorff topological vector space. (author)
Computing farthest neighbors on a convex polytope
Cheong, O.; Shin, C.S.; Vigneron, A.
2002-01-01
Let N be a set of n points in convex position in R3. The farthest-point Voronoi diagram of N partitions R³ into n convex cells. We consider the intersection G(N) of the diagram with the boundary of the convex hull of N. We give an algorithm that computes an implicit representation of G(N) in
Revisiting separation properties of convex fuzzy sets
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...
Diameter 2 properties and convexity
Czech Academy of Sciences Publication Activity Database
Abrahamsen, T. A.; Hájek, Petr Pavel; Nygaard, O.; Talponen, J.; Troyanski, S.
2016-01-01
Roč. 232, č. 3 (2016), s. 227-242 ISSN 0039-3223 R&D Projects: GA ČR GA16-07378S Institutional support: RVO:67985840 Keywords : diameter 2 property * midpoint locally uniformly rotund * Daugavet property Subject RIV: BA - General Mathematics Impact factor: 0.535, year: 2016 https://www.impan.pl/pl/wydawnictwa/czasopisma-i-serie-wydawnicze/studia- mathematica /all/232/3/91534/diameter-2-properties-and-convexity
Coherent soft X-ray high-order harmonics using tight-focusing laser pulses in the gas mixture.
Lu, Faming; Xia, Yuanqin; Zhang, Sheng; Chen, Deying; Zhao, Yang; Liu, Bin
2014-01-01
We experimentally study the harmonics from a Xe-He gas mixture using tight-focusing femtosecond laser pulses. The spectrum in the mixed gases exhibits an extended cutoff region from the harmonic H21 to H27. The potential explanation is that the harmonics photons from Xe contribute the electrons of He atoms to transmit into the excited-state. Therefore, the harmonics are emitted from He atoms easily. Furthermore, we show that there are the suppressed harmonics H15 and H17 in the mixed gases. The underlying mechanism is the destructive interference between harmonics generated from different atoms. Our results indicate that HHG from Xe-He gas mixture is an efficient method of obtaining the coherent soft X-ray source.
Scoliosis convexity and organ anatomy are related.
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 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.
Dose evaluation from multiple detector outputs using convex optimisation
International Nuclear Information System (INIS)
Hashimoto, M.; Iimoto, T.; Kosako, T.
2011-01-01
A dose evaluation using multiple radiation detectors can be improved by the convex optimisation method. It enables flexible dose evaluation corresponding to the actual radiation energy spectrum. An application to the neutron ambient dose equivalent evaluation is investigated using a mixed-gas proportional counter. The convex derives the certain neutron ambient dose with certain width corresponding to the true neutron energy spectrum. The range of the evaluated dose is comparable to the error of conventional neutron dose measurement equipments. An application to the neutron individual dose equivalent measurement is also investigated. Convexes of particular dosemeter combinations evaluate the individual dose equivalent better than the dose evaluation of a single dosemeter. The combinations of dosemeters with high orthogonality of their response characteristics tend to provide a good suitability for dose evaluation. (authors)
Reconstruction of convex bodies from moments
DEFF Research Database (Denmark)
Hörrmann, Julia; Kousholt, Astrid
We investigate how much information about a convex body can be retrieved from a finite number of its geometric moments. We give a sufficient condition for a convex body to be uniquely determined by a finite number of its geometric moments, and we show that among all convex bodies, those which......- rithm that approximates a convex body using a finite number of its Legendre moments. The consistency of the algorithm is established using the stabil- ity result for Legendre moments. When only noisy measurements of Legendre moments are available, the consistency of the algorithm is established under...
Hadamard type inequalities for m-convex and (α, m)-convex functions via fractional integrals
Ardıç, Merve Avcı; Ekinci, Alper; Akdemir, Ahmet Ocak; Özdemir, M. Emin
2018-01-01
In this paper, we established some new Hadamard-type integral inequalities for functions whose derivatives of absolute values are m-convex and (α, m)-convex functions via Riemann-Liouville fractional integrals.
Relaxation Methods for Strictly Convex Regularizations of Piecewise Linear Programs
International Nuclear Information System (INIS)
Kiwiel, K. C.
1998-01-01
We give an algorithm for minimizing the sum of a strictly convex function and a convex piecewise linear function. It extends several dual coordinate ascent methods for large-scale linearly constrained problems that occur in entropy maximization, quadratic programming, and network flows. In particular, it may solve exact penalty versions of such (possibly inconsistent) problems, and subproblems of bundle methods for nondifferentiable optimization. It is simple, can exploit sparsity, and in certain cases is highly parallelizable. Its global convergence is established in the recent framework of B -functions (generalized Bregman functions)
Entropy coherent and entropy convex measures of risk
Laeven, R.J.A.; Stadje, M.
2013-01-01
We introduce two subclasses of convex measures of risk, referred to as entropy coherent and entropy convex measures of risk. Entropy coherent and entropy convex measures of risk are special cases of φ-coherent and φ-convex measures of risk. Contrary to the classical use of coherent and convex
Convex analysis and global optimization
Tuy, Hoang
2016-01-01
This book presents state-of-the-art results and methodologies in modern global optimization, and has been a staple reference for researchers, engineers, advanced students (also in applied mathematics), and practitioners in various fields of engineering. The second edition has been brought up to date and continues to develop a coherent and rigorous theory of deterministic global optimization, highlighting the essential role of convex analysis. The text has been revised and expanded to meet the needs of research, education, and applications for many years to come. Updates for this new edition include: · Discussion of modern approaches to minimax, fixed point, and equilibrium theorems, and to nonconvex optimization; · Increased focus on dealing more efficiently with ill-posed problems of global optimization, particularly those with hard constraints;
Convex Combination of Multiple Statistical Models with Application to VAD
DEFF Research Database (Denmark)
Petsatodis, Theodoros; Boukis, Christos; Talantzis, Fotios
2011-01-01
This paper proposes a robust Voice Activity Detector (VAD) based on the observation that the distribution of speech captured with far-field microphones is highly varying, depending on the noise and reverberation conditions. The proposed VAD employs a convex combination scheme comprising three...
Intracranial Convexity Lipoma with Massive Calcification: Case Report
Energy Technology Data Exchange (ETDEWEB)
Kim, Eung Tae; Park, Dong Woo; Ryu, Jeong Ah; Park, Choong Ki; Lee, Young Jun; Lee, Seung Ro [Dept. of Radiology, Hanyang University College of Medicine, Seoul (Korea, Republic of)
2011-12-15
Intracranial lipoma is a rare entity, accounting for less than 0.5% of intracranial tumors, which usually develops in the callosal cisterns. We report a case of lipoma with an unusual location; in the high parietal convexity combined with massive calcification, and no underlying vascular malformation or congenital anomaly.
Convex trace functions of several variables
DEFF Research Database (Denmark)
Hansen, Frank
2002-01-01
We prove that the function (x1,...,xk)¿Tr(f(x1,...,xk)), defined on k-tuples of symmetric matrices of order (n1,...,nk) in the domain of f, is convex for any convex function f of k variables. The matrix f(x1,...,xk) is defined by the functional calculus for functions of several variables, and it ...
Differential analysis of matrix convex functions II
DEFF Research Database (Denmark)
Hansen, Frank; Tomiyama, Jun
2009-01-01
We continue the analysis in [F. Hansen, and J. Tomiyama, Differential analysis of matrix convex functions. Linear Algebra Appl., 420:102--116, 2007] of matrix convex functions of a fixed order defined in a real interval by differential methods as opposed to the characterization in terms of divided...
Strictly convex functions on complete Finsler manifolds
Indian Academy of Sciences (India)
convex functions on the metric structures of complete Finsler manifolds. More precisely we discuss ... map expp at some point p ∈ M (and hence at every point on M) is defined on the whole tangent space Mp to M at ... The influence of the existence of convex functions on the metric and topology of under- lying manifolds has ...
Introduction to Convex and Quasiconvex Analysis
J.B.G. Frenk (Hans); G. Kassay
2004-01-01
textabstractIn the first chapter of this book the basic results within convex and quasiconvex analysis are presented. In Section 2 we consider in detail the algebraic and topological properties of convex sets within Rn together with their primal and dual representations. In Section 3 we apply the
PCBS AND TIGHT JUNCTION EXPRESSION
Eum, Sung Yong; András, Ibolya E.; Couraud, Pierre-Olivier; Hennig, Bernhard; Toborek, Michal
2008-01-01
Polychlorinated biphenyl (PCB) congeners exhibit a broad range of adverse biological effects including neurotoxicity. The mechanisms by which PCBs cause neurotoxic effects are still not completely understood. The blood-brain barrier (BBB) is a physical and metabolic barrier separating brain microenvironment from the peripheral circulation and is mainly composed of endothelial cells connected by tight junctions. We examined the effects of several highly-chlorinated PCB congeners on expression ...
Generalized convexity, generalized monotonicity recent results
Martinez-Legaz, Juan-Enrique; Volle, Michel
1998-01-01
A function is convex if its epigraph is convex. This geometrical structure has very strong implications in terms of continuity and differentiability. Separation theorems lead to optimality conditions and duality for convex problems. A function is quasiconvex if its lower level sets are convex. Here again, the geo metrical structure of the level sets implies some continuity and differentiability properties for quasiconvex functions. Optimality conditions and duality can be derived for optimization problems involving such functions as well. Over a period of about fifty years, quasiconvex and other generalized convex functions have been considered in a variety of fields including economies, man agement science, engineering, probability and applied sciences in accordance with the need of particular applications. During the last twenty-five years, an increase of research activities in this field has been witnessed. More recently generalized monotonicity of maps has been studied. It relates to generalized conve...
Mongelli-Sabino, B M; Canuto, L P; Collares-Buzato, C B
2017-11-01
Type 2 diabetes mellitus (T2DM) is one of the most prevalent diseases worldwide. Diabetic nephropathy (DN) is a complication of diabetes and the mechanisms underlying onset and progression of this disease are not fully understood. It has been shown that hyperglycemia is an independent factor to predict the development of DN in individuals with T2DM, however, a link between high plasma glucose levels and renal tubular injuries in DN remains unknown. In this study, we investigated the effect of high levels of glucose (i.e. 180 or 360mg/dL) for up to 24h (acute) or over 72h (chronic) upon tight junction (TJ)-mediated epithelial barrier integrity of the kidney tubular cell line, MDCK. High levels of glucose (180 and 360mg/dL) induced a decrease in transepithelial electrical resistance associated with an increase in TJ cation selectivity at 24h or in TJ permeability to a paracellular marker, Lucifer Yellow, at 72h-exposure when compared to control group (exposed to 100mg/dL glucose). Immunofluorescence analyses showed that glucose treatment induced a significant decrease in the tight junctional content of claudins-1 and -3 as well as a significant increase in claudin-2 (particularly at 24h-exposure) and a time-dependent change in occludin/ZO-1 junctional content. The analyses of total cell content of these junctional proteins by Western blot did not reveal significant changes, except in claudin-2 expression. Our data suggest that high levels of glucose induce time-dependence changes in TJ structure in MDCK monolayers, suggesting a possible link between hyperglycemia-induced tubular epithelial barrier disruption and diabetic nephropathy. Copyright © 2017 Elsevier Inc. All rights reserved.
Duality and calculus of convex objects (theory and applications)
International Nuclear Information System (INIS)
Brinkhuis, Ya; Tikhomirov, V M
2007-01-01
A new approach to convex calculus is presented, which allows one to treat from a single point of view duality and calculus for various convex objects. This approach is based on the possibility of associating with each convex object (a convex set or a convex function) a certain convex cone without loss of information about the object. From the duality theorem for cones duality theorems for other convex objects are deduced as consequences. The theme 'Duality formulae and the calculus of convex objects' is exhausted (from a certain precisely formulated point of view). Bibliography: 5 titles.
Kraus, Natascha; Haas, Norbert P; Scheibel, Markus; Gerhardt, Christian
2013-10-01
The arthroscopically assisted Double-TightRope technique has recently been reported to yield good to excellent clinical results in the treatment of acute, high-grade acromioclavicular dislocation. However, the orientation of the transclavicular-transcoracoidal drill holes remains a matter of debate. A V-shaped drill hole orientation leads to better clinical and radiologic results and provides a higher vertical and horizontal stability compared to parallel drill hole placement. This was a cohort study; level of evidence, 2b. Two groups of patients with acute high-grade acromioclavicular joint instability (Rockwood type V) were included in this prospective, non-randomized cohort study. 15 patients (1 female/14 male) with a mean age of 37.7 (18-66) years were treated with a Double-TightRope technique using a V-shaped orientation of the drill holes (group 1). 13 patients (1 female/12 male) with a mean age of 40.9 (21-59) years were treated with a Double-TightRope technique with a parallel drill hole placement (group 2). After 2 years, the final evaluation consisted of a complete physical examination of both shoulders, evaluation of the Subjective Shoulder Value (SSV), Constant Score (CS), Taft Score (TF) and Acromioclavicular Joint Instability Score (ACJI) as well as a radiologic examination including bilateral anteroposterior stress views and bilateral Alexander views. After a mean follow-up of 2 years, all patients were free of shoulder pain at rest and during daily activities. Range of motion did not differ significantly between both groups (p > 0.05). Patients in group 1 reached on average 92.4 points in the CS, 96.2 % in the SSV, 10.5 points in the TF and 75.9 points in the ACJI. Patients in group 2 scored 90.5 points in the CS, 93.9 % in the SSV, 10.5 points in the TF and 84.5 points in the ACJI (p > 0.05). Radiographically, the coracoclavicular distance was found to be 13.9 mm (group 1) and 13.4 mm (group 2) on the affected side and 9.3 mm (group 1
On convexity and Schoenberg's variation diminishing splines
International Nuclear Information System (INIS)
Feng, Yuyu; Kozak, J.
1992-11-01
In the paper we characterize a convex function by the monotonicity of a particular variation diminishing spline sequence. The result extends the property known for the Bernstein polynomial sequence. (author). 4 refs
Convex trace functions of several variables
DEFF Research Database (Denmark)
Hansen, Frank
2002-01-01
We prove that the function (x1,...,xk)¿Tr(f(x1,...,xk)), defined on k-tuples of symmetric matrices of order (n1,...,nk) in the domain of f, is convex for any convex function f of k variables. The matrix f(x1,...,xk) is defined by the functional calculus for functions of several variables, and it ......We prove that the function (x1,...,xk)¿Tr(f(x1,...,xk)), defined on k-tuples of symmetric matrices of order (n1,...,nk) in the domain of f, is convex for any convex function f of k variables. The matrix f(x1,...,xk) is defined by the functional calculus for functions of several variables...
Convex analysis and optimization in Hadamard spaces
Bacak, Miroslav
2014-01-01
This book gives a first systematic account on the subject of convex analysis and optimization in Hadamard spaces. It is primarily aimed at both graduate students and researchers in analysis and optimization.
Recent characterizations of generalized convexity in convexity in cooperative game thoery
Energy Technology Data Exchange (ETDEWEB)
Driessen, T.
1994-12-31
The notion of convexity for a real-valued function on the power set of the finite set N (the so-called cooperative game with player set N) is defined as in other mathematical fields. The study of convexity plays an important role within the field of cooperative game theory because the application of the solution part of game theory to convex games provides elegant results for the solution concepts involved. Especially, the well known solution concept called core is, for convex games, very well characterized. The current paper focuses on a notion of generalized convexity, called k- convexity, for cooperative n-person games. Due to very recent characterizations of convexity for cooperative games, the goal is to provide similar new characterizations of k-convexity. The main characterization states that for the k-convexity of an n-person game it is both necessary and sufficient that half of all the so-called marginal worth vectors belong to the core of the game. Here it is taken into account whether a marginal worth vector corresponds to an even or odd ordering of k elements of the n-person player set N. Another characterization of k-convexity is presented in terms of a so-called finite min-modular decomposition. That is, some specific cover game of a k-convex game can be decomposed as the minimum of a finite number of modular (or additive) games. Finally it is established that the k-convexity of a game can be characterized in terms of the second order partial derivates of the so-called multilinear extension of the game.
Continuous Shearlet Tight Frames
Grohs, Philipp
2010-10-22
Based on the shearlet transform we present a general construction of continuous tight frames for L2(ℝ2) from any sufficiently smooth function with anisotropic moments. This includes for example compactly supported systems, piecewise polynomial systems, or both. From our earlier results in Grohs (Technical report, KAUST, 2009) it follows that these systems enjoy the same desirable approximation properties for directional data as the previous bandlimited and very specific constructions due to Kutyniok and Labate (Trans. Am. Math. Soc. 361:2719-2754, 2009). We also show that the representation formulas we derive are in a sense optimal for the shearlet transform. © 2010 Springer Science+Business Media, LLC.
On the convexity of N-Chebyshev sets
International Nuclear Information System (INIS)
Borodin, Petr A
2011-01-01
We define N-Chebyshev sets in a Banach space X for every positive integer N (when N=1, these are ordinary Chebyshev sets) and study conditions that guarantee their convexity. In particular, we prove that all N-Chebyshev sets are convex when N is even and X is uniformly convex or N≥3 is odd and X is smooth uniformly convex.
Entropy Coherent and Entropy Convex Measures of Risk
Laeven, R.J.A.; Stadje, M.A.
2011-01-01
We introduce two subclasses of convex measures of risk, referred to as entropy coherent and entropy convex measures of risk. We prove that convex, entropy convex and entropy coherent measures of risk emerge as certainty equivalents under variational, homothetic and multiple priors preferences,
On superadditivity and convexity for cooperative games with random payoffs
Timmer, Judith B.
In this paper we study the relations between superadditivity and several types of convexity for cooperative games with random payoffs. The types of convexity considered are marginal convexity (all marginal vectors belong to the core), individual-merge convexity (any individual player is better off
Privileged coding of convex shapes in human object-selective cortex.
Haushofer, Johannes; Baker, Chris I; Livingstone, Margaret S; Kanwisher, Nancy
2008-08-01
What is the neural code for object shape? Despite intensive research, the precise nature of object representations in high-level visual cortex remains elusive. Here we use functional magnetic resonance imaging (fMRI) to show that convex shapes are encoded in a privileged fashion by human lateral occipital complex (LOC), a region that has been implicated in object recognition. On each trial, two convex or two concave shapes that were either identical or different were presented sequentially. Critically, the convex and concave stimuli were the same except for a binocular disparity change that reversed the figure-ground assignment. The fMRI response in LOC for convex stimuli was higher for different than that for identical shape pairs, indicating sensitivity to differences in convex shape. However, when the same stimuli were seen as concave, the response for different and identical pairs was the same, indicating lower sensitivity to changes in concave shape than convex shape. This pattern was more pronounced in the anterior than that in the posterior portion of LOC. These results suggest that convex contours could be important elements in cortical object representations.
de Klerk, Etienne; Glineur, François; Taylor, Adrien B.
2016-01-01
We consider the gradient (or steepest) descent method with exact line search applied to a strongly convex function with Lipschitz continuous gradient. We establish the exact worst-case rate of convergence of this scheme, and show that this worst-case behavior is exhibited by a certain convex quadratic function. We also give the tight worst-case complexity bound for a noisy variant of gradient descent method, where exact line-search is performed in a search direction that differs from negative...
Gong, Xiaoxing; Shi, Zejin; Wang, Yong; Tian, Yaming; Li, Wenjie; Liu, Lei
2017-01-01
A mature understanding of the sandstone gas reservoir in the Xiaoheba Formation in the southeastern Sichuan Basin remains lacking. To assess the reservoir characteristics and the origin of the high-quality reservoir in the Xiaoheba Formation, this paper uses systematic field investigations, physical property analysis, thin section identification, scanning electron microscopy and electron microprobe methods. The results indicate that the Xiaoheba sandstone is an ultra-tight and ultra-low permeability reservoir, with an average porosity of 2.97% and an average permeability of 0.56×10−3 μm2. This promising reservoir is mainly distributed in the Lengshuixi and Shuangliuba regions and the latter has a relatively high-quality reservoir with an average porosity of 5.28% and average permeability of 0.53×10−3 μm2. The reservoir space comprises secondary intergranular dissolved pores, moldic pores and fractures. Microfacies, feldspar dissolution and fracture connectivity control the quality of this reservoir. The relatively weak compaction and cementation in the interbedded delta front distal bar and interdistributary bay microfacies indirectly protected the primary intergranular pores and enhanced late-stage dissolution. Late-stage potassium feldspar dissolution was controlled by the early-stage organic acid dissolution intensity and the distance from the hydrocarbon generation center. Early-stage fractures acted as pathways for organic acid migration and were therefore important factors in the formation of the reservoir. Based on these observations, the area to the west of the Shuangliuba and Lengshuixi regions has potential for gas exploration. PMID:28686735
Directory of Open Access Journals (Sweden)
Xiaoxing Gong
Full Text Available A mature understanding of the sandstone gas reservoir in the Xiaoheba Formation in the southeastern Sichuan Basin remains lacking. To assess the reservoir characteristics and the origin of the high-quality reservoir in the Xiaoheba Formation, this paper uses systematic field investigations, physical property analysis, thin section identification, scanning electron microscopy and electron microprobe methods. The results indicate that the Xiaoheba sandstone is an ultra-tight and ultra-low permeability reservoir, with an average porosity of 2.97% and an average permeability of 0.56×10-3 μm2. This promising reservoir is mainly distributed in the Lengshuixi and Shuangliuba regions and the latter has a relatively high-quality reservoir with an average porosity of 5.28% and average permeability of 0.53×10-3 μm2. The reservoir space comprises secondary intergranular dissolved pores, moldic pores and fractures. Microfacies, feldspar dissolution and fracture connectivity control the quality of this reservoir. The relatively weak compaction and cementation in the interbedded delta front distal bar and interdistributary bay microfacies indirectly protected the primary intergranular pores and enhanced late-stage dissolution. Late-stage potassium feldspar dissolution was controlled by the early-stage organic acid dissolution intensity and the distance from the hydrocarbon generation center. Early-stage fractures acted as pathways for organic acid migration and were therefore important factors in the formation of the reservoir. Based on these observations, the area to the west of the Shuangliuba and Lengshuixi regions has potential for gas exploration.
Reconstruction of convex bodies from surface tensors
DEFF Research Database (Denmark)
Kousholt, Astrid; Kiderlen, Markus
. The output of the reconstruction algorithm is a polytope P, where the surface tensors of P and K are identical up to rank s. We establish a stability result based on a generalization of Wirtinger’s inequality that shows that for large s, two convex bodies are close in shape when they have identical surface...... that are translates of each other. An algorithm for reconstructing an unknown convex body in R 2 from its surface tensors up to a certain rank is presented. Using the reconstruction algorithm, the shape of an unknown convex body can be approximated when only a finite number s of surface tensors are available...... tensors up to rank s. This is used to establish consistency of the developed reconstruction algorithm....
A generalization of the convex Kakeya problem
Ahn, Heekap
2012-01-01
We consider the following geometric alignment problem: Given a set of line segments in the plane, find a convex region of smallest area that contains a translate of each input segment. This can be seen as a generalization of Kakeya\\'s problem of finding a convex region of smallest area such that a needle can be turned through 360 degrees within this region. Our main result is an optimal Θ(n log n)-time algorithm for our geometric alignment problem, when the input is a set of n line segments. We also show that, if the goal is to minimize the perimeter of the region instead of its area, then the optimum placement is when the midpoints of the segments coincide. Finally, we show that for any compact convex figure G, the smallest enclosing disk of G is a smallest-perimeter region containing a translate of any rotated copy of G. © 2012 Springer-Verlag Berlin Heidelberg.
Non-convex multi-objective optimization
Pardalos, Panos M; Žilinskas, Julius
2017-01-01
Recent results on non-convex multi-objective optimization problems and methods are presented in this book, with particular attention to expensive black-box objective functions. Multi-objective optimization methods facilitate designers, engineers, and researchers to make decisions on appropriate trade-offs between various conflicting goals. A variety of deterministic and stochastic multi-objective optimization methods are developed in this book. Beginning with basic concepts and a review of non-convex single-objective optimization problems; this book moves on to cover multi-objective branch and bound algorithms, worst-case optimal algorithms (for Lipschitz functions and bi-objective problems), statistical models based algorithms, and probabilistic branch and bound approach. Detailed descriptions of new algorithms for non-convex multi-objective optimization, their theoretical substantiation, and examples for practical applications to the cell formation problem in manufacturing engineering, the process design in...
Convex Regression with Interpretable Sharp Partitions.
Petersen, Ashley; Simon, Noah; Witten, Daniela
2016-06-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.
Reconstruction of convex bodies from surface tensors
DEFF Research Database (Denmark)
Kousholt, Astrid; Kiderlen, Markus
We present two algorithms for reconstruction of the shape of convex bodies in the two-dimensional Euclidean space. The first reconstruction algorithm requires knowledge of the exact surface tensors of a convex body up to rank s for some natural number s. The second algorithm uses harmonic intrinsic...... volumes which are certain values of the surface tensors and allows for noisy measurements. From a generalized version of Wirtinger's inequality, we derive stability results that are utilized to ensure consistency of both reconstruction procedures. Consistency of the reconstruction procedure based...
Cost Allocation and Convex Data Envelopment
DEFF Research Database (Denmark)
Hougaard, Jens Leth; Tind, Jørgen
This paper considers allocation rules. First, we demonstrate that costs allocated by the Aumann-Shapley and the Friedman-Moulin cost allocation rules are easy to determine in practice using convex envelopment of registered cost data and parametric programming. Second, from the linear programming...... such as Data Envelopment Analysis (DEA). The convexity constraint of the BCC model introduces a non-zero slack in the objective function of the multiplier problem and we show that the cost allocation rules discussed in this paper can be used as candidates to allocate this slack value on to the input (or output...
Recovering convexity in non-associated plasticity
Francfort, Gilles A.
2018-03-01
We quickly review two main non-associated plasticity models, the Armstrong-Frederick model of nonlinear kinematic hardening and the Drucker-Prager cap model. Non-associativity is commonly thought to preclude any kind of variational formulation, be it in a Hencky-type (static) setting, or when considering a quasi-static evolution because non-associativity destroys convexity. We demonstrate that such an opinion is misguided: associativity (and convexity) can be restored at the expense of the introduction of state variable-dependent dissipation potentials.
Convex Clustering: An Attractive Alternative to Hierarchical Clustering
Chen, Gary K.; Chi, Eric C.; Ranola, John Michael O.; Lange, Kenneth
2015-01-01
The primary goal in cluster analysis is to discover natural groupings of objects. The field of cluster analysis is crowded with diverse methods that make special assumptions about data and address different scientific aims. Despite its shortcomings in accuracy, hierarchical clustering is the dominant clustering method in bioinformatics. Biologists find the trees constructed by hierarchical clustering visually appealing and in tune with their evolutionary perspective. Hierarchical clustering operates on multiple scales simultaneously. This is essential, for instance, in transcriptome data, where one may be interested in making qualitative inferences about how lower-order relationships like gene modules lead to higher-order relationships like pathways or biological processes. The recently developed method of convex clustering preserves the visual appeal of hierarchical clustering while ameliorating its propensity to make false inferences in the presence of outliers and noise. The solution paths generated by convex clustering reveal relationships between clusters that are hidden by static methods such as k-means clustering. The current paper derives and tests a novel proximal distance algorithm for minimizing the objective function of convex clustering. The algorithm separates parameters, accommodates missing data, and supports prior information on relationships. Our program CONVEXCLUSTER incorporating the algorithm is implemented on ATI and nVidia graphics processing units (GPUs) for maximal speed. Several biological examples illustrate the strengths of convex clustering and the ability of the proximal distance algorithm to handle high-dimensional problems. CONVEXCLUSTER can be freely downloaded from the UCLA Human Genetics web site at http://www.genetics.ucla.edu/software/ PMID:25965340
Makhno, V I; Peshin, N N; Semenkov, Iu P; Kirillov, S V
1988-01-01
The functional activity of the wide-spread "tight" 70S ribosomes is usually equal to 55-80%. We show here that the inactive fraction of this type of ribosomes is virtually blocked by residual endogenous RNA's. These RNA's are shown to be removable by introducing an additional stage in the isolation procedure including: 1. short heating (15 min, 37 degrees C) of "tight" 70S under dissociation conditions, i. e. in a buffer containing 3 mM MgCl2 and 200 mM NH4Cl; 2. washing off endogenous RNA's on a sucrose density gradient in the same buffer; 3. final selection of purified "tight" 70S on the sucrose gradient containing 5 mM MgCl2 and 50 mM NH4Cl. "Tight" 70S ribosomes isolated by such a procedure are 90-100% active with respect to tRNA binding (including the factor-dependent one), peptide bond synthesis and translocation.
Speech Enhancement by Modified Convex Combination of Fractional Adaptive Filtering
Directory of Open Access Journals (Sweden)
M. Geravanchizadeh
2014-12-01
Full Text Available This paper presents new adaptive filtering techniques used in speech enhancement system. Adaptive filtering schemes are subjected to different trade-offs regarding their steady-state misadjustment, speed of convergence, and tracking performance. Fractional Least-Mean-Square (FLMS is a new adaptive algorithm which has better performance than the conventional LMS algorithm. Normalization of LMS leads to better performance of adaptive filter. Furthermore, convex combination of two adaptive filters improves its performance. In this paper, new convex combinational adaptive filtering methods in the framework of speech enhancement system are proposed. The proposed methods utilize the idea of normalization and fractional derivative, both in the design of different convex mixing strategies and their related component filters. To assess our proposed methods, simulation results of different LMS-based algorithms based on their convergence behavior (i.e., MSE plots and different objective and subjective criteria are compared. The objective and subjective evaluations include examining the results of SNR improvement, PESQ test, and listening tests for dual-channel speech enhancement. The powerful aspects of proposed methods are their low complexity, as expected with all LMS-based methods, along with a high convergence rate.
Bayoumi, A
2003-01-01
All the existing books in Infinite Dimensional Complex Analysis focus on the problems of locally convex spaces. However, the theory without convexity condition is covered for the first time in this book. This shows that we are really working with a new, important and interesting field. Theory of functions and nonlinear analysis problems are widespread in the mathematical modeling of real world systems in a very broad range of applications. During the past three decades many new results from the author have helped to solve multiextreme problems arising from important situations, non-convex and
Stochastic convex sparse principal component analysis.
Baytas, Inci M; Lin, Kaixiang; Wang, Fei; Jain, Anil K; Zhou, Jiayu
2016-12-01
Principal component analysis (PCA) is a dimensionality reduction and data analysis tool commonly used in many areas. The main idea of PCA is to represent high-dimensional data with a few representative components that capture most of the variance present in the data. However, there is an obvious disadvantage of traditional PCA when it is applied to analyze data where interpretability is important. In applications, where the features have some physical meanings, we lose the ability to interpret the principal components extracted by conventional PCA because each principal component is a linear combination of all the original features. For this reason, sparse PCA has been proposed to improve the interpretability of traditional PCA by introducing sparsity to the loading vectors of principal components. The sparse PCA can be formulated as an ℓ 1 regularized optimization problem, which can be solved by proximal gradient methods. However, these methods do not scale well because computation of the exact gradient is generally required at each iteration. Stochastic gradient framework addresses this challenge by computing an expected gradient at each iteration. Nevertheless, stochastic approaches typically have low convergence rates due to the high variance. In this paper, we propose a convex sparse principal component analysis (Cvx-SPCA), which leverages a proximal variance reduced stochastic scheme to achieve a geometric convergence rate. We further show that the convergence analysis can be significantly simplified by using a weak condition which allows a broader class of objectives to be applied. The efficiency and effectiveness of the proposed method are demonstrated on a large-scale electronic medical record cohort.
Multimode Root locus for a Matrix with uncertainty using convex lowbar Hull
International Nuclear Information System (INIS)
Hussein, Mohammed Tawfik
2009-01-01
The goal of this paper is to investigate the robust stability of the uncertain system based on the edge theorem and the Bhattacharyya and Keel algorithm. Firstly, the dynamic model for the system will be derived, then, Depending on the uncertainty, which appears in the elements of matrix A, the system will generates a set of interval matrices, secondly the procedures of the proposed algorithm to find convex hull of the system by Using the method of Andrew's Monotone Chain Algorithm will be implemented, and lastly root locus method will be utilized and applied to the exposed edges of the convex polygon and yet; the sharp and tight bounds of the eigenvalues of the proposed uncertain systems will be computed. An Electrical engineering system will be presented as practical example to validate the proposed method.
Robust Utility Maximization Under Convex Portfolio Constraints
International Nuclear Information System (INIS)
Matoussi, Anis; Mezghani, Hanen; Mnif, Mohamed
2015-01-01
We study a robust maximization problem from terminal wealth and consumption under a convex constraints on the portfolio. We state the existence and the uniqueness of the consumption–investment strategy by studying the associated quadratic backward stochastic differential equation. We characterize the optimal control by using the duality method and deriving a dynamic maximum principle
Robust Utility Maximization Under Convex Portfolio Constraints
Energy Technology Data Exchange (ETDEWEB)
Matoussi, Anis, E-mail: anis.matoussi@univ-lemans.fr [Université du Maine, Risk and Insurance institut of Le Mans Laboratoire Manceau de Mathématiques (France); Mezghani, Hanen, E-mail: hanen.mezghani@lamsin.rnu.tn; Mnif, Mohamed, E-mail: mohamed.mnif@enit.rnu.tn [University of Tunis El Manar, Laboratoire de Modélisation Mathématique et Numérique dans les Sciences de l’Ingénieur, ENIT (Tunisia)
2015-04-15
We study a robust maximization problem from terminal wealth and consumption under a convex constraints on the portfolio. We state the existence and the uniqueness of the consumption–investment strategy by studying the associated quadratic backward stochastic differential equation. We characterize the optimal control by using the duality method and deriving a dynamic maximum principle.
Strictly convex functions on complete Finsler manifolds
Indian Academy of Sciences (India)
... Refresher Courses · Symposia · Live Streaming. Home; Journals; Proceedings – Mathematical Sciences; Volume 126; Issue 4. Strictly convex functions on complete Finsler manifolds. YOE ITOKAWA KATSUHIRO SHIOHAMA BANKTESHWAR TIWARI. Research Article Volume 126 Issue 4 October 2016 pp 623-627 ...
Differential analysis of matrix convex functions
DEFF Research Database (Denmark)
Hansen, Frank; Tomiyama, Jun
2007-01-01
We analyze matrix convex functions of a fixed order defined in a real interval by differential methods as opposed to the characterization in terms of divided differences given by Kraus [F. Kraus, Über konvekse Matrixfunktionen, Math. Z. 41 (1936) 18-42]. We obtain for each order conditions for ma...
Some Characterizations of Convex Interval Games
Brânzei, R.; Tijs, S.H.; Alparslan-Gok, S.Z.
2008-01-01
This paper focuses on new characterizations of convex interval games using the notions of exactness and superadditivity. We also relate big boss interval games with concave interval games and obtain characterizations of big boss interval games in terms of exactness and subadditivity.
Convexity properties of Hamiltonian group actions
Guillemin, Victor
2005-01-01
This is a monograph on convexity properties of moment mappings in symplectic geometry. The fundamental result in this subject is the Kirwan convexity theorem, which describes the image of a moment map in terms of linear inequalities. This theorem bears a close relationship to perplexing old puzzles from linear algebra, such as the Horn problem on sums of Hermitian matrices, on which considerable progress has been made in recent years following a breakthrough by Klyachko. The book presents a simple local model for the moment polytope, valid in the "generic&rdquo case, and an elementary Morse-theoretic argument deriving the Klyachko inequalities and some of their generalizations. It reviews various infinite-dimensional manifestations of moment convexity, such as the Kostant type theorems for orbits of a loop group (due to Atiyah and Pressley) or a symplectomorphism group (due to Bloch, Flaschka and Ratiu). Finally, it gives an account of a new convexity theorem for moment map images of orbits of a Borel sub...
Conference on Convex Analysis and Global Optimization
Pardalos, Panos
2001-01-01
There has been much recent progress in global optimization algo rithms for nonconvex continuous and discrete problems from both a theoretical and a practical perspective. Convex analysis plays a fun damental role in the analysis and development of global optimization algorithms. This is due essentially to the fact that virtually all noncon vex optimization problems can be described using differences of convex functions and differences of convex sets. A conference on Convex Analysis and Global Optimization was held during June 5 -9, 2000 at Pythagorion, Samos, Greece. The conference was honoring the memory of C. Caratheodory (1873-1950) and was en dorsed by the Mathematical Programming Society (MPS) and by the Society for Industrial and Applied Mathematics (SIAM) Activity Group in Optimization. The conference was sponsored by the European Union (through the EPEAEK program), the Department of Mathematics of the Aegean University and the Center for Applied Optimization of the University of Florida, by th...
Uniformly convex functions on Banach spaces
Czech Academy of Sciences Publication Activity Database
Borwein, J.; Guirao, A. J.; Hájek, Petr Pavel; Vanderwerff, J.
2009-01-01
Roč. 137, č. 3 (2009), s. 1081-1091 ISSN 0002-9939 R&D Projects: GA AV ČR IAA100190502; GA AV ČR IAA100190801 Institutional research plan: CEZ:AV0Z10190503 Keywords : power type 2 * uniform convexity Subject RIV: BA - General Mathematics Impact factor: 0.640, year: 2009
Directional Convexity and Finite Optimality Conditions.
1984-03-01
system, Necessary Conditions for optimality. Work Unit Number 5 (Optimization and Large Scale Systems) *Istituto di Matematica Applicata, Universita...that R(T) is convex would then imply x(u,T) e int R(T). Cletituto di Matematica Applicata, Universita di Padova, 35100 ITALY. Sponsored by the United
Strictly convex functions on complete Finsler manifolds
Indian Academy of Sciences (India)
minimum set of a super Busemann function contains a soul of M. Clearly, a complete simply connected Riemannian manifold H of non-positive sec- tional curvature, called Hadamard manifold, has the property that the distance function to an arbitrary fixed point is strongly convex exhaustion. Also, the exponential map expp :.
Convex Formulations of Learning from Crowds
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.
Toric Geometry of the Regular Convex Polyhedra
Directory of Open Access Journals (Sweden)
Fiammetta Battaglia
2017-01-01
Full Text Available We describe symplectic and complex toric spaces associated with the five regular convex polyhedra. The regular tetrahedron and the cube are rational and simple, the regular octahedron is not simple, the regular dodecahedron is not rational, and the regular icosahedron is neither simple nor rational. We remark that the last two cases cannot be treated via standard toric geometry.
Similarity measure computation of convex polyhedra revisited
Roerdink, Jos B.T.M.; Bekker, Henk
2001-01-01
We study the computation of rotation-invariant similarity measures of convex polyhedra, based on Minkowski’s theory of mixed volumes. To compute the similarity measure, a (mixed) volume functional has to be minimized over a number of critical orientations of these polyhedra. These critical
Minimizing convex functions by continuous descent methods
Directory of Open Access Journals (Sweden)
Sergiu Aizicovici
2010-01-01
Full Text Available We study continuous descent methods for minimizing convex functions, defined on general Banach spaces, which are associated with an appropriate complete metric space of vector fields. We show that there exists an everywhere dense open set in this space of vector fields such that each of its elements generates strongly convergent trajectories.
A generalization of the convex Kakeya problem
Ahn, Heekap
2013-09-19
Given a set of line segments in the plane, not necessarily finite, what is a convex region of smallest area that contains a translate of each input segment? This question can be seen as a generalization of Kakeya\\'s problem of finding a convex region of smallest area such that a needle can be rotated through 360 degrees within this region. We show that there is always an optimal region that is a triangle, and we give an optimal Θ(nlogn)-time algorithm to compute such a triangle for a given set of n segments. We also show that, if the goal is to minimize the perimeter of the region instead of its area, then placing the segments with their midpoint at the origin and taking their convex hull results in an optimal solution. Finally, we show that for any compact convex figure G, the smallest enclosing disk of G is a smallest-perimeter region containing a translate of every rotated copy of G. © 2013 Springer Science+Business Media New York.
Metalclad substation subdivided into tight compartments
Energy Technology Data Exchange (ETDEWEB)
Diaferia, A.; Messie, M.
1990-02-06
This invention relates to a high voltage metalclad substation, having a metal enclosure, filled with a high dielectric strength gas, and subdivided into different compartments by tight insulating partitions. The object of this invention is to achieve a simplified substation of reduced dimensions preserving the possibilities of performing operations on part of the substation, while the other part remains live. According to the invention, a metalclad substation is provided, having a busbar isolating switch including an operating mechanism housed in the busbar compartment. The movable contacts of the isolating switch are housed in a compartment separated by a tight insulating partition from the busbar compartment. Tight partitioning of the compartments enables operations to be carried out in the different compartments while maintaining at least one of the busbars switched on to supply the unaffected part of the installation. The invention can be applied to a single-phase or a three-phase enclosure substation. 4 figs.
Tight closure and vanishing theorems
International Nuclear Information System (INIS)
Smith, K.E.
2001-01-01
Tight closure has become a thriving branch of commutative algebra since it was first introduced by Mel Hochster and Craig Huneke in 1986. Over the past few years, it has become increasingly clear that tight closure has deep connections with complex algebraic geometry as well, especially with those areas of algebraic geometry where vanishing theorems play a starring role. The purpose of these lectures is to introduce tight closure and to explain some of these connections with algebraic geometry. Tight closure is basically a technique for harnessing the power of the Frobenius map. The use of the Frobenius map to prove theorems about complex algebraic varieties is a familiar technique in algebraic geometry, so it should perhaps come as no surprise that tight closure is applicable to algebraic geometry. On the other hand, it seems that so far we are only seeing the tip of a large and very beautiful iceberg in terms of tight closure's interpretation and applications to algebraic geometry. Interestingly, although tight closure is a 'characteristic p' tool, many of the problems where tight closure has proved useful have also yielded to analytic (L2) techniques. Despite some striking parallels, there had been no specific result directly linking tight closure and L∼ techniques. Recently, however, the equivalence of an ideal central to the theory of tight closure was shown to be equivalent to a certain 'multiplier ideal' first defined using L2 methods. Presumably, deeper connections will continue to emerge. There are two main types of problems for which tight closure has been helpful: in identifying nice structure and in establishing uniform behavior. The original algebraic applications of tight closure include, for example, a quick proof of the Hochster-Roberts theorem on the Cohen-Macaulayness of rings of invariants, and also a refined version of the Brianqon-Skoda theorem on the uniform behaviour of integral closures of powers of ideals. More recent, geometric
Fast approximate convex decomposition using relative concavity
Ghosh, Mukulika
2013-02-01
Approximate convex decomposition (ACD) is a technique that partitions an input object into approximately convex components. Decomposition into approximately convex pieces is both more efficient to compute than exact convex decomposition and can also generate a more manageable number of components. It can be used as a basis of divide-and-conquer algorithms for applications such as collision detection, skeleton extraction and mesh generation. In this paper, we propose a new method called Fast Approximate Convex Decomposition (FACD) that improves the quality of the decomposition and reduces the cost of computing it for both 2D and 3D models. In particular, we propose a new strategy for evaluating potential cuts that aims to reduce the relative concavity, rather than absolute concavity. As shown in our results, this leads to more natural and smaller decompositions that include components for small but important features such as toes or fingers while not decomposing larger components, such as the torso, that may have concavities due to surface texture. Second, instead of decomposing a component into two pieces at each step, as in the original ACD, we propose a new strategy that uses a dynamic programming approach to select a set of n c non-crossing (independent) cuts that can be simultaneously applied to decompose the component into n c+1 components. This reduces the depth of recursion and, together with a more efficient method for computing the concavity measure, leads to significant gains in efficiency. We provide comparative results for 2D and 3D models illustrating the improvements obtained by FACD over ACD and we compare with the segmentation methods in the Princeton Shape Benchmark by Chen et al. (2009) [31]. © 2012 Elsevier Ltd. All rights reserved.
Local Convexity-Preserving C 2 Rational Cubic Spline for Convex Data
Abd Majid, Ahmad; Ali, Jamaludin Md.
2014-01-01
We present the smooth and visually pleasant display of 2D data when it is convex, which is contribution towards the improvements over existing methods. This improvement can be used to get the more accurate results. An attempt has been made in order to develop the local convexity-preserving interpolant for convex data using C 2 rational cubic spline. It involves three families of shape parameters in its representation. Data dependent sufficient constraints are imposed on single shape parameter to conserve the inherited shape feature of data. Remaining two of these shape parameters are used for the modification of convex curve to get a visually pleasing curve according to industrial demand. The scheme is tested through several numerical examples, showing that the scheme is local, computationally economical, and visually pleasing. PMID:24757421
Multi-objective convex programming problem arising in multivariate ...
African Journals Online (AJOL)
objective convex programming problem. The objective functions are convex and there is a single linear constraint with some upper and lower bounds. We also consider a two dimensional multivariate problem when the cost is minimized. A numerical ...
International Nuclear Information System (INIS)
Zhang, J.T.; Wang, P.X.; Kong, Q.; Chen, Z.; Ho, Y.K.
2007-01-01
Field expressions are derived for ultra-short, tightly focused laser pulses up to the second-order temporal correction and seventh-order spatial correction. To evaluate the importance of these corrections, we simulate these fields and investigate the final energy of the accelerated electrons. We vary the order of the corrected expressions, the pulse duration, and the beam waist. We find that electron capture is still an important and generic phenomenon in ultra-short, tightly focused laser pulses. While small differences in the electron acceleration are obtained for various orders of the corrected field equations relative to the paraxial field equations, there is no qualitative difference in the behavior of the electron. Furthermore, the temporal and spatial corrections are found to be correlated
Lyapunov convexity type theorems for non-atomic vector measures ...
African Journals Online (AJOL)
atomic, and σ-additive X-valued measure has a convex closure. We give a survey of Lyapunov convexity type theorems pertaining to this problem. We also give a necessary and sufficient condition that will insure the convexity of the closure of the ...
Convex stoma appliances: an audit of stoma care nurses.
Perrin, Angie
2016-12-08
This article observes the complexities surrounding the use of convex appliances within the specialist sphere of stoma care. It highlights some of the results taken from a small audit carried out with 24 stoma care nurses examining the general use of convex appliances and how usage of convex products has evolved, along with specialist stoma care practice.
Absolute tightness: the chemists hesitate to invest
International Nuclear Information System (INIS)
Anon.
1996-01-01
The safety requirements of industries as nuclear plants and the strengthening of regulations in the field of environment (more particularly those related to volatile organic compounds) have lead the manufacturers to build absolute tightness pumps. But these equipments do not answer all the problems and represent a high investment cost. In consequence, the chemists hesitate to invest. (O.L.)
Convex Modeling of Interactions with Strong Heredity.
Haris, Asad; Witten, Daniela; Simon, Noah
2016-01-01
We consider the task of fitting a regression model involving interactions among a potentially large set of covariates, in which we wish to enforce strong heredity. We propose FAMILY, a very general framework for this task. Our proposal is a generalization of several existing methods, such as VANISH [Radchenko and James, 2010], hierNet [Bien et al., 2013], the all-pairs lasso, and the lasso using only main effects. It can be formulated as the solution to a convex optimization problem, which we solve using an efficient alternating directions method of multipliers (ADMM) algorithm. This algorithm has guaranteed convergence to the global optimum, can be easily specialized to any convex penalty function of interest, and allows for a straightforward extension to the setting of generalized linear models. We derive an unbiased estimator of the degrees of freedom of FAMILY, and explore its performance in a simulation study and on an HIV sequence data set.
Convexity, gauge-dependence and tunneling rates
Energy Technology Data Exchange (ETDEWEB)
Plascencia, Alexis D.; Tamarit, Carlos [Institute for Particle Physics Phenomenology, Durham University,South Road, DH1 3LE (United Kingdom)
2016-10-19
We clarify issues of convexity, gauge-dependence and radiative corrections in relation to tunneling rates. Despite the gauge dependence of the effective action at zero and finite temperature, it is shown that tunneling and nucleation rates remain independent of the choice of gauge-fixing. Taking as a starting point the functional that defines the transition amplitude from a false vacuum onto itself, it is shown that decay rates are exactly determined by a non-convex, false vacuum effective action evaluated at an extremum. The latter can be viewed as a generalized bounce configuration, and gauge-independence follows from the appropriate Nielsen identities. This holds for any election of gauge-fixing that leads to an invertible Faddeev-Popov matrix.
Reconstruction of convex bodies from surface tensors
DEFF Research Database (Denmark)
Kousholt, Astrid; Kiderlen, Markus
2016-01-01
We present two algorithms for reconstruction of the shape of convex bodies in the two-dimensional Euclidean space. The first reconstruction algorithm requires knowledge of the exact surface tensors of a convex body up to rank s for some natural number s. When only measurements subject to noise...... of surface tensors are available for reconstruction, we recommend to use certain values of the surface tensors, namely harmonic intrinsic volumes instead of the surface tensors evaluated at the standard basis. The second algorithm we present is based on harmonic intrinsic volumes and allows for noisy...... measurements. From a generalized version of Wirtinger's inequality, we derive stability results that are utilized to ensure consistency of both reconstruction procedures. Consistency of the reconstruction procedure based on measurements subject to noise is established under certain assumptions on the noise...
Convex nonnegative matrix factorization with manifold regularization.
Hu, Wenjun; Choi, Kup-Sze; Wang, Peiliang; Jiang, Yunliang; Wang, Shitong
2015-03-01
Nonnegative Matrix Factorization (NMF) has been extensively applied in many areas, including computer vision, pattern recognition, text mining, and signal processing. However, nonnegative entries are usually required for the data matrix in NMF, which limits its application. Besides, while the basis and encoding vectors obtained by NMF can represent the original data in low dimension, the representations do not always reflect the intrinsic geometric structure embedded in the data. Motivated by manifold learning and Convex NMF (CNMF), we propose a novel matrix factorization method called Graph Regularized and Convex Nonnegative Matrix Factorization (GCNMF) by introducing a graph regularized term into CNMF. The proposed matrix factorization technique not only inherits the intrinsic low-dimensional manifold structure, but also allows the processing of mixed-sign data matrix. Clustering experiments on nonnegative and mixed-sign real-world data sets are conducted to demonstrate the effectiveness of the proposed method. Copyright © 2014 Elsevier Ltd. All rights reserved.
Regularity in mixed-integer convex representability
Lubin, Miles; Zadik, Ilias; Vielma, Juan Pablo
2017-01-01
Characterizations of the sets with mixed integer programming (MIP) formulations using only rational linear inequalities (rational MILP representable) and those with formulations that use arbitrary closed convex constraints (MICP representable) were given by Jeroslow and Lowe (1984), and Lubin, Zadik and Vielma (2017). The latter also showed that even MICP representable subsets of the natural numbers can be more irregular than rational MILP representable ones, unless certain rationality is imp...
Optimal skill distribution under convex skill costs
Directory of Open Access Journals (Sweden)
Tin Cheuk Leung
2018-03-01
Full Text Available This paper studies optimal distribution of skills in an optimal income tax framework with convex skill constraints. The problem is cast as a social planning problem where a redistributive planner chooses how to distribute a given amount of aggregate skills across people. We find that optimal skill distribution is either perfectly equal or perfectly unequal, but an interior level of skill inequality is never optimal.
A Convex Framework for Fair Regression
Berk, Richard; Heidari, Hoda; Jabbari, Shahin; Joseph, Matthew; Kearns, Michael; Morgenstern, Jamie; Neel, Seth; Roth, Aaron
2017-01-01
We introduce a flexible family of fairness regularizers for (linear and logistic) regression problems. These regularizers all enjoy convexity, permitting fast optimization, and they span the rang from notions of group fairness to strong individual fairness. By varying the weight on the fairness regularizer, we can compute the efficient frontier of the accuracy-fairness trade-off on any given dataset, and we measure the severity of this trade-off via a numerical quantity we call the Price of F...
Convex geometry of quantum resource quantification
Regula, Bartosz
2018-01-01
We introduce a framework unifying the mathematical characterisation of different measures of general quantum resources and allowing for a systematic way to define a variety of faithful quantifiers for any given convex quantum resource theory. The approach allows us to describe many commonly used measures such as matrix norm-based quantifiers, robustness measures, convex roof-based measures, and witness-based quantifiers together in a common formalism based on the convex geometry of the underlying sets of resource-free states. We establish easily verifiable criteria for a measure to possess desirable properties such as faithfulness and strong monotonicity under relevant free operations, and show that many quantifiers obtained in this framework indeed satisfy them for any considered quantum resource. We derive various bounds and relations between the measures, generalising and providing significantly simplified proofs of results found in the resource theories of quantum entanglement and coherence. We also prove that the quantification of resources in this framework simplifies for pure states, allowing us to obtain more easily computable forms of the considered measures, and show that many of them are in fact equal on pure states. Further, we investigate the dual formulation of resource quantifiers, which provide a characterisation of the sets of resource witnesses. We present an explicit application of the results to the resource theories of multi-level coherence, entanglement of Schmidt number k, multipartite entanglement, as well as magic states, providing insight into the quantification of the four resources by establishing novel quantitative relations and introducing new quantifiers, such as a measure of entanglement of Schmidt number k which generalises the convex roof–extended negativity, a measure of k-coherence which generalises the \
Stress-Strain diagrams for non-convex particles
Matuttis, Hans-Georg; Nawa, Masaki; Krengel, Dominik
2017-06-01
While most granular materials in nature and technology consist of non-convex particles, the majority of discrete element (DEM) codes are still only able to cope with convex particles, due to the complexity of the computational geometry and the occurrence of multiple contacts. We have reengineered a code for convex polygonal particles to model non-convex particles as rigidly connected clusters. Constricting non-convex particles along the symmetry axes by 30% leads to an increase of the materials strength of up to 50%.
Stress-Strain diagrams for non-convex particles
Directory of Open Access Journals (Sweden)
Matuttis Hans-Georg
2017-01-01
Full Text Available While most granular materials in nature and technology consist of non-convex particles, the majority of discrete element (DEM codes are still only able to cope with convex particles, due to the complexity of the computational geometry and the occurrence of multiple contacts. We have reengineered a code for convex polygonal particles to model non-convex particles as rigidly connected clusters. Constricting non-convex particles along the symmetry axes by 30% leads to an increase of the materials strength of up to 50%.
An easy path to convex analysis and applications
Mordukhovich, Boris S
2013-01-01
Convex optimization has an increasing impact on many areas of mathematics, applied sciences, and practical applications. It is now being taught at many universities and being used by researchers of different fields. As convex analysis is the mathematical foundation for convex optimization, having deep knowledge of convex analysis helps students and researchers apply its tools more effectively. The main goal of this book is to provide an easy access to the most fundamental parts of convex analysis and its applications to optimization. Modern techniques of variational analysis are employed to cl
On convex relaxation of graph isomorphism
Aflalo, Yonathan; Bronstein, Alexander; Kimmel, Ron
2015-01-01
We consider the problem of exact and inexact matching of weighted undirected graphs, in which a bijective correspondence is sought to minimize a quadratic weight disagreement. This computationally challenging problem is often relaxed as a convex quadratic program, in which the space of permutations is replaced by the space of doubly stochastic matrices. However, the applicability of such a relaxation is poorly understood. We define a broad class of friendly graphs characterized by an easily verifiable spectral property. We prove that for friendly graphs, the convex relaxation is guaranteed to find the exact isomorphism or certify its inexistence. This result is further extended to approximately isomorphic graphs, for which we develop an explicit bound on the amount of weight disagreement under which the relaxation is guaranteed to find the globally optimal approximate isomorphism. We also show that in many cases, the graph matching problem can be further harmlessly relaxed to a convex quadratic program with only n separable linear equality constraints, which is substantially more efficient than the standard relaxation involving 2n equality and n2 inequality constraints. Finally, we show that our results are still valid for unfriendly graphs if additional information in the form of seeds or attributes is allowed, with the latter satisfying an easy to verify spectral characteristic. PMID:25713342
On the embedding of convex spaces in stratified L-convex spaces.
Jin, Qiu; Li, Lingqiang
2016-01-01
Consider L being a continuous lattice, two functors from the category of convex spaces (denoted by CS) to the category of stratified L-convex spaces (denoted by SL-CS) are defined. The first functor enables us to prove that the category CS can be embedded in the category SL-CS as a reflective subcategory. The second functor enables us to prove that the category CS can be embedded in the category SL-CS as a coreflective subcategory when L satisfying a multiplicative condition. By comparing the two functors and the well known Lowen functor (between topological spaces and stratified L-topological spaces), we exhibit the difference between (stratified L-)topological spaces and (stratified L-)convex spaces.
The Dirichlet problem for the Monge-Ampere equation in convex (but not strictly convex domains
Directory of Open Access Journals (Sweden)
David Hartenstine
2006-10-01
Full Text Available It is well-known that the Dirichlet problem for the Monge-Amp`ere equation $det D^2 u = mu$ in a bounded strictly convex domain $Omega$ in $mathbb{R}^n$ has a weak solution (in the sense of Aleksandrov for any finite Borel measure $mu$ on $Omega$ and for any continuous boundary data. We consider the Dirichlet problem when $Omega$ is only assumed to be convex, and give a necessary and sufficient condition on the boundary data for solvability.
Directory of Open Access Journals (Sweden)
Nayoung K D Kim
Full Text Available The immunoglobulin (Ig-like domain containing receptor 1 (ILDR1 gene encodes angulin-2/ILDR1, a recently discovered tight junction protein, which forms tricellular tight junction (tTJ structures with tricellulin and lipolysis-stimulated lipoprotein receptor (LSR at tricellular contacts (TCs in the inner ear. Previously reported recessive mutations within ILDR1 have been shown to cause severe to profound nonsyndromic sensorineural hearing loss (SNHL, DFNB42. Whole-exome sequencing of a Korean multiplex family segregating partial deafness identified a novel homozygous ILDR1 variant (p.P69H within the Ig-like domain. To address the pathogenicity of p.P69H, the angulin-2/ILDR1 p.P69H variant protein, along with the previously reported pathogenic ILDR1 mutations, was expressed in angulin-1/LSR knockdown epithelial cells. Interestingly, partial mislocalization of the p.P69H variant protein and tricellulin at TCs was observed, in contrast to a severe mislocalization and complete failure of tricellulin recruitment of the other reported ILDR1 mutations. Additionally, three-dimensional protein modeling revealed that angulin-2/ILDR1 contributed to tTJ by forming a homo-trimer structure through its Ig-like domain, and the p.P69H variant was predicted to disturb homo-trimer formation. In this study, we propose a possible role of angulin-2/ILDR1 in tTJ formation in the inner ear and a wider audiologic phenotypic spectrum of DFNB42 caused by mutations within ILDR1.
International Nuclear Information System (INIS)
Bogomolova, L.K.; Vasilenko, A.T.
1974-01-01
The publication describes the construction and operating principle of the sealed uniflow compressor. This compressor insures against substantial contamination of the medium handled. Use of the slot-type sealing of the piston and rejection of the sliding bearings result in insuring high purity of the medium handled. The compressor performance is as follows: maximum air throughput - 262.6 1/h at 24 deg C and absolute outlet pressure being 1.14 kgf/cm 2 , minimum air throughput - 82.6 1/h at 24 deg C and absolute outlet pressure being 1.4 kgf/cm 2 ; inlet pressure equals 1 kgf/cm 2 . The compressor is provided with a solenoid-operated drive. The prototype has been in service for 6 months, with accumulated service time amounting to 500 h. The compressor has given a good account of itself within this period. The compressor is to be used in the gas purification circuit when this gas is used as a working medium in the spark or streamer chambers
Gas tightness detecting method for overpack
International Nuclear Information System (INIS)
Harashima, Takeo; Hasegawa, Yasuyuki
1999-01-01
High level radioactive wastes and timing gas generation means for jetting out an inert gas after a predetermined period of time are contained together in a steel overpack. A steel lid is welded to the opening of the overpack so as to seal the high level radioactive wastes and the timing gas generation means. Then, the inert gas is jetted out from the timing gas generating device, and the gas tightness is detected by detecting the inert gas at the circumference of the overpack. Alternatively, a corrosion resistant coating layer having a gas generation means for jetting out an inert gas is coated at the circumference of a steel overpack containing high level radioactive wastes, and the overpack is sealed. The inert gas is generated from the gas generating means in the coating layer, and the inert gas at the periphery of the coating layer is detected to determine gas tightness. (N.H.)
Convex and Radially Concave Contoured Distributions
Directory of Open Access Journals (Sweden)
Wolf-Dieter Richter
2015-01-01
Full Text Available Integral representations of the locally defined star-generalized surface content measures on star spheres are derived for boundary spheres of balls being convex or radially concave with respect to a fan in Rn. As a result, the general geometric measure representation of star-shaped probability distributions and the general stochastic representation of the corresponding random vectors allow additional specific interpretations in the two mentioned cases. Applications to estimating and testing hypotheses on scaling parameters are presented, and two-dimensional sample clouds are simulated.
Leadership games with convex strategy sets
Bernhard von Stengel; Shmuel Zamir
2010-01-01
A basic model of commitment is to convert a two-player game in strategic form to a “leadership game” with the same payoffs, where one player, the leader, commits to a strategy, to which the second player always chooses a best reply. This paper studies such leadership games for games with convex strategy sets. We apply them to mixed extensions of finite games, which we analyze completely, including nongeneric games. The main result is that leadership is advantageous in the sense that, as a set...
Localized Multiple Kernel Learning A Convex Approach
2016-11-22
1/2 . Theorem 9 (CLMKL Generalization Error Bounds) Assume that km(x, x) ≤ B, ∀m ∈ NM , x ∈ X . Suppose the loss function ℓ is L- Lipschitz and...mathematical foundation (e.g., Schölkopf and Smola, 2002). The performance of such algorithms, however, crucially depends on the involved kernel function ...approaches to localized MKL (reviewed in Section 1.1) optimize non-convex objective functions . This puts their generalization ability into doubt. Indeed
On conditional independence and log-convexity
Czech Academy of Sciences Publication Activity Database
Matúš, František
2012-01-01
Roč. 48, č. 4 (2012), s. 1137-1147 ISSN 0246-0203 R&D Projects: GA AV ČR IAA100750603; GA ČR GA201/08/0539 Institutional support: RVO:67985556 Keywords : Conditional independence * Markov properties * factorizable distributions * graphical Markov models * log-convexity * Gibbs- Markov equivalence * Markov fields * Gaussian distributions * positive definite matrices * covariance selection model Subject RIV: BA - General Mathematics Impact factor: 0.933, year: 2012 http://library.utia.cas.cz/separaty/2013/MTR/matus-0386229.pdf
Directory of Open Access Journals (Sweden)
Satit Saejung
2005-01-01
Full Text Available We prove that the moduli of U-convexity, introduced by Gao (1995, of the ultrapower X˜ of a Banach space X and of X itself coincide whenever X is super-reflexive. As a consequence, some known results have been proved and improved. More precisely, we prove that uX(1>0 implies that both X and the dual space X∗ of X have uniform normal structure and hence the “worth” property in Corollary 7 of Mazcuñán-Navarro (2003 can be discarded.
Population monotonic solutions on convex games
Toru Hokari
2000-01-01
The Dutta-Ray solution and the Shapley value are two well-known examples of population-monotonic solutions on the domain of convex games. We provide a new formula for the Dutta-Ray solution from which population-monotonicity immediately follows. Then we define a new family of population-monotonic solutions, which we refer to as "sequential Dutta-Ray solutions." We also show that it is possible to construct several symmetric and population-monotonic solutions by using the solutions in this fam...
Convex functions and optimization methods on Riemannian manifolds
Udrişte, Constantin
1994-01-01
This unique monograph discusses the interaction between Riemannian geometry, convex programming, numerical analysis, dynamical systems and mathematical modelling. The book is the first account of the development of this subject as it emerged at the beginning of the 'seventies. A unified theory of convexity of functions, dynamical systems and optimization methods on Riemannian manifolds is also presented. Topics covered include geodesics and completeness of Riemannian manifolds, variations of the p-energy of a curve and Jacobi fields, convex programs on Riemannian manifolds, geometrical constructions of convex functions, flows and energies, applications of convexity, descent algorithms on Riemannian manifolds, TC and TP programs for calculations and plots, all allowing the user to explore and experiment interactively with real life problems in the language of Riemannian geometry. An appendix is devoted to convexity and completeness in Finsler manifolds. For students and researchers in such diverse fields as pu...
Functions with bounded variation in locally convex space
Duchoň, Miloslav; Debiève, Camille
2011-01-01
The present paper is concerned with some properties of functions with values in locally convex vector space, namely functions having bounded variation and generalizations of some theorems for functions with values in locally convex vector spaces replacing Banach spaces, namely Theorem: If X is a sequentially complete locally convex vector space, then the function x(·): [a, b] → X having a bounded variation on the interval [a, b] defines a vector-valued measure m on borelian subsets of [a, b] ...
A Randomized Gossip Consenus Algorithm on Convex Metric Spaces
2012-01-01
Property (C) are not that rare. Indeed, by Smulian’s Theorem ([3], page 443), every weakly compact convex subset of a Banach space has Property (C...www.isr.umd.edu A randomized gossip consensus algorithm on convex metric spaces Ion Matei, Christoforos Somarakis, John S. Baras ISR TECHNICAL REPORT 2012-02...2. REPORT TYPE 3. DATES COVERED 00-00-2012 to 00-00-2012 4. TITLE AND SUBTITLE A randomized gossip consensus algorithm on convex metric spaces
Optimality Certificates for Convex Minimization and Helly Numbers
2016-10-20
Optimality certificates for convex minimization and Helly numbers Amitabh Basu Michele Conforti Gérard Cornuéjols Robert Weismantel Stefan Weltge...October 20, 2016 Abstract We consider the problem of minimizing a convex function over a subset of Rn that is not necessarily convex ( minimization of a...problem. Moreover, the inner optimization problem (2) of minimizing on the boundary of C can be very hard if C has no structure other than being S-free
US production of natural gas from tight reservoirs
International Nuclear Information System (INIS)
1993-01-01
For the purposes of this report, tight gas reservoirs are defined as those that meet the Federal Energy Regulatory Commission's (FERC) definition of tight. They are generally characterized by an average reservoir rock permeability to gas of 0.1 millidarcy or less and, absent artificial stimulation of production, by production rates that do not exceed 5 barrels of oil per day and certain specified daily volumes of gas which increase with the depth of the reservoir. All of the statistics presented in this report pertain to wells that have been classified, from 1978 through 1991, as tight according to the FERC; i.e., they are ''legally tight'' reservoirs. Additional production from ''geologically tight'' reservoirs that have not been classified tight according to the FERC rules has been excluded. This category includes all producing wells drilled into legally designated tight gas reservoirs prior to 1978 and all producing wells drilled into physically tight gas reservoirs that have not been designated legally tight. Therefore, all gas production referenced herein is eligible for the Section 29 tax credit. Although the qualification period for the credit expired at the end of 1992, wells that were spudded (began to be drilled) between 1978 and May 1988, and from November 5, 1990, through year end 1992, are eligible for the tax credit for a subsequent period of 10 years. This report updates the EIA's tight gas production information through 1991 and considers further the history and effect on tight gas production of the Federal Government's regulatory and tax policy actions. It also provides some high points of the geologic background needed to understand the nature and location of low-permeability reservoirs
Effective potential for non-convex potentials
International Nuclear Information System (INIS)
Fujimoto, Y.; O'Raifeartaigh, L.; Parravicini, G.
1983-01-01
It is shown that the well-known relationship between the effective potential GAMMA and the vacuum graphs μ of scalar QFT follows directly from the translational invariance of the measure, and that it holds for all values of the fields phi if, and only if, the classical potential is convex. In the non-convex case μ appears to become complex for some values of phi, but it is shown that the complexity is only apparent and is due to the failure of the loop expansion. The effective potential actually remains real and well-defined for all phi, and reduces to μ in the neighbourhood of the classical minima. A number of examples are considered, notably potentials which are spontaneously broken. In particular the mechanism by which a spontaneous breakdown may be generated by radiative corrections is re-investigated and some new insights obtained. Finally, it is shown that the renormalization group equations for the parameters may be obtained by inspection from the effective potential, and among the examples considered are SU(n) fields and supermultiplets. In particular, it is shown that for supermultiplets the effective potential is not only real but positive. (orig.)
Convex blind image deconvolution with inverse filtering
Lv, Xiao-Guang; Li, Fang; Zeng, Tieyong
2018-03-01
Blind image deconvolution is the process of estimating both the original image and the blur kernel from the degraded image with only partial or no information about degradation and the imaging system. It is a bilinear ill-posed inverse problem corresponding to the direct problem of convolution. Regularization methods are used to handle the ill-posedness of blind deconvolution and get meaningful solutions. In this paper, we investigate a convex regularized inverse filtering method for blind deconvolution of images. We assume that the support region of the blur object is known, as has been done in a few existing works. By studying the inverse filters of signal and image restoration problems, we observe the oscillation structure of the inverse filters. Inspired by the oscillation structure of the inverse filters, we propose to use the star norm to regularize the inverse filter. Meanwhile, we use the total variation to regularize the resulting image obtained by convolving the inverse filter with the degraded image. The proposed minimization model is shown to be convex. We employ the first-order primal-dual method for the solution of the proposed minimization model. Numerical examples for blind image restoration are given to show that the proposed method outperforms some existing methods in terms of peak signal-to-noise ratio (PSNR), structural similarity (SSIM), visual quality and time consumption.
Giant convexity chondroma with meningeal attachment.
Feierabend, Denise; Maksoud, Salah; Lawson McLean, Aaron; Koch, Arend; Kalff, Rolf; Walter, Jan
2018-03-27
Intracranial chondroma is a rare and benign tumor with usual onset in young adulthood. The skull base is the most common site of occurrence although, less often, the tumors can appear at the falx cerebri or at the dural convexity. The differentiation of these lesions from meningiomas through imaging is generally difficult. Clinical case presentation and review of the current literature. We report a case of a 25-year-old male patient with a giant convexity chondroma with meningeal attachment in the right frontal lobe that was detected after a first generalized seizure. Based on the putative diagnosis of meningioma, the tumor was completely resected via an osteoplastic parasagittal craniotomy. The postoperative MRI confirmed the complete tumor resection. Histopathological analysis revealed the presence of a chondroma. Intracranial chondromas are a rarity and their preoperative diagnosis based on neuroimaging is difficult. In young patients and those with skeletal disease, the differential diagnosis of a chondroma should be considered. In symptomatic patients, operative resection is sensible. In most cases total removal of the tumor is possible and leads to full recovery. When the finding is merely incidental in older patients, a watchful waiting approach is acceptable, given the benign and slow-growing nature of the lesion. Copyright © 2018 Elsevier B.V. All rights reserved.
A parallel Discrete Element Method to model collisions between non-convex particles
Directory of Open Access Journals (Sweden)
Rakotonirina Andriarimina Daniel
2017-01-01
Full Text Available In many dry granular and suspension flow configurations, particles can be highly non-spherical. It is now well established in the literature that particle shape affects the flow dynamics or the microstructure of the particles assembly in assorted ways as e.g. compacity of packed bed or heap, dilation under shear, resistance to shear, momentum transfer between translational and angular motions, ability to form arches and block the flow. In this talk, we suggest an accurate and efficient way to model collisions between particles of (almost arbitrary shape. For that purpose, we develop a Discrete Element Method (DEM combined with a soft particle contact model. The collision detection algorithm handles contacts between bodies of various shape and size. For nonconvex bodies, our strategy is based on decomposing a non-convex body into a set of convex ones. Therefore, our novel method can be called “glued-convex method” (in the sense clumping convex bodies together, as an extension of the popular “glued-spheres” method, and is implemented in our own granular dynamics code Grains3D. Since the whole problem is solved explicitly, our fully-MPI parallelized code Grains3D exhibits a very high scalability when dynamic load balancing is not required. In particular, simulations on up to a few thousands cores in configurations involving up to a few tens of millions of particles can readily be performed. We apply our enhanced numerical model to (i the collapse of a granular column made of convex particles and (i the microstructure of a heap of non-convex particles in a cylindrical reactor.
Convex Optimization over Classes of Multiparticle Entanglement
Shang, Jiangwei; Gühne, Otfried
2018-02-01
A well-known strategy to characterize multiparticle entanglement utilizes the notion of stochastic local operations and classical communication (SLOCC), but characterizing the resulting entanglement classes is difficult. Given a multiparticle quantum state, we first show that Gilbert's algorithm can be adapted to prove separability or membership in a certain entanglement class. We then present two algorithms for convex optimization over SLOCC classes. The first algorithm uses a simple gradient approach, while the other one employs the accelerated projected-gradient method. For demonstration, the algorithms are applied to the likelihood-ratio test using experimental data on bound entanglement of a noisy four-photon Smolin state [Phys. Rev. Lett. 105, 130501 (2010), 10.1103/PhysRevLett.105.130501].
Multi-Period Trading via Convex Optimization
DEFF Research Database (Denmark)
Boyd, Stephen; Busseti, Enzo; Diamond, Steve
2017-01-01
We consider a basic model of multi-period trading, which can be used to evaluate the performance of a trading strategy. We describe a framework for single-period optimization, where the trades in each period are found by solving a convex optimization problem that trades oﬀ expected return, risk......, transaction cost and holding cost such as the borrowing cost for shorting assets. We then describe a multi-period version of the trading method, where optimization is used to plan a sequence of trades, with only the ﬁrst one executed, using estimates of future quantities that are unknown when the trades....... In this paper, we do not address a critical component in a trading algorithm, the predictions or forecasts of future quantities. The methods we describe in this paper can be thought of as good ways to exploit predictions, no matter how they are made. We have also developed a companion open-source software...
Tightness of voter model interfaces
Czech Academy of Sciences Publication Activity Database
Sturm, A.; Swart, Jan M.
2008-01-01
Roč. 13, - (2008), s. 165-174 ISSN 1083-589X R&D Projects: GA ČR GA201/06/1323; GA ČR GA201/07/0237 Institutional research plan: CEZ:AV0Z10750506 Keywords : long range voter model * swapping voter model * interface tightness * exclusion process Subject RIV: BD - Theory of Information Impact factor: 0.392, year: 2008 http://www.emis.de/journals/EJP-ECP/_ejpecp/index.html
Convergence of Algorithms for Reconstructing Convex Bodies and Directional Measures
DEFF Research Database (Denmark)
Gardner, Richard; Kiderlen, Markus; Milanfar, Peyman
2006-01-01
We investigate algorithms for reconstructing a convex body K in Rn from noisy measurements of its support function or its brightness function in k directions u1, . . . , uk. The key idea of these algorithms is to construct a convex polytope Pk whose support function (or brightness function) best...
New type integral inequalities for convex functions with applications II
Mehrez, Khaled; Agarwal, Praveen
2017-01-01
We have recently established some integral inequalities for convex functions via the Hermite-Hadamard's inequalities. In continuation here, we also establish some interesting new integral inequalities for convex functions via the Hermite--Hadamard's inequalities and Jensen's integral inequality. Useful applications involving special means are also included.
Convexity-preserving Bernstein–Bézier quartic scheme
Directory of Open Access Journals (Sweden)
Maria Hussain
2014-07-01
Full Text Available A C1 convex surface data interpolation scheme is presented to preserve the shape of scattered data arranged over a triangular grid. Bernstein–Bézier quartic function is used for interpolation. Lower bound of the boundary and inner Bézier ordinates is determined to guarantee convexity of surface. The developed scheme is flexible and involves more relaxed constraints.
On some interpolation properties in locally convex spaces
Energy Technology Data Exchange (ETDEWEB)
Pater, Flavius [Department of Mathematics, Politehnica University of Timişoara, 300004 Timişoara (Romania)
2015-03-10
The aim of this paper is to introduce the notion of interpolation between locally convex spaces, the real method, and to present some elementary results in this setting. This represents a generalization from the Banach spaces framework to the locally convex spaces sequentially complete one, where the operators acting on them are locally bounded.
Fundamentals of convex analysis duality, separation, representation, and resolution
Panik, Michael J
1993-01-01
Fundamentals of Convex Analysis offers an in-depth look at some of the fundamental themes covered within an area of mathematical analysis called convex analysis. In particular, it explores the topics of duality, separation, representation, and resolution. The work is intended for students of economics, management science, engineering, and mathematics who need exposure to the mathematical foundations of matrix games, optimization, and general equilibrium analysis. It is written at the advanced undergraduate to beginning graduate level and the only formal preparation required is some familiarity with set operations and with linear algebra and matrix theory. Fundamentals of Convex Analysis is self-contained in that a brief review of the essentials of these tool areas is provided in Chapter 1. Chapter exercises are also provided. Topics covered include: convex sets and their properties; separation and support theorems; theorems of the alternative; convex cones; dual homogeneous systems; basic solutions and comple...
Hao, Xiao-Hu; Zhang, Gui-Jun; Zhou, Xiao-Gen; Yu, Xu-Feng
2016-01-01
To address the searching problem of protein conformational space in ab-initio protein structure prediction, a novel method using abstract convex underestimation (ACUE) based on the framework of evolutionary algorithm was proposed. Computing such conformations, essential to associate structural and functional information with gene sequences, is challenging due to the high-dimensionality and rugged energy surface of the protein conformational space. As a consequence, the dimension of protein conformational space should be reduced to a proper level. In this paper, the high-dimensionality original conformational space was converted into feature space whose dimension is considerably reduced by feature extraction technique. And, the underestimate space could be constructed according to abstract convex theory. Thus, the entropy effect caused by searching in the high-dimensionality conformational space could be avoided through such conversion. The tight lower bound estimate information was obtained to guide the searching direction, and the invalid searching area in which the global optimal solution is not located could be eliminated in advance. Moreover, instead of expensively calculating the energy of conformations in the original conformational space, the estimate value is employed to judge if the conformation is worth exploring to reduce the evaluation time, thereby making computational cost lower and the searching process more efficient. Additionally, fragment assembly and the Monte Carlo method are combined to generate a series of metastable conformations by sampling in the conformational space. The proposed method provides a novel technique to solve the searching problem of protein conformational space. Twenty small-to-medium structurally diverse proteins were tested, and the proposed ACUE method was compared with It Fix, HEA, Rosetta and the developed method LEDE without underestimate information. Test results show that the ACUE method can more rapidly and more
Approximating convex Pareto surfaces in multiobjective radiotherapy planning
International Nuclear Information System (INIS)
Craft, David L.; Halabi, Tarek F.; Shih, Helen A.; Bortfeld, Thomas R.
2006-01-01
Radiotherapy planning involves inherent tradeoffs: the primary mission, to treat the tumor with a high, uniform dose, is in conflict with normal tissue sparing. We seek to understand these tradeoffs on a case-to-case basis, by computing for each patient a database of Pareto optimal plans. A treatment plan is Pareto optimal if there does not exist another plan which is better in every measurable dimension. The set of all such plans is called the Pareto optimal surface. This article presents an algorithm for computing well distributed points on the (convex) Pareto optimal surface of a multiobjective programming problem. The algorithm is applied to intensity-modulated radiation therapy inverse planning problems, and results of a prostate case and a skull base case are presented, in three and four dimensions, investigating tradeoffs between tumor coverage and critical organ sparing
Analytic convexity: some comments on an example of de Giorgi and Piccinini
International Nuclear Information System (INIS)
Andreotti, A.; Nacinovich, M.
1976-01-01
l. Introduction. 2. Csup(infinite) and analytical convexity for a complex of differential equations with constant coefficients. 3. Reduction of the analytic convexity to the Csup(infinite) convexity. 4. The example of de Giorgi-Piccinini. (author)
Contraption and Prediction of Exhalation Tight Brownstone in Exhalation Cistern
XhingZhiwang, -; Xuchao, -
2012-01-01
The reservoir connate water saturation is high and gas wells generally produce water which seriously affects the productivity of gas wells in Xujiahe tight sandstone gas reservoirs in Sichuan Basin. Take the sixth formation for example, there are 39 wells producing water unequally in the 42 commissioning wells, and the excessive water production leads to the production of the gas well declining rapidly. Studying of the mechanism of water production in tight sandstone gas reservoirs and predic...
Learning Convex Regularizers for Optimal Bayesian Denoising
Nguyen, Ha Q.; Bostan, Emrah; Unser, Michael
2018-02-01
We propose a data-driven algorithm for the maximum a posteriori (MAP) estimation of stochastic processes from noisy observations. The primary statistical properties of the sought signal is specified by the penalty function (i.e., negative logarithm of the prior probability density function). Our alternating direction method of multipliers (ADMM)-based approach translates the estimation task into successive applications of the proximal mapping of the penalty function. Capitalizing on this direct link, we define the proximal operator as a parametric spline curve and optimize the spline coefficients by minimizing the average reconstruction error for a given training set. The key aspects of our learning method are that the associated penalty function is constrained to be convex and the convergence of the ADMM iterations is proven. As a result of these theoretical guarantees, adaptation of the proposed framework to different levels of measurement noise is extremely simple and does not require any retraining. We apply our method to estimation of both sparse and non-sparse models of L\\'{e}vy processes for which the minimum mean square error (MMSE) estimators are available. We carry out a single training session and perform comparisons at various signal-to-noise ratio (SNR) values. Simulations illustrate that the performance of our algorithm is practically identical to the one of the MMSE estimator irrespective of the noise power.
Almost convex metrics and Peano compactifications
Directory of Open Access Journals (Sweden)
R. F. Dickman
1982-01-01
Full Text Available Let (X,d denote a locally connected, connected separable metric space. We say the X is S-metrizable provided there is a topologically equivalent metric ρ on X such that (X,ρ has Property S, i.e., for any ϵ>0, X is the union of finitely many connected sets of ρ-diameter less than ϵ. It is well-known that S-metrizable spaces are locally connected and that if ρ is a Property S metric for X, then the usual metric completion (X˜,ρ˜ of (X,ρ is a compact, locally connected, connected metric space; i.e., (X˜,ρ˜ is a Peano compactification of (X,ρ. In an earlier paper, the author conjectured that if a space (X,d has a Peano compactification, then it must be S-metrizable. In this paper, that conjecture is shown to be false; however, the connected spaces which have Peano compactificatons are shown to be exactly those having a totally bounded, almost convex metric. Several related results are given.
Designing Camera Networks by Convex Quadratic Programming
Ghanem, Bernard
2015-05-04
In this paper, we study the problem of automatic camera placement for computer graphics and computer vision applications. We extend the problem formulations of previous work by proposing a novel way to incorporate visibility constraints and camera-to-camera relationships. For example, the placement solution can be encouraged to have cameras that image the same important locations from different viewing directions, which can enable reconstruction and surveillance tasks to perform better. We show that the general camera placement problem can be formulated mathematically as a convex binary quadratic program (BQP) under linear constraints. Moreover, we propose an optimization strategy with a favorable trade-off between speed and solution quality. Our solution is almost as fast as a greedy treatment of the problem, but the quality is significantly higher, so much so that it is comparable to exact solutions that take orders of magnitude more computation time. Because it is computationally attractive, our method also allows users to explore the space of solutions for variations in input parameters. To evaluate its effectiveness, we show a range of 3D results on real-world floorplans (garage, hotel, mall, and airport).
Shape preserving rational cubic spline for positive and convex data
Directory of Open Access Journals (Sweden)
Malik Zawwar Hussain
2011-11-01
Full Text Available In this paper, the problem of shape preserving C2 rational cubic spline has been proposed. The shapes of the positive and convex data are under discussion of the proposed spline solutions. A C2 rational cubic function with two families of free parameters has been introduced to attain the C2 positive curves from positive data and C2 convex curves from convex data. Simple data dependent constraints are derived on free parameters in the description of rational cubic function to obtain the desired shape of the data. The rational cubic schemes have unique representations.
On the stretch factor of convex polyhedra whose vertices are (almost on a sphere
Directory of Open Access Journals (Sweden)
Michiel Smid
2016-10-01
Full Text Available Let $P$ be a convex polyhedron in $\\mathbb{R}^3$. The skeleton of $P$ is the graph whose vertices and edges are the vertices and edges of $P$, respectively. We prove that, if these vertices are on the unit-sphere, the skeleton is a $(0.999 \\cdot \\pi$-spanner. If the vertices are very close to this sphere, then the skeleton is not necessarily a spanner. For the case when the boundary of $P$ is between two concentric spheres of radii $1$ and $R>1$, and the angles in all faces are at least $\\theta$, we prove that the skeleton is a $t$-spanner, where $t$ depends only on $R$ and $\\theta$. One of the ingredients in the proof is a tight upper bound on the geometric dilation of a convex cycle that is contained in an annulus.
Diagnosing the tight building syndrome
Energy Technology Data Exchange (ETDEWEB)
Rogers, S.A.
1987-12-01
Formaldehyde is but one of many chemicals capable of causing the tight building syndrome or environmentally induced illness (EI). The spectrum of symptoms it may induce includes attacks of headache, flushing, laryngitis, dizziness, nausea, extreme weakness, arthralgia, unwarranted depression, dysphonia, exhaustion, inability to think clearly, arrhythmia or muscle spasms. The nonspecificity of such symptoms can baffle physicians from many specialties. Presented herein is a simple office method for demonstrating that formaldehyde is among the etiologic agents triggering these symptoms. The very symptoms that patients complain of can be provoked within minutes, and subsequently abolished, with an intradermal injection of the appropriate strength of formaldehyde. This injection aids in convincing the patient of the cause of the symptoms so he can initiate measure to bring his disease under control.
Invasive tightly coupled processor arrays
LARI, VAHID
2016-01-01
This book introduces new massively parallel computer (MPSoC) architectures called invasive tightly coupled processor arrays. It proposes strategies, architecture designs, and programming interfaces for invasive TCPAs that allow invading and subsequently executing loop programs with strict requirements or guarantees of non-functional execution qualities such as performance, power consumption, and reliability. For the first time, such a configurable processor array architecture consisting of locally interconnected VLIW processing elements can be claimed by programs, either in full or in part, using the principle of invasive computing. Invasive TCPAs provide unprecedented energy efficiency for the parallel execution of nested loop programs by avoiding any global memory access such as GPUs and may even support loops with complex dependencies such as loop-carried dependencies that are not amenable to parallel execution on GPUs. For this purpose, the book proposes different invasion strategies for claiming a desire...
A survey on locally uniformly A-convex algebras
International Nuclear Information System (INIS)
Oudadess, M.
1984-12-01
Using a bornological technic of M. Akkar, we reduce the study of classical questions (spectrum, boundedness of characters, functional calculus, etc.) in locally uniformly A-convex algebras to the Banach case. (author)
Towards a Convex-Analytic View of Impossibility Results in ...
Indian Academy of Sciences (India)
Ankur A. Kulkarni
2016-11-05
Towards a Convex-Analytic View of Impossibility Results in. Stochastic Control and Information Theory. Ankur A. Kulkarni. Systems and Control Engineering. Indian Institute of Technology Bombay. November 5, 2016. 1 / 12 ...
Convex solutions of systems arising from Monge-Ampere equations
Directory of Open Access Journals (Sweden)
Haiyan Wang
2009-10-01
Full Text Available We establish two criteria for the existence of convex solutions to a boundary value problem for weakly coupled systems arising from the Monge-Ampère equations. We shall use fixed point theorems in a cone.
Displacement Convexity for First-Order Mean-Field Games
Seneci, Tommaso
2018-05-01
In this thesis, we consider the planning problem for first-order mean-field games (MFG). These games degenerate into optimal transport when there is no coupling between players. Our aim is to extend the concept of displacement convexity from optimal transport to MFGs. This extension gives new estimates for solutions of MFGs. First, we introduce the Monge-Kantorovich problem and examine related results on rearrangement maps. Next, we present the concept of displacement convexity. Then, we derive first-order MFGs, which are given by a system of a Hamilton-Jacobi equation coupled with a transport equation. Finally, we identify a large class of functions, that depend on solutions of MFGs, which are convex in time. Among these, we find several norms. This convexity gives bounds for the density of solutions of the planning problem.
Lipschitz estimates for convex functions with respect to vector fields
Directory of Open Access Journals (Sweden)
Valentino Magnani
2012-12-01
Full Text Available We present Lipschitz continuity estimates for a class of convex functions with respect to Hörmander vector fields. These results have been recently obtained in collaboration with M. Scienza, [22].
Subaperture Stitching Interferometry for Large Convex Aspheric Surfaces Project
National Aeronautics and Space Administration — The size and accuracy specifications of telescope mirrors are ever more demanding. This is particularly true for secondary mirrors, as they are convex and thus...
Subaperture Stitching Interferometry for Large Convex Aspheric Surfaces, Phase II
National Aeronautics and Space Administration — The size and accuracy specifications of telescope mirrors are ever more demanding. This is particularly true for secondary mirrors, as they are convex and thus...
A simple convex optimization problem with many applications
DEFF Research Database (Denmark)
Vidal, Rene Victor Valqui
1994-01-01
This paper presents an algorithm for the solution of a simple convex optimization problem. This problem is a generalization of several other optimization problems which have applications to resource allocation, optimal capacity expansion, and vehicle scheduling. The algorithm is based...
Celestial Walk: A Terminating Oblivious Walk for Convex Subdivisions
Kuijper, Wouter; Ermolaev, Victor; Devillers, Olivier
2017-01-01
We present a new oblivious walking strategy for convex subdivisions. Our walk is faster than the straight walk and more generally applicable than the visibility walk. To prove termination of our walk we use a novel monotonically decreasing distance measure.
Lim, Su-Min; Jeong, Jin-Ju; Woo, Kyung Hee; Han, Myung Joo; Kim, Dong-Hyun
2016-04-01
A high-fat diet (HFD) induces obesity and the associated increases in blood glucose and inflammation through changes in gut microbiota, endotoxemia, and increased gut permeability. To counteract this, researchers have suggested that the use of probiotics that suppress production of proinflammatory lipopolysaccharide (LPS). Here, we tested whether Lactobacillus sakei OK67, which inhibits gut microbiota LPS production selected from among the lactic acid bacteria isolated from kimchi, exerted antihypoglycemic or anti-inflammatory effects in HFD-fed mice. Mice were randomly divided into 2 groups and fed an HFD or a low-fat diet for 4 weeks. These groups were further subdivided; 1 subgroup was treated with L sakei OK67 and fed the experimental diet for 4.5 weeks, whereas the other subgroup was fed the experimental diet alone. L sakei OK67 treatment lowered HFD-elevated LPS levels in blood and colonic fluid and significantly decreased HFD-elevated fasting blood glucose levels and the area under the curve in an oral glucose tolerance test. L sakei OK67 treatment inhibited HFD-induced body and epididymal fat weight gains, suppressed HFD-induced tumor necrosis factor-α and interleukin-1β expression and nuclear factor-κB activation in the colon, and significantly increased HFD-suppressed interleukin-10 and tight junction protein expression in the colon. Oral administration of L sakei OK67 significantly downregulated HFD-induced expression of peroxisome proliferator-activated receptor γ, fatty acid synthase, and tumor necrosis factor-α in adipose tissue. In addition, L sakei OK67 treatment strongly inhibited nuclear factor-κB activation in LPS-stimulated peritoneal macrophages. We report that L sakei OK67 ameliorates HFD-induced hyperglycemia and obesity by reducing inflammation and increasing the expression of colon tight junction proteins in mice. Copyright © 2016 Elsevier Inc. All rights reserved.
Multi-objective convex programming problem arising in multivariate ...
African Journals Online (AJOL)
user
C. XC to. Subject a p j. X a. V. Minimize i i. L i ii. L i i ij j. (5). The objective functions in (equation 5) are convex [see Kokan and Khan (1967)], the single constraint is linear and the bounds are also linear. The problem (5) is, therefore a multi-objective convex programming problem. If some tolerance limits, say j v are given on ...
Non-convex mixed-integer nonlinear programming: a survey
Burer, S; Letchford, Adam
2012-01-01
A wide range of problems arising in practical applications can be formulated as Mixed-Integer Nonlinear Programs (MINLPs). For the case in which the objective and constraint functions are convex, some quite effective exact and heuristic algorithms are available. When nonconvexities are present, however, things become much more difficult, since then even the continuous relaxation is a global optimisation problem. We survey the literature on non-convex MINLP, discussing applications, algorithms...
Two examples of non strictly convex large deviations
De Marco, Stefano; Jacquier, Antoine; Roome, Patrick
2016-01-01
We present two examples of a large deviations principle where the rate function is not strictly convex. This is motivated by a model used in mathematical finance (the Heston model), and adds a new item to the zoology of non strictly convex large deviations. For one of these examples, we show that the rate function of the Cramer-type of large deviations coincides with that of the Freidlin-Wentzell when contraction principles are applied.
Directory of Open Access Journals (Sweden)
Ma Wujun
2010-05-01
Full Text Available Abstract Background The complexity of the wheat genome has resulted from waves of retrotransposable element insertions. Gene deletions and disruptions generated by the fast replacement of repetitive elements in wheat have resulted in disruption of colinearity at a micro (sub-megabase level among the cereals. In view of genomic changes that are possible within a given time span, conservation of genes between species tends to imply an important functional or regional constraint that does not permit a change in genomic structure. The ctg1034 contig completed in this paper was initially studied because it was assigned to the Sr2 resistance locus region, but detailed mapping studies subsequently assigned it to the long arm of 3B and revealed its unusual features. Results BAC shotgun sequencing of the hexaploid wheat (Triticum aestivum cv. Chinese Spring genome has been used to assemble a group of 15 wheat BACs from the chromosome 3B physical map FPC contig ctg1034 into a 783,553 bp genomic sequence. This ctg1034 sequence was annotated for biological features such as genes and transposable elements. A three-gene island was identified among >80% repetitive DNA sequence. Using bioinformatics analysis there were no observable similarity in their gene functions. The ctg1034 gene island also displayed complete conservation of gene order and orientation with syntenic gene islands found in publicly available genome sequences of Brachypodium distachyon, Oryza sativa, Sorghum bicolor and Zea mays, even though the intergenic space and introns were divergent. Conclusion We propose that ctg1034 is located within the heterochromatic C-band region of deletion bin 3BL7 based on the identification of heterochromatic tandem repeats and presence of significant matches to chromodomain-containing gypsy LTR retrotransposable elements. We also speculate that this location, among other highly repetitive sequences, may account for the relative stability in gene order and
Directory of Open Access Journals (Sweden)
Horváth László
2011-01-01
Full Text Available Abstract In this paper, a new parameter-dependent refinement of the discrete Jensen's inequality is given for convex and mid-convex functions. The convergence of the introduced sequences is also studied. One of the proofs requires an interesting convergence theorem with probability theoretical background. We apply the results to define some new quasi-arithmetic and mixed symmetric means and study their monotonicity and convergence.
Directory of Open Access Journals (Sweden)
Rafa Espínola
2010-01-01
Full Text Available We study the existence of fixed points and convergence of iterates for asymptotic pointwise contractions in uniformly convex metric spaces. We also study the existence of fixed points for set-valued nonexpansive mappings in the same class of spaces. Our results do not assume convexity of the metric which makes a big difference when studying the existence of fixed points for set-valued mappings.
JPEG2000-coded image error concealment exploiting convex sets projections.
Atzori, Luigi; Ginesu, Giaime; Raccis, Alessio
2005-04-01
Transmission errors in JPEG2000 can be grouped into three main classes, depending on the affected area: LL, high frequencies at the lower decomposition levels, and high frequencies at the higher decomposition levels. The first type of errors are the most annoying but can be concealed exploiting the signal spatial correlation like in a number of techniques proposed in the past; the second are less annoying but more difficult to address; the latter are often imperceptible. In this paper, we address the problem of concealing the second class or errors when high bit-planes are damaged by proposing a new approach based on the theory of projections onto convex sets. Accordingly, the error effects are masked by iteratively applying two procedures: low-pass (LP) filtering in the spatial domain and restoration of the uncorrupted wavelet coefficients in the transform domain. It has been observed that a uniform LP filtering brought to some undesired side effects that negatively compensated the advantages. This problem has been overcome by applying an adaptive solution, which exploits an edge map to choose the optimal filter mask size. Simulation results demonstrated the efficiency of the proposed approach.
Surgery for convexity/parasagittal/falx meningiomas
International Nuclear Information System (INIS)
Ochi, Takashi; Saito, Nobuhito
2013-01-01
Incidence of the complication related with the surgical treatment of meningiomas in the title was reviewed together with consideration of data about progress observation and stereotactic radiosurgery. MEDLINE papers in English were on line searched with keywords contained in above using PubMed System. For the convexity meningioma, 50-141 cases (mean age, 48-58.9 y) with 1.9-3.6 cm or 146.3 mL of the tumor size or volume were reported in 6 literatures (2006-2011), presenting 0% of surgery related death, 1-5.9% of internal medical or 5.5-37.4% of surgical complication, 0-2% of postoperative hemorrhage, 0-15.4% of neurological and 0-15.4% of prolonged/permanent deficits. For the parasagittal/falx meningioma, 46-108 cases (age, 55-58 y) with 1.9-4 cm tumor were reported in 8 literatures (2004-2011), presenting 0-5.7% death, 2-7.4% medical or 5.4-31% surgical complication, 0-3% hemorrhage, 0-15.4 neurologic and 0-15.4% prolonged deficits. For complications after the radiosurgery of the all 3 meningiomas, 41-832 cases (50-60 y) with tumors of 24.7-28 mm or 4.7-7.4 mL were reported in 8 literatures (2003-2012), presenting the incidence of 6.8-26.8% of radiation-related complications like headache, seizures and paralysis necessary for steroid treatment, and 1.20 or 4.80% of permanent morbidity. For the natural history of incidental meningiomas involving tentorium one, 16-144 cases in 6 literatures (2000-2012) revealed the growth rate/y of 1.9-3.9 mm or 0.54-1.15 mL. The outcome of surgical treatment of the meningiomas, a representative benign tumor, was concluded to be rather good as surgery was generally needed only when the disease became symptomatic due to the tumor growth. (T.T.)
Tightly Secure Signatures From Lossy Identification Schemes
Abdalla , Michel; Fouque , Pierre-Alain; Lyubashevsky , Vadim; Tibouchi , Mehdi
2015-01-01
International audience; In this paper, we present three digital signature schemes with tight security reductions in the random oracle model. Our first signature scheme is a particularly efficient version of the short exponent discrete log-based scheme of Girault et al. (J Cryptol 19(4):463–487, 2006). Our scheme has a tight reduction to the decisional short discrete logarithm problem, while still maintaining the non-tight reduction to the computational version of the problem upon which the or...
Visualization of pool boiling on downward-facing convex surfaces
International Nuclear Information System (INIS)
Ei-genk, M.S.; Gao, C.
1997-01-01
Visualizations and quenching experiments were performed to investigate effect of material properties on pool boiling from downward-facing, convex stainless steel and copper surfaces in saturated water. Video images showed that more than one boiling regimes can co-exist on the surface. Maximum heat flux (MHF) occurred first at lowermost position, then propagated radially outward to higher inclination positions and its local value decreased with increased inclination. However, the wall superheats corresponding to MHF were independent of the local surface inclinations. MHF propagated ∼10 times slower on stainless-steel than on copper and was ∼12% and 40% lower on stainless-steel than on copper at θ = 0 degree and θ 7.91 degree, respectively. Results confirmed that transition boiling consisted of two distinct regions: high wall superheat, in which heat flux increased relatively slowly, and low wall superheat, in which heat flux increased precipitously with time. Nuclear boiling regime also consisted of two distinct regions: high heat flux nucleate boiling, in which heat flux decreased with increased inclination, and low heat flux nucleate boiling, in which heat flux increased with increased inclination
Generalized bounds for convex multistage stochastic programs
Künzi, H; Fandel, G; Trockel, W; Basile, A; Drexl, A; Dawid, H; Inderfurth, K; Kürsten, W; Schittko, U
2005-01-01
This work was completed during my tenure as a scientific assistant and d- toral student at the Institute for Operations Research at the University of St. Gallen. During that time, I was involved in several industry projects in the field of power management, on the occasion of which I was repeatedly c- fronted with complex decision problems under uncertainty. Although usually hard to solve, I quickly learned to appreciate the benefit of stochastic progr- ming models and developed a strong interest in their theoretical properties. Motivated both by practical questions and theoretical concerns, I became p- ticularly interested in the art of finding tight bounds on the optimal value of a given model. The present work attempts to make a contribution to this important branch of stochastic optimization theory. In particular, it aims at extending some classical bounding methods to broader problem classes of practical relevance. This book was accepted as a doctoral thesis by the University of St. Gallen in June 2004.1...
[A case of rapidly growing dumbbell-shaped convexity meningioma].
Kawahara, Ichiro; Nakamoto, Morito; Matsuo, Yoshitaka; Tokunaga, Yoshiharu I; Abe, Kuniko
2009-06-01
We have had more opportunities to treat incidental meningiomas owing to the recent development of neuroradiological imaging. Generally, most of them are treated conservatively unless they grow rapidly or change to symptomatic. Rapidly growing meningiomas are unusual because meningiomas are generally benign and slow-growing tumors. Particularly, the indication of surgery in elderly patients with asymptomatic meningiomas must be considered very carefully because of the higher risks of complications or postoperative neurological deficits. The author describes a rare case of a rapidly growing dumbbell-shaped convexity meningioma in an elderly patient. The tumor was removed completely (Simpson grade II), and the pathological diagnosis was atypical meningioma. There was a difference of MIB-1 LI within the tumor, which suggests that the difference of proliferation within the meningioma may have changed it into "dumbbell-shaped". The only factor we could identify to explain the rapid growth was the high MIB-1LI. This represents an interesting example of a rapidly growing meningiomas. Although the indication of aggresive surgery in elderly patients with symptomatic meningiomas should be considered, the postoperative deterioration of quality of life must be avoided. And earlier postoperative rehabilitation can be regarded as indispensable for elderly patients.
Measurement of laser welding pool geometry using a closed convex active contour model
International Nuclear Information System (INIS)
Zheng, Rui; Zhang, Pu; Duan, Aiqing; Xiao, Peng
2014-01-01
The purpose of this study was to develop a computer vision method to measure geometric parameters of the weld pool in a deep penetration CO 2 laser welding system. Accurate measurement was achieved by removing a huge amount of interference caused by spatter, arc light and plasma to extract the true weld pool contour. This paper introduces a closed convex active contour (CCAC) model derived from the active contour model (snake model), which is a more robust high-level vision method than the traditional low-level vision methods. We made an improvement by integrating an active contour with the information that the weld pool contour is almost a closed convex curve. An effective thresholding method and an improved greedy algorithm are also given to complement the CCAC model. These influences can be effectively removed by using the CCAC model to acquire and measure the weld pool contour accurately and relatively fast. (paper)
Directory of Open Access Journals (Sweden)
Suresh Thenozhi
2012-01-01
Full Text Available An important objective of health monitoring systems for tall buildings is to diagnose the state of the building and to evaluate its possible damage. In this paper, we use our prototype to evaluate our data-mining approach for the fault monitoring. The offset cancellation and high-pass filtering techniques are combined effectively to solve common problems in numerical integration of acceleration signals in real-time applications. The integration accuracy is improved compared with other numerical integrators. Then we introduce a novel method for support vector machine (SVM classification, called convex-concave hull. We use the Jarvis march method to decide the concave (nonconvex hull for the inseparable points. Finally the vertices of the convex-concave hull are applied for SVM training.
Trace-Inequalities and Matrix-Convex Functions
Directory of Open Access Journals (Sweden)
Tsuyoshi Ando
2010-01-01
Full Text Available A real-valued continuous function f(t on an interval (α,β gives rise to a map X↦f(X via functional calculus from the convex set of n×n Hermitian matrices all of whose eigenvalues belong to the interval. Since the subpace of Hermitian matrices is provided with the order structure induced by the cone of positive semidefinite matrices, one can consider convexity of this map. We will characterize its convexity by the following trace-inequalities: Tr(f(B−f(A(C−B≤Tr(f(C−f(B(B−A for A≤B≤C. A related topic will be also discussed.
Stability results for convex bodies in geometric tomography
DEFF Research Database (Denmark)
Kiderlen, Markus
2008-01-01
improve the Holder exponents of known stability results for these transforms. The key idea for this improvement is to use the fact that support functions of convex bodies are elements of any spherical Sobolev space of derivative order less than 3/2. As the analytical representation Q(K,.) may......We consider the question in how far a convex body (non-empty compact convex set) K in n-dimensional space is determined by tomographic measurements (in a broad sense). Usually these measurements are derived from K by geometrical operations like sections, projections and certain averages of those....... We restrict to tomographic measurements F(K,.) that can be written as function on the unit sphere and depend additively on an analytical representation Q(K,.) of K. The first main result states that F(K,.) is a multiplier-rotation operator of Q(K,.) whenever the tomographic data depends...
Optimally Convex Controller and Model Reduction for a Dynamic System
Directory of Open Access Journals (Sweden)
P. S. KHUNTIA
2008-07-01
Full Text Available This paper presents analysis and design of a family of controllers based on numerical convex optimization for an aircraft pitch control system. A design method is proposed here to solve control system design problems in which a set of multiple closed loop performance specifications are simultaneously satisfied. The transfer matrix of the system is determined through the convex combination of the transfer matrices of the plant and the controllers. The present system with optimal convex controller has been tested for stability using Kharitonov’s Stability Criteria. The simulation deals here withthe problem of pitch control system of a BRAVO fighter aircraft which results in higher order close loop transfer function. So the order of the higher order transfer function is reduced to minimize the complexity of the system.
A working-set framework for sequential convex approximation methods
DEFF Research Database (Denmark)
Stolpe, Mathias
2008-01-01
We present an active-set algorithmic framework intended as an extension to existing implementations of sequential convex approximation methods for solving nonlinear inequality constrained programs. The framework is independent of the choice of approximations and the stabilization technique used...... to guarantee global convergence of the method. The algorithm works directly on the nonlinear constraints in the convex sub-problems and solves a sequence of relaxations of the current sub-problem. The algorithm terminates with the optimal solution to the sub-problem after solving a finite number of relaxations....
Derivative-free generation and interpolation of convex Pareto optimal IMRT plans
International Nuclear Information System (INIS)
Hoffmann, Aswin L; Siem, Alex Y D; Hertog, Dick den; Kaanders, Johannes H A M; Huizenga, Henk
2006-01-01
In inverse treatment planning for intensity-modulated radiation therapy (IMRT), beamlet intensity levels in fluence maps of high-energy photon beams are optimized. Treatment plan evaluation criteria are used as objective functions to steer the optimization process. Fluence map optimization can be considered a multi-objective optimization problem, for which a set of Pareto optimal solutions exists: the Pareto efficient frontier (PEF). In this paper, a constrained optimization method is pursued to iteratively estimate the PEF up to some predefined error. We use the property that the PEF is convex for a convex optimization problem to construct piecewise-linear upper and lower bounds to approximate the PEF from a small initial set of Pareto optimal plans. A derivative-free Sandwich algorithm is presented in which these bounds are used with three strategies to determine the location of the next Pareto optimal solution such that the uncertainty in the estimated PEF is maximally reduced. We show that an intelligent initial solution for a new Pareto optimal plan can be obtained by interpolation of fluence maps from neighbouring Pareto optimal plans. The method has been applied to a simplified clinical test case using two convex objective functions to map the trade-off between tumour dose heterogeneity and critical organ sparing. All three strategies produce representative estimates of the PEF. The new algorithm is particularly suitable for dynamic generation of Pareto optimal plans in interactive treatment planning
The selection problem for discounted Hamilton–Jacobi equations: some non-convex cases
Gomes, Diogo A.
2018-01-26
Here, we study the selection problem for the vanishing discount approximation of non-convex, first-order Hamilton–Jacobi equations. While the selection problem is well understood for convex Hamiltonians, the selection problem for non-convex Hamiltonians has thus far not been studied. We begin our study by examining a generalized discounted Hamilton–Jacobi equation. Next, using an exponential transformation, we apply our methods to strictly quasi-convex and to some non-convex Hamilton–Jacobi equations. Finally, we examine a non-convex Hamiltonian with flat parts to which our results do not directly apply. In this case, we establish the convergence by a direct approach.
Prediction of Gas Leak Tightness of Superplastically Formed Products
Snippe, Q.H.C.; Meinders, Vincent T.; Barlat, F; Moon, Y.H.; Lee, M.G.
2010-01-01
In some applications, in this case an aluminium box in a subatomic particle detector containing highly sensitive detecting devices, it is important that a formed sheet should show no gas leak from one side to the other. In order to prevent a trial-and-error procedure to make this leak tight box, a
Directory of Open Access Journals (Sweden)
Stefan M. Stefanov
2006-01-01
Full Text Available We consider the problem of minimizing a convex separable logarithmic function over a region defined by a convex inequality constraint or linear equality constraint, and two-sided bounds on the variables (box constraints. Such problems are interesting from both theoretical and practical point of view because they arise in some mathematical programming problems as well as in various practical problems such as problems of production planning and scheduling, allocation of resources, decision making, facility location problems, and so forth. Polynomial algorithms are proposed for solving problems of this form and their convergence is proved. Some examples and results of numerical experiments are also presented.
Towards a Convex-Analytic View of Impossibility Results in ...
Indian Academy of Sciences (India)
Ankur A. Kulkarni
2016-11-05
Nov 5, 2016 ... [Jose and Kulkarni, 2015, IEEE CDC], [Jose and Kulkarni, 2016, IEEE. Trans IT]. Original problem. Optimization over distributions. (Nonconvex! ) min codes. Perror(code, R, n). ⇐⇒ min distributions. Perror(distribution, R, n). ⇓. A particular LP relaxation. Convex relaxation min hyperplanes. Perror(dist, R, n).
The Fatou property in p-convex Banach lattices
Curbera, Guillermo P.; Ricker, Werner J.
2007-04-01
New features of the Banach function space , that is, the space of all [nu]-scalarly pth power integrable functions (with 1[less-than-or-equals, slant]pFatou property plays an essential role and leads to a new representation theorem for a large class of abstract p-convex Banach lattices.
Linear inequality and convexity. Lineinye neravenstva i vypuklost
Energy Technology Data Exchange (ETDEWEB)
Astaf' ev, N.N.
1982-01-01
An examination is made of convex programming within the framework of linear inequality systems which are distinguished by constructivity and computational possibilities. Considerable attention is given to the study of various convergence situations. The book will be of interest to specialists in the field of mathmatical programming and optimization. 17 references.
On moduli of convexity and some applications | Barcenas ...
African Journals Online (AJOL)
Abstract. We provide some properties of both moduli of convexity δ and β and derive some applications of the modulus β to the geometry of Banach spaces as well as fixed point theory. Quaestiones Mathematicae 32(2009), 307–319 ...
Dynamical convexity of the Euler problem of two fixed centers
Kim, Seongchan
2016-01-01
We give thorough analysis for the rotation functions of the critical orbits from which one can understand bifurcations of periodic orbits. Moreover, we give explicit formulas of the Conley-Zehnder indices of the interior and exterior collision orbits and show that the universal cover of the regularized energy hypersurface of the Euler problem is dynamically convex for energies below the critical Jacobi energy.
Visualizing Data as Objects by DC (Difference of Convex) Optimization
DEFF Research Database (Denmark)
Carrizosa, Emilio; Guerrero, Vanesa; Morales, Dolores Romero
2018-01-01
In this paper we address the problem of visualizing in a bounded region a set of individuals, which has attached a dissimilarity measure and a statistical value, as convex objects. This problem, which extends the standard Multidimensional Scaling Analysis, is written as a global optimization...
Convexity of spheres in a manifold without conjugate points
Indian Academy of Sciences (India)
R. Narasimhan (Krishtel eMaging) 1461 1996 Oct 15 13:05:22
Abstract. For a non-compact, complete and simply connected manifold M without conjugate points, we prove that if the determinant of the second fundamental form of the geodesic spheres in M is a radial function, then the geodesic spheres are convex. We also show that if M is two or three dimensional and without ...
Positive definite functions and dual pairs of locally convex spaces
Directory of Open Access Journals (Sweden)
Daniel Alpay
2018-01-01
Full Text Available Using pairs of locally convex topological vector spaces in duality and topologies defined by directed families of sets bounded with respect to the duality, we prove general factorization theorems and general dilation theorems for operator-valued positive definite functions.
Flat tori in three-dimensional space and convex integration.
Borrelli, Vincent; Jabrane, Saïd; Lazarus, Francis; Thibert, Boris
2012-05-08
It is well-known that the curvature tensor is an isometric invariant of C(2) Riemannian manifolds. This invariant is at the origin of the rigidity observed in Riemannian geometry. In the mid 1950s, Nash amazed the world mathematical community by showing that this rigidity breaks down in regularity C(1). This unexpected flexibility has many paradoxical consequences, one of them is the existence of C(1) isometric embeddings of flat tori into Euclidean three-dimensional space. In the 1970s and 1980s, M. Gromov, revisiting Nash's results introduced convex integration theory offering a general framework to solve this type of geometric problems. In this research, we convert convex integration theory into an algorithm that produces isometric maps of flat tori. We provide an implementation of a convex integration process leading to images of an embedding of a flat torus. The resulting surface reveals a C(1) fractal structure: Although the tangent plane is defined everywhere, the normal vector exhibits a fractal behavior. Isometric embeddings of flat tori may thus appear as a geometric occurrence of a structure that is simultaneously C(1) and fractal. Beyond these results, our implementation demonstrates that convex integration, a theory still confined to specialists, can produce computationally tractable solutions of partial differential relations.
Intensive Insulin Therapy: Tight Blood Sugar Control
Intensive insulin therapy: Tight blood sugar control Intensive insulin therapy can help prevent long-term diabetes complications. Consider the ... cases if you have type 2 diabetes — intensive insulin therapy may be the key to long-term ...
Tight connection between fission gas discharge channels
International Nuclear Information System (INIS)
Jung, W.; Peehs, M.; Rau, P.; Krug, W.; Stechemesser, H.
1978-01-01
The invention is concerned with the tight connection between the fission gas discharge channel, leading away from the support plate of a gas-cooled reactor, and the top of the fuel element suspended from this support plate. The closure is designed to be gas-tight for the suspended as well as for the released fuel element. The tight connection has got an annular body resting on the core support plate in the mouth region of the fission gas discharge channel. This body is connected with the fission gas discharge channel in the fuel element top fitting via a gas-tight part and supported by a compression spring. Care is taken for sealing if the fuel element is removal. (RW) [de
Short Run Profit Maximization in a Convex Analysis Framework
Directory of Open Access Journals (Sweden)
Ilko Vrankic
2017-03-01
Full Text Available In this article we analyse the short run profit maximization problem in a convex analysis framework. The goal is to apply the results of convex analysis due to unique structure of microeconomic phenomena on the known short run profit maximization problem where the results from convex analysis are deductively applied. In the primal optimization model the technology in the short run is represented by the short run production function and the normalized profit function, which expresses profit in the output units, is derived. In this approach the choice variable is the labour quantity. Alternatively, technology is represented by the real variable cost function, where costs are expressed in the labour units, and the normalized profit function is derived, this time expressing profit in the labour units. The choice variable in this approach is the quantity of production. The emphasis in these two perspectives of the primal approach is given to the first order necessary conditions of both models which are the consequence of enveloping the closed convex set describing technology with its tangents. The dual model includes starting from the normalized profit function and recovering the production function, and alternatively the real variable cost function. In the first perspective of the dual approach the choice variable is the real wage, and in the second it is the real product price expressed in the labour units. It is shown that the change of variables into parameters and parameters into variables leads to both optimization models which give the same system of labour demand and product supply functions and their inverses. By deductively applying the results of convex analysis the comparative statics results are derived describing the firm's behaviour in the short run.
Graph Design via Convex Optimization: Online and Distributed Perspectives
Meng, De
Network and graph have long been natural abstraction of relations in a variety of applications, e.g. transportation, power system, social network, communication, electrical circuit, etc. As a large number of computation and optimization problems are naturally defined on graphs, graph structures not only enable important properties of these problems, but also leads to highly efficient distributed and online algorithms. For example, graph separability enables the parallelism for computation and operation as well as limits the size of local problems. More interestingly, graphs can be defined and constructed in order to take best advantage of those problem properties. This dissertation focuses on graph structure and design in newly proposed optimization problems, which establish a bridge between graph properties and optimization problem properties. We first study a new optimization problem called Geodesic Distance Maximization Problem (GDMP). Given a graph with fixed edge weights, finding the shortest path, also known as the geodesic, between two nodes is a well-studied network flow problem. We introduce the Geodesic Distance Maximization Problem (GDMP): the problem of finding the edge weights that maximize the length of the geodesic subject to convex constraints on the weights. We show that GDMP is a convex optimization problem for a wide class of flow costs, and provide a physical interpretation using the dual. We present applications of the GDMP in various fields, including optical lens design, network interdiction, and resource allocation in the control of forest fires. We develop an Alternating Direction Method of Multipliers (ADMM) by exploiting specific problem structures to solve large-scale GDMP, and demonstrate its effectiveness in numerical examples. We then turn our attention to distributed optimization on graph with only local communication. Distributed optimization arises in a variety of applications, e.g. distributed tracking and localization, estimation
On the distance between convex-ordered random variables, with applications
Boutsikas, Michael V.; Vaggelatou, Eutichia
2002-01-01
Simple approximation techniques are developed exploiting relationships between generalized convex orders and appropriate probability metrics. In particular, the distance between s-convex ordered random variables is investigated. Results connecting positive or negative dependence concepts and convex ordering are also presented. These results lead to approximations and bounds for the distributions of sums of positively or negatively dependent random variables. Applications and ex...
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.
Polynômes et optimisation convexe en commande robuste
Henrion, Didier
2007-01-01
A l'aide de quelques exemples illustratifs, des pistes sont évoquées pour combiner les méthodes polynomiales (algèbre, géométrie algébrique) et l'optimisation convexe (inégalités matricielles linéaires, LMI) dans le but de développer des outils numériques de résolution de problèmes basiques en automatique, et en particulier pour la commande robuste des systèmes linéaires. Dans le chapitre 2, nous évoquons les liens étroits entre ensembles semi-algébriques convexes et LMI,ainsi que la notion s...
On the stretch factor of convex Delaunay graphs
Directory of Open Access Journals (Sweden)
Prosenjit Bose
2010-06-01
Full Text Available Let C be a compact and convex set in the plane that contains the origin in its interior, and let S be a finite set of points in the plane. The Delaunay graph DGC(S of S is defined to be the dual of the Voronoi diagram of S with respect to the convex distance function defined by C. We prove that DGC(S is a t-spanner for S, for some constant t that depends only on the shape of the set C. Thus, for any two points p and q in S, the graph DGC(S contains a path between p and q whose Euclidean length is at most t times the Euclidean distance between p and q.
A Convex Optimization Model and Algorithm for Retinex
Directory of Open Access Journals (Sweden)
Qing-Nan Zhao
2017-01-01
Full Text Available Retinex is a theory on simulating and explaining how human visual system perceives colors under different illumination conditions. The main contribution of this paper is to put forward a new convex optimization model for Retinex. Different from existing methods, the main idea is to rewrite a multiplicative form such that the illumination variable and the reflection variable are decoupled in spatial domain. The resulting objective function involves three terms including the Tikhonov regularization of the illumination component, the total variation regularization of the reciprocal of the reflection component, and the data-fitting term among the input image, the illumination component, and the reciprocal of the reflection component. We develop an alternating direction method of multipliers (ADMM to solve the convex optimization model. Numerical experiments demonstrate the advantages of the proposed model which can decompose an image into the illumination and the reflection components.
A Survey on Operator Monotonicity, Operator Convexity, and Operator Means
Directory of Open Access Journals (Sweden)
Pattrawut Chansangiam
2015-01-01
Full Text Available This paper is an expository devoted to an important class of real-valued functions introduced by Löwner, namely, operator monotone functions. This concept is closely related to operator convex/concave functions. Various characterizations for such functions are given from the viewpoint of differential analysis in terms of matrix of divided differences. From the viewpoint of operator inequalities, various characterizations and the relationship between operator monotonicity and operator convexity are given by Hansen and Pedersen. In the viewpoint of measure theory, operator monotone functions on the nonnegative reals admit meaningful integral representations with respect to Borel measures on the unit interval. Furthermore, Kubo-Ando theory asserts the correspondence between operator monotone functions and operator means.
Convex variational problems linear, nearly linear and anisotropic growth conditions
Bildhauer, Michael
2003-01-01
The author emphasizes a non-uniform ellipticity condition as the main approach to regularity theory for solutions of convex variational problems with different types of non-standard growth conditions. This volume first focuses on elliptic variational problems with linear growth conditions. Here the notion of a "solution" is not obvious and the point of view has to be changed several times in order to get some deeper insight. Then the smoothness properties of solutions to convex anisotropic variational problems with superlinear growth are studied. In spite of the fundamental differences, a non-uniform ellipticity condition serves as the main tool towards a unified view of the regularity theory for both kinds of problems.
Convex relationships in ecosystems containing mixtures of trees and grass
CSIR Research Space (South Africa)
Scholes, RJ
2003-12-01
Full Text Available of the copyright owner. Further reproduction prohibited without permission. Convex Relationships in Ecosystems Containing Mixtures of Trees and Grass R.J. Scholes Environmental and Resource Economics; Dec 2003; 26, 4; ABI/INFORM Global pg. 559 Reproduced... with permission of the copyright owner. Further reproduction prohibited without permission. Reproduced with permission of the copyright owner. Further reproduction prohibited without permission. Reproduced with permission of the copyright owner. Further...
Convex Hull Abstraction in Specialisation of CLP Programs
DEFF Research Database (Denmark)
Peralta, J.C.; Gallagher, John Patrick
2003-01-01
We introduce an abstract domain consisting of atomic formulas constrained by linear arithmetic constraints (or convex hulls). This domain is used in an algorithm for specialization of constraint logic programs. The algorithm incorporates in a single phase both top-down goal directed propagation...... programs containing arithmetic, as well as constraint logic programs. Assignments, inequalities and equalities with arithmetic expressions can be interpreted as constraints during specialization, thus increasing the amount of specialization that can be achieved....
Free locally convex spaces with a small base
Czech Academy of Sciences Publication Activity Database
Gabriyelyan, S.; Kąkol, Jerzy
2017-01-01
Roč. 111, č. 2 (2017), s. 575-585 ISSN 1578-7303 R&D Projects: GA ČR GF16-34860L Institutional support: RVO:67985840 Keywords : compact resolution * free locally convex space * G-base Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics Impact factor: 0.690, year: 2016 http://link. springer .com/article/10.1007%2Fs13398-016-0315-1
Some fixed point theorems on non-convex sets
Directory of Open Access Journals (Sweden)
Mohanasundaram Radhakrishnan
2017-10-01
Full Text Available In this paper, we prove that if $K$ is a nonempty weakly compact set in a Banach space $X$, $T:K\\to K$ is a nonexpansive map satisfying $\\frac{x+Tx}{2}\\in K$ for all $x\\in K$ and if $X$ is $3-$uniformly convex or $X$ has the Opial property, then $T$ has a fixed point in $K.$
Moduli spaces of convex projective structures on surfaces
DEFF Research Database (Denmark)
Fock, V. V.; Goncharov, A. B.
2007-01-01
We introduce explicit parametrisations of the moduli space of convex projective structures on surfaces, and show that the latter moduli space is identified with the higher Teichmüller space for defined in [V.V. Fock, A.B. Goncharov, Moduli spaces of local systems and higher Teichmüller theory, ma.......AG/0311149]. We investigate the cluster structure of this moduli space, and define its quantum version....
A formulation of combinatorial auction via reverse convex programming
Directory of Open Access Journals (Sweden)
Henry Schellhorn
2005-01-01
of this problem, where orders are aggregated and integrality constraints are relaxed. It was proved that this problem could be solved efficiently in two steps by calculating two fixed points, first the fixed point of a contraction mapping, and then of a set-valued function. In this paper, we generalize the problem to incorporate constraints on maximum price changes between two auction rounds. This generalized problem cannot be solved by the aforementioned methods and necessitates reverse convex programming techniques.
Free locally convex spaces with a small base
Czech Academy of Sciences Publication Activity Database
Gabriyelyan, S.; Kąkol, Jerzy
2017-01-01
Roč. 111, č. 2 (2017), s. 575-585 ISSN 1578-7303 R&D Projects: GA ČR GF16-34860L Institutional support: RVO:67985840 Keywords : compact resolution * free locally convex space * G-base Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics Impact factor: 0.690, year: 2016 http://link.springer.com/article/10.1007%2Fs13398-016-0315-1
Sequential and Parallel Algorithms for Finding a Maximum Convex Polygon
DEFF Research Database (Denmark)
Fischer, Paul
1997-01-01
becomes O(M n³ log n). It is also shown how to find a maximum convex polygon which contains a given point in time O(n³ log n). Two parallel algorithms for the basic problem are also presented. The first one runs in time O(n log n) using O(n²) processors, the second one has polylogarithmic time but needs O...
PENNON: A code for convex nonlinear and semidefinite programming
Czech Academy of Sciences Publication Activity Database
Kočvara, Michal; Stingl, M.
2003-01-01
Roč. 18, č. 3 (2003), s. 317-333 ISSN 1055-6788 R&D Projects: GA ČR GA201/00/0080 Grant - others:BMBF(DE) 03ZOM3ER Institutional research plan: CEZ:AV0Z1075907 Keywords : convex programming * semidefinite programming * large-scale problems Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 0.306, year: 2003
Convex Optimization Methods for Graphs and Statistical Modeling
2011-06-01
Specifically we note that evaluating the function ΘP (A) for any fixed A,P is equivalent to solving the so-called Quadratic Assignment Problem ( QAP ), and...thus we can employ various tractable linear programming, spectral, and SDP relaxations of QAP [32, 122, 147]. In particular we discuss recent work [43...on exploiting group symmetry in SDP relaxations of QAP , which is useful for approximately computing elementary convex graph invariants in many
Critical Power Performance of Tight Lattice Bundle
Yamamoto, Yasushi; Hiraiwa, Kouji; Morooka, Shinichi; Abe, Nobuaki
An innovative fuel cycle system concept named BARS (BWR with an Advanced Recycle System) has been proposed as a future fuel cycle option aiming at enhanced utilization of uranium resources and reduction of radioactive wastes. In BARS, the spent fuel from conventional light water reactors (LWRs) is recycled as a mixed oxide (MOX) fuel for a BWR core with the fast neutron spectrum by means of oxide dry-processing and vibro-packing fuel fabrication. The fast neutron spectrum is obtained by means of triangular tight fuel lattice. Further study on BARS, especially on tight lattice MOX fuel, has been initiated as a joint study by Toshiba and Gifu University. The objective of this paper is to show the latest progress of the study on BARS, especially concerning the thermal-hydraulics measurements for tight lattice bundle.
An introduction to finite tight frames
Waldron, Shayne F D
2018-01-01
This textbook is an introduction to the theory and applications of finite tight frames, an area that has developed rapidly in the last decade. Stimulating much of this growth are the applications of finite frames to diverse fields such as signal processing, quantum information theory, multivariate orthogonal polynomials, and remote sensing. Key features and topics: * First book entirely devoted to finite frames * Extensive exercises and MATLAB examples for classroom use * Important examples, such as harmonic and Heisenberg frames, are presented in preliminary chapters, encouraging readers to explore and develop an intuitive feeling for tight frames * Later chapters delve into general theory details and recent research results * Many illustrations showing the special aspects of the geometry of finite frames * Provides an overview of the field of finite tight frames * Discusses future research directions in the field Featuring exercises and MATLAB examples in each chapter, the book is well suited as a textbook ...
Hermetic compartments leak-tightness enhancement
International Nuclear Information System (INIS)
Murani, J.
2000-01-01
In connection with the enhancement of the nuclear safety of the Jaslovske Bohunice V-1 NPP actions for the increase of the leak tightness are performed. The reconstruction has been done in the following directions: hermetic compartments leak tightness enhancement; air lock installation; installation of air lock in SP 4 vent system; integrated leakage rate test to hermetic compartments with leak detection. After 'major' leaks on the hermetic boundary components had been eliminated, since 1994 works on a higher qualitative level began. The essence of the works consists in the detection and identification of leaks in the structural component of the hermetic boundary during the planned refueling outages. The results of the Small Reconstruction and gradual enhancement of leak tightness are presented
Subset Selection by Local Convex Approximation
DEFF Research Database (Denmark)
Øjelund, Henrik; Sadegh, Payman; Madsen, Henrik
1999-01-01
of the subset selection problem so as to guarantee positive definiteness of the Hessian term, hence avoiding numerical instability. The backward Elemination type algorithm attempts to improve the results upon termination of the modified Newton-Raphson search by sing the current solution as an initial guess......This paper concerns selection of the optimal subset of variables in a lenear regression setting. The posed problem is combinatiorial and the globally best subset can only be found in exponential time. We define a cost function for the subset selection problem by adding the penalty term to the usual....... The efficiency of the method is illustrated by a numerical example with highly correlated explanatory variables for which the commonly used techiques such as forward selection/backward elimination perform poorly....
Measures of symmetry for convex sets and stability
Toth, Gabor
2015-01-01
This textbook treats two important and related matters in convex geometry: the quantification of symmetry of a convex set—measures of symmetry—and the degree to which convex sets that nearly minimize such measures of symmetry are themselves nearly symmetric—the phenomenon of stability. By gathering the subject’s core ideas and highlights around Grünbaum’s general notion of measure of symmetry, it paints a coherent picture of the subject, and guides the reader from the basics to the state-of-the-art. The exposition takes various paths to results in order to develop the reader’s grasp of the unity of ideas, while interspersed remarks enrich the material with a behind-the-scenes view of corollaries and logical connections, alternative proofs, and allied results from the literature. Numerous illustrations elucidate definitions and key constructions, and over 70 exercises—with hints and references for the more difficult ones—test and sharpen the reader’s comprehension. The presentation includes:...
Structural robust optimization design based on convex model
Directory of Open Access Journals (Sweden)
Xuyong Chen
Full Text Available There exist a great amount of uncertain factors in actual engineering. In order to involve these uncertain factors in analytical model, they have been expressed as the convex variables. In addition, the convex model was further classified into the hyper-ellipsoidal model and the interval model. After pointing out the intrinsic difference between these two kinds of models, the principle for applying which one of the models within the analysis has been indicated according to the available testing points. After standardizing the convex variables, the difference and relation between these two models for the optimization and solution process have been presented. With the analysis mentality available from the hyper-ellipsoidal model, the basic method about the robust optimization for the interval model was emphasized. After classification of the interval variables within the optimization process, the characteristics of the robust optimization were highlighted with different constraint conditions. Using the target-performance-based analytical scheme, the algorithm, the solution step and the convergence criteria for the robust optimization have been also presented with only one reliability index. Numerical examples and engineering problems were used to demonstrate the effectiveness and correctness of the proposed approach. Keywords: Robust optimization, Non-probabilistic reliability, Interval model, Hyper-ellipsoidal model, Probabilistic index
Numerical modeling of isothermal compositional grading by convex splitting methods
Li, Yiteng
2017-04-09
In this paper, an isothermal compositional grading process is simulated based on convex splitting methods with the Peng-Robinson equation of state. We first present a new form of gravity/chemical equilibrium condition by minimizing the total energy which consists of Helmholtz free energy and gravitational potential energy, and incorporating Lagrange multipliers for mass conservation. The time-independent equilibrium equations are transformed into a system of transient equations as our solution strategy. It is proved our time-marching scheme is unconditionally energy stable by the semi-implicit convex splitting method in which the convex part of Helmholtz free energy and its derivative are treated implicitly and the concave parts are treated explicitly. With relaxation factor controlling Newton iteration, our method is able to converge to a solution with satisfactory accuracy if a good initial estimate of mole compositions is provided. More importantly, it helps us automatically split the unstable single phase into two phases, determine the existence of gas-oil contact (GOC) and locate its position if GOC does exist. A number of numerical examples are presented to show the performance of our method.
Convex reduction of high-dimensional kernels for visual classification
Gavves, E.; Snoek, C.G.M.; Smeulders, A.W.M.
2012-01-01
Limiting factors of fast and effective classifiers for large sets of images are their dependence on the number of images analyzed and the dimensionality of the image representation. Considering the growing number of images as a given, we aim to reduce the image feature dimensionality in this paper.
Experimental study on the reduction of skin frictional drag in pipe flow by using convex air bubbles
Kwon, Bong Hyun; Kim, Hyung Hoon; Jeon, Hyeong Jin; Kim, Moon Chan; Lee, Inwon; Chun, Sejong; Go, Jeung Sang
2014-04-01
In response to the ever increasing need for efficient management of energy consumption, there have been extensive studies on drag reduction in many types of transport systems. In this paper, we examine the reduction of skin frictional drag in a pipe with an internal surface fabricated with cavity array by using the slip obtained on a convex air bubble array. The bubble formation was observed in a microchannel by using a high-speed CCD camera with respect to time and a micro PIV characterized by measuring velocity distribution around the convex bubble. Also, to investigate the possibility of the drag reduction, the volumetric flow rate and momentum flux were compared with and without the convex air bubble array in the microchannel. The measured momentum flux was rapidly increased around the convex air bubbles, which expected the reduction of skin frictional drag. Also, the slip influence distance was determined for the different bubble heights along the microchannel. The convex air bubble with larger height provides longer slip influence distance. Finally, the cavity array was fabricated on the internal surface of a pipe. The size of the cavity array was designed 100 μm in a rectangle, and they were spaced with 150 μm. The pipe diameter was 28.4 mm, and its length was 500 mm. The pipe was installed into a test rig to evaluate the drag reduction and was experimented in the turbulent flow condition, in which Reynolds number was ranged from 40,000 to 220,000. Maximum drag reduction of 10 % was obtained in the cavity pipe, while that of the smooth pipe was shown <2 %.
Linearithmic time sparse and convex maximum margin clustering.
Zhang, Xiao-Lei; Wu, Ji
2012-12-01
Recently, a new clustering method called maximum margin clustering (MMC) was proposed and has shown promising performances. It was originally formulated as a difficult nonconvex integer problem. To make the MMC problem practical, the researchers either relaxed the original MMC problem to inefficient convex optimization problems or reformulated it to nonconvex optimization problems, which sacrifice the convexity for efficiency. However, no approaches can both hold the convexity and be efficient. In this paper, a new linearithmic time sparse and convex MMC algorithm, called support-vector-regression-based MMC (SVR-MMC), is proposed. Generally, it first uses the SVR as the core of the MMC. Then, it is relaxed as a convex optimization problem, which is iteratively solved by the cutting-plane algorithm. Each cutting-plane subproblem is further decomposed to a serial supervised SVR problem by a new global extended-level method (GELM). Finally, each supervised SVR problem is solved in a linear time complexity by a new sparse-kernel SVR (SKSVR) algorithm. We further extend the SVR-MMC algorithm to the multiple-kernel clustering (MKC) problem and the multiclass MMC (M3C) problem, which are denoted as SVR-MKC and SVR-M3C, respectively. One key point of the algorithms is the utilization of the SVR. It can prevent the MMC and its extensions meeting an integer matrix programming problem. Another key point is the new SKSVR. It provides a linear time interface to the nonlinear kernel scenarios, so that the SVR-MMC and its extensions can keep a linearthmic time complexity in nonlinear kernel scenarios. Our experimental results on various real-world data sets demonstrate the effectiveness and the efficiency of the SVR-MMC and its two extensions. Moreover, the unsupervised application of the SVR-MKC to the voice activity detection (VAD) shows that the SVR-MKC can achieve good performances that are close to its supervised counterpart, meet the real-time demand of the VAD, and need no
Convex Relaxations of Chance Constrained AC Optimal Power Flow
DEFF Research Database (Denmark)
Venzke, Andreas; Halilbasic, Lejla; Markovic, Uros
2017-01-01
High penetration of renewable energy sources and the increasing share of stochastic loads require the explicit representation of uncertainty in tools such as the optimal power ﬂow (OPF).Current approaches follow either a linearized approach or an iterative approximation of non-linearities. This p......High penetration of renewable energy sources and the increasing share of stochastic loads require the explicit representation of uncertainty in tools such as the optimal power ﬂow (OPF).Current approaches follow either a linearized approach or an iterative approximation of non......, reactive power, and voltage. We state a tractable formulation for two types of uncertainty sets. Using a scenario-based approach and making no prior assumptions about the probability distribution of the forecast errors, we obtain a robust formulation for a rectangular uncertainty set. Alternatively......, assuming a Gaussian distribution of the forecast errors, we propose an analytical reformulation of the chance constraints suitable for semideﬁnite programming. We demonstrate the performance of our approach on the IEEE 24 and 118 bus system using realistic day-ahead forecast data and obtain tight near...
Liu, Jing; He, Qiong; Luo, Jianwen
2018-03-01
According to the linear acoustic theory, the channel data of a plane wave emitted by a linear array is a linear combination of the full data set of synthetic transmit aperture (STA). Combining this relationship with compressed sensing (CS), a novel CS based ultrasound beamforming strategy, named compressed sensing based synthetic transmit aperture (CS-STA), was previously proposed to increase the frame rate of ultrasound imaging without sacrificing the image quality for a linear array. In this paper, assuming linear transfer function of a pulse-echo ultrasound system, we derived and applied the theory of CS-STA for a slightly curved array and validated CS-STA in a convex array configuration. Computer simulations demonstrated that, in the convex array configuration, the normalized root-mean-square error between the beamformed radio-frequency data of CS-STA and STA was smaller than 1% while CS-STA achieved four-fold higher frame rate than STA. In addition, CS-STA was capable of achieving good image quality at depths over 100 mm. It was validated in phantom experiments by comparing CS-STA with STA, multielement synthetic transmit aperture (ME-STA), and the conventional focused method (focal depth = 110 mm). The experimental results showed that STA and CS-STA performed better than ME-STA and the focused method at small depths. At the depth of 110 mm, CS-STA, ME-STA, and the focused methods improved the contrast and contrast-to-noise ratio of STA. The improvements in CS-STA are higher than those in ME-STA but lower than those in the focused mode. These results can also be observed qualitatively in the in vivo experiments on the liver of a healthy male volunteer. The CS-STA method is thus proved to increase the frame rate and achieve high image quality at full depth in the convex array configuration.
Advanced Hydraulic Fracturing Technology for Unconventional Tight Gas Reservoirs
Energy Technology Data Exchange (ETDEWEB)
Stephen Holditch; A. Daniel Hill; D. Zhu
2007-06-19
The objectives of this project are to develop and test new techniques for creating extensive, conductive hydraulic fractures in unconventional tight gas reservoirs by statistically assessing the productivity achieved in hundreds of field treatments with a variety of current fracturing practices ranging from 'water fracs' to conventional gel fracture treatments; by laboratory measurements of the conductivity created with high rate proppant fracturing using an entirely new conductivity test - the 'dynamic fracture conductivity test'; and by developing design models to implement the optimal fracture treatments determined from the field assessment and the laboratory measurements. One of the tasks of this project is to create an 'advisor' or expert system for completion, production and stimulation of tight gas reservoirs. A central part of this study is an extensive survey of the productivity of hundreds of tight gas wells that have been hydraulically fractured. We have been doing an extensive literature search of the SPE eLibrary, DOE, Gas Technology Institute (GTI), Bureau of Economic Geology and IHS Energy, for publicly available technical reports about procedures of drilling, completion and production of the tight gas wells. We have downloaded numerous papers and read and summarized the information to build a database that will contain field treatment data, organized by geographic location, and hydraulic fracture treatment design data, organized by the treatment type. We have conducted experimental study on 'dynamic fracture conductivity' created when proppant slurries are pumped into hydraulic fractures in tight gas sands. Unlike conventional fracture conductivity tests in which proppant is loaded into the fracture artificially; we pump proppant/frac fluid slurries into a fracture cell, dynamically placing the proppant just as it occurs in the field. From such tests, we expect to gain new insights into some of the critical
Generalized minimizers of convex integral functionals, Bregman distance, Pythagorean identities
Czech Academy of Sciences Publication Activity Database
Imre, C.; Matúš, František
2012-01-01
Roč. 48, č. 4 (2012), s. 637-689 ISSN 0023-5954 R&D Projects: GA ČR GA201/08/0539; GA ČR GAP202/10/0618 Institutional support: RVO:67985556 Keywords : maximum entropy * moment constraint * generalized primal/dual solutions * normal integrand * convex duality * Bregman projection * inference principles Subject RIV: BA - General Mathematics Impact factor: 0.619, year: 2012 http://library.utia.cas.cz/separaty/2012/MTR/matus-0381750.pdf
Lefschetz Fixed Point Theorem and Lattice Points in Convex Polytopes
Sardo-Infirri, Sacha
1993-01-01
A simple convex lattice polytope $\\Box$ defines a torus-equivariant line bundle $\\LB$ over a toric variety $\\XB.$ Atiyah and Bott's Lefschetz fixed-point theorem is applied to the torus action on the $d''$-complex of $\\LB$ and information is obtained about the lattice points of $\\Box$. In particular an explicit formula is derived, computing the number of lattice points and the volume of $\\Box$ in terms of geometric data at its extreme points. We show this to be equivalent the results of Brion...
Convex optimization in normed spaces theory, methods and examples
Peypouquet, Juan
2015-01-01
This work is intended to serve as a guide for graduate students and researchers who wish to get acquainted with the main theoretical and practical tools for the numerical minimization of convex functions on Hilbert spaces. Therefore, it contains the main tools that are necessary to conduct independent research on the topic. It is also a concise, easy-to-follow and self-contained textbook, which may be useful for any researcher working on related fields, as well as teachers giving graduate-level courses on the topic. It will contain a thorough revision of the extant literature including both classical and state-of-the-art references.
Blaschke- and Minkowski-endomorphisms of convex bodies
DEFF Research Database (Denmark)
Kiderlen, Markus
2006-01-01
We consider maps of the family of convex bodies in Euclidean d-dimensional space into itself that are compatible with certain structures on this family: A Minkowski-endomorphism is a continuous, Minkowski-additive map that commutes with rotations. For d>2, a representation theorem for such maps......-endomorphisms, where additivity is now understood with respect to Blaschke-addition. Using a special mixed volume, an adjoining operator can be introduced. This operator allows one to identify the class of Blaschke-endomorphisms with the class of weakly monotonic, non-degenerate and translation-covariant Minkowski...
A *-mixing convergence theorem for convex set valued processes
Directory of Open Access Journals (Sweden)
A. de Korvin
1987-01-01
Full Text Available In this paper the concept of a *-mixing process is extended to multivalued maps from a probability space into closed, bounded convex sets of a Banach space. The main result, which requires that the Banach space be separable and reflexive, is a convergence theorem for *-mixing sequences which is analogous to the strong law of large numbers. The impetus for studying this problem is provided by a model from information science involving the utilization of feedback data by a decision maker who is uncertain of his goals. The main result is somewhat similar to a theorem for real valued processes and is of interest in its own right.
A contribution to group representations in locally convex spaces
International Nuclear Information System (INIS)
Jurzak, J.P.
1977-01-01
Let U be a continuous representation of a (connected) locally compact group G in a separated locally convex space E. It is shown that the study of U is equivalent to the study of a family Usub(i) of continuous representations of G in Frechet spaces Fsub(i). If U is equicontinuous, the Fsub(i) are Banach spaces, and the Usub(i) are realized by isomeric operators. When U is topologically irreducible, it is Naemark equivalent to a Frechet (or isomeric Banach, in the equicontinuous case) continuous representation. Similar results hold for semi-groups. (Auth.)
Vector optimization and monotone operators via convex duality recent advances
Grad, Sorin-Mihai
2014-01-01
This book investigates several duality approaches for vector optimization problems, while also comparing them. Special attention is paid to duality for linear vector optimization problems, for which a vector dual that avoids the shortcomings of the classical ones is proposed. Moreover, the book addresses different efficiency concepts for vector optimization problems. Among the problems that appear when the framework is generalized by considering set-valued functions, an increasing interest is generated by those involving monotone operators, especially now that new methods for approaching them by means of convex analysis have been developed. Following this path, the book provides several results on different properties of sums of monotone operators.
Tight-binding treatment of conjugated polymers
DEFF Research Database (Denmark)
Lynge, Thomas Bastholm
This PhD thesis concerns conjugated polymers which constitute a constantly growing research area. Today, among other things, conjugated polymers play a role in plastic based solar cells, photodetectors and light emitting diodes, and even today such plastic-based components constitute an alternative...... of tomorrow. This thesis specifically treats the three conjugated polymers trans-polyacetylene (tPA), poly(para-phenylene) (PPP) and poly(para-phe\\-nylene vinylene) (PPV). The present results, which are derived within the tight-binding model, are divided into two parts. In one part, analytic results...... are derived for the optical properties of the polymers expressed in terms of the optical susceptibility both in the presence and in the absence of a static electric field. In the other part, the cumputationally efficient Density Functional-based Tight-Binding (DFTB) model is applied to the description...
Equiangular tight frames and unistochastic matrices
Czech Academy of Sciences Publication Activity Database
Goyeneche, D.; Turek, Ondřej
2017-01-01
Roč. 50, č. 24 (2017), č. článku 245304. ISSN 1751-8113 R&D Projects: GA ČR GA17-01706S Institutional support: RVO:61389005 Keywords : equiangular tight frames * unistochastic matrices * SIC POVM Subject RIV: BE - Theoretical Physics OBOR OECD: Atomic, molecular and chemical physics (physics of atoms and molecules including collision, interaction with radiation, magnetic resonances, Mössbauer effect) Impact factor: 1.857, year: 2016
Polynomial fitting of tight-binding method in carbon
Haa, Wai Kang; Yeak, Su Hoe
2017-04-01
Carbon is very unique in among the elements and its ability to form strong chemical bonds with a variety number such as two carbons (graphene) and four carbons (diamond). This combination of strong bonds with tight mass and high melting point makes them technologically and scientifically important in nanoscience development. Tight-binding model (TB) is one of the semi-empirical approximations used in quantum mechanical world which is restricted to the Linear Combinations of Localized Atomic Orbitals (LCAO). Currently, there are many approaches in tight-binding calculation. In this paper, we have reproduced a polynomial scaling function by fitting to the TB model. The model is then applied into carbon molecules and obtained the energy bands of the system. The elements of the overlap Hamiltonian matrix in the model will be depending on the parameter of the polynomials. Our purpose is to find out a set of parameters in the polynomial which were commonly fit to an independently calculated band structure. We used minimization approach to calculate the polynomial coefficients which involves differentiation of eigenvalues in the eigensystem. The algorithm of fitting the parameters is carried out in FORTRAN.
Off-Grid DOA Estimation Based on Analysis of the Convexity of Maximum Likelihood Function
LIU, Liang; WEI, Ping; LIAO, Hong Shu
Spatial compressive sensing (SCS) has recently been applied to direction-of-arrival (DOA) estimation owing to advantages over conventional ones. However the performance of compressive sensing (CS)-based estimation methods decreases when true DOAs are not exactly on the discretized sampling grid. We solve the off-grid DOA estimation problem using the deterministic maximum likelihood (DML) estimation method. In this work, we analyze the convexity of the DML function in the vicinity of the global solution. Especially under the condition of large array, we search for an approximately convex range around the ture DOAs to guarantee the DML function convex. Based on the convexity of the DML function, we propose a computationally efficient algorithm framework for off-grid DOA estimation. Numerical experiments show that the rough convex range accords well with the exact convex range of the DML function with large array and demonstrate the superior performance of the proposed methods in terms of accuracy, robustness and speed.
Seismic data interpolation and denoising by learning a tensor tight frame
International Nuclear Information System (INIS)
Liu, Lina; Ma, Jianwei; Plonka, Gerlind
2017-01-01
Seismic data interpolation and denoising plays a key role in seismic data processing. These problems can be understood as sparse inverse problems, where the desired data are assumed to be sparsely representable within a suitable dictionary. In this paper, we present a new method based on a data-driven tight frame (DDTF) of Kronecker type (KronTF) that avoids the vectorization step and considers the multidimensional structure of data in a tensor-product way. It takes advantage of the structure contained in all different modes (dimensions) simultaneously. In order to overcome the limitations of a usual tensor-product approach we also incorporate data-driven directionality. The complete method is formulated as a sparsity-promoting minimization problem. It includes two main steps. In the first step, a hard thresholding algorithm is used to update the frame coefficients of the data in the dictionary; in the second step, an iterative alternating method is used to update the tight frame (dictionary) in each different mode. The dictionary that is learned in this way contains the principal components in each mode. Furthermore, we apply the proposed KronTF to seismic interpolation and denoising. Examples with synthetic and real seismic data show that the proposed method achieves better results than the traditional projection onto convex sets method based on the Fourier transform and the previous vectorized DDTF methods. In particular, the simple structure of the new frame construction makes it essentially more efficient. (paper)
Kunt, Mehmet; İşcan, İmdat; Yazıcı, Nazlı; Gözütok, Uğur
2016-01-01
In this paper, firstly, new Hermite-Hadamard type inequalities for harmonically convex functions in fractional integral forms are given. Secondly, Hermite-Hadamard-Fejer inequalities for harmonically convex functions in fractional integral forms are built. Finally, an integral identity and some Hermite-Hadamard-Fejer type integral inequalities for harmonically convex functions in fractional integral forms are obtained. Some results presented here provide extensions of others given in earlier works.
The left Rieaman-Liouville fractional Hermite-Hadamard type inequalities for quasi-convex functions
Directory of Open Access Journals (Sweden)
Dünya Karapınar
2017-08-01
Full Text Available Recently, in [5], with a new approach, the authors obtained a new fractional Hermite-Hadamard type inequality for convex functions by using only the left Riemann-Liouville fractional integral. They also had new equalities to have new fractional trapezoid and midpoint type inequalities for convex functions, In this papers, we will use the same equalities to have new fractional trapezoid and midpoint type inequalities for quasi-convex functions. Our results generalise the study [3].
Canonical Primal-Dual Method for Solving Non-convex Minimization Problems
Wu, Changzhi; Li, Chaojie; Gao, David Yang
2012-01-01
A new primal-dual algorithm is presented for solving a class of non-convex minimization problems. This algorithm is based on canonical duality theory such that the original non-convex minimization problem is first reformulated as a convex-concave saddle point optimization problem, which is then solved by a quadratically perturbed primal-dual method. %It is proved that the popular SDP method is indeed a special case of the canonical duality theory. Numerical examples are illustrated. Comparing...
Convex Relaxation For Hard Problem In Data Mining And Sensor Localization
2017-04-13
AFRL-AFOSR-VA-TR-2017-0085 CONVEX RELAXATION FOR HARD PROBLEM IN DATA MINING AND SENSOR LOCALIZATION Stephen Vavasis UNIVERSITY OF WATERLOO 200...Performance 3. DATES COVERED (From - To) 15 Jun 2012 to 14 Aug 2015 4. TITLE AND SUBTITLE CONVEX RELAXATION FOR HARD PROBLEM IN DATA MINING AND SENSOR...the results. 15. SUBJECT TERMS Convex Relaxation Methods, Data Mining 16. SECURITY CLASSIFICATION OF: 17. LIMITATION OF ABSTRACT UU 18. NUMBER OF
Sequential Change-Point Detection via Online Convex Optimization
Directory of Open Access Journals (Sweden)
Yang Cao
2018-02-01
Full Text Available Sequential change-point detection when the distribution parameters are unknown is a fundamental problem in statistics and machine learning. When the post-change parameters are unknown, we consider a set of detection procedures based on sequential likelihood ratios with non-anticipating estimators constructed using online convex optimization algorithms such as online mirror descent, which provides a more versatile approach to tackling complex situations where recursive maximum likelihood estimators cannot be found. When the underlying distributions belong to a exponential family and the estimators satisfy the logarithm regret property, we show that this approach is nearly second-order asymptotically optimal. This means that the upper bound for the false alarm rate of the algorithm (measured by the average-run-length meets the lower bound asymptotically up to a log-log factor when the threshold tends to infinity. Our proof is achieved by making a connection between sequential change-point and online convex optimization and leveraging the logarithmic regret bound property of online mirror descent algorithm. Numerical and real data examples validate our theory.
A Deep-Cutting-Plane Technique for Reverse Convex Optimization.
Moshirvaziri, K; Amouzegar, M A
2011-08-01
A large number of problems in engineering design and in many areas of social and physical sciences and technology lend themselves to particular instances of problems studied in this paper. Cutting-plane methods have traditionally been used as an effective tool in devising exact algorithms for solving convex and large-scale combinatorial optimization problems. Its utilization in nonconvex optimization has been also promising. A cutting plane, essentially a hyperplane defined by a linear inequality, can be used to effectively reduce the computational efforts in search of a global solution. Each cut is generated in order to eliminate a large portion of the search domain. Thus, a deep cut is intuitively superior in which it will exclude a larger set of extraneous points from consideration. This paper is concerned with the development of deep-cutting-plane techniques applied to reverse-convex programs. An upper bound and a lower bound for the optimal value are found, updated, and improved at each iteration. The algorithm terminates when the two bounds collapse or all the generated subdivisions have been fathomed. Finally, computational considerations and numerical results on a set of test problems are discussed. An illustrative example, walking through the steps of the algorithm and explaining the computational process, is presented.
A New Interpolation Approach for Linearly Constrained Convex Optimization
Espinoza, Francisco
2012-08-01
In this thesis we propose a new class of Linearly Constrained Convex Optimization methods based on the use of a generalization of Shepard\\'s interpolation formula. We prove the properties of the surface such as the interpolation property at the boundary of the feasible region and the convergence of the gradient to the null space of the constraints at the boundary. We explore several descent techniques such as steepest descent, two quasi-Newton methods and the Newton\\'s method. Moreover, we implement in the Matlab language several versions of the method, particularly for the case of Quadratic Programming with bounded variables. Finally, we carry out performance tests against Matab Optimization Toolbox methods for convex optimization and implementations of the standard log-barrier and active-set methods. We conclude that the steepest descent technique seems to be the best choice so far for our method and that it is competitive with other standard methods both in performance and empirical growth order.
First-order Convex Optimization Methods for Signal and Image Processing
DEFF Research Database (Denmark)
Jensen, Tobias Lindstrøm
2012-01-01
In this thesis we investigate the use of first-order convex optimization methods applied to problems in signal and image processing. First we make a general introduction to convex optimization, first-order methods and their iteration complexity. Then we look at different techniques, which can...... be used with first-order methods such as smoothing, Lagrange multipliers and proximal gradient methods. We continue by presenting different applications of convex optimization and notable convex formulations with an emphasis on inverse problems and sparse signal processing. We also describe the multiple...
Larrosa, Davinia; Ramon, Cesar; Benavente, Lorena; Calleja, Sergio
2016-04-26
With increasing prevalence due to an ageing population, carotid artery stenosis is a significant cause of stroke morbidity and mortality. The indication for revascularisation treatment in symptomatic carotid stenosis is widely documented and accepted in the scientific community. However, treatment of asymptomatic carotid stenosis remains controversial. We report a case of a 78-year-old woman who was admitted with a convexity subarachnoid haemorrhage (cSAH) secondary to an asymptomatic high-grade carotid artery stenosis. Two months later, she suffered an atherothrombotic ischaemic stroke and was referred to surgery. Transcranial Doppler studies showed impaired cerebral vasoreactivity and, after endarterectomy, the patient developed a reperfusion syndrome; both findings consisting of exhausted collaterals as the underlying mechanism. We propose that cSAH secondary to a high-grade internal carotid artery stenosis is a high risk marker for stroke, and revascularisation therapy should be considered. 2016 BMJ Publishing Group Ltd.
Chance-Constrained Guidance With Non-Convex Constraints
Ono, Masahiro
2011-01-01
Missions to small bodies, such as comets or asteroids, require autonomous guidance for descent to these small bodies. Such guidance is made challenging by uncertainty in the position and velocity of the spacecraft, as well as the uncertainty in the gravitational field around the small body. In addition, the requirement to avoid collision with the asteroid represents a non-convex constraint that means finding the optimal guidance trajectory, in general, is intractable. In this innovation, a new approach is proposed for chance-constrained optimal guidance with non-convex constraints. Chance-constrained guidance takes into account uncertainty so that the probability of collision is below a specified threshold. In this approach, a new bounding method has been developed to obtain a set of decomposed chance constraints that is a sufficient condition of the original chance constraint. The decomposition of the chance constraint enables its efficient evaluation, as well as the application of the branch and bound method. Branch and bound enables non-convex problems to be solved efficiently to global optimality. Considering the problem of finite-horizon robust optimal control of dynamic systems under Gaussian-distributed stochastic uncertainty, with state and control constraints, a discrete-time, continuous-state linear dynamics model is assumed. Gaussian-distributed stochastic uncertainty is a more natural model for exogenous disturbances such as wind gusts and turbulence than the previously studied set-bounded models. However, with stochastic uncertainty, it is often impossible to guarantee that state constraints are satisfied, because there is typically a non-zero probability of having a disturbance that is large enough to push the state out of the feasible region. An effective framework to address robustness with stochastic uncertainty is optimization with chance constraints. These require that the probability of violating the state constraints (i.e., the probability of
Tight Reference Frame–Independent Quantum Teleportation
Directory of Open Access Journals (Sweden)
Dominic Verdon
2017-01-01
Full Text Available We give a tight scheme for teleporting a quantum state between two parties whose reference frames are misaligned by an action of a finite symmetry group. Unlike previously proposed schemes, ours requires no additional tokens or data to be passed between the participants; the same amount of classical information is transferred as for ordinary quantum teleportation, and the Hilbert space of the entangled resource is of the same size. In the terminology of Peres and Scudo, our protocol relies on classical communication of unspeakable information.
Inward Leakage in Tight-Fitting PAPRs
Directory of Open Access Journals (Sweden)
Frank C. Koh
2011-01-01
Full Text Available A combination of local flow measurement techniques and fog flow visualization was used to determine the inward leakage for two tight-fitting powered air-purifying respirators (PAPRs, the 3M Breathe-Easy PAPR and the SE 400 breathing demand PAPR. The PAPRs were mounted on a breathing machine head form, and flows were measured from the blower and into the breathing machine. Both respirators leaked a little at the beginning of inhalation, probably through their exhalation valves. In both cases, the leakage was not enough for fog to appear at the mouth of the head form.
Terrestrial tight oil reservoir characteristics and Graded Resource Assessment in China
Wang, Shejiao; Wu, Xiaozhi; Guo, Giulin
2016-04-01
The success of shale/tight plays and the advanced exploitation technology applied in North America have triggered interest in exploring and exploiting tight oil in China. Due to the increased support of exploration and exploitation，great progress has been made in Erdos basin, Songliao basin, Junggar basin, Santanghu basin, Bohai Bay basin, Qaidam Basin, and Sichuan basin currently. China's first tight oil field has been found in Erdos basin in 2015, called xinanbian oil field, with over one hundred million tons oil reserves and one million tons of production scale. Several hundred million tons of tight oil reserve has been found in other basins, showing a great potential in China. Tight oil in China mainly developed in terrestrial sedimentary environment. According to the relations of source rock and reservoir, the source-reservoir combination of tight oil can be divided into three types, which are bottom generating and top storing tight oil,self- generating and self-storing tight oil，top generating and bottom storing tight oil. The self- generating and self-storing tight oil is the main type discovered at present. This type of tight oil has following characteristics:(1) The formation and distribution of tight oil are controlled by high quality source rocks. Terrestrial tight oil source rocks in China are mainly formed in the deep to half deep lacustrine facies. The lithology includes dark mudstone, shale, argillaceous limestone and dolomite. These source rocks with thickness between 20m-150m, kerogen type mostly I-II, and peak oil generation thermal maturity(Ro 0.6-1.4%), have great hydrocarbon generating potential. Most discovered tight oil is distributed in the area of TOC greater than 2 %.( 2) the reservoir with strong heterogeneity is very tight. In these low porosity and permeability reservoir,the resources distribution is controlled by the physical property. Tight sandstone, carbonate and hybrid sedimentary rocks are three main tight reservoir types in
Neural network for solving convex quadratic bilevel programming problems.
He, Xing; Li, Chuandong; Huang, Tingwen; Li, Chaojie
2014-03-01
In this paper, using the idea of successive approximation, we propose a neural network to solve convex quadratic bilevel programming problems (CQBPPs), which is modeled by a nonautonomous differential inclusion. Different from the existing neural network for CQBPP, the model has the least number of state variables and simple structure. Based on the theory of nonsmooth analysis, differential inclusions and Lyapunov-like method, the limit equilibrium points sequence of the proposed neural networks can approximately converge to an optimal solution of CQBPP under certain conditions. Finally, simulation results on two numerical examples and the portfolio selection problem show the effectiveness and performance of the proposed neural network. Copyright © 2013 Elsevier Ltd. All rights reserved.
Convex Relaxations for a Generalized Chan-Vese Model
Bae, Egil
2013-01-01
We revisit the Chan-Vese model of image segmentation with a focus on the encoding with several integer-valued labeling functions. We relate several representations with varying amount of complexity and demonstrate the connection to recent relaxations for product sets and to dual maxflow-based formulations. For some special cases, it can be shown that it is possible to guarantee binary minimizers. While this is not true in general, we show how to derive a convex approximation of the combinatorial problem for more than 4 phases. We also provide a method to avoid overcounting of boundaries in the original Chan-Vese model without departing from the efficient product-set representation. Finally, we derive an algorithm to solve the associated discretized problem, and demonstrate that it allows to obtain good approximations for the segmentation problem with various number of regions. © 2013 Springer-Verlag.
Convex analysis and monotone operator theory in Hilbert spaces
Bauschke, Heinz H
2017-01-01
This reference text, now in its second edition, offers a modern unifying presentation of three basic areas of nonlinear analysis: convex analysis, monotone operator theory, and the fixed point theory of nonexpansive operators. Taking a unique comprehensive approach, the theory is developed from the ground up, with the rich connections and interactions between the areas as the central focus, and it is illustrated by a large number of examples. The Hilbert space setting of the material offers a wide range of applications while avoiding the technical difficulties of general Banach spaces. The authors have also drawn upon recent advances and modern tools to simplify the proofs of key results making the book more accessible to a broader range of scholars and users. Combining a strong emphasis on applications with exceptionally lucid writing and an abundance of exercises, this text is of great value to a large audience including pure and applied mathematicians as well as researchers in engineering, data science, ma...
Entropies from Coarse-graining: Convex Polytopes vs. Ellipsoids
Directory of Open Access Journals (Sweden)
Nikos Kalogeropoulos
2015-09-01
Full Text Available We examine the Boltzmann/Gibbs/Shannon SBGS and the non-additive Havrda-Charvát/Daróczy/Cressie-Read/Tsallis Sq and the Kaniadakis κ-entropy Sκ from the viewpoint of coarse-graining, symplectic capacities and convexity. We argue that the functional form of such entropies can be ascribed to a discordance in phase-space coarse-graining between two generally different approaches: the Euclidean/Riemannian metric one that reflects independence and picks cubes as the fundamental cells in coarse-graining and the symplectic/canonical one that picks spheres/ellipsoids for this role. Our discussion is motivated by and confined to the behaviour of Hamiltonian systems of many degrees of freedom. We see that Dvoretzky’s theorem provides asymptotic estimates for the minimal dimension beyond which these two approaches are close to each other. We state and speculate about the role that dualities may play in this viewpoint.
Nonparametric instrumental regression with non-convex constraints
Grasmair, M.; Scherzer, O.; Vanhems, A.
2013-03-01
This paper considers the nonparametric regression model with an additive error that is dependent on the explanatory variables. As is common in empirical studies in epidemiology and economics, it also supposes that valid instrumental variables are observed. A classical example in microeconomics considers the consumer demand function as a function of the price of goods and the income, both variables often considered as endogenous. In this framework, the economic theory also imposes shape restrictions on the demand function, such as integrability conditions. Motivated by this illustration in microeconomics, we study an estimator of a nonparametric constrained regression function using instrumental variables by means of Tikhonov regularization. We derive rates of convergence for the regularized model both in a deterministic and stochastic setting under the assumption that the true regression function satisfies a projected source condition including, because of the non-convexity of the imposed constraints, an additional smallness condition.
Nonparametric instrumental regression with non-convex constraints
International Nuclear Information System (INIS)
Grasmair, M; Scherzer, O; Vanhems, A
2013-01-01
This paper considers the nonparametric regression model with an additive error that is dependent on the explanatory variables. As is common in empirical studies in epidemiology and economics, it also supposes that valid instrumental variables are observed. A classical example in microeconomics considers the consumer demand function as a function of the price of goods and the income, both variables often considered as endogenous. In this framework, the economic theory also imposes shape restrictions on the demand function, such as integrability conditions. Motivated by this illustration in microeconomics, we study an estimator of a nonparametric constrained regression function using instrumental variables by means of Tikhonov regularization. We derive rates of convergence for the regularized model both in a deterministic and stochastic setting under the assumption that the true regression function satisfies a projected source condition including, because of the non-convexity of the imposed constraints, an additional smallness condition. (paper)
Greedy vs. L1 Convex Optimization in Sparse Coding
DEFF Research Database (Denmark)
Ren, Huamin; Pan, Hong; Olsen, Søren Ingvor
Sparse representation has been applied successfully in many image analysis applications, including abnormal event detection, in which a baseline is to learn a dictionary from the training data and detect anomalies from its sparse codes. During this procedure, sparse codes which can be achieved...... and action recognition, a comparative study of codes in abnormal event detection is less studied and hence no conclusion is gained on the effect of codes in detecting abnormalities. We constrict our comparison in two types of the above L0-norm solutions: greedy algorithms and convex L1-norm solutions....... Considering the property of abnormal event detection, i.e., only normal videos are used as training data due to practical reasons, effective codes in classification application may not perform well in abnormality detection. Therefore, we compare the sparse codes and comprehensively evaluate their performance...
Reachability by paths of bounded curvature in a convex polygon
Ahn, Heekap
2012-01-01
Let B be a point robot moving in the plane, whose path is constrained to forward motions with curvature at most 1, and let P be a convex polygon with n vertices. Given a starting configuration (a location and a direction of travel) for B inside P, we characterize the region of all points of P that can be reached by B, and show that it has complexity O(n). We give an O(n2) time algorithm to compute this region. We show that a point is reachable only if it can be reached by a path of type CCSCS, where C denotes a unit circle arc and S denotes a line segment. © 2011 Elsevier B.V.
Rocking convex array used for 3D synthetic aperture focusing
DEFF Research Database (Denmark)
Andresen, Henrik; Nikolov, Svetoslav; Pedersen, M M
2008-01-01
Kretztechnik, Zipf, Austria). The array has an elevation focus at 60 mm of depth, and the angular rocking velocity is up to 140deg/s. The scan sequence uses an fprf of 4500 - 7000 Hz allowing up to 15 cm of penetration. The full width at half max (FWHM) and main-lobe to side-lobe ratio (MLSL) is used.......8% on average by applying 3D SA focusing. In-Vivo measurements show an improvement in C-scans matching what is found in simulations and wire phantoms. The method has shown the ability to improve the elevation focus and contrast for a convex rocking array. This was shown for simulations and for phantom and In...
Path Following in the Exact Penalty Method of Convex Programming.
Zhou, Hua; Lange, Kenneth
2015-07-01
Classical penalty methods solve a sequence of unconstrained problems that put greater and greater stress on meeting the constraints. In the limit as the penalty constant tends to ∞, one recovers the constrained solution. In the exact penalty method, squared penalties are replaced by absolute value penalties, and the solution is recovered for a finite value of the penalty constant. In practice, the kinks in the penalty and the unknown magnitude of the penalty constant prevent wide application of the exact penalty method in nonlinear programming. In this article, we examine a strategy of path following consistent with the exact penalty method. Instead of performing optimization at a single penalty constant, we trace the solution as a continuous function of the penalty constant. Thus, path following starts at the unconstrained solution and follows the solution path as the penalty constant increases. In the process, the solution path hits, slides along, and exits from the various constraints. For quadratic programming, the solution path is piecewise linear and takes large jumps from constraint to constraint. For a general convex program, the solution path is piecewise smooth, and path following operates by numerically solving an ordinary differential equation segment by segment. Our diverse applications to a) projection onto a convex set, b) nonnegative least squares, c) quadratically constrained quadratic programming, d) geometric programming, and e) semidefinite programming illustrate the mechanics and potential of path following. The final detour to image denoising demonstrates the relevance of path following to regularized estimation in inverse problems. In regularized estimation, one follows the solution path as the penalty constant decreases from a large value.
Effect of dental arch convexity and type of archwire on frictional forces
Fourie, Zacharias; Ozcan, Mutlu; Sandham, John
Introduction: Friction measurements in orthodontics are often derived from models by using brackets placed on flat models with various straight wires. Dental arches are convex in some areas. The objectives of this study were to compare the frictional forces generated in conventional flat and convex
On some Hermite-Hadamard type inequalities for (s, QC)-convex functions.
Wu, Ying; Qi, Feng
2016-01-01
In the paper, the authors introduce a new notion "[Formula: see text]-convex function on the co-ordinates" and establish some Hermite-Hadamard type integral inequalities for [Formula: see text]-convex functions on the co-ordinates.
Sandor Type Inequalities for Sugeno Integral with respect to General α,m,r-Convex Functions
Directory of Open Access Journals (Sweden)
Dong-Qing Li
2015-01-01
Full Text Available The concept for general α,m,r-convex functions, as a generalization of convex functions, is introduced. Then, Sandor type inequalities for the Sugeno integral based on this kind of function are established. Our work generalizes the previous results in the literature. Finally, some conclusions and problems for further investigations are given.
Groeneboom, P.; Jongbloed, G.; Wellner, J.A.
2001-01-01
A process associated with integrated Brownian motion is introduced that characterizes the limit behavior of nonparametric least squares and maximum likelihood estimators of convex functions and convex densities, respectively. We call this process “the invelope” and show that it is an almost surely
The Concept of Convexity in Fuzzy Set Theory | Rauf | Journal of the ...
African Journals Online (AJOL)
The notions of convex analysis are indispensable in theoretical and applied Mathematics especially in the study of Calculus where it has a natural generalization for the several variables case. This paper investigates the concept of Fuzzy set theory in relation to the idea of convexity. Some fundamental theorems were ...
The Concept of Convexity in Fuzzy Set Theory | Rauf | Journal of the ...
African Journals Online (AJOL)
This paper investigates the concept of Fuzzy set theory in relation to the idea of convexity. Some fundamental theorems were considered. Keywords: Fuzzy Set, Mapping for Fuzzy Set, Convex Set. 2010 Mathematics Subject Classification: 03Exx, 52Axx, 94B75 Journal of the Nigerian Association of Mathematical Physics, ...
Hermite-Hadamard type inequalities for GA-s-convex functions
Directory of Open Access Journals (Sweden)
İmdat İşcan
2014-10-01
Full Text Available In this paper, The author introduces the concepts of the GA-s-convex functions in the first sense and second sense and establishes some integral inequalities of Hermite-Hadamard type related to the GA-s-convex functions. Some applications to special means of real numbers are also given.
Optimality Conditions and Duality for DC Programming in Locally Convex Spaces
Directory of Open Access Journals (Sweden)
Wang Xianyun
2009-01-01
Full Text Available Consider the DC programming problem where and are proper convex functions defined on locally convex Hausdorff topological vector spaces and respectively, and is a linear operator from to . By using the properties of the epigraph of the conjugate functions, the optimality conditions and strong duality of are obtained.
DEFF Research Database (Denmark)
Bonnevie, Rasmus; Schmidt, Mikkel Nørgaard; Mørup, Morten
2017-01-01
is marginalized. We consider the KL-corrected collapsed variational bound and apply it to Dirichlet process mixture models, allowing us to reduce the optimization space considerably. We find that the variational bound exhibits consistent and exploitable structure, allowing the application of difference......-of-convex optimization algorithms. We show how this yields an interpretable fixed-point update algorithm in the collapsed setting for the Dirichlet process mixture model. We connect this update formula to classical coordinate ascent updates, illustrating that the proposed improvement surprisingly reduces......Variational methods for approximate inference in Bayesian models optimise a lower bound on the marginal likelihood, but the optimization problem often suffers from being nonconvex and high-dimensional. This can be alleviated by working in a collapsed domain where a part of the parameter space...
An Exact, Compressible One-Dimensional Riemann Solver for General, Convex Equations of State
Energy Technology Data Exchange (ETDEWEB)
Kamm, James Russell [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2015-03-05
This note describes an algorithm with which to compute numerical solutions to the one- dimensional, Cartesian Riemann problem for compressible flow with general, convex equations of state. While high-level descriptions of this approach are to be found in the literature, this note contains most of the necessary details required to write software for this problem. This explanation corresponds to the approach used in the source code that evaluates solutions for the 1D, Cartesian Riemann problem with a JWL equation of state in the ExactPack package [16, 29]. Numerical examples are given with the proposed computational approach for a polytropic equation of state and for the JWL equation of state.
A Novel Gradient Vector Flow Snake Model Based on Convex Function for Infrared Image Segmentation.
Zhang, Rui; Zhu, Shiping; Zhou, Qin
2016-10-21
Infrared image segmentation is a challenging topic because infrared images are characterized by high noise, low contrast, and weak edges. Active contour models, especially gradient vector flow, have several advantages in terms of infrared image segmentation. However, the GVF (Gradient Vector Flow) model also has some drawbacks including a dilemma between noise smoothing and weak edge protection, which decrease the effect of infrared image segmentation significantly. In order to solve this problem, we propose a novel generalized gradient vector flow snakes model combining GGVF (Generic Gradient Vector Flow) and NBGVF (Normally Biased Gradient Vector Flow) models. We also adopt a new type of coefficients setting in the form of convex function to improve the ability of protecting weak edges while smoothing noises. Experimental results and comparisons against other methods indicate that our proposed snakes model owns better ability in terms of infrared image segmentation than other snakes models.
Naturally fractured tight gas reservoir detection optimization
Energy Technology Data Exchange (ETDEWEB)
NONE
1998-11-30
The work plan for October 1, 1997 to September 30, 1998 consisted of investigation of a number of topical areas. These topical areas were reported in four quarterly status reports, which were submitted to DOE earlier. These topical areas are reviewed in this volume. The topical areas covered during the year were: (1) Development of preliminary tests of a production method for determining areas of natural fracturing. Advanced Resources has demonstrated that such a relationship exists in the southern Piceance basin tight gas play. Natural fracture clusters are genetically related to stress concentrations (also called stress perturbations) associated with local deformation such a faulting. The mechanical explanation of this phenomenon is that deformation generally initiates at regions where the local stress field is elevated beyond the regional. (2) Regional structural and geologic analysis of the Greater Green River Basin (GGRB). Application of techniques developed and demonstrated during earlier phases of the project for sweet-spot delineation were demonstrated in a relatively new and underexplored play: tight gas from continuous-typeUpper Cretaceous reservoirs of the Greater Green River Basin (GGRB). The effort included data acquisition/processing, base map generation, geophysical and remote sensing analysis and the integration of these data and analyses. (3) Examination of the Table Rock field area in the northern Washakie Basin of the Greater Green River Basin. This effort was performed in support of Union Pacific Resources- and DOE-planned horizontal drilling efforts. The effort comprised acquisition of necessary seismic data and depth-conversion, mapping of major fault geometry, and analysis of displacement vectors, and the development of the natural fracture prediction. (4) Greater Green River Basin Partitioning. Building on fundamental fracture characterization work and prior work performed under this contract, namely structural analysis using satellite and
Directory of Open Access Journals (Sweden)
Feixiang Chen
2014-01-01
Full Text Available We obtain some Hermite-Hadamard type inequalities for products of two m-convex functions via Riemann-Liouville integrals. The analogous results for (α,m-convex functions are also established.
Naturally fractured tight gas reservoir detection optimization
Energy Technology Data Exchange (ETDEWEB)
NONE
1999-06-01
Building upon the partitioning of the Greater Green River Basin (GGRB) that was conducted last quarter, the goal of the work this quarter has been to conclude evaluation of the Stratos well and the prototypical Green River Deep partition, and perform the fill resource evaluation of the Upper Cretaceous tight gas play, with the goal of defining target areas of enhanced natural fracturing. The work plan for the quarter of November 1-December 31, 1998 comprised four tasks: (1) Evaluation of the Green River Deep partition and the Stratos well and examination of potential opportunity for expanding the use of E and P technology to low permeability, naturally fractured gas reservoirs, (2) Gas field studies, and (3) Resource analysis of the balance of the partitions.
Tight gas sand tax credit yields opportunities
International Nuclear Information System (INIS)
Lewis, F.W.; Osburn, A.S.
1991-01-01
The U.S. Internal Revenue Service on Apr. 1, 1991, released the inflation adjustments used in the calculations of Non-Conventional Fuel Tax Credits for 1990. The inflation adjustment, 1.6730, when applied to the base price of $3/bbl of oil equivalent, adjusts the tax credit to $5.019/bbl for oil and 86.53 cents/MMBTU for gas. The conversion factor for equivalent fuels is 5.8 MMBTU/bbl. Unfortunately, the tax credit for tight formation gas continues to be unadjusted for inflation and remains 52 cents/MMBTU. As many producers are aware, the Omnibus Budget Reconciliation Act of 1990 expanded the dates of eligibility and the usage for-Non-Conventional Fuel Tax Credits. Among other provisions, eligible wells may be placed in service until Jan. 1, 1992, and once in place may utilize the credit for production through Dec. 31, 2002. Both dates are 2 year extensions from previous regulations
Non-convex shape effects on the dense random packing properties of assembled rods
Meng, Lingyi; Wang, Chao; Yao, Xiaohu
2018-01-01
The packing of rod-like particles, which is common in physical and mathematical studies, has arisen in a variety of industrial applications. Elongation effect on the packing properties of rod-like particle has been well investigated. Besides that, rod-like particles can be easily deformed into a large amount of non-convex shapes by simply bending or assembling several particles, in which effects of non-convex deformations should also be concerned. In this work, the packing behaviors of particulate systems composed of various non-convex deformations of rod-like particles are numerically simulated via the analytical model and the relaxation algorithm. The packing configurations are further optimized using the Monte Carlo method to eliminate the local ordered structures. 8 shapes of non-convex particles including 2-dimensional and 3-dimensional particles are employed in the packing systems. Independent of aspect ratio, the dense random packing densities of identical assembled rods are up to 20% higher than those of spherocylinders and are less dependent from the specific particle shape. However, the coordination numbers of various non-convex particle packings are quite different. With a parameter of convex ratio defined, a packing composed of more non-convex particles will have a higher coordination number. This indicates that for more non-convex particle packings, there are more constraints and entanglements among neighboring particles, resulting in a more stable configuration. The nearest-neighbor contact to a centered particle in 3DX-shaped particle packings is quite different from those of other shapes, which can be identified from the location of the first peak in the radial distribution function. It is also the cause to the distinct disparities of estimated excluded volumes of non-convex particles simulated in this work.
Global Coal Trade. From Tightness to Oversupply
International Nuclear Information System (INIS)
Cornot-Gandolphe, Sylvie
2013-01-01
Over the past four years, international coal trade has been reshaped by China's surging imports. China, which was still a net exporter in 2008, became the world's first coal importer in 2011, taking over the position that Japan has occupied for three decades. Its imports have continued their rising trend and reached a record level in 2012, despite the country's economic slowdown. China imported 289 million tons of coal in 2012, up 30% over 2011. It now accounts for 23% of global imports. Although China is the world's largest coal producer, several factors have contributed to the sudden rise in its imports, including the higher cost of domestic coal relative to international prices and bottlenecks in transporting domestic coal to south-eastern provinces. More recently, another event shook the international coal business: the United States have been back on the market. The collapse of U.S. gas prices, to $4/million Btu in 2011 and even $2.75/million Btu in 2012, linked with the 'shale gas revolution', has made coal uncompetitive in the electricity sector, its main outlet on the U.S. market. U.S. coal demand dropped 4% in 2011 and 11% in 2012. The reduction in domestic demand has forced U.S. miners to look for overseas outlets. Their exports surged by 31% in 2011 and 16% in 2012. They reached 112 million tons in 2012, more than twice the level of 2009. The United States, which almost disappeared from the international steam coal market in the 2000's, have regained a larger share of the total coal export market, 9% in 2012, against 6% in 2009. These developments, although not directly linked, have a huge impact on the global market and pricing of coal. Chinese imports have helped the market to quickly recover from its low level of 2008-2009. The speed and magnitude of China's coal imports even shifts the market from a sluggish to a tight situation. Prices started to rise after their collapse in the second half of 2008 caused by the economic and financial crisis
Neural network for nonsmooth pseudoconvex optimization with general convex constraints.
Bian, Wei; Ma, Litao; Qin, Sitian; Xue, Xiaoping
2018-05-01
In this paper, a one-layer recurrent neural network is proposed for solving a class of nonsmooth, pseudoconvex optimization problems with general convex constraints. Based on the smoothing method, we construct a new regularization function, which does not depend on any information of the feasible region. Thanks to the special structure of the regularization function, we prove the global existence, uniqueness and "slow solution" character of the state of the proposed neural network. Moreover, the state solution of the proposed network is proved to be convergent to the feasible region in finite time and to the optimal solution set of the related optimization problem subsequently. In particular, the convergence of the state to an exact optimal solution is also considered in this paper. Numerical examples with simulation results are given to show the efficiency and good characteristics of the proposed network. In addition, some preliminary theoretical analysis and application of the proposed network for a wider class of dynamic portfolio optimization are included. Copyright © 2018 Elsevier Ltd. All rights reserved.
On asphericity of convex bodies in linear normed spaces.
Faried, Nashat; Morsy, Ahmed; Hussein, Aya M
2018-01-01
In 1960, Dvoretzky proved that in any infinite dimensional Banach space X and for any [Formula: see text] there exists a subspace L of X of arbitrary large dimension ϵ -iometric to Euclidean space. A main tool in proving this deep result was some results concerning asphericity of convex bodies. In this work, we introduce a simple technique and rigorous formulas to facilitate calculating the asphericity for each set that has a nonempty boundary set with respect to the flat space generated by it. We also give a formula to determine the center and the radius of the smallest ball containing a nonempty nonsingleton set K in a linear normed space, and the center and the radius of the largest ball contained in it provided that K has a nonempty boundary set with respect to the flat space generated by it. As an application we give lower and upper estimations for the asphericity of infinite and finite cross products of these sets in certain spaces, respectively.
Link Prediction via Convex Nonnegative Matrix Factorization on Multiscale Blocks
Directory of Open Access Journals (Sweden)
Enming Dong
2014-01-01
Full Text Available Low rank matrices approximations have been used in link prediction for networks, which are usually global optimal methods and lack of using the local information. The block structure is a significant local feature of matrices: entities in the same block have similar values, which implies that links are more likely to be found within dense blocks. We use this insight to give a probabilistic latent variable model for finding missing links by convex nonnegative matrix factorization with block detection. The experiments show that this method gives better prediction accuracy than original method alone. Different from the original low rank matrices approximations methods for link prediction, the sparseness of solutions is in accord with the sparse property for most real complex networks. Scaling to massive size network, we use the block information mapping matrices onto distributed architectures and give a divide-and-conquer prediction method. The experiments show that it gives better results than common neighbors method when the networks have a large number of missing links.
Convergence theorems for quasi-contractive maps in uniformly convex spaces
International Nuclear Information System (INIS)
Chidume, C.E.; Osilike, M.O.
1992-04-01
Let K be a nonempty closed convex and bounded subset of a real uniformly convex Banach space E of modulus of convexity of power type q≥2. Let T by a quasi-contractive mapping of K into itself. It is proved that each of two well known fixed point iteration methods (the Mann and the Ishikawa iteration methods) converges strongly, without any compactness assumption on the domain of the map, to the unique fixed point of T in K. Our theorems generalize important known results. (author). 22 refs
A One-Layer Recurrent Neural Network for Constrained Complex-Variable Convex Optimization.
Qin, Sitian; Feng, Jiqiang; Song, Jiahui; Wen, Xingnan; Xu, Chen
2018-03-01
In this paper, based on calculus and penalty method, a one-layer recurrent neural network is proposed for solving constrained complex-variable convex optimization. It is proved that for any initial point from a given domain, the state of the proposed neural network reaches the feasible region in finite time and converges to an optimal solution of the constrained complex-variable convex optimization finally. In contrast to existing neural networks for complex-variable convex optimization, the proposed neural network has a lower model complexity and better convergence. Some numerical examples and application are presented to substantiate the effectiveness of the proposed neural network.
Convergence theorems for a class of nonlinear maps in uniformly convex spaces
International Nuclear Information System (INIS)
Chidume, C.E.; Osilike, M.O.
1992-04-01
Let K be a nonempty closed convex and bounded subset of a real uniformly convex Banach space E of modulus of convexity of power type q≥2. Let T be a mapping of K into itself and suppose T is an element of C (in the notation of Browder and Petryshyn; and Rhoades). It is proved that each of two well known fixed point iteration methods (the Mann and the Ishikawa iteration methods) converges strongly to the unique fixed point of T. (author). 20 refs
Fast Bundle-Level Type Methods for Unconstrained and Ball-Constrained Convex Optimization
2014-12-01
f), C2(x,R, f) are some constants that depend on f in (2.1). For example, if f is a smooth convex function , ∇f is Lipschitz continuous in Rn with...assumed to be a simple Lipschitz continuous 13 convex function , and only Fη is approximated by the linear estimation. However in the FUSL method, we...90C22, 49M37 1. Introduction. Given a convex function f : Rn → R, the main problem of interest in this paper is: f∗ := min x∈Rn f(x). (1.1) Throughout
S0 Tight Loop Studies on ICHIRO 9-Cell Cavities
Energy Technology Data Exchange (ETDEWEB)
Furuta, Fumio [KEK; Konomi, T. [KEK; Saito, Kenji [KEK; Bice, Damon [Fermilab; Crawford, Anthony C. [JLAB; Geng, Rongli [JLAB
2009-11-01
We have continued high gradient R&D of ICHIRO 9-cell cavities at KEK. ICHIRO 9-cell cavity #5 (I9#5) that has no end groups on beam tube to focus on high gradient sent to Jlab as S0 tight loop study. Surface treatments and vertical test were repeated 3 times at Jlab, and then I9#5 sent back to KEK. We also repeated surface treatments and test at KEK. Maximum gradients were 36.5MV/m at Jlab, and 33.7MV/m at KEK so far. Now we are struggling with the puzzle why the results of singles do not work well on 9-cell cavities.
MANAGING TIGHT BINDING RECEPTORS FOR NEW SPEARATIONS TECHNOLOGIES
Energy Technology Data Exchange (ETDEWEB)
DARYLE H BUSCH RICHARD S GIVENS
2004-12-10
even more interesting. They convert from rings to structures that wrap around a metal ion to form a cage. These ligands are called cryptands. Switch release is accomplished by photolytic cleavage of a bond to convert a cyclic ligand into a linear ligand or to break similar bonds in a cryptate. Our studies have demonstrated switch binding and switch release with cryptates of calcium. These remarkable cyclic ligands and cage-like ligands are indeed tight-binding and may, in principle, be incorporated in various separations methodologies, including the soil poultice. The soil poultice mimics the way in which microbes secrete extremely powerful ligands into the soil in order to harvest iron. The cellular membrane of the microbe recognizes the iron/ligand complex and admits it into the cell. The soil poultice uses molecularly imprinted polymers (MIPs) to play the role of the cellular membrane. Imprinting involves creation of the polymer in the presence of the metal/ligand complex. In principle, a well design ligand/MIP combination can be highly selective toward almost any targeted metal ion. The principles for that design are the focus of these investigations. An imprinting molecule can interact with the polymer through any, some, or all of the so-called supramolecular modes; e.g., hydrogen bonding, electrostatic charge, minor ligand bonding, Pi-Pi stacking, and hydrophobic and van der Waals interactions. Historically these modes of binding have given MIPs only small re-binding capacities and very limited selectivities. This program has shown that each mode of interaction can be made more powerful than previously suspected and that combinations of different supramolecular interaction modes can produce remarkable synergisms. The results of this systematic study provide a firm foundation for tailoring molecular imprinted polymers for reclamation of specific metal ion, including those important to the DOE EM mission.
Energy Technology Data Exchange (ETDEWEB)
Paschmann, Martin
2017-11-15
Analyzing price data from sequential German electricity markets, namely the day-ahead and intraday auction, a puzzling but apparently systematic pattern of price premiums can be identified. The price premiums are highly correlated with the underlying demand profile. As there is evidence that widespread models for electricity forward premiums are not applicable to the market dynamics under analysis, a theoretical model is developed within this article which reveals that non-convexities in only a subset of sequential markets with differing product granularity may cause systematic price premiums at equilibrium. These price premiums may be bidirectional and reflect a value for additional short-term power supply system flexibility.
Convex integration theory solutions to the h-principle in geometry and topology
Spring, David
1998-01-01
This book provides a comprehensive study of convex integration theory in immersion-theoretic topology. Convex integration theory, developed originally by M. Gromov, provides general topological methods for solving the h-principle for a wide variety of problems in differential geometry and topology, with applications also to PDE theory and to optimal control theory. Though topological in nature, the theory is based on a precise analytical approximation result for higher order derivatives of functions, proved by M. Gromov. This book is the first to present an exacting record and exposition of all of the basic concepts and technical results of convex integration theory in higher order jet spaces, including the theory of iterated convex hull extensions and the theory of relative h-principles. A second feature of the book is its detailed presentation of applications of the general theory to topics in symplectic topology, divergence free vector fields on 3-manifolds, isometric immersions, totally real embeddings, u...
Directory of Open Access Journals (Sweden)
Sercan TURHAN
2016-04-01
Full Text Available In this paper, we gave the new general identity for differentiable functions. As a result of this identity some new and general inequalities for differentiable harmonically-convex functions are obtained.
CSIR Research Space (South Africa)
Govender, Nicolin
2015-09-01
Full Text Available Convex polyhedra represent granular media well. This geometric representation may be critical in obtaining realistic simulations of many industrial processes using the discrete element method (DEM). However detecting collisions between the polyhedra...
Coefficient Bounds for Some Families of Starlike and Convex Functions of Reciprocal Order
Arif, Muhammad; Darus, Maslina; Raza, Mohsan; Khan, Qaiser
2014-01-01
The aim of the present paper is to investigate coefficient estimates, Fekete-Szegő inequality, and upper bound of third Hankel determinant for some families of starlike and convex functions of reciprocal order. PMID:25506621
Optimization of Transverse Oscillating Fields for Vector Velocity Estimation with Convex Arrays
DEFF Research Database (Denmark)
Jensen, Jørgen Arendt
2013-01-01
A method for making Vector Flow Images using the transverse oscillation (TO) approach on a convex array is presented. The paper presents optimization schemes for TO fields for convex probes and evaluates their performance using Field II simulations and measurements using the SARUS experimental...... scanner. A 3 MHz 192 elements convex array probe (pitch 0.33 mm) is used in both simulations and measurements. An F-number of 5 is used in transmit and two 32 element wide peaks are used in receive separated by 96 elements between peaks. Parabolic velocity profiles are simulated at beam-to-flow angles......) at a depth of 40 mm. Measurements have been made using the SARUS experimental ultrasound scanner and a BK Medical 8820e convex array transducer. Sixty-four elements was used in transmit and 2 x 32 elements in receive for creating a color flow map image of a flow rig phantom with a laminar, parabolic flow...
New Criteria for Functions to Be in a Class of -Valent Alpha Convex Functions
Directory of Open Access Journals (Sweden)
Muhammad Arif
2013-01-01
Full Text Available We obtain certain simple sufficiency criteria for a class of -valent alpha convex functions. Many known results appear as special consequences of our work. Some applications of our work to the generalized integral operator are also given.
Digital Rock Studies of Tight Porous Media
Energy Technology Data Exchange (ETDEWEB)
Silin, Dmitriy [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
2012-08-07
This technical report summarizes some recently developed approaches to studies of rock properties at a pore scale. Digital rock approach is complementary to laboratory and field studies. It can be especially helpful in situations where experimental data are uncertain, or are difficult or impossible to obtain. Digitized binary images of the pore geometries of natural rocks obtained by different imaging techniques are the input data. Computer-generated models of natural rocks can be used instead of images in a case where microtomography data are unavailable, or the resolution of the tools is insufficient to adequately characterize the features of interest. Simulations of creeping viscous flow in pores produce estimates of Darcy permeability. Maximal Inscribed Spheres calculations estimate two-phase fluid distribution in capillary equilibrium. A combination of both produce relative permeability curves. Computer-generated rock models were employed to study two-phase properties of fractured rocks, or tight sands with slit-like pores, too narrow to be characterized with micro-tomography. Various scenarios can simulate different fluid displacement mechanisms, from piston-like drainage to liquid dropout at the dew point. A finite differences discretization of Stokes equation is developed to simulate flow in the pore space of natural rocks. The numerical schemes are capable to handle both no-slip and slippage flows. An upscaling procedure estimates the permeability by subsampling a large data set. Capillary equilibrium and capillary pressure curves are efficiently estimated with the method of maximal inscribed spheres both an arbitrary contact angle. The algorithms can handle gigobytes of data on a desktop workstation. Customized QuickHull algorithms model natural rocks. Capillary pressure curves evaluated from computer-generated images mimic those obtained for microtomography data.
Chierchia, Giovanni; Pustelnik, Nelly; Pesquet, Jean-Christophe; Pesquet-Popescu, Béatrice
2012-01-01
We propose a proximal approach to deal with a class of convex variational problems involving nonlinear constraints. A large family of constraints, proven to be effective in the solution of inverse problems, can be expressed as the lower level set of a sum of convex functions evaluated over different, but possibly overlapping, blocks of the signal. For such constraints, the associated projection operator generally does not have a simple form. We circumvent this difficulty by splitting the lowe...
Chierchia, Giovanni; Pustelnik, Nelly; Pesquet, Jean-Christophe; Pesquet-Popescu, Béatrice
2012-01-01
We propose a proximal approach to deal with convex optimization problems involving nonlinear constraints. A large family of such constraints, proven to be effective in the solution of inverse problems, can be expressed as the lower level set of a sum of convex functions evaluated over different, but possibly overlapping, blocks of the signal. For this class of constraints, the associated projection operator generally does not have a closed form. We circumvent this difficulty by splitting the ...
Epigraphical splitting for solving constrained convex optimization problems with proximal tools
Chierchia, Giovanni; Pustelnik, Nelly; Pesquet, Jean-Christophe; Pesquet-Popescu, Béatrice
2015-01-01
International audience; We propose a proximal approach to deal with a class of convex variational problems involving nonlinear constraints. A large family of constraints, proven to be effective in the solution of inverse problems, can be expressed as the lower level set of a sum of convex functions evaluated over different blocks of the linearly-transformed signal. For such constraints, the associated projection operator generally does not have a simple form. We circumvent this difficulty by ...
Optimisation convexe pour l'estimation simultanée de réponses acoustiques
Benichoux, Alexis; Vincent, Emmanuel; Gribonval, Rémi
2011-01-01
National audience; We consider the estimation of acoustic impulse responses from the simultaneous recording of several known sources. Existing techniques are restricted to the case where the number of sources is at most equal to the number of sensors. We relax this assumption in the case where the sources are known. To this aim, we propose statistical models of the filters associated with a convex log-likelihood, and we propose a convex optimization algorithm to solve the inverse problem, wit...
Pattern Discovery in Brain Imaging Genetics via SCCA Modeling with a Generic Non-convex Penalty.
Du, Lei; Liu, Kefei; Yao, Xiaohui; Yan, Jingwen; Risacher, Shannon L; Han, Junwei; Guo, Lei; Saykin, Andrew J; Shen, Li
2017-10-25
Brain imaging genetics intends to uncover associations between genetic markers and neuroimaging quantitative traits. Sparse canonical correlation analysis (SCCA) can discover bi-multivariate associations and select relevant features, and is becoming popular in imaging genetic studies. The L1-norm function is not only convex, but also singular at the origin, which is a necessary condition for sparsity. Thus most SCCA methods impose [Formula: see text]-norm onto the individual feature or the structure level of features to pursuit corresponding sparsity. However, the [Formula: see text]-norm penalty over-penalizes large coefficients and may incurs estimation bias. A number of non-convex penalties are proposed to reduce the estimation bias in regression tasks. But using them in SCCA remains largely unexplored. In this paper, we design a unified non-convex SCCA model, based on seven non-convex functions, for unbiased estimation and stable feature selection simultaneously. We also propose an efficient optimization algorithm. The proposed method obtains both higher correlation coefficients and better canonical loading patterns. Specifically, these SCCA methods with non-convex penalties discover a strong association between the APOE e4 rs429358 SNP and the hippocampus region of the brain. They both are Alzheimer's disease related biomarkers, indicating the potential and power of the non-convex methods in brain imaging genetics.
Directory of Open Access Journals (Sweden)
Nianyin Li
2015-09-01
Full Text Available How to effectively develop tight-gas carbonate reservoir and achieve high recovery is always a problem for the oil and gas industry. To solve this problem, domestic petroleum engineers use the combination of the successful experiences of North American shale gas pools development by stimulated reservoir volume (SRV fracturing with the research achievements of Chinese tight gas development by acid fracturing to propose volume acid fracturing technology for fractured tight-gas carbonate reservoir, which has achieved a good stimulation effect in the pilot tests. To determine what reservoir conditions are suitable to carry out volume acid fracturing, this paper firstly introduces volume acid fracturing technology by giving the stimulation mechanism and technical ideas, and initially analyzes the feasibility by the comparison of reservoir characteristics of shale gas with tight-gas carbonate. Then, this paper analyzes the validity and limitation of the volume acid fracturing technology via the analyses of control conditions for volume acid fracturing in reservoir fracturing performance, natural fracture, horizontal principal stress difference, orientation of in-situ stress and natural fracture, and gives the solution for the limitation. The study results show that the volume acid fracturing process can be used to greatly improve the flow environment of tight-gas carbonate reservoir and increase production; the incremental or stimulation response is closely related with reservoir fracturing performance, the degree of development of natural fracture, the small intersection angle between hydraulic fracture and natural fracture, the large horizontal principal stress difference is easy to form a narrow fracture zone, and it is disadvantageous to create fracture network, but the degradable fiber diversion technology may largely weaken the disadvantage. The practices indicate that the application of volume acid fracturing process to the tight-gas carbonate
Kadukova, Maria; Grudinin, Sergei
2017-10-01
We present a novel optimization approach to train a free-shape distance-dependent protein-ligand scoring function called Convex-PL. We do not impose any functional form of the scoring function. Instead, we decompose it into a polynomial basis and deduce the expansion coefficients from the structural knowledge base using a convex formulation of the optimization problem. Also, for the training set we do not generate false poses with molecular docking packages, but use constant RMSD rigid-body deformations of the ligands inside the binding pockets. This allows the obtained scoring function to be generally applicable to scoring of structural ensembles generated with different docking methods. We assess the Convex-PL scoring function using data from D3R Grand Challenge 2 submissions and the docking test of the CASF 2013 study. We demonstrate that our results outperform the other 20 methods previously assessed in CASF 2013. The method is available at http://team.inria.fr/nano-d/software/Convex-PL/.
Loose and Tight GNSS/INS Integrations: Comparison of Performance Assessed in Real Urban Scenarios.
Falco, Gianluca; Pini, Marco; Marucco, Gianluca
2017-01-29
Global Navigation Satellite Systems (GNSSs) remain the principal mean of positioning in many applications and systems, but in several types of environment, the performance of standalone receivers is degraded. Although many works show the benefits of the integration between GNSS and Inertial Navigation Systems (INSs), tightly-coupled architectures are mainly implemented in professional devices and are based on high-grade Inertial Measurement Units (IMUs). This paper investigates the performance improvements enabled by the tight integration, using low-cost sensors and a mass-market GNSS receiver. Performance is assessed through a series of tests carried out in real urban scenarios and is compared against commercial modules, operating in standalone mode or featuring loosely-coupled integrations. The paper describes the developed tight-integration algorithms with a terse mathematical model and assesses their efficacy from a practical perspective.
Fast inference of ill-posed problems within a convex space
Fernandez-de-Cossio-Diaz, J.; Mulet, R.
2016-07-01
In multiple scientific and technological applications we face the problem of having low dimensional data to be justified by a linear model defined in a high dimensional parameter space. The difference in dimensionality makes the problem ill-defined: the model is consistent with the data for many values of its parameters. The objective is to find the probability distribution of parameter values consistent with the data, a problem that can be cast as the exploration of a high dimensional convex polytope. In this work we introduce a novel algorithm to solve this problem efficiently. It provides results that are statistically indistinguishable from currently used numerical techniques while its running time scales linearly with the system size. We show that the algorithm performs robustly in many abstract and practical applications. As working examples we simulate the effects of restricting reaction fluxes on the space of feasible phenotypes of a genome scale Escherichia coli metabolic network and infer the traffic flow between origin and destination nodes in a real communication network.
Generic assessment of tight-fitting annulus spacer mobility
International Nuclear Information System (INIS)
Robertson, J.; Micuda, L.; Van Den Brekel, N.
2006-01-01
This paper provides a generic assessment of the mobility of tight-fitting fuel channel annulus spacers in OPG and Bruce Power nuclear units. This assessment is applicable to all tight-fitting annulus spacers, including those used in the original fuel channel installation (Darlington Units 1-4, retubed Pickering Units 1-4, and Bruce Unit 8) and as a result of single fuel channel replacements (SFCR) (Pickering Units 5-8, Bruce Units 3-7). Tight-fitting annulus spacers were designed not to move. Pressure tube to calandria tube contact analyses, and the associated blister susceptibility assessments, have assumed that these tight-fitting spacers remain at the pre-service installed locations. Given the importance of this assumption, the technical basis for the expectation that tight-fitting annulus spacers do not move significantly from their pre-service locations, relative to the pressure tube, was reviewed in detail. The review also assessed the inspection data, comparing spacer locations from in-service and pre-service inspections. The review has concluded that tight-fitting spacers do not move sufficiently to necessitate a postulated spacer movement in fuel channel contact analyses. The paper describes the background of this issue, briefly reviews the experimental programs used to qualify the positional stability of the tight-fitting spacer design, and evaluates the current database of in-service spacer location inspection information to demonstrate that no significant movement relative to the pressure tube has been observed. (author)
libCreme: An optimization library for evaluating convex-roof entanglement measures
Röthlisberger, Beat; Lehmann, Jörg; Loss, Daniel
2012-01-01
We present the software library libCreme which we have previously used to successfully calculate convex-roof entanglement measures of mixed quantum states appearing in realistic physical systems. Evaluating the amount of entanglement in such states is in general a non-trivial task requiring to solve a highly non-linear complex optimization problem. The algorithms provided here are able to achieve to do this for a large and important class of entanglement measures. The library is mostly written in the MATLAB programming language, but is fully compatible to the free and open-source OCTAVE platform. Some inefficient subroutines are written in C/C++ for better performance. This manuscript discusses the most important theoretical concepts and workings of the algorithms, focusing on the actual implementation and usage within the library. Detailed examples in the end should make it easy for the user to apply libCreme to specific problems. Program summaryProgram title:libCreme Catalogue identifier: AEKD_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEKD_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: GNU GPL version 3 No. of lines in distributed program, including test data, etc.: 4323 No. of bytes in distributed program, including test data, etc.: 70 542 Distribution format: tar.gz Programming language: Matlab/Octave and C/C++ Computer: All systems running Matlab or Octave Operating system: All systems running Matlab or Octave Classification: 4.9, 4.15 Nature of problem: Evaluate convex-roof entanglement measures. This involves solving a non-linear (unitary) optimization problem. Solution method: Two algorithms are provided: A conjugate-gradient method using a differential-geometric approach and a quasi-Newton method together with a mapping to Euclidean space. Running time: Typically seconds to minutes for a density matrix of a few low-dimensional systems and a decent implementation of the
Western tight gas sands advanced logging workshop proceedings
Energy Technology Data Exchange (ETDEWEB)
Jennings, J B; Carroll, Jr, H B [eds.
1982-04-01
An advanced logging research program is one major aspect of the Western Tight Sands Program. Purpose of this workshop is to help BETC define critical logging needs for tight gas sands and to allow free interchange of ideas on all aspects of the current logging research program. Sixteen papers and abstracts are included together with discussions. Separate abstracts have been prepared for the 12 papers. (DLC)
Improved RIP Conditions for Compressed Sensing with Coherent Tight Frames
Directory of Open Access Journals (Sweden)
Yao Wang
2017-01-01
Full Text Available This paper establishes new sufficient conditions on the restricted isometry property (RIP for compressed sensing with coherent tight frames. One of our main results shows that the RIP (adapted to D condition δk+θk,k<1 guarantees the stable recovery of all signals that are nearly k-sparse in terms of a coherent tight frame D via the l1-analysis method, which improves the existing ones in the literature.
Chine, Abderrazek
1991-01-01
Cette thèse est consacrée a l'étude des algorithmes en optimisation non convexe, a l'implémentation des codes a l'usage industriel et aux simulations numériques dans les problèmes de grande tailles. L'étude des problèmes quadratiques (convexes ou non convexes) sous contraintes linéaires et quadratiques ainsi que celle des méthodes de région de confiance pour minimisation d'une fonction de classe c#2, font l'objet de deux premiers chapitres. Les chapitres 3 et 4 sont réservés a l'optimisation ...
Modified surface testing method for large convex aspheric surfaces based on diffraction optics.
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.
A Convex Model for Nonnegative Matrix Factorization and Dimensionality Reduction on Physical Space
Esser, Ernie; Moller, Michael; Osher, Stanley; Sapiro, Guillermo; Xin, Jack
2012-07-01
A collaborative convex framework for factoring a data matrix $X$ into a non-negative product $AS$, with a sparse coefficient matrix $S$, is proposed. We restrict the columns of the dictionary matrix $A$ to coincide with certain columns of the data matrix $X$, thereby guaranteeing a physically meaningful dictionary and dimensionality reduction. We use $l_{1,\\infty}$ regularization to select the dictionary from the data and show this leads to an exact convex relaxation of $l_0$ in the case of distinct noise free data. We also show how to relax the restriction-to-$X$ constraint by initializing an alternating minimization approach with the solution of the convex model, obtaining a dictionary close to but not necessarily in $X$. We focus on applications of the proposed framework to hyperspectral endmember and abundances identification and also show an application to blind source separation of NMR data.
Convex Formulation for Kernel PCA and Its Use in Semisupervised Learning.
Alaiz, Carlos M; Fanuel, Michael; Suykens, Johan A K
2017-06-23
In this brief, kernel principal component analysis (KPCA) is reinterpreted as the solution to a convex optimization problem. Actually, there is a constrained convex problem for each principal component, so that the constraints guarantee that the principal component is indeed a solution, and not a mere saddle point. Although these insights do not imply any algorithmic improvement, they can be used to further understand the method, formulate possible extensions, and properly address them. As an example, a new convex optimization problem for semisupervised classification is proposed, which seems particularly well suited whenever the number of known labels is small. Our formulation resembles a least squares support vector machine problem with a regularization parameter multiplied by a negative sign, combined with a variational principle for KPCA. Our primal optimization principle for semisupervised learning is solved in terms of the Lagrange multipliers. Numerical experiments in several classification tasks illustrate the performance of the proposed model in problems with only a few labeled data.
A Sufficient Condition on Convex Relaxation of AC Optimal Power Flow in Distribution Networks
DEFF Research Database (Denmark)
Huang, Shaojun; Wu, Qiuwei; Wang, Jianhui
2016-01-01
This paper proposes a sufficient condition for the convex relaxation of AC Optimal Power Flow (OPF) in radial distribution networks as a second order cone program (SOCP) to be exact. The condition requires that the allowed reverse power flow is only reactive or active, or none. Under the proposed...... solution of the SOCP can be converted to an optimal solution of the original AC OPF. The efficacy of the convex relaxation to solve the AC OPF is demonstrated by case studies of an optimal multi-period planning problem of electric vehicles (EVs) in distribution networks....
License or entry decision for innovator in international duopoly with convex cost functions
Hattori, Masahiko; Tanaka, Yasuhito
2017-01-01
We consider a choice of options for a foreign innovating firm to license its new cost-reducing technology to a domestic incumbent firm or to enter the domestic market with or without license under convex cost functions. With convex cost functions the domestic market and the foreign market are not separated, and the results depend on the relative size of those markets. In a specific case with linear demand and quadratic cost, entry without license strategy is never the optimal strategy for the...
Conditions for Bounded Closed and Convex Sets to Have a Unique Completion in Banach Spaces
Directory of Open Access Journals (Sweden)
JI Dong-hai
2017-06-01
Full Text Available In order to study the conditions for bounded closed and convex sets to have a unique completion inreal Banach spaces，known results in this direction are summarized. Based on this，a sufficient condition as well as some necessary and sufficient conditions for bounded closed and convex sets to have a unique completion areprovided. The notion of ( K，u -completeness is extended，and the relation of this notion to the uniqueness of completion in real Banach spaces is discussed.
Implementation of an optimal first-order method for strongly convex total variation regularization
DEFF Research Database (Denmark)
Jensen, Tobias Lindstrøm; Jørgensen, Jakob Heide; Hansen, Per Christian
2012-01-01
We present a practical implementation of an optimal first-order method, due to Nesterov, for large-scale total variation regularization in tomographic reconstruction, image deblurring, etc. The algorithm applies to μ-strongly convex objective functions with L-Lipschitz continuous gradient....... In the framework of Nesterov both μ and L are assumed known—an assumption that is seldom satisfied in practice. We propose to incorporate mechanisms to estimate locally sufficient μ and L during the iterations. The mechanisms also allow for the application to non-strongly convex functions. We discuss...
The canonical partial metric and the uniform convexity on normed spaces
Directory of Open Access Journals (Sweden)
S. Oltra
2005-10-01
Full Text Available In this paper we introduce the notion of canonical partial metric associated to a norm to study geometric properties of normed spaces. In particular, we characterize strict convexity and uniform convexity of normed spaces in terms of the canonical partial metric defined by its norm. We prove that these geometric properties can be considered, in this sense, as topological properties that appear when we compare the natural metric topology of the space with the non translation invariant topology induced by the canonical partial metric in the normed space.
Tight-binding model for materials at mesoscale
Energy Technology Data Exchange (ETDEWEB)
2016-12-21
TBM3 is an open source package for computational simulations of quantum materials at multiple scales in length and time. The project originated to investigate the multiferroic behavior in transition-metal oxide heterostructures. The framework has also been designed to study emergent phemona in other quantum materials like 2-dimensional transition-metal dichalcogenides, graphene, topological insulators, and skyrmion in materials, etc. In the long term, we will enable the package for transport and time-resolved phenomena. TBM3 is currently a C++ based numerical tool package and framework for the design and construction of any kind of lattice structures with multi-orbital and spin degrees of freedom. The fortran based portion of the package will be added in the near future. The design of TBM3 is in a highly flexible and reusable framework and the tight-binding parameters can be modeled or informed by DFT calculations. It is currently GPU enabled and feature of CPU enabled MPI will be added in the future.
Tight binding of NAP-22 with acidic membrane lipids.
Maekawa, Shohei; Kobayashi, Yuumi; Morita, Mitsuhiro; Suzaki, Toshinobu
2015-07-23
Recovery of various signal transduction molecules in the detergent-resistant membrane microdomain (DRM) fraction suggests the importance of this region in cellular functions. Insolubility of the outer leaflet of DRM to the non-ionic detergent is ascribed to the tight association of cholesterol and sphingolipid. Since, poor localization of sphingolipid is observed in the inner leaflet, the physicochemical background of the insolubility of the inner leaflet is hence still an enigma. NAP-22 (also called BASP1 or CAP-23) is a neuron-enriched calmodulin-binding protein and one of the major proteins in the DRM of the neuronal cell membrane. A previous study showed the presence of several lipids in a NAP-22 fraction after the process of extraction and column chromatography. In this study, the effect of lipid extraction on NAP-22 was studied through native-gel electrophoresis, ultracentrifugation, and electron microscopic observation. The mobility of NAP-22 in native-PAGE was shifted from low to high after delipidation. Delipidated NAP-22 bound phosphatidylserine (PS), phosphatidylinosotol, and ganglioside. Some part of the mixture of PS and NAP-22 was recovered in the insoluble fraction after Triton X-100 treatment and the addition of cholesterol enhanced the amount of NAP-22 in the insoluble fraction. Copyright © 2015 Elsevier Ireland Ltd. All rights reserved.
End-of-fill study on collimator tight settings
Assmann, R; Burkart, F; Cauchi, M; Deboy, D; Redaelli, S; Rossi, A; Schmidt, R; Valentino, G; Wollmann, D
2012-01-01
In 2010 and 2011 the collimation system has been operated with relaxed settings, i.e. with retractions between different collimator families larger than the nominal settings that provide optimum cleaning. This configuration ensured a sufficient cleaning performance at 3.5 TeV while allowing larger tolerances on orbit control. Tighter collimator settings were proposed to push the cleaning performance and to allow larger orbit margins between TCDQ dump protection and tertiary collimators, which opens the possibility to push further the LHC β* reach. After having verified with beam that the cleaning is improved as expected, the feasibility of tighter collimator settings must be addressed with high stored intensity. For this purpose, an end-of-fill study was proposed after a standard physics fill with 1380 bunches nominal bunches at 3.5 TeV, for a total stored energy of 95 MJ. During this test, primary and secondary collimators were moved to that tight settings after about 8 hours of stable physics conditions in...
Pre-Darcy flow in tight and shale formations
Dejam, Morteza; Hassanzadeh, Hassan; Chen, Zhangxin
2017-11-01
There are evidences that the fluid flow in tight and shale formations does not follow Darcy law, which is identified as pre-Darcy flow. Here, the unsteady linear flow of a slightly compressible fluid under the action of pre-Darcy flow is modeled and a generalized Boltzmann transformation technique is used to solve the corresponding highly nonlinear diffusivity equation analytically. The effect of pre-Darcy flow on the pressure diffusion in a homogenous formation is studied in terms of the nonlinear exponent, m, and the threshold pressure gradient, G1. In addition, the pressure gradient, flux, and cumulative production per unit area for different m and G1 are compared with the classical solution of the diffusivity equation based on Darcy flow. Department of Petroleum Engineering in College of Engineering and Applied Science at University of Wyoming and NSERC/AI-EES(AERI)/Foundation CMG and AITF (iCORE) Chairs in Department of Chemical and Petroleum Engineering at University of Calgary.
Claudin-21 Has a Paracellular Channel Role at Tight Junctions
Tanaka, Hiroo
2016-01-05
Claudin protein family members, of which there are at least 27 in humans and mice, polymerize to form tight junctions (TJs) between epithelial cells, in a tissue- and developmental stage-specific manner. Claudins have a paracellular barrier function. In addition, certain claudins function as paracellular channels for small ions and/or solutes by forming selective pores at the TJs, although the specific claudins involved and their functional mechanisms are still in question. Here we show for the first time that claudin-21, which is more highly expressed in the embryonic than the postnatal stages, acts as a paracellular channel for small cations, such as Na+, similar to the typical channel-type claudins claudin-2 and -15. Claudin-21 also allows the paracellular passage of larger solutes. Our findings suggest that claudin-21-based TJs allow the passage of small and larger solutes by both paracellular channel-based and some additional mechanisms. © 2016, American Society for Microbiology. All Rights Reserved.
Third nearest neighbor parameterized tight binding model for graphene nano-ribbons
Directory of Open Access Journals (Sweden)
Van-Truong Tran
2017-07-01
Full Text Available The existing tight binding models can very well reproduce the ab initio band structure of a 2D graphene sheet. For graphene nano-ribbons (GNRs, the current sets of tight binding parameters can successfully describe the semi-conducting behavior of all armchair GNRs. However, they are still failing in reproducing accurately the slope of the bands that is directly associated with the group velocity and the effective mass of electrons. In this work, both density functional theory and tight binding calculations were performed and a new set of tight binding parameters up to the third nearest neighbors including overlap terms is introduced. The results obtained with this model offer excellent agreement with the predictions of the density functional theory in most cases of ribbon structures, even in the high-energy region. Moreover, this set can induce electron-hole asymmetry as manifested in results from density functional theory. Relevant outcomes are also achieved for armchair ribbons of various widths as well as for zigzag structures, thus opening a route for multi-scale atomistic simulation of large systems that cannot be considered using density functional theory.
Third nearest neighbor parameterized tight binding model for graphene nano-ribbons
Tran, Van-Truong; Saint-Martin, Jérôme; Dollfus, Philippe; Volz, Sebastian
2017-07-01
The existing tight binding models can very well reproduce the ab initio band structure of a 2D graphene sheet. For graphene nano-ribbons (GNRs), the current sets of tight binding parameters can successfully describe the semi-conducting behavior of all armchair GNRs. However, they are still failing in reproducing accurately the slope of the bands that is directly associated with the group velocity and the effective mass of electrons. In this work, both density functional theory and tight binding calculations were performed and a new set of tight binding parameters up to the third nearest neighbors including overlap terms is introduced. The results obtained with this model offer excellent agreement with the predictions of the density functional theory in most cases of ribbon structures, even in the high-energy region. Moreover, this set can induce electron-hole asymmetry as manifested in results from density functional theory. Relevant outcomes are also achieved for armchair ribbons of various widths as well as for zigzag structures, thus opening a route for multi-scale atomistic simulation of large systems that cannot be considered using density functional theory.
de Klerk, Etienne; Glineur, Francois; Taylor, Adrien
2016-01-01
We consider the gradient (or steepest) descent method with exact line search applied to a strongly convex function with Lipschitz continuous gradient. We establish the exact worst-case rate of convergence of this scheme, and show that this worst-case behavior is exhibited by a certain convex
de Klerk, Etienne; Glineur, Francois; Taylor, Adrien
2017-01-01
We consider the gradient (or steepest) descent method with exact line search applied to a strongly convex function with Lipschitz continuous gradient. We establish the exact worst-case rate of convergence of this scheme, and show that this worst-case behavior is exhibited by a certain convex
Tight Bounds for Distributed Functional Monitoring
DEFF Research Database (Denmark)
Woodruff, David P.; Zhang, Qin
2011-01-01
$, our bound resolves their main open question. Our lower bounds are based on new direct sum theorems for approximate majority, and yield significant improvements to problems in the data stream model, improving the bound for estimating $F_p, p > 2,$ in $t$ passes from $\\tilde{\\Omega}(n^{1-2/p}/(\\eps^{2/p......} t))$ to $\\tilde{\\Omega}(n^{1-2/p}/(\\eps^{4/p} t))$, giving the first bound for estimating $F_0$ in $t$ passes of $\\Omega(1/(\\eps^2 t))$ bits of space that does not use the gap-hamming problem, and showing a distribution for the gap-hamming problem with high external information cost or super-polynomial......We resolve several fundamental questions in the area of distributed functional monitoring, initiated by Cormode, Muthukrishnan, and Yi (SODA, 2008). In this model there are $k$ sites each tracking their input and communicating with a central coordinator that continuously maintain an approximate...
The media of sociology: tight or loose translations?
Guggenheim, Michael
2015-06-01
Sociologists have increasingly come to recognize that the discipline has unduly privileged textual representations, but efforts to incorporate visual and other media are still only in their beginning. This paper develops an analysis of the ways objects of knowledge are translated into other media, in order to understand the visual practices of sociology and to point out unused possibilities. I argue that the discourse on visual sociology, by assuming that photographs are less objective than text, is based on an asymmetric media-determinism and on a misleading notion of objectivity. Instead, I suggest to analyse media with the concept of translations. I introduce several kinds of translations, most centrally the distinction between tight and loose ones. I show that many sciences, such as biology, focus on tight translations, using a variety of media and manipulating both research objects and representations. Sociology, in contrast, uses both tight and loose translations, but uses the latter only for texts. For visuals, sociology restricts itself to what I call 'the documentary': focusing on mechanical recording technologies without manipulating either the object of research or the representation. I conclude by discussing three rare examples of what is largely excluded in sociology: visual loose translations, visual tight translations based on non-mechanical recording technologies, and visual tight translations based on mechanical recording technologies that include the manipulation of both object and representation. © London School of Economics and Political Science 2015.
Human zonulin, a potential modulator of intestinal tight junctions.
Wang, W; Uzzau, S; Goldblum, S E; Fasano, A
2000-12-01
Intercellular tight junctions are dynamic structures involved in vectorial transport of water and electrolytes across the intestinal epithelium. Zonula occludens toxin derived from Vibrio cholerae interacts with a specific intestinal epithelial surface receptor, with subsequent activation of a complex intracellular cascade of events that regulate tight junction permeability. We postulated that this toxin may mimic the effect of a functionally and immunologically related endogenous modulator of intestinal tight junctions. Affinity-purified anti-zonula occludens toxin antibodies and the Ussing chamber assay were used to screen for one or more mammalian zonula occludens toxin analogues in both fetal and adult human intestine. A novel protein, zonulin, was identified that induces tight junction disassembly in non-human primate intestinal epithelia mounted in Ussing chambers. Comparison of amino acids in the active zonula occludens toxin fragment and zonulin permitted the identification of the putative receptor binding domain within the N-terminal region of the two proteins. Zonulin likely plays a pivotal role in tight junction regulation during developmental, physiological, and pathological processes, including tissue morphogenesis, movement of fluid, macromolecules and leukocytes between the intestinal lumen and the interstitium, and inflammatory/autoimmune disorders.
Multiobjective optimization of classifiers by means of 3D convex-hull-based evolutionary algorithms
Zhao, J.; Basto, Fernandes V.; Jiao, L.; Yevseyeva, I.; Asep, Maulana A.; Li, R.; Bäck, T.H.W.; Tang, T.; Michael, Emmerich T. M.
2016-01-01
The receiver operating characteristic (ROC) and detection error tradeoff(DET) curves are frequently used in the machine learning community to analyze the performance of binary classifiers. Recently, the convex-hull-based multiobjective genetic programming algorithm was proposed and successfully
Directory of Open Access Journals (Sweden)
Atiq Ur Rehman
2016-01-01
Full Text Available We have discussed the generalization of Hermite-Hadamard inequality introduced by Lupaş for convex functions on coordinates defined in a rectangle from the plane. Also we define that mappings are related to it and their properties are discussed.
Efficiency measurement with a non-convex free disposal hull technology
DEFF Research Database (Denmark)
Fukuyama, Hirofumi; Hougaard, Jens Leth; Sekitani, Kazuyuki
2016-01-01
We investigate the basic monotonicity properties of least-distance (in)efficiency measures on the class of non-convex FDH (free disposable hull) technologies. We show that any known FDH least-distance measure violates strong monotonicity over the strongly (Pareto-Koopmans) efficient frontier...
From a Nonlinear, Nonconvex Variational Problem to a Linear, Convex Formulation
International Nuclear Information System (INIS)
Egozcue, J.; Meziat, R.; Pedregal, P.
2002-01-01
We propose a general approach to deal with nonlinear, nonconvex variational problems based on a reformulation of the problem resulting in an optimization problem with linear cost functional and convex constraints. As a first step we explicitly explore these ideas to some one-dimensional variational problems and obtain specific conclusions of an analytical and numerical nature
On the rank 1 convexity of stored energy functions of physically linear stress-strain relations
Czech Academy of Sciences Publication Activity Database
Šilhavý, Miroslav; Bertram, A.; Böhlke, T.
2007-01-01
Roč. 86, č. 3 (2007), s. 235-243 ISSN 0374-3535 Institutional research plan: CEZ:AV0Z10190503 Keywords : generalized linear elastic law s * generalized strain measures * rank 1 convexity Subject RIV: BA - General Mathematics Impact factor: 0.743, year: 2007
Gorissen, B.L.; Blanc, J.P.C.; den Hertog, D.; Ben-Tal, A.
We propose a new way to derive tractable robust counterparts of a linear program based on the duality between the robust (“pessimistic”) primal problem and its “optimistic” dual. First we obtain a new convex reformulation of the dual problem of a robust linear program, and then show how to construct
Eurodollar futures and options: convexity adjustment in HJM one- factor model
Henrard Marc
2005-01-01
In this note we give pricing formulas for different instruments linked to rate futures (euro-dollar futures). We provide the future price including the convexity adjustment and the exact dates. Based on that result we price options on futures, including the mid-curve options.
The Lp Lp Lp-curvature images of convex bodies and Lp Lp Lp ...
Indian Academy of Sciences (India)
Abstract. Associated with the Lp-curvature image defined by Lutwak, some inequali- ties for extended mixed p-affine surface areas of convex bodies and the support functions of Lp-projection bodies are established. As a natural extension of a result due to Lutwak, an Lp-type affine isoperimetric inequality, whose special ...
On the Monotonicity and Log-Convexity of a Four-Parameter Homogeneous Mean
Directory of Open Access Journals (Sweden)
Yang Zhen-Hang
2008-01-01
Full Text Available Abstract A four-parameter homogeneous mean is defined by another approach. The criterion of its monotonicity and logarithmically convexity is presented, and three refined chains of inequalities for two-parameter mean values are deduced which contain many new and classical inequalities for means.
ON INEQUALITIES OF HERMITE – HADAMARD TYPE INVOLVING AN s-CONVEX FUNCTION WITH APPLICATIONS
Directory of Open Access Journals (Sweden)
Liu Zheng
2016-03-01
Full Text Available Motivated by a recent paper, the author provides some new integral inequalities of Hermite–Hadamard type involving the product of an s-convex function and a symmetric function and applies these new established inequalities to construct inequalities for special means.
On the Hadamard’s type inequalities for co-ordinated convex functions via fractional integrals
Directory of Open Access Journals (Sweden)
Abdullah Akkurt
2017-07-01
Full Text Available In this paper, we establish two identities for functions of two variables and apply them to give new Hermite–Hadamard type fractional integral inequalities for double fractional integrals involving functions whose derivatives are bounded or co-ordinates convex function on Δ≔[a,b]×[c,d] in R2 with a
Balder, E.J.
1984-01-01
This note presents a new, quick approach to existence results without convexity conditions for optimal control problems with singular components in the sense of [11.], 438–485). Starting from the resolvent kernel representation of the solutions of a linear integral equation, a version of Fatou's
A Convex Variational Model for Restoring Blurred Images with Multiplicative Noise
DEFF Research Database (Denmark)
Dong, Yiqiu; Tieyong Zeng
2013-01-01
In this paper, a new variational model for restoring blurred images with multiplicative noise is proposed. Based on the statistical property of the noise, a quadratic penalty function technique is utilized in order to obtain a strictly convex model under a mild condition, which guarantees...
Convex Bodies With Minimal Volume Product in R^2 --- A New Proof
Lin, Youjiang
2010-01-01
In this paper, a new proof of the following result is given: The product of the volumes of an origin symmetric convex bodies $K$ in R^2 and of its polar body is minimal if and only if $K$ is a parallelogram.
Headache as a crucial symptom in the etiology of convexal subarachnoid hemorrhage.
Rico, María; Benavente, Lorena; Para, Marta; Santamarta, Elena; Pascual, Julio; Calleja, Sergio
2014-03-01
Convexal subarachnoid hemorrhage has been associated with different diseases, reversible cerebral vasoconstriction syndrome and cerebral amyloid angiopathy being the 2 main causes. To investigate whether headache at onset is determinant in identifying the underlying etiology for convexal subarachnoid hemorrhage. After searching in the database of our hospital, 24 patients were found with convexal subarachnoid hemorrhage in the last 10 years. The mean age of the sample was 69.5 years. We recorded data referring to demographics, symptoms and neuroimaging. Cerebral amyloid angiopathy patients accounted for 46% of the sample, 13% were diagnosed with reversible cerebral vasoconstriction syndrome, 16% with several other etiologies, and in 25%, the cause remained unknown. Mild headache was present only in 1 (9%) of the 11 cerebral amyloid angiopathy patients, while severe headache was the dominant feature in 86% of cases of the remaining etiologies. Headache is a key symptom allowing a presumptive etiological diagnosis of convexal subarachnoid hemorrhage. While the absence of headache suggests cerebral amyloid angiopathy as the more probable cause, severe headache obliges us to rule out other etiologies, such as reversible cerebral vasoconstriction syndrome. © 2013 American Headache Society.
New Criteria for Functions to Be in a Class of p-Valent Alpha Convex Functions
Arif, Muhammad; Aouf, Mohamed Kamal
2013-01-01
We obtain certain simple sufficiency criteria for a class of p-valent alpha convex functions. Many known results appear as special consequences of our work. Some applications of our work to the generalized integral operator are also given. PMID:24191138
Neuro-genetic hybrid approach for the solution of non-convex economic dispatch problem
International Nuclear Information System (INIS)
Malik, T.N.; Asar, A.U.
2009-01-01
ED (Economic Dispatch) is non-convex constrained optimization problem, and is used for both on line and offline studies in power system operation. Conventionally, it is solved as convex problem using optimization techniques by approximating generator input/output characteristic. Curves of monotonically increasing nature thus resulting in an inaccurate dispatch. The GA (Genetic Algorithm) has been used for the solution of this problem owing to its inherent ability to address the convex and non-convex problems equally. This approach brings the solution to the global minimum region of search space in a short time and then takes longer time to converge to near optimal results. GA based hybrid approaches are used to fine tune the near optimal results produced by GA. This paper proposes NGH (Neuro Genetic Hybrid) approach to solve the economic dispatch with valve point effect. The proposed approach combines the GA with the ANN (Artificial Neural Network) using SI (Swarm Intelligence) learning rule. The GA acts as a global optimizer and the neural network fine tunes the GA results to the desired targets. Three machines standard test system has been tested for validation of the approach. Comparing the results with GA and NGH model based on back-propagation learning, the proposed approach gives contrast improvements showing the promise of the approach. (author)
Directory of Open Access Journals (Sweden)
Chang Tong-Huei
2009-01-01
Full Text Available We use a concept of abstract convexity to define the almost - property, al- - family, and almost -spaces. We get some new approximate fixed point theorems and fixed point theorems in almost -spaces. Our results extend some results of other authors.
Convexity of Energy-Like Functions: Theoretical Results and Applications to Power System Operations
Energy Technology Data Exchange (ETDEWEB)
Dvijotham, Krishnamurthy [California Inst. of Technology (CalTech), Pasadena, CA (United States); Low, Steven [California Inst. of Technology (CalTech), Pasadena, CA (United States); Chertkov, Michael [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2015-01-12
Power systems are undergoing unprecedented transformations with increased adoption of renewables and distributed generation, as well as the adoption of demand response programs. All of these changes, while making the grid more responsive and potentially more efficient, pose significant challenges for power systems operators. Conventional operational paradigms are no longer sufficient as the power system may no longer have big dispatchable generators with sufficient positive and negative reserves. This increases the need for tools and algorithms that can efficiently predict safe regions of operation of the power system. In this paper, we study energy functions as a tool to design algorithms for various operational problems in power systems. These have a long history in power systems and have been primarily applied to transient stability problems. In this paper, we take a new look at power systems, focusing on an aspect that has previously received little attention: Convexity. We characterize the domain of voltage magnitudes and phases within which the energy function is convex in these variables. We show that this corresponds naturally with standard operational constraints imposed in power systems. We show that power of equations can be solved using this approach, as long as the solution lies within the convexity domain. We outline various desirable properties of solutions in the convexity domain and present simple numerical illustrations supporting our results.
DEFF Research Database (Denmark)
Kafle, Bishoksan; Gallagher, John Patrick
2014-01-01
We present an approach to constrained Horn clause (CHC) verification combining three techniques: abstract interpretation over a domain of convex polyhedra, specialisation of the constraints in CHCs using abstract interpretation of query-answer transformed clauses, and refinement by splitting pred...
Primal Recovery from Consensus-Based Dual Decomposition for Distributed Convex Optimization
Simonetto, A.; Jamali-Rad, H.
2015-01-01
Dual decomposition has been successfully employed in a variety of distributed convex optimization problems solved by a network of computing and communicating nodes. Often, when the cost function is separable but the constraints are coupled, the dual decomposition scheme involves local parallel
Directory of Open Access Journals (Sweden)
Xuewen Mu
2015-01-01
quadratic programming over second-order cones and a bounded set. At each iteration, we only need to compute the metric projection onto the second-order cones and the projection onto the bound set. The result of convergence is given. Numerical results demonstrate that our method is efficient for the convex quadratic second-order cone programming problems with bounded constraints.
Principled Design and Runtime Analysis of Abstract Convex Evolutionary Search.
Moraglio, Alberto; Sudholt, Dirk
2017-01-01
Geometric crossover is a formal class of crossovers that includes many well-known recombination operators across representations. In previous work, it was shown that all evolutionary algorithms with geometric crossover (but no mutation) do the same form of convex search regardless of the underlying representation, the specific selection mechanism, offspring distribution, search space, and problem at hand. Furthermore, it was suggested that the generalised convex search could perform well on generalised forms of concave and approximately concave fitness landscapes regardless of the underlying space and representation. In this article, we deepen this line of enquiry and study the runtime of generalised convex search on concave fitness landscapes. This is a first step toward linking a geometric theory of representations and runtime analysis in the attempt to (1) set the basis for a more general, unified approach for the runtime analysis of evolutionary algorithms across representations, and (2) identify the essential matching features of evolutionary search behaviour and landscape topography that cause polynomial performance. We present a general runtime result that can be systematically instantiated to specific search spaces and representations and present its specifications to three search spaces. As a corollary, we obtain that the convex search algorithm optimises LeadingOnes in [Formula: see text] fitness evaluations, which is faster than all unbiased unary black box algorithms.
On the convex hull of the simple integer recourse objective function
Klein Haneveld, Willem K.; Stougie, L.; van der Vlerk, Maarten H.
1995-01-01
We consider the objective function of a simple integer recourse problem with fixed technology matrix. Using properties of the expected value function, we prove a relation between the convex hull of this function and the expected value function of a continuous simple recourse program. We present an
Modeling IrisCode and its variants as convex polyhedral cones and its security implications.
Kong, Adams Wai-Kin
2013-03-01
IrisCode, developed by Daugman, in 1993, is the most influential iris recognition algorithm. A thorough understanding of IrisCode is essential, because over 100 million persons have been enrolled by this algorithm and many biometric personal identification and template protection methods have been developed based on IrisCode. This paper indicates that a template produced by IrisCode or its variants is a convex polyhedral cone in a hyperspace. Its central ray, being a rough representation of the original biometric signal, can be computed by a simple algorithm, which can often be implemented in one Matlab command line. The central ray is an expected ray and also an optimal ray of an objective function on a group of distributions. This algorithm is derived from geometric properties of a convex polyhedral cone but does not rely on any prior knowledge (e.g., iris images). The experimental results show that biometric templates, including iris and palmprint templates, produced by different recognition methods can be matched through the central rays in their convex polyhedral cones and that templates protected by a method extended from IrisCode can be broken into. These experimental results indicate that, without a thorough security analysis, convex polyhedral cone templates cannot be assumed secure. Additionally, the simplicity of the algorithm implies that even junior hackers without knowledge of advanced image processing and biometric databases can still break into protected templates and reveal relationships among templates produced by different recognition methods.
An Efficient Algorithm to Calculate the Minkowski Sum of Convex 3D Polyhedra
Bekker, Henk; Roerdink, Jos B.T.M.
2001-01-01
A new method is presented to calculate the Minkowski sum of two convex polyhedra A and B in 3D. These graphs are given edge attributes. From these attributed graphs the attributed graph of the Minkowski sum is constructed. This graph is then transformed into the Minkowski sum of A and B. The running
The Log-convexity of the poly-cauchy numbers | Komatsu ...
African Journals Online (AJOL)
In 2013, Komatsu introduced the poly-Cauchy numbers, which generalize. Cauchy numbers. Several generalizations of poly-Cauchy numbers have been con- sidered since then. One particular type of generalizations is that of multiparameter- poly-Cauchy numbers. In this paper, we study the log-convexity of the ...
Directory of Open Access Journals (Sweden)
Yili Kang
2015-01-01
Full Text Available Prevention of water blocking and optimization of multiscale flow channels will increase gas production of tight reservoirs. Physical properties of samples from representative tight gas reservoirs were measured before and after high temperature treatment. Results show that, with the increase of treatment temperature, mass decreases, acoustic transit time increases, and permeability and porosity increase. Permeability begins to increase dramatically if treatment temperature exceeds the threshold value of thermal fracturing, which is 600~700°C, 500~600°C, 300~500°C, and 300~400°C for shale, mudstone, tight sandstone, and tight carbonate rock, respectively. Comprehensive analyses indicate that the mechanisms of heat treatment on tight porous media include evaporation and dehydration of water, change of mineral structure, generation of microfracture, and network connectivity. Meanwhile, field implementation is reviewed and prospected. Interpretations indicate that, according to the characteristics of multiscale mass transfer in tight gas formation, combining heat treatment with conventional stimulation methods can achieve the best stimulation result.
A new corrective technique for adolescent idiopathic scoliosis (Ucar′s convex rod rotation
Directory of Open Access Journals (Sweden)
Bekir Yavuz Ucar
2014-01-01
Full Text Available Study Design: Prospective single-center study. Objective: To analyze the efficacy and safety of a new technique of global vertebral correction with convex rod rotation performed on the patients with adolescent idiopathic scoliosis. Summary of Background Data: Surgical goal is to obtain an optimal curve correction in scoliosis surgery. There are various correction techniques. This report describes a new technique of global vertebral correction with convex rod rotation. Materials and Methods: A total of 12 consecutive patients with Lenke type I adolescent idiopathic scoliosis and managed by convex rod rotation technique between years 2012 and 2013 having more than 1 year follow-up were included. Mean age was 14.5 (range = 13-17 years years at the time of operation. The hospital charts were reviewed for demographic data. Measurements of curve magnitude and balance were made on 36-inch standing anteroposterior and lateral radiographs taken before surgery and at most recent follow up to assess deformity correction, spinal balance, and complications related to the instrumentation. Results: Preoperative coronal plane major curve of 62° (range = 50°-72° with flexibility of less than 30% was corrected to 11.5°(range = 10°-14° showing a 81% scoliosis correction at the final follow-up. Coronal imbalance was improved 72% at the most recent follow-up assessment. No complications were found. Conclusion: The new technique of global vertebral correction with Ucar′s convex rod rotation is an effective technique. This method is a vertebral rotation procedure from convex side and it allows to put screws easily to the concave side.
First-order convex feasibility algorithms for x-ray CT.
Sidky, Emil Y; Jørgensen, Jakob S; Pan, Xiaochuan
2013-03-01
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. 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. 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. 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.
Conductance of Graphene Nanoribbon Junctions and the Tight Binding Model
Directory of Open Access Journals (Sweden)
Wu Y
2011-01-01
Full Text Available Abstract Planar carbon-based electronic devices, including metal/semiconductor junctions, transistors and interconnects, can now be formed from patterned sheets of graphene. Most simulations of charge transport within graphene-based electronic devices assume an energy band structure based on a nearest-neighbour tight binding analysis. In this paper, the energy band structure and conductance of graphene nanoribbons and metal/semiconductor junctions are obtained using a third nearest-neighbour tight binding analysis in conjunction with an efficient nonequilibrium Green's function formalism. We find significant differences in both the energy band structure and conductance obtained with the two approximations.
Ultra-Tightly Coupled GNSS/INS for small UAVs
DEFF Research Database (Denmark)
Olesen, Daniel; Jakobsen, Jakob; Knudsen, Per
2017-01-01
fitted onto a small UAV. The storage of IF samples together with measurements from an Inertial Measurement Unit ( IMU) has allowed the authors to process an Ultra-Tightly Coupled ( U.T.C.) GNSS/INS solution from real data collected with a small UAV. The focus of this paper has been to investigate......This paper describes an ultra-tight integration of a Global Navigation Satellite System ( GNSS) receiver and an Inertial Navigation System ( INS) for small Unmanned Aerial Vehicles ( UAVs). The system is based on a low-cost and low-weight GNSS Intermediate Frequency ( IF) sampler which has been...
How tight are beetle hugs? Attachment in mating leaf beetles
Voigt, Dagmar; Tsipenyuk, Alexey; Varenberg, Michael
2017-09-01
Similar to other leaf beetles, rosemary beetles Chrysolina americana exhibit a distinct sexual dimorphism in tarsal attachment setae. Setal discoid terminals occur only in males, and they have been previously associated with a long-term attachment to the female's back (elytra) during copulation and mate guarding. For the first time, we studied living males and females holding to female's elytra. Pull-off force measurements with a custom-made tribometer featuring a self-aligning sample holder confirmed stronger attachment to female elytra compared with glass in both males and females; corresponding to 45 and 30 times the body weight, respectively. In line with previous studies, males generated significantly higher forces than females on convex elytra and flat glass, 1.2 times and 6.8 times, respectively. Convex substrates like elytra seem to improve the attachment ability of rosemary beetles, because they can hold more strongly due to favourable shear angles of legs, tarsi and adhesive setae. A self-aligning sample holder is found to be suitable for running force measurement tests with living biological samples.
Naturally fractured tight gas reservoir detection optimization. Final report
Energy Technology Data Exchange (ETDEWEB)
NONE
1997-11-19
This DOE-funded research into seismic detection of natural fractures is one of six projects within the DOE`s Detection and Analysis of Naturally Fractured Gas Reservoirs Program, a multidisciplinary research initiative to develop technology for prediction, detection, and mapping of naturally fractured gas reservoirs. The demonstration of successful seismic techniques to locate subsurface zones of high fracture density and to guide drilling orientation for enhanced fracture permeability will enable better returns on investments in the development of the vast gas reserves held in tight formations beneath the Rocky Mountains. The seismic techniques used in this project were designed to capture the azimuthal anisotropy within the seismic response. This seismic anisotropy is the result of the symmetry in the rock fabric created by aligned fractures and/or unequal horizontal stresses. These results may be compared and related to other lines of evidence to provide cross-validation. The authors undertook investigations along the following lines: Characterization of the seismic anisotropy in three-dimensional, P-wave seismic data; Characterization of the seismic anisotropy in a nine-component (P- and S-sources, three-component receivers) vertical seismic profile; Characterization of the seismic anisotropy in three-dimensional, P-to-S converted wave seismic data (P-wave source, three-component receivers); and Description of geological and reservoir-engineering data that corroborate the anisotropy: natural fractures observed at the target level and at the surface, estimation of the maximum horizontal stress in situ, and examination of the flow characteristics of the reservoir.
Asymptomatic hypospadias with tight meatal stricture in the father of twelve children
Katib, Atif A.
2013-01-01
Hypospadias is a highly prevalent congenital anomaly. English articles, indexed in PubMed, published the long-term sexual and reproductive outcome following hypospadias repair. Almost all repairable cases of hypospadias are operated in childhood. Although distal hypospadias does not interfere with fertility, it is worthy reporting a case of an elderly man, who fathers 12 children and has no urologic complaint, presented with unrepaired coronal hypospadias and severely tight external urethral ...
Envelopes of Sets of Measures, Tightness, and Markov Control Processes
International Nuclear Information System (INIS)
Gonzalez-Hernandez, J.; Hernandez-Lerma, O.
1999-01-01
We introduce upper and lower envelopes for sets of measures on an arbitrary topological space, which are then used to give a tightness criterion. These concepts are applied to show the existence of optimal policies for a class of Markov control processes
18 CFR 270.304 - Tight formation gas.
2010-04-01
... 18 Conservation of Power and Water Resources 1 2010-04-01 2010-04-01 false Tight formation gas. 270.304 Section 270.304 Conservation of Power and Water Resources FEDERAL ENERGY REGULATORY COMMISSION... before January 1, 1980; and (2) The applicant has no knowledge of any information not described in the...
Loosen up? Cultural tightness and national entrepreneurial activity
Harms, Rainer; Groen, Arend J.
The level of entrepreneurship between countries differs consistently. A source of this variance lies in national culture differences. Recently, the cultural dimension “tightness” has been introduced in the literature. Tightness refers to the degree to which a nation has strong norms and a low
Dielectric constant of graphene-on-polarized substrate: A tight ...
Indian Academy of Sciences (India)
Sivabrata Sahu
Corresponding author. E-mail: gcr@iopb.res.in. Published online 24 June 2017. Abstract. We report here a microscopic tight-binding theoretical study of the dynamic dielectric response of graphene-on-polarizable substrate with impurity. The Hamiltonian consists of first, second and third nearest- neighbour electron hopping ...
Dielectric constant of graphene-on-polarized substrate: A tight ...
Indian Academy of Sciences (India)
2017-06-24
Jun 24, 2017 ... We report here a microscopic tight-binding theoretical study of the dynamic dielectric response of graphene-on-polarizable substrate with impurity. The Hamiltonian consists of first, second and third nearest neighbour electron hopping interactions besides doping and substrate-induced effects on graphene.
Management of Small Urethrocutaneous Fistula by Tight Ligation ...
African Journals Online (AJOL)
After identifying the fistulous opening, the fistula tract was circumferentially and meticulously dissected ,then the dissected tract was lifted up and the base was ligated tightly with 5/0 vicryl, the external epithelium of the dissected tract was fulgurated with the diathermy, then a second layer of local soft tissue was secured over ...
Si Tight-Binding Parameters from Genetic Algorithm Fitting
Klimeck, G.; Bowen, R.; Boykin, T.; Salazar-Lazaro, C.; Cwik, T.; Stoica, A.
1999-01-01
Quantum mechanical simulations of carrier transport in Si require an accurate model of the complicated Si bandstructure. Tight-binding models are an attractive method of choice since they bear the full electronic structure symmetry in them and they can discretize a realistic device on an atomic scale.
Sit-Tight Syndrome and Tenure Elongation in African Politics ...
African Journals Online (AJOL)
The post-independence politics of African countries has been dominated by the phenomenon of sit-tight African heads of state and government who had acceeded to office by election or coup d'etat. This paper examines this recurring problem in post-independence African politics by examining its general and specific ...
Imaging pore space in tight gas sandstone reservoir: insights from broad ion beam cross-sectioning
Directory of Open Access Journals (Sweden)
Konstanty J.
2010-06-01
Full Text Available Monetization of tight gas reservoirs, which contain significant gas reserves world-wide, represents a challenge for the entire oil and gas industry. The development of new technologies to enhance tight gas reservoir productivity is strongly dependent on an improved understanding of the rock properties and especially the pore framework. Numerous methods are now available to characterize sandstone cores. However, the pore space characterization at pore scale remains difficult due to the fine pore size and delicate sample preparation, and has thus been mostly indirectly inferred until now. Here we propose a new method of ultra high-resolution petrography combining high resolution SEM and argon ion beam cross sectioning (BIB, Broad Ion Beam which prepares smooth and damage free surfaces. We demonstrate this method using the example of Permian (Rotliegend age tight gas sandstone core samples. The combination of Ar-beam cross-sectioning facility and high-resolution SEM imaging has the potential to result in a step change in the understanding of pore geometries, in terms of its morphology, spatial distribution and evolution based on the generation of unprecedented image quality and resolution enhancing the predictive reliability of image analysis.
Unconventional Tight Reservoirs Characterization with Nuclear Magnetic Resonance
Santiago, C. J. S.; Solatpour, R.; Kantzas, A.
2017-12-01
The increase in tight reservoir exploitation projects causes producing many papers each year on new, modern, and modified methods and techniques on estimating characteristics of these reservoirs. The most ambiguous of all basic reservoir property estimations deals with permeability. One of the logging methods that is advertised to predict permeability but is always met by skepticism is Nuclear Magnetic Resonance (NMR). The ability of NMR to differentiate between bound and movable fluids and providing porosity increased the capability of NMR as a permeability prediction technique. This leads to a multitude of publications and the motivation of a review paper on this subject by Babadagli et al. (2002). The first part of this presentation is dedicated to an extensive review of the existing correlation models for NMR based estimates of tight reservoir permeability to update this topic. On the second part, the collected literature information is used to analyze new experimental data. The data are collected from tight reservoirs from Canada, the Middle East, and China. A case study is created to apply NMR measurement in the prediction of reservoir characterization parameters such as porosity, permeability, cut-offs, irreducible saturations etc. Moreover, permeability correlations are utilized to predict permeability. NMR experiments were conducted on water saturated cores. NMR T2 relaxation times were measured. NMR porosity, the geometric mean relaxation time (T2gm), Irreducible Bulk Volume (BVI), and Movable Bulk Volume (BVM) were calculated. The correlation coefficients were computed based on multiple regression analysis. Results are cross plots of NMR permeability versus the independently measured Klinkenberg corrected permeability. More complicated equations are discussed. Error analysis of models is presented and compared. This presentation is beneficial in understanding existing tight reservoir permeability models. The results can be used as a guide for choosing
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.
Hybrid spherical cap plasmonic waveguide for tight mode confinement and long propagation length
Li, Kai; Yun, Maojin; Ge, Xiaohui; Kong, Weijin
2015-08-01
The special abilities of plasmonic waveguide including tight field confinement and beyond diffraction limit within nano-scale structure have been exploited in many different fields. In order to overcome the trade-off between tight mode confinement and long propagation length, many kinds of nano-scale structures have been proposed in recent years. In this paper, a novel hybrid plasmonic waveguide consisting of the layer of metal Ag, a spherical cap with low-index dielectric layer placed above the metal Ag and a high-index dielectric layer placed above the spherical cap is proposed and analyzed theoretically. The relations between the characteristics of the bound modes, such as mode confinement, propagation lengths, and parameters of the spherical cap, the curvature and width, are numerically investigated in detail. The simulation results show that the nano-scale confinement can be realized. The simulation result shows that the performance of the proposed spherical cap hybrid plasmonic waveguide is better than the rectangle or cylindrical hybrid plasmonic waveguide. Such hybrid plasmonic waveguide has a tight mode confinement and long propagation length. This novel structure provides a promising application for high-integration density photonic components.
Two-Layer Tight Frame Sparsifying Model for Compressed Sensing Magnetic Resonance Imaging
Directory of Open Access Journals (Sweden)
Shanshan Wang
2016-01-01
Full Text Available Compressed sensing magnetic resonance imaging (CSMRI employs image sparsity to reconstruct MR images from incoherently undersampled K-space data. Existing CSMRI approaches have exploited analysis transform, synthesis dictionary, and their variants to trigger image sparsity. Nevertheless, the accuracy, efficiency, or acceleration rate of existing CSMRI methods can still be improved due to either lack of adaptability, high complexity of the training, or insufficient sparsity promotion. To properly balance the three factors, this paper proposes a two-layer tight frame sparsifying (TRIMS model for CSMRI by sparsifying the image with a product of a fixed tight frame and an adaptively learned tight frame. The two-layer sparsifying and adaptive learning nature of TRIMS has enabled accurate MR reconstruction from highly undersampled data with efficiency. To solve the reconstruction problem, a three-level Bregman numerical algorithm is developed. The proposed approach has been compared to three state-of-the-art methods over scanned physical phantom and in vivo MR datasets and encouraging performances have been achieved.
Realo, Anu; Linnamägi, Karmen; Gelfand, Michele J
2015-06-01
The importance of tightness-looseness as a dimension that explains a considerable amount of variance between cultures was demonstrated by Gelfand et al. (2011). Tight nations have many strong norms and a low tolerance of deviant behaviour, whereas loose nations have weak social norms and a high tolerance of deviant behaviour. The main aim of the current studies was to examine situational constraint in Estonia and Greece: that is, how the cultural dimension of tightness-looseness is manifested in everyday situations in those two countries. The findings of a questionnaire study (Study 1) suggested that, in general, there is higher constraint across everyday situations in Greece than in Estonia, but situational constraint in Greece is especially strong in school and organisational settings where people have hierarchically structured roles. The results of an observational study (Study 2) revealed a relatively high agreement between appropriateness of certain behaviours as judged by the respondents in Study 1 and the frequencies of observed behaviours in the two countries. Our findings suggest that the strength of situations may substantially vary both within and across cultures, and that the attitudes of the members about situational strength in their respective cultures are in concordance with observations of situations by neutral observers in how people in general behave in their culture. © 2014 International Union of Psychological Science.
Calibration of Field II using a Convex Ultrasound Transducer
DEFF Research Database (Denmark)
Bæk, David; Jensen, Jørgen Arendt; Willatzen, Morten
2010-01-01
of the transducer. For such simulations to reflect actual measured intensities and pressure levels, the transducer impulse response is to be known. This work presents the results of combining a modified form of a 1D linear transducer model originally suggested by Willatzen with the Field II program to calibrate...... BK-Medical (Herlev, Denmark). As input waveform for the Field model we measured the output voltage of the research amplifier, which peak voltage was limited to 31 V to avoid too high non linear effects. We measured the hydrophone output from three transducer front elements by averaging 40 shoot...
Tensor completion and low-n-rank tensor recovery via convex optimization
International Nuclear Information System (INIS)
Gandy, Silvia; Yamada, Isao; Recht, Benjamin
2011-01-01
In this paper we consider sparsity on a tensor level, as given by the n-rank of a tensor. In an important sparse-vector approximation problem (compressed sensing) and the low-rank matrix recovery problem, using a convex relaxation technique proved to be a valuable solution strategy. Here, we will adapt these techniques to the tensor setting. We use the n-rank of a tensor as a sparsity measure and consider the low-n-rank tensor recovery problem, i.e. the problem of finding the tensor of the lowest n-rank that fulfills some linear constraints. We introduce a tractable convex relaxation of the n-rank and propose efficient algorithms to solve the low-n-rank tensor recovery problem numerically. The algorithms are based on the Douglas–Rachford splitting technique and its dual variant, the alternating direction method of multipliers
Parthood and Convexity as the Basic Notions of a Theory of Space
DEFF Research Database (Denmark)
Robering, Klaus
, a ``pregeometry'' is described in which only the notion of convexity but no further axiom is added to that background framework. Pregeometry is extended to the full system in three steps. First the notion of a line segment is explained as the convex hull of the mereological sum of two points. In a second step two...... axioms are added which describe what it means for a thus determined line segment to be ``straight''. In the final step we deal with the order of points on a line segment and define the notion of a line. The presentation of the geometric system is concluded with a brief consideration of the geometrical...... principles known by the names of Peano and Pasch. Two additional topics are treated in short sections at the end of the article: (1) the introduction of coordinates and (2) the idea of a ``geometrical algebra''....
Analyse statique de contrôleurs à base d'optimisation convexe
Garoche, Pierre-Loïc
2016-01-01
This manuscript presents a set of works targeting the formal analysis of controller software implementation using the tools of convex optimization.; Les travaux présentés portent, d’une façon générale, sur la preuve automatique de propriétés de systèmes de contrôle-commande à l’aide d’optimisation convexe. Par exemple, pour montrer qu’un système ne va jamais se mettre dans un état indésirable, on va démontrer qu’une certaine propriété, dite invariant inductif, excluant les états indésirables,...
Ramesh, Nisha; Tasdizen, Tolga
2014-10-01
Bayesian frameworks are commonly used in tracking algorithms. An important example is the particle filter, where a stochastic motion model describes the evolution of the state, and the observation model relates the noisy measurements to the state. Particle filters have been used to track the lineage of cells. Propagating the shape model of the cell through the particle filter is beneficial for tracking. We approximate arbitrary shapes of cells with a novel implicit convex function. The importance sampling step of the particle filter is defined using the cost associated with fitting our implicit convex shape model to the observations. Our technique is capable of tracking the lineage of cells for nonmitotic stages. We validate our algorithm by tracking the lineage of retinal and lens cells in zebrafish embryos.
A Total Variation Model Based on the Strictly Convex Modification for Image Denoising
Directory of Open Access Journals (Sweden)
Boying Wu
2014-01-01
Full Text Available We propose a strictly convex functional in which the regular term consists of the total variation term and an adaptive logarithm based convex modification term. We prove the existence and uniqueness of the minimizer for the proposed variational problem. The existence, uniqueness, and long-time behavior of the solution of the associated evolution system is also established. Finally, we present experimental results to illustrate the effectiveness of the model in noise reduction, and a comparison is made in relation to the more classical methods of the traditional total variation (TV, the Perona-Malik (PM, and the more recent D-α-PM method. Additional distinction from the other methods is that the parameters, for manual manipulation, in the proposed algorithm are reduced to basically only one.
Seamless lamination of a concave-convex architecture with single-layer graphene
Park, Ji-Hoon; Lim, Taekyung; Baik, Jaeyoon; Seo, Keumyoung; Moon, Youngkwon; Park, Noejung; Shin, Hyun-Joon; Kyu Kwak, Sang; Ju, Sanghyun; Real Ahn, Joung
2015-10-01
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.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
Convex relaxation of Optimal Power Flow in Distribution Feeders with embedded solar power
DEFF Research Database (Denmark)
Hermann, Alexander Niels August; Wu, Qiuwei; Huang, Shaojun
2016-01-01
There is an increasing interest in using Distributed Energy Resources (DER) directly coupled to end user distribution feeders. This poses an array of challenges because most of today’s distribution feeders are designed for unidirectional power flow. Therefore when installing DERs such as solar...... panels with uncontrolled inverters, the upper limit of installable capacity is quickly reached in many of today’s distribution feeders. This problem can often be mitigated by optimally controlling the voltage angles of inverters. However, the optimal power flow problem in its standard form is a large...... scale non-convex optimization problem, and thus can’t be solved precisely and also is computationally heavy and intractable for large systems. This paper examines the use of a convex relaxation using Semi-definite programming to optimally control solar power inverters in a distribution grid in order...
Directory of Open Access Journals (Sweden)
Upadhyay Balendu B.
2017-01-01
Full Text Available In this paper, we define some new generalizations of strongly convex functions of order m for locally Lipschitz functions using Clarke subdifferential. Suitable examples illustrating the non emptiness of the newly defined classes of functions and their relationships with classical notions of pseudoconvexity and quasiconvexity are provided. These generalizations are then employed to establish sufficient optimality conditions for a nonsmooth multiobjective optimization problem involving support functions of compact convex sets. Furthermore, we formulate a mixed type dual model for the primal problem and establish weak and strong duality theorems using the notion of strict efficiency of order m. The results presented in this paper extend and unify several known results from the literature to a more general class of functions as well as optimization problems.
A Genealogy of Convex Solids Via Local and Global Bifurcations of Gradient Vector Fields
Domokos, Gábor; Holmes, Philip; Lángi, Zsolt
2016-12-01
Three-dimensional convex bodies can be classified in terms of the number and stability types of critical points on which they can balance at rest on a horizontal plane. For typical bodies, these are non-degenerate maxima, minima, and saddle points, the numbers of which provide a primary classification. Secondary and tertiary classifications use graphs to describe orbits connecting these critical points in the gradient vector field associated with each body. In previous work, it was shown that these classifications are complete in that no class is empty. Here, we construct 1- and 2-parameter families of convex bodies connecting members of adjacent primary and secondary classes and show that transitions between them can be realized by codimension 1 saddle-node and saddle-saddle (heteroclinic) bifurcations in the gradient vector fields. Our results indicate that all combinatorially possible transitions can be realized in physical shape evolution processes, e.g., by abrasion of sedimentary particles.
Directory of Open Access Journals (Sweden)
Kechen Song
2013-01-01
Full Text Available Accurate detection of surface defect is an indispensable section in steel surface inspection system. In order to detect the micro surface defect of silicon steel strip, a new detection method based on saliency convex active contour model is proposed. In the proposed method, visual saliency extraction is employed to suppress the clutter background for the purpose of highlighting the potential objects. The extracted saliency map is then exploited as a feature, which is fused into a convex energy minimization function of local-based active contour. Meanwhile, a numerical minimization algorithm is introduced to separate the micro surface defects from cluttered background. Experimental results demonstrate that the proposed method presents good performance for detecting micro surface defects including spot-defect and steel-pit-defect. Even in the cluttered background, the proposed method detects almost all of the microdefects without any false objects.
The steady-state of the (Normalized) LMS is schur convex
Al-Hujaili, Khaled A.
2016-06-24
In this work, we demonstrate how the theory of majorization and schur-convexity can be used to assess the impact of input-spread on the Mean Squares Error (MSE) performance of adaptive filters. First, we show that the concept of majorization can be utilized to measure the spread in input-regressors and subsequently order the input-regressors according to their spread. Second, we prove that the MSE of the Least Mean Squares Error (LMS) and Normalized LMS (NLMS) algorithms are schur-convex, that is, the MSE of the LMS and the NLMS algorithms preserve the majorization order of the inputs which provide an analytical justification to why and how much the MSE performance of the LMS and the NLMS algorithms deteriorate as the spread in input increases. © 2016 IEEE.
Equilibrium prices supported by dual price functions in markets with non-convexities
International Nuclear Information System (INIS)
Bjoerndal, Mette; Joernsten, Kurt
2004-06-01
The issue of finding market clearing prices in markets with non-convexities has had a renewed interest due to the deregulation of the electricity sector. In the day-ahead electricity market, equilibrium prices are calculated based on bids from generators and consumers. In most of the existing markets, several generation technologies are present, some of which have considerable non-convexities, such as capacity limitations and large start up costs. In this paper we present equilibrium prices composed of a commodity price and an uplift charge. The prices are based on the generation of a separating valid inequality that supports the optimal resource allocation. In the case when the sub-problem generated as the integer variables are held fixed to their optimal values possess the integrality property, the generated prices are also supported by non-linear price-functions that are the basis for integer programming duality. (Author)
Nanometric locking of the tight focus for optical microscopy and tip-enhanced microscopy
International Nuclear Information System (INIS)
Hayazawa, N; Furusawa, K; Kawata, S
2012-01-01
We have successfully stabilized the tight focus onto the sample surface of an optical microscope within ±1.0 nm for a virtually unlimited time duration. The time-dependent thermal drift of the tight focus and the mechanical tilt of the sample surface were simultaneously sensed by a non-optical means based on a capacitive sensor and were compensated for in real-time. This non-optical scheme is promising for the suppression of background light sources for optical microscopy. The focus stabilization is crucial for microscopic measurement at an interface, particularly when scanning a large surface area, because there is always a certain amount of mechanical tilt of the sample substrate, which degrades the contrast of the image. When imaging nanoscopic materials such as carbon nanotubes or silicon nanowires, more stringent nanometric stabilization of the focus position relative to such samples is required, otherwise it is often difficult to interpret the results from the observations. Moreover, the smaller the sample volume is, the smaller the signal becomes, resulting in a long exposure time at each position. In this sense, long-term stability of the tight focus is essential for both microscopic large area scanning and nanosized sample scanning (high-resolution/large-area imaging). In addition, the recently developed tip-enhanced microscopy requires long-term stability of the relative position of the tip, sample and focus position. We were able to successfully demonstrate a stability improvement for tip-enhanced microscopy in the same manner. The stabilization of the tight focus enables us to perform long-term and robust measurements without any degradation of optical signal, resulting in the capability of true nanometric optical imaging with good reproducibility and high precision. The technique presented is a simple add-on for any kind of optical microscope. (paper)
Geometry intuitive, discrete, and convex : a tribute to László Fejes Tóth
Böröczky, Károly; Tóth, Gábor; Pach, János
2013-01-01
The present volume is a collection of a dozen survey articles, dedicated to the memory of the famous Hungarian geometer, László Fejes Tóth, on the 99th anniversary of his birth. Each article reviews recent progress in an important field in intuitive, discrete, and convex geometry. The mathematical work and perspectives of all editors and most contributors of this volume were deeply influenced by László Fejes Tóth.
A Sequential Convex Semidefinite Programming Algorithm for Multiple-Load Free Material Optimization
Czech Academy of Sciences Publication Activity Database
Stingl, M.; Kočvara, Michal; Leugering, G.
2009-01-01
Roč. 20, č. 1 (2009), s. 130-155 ISSN 1052-6234 R&D Projects: GA AV ČR IAA1075402 Grant - others:commision EU(XE) EU-FP6-30717 Institutional research plan: CEZ:AV0Z10750506 Keywords : structural optimization * material optimization * semidefinite programming * sequential convex programming Subject RIV: BA - General Mathematics Impact factor: 1.429, year: 2009
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.
Irreducible convex paving for decomposition of multi-dimensional martingale transport plans
De March, Hadrien; Touzi, Nizar
2017-01-01
Martingale transport plans on the line are known from Beiglbock & Juillet to have an irreducible decomposition on a (at most) countable union of intervals. We provide an extension of this decomposition for martingale transport plans in R^d, d larger than one. Our decomposition is a partition of R^d consisting of a possibly uncountable family of relatively open convex components, with the required measurability so that the disintegration is well-defined. We justify the relevance of our decompo...
Estimates of Covering Numbers of Convex Sets with Slowly Decaying Orthogonal Subsets
Czech Academy of Sciences Publication Activity Database
Kůrková, Věra; Sanguineti, M.
2007-01-01
Roč. 155, č. 15 (2007), s. 1930-1942 ISSN 0166-218X R&D Projects: GA MŠk(CZ) 1M0567 Institutional research plan: CEZ:AV0Z10300504 Keywords : symmetric convex hulls * lower bounds on covering numbers * power-type covering numbers * generalized Hadamard matrices * Minkowski functional Subject RIV: IN - Informatics, Computer Science Impact factor: 0.625, year: 2007
Image restoration by the method of convex projections: part 2 applications and numerical results.
Sezan, M I; Stark, H
1982-01-01
The image restoration theory discussed in a previous paper by Youla and Webb [1] is applied to a simulated image and the results compared with the well-known method known as the Gerchberg-Papoulis algorithm. The results show that the method of image restoration by projection onto convex sets, by providing a convenient technique for utilizing a priori information, performs significantly better than the Gerchberg-Papoulis method.
Neural Network in Fixed Time for Collision Detection between Two Convex Polyhedra
M. Khouil; N. Saber; M. Mestari
2014-01-01
In this paper, a different architecture of a collision detection neural network (DCNN) is developed. This network, which has been particularly reviewed, has enabled us to solve with a new approach the problem of collision detection between two convex polyhedra in a fixed time (O (1) time). We used two types of neurons, linear and threshold logic, which simplified the actual implementation of all the networks proposed. The study of the collision detection is divided into two sections, the coll...
A Perfect Price Discrimination Market Model with Production, and a (Rational) Convex Program for It
Goel, Gagan; Vazirani, Vijay
Recent results showed PPAD-completeness of the problem of computing an equilibrium for Fisher's market model under additively separable, piecewise-linear, concave utilities. We show that introducing perfect price discrimination in this model renders its equilibrium polynomial time computable. Moreover, its set of equilibria are captured by a convex program that generalizes the classical Eisenberg-Gale program, and always admits a rational solution.
A stronger version of matrix convexity as applied to functions of Hermitian matrices
Directory of Open Access Journals (Sweden)
Kagan Abram
1999-01-01
Full Text Available A stronger version of matrix convexity, called hyperconvexity is introduced. It is shown that the function is hyperconvex on the set of Hermitian matrices and is hyperconvex on the set of positive definite Hermitian matrices. The new concept makes it possible to consider weighted averages of matrices of different orders. Proofs use properties of the Fisher information matrix, a fundamental concept of mathematical statistics.
Contact point generation for convex polytopes in interactive rigid body dynamics
DEFF Research Database (Denmark)
Silcowitz-Hansen, Morten; Abel, Sarah Maria Niebe; Erleben, Kenny
When computing contact forces in rigid body dynamics systems, most state-of-the-art solutions use iterative methods such as the projected Gauss–Seidel (PGS) method. Methods such as the PGS method are preferred for their robustness. However, the time-critical nature of interactive applications...... for convex polytopes. A novel contact point generation method is presented, which is based on growth distances and Gauss maps. We demonstrate improvements when using our method in the context of interactive rigid body simulation...
Convex Hypersurfaces and $L^p$ Estimates for Schr\\"odinger Equations
Zheng, Quan; Yao, Xiaohua; Fan, Da
2004-01-01
This paper is concerned with Schr\\"odinger equations whose principal operators are homogeneous elliptic. When the corresponding level hypersurface is convex, we show the $L^p$-$L^q$ estimate of solution operator in free case. This estimate, combining with the results of fractionally integrated groups, allows us to further obtain the $L^p$ estimate of solutions for the initial data belonging to a dense subset of $L^p$ in the case of integrable potentials.
Directory of Open Access Journals (Sweden)
Xiaofei Cao
2016-11-01
Full Text Available In this article, we consider the multiplicity of positive solutions for a class of Kirchhoff type problems with concave and convex nonlinearities. Under appropriate assumptions, we prove that the problem has at least two positive solutions, moreover, one of which is a positive ground state solution. Our approach is mainly based on the Nehari manifold, Ekeland variational principle and the theory of Lagrange multipliers.
Coarse-convex-compactification approach to numerical solution of nonconvex variational problems
Czech Academy of Sciences Publication Activity Database
Meziat, R.; Roubíček, Tomáš; Patino, D.
2010-01-01
Roč. 31, č. 4 (2010), s. 460-488 ISSN 0163-0563 Grant - others:GA MŠk(CZ) LC06052 Program:LC Institutional research plan: CEZ:AV0Z20760514 Keywords : convex approximations * method of moments * relaxed variational problems Subject RIV: BA - General Mathematics Impact factor: 0.687, year: 2010 http://www.informaworld.com/smpp/content~db=all~content=a922886514~frm=titlelink
On evolving deformation microstructures in non-convex partially damaged solids
Gurses, Ercan
2011-06-01
The paper outlines a relaxation method based on a particular isotropic microstructure evolution and applies it to the model problem of rate independent, partially damaged solids. The method uses an incremental variational formulation for standard dissipative materials. In an incremental setting at finite time steps, the formulation defines a quasi-hyperelastic stress potential. The existence of this potential allows a typical incremental boundary value problem of damage mechanics to be expressed in terms of a principle of minimum incremental work. Mathematical existence theorems of minimizers then induce a definition of the material stability in terms of the sequential weak lower semicontinuity of the incremental functional. As a consequence, the incremental material stability of standard dissipative solids may be defined in terms of weak convexity notions of the stress potential. Furthermore, the variational setting opens up the possibility to analyze the development of deformation microstructures in the post-critical range of unstable inelastic materials based on energy relaxation methods. In partially damaged solids, accumulated damage may yield non-convex stress potentials which indicate instability and formation of fine-scale microstructures. These microstructures can be resolved by use of relaxation techniques associated with the construction of convex hulls. We propose a particular relaxation method for partially damaged solids and investigate it in one- and multi-dimensional settings. To this end, we introduce a new isotropic microstructure which provides a simple approximation of the multi-dimensional rank-one convex hull. The development of those isotropic microstructures is investigated for homogeneous and inhomogeneous numerical simulations. © 2011 Elsevier Ltd. All rights reserved.
Pattern Discovery in Brain Imaging Genetics via SCCA Modeling with a Generic Non-convex Penalty
Du, Lei; Liu, Kefei; Yao, Xiaohui; Yan, Jingwen; Risacher, Shannon L.; Han, Junwei; Guo, Lei; Saykin, Andrew J.; Shen, Li; Weiner, Michael W.; Aisen, Paul; Petersen, Ronald; Jack, Clifford R.; Jagust, William; Trojanowki, John Q.
2017-01-01
Brain imaging genetics intends to uncover associations between genetic markers and neuroimaging quantitative traits. Sparse canonical correlation analysis (SCCA) can discover bi-multivariate associations and select relevant features, and is becoming popular in imaging genetic studies. The L1-norm function is not only convex, but also singular at the origin, which is a necessary condition for sparsity. Thus most SCCA methods impose \\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage...
Keshavarzi, Alireza; Noori, Lila Khaje
2010-12-01
River bed scourings are a major environmental problem for fish and aquatic habitat resources. In this study, to prevent river bed and banks from scouring, different types of bed sills including convex, concave and linear patterns were installed in a movable channel bed in a laboratory flume. The bed sills were tested with nine different arrangements and under different flow conditions. To find the most effective bed sill pattern, the scouring depth was measured downstream of the bed sill for a long experimental duration. The scour depth was measured at the middle and at the end of each experimental test for different ratios of the arch radius to the channel width [r/w]. The experimental results indicated that the convex pattern with r/w=0.35 produced minimum bed scouring depth at the center line whereas the concave pattern with r/w=0.23 produced the minimum scour depth at the wall banks. Therefore, the convex pattern was the most effective configuration for prevention of scouring at the center line of the river while the concave pattern was very effective to prevent scouring at the river banks. These findings can be suggested to be used in practical applications.
A two-layer recurrent neural network for nonsmooth convex optimization problems.
Qin, Sitian; Xue, Xiaoping
2015-06-01
In this paper, a two-layer recurrent neural network is proposed to solve the nonsmooth convex optimization problem subject to convex inequality and linear equality constraints. Compared with existing neural network models, the proposed neural network has a low model complexity and avoids penalty parameters. It is proved that from any initial point, the state of the proposed neural network reaches the equality feasible region in finite time and stays there thereafter. Moreover, the state is unique if the initial point lies in the equality feasible region. The equilibrium point set of the proposed neural network is proved to be equivalent to the Karush-Kuhn-Tucker optimality set of the original optimization problem. It is further proved that the equilibrium point of the proposed neural network is stable in the sense of Lyapunov. Moreover, from any initial point, the state is proved to be convergent to an equilibrium point of the proposed neural network. Finally, as applications, the proposed neural network is used to solve nonlinear convex programming with linear constraints and L1 -norm minimization problems.
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.
Towards reproducible experimental studies for non-convex polyhedral shaped particles
Wilke, Daniel N.; Pizette, Patrick; Govender, Nicolin; Abriak, Nor-Edine
2017-06-01
The packing density and flat bottomed hopper discharge of non-convex polyhedral particles are investigated in a systematic experimental study. The motivation for this study is two-fold. Firstly, to establish an approach to deliver quality experimental particle packing data for non-convex polyhedral particles that can be used for characterization and validation purposes of discrete element codes. Secondly, to make the reproducibility of experimental setups as convenient and readily available as possible using affordable and accessible technology. The primary technology for this study is fused deposition modeling used to 3D print polylactic acid (PLA) particles using readily available 3D printer technology. A total of 8000 biodegradable particles were printed, 1000 white particles and 1000 black particles for each of the four particle types considered in this study. Reproducibility is one benefit of using fused deposition modeling to print particles, but an extremely important additional benefit is that specific particle properties can be explicitly controlled. As an example in this study the volume fraction of each particle can be controlled i.e. the effective particle density can be adjusted. In this study the particle volumes reduces drastically as the non-convexity is increased, however all printed white particles in this study have the same mass within 2% of each other.
Directory of Open Access Journals (Sweden)
Kazuyuki Aihara
2011-04-01
Full Text Available The classical information-theoretic measures such as the entropy and the mutual information (MI are widely applicable to many areas in science and engineering. Csiszar generalized the entropy and the MI by using the convex functions. Recently, we proposed the grid occupancy (GO and the quasientropy (QE as measures of independence. The QE explicitly includes a convex function in its definition, while the expectation of GO is a subclass of QE. In this paper, we study the effect of different convex functions on GO, QE, and Csiszar’s generalized mutual information (GMI. A quality factor (QF is proposed to quantify the sharpness of their minima. Using the QF, it is shown that these measures can have sharper minima than the classical MI. Besides, a recursive algorithm for computing GMI, which is a generalization of Fraser and Swinney’s algorithm for computing MI, is proposed. Moreover, we apply GO, QE, and GMI to chaotic time series analysis. It is shown that these measures are good criteria for determining the optimum delay in strange attractor reconstruction.
Towards reproducible experimental studies for non-convex polyhedral shaped particles
Directory of Open Access Journals (Sweden)
Wilke Daniel N.
2017-01-01
Full Text Available The packing density and flat bottomed hopper discharge of non-convex polyhedral particles are investigated in a systematic experimental study. The motivation for this study is two-fold. Firstly, to establish an approach to deliver quality experimental particle packing data for non-convex polyhedral particles that can be used for characterization and validation purposes of discrete element codes. Secondly, to make the reproducibility of experimental setups as convenient and readily available as possible using affordable and accessible technology. The primary technology for this study is fused deposition modeling used to 3D print polylactic acid (PLA particles using readily available 3D printer technology. A total of 8000 biodegradable particles were printed, 1000 white particles and 1000 black particles for each of the four particle types considered in this study. Reproducibility is one benefit of using fused deposition modeling to print particles, but an extremely important additional benefit is that specific particle properties can be explicitly controlled. As an example in this study the volume fraction of each particle can be controlled i.e. the effective particle density can be adjusted. In this study the particle volumes reduces drastically as the non-convexity is increased, however all printed white particles in this study have the same mass within 2% of each other.
Preconditioning Filter Bank Decomposition Using Structured Normalized Tight Frames
Directory of Open Access Journals (Sweden)
Martin Ehler
2015-01-01
Full Text Available We turn a given filter bank into a filtering scheme that provides perfect reconstruction, synthesis is the adjoint of the analysis part (so-called unitary filter banks, all filters have equal norm, and the essential features of the original filter bank are preserved. Unitary filter banks providing perfect reconstruction are induced by tight generalized frames, which enable signal decomposition using a set of linear operators. If, in addition, frame elements have equal norm, then the signal energy is spread through the various filter bank channels in some uniform fashion, which is often more suitable for further signal processing. We start with a given generalized frame whose elements allow for fast matrix vector multiplication, as, for instance, convolution operators, and compute a normalized tight frame, for which signal analysis and synthesis still preserve those fast algorithmic schemes.
Maximally Localized Radial Profiles for Tight Steerable Wavelet Frames.
Pad, Pedram; Uhlmann, Virginie; Unser, Michael
2016-05-01
A crucial component of steerable wavelets is the radial profile of the generating function in the frequency domain. In this paper, we present an infinite-dimensional optimization scheme that helps us find the optimal profile for a given criterion over the space of tight frames. We consider two classes of criteria that measure the localization of the wavelet. The first class specifies the spatial localization of the wavelet profile, and the second that of the resulting wavelet coefficients. From these metrics and the proposed algorithm, we construct tight wavelet frames that are optimally localized and provide their analytical expression. In particular, one of the considered criterion helps us finding back the popular Simoncelli wavelet profile. Finally, the investigation of local orientation estimation, image reconstruction from detected contours in the wavelet domain, and denoising indicate that optimizing wavelet localization improves the performance of steerable wavelets, since our new wavelets outperform the traditional ones.
Directory of Open Access Journals (Sweden)
M. Emin Özdemir
2015-01-01
Full Text Available In this paper, we obtain some companions of Ostrowski type inequality for absolutely continuous functions whose second derivatives absolute values are convex and concave. Finally, we give some applications for special means.
Fang, Lingling; Zhao, Wantong; Li, Xinyou; Wang, Xianghai
2017-11-01
To segment ship target in infrared (IR) images, a convex active contour model based on local image entropy is proposed in this paper. Firstly, local image entropy based on kernel function is obtained; on this basis, the convex energy functional is built using the variational level set method in the convex set. Because of the introduction of entropy, the proposed method can protect the image edge and enhance the ability to deal images with heterogeneity. At the same time, the convex energy functional can get a global minimum and has robustness against initial curve placement. Compared with the state-of-the-art methods, experiment results demonstrate the performance and effectiveness of the proposed method.
Localization of tight closure in two-dimensional rings
Indian Academy of Sciences (India)
R. Narasimhan (Krishtel eMaging) 1461 1996 Oct 15 13:05:22
I∗Rm = (IRm)∗ . The following extend this fact. Lemma 2.2. Let I be an ideal of R. Let p be a maximal ideal of R which is minimal over I. Then I. ∗Rp = (IRp)∗ . In particular, if R/I is an Artinian ring, then tight closure commutes with localization for I. Proof. SinceIRp ispRp-primary, it follows thatIRp contains some power ofpRp.
Vacuum-tight joints and seals usina glass ceramics
International Nuclear Information System (INIS)
Domanskaya, A.V.; Zagajnyj, V.K.; Pevzner, B.Z.; Peregud, V.I.
1982-01-01
Results of studying for a possible utilization of new types of vacuum-tight designs made using glass ceramics are given. Constructional features of diffrent joints are considered and their vacuum and electric characteristics are given. Optimum range of application of these designs in electrophysical equipment is shown. Under operating conditions these designs provide a 1.5x10 - 5 Pa pressure and withstand a 2 kV voltage at a 400 deg C temperature
Tight Network Topology Dependent Bounds on Rounds of Communication
Chattopadhyay, Arkadev; Langberg, Michael; Li, Shi; Rudra, Atri
2016-01-01
We prove tight network topology dependent bounds on the round complexity of computing well studied $k$-party functions such as set disjointness and element distinctness. Unlike the usual case in the CONGEST model in distributed computing, we fix the function and then vary the underlying network topology. This complements the recent such results on total communication that have received some attention. We also present some applications to distributed graph computation problems. Our main contri...
Quantum tight-binding chains with dissipative coupling
International Nuclear Information System (INIS)
Mogilevtsev, D; Slepyan, G Ya; Garusov, E; Kilin, S Ya; Korolkova, N
2015-01-01
We present a one-dimensional tight-binding chain of two-level systems coupled only through common dissipative Markovian reservoirs. This quantum chain can demonstrate anomalous thermodynamic behavior contradicting Fourier law. Population dynamics of individual systems of the chain is polynomial with the order determined by the initial state of the chain. The chain can simulate classically hard problems, such as multi-dimensional random walks. (paper)
Tight Left Upper Lobe Collapse from Lung Cancer
2010-07-01
tight pulmonary lobar collapse. Summary of Imaging Findings An 83-year-old male smoker with history of COPD on 2L home oxygen presented to...appendage.” Recent prior spirometry was noted to have “decreased FEV1 and FEV1/FVC ratio with hyperbolic expiratory limb of the flow-volume loop...when assessing lobar collapse in adults and smokers . 1 In young adults (less than age 40), endobronchial carcinoid tumor is common. In post
Tightly localized stationary pulses in a multilevel atomic system
International Nuclear Information System (INIS)
Liu, Xiong-Jun; Oh, C. H.; Liu, Xin; Liu, Zheng-Xin; Kwek, L. C.
2007-01-01
We show that the pulse matching phenomenon can be obtained in the general multilevel system with electromagnetically induced transparency. For this we find a different way to create tightly localized stationary pulses by using counterpropagating pump fields. The present process is a spatial compression of excitation so that it allows us to shape and further intensify the localized stationary pulses, without using standing waves of pump fields or spatially modulated pump fields
Mirsepasi-Lauridsen, Hengameh Chloé; Du, Zhengyu; Struve, Carsten; Charbon, Godefroid; Karczewski, Jurgen; Krogfelt, Karen Angeliki; Petersen, Andreas Munk; Wells, Jerry M
2016-01-01
Objectives: The potential of Escherichia coli (E. coli) isolated from inflammatory bowel disease (IBD) patients to damage the integrity of the intestinal epithelium was investigated. Methods: E. coli strains isolated from patients with ulcerative colitis (UC) and healthy controls were tested for virulence capacity by molecular techniques and cytotoxic assays and transepithelial electric resistance (TER). E. coli isolate p19A was selected, and deletion mutants were created for alpha-hemolysin (α-hemolysin) (hly) clusters and cytotoxic necrotizing factor type 1 (cnf1). Probiotic E. coli Nissle and pathogenic E. coli LF82 were used as controls. Results: E. coli strains from patients with active UC completely disrupted epithelial cell tight junctions shortly after inoculation. These strains belong to phylogenetic group B2 and are all α-hemolysin positive. In contrast, probiotic E. coli Nissle, pathogenic E. coli LF82, four E. coli from patients with inactive UC and three E. coli strains from healthy controls did not disrupt tight junctions. E. coli p19A WT as well as cnf1, and single loci of hly mutants from cluster I and II were all able to damage Caco-2 (Heterogeneous human epithelial colorectal adenocarcinoma) cell tight junctions. However, this phenotype was lost in a mutant with knockout (Δ) of both hly loci (P<0.001). Conclusions: UC-associated E. coli producing α-hemolysin can cause rapid loss of tight junction integrity in differentiated Caco-2 cell monolayers. This effect was abolished in a mutant unable to express α-hemolysin. These results suggest that high Hly expression may be a mechanism by which specific strains of E. coli pathobionts can contribute to epithelial barrier dysfunction and pathophysiology of disease in IBD. PMID:26938480
Miller, Kevin; Vanorio, Tiziana; Keehm, Youngseuk
2017-06-01
The current study concerns fundamental controls on fluid flow in tight carbonate rocks undergoing CO2 injection. Tight carbonates exposed to weak carbonic acid exhibit order of magnitude changes in permeability while maintaining a nearly constant porosity with respect to the porosity of the unreacted sample. This study aims to determine—if not porosity—what are the microstructural changes that control permeability evolution in these rocks? Given the pore-scale nature of chemical reactions, we took a digital rock physics approach. Tight carbonate mudstone was imaged using X-ray microcomputed tomography. We simulated calcite dissolution using a phenomenological numerical model that stands from experimental and microstructural observations under transport-limited reaction conditions. Fluid flow was simulated using the lattice-Boltzmann method, and the pore wall was adaptively eroded at a rate determined by the local surface area and velocity magnitude, which we use in place of solvent flux. We identified preexisting, high-conductivity fluid pathways imprinted in the initial microstructure. Though these pathways comprise a subset of the total connected porosity, they accommodated 80 to 99% of the volumetric flux through the digital sample and localized dissolution. Porosity-permeability evolution exhibited two stages: selective widening of narrow pore throats that comprised preferential pathways and development and widening of channels. We quantitatively monitored attributes of the pore geometry, namely, porosity, specific surface area, tortuosity, and average hydraulic diameter, which we qualitatively linked to permeability. This study gives a pore-scale perspective on the microstructural origins of laboratory permeability-porosity trends of tight carbonates undergoing transport-limited reaction with CO2-rich fluid.
Tight junction regulates epidermal calcium ion gradient and differentiation
International Nuclear Information System (INIS)
Kurasawa, Masumi; Maeda, Tetsuo; Oba, Ai; Yamamoto, Takuya; Sasaki, Hiroyuki
2011-01-01
Research highlights: → We disrupted epidermal tight junction barrier in reconstructed epidermis. → It altered Ca 2+ distribution and consequentially differentiation state as well. → Tight junction should affect epidermal homeostasis by maintaining Ca 2+ gradient. -- Abstract: It is well known that calcium ions (Ca 2+ ) induce keratinocyte differentiation. Ca 2+ distributes to form a vertical gradient that peaks at the stratum granulosum. It is thought that the stratum corneum (SC) forms the Ca 2+ gradient since it is considered the only permeability barrier in the skin. However, the epidermal tight junction (TJ) in the granulosum has recently been suggested to restrict molecular movement to assist the SC as a secondary barrier. The objective of this study was to clarify the contribution of the TJ to Ca 2+ gradient and epidermal differentiation in reconstructed human epidermis. When the epidermal TJ barrier was disrupted by sodium caprate treatment, Ca 2+ flux increased and the gradient changed in ion-capture cytochemistry images. Alterations of ultrastructures and proliferation/differentiation markers revealed that both hyperproliferation and precocious differentiation occurred regionally in the epidermis. These results suggest that the TJ plays a crucial role in maintaining epidermal homeostasis by controlling the Ca 2+ gradient.
Radiation-tight coupling arrangement for a machining laser
International Nuclear Information System (INIS)
Geffroy, J.; Glachet, C.; Moulin, M.; Noel, J. P.
1985-01-01
A radiation-tight coupling arrangement for coupling a machining laser to a hot cell containing radioactive material, comprising a cell flange integrally formed on the confinement wall which defines a cell opening, a cell door formed to interlock tightly with the cell flange, thereby closing the cell opening, an elongated container movably arranged in the sleeve and having a container flange defining a container opening and connected by a sealing bellows, a container door formed to interlock tightly with the container flange and to interlock with the cell door when the container flange interlocks with the cell flange, and a machining line translationally arranged in the container. When the container is in a retracted position, a radiation blocking drum intervenes between the cell opening and the container opening. The radiation blocking drum is rotated to allow the container to translate toward the cell. As a result of rotation of the container, the container flange interlocks with the cell flange and the container door interlocks with the cell door. The container door and cell door are then removed in tandem, allowing the machine head of the machining line to be inserted into the hot cell. The laser beam passes through the machine head and impinges on the radioactive material to be cut
International Nuclear Information System (INIS)
Liu, Xiaolan; Zhou, Mi
2016-01-01
In this paper, a one-layer recurrent network is proposed for solving a non-smooth convex optimization subject to linear inequality constraints. Compared with the existing neural networks for optimization, the proposed neural network is capable of solving more general convex optimization with linear inequality constraints. The convergence of the state variables of the proposed neural network to achieve solution optimality is guaranteed as long as the designed parameters in the model are larger than the derived lower bounds.
Uniqueness of a pre-generator for $C_0$-semigroup on a general locally convex vector space
Lemle, Ludovic Dan; Wu, Liming
2007-01-01
The main purpose is to generalize a theorem of Arendt about uniqueness of $C_0$-semigroups from Banach space setting to the general locally convex vector spaces, more precisely, we show that cores are the only domains of uniqueness for $C_0$-semigroups on locally convex spaces. As an application, we find a necessary and sufficient condition for that the mass transport equation has one unique $L^1(\\R^d,dx)$ weak solution.
Flow and Transport in Tight and Shale Formations: A Review
Directory of Open Access Journals (Sweden)
Amgad Salama
2017-01-01
Full Text Available A review on the recent advances of the flow and transport phenomena in tight and shale formations is presented in this work. Exploration of oil and gas in resources that were once considered inaccessible opened the door to highlight interesting phenomena that require attention and understanding. The length scales associated with transport phenomena in tight and shale formations are rich. From nanoscale phenomena to field-scale applications, a unified frame that is able to encounter the varieties of phenomena associated with each scale may not be possible. Each scale has its own tools and limitations that may not, probably, be suitable at other scales. Multiscale algorithms that effectively couple simulations among various scales of porous media are therefore important. In this article, a review of the different length scales and the tools associated with each scale is introduced. Highlights on the different phenomena pertinent to each scale are summarized. Furthermore, the governing equations describing flow and transport phenomena at different scales are investigated. In addition, methods to solve these equations using numerical techniques are introduced. Cross-scale analysis and derivation of linear and nonlinear Darcy’s scale laws from pore-scale governing equations are described. Phenomena occurring at molecular scales and their thermodynamics are discussed. Flow slippage at the nanosize pores and its upscaling to Darcy’s scale are highlighted. Pore network models are discussed as a viable tool to estimate macroscopic parameters that are otherwise difficult to measure. Then, the environmental aspects associated with the different technologies used in stimulating the gas stored in tight and shale formations are briefly discussed.
Flow and Transport in Tight and Shale Formations: A Review
Salama, Amgad
2017-09-18
A review on the recent advances of the flow and transport phenomena in tight and shale formations is presented in this work. Exploration of oil and gas in resources that were once considered inaccessible opened the door to highlight interesting phenomena that require attention and understanding. The length scales associated with transport phenomena in tight and shale formations are rich. From nanoscale phenomena to field-scale applications, a unified frame that is able to encounter the varieties of phenomena associated with each scale may not be possible. Each scale has its own tools and limitations that may not, probably, be suitable at other scales. Multiscale algorithms that effectively couple simulations among various scales of porous media are therefore important. In this article, a review of the different length scales and the tools associated with each scale is introduced. Highlights on the different phenomena pertinent to each scale are summarized. Furthermore, the governing equations describing flow and transport phenomena at different scales are investigated. In addition, methods to solve these equations using numerical techniques are introduced. Cross-scale analysis and derivation of linear and nonlinear Darcy\\'s scale laws from pore-scale governing equations are described. Phenomena occurring at molecular scales and their thermodynamics are discussed. Flow slippage at the nanosize pores and its upscaling to Darcy\\'s scale are highlighted. Pore network models are discussed as a viable tool to estimate macroscopic parameters that are otherwise difficult to measure. Then, the environmental aspects associated with the different technologies used in stimulating the gas stored in tight and shale formations are briefly discussed.
Ischemic preconditioning enhances integrity of coronary endothelial tight junctions
International Nuclear Information System (INIS)
Li, Zhao; Jin, Zhu-Qiu
2012-01-01
Highlights: ► Cardiac tight junctions are present between coronary endothelial cells. ► Ischemic preconditioning preserves the structural and functional integrity of tight junctions. ► Myocardial edema is prevented in hearts subjected to ischemic preconditioning. ► Ischemic preconditioning enhances translocation of ZO-2 from cytosol to cytoskeleton. -- Abstract: Ischemic preconditioning (IPC) is one of the most effective procedures known to protect hearts against ischemia/reperfusion (IR) injury. Tight junction (TJ) barriers occur between coronary endothelial cells. TJs provide barrier function to maintain the homeostasis of the inner environment of tissues. However, the effect of IPC on the structure and function of cardiac TJs remains unknown. We tested the hypothesis that myocardial IR injury ruptures the structure of TJs and impairs endothelial permeability whereas IPC preserves the structural and functional integrity of TJs in the blood–heart barrier. Langendorff hearts from C57BL/6J mice were prepared and perfused with Krebs–Henseleit buffer. Cardiac function, creatine kinase release, and myocardial edema were measured. Cardiac TJ function was evaluated by measuring Evans blue-conjugated albumin (EBA) content in the extravascular compartment of hearts. Expression and translocation of zonula occludens (ZO)-2 in IR and IPC hearts were detected with Western blot. A subset of hearts was processed for the observation of ultra-structure of cardiac TJs with transmission electron microscopy. There were clear TJs between coronary endothelial cells of mouse hearts. IR caused the collapse of TJs whereas IPC sustained the structure of TJs. IR increased extravascular EBA content in the heart and myocardial edema but decreased the expression of ZO-2 in the cytoskeleton. IPC maintained the structure of TJs. Cardiac EBA content and edema were reduced in IPC hearts. IPC enhanced the translocation of ZO-2 from cytosol to cytoskeleton. In conclusion, TJs occur in
Containment leak-tightness enhancement at VVER 440 NPPs
International Nuclear Information System (INIS)
Prandorfy, M.
2001-01-01
The hermetic compartments of VVER 440 NPPs fulfil the function of the containment used at NPPs all over the word. The purpose of the containment is to protect the NPP personal against radioactive impact as well as to prevent radioactive leakage to the environment during a lost of coolant accident. Leak-tightness enhancement in NPPs with VVER 440/213 and VVER 440/230 reactors is an important safety issue. New procedures, measures and methods were adopted at NPPs in Mochovce, J. Bohunice, Dukovany and Paks for leak identification and sealing works performed by VUEZ Levice. (authors)
Tight-binding model for borophene and borophane
Nakhaee, M.; Ketabi, S. A.; Peeters, F. M.
2018-03-01
Starting from the simplified linear combination of atomic orbitals method in combination with first-principles calculations, we construct a tight-binding (TB) model in the two-centre approximation for borophene and hydrogenated borophene (borophane). The Slater and Koster approach is applied to calculate the TB Hamiltonian of these systems. We obtain expressions for the Hamiltonian and overlap matrix elements between different orbitals for the different atoms and present the SK coefficients in a nonorthogonal basis set. An anisotropic Dirac cone is found in the band structure of borophane. We derive a Dirac low-energy Hamiltonian and compare the Fermi velocities with that of graphene.
Tight Bound on Randomness for Violating the CHSH Inequality
Teng, Yifeng; Yang, Shenghao; Wang, Siwei; Zhao, Mingfei
2015-01-01
Free will (or randomness) has been studied to achieve loophole-free Bell's inequality test and to provide device-independent quantum key distribution security proofs. The required randomness such that a local hidden variable model (LHVM) can violate the Clauser-Horne-Shimony-Holt (CHSH) inequality has been studied, but a tight bound has not been proved for a practical case that i) the device settings of the two parties in the Bell test are independent; and ii) the device settings of each part...
Tight glycemic control in the ICU - is the earth flat?
Steil, Garry M; Agus, Michael S D
2014-06-27
Tight glycemic control in the ICU has been shown to reduce mortality in some but not all prospective randomized control trials. Confounding the interpretation of these studies are differences in how the control was achieved and underlying incidence of hypoglycemia, which can be expected to be affected by the introduction of continuous glucose monitoring (CGM). In this issue of Critical Care, a consensus panel provides a list of the research priorities they believe are needed for CGM to become routine practice in the ICU. We reflect on these recommendations and consider the implications for using CGM today.
Air tightness measurements in older Danish single-family houses
DEFF Research Database (Denmark)
Mortensen, Lone Hedegaard; Bergsøe, Niels Christian
2017-01-01
presents the results of measurements in 16 single-family houses built between 1880 and 2007. The air tightness of the building envelope was measured according to EN ISO 9972 using the blower-door technique. The results are compared with measurement results of the average air-change rate in the same houses....... In addition, leaks are observed around older windows and doors and in connection with wooden ceilings and attic hatches. The findings should be taken into account when renovating older single-family houses....
Containment leak-tightness enhancement at VVER 440 NPPs
International Nuclear Information System (INIS)
Prandorfy, M.
2000-01-01
The hermetic compartments of WWER 440 NPPs fulfil the function of the containment used at NPPs all over the world. The purpose of the containment is to protect the NPP personnel against radioactive impact as well as to prevent radioactive leakage to the. environ ent during a lost of coolant accident. Leak-tightness enhancement in NPPs with WWER 440/213 and WWER 440/230 reactors is an important safety issue. New procedures, measures and methods were adopted at NPPs in Mochovce, Jaslovske Bohunice, Dukovany and PAKS for leak identification and sealing works performed by VUEZ Levice. (authors)
Image restoration by the method of convex projections: part 1 theory.
Youla, D C; Webb, H
1982-01-01
A projection operator onto a closed convex set in Hilbert space is one of the few examples of a nonlinear map that can be defined in simple abstract terms. Moreover, it minimizes distance and is nonexpansive, and therefore shares two of the more important properties of ordinary linear orthogonal projections onto closed linear manifolds. In this paper, we exploit the properties of these operators to develop several iterative algorithms for image restoration from partial data which permit any number of nonlinear constraints of a certain type to be subsumed automatically. Their common conceptual basis is as follows. Every known property of an original image f is envisaged as restricting it to lie in a well-defined closed convex set. Thus, m such properties place f in the intersection E(0) = E(i) of the corresponding closed convex sets E(1),E(2),...EE(m). Given only the projection operators PE(i) onto the individual E(i)'s, i = 1 --> m, we restore f by recursive means. Clearly, in this approach, the realization of the P(i)'s in a Hilbert space setting is one of the major synthesis problems. Section I describes the geometrical significance of the three main theorems in considerable detail, and most of the underlying ideas are illustrated with the aid of simple diagrams. Section II presents rules for the numerical implementation of 11 specific projection operators which are found to occur frequently in many signal-processing applications, and the Appendix contains proofs of all the major results.
Directory of Open Access Journals (Sweden)
Joerg Winter
2017-07-01
Full Text Available Nanofiltration (NF and tight ultrafiltration (tight UF membranes are a viable treatment option for high quality drinking water production from sources with high concentrations of contaminants. To date, there is limited knowledge regarding the contribution of concentration polarization (CP and fouling to the increase in resistance during filtration of natural organic matter (NOM with NF and tight UF. Filtration tests were conducted with NF and tight UF membranes with molecular weight cut offs (MWCOs of 300, 2000 and 8000 Da, and model raw waters containing different constituents of NOM. When filtering model raw waters containing high concentrations of polysaccharides (i.e., higher molecular weight NOM, the increase in resistance was dominated by fouling. When filtering model raw waters containing humic substances (i.e., lower molecular weight NOM, the increase in filtration resistance was dominated by CP. The results indicate that low MWCO membranes are better suited for NOM removal, because most of the NOM in surface waters consist mainly of humic substances, which were only effectively rejected by the lower MWCO membranes. However, when humic substances are effectively rejected, CP can become extensive, leading to a significant increase in filtration resistance by the formation of a cake/gel layer at the membrane surface. For this reason, cross-flow operation, which reduces CP, is recommended.
Winter, Joerg; Barbeau, Benoit; Bérubé, Pierre
2017-07-02
Nanofiltration (NF) and tight ultrafiltration (tight UF) membranes are a viable treatment option for high quality drinking water production from sources with high concentrations of contaminants. To date, there is limited knowledge regarding the contribution of concentration polarization (CP) and fouling to the increase in resistance during filtration of natural organic matter (NOM) with NF and tight UF. Filtration tests were conducted with NF and tight UF membranes with molecular weight cut offs (MWCOs) of 300, 2000 and 8000 Da, and model raw waters containing different constituents of NOM. When filtering model raw waters containing high concentrations of polysaccharides (i.e., higher molecular weight NOM), the increase in resistance was dominated by fouling. When filtering model raw waters containing humic substances (i.e., lower molecular weight NOM), the increase in filtration resistance was dominated by CP. The results indicate that low MWCO membranes are better suited for NOM removal, because most of the NOM in surface waters consist mainly of humic substances, which were only effectively rejected by the lower MWCO membranes. However, when humic substances are effectively rejected, CP can become extensive, leading to a significant increase in filtration resistance by the formation of a cake/gel layer at the membrane surface. For this reason, cross-flow operation, which reduces CP, is recommended.
Convex hulls of random walks in higher dimensions: A large-deviation study
Schawe, Hendrik; Hartmann, Alexander K.; Majumdar, Satya N.
2017-12-01
The distribution of the hypervolume V and surface ∂ V of convex hulls of (multiple) random walks in higher dimensions are determined numerically, especially containing probabilities far smaller than P =10-1000 to estimate large deviation properties. For arbitrary dimensions and large walk lengths T , we suggest a scaling behavior of the distribution with the length of the walk T similar to the two-dimensional case and behavior of the distributions in the tails. We underpin both with numerical data in d =3 and d =4 dimensions. Further, we confirm the analytically known means of those distributions and calculate their variances for large T .
n-Hindle-sphere arrangement with an exact ray trace for testing hyperboloid convex mirrors.
Percino-Zacarias, M E; Cordero-Dávila, A
1999-10-01
We present calculations with an exact ray trace to determine the dimensions that define one or two Hindle spheres, since the paraxial theory is incongruent for convex hyperboloid mirrors with small f numbers. The equations are generalized to calculate the dimensions of n Hindle spheres, since in this way it is possible to reduce the dimensions of the spheres more. Actual calculations are done for the secondary mirrors of the Benemerita Universidad Autonoma de Puebla and Large Milimetric Telescopes; experimental results are shown for the latter.
Silicon microneedle formation using modified mask designs based on convex corner undercut
Wilke, N.; Morrissey, A.
2007-02-01
In this work, we present microneedle fabrication using the mechanism of silicon convex corner undercutting for modified etch masks in aqueous KOH solution (29% KOH, 79 °C). The presented modified mask designs include three different shapes, as well as different compensation structures applied to a square mask shape. We have found that square mask shapes present an optimum needle structure in contrast to circular or diamond shapes. The use of compensation structures facilitates an increase in needle density of 33-50% over that otherwise achieved.
First-order convex feasibility algorithms for x-ray CT
DEFF Research Database (Denmark)
Sidky, Emil Y.; Jørgensen, Jakob Heide; Pan, Xiaochuan
2013-01-01
Purpose: Iterative image reconstruction (IIR) algorithms in computed tomography (CT) are based on algorithms for solving a particular optimization problem. Design of the IIR algorithm, therefore, is aided by knowledge of the solution to the optimization problem on which it is based. Often times...... problems. Conclusions: Formulation of convex feasibility problems can provide a useful alternative to unconstrained optimization when designing IIR algorithms for CT. The approach is amenable to recent methods for accelerating first-order algorithms which may be particularly useful for CT with limited...
Convexity of Ruin Probability and Optimal Dividend Strategies for a General Lévy Process
Directory of Open Access Journals (Sweden)
Chuancun Yin
2015-01-01
Full Text Available We consider the optimal dividends problem for a company whose cash reserves follow a general Lévy process with certain positive jumps and arbitrary negative jumps. The objective is to find a policy which maximizes the expected discounted dividends until the time of ruin. Under appropriate conditions, we use some recent results in the theory of potential analysis of subordinators to obtain the convexity properties of probability of ruin. We present conditions under which the optimal dividend strategy, among all admissible ones, takes the form of a barrier strategy.
Convexity of Ruin Probability and Optimal Dividend Strategies for a General Lévy Process
Yuen, Kam Chuen; Shen, Ying
2015-01-01
We consider the optimal dividends problem for a company whose cash reserves follow a general Lévy process with certain positive jumps and arbitrary negative jumps. The objective is to find a policy which maximizes the expected discounted dividends until the time of ruin. Under appropriate conditions, we use some recent results in the theory of potential analysis of subordinators to obtain the convexity properties of probability of ruin. We present conditions under which the optimal dividend strategy, among all admissible ones, takes the form of a barrier strategy. PMID:26351655
Three-Dimensional Synthetic Aperture Focusing Using a Rocking Convex Array Transducer
DEFF Research Database (Denmark)
Andresen, Henrik; Nikolov, Svetoslav; Pedersen, Mads Møller
2010-01-01
Volumetric imaging can be performed using 1-D arrays in combination with mechanical motion. Outside the elevation focus of the array, the resolution and contrast quickly degrade compared with the lateral plane, because of the fixed transducer focus. This paper shows the feasibility of using...... synthetic aperture focusing for enhancing the elevation focus for a convex rocking array. The method uses a virtual source (VS) for defocused multi-element transmit, and another VS in the elevation focus point. This allows a direct time-of-flight to be calculated for a given 3-D point. To avoid artifacts...
Maximal L2 regularity for Ornstein-Uhlenbeck equation in convex sets of Banach spaces
Cappa, G.
2016-06-01
We study the elliptic equation λu -LΩ u = f in an open convex subset Ω of an infinite dimensional separable Banach space X endowed with a centered non-degenerate Gaussian measure γ, where LΩ is the Ornstein-Uhlenbeck operator. We prove that for λ > 0 and f ∈L2 (Ω , γ) the weak solution u belongs to the Sobolev space W 2 , 2 (Ω , γ). Moreover we prove that u satisfies the Neumann boundary condition in the sense of traces at the boundary of Ω. This is done by finite dimensional approximation.
International Nuclear Information System (INIS)
Sidky, Emil Y; Pan Xiaochuan; Jørgensen, Jakob H
2012-01-01
The primal–dual optimization algorithm developed in Chambolle and Pock (CP) (2011 J. Math. Imag. Vis. 40 1–26) is applied to various convex optimization problems of interest in computed tomography (CT) image reconstruction. This algorithm allows for rapid prototyping of optimization problems for the purpose of designing iterative image reconstruction algorithms for CT. The primal–dual algorithm is briefly summarized in this paper, and its potential for prototyping is demonstrated by explicitly deriving CP algorithm instances for many optimization problems relevant to CT. An example application modeling breast CT with low-intensity x-ray illumination is presented. (paper)
Horn clause verification with convex polyhedral abstraction and tree automata-based refinement
DEFF Research Database (Denmark)
Kafle, Bishoksan; Gallagher, John Patrick
2017-01-01
In this paper we apply tree-automata techniques to refinement of abstract interpretation in Horn clause verification. We go beyond previous work on refining trace abstractions; firstly we handle tree automata rather than string automata and thereby can capture traces in any Horn clause derivations...... underlying the Horn clauses. Experiments using linear constraint problems and the abstract domain of convex polyhedra show that the refinement technique is practical and that iteration of abstract interpretation with tree automata-based refinement solves many challenging Horn clause verification problems. We...... compare the results with other state-of-the-art Horn clause verification tools....
Convexity of Ruin Probability and Optimal Dividend Strategies for a General Lévy Process.
Yin, Chuancun; Yuen, Kam Chuen; Shen, Ying
2015-01-01
We consider the optimal dividends problem for a company whose cash reserves follow a general Lévy process with certain positive jumps and arbitrary negative jumps. The objective is to find a policy which maximizes the expected discounted dividends until the time of ruin. Under appropriate conditions, we use some recent results in the theory of potential analysis of subordinators to obtain the convexity properties of probability of ruin. We present conditions under which the optimal dividend strategy, among all admissible ones, takes the form of a barrier strategy.
RECTILINEAR AND BROWNIAN MOTION FROM A RANDOM POINT IN A CONVEX REGION
Directory of Open Access Journals (Sweden)
Peter Ehlers
2011-05-01
Full Text Available A particle is projected from a point P in a subset E of a convex region H to a point Q in a uniformly random direction. The probability that Q lies in the interior of H at time t is obtained for two types of motion of the particle, rectilinear (i.e. straight-line and Brownian. In the case of rectilinear motion, the first passage time through the boundary of H is considered. Results are obtained in terms of the generalized overlap function for embedded bodies.
DEFF Research Database (Denmark)
Sidky, Emil Y.; Jørgensen, Jakob Heide; Pan, Xiaochuan
2012-01-01
The primal–dual optimization algorithm developed in Chambolle and Pock (CP) (2011 J. Math. Imag. Vis. 40 1–26) is applied to various convex optimization problems of interest in computed tomography (CT) image reconstruction. This algorithm allows for rapid prototyping of optimization problems...... for the purpose of designing iterative image reconstruction algorithms for CT. The primal–dual algorithm is briefly summarized in this paper, and its potential for prototyping is demonstrated by explicitly deriving CP algorithm instances for many optimization problems relevant to CT. An example application...
An Implementable First-Order Primal-Dual Algorithm for Structured Convex Optimization
Directory of Open Access Journals (Sweden)
Feng Ma
2014-01-01
Full Text Available Many application problems of practical interest can be posed as structured convex optimization models. In this paper, we study a new first-order primaldual algorithm. The method can be easily implementable, provided that the resolvent operators of the component objective functions are simple to evaluate. We show that the proposed method can be interpreted as a proximal point algorithm with a customized metric proximal parameter. Convergence property is established under the analytic contraction framework. Finally, we verify the efficiency of the algorithm by solving the stable principal component pursuit problem.
A Duality Theory for Non-convex Problems in the Calculus of Variations
Bouchitté, Guy; Fragalà, Ilaria
2018-02-01
We present a new duality theory for non-convex variational problems, under possibly mixed Dirichlet and Neumann boundary conditions. The dual problem reads nicely as a linear programming problem, and our main result states that there is no duality gap. Further, we provide necessary and sufficient optimality conditions, and we show that our duality principle can be reformulated as a min-max result which is quite useful for numerical implementations. As an example, we illustrate the application of our method to a celebrated free boundary problem. The results were announced in Bouchitté and Fragalà (C R Math Acad Sci Paris 353(4):375-379, 2015).
Directory of Open Access Journals (Sweden)
Hamid A. Jalab
2014-01-01
Full Text Available The interest in using fractional mask operators based on fractional calculus operators has grown for image denoising. Denoising is one of the most fundamental image restoration problems in computer vision and image processing. This paper proposes an image denoising algorithm based on convex solution of fractional heat equation with regularized fractional power parameters. The performances of the proposed algorithms were evaluated by computing the PSNR, using different types of images. Experiments according to visual perception and the peak signal to noise ratio values show that the improvements in the denoising process are competent with the standard Gaussian filter and Wiener filter.
Directory of Open Access Journals (Sweden)
Tobias Nüesch
2014-02-01
Full Text Available This paper presents a novel method to solve the energy management problem for hybrid electric vehicles (HEVs with engine start and gearshift costs. The method is based on a combination of deterministic dynamic programming (DP and convex optimization. As demonstrated in a case study, the method yields globally optimal results while returning the solution in much less time than the conventional DP method. In addition, the proposed method handles state constraints, which allows for the application to scenarios where the battery state of charge (SOC reaches its boundaries.
Paul N. Somerville
1998-01-01
Let X' = (X1,X2, ... ,Xk) have the multivariate normal distribution f(X) = MVN(μ, ∑σ2) where ∑ is a known positive definite matrix, and σ2 is a constant. There are many problems in statistics which require the evaluation of f(x) over some convex region A. That is P = ∫A f(X) dX. If σ2 is known, then without loss of generality, set μ = 0, σ =1 and let ∑ be the correlation matrix. For the case where the region A is rectangular, the problem has been addressed by many authors. They include ...
Comparative testing of women's tights, which are realized in the Ukrainian market
Мартосенко, Марина Григорьевна; Браилко, Анна Сергеевна
2015-01-01
Assortment of women's tights represented on the Ukrainian market is diverse: medical and corrective tights, classic thin and warm, simple and exclusive, ornamental and sports, for pregnant women and moisturizing effect. The size, density, pattern, material composition, visual appearance, matching fashion trends, colors, pricing policy – all these are criteria for the selection of women's tights.With such huge and diverse range of women's tights in the Ukrainian market, the problem of quality ...
Incipient localization and tight-binding superconductivity: Tsub(c) calculation
International Nuclear Information System (INIS)
Kolley, E.; Kolley, W.
1984-01-01
Localization effects on the superconducting transition temperature Tsub(c) are examined in strongly disordered three-dimensional systems. A tight-binding formulation of strong-coupling superconductivity is combined, after configuration averaging, with the self-consistent treatment of Anderson localization developed by Vollhardt and Woelfle. The Coulomb interaction becomes retarded via the joint local local density of states, giving rise to an enhancement of the pseudopotential. Numerical Tsub(c) results as a function of disorder are compared with another theoretical work and experimental values for some high-Tsub(c) materials. (orig.)
Vacuum tight sodium resistant compound between ThO2 ceramic and metal
International Nuclear Information System (INIS)
Reetz, T.
A method for evaluating the mechanical tensions for metal/ ceramic joinings was applied to the selection of metal components for a highly vacuum tight, sodium-resistant metal/ThO 2 ceramic solder joining. The metal component selected was the iron--nickel alloy Dilasil which is joined to the ceramic using a nickel-based solder. The wetting of the cearamic could be carried out using the titanium hydride technique or after the formation of a W-cerium layer on the surface of this ceramic. (U.S.)
A business process model as a starting point for tight cooperation among organizations
Directory of Open Access Journals (Sweden)
O. Mysliveček
2006-01-01
Full Text Available Outsourcing and other kinds of tight cooperation among organizations are more and more necessary for success on all markets (markets of high technology products are particularly influenced. Thus it is important for companies to be able to effectively set up all kinds of cooperation. A business process model (BPM is a suitable starting point for this future cooperation. In this paper the process of setting up such cooperation is outlined, as well as why it is important for business success.
Maintaining leak tightness capability of Caorso BWR containment
International Nuclear Information System (INIS)
Barsanti, P.; Di Palo, L.; Grimaldi, G.
1988-01-01
In 1987 the local leak rate test (LLRT) results of the primary containment were revised, with the following main goals: to highlight recurring problems, leading to lack of leak tightness of the primary containment; to individuate the pertinent degradation mechanisms; to assess the corrective actions already implemented and to plan further improvements, if necessary; and to optimize the preventive maintenance program on the containment, particularly the inspection frequency. All LLRTs in the past operating period, both before (as found) and after (as left) maintenance were analyzed, in terms of leakage rate and equivalent area of leak, for each penetration. Corrective actions already implemented included replacement of some valves with better quality type one, passivation of the carbon steel pipes and improvement of the pertinent surveillance procedures. Long term corrective actions, now under consideration, will include the following: more extensive passivation of pipes, carrying humid air, so that oxidation could be drastically reduced; better chemistry control in fluid systems; extensive replacement of the butterfly valves presently used; implementation of the LLRT practice, such to quantitatively measure the leakage rate, also in presence of large leak; and reduction of the time interval between periodical tests, on the basis of the results of the previous ones. Following these guidelines, future overall leakage tests would be performed in as found condition, aimed to verify the effectiveness of the entire maintenance and testing program of the primary containment and of its capability to maintain leak tightness during the time between two subsequent tests
Adaptive wavelet tight frame construction for accelerating MRI reconstruction
Directory of Open Access Journals (Sweden)
Genjiao Zhou
2017-09-01
Full Text Available The sparsity regularization approach, which assumes that the image of interest is likely to have sparse representation in some transform domain, has been an active research area in image processing and medical image reconstruction. Although various sparsifying transforms have been used in medical image reconstruction such as wavelet, contourlet, and total variation (TV etc., the efficiency of these transforms typically rely on the special structure of the underlying image. A better way to address this issue is to develop an overcomplete dictionary from the input data in order to get a better sparsifying transform for the underlying image. However, the general overcomplete dictionaries do not satisfy the so-called perfect reconstruction property which ensures that the given signal can be perfectly represented by its canonical coefficients in a manner similar to orthonormal bases, resulting in time consuming in the iterative image reconstruction. This work is to develop an adaptive wavelet tight frame method for magnetic resonance image reconstruction. The proposed scheme incorporates the adaptive wavelet tight frame approach into the magnetic resonance image reconstruction by solving a l0-regularized minimization problem. Numerical results show that the proposed approach provides significant time savings as compared to the over-complete dictionary based methods with comparable performance in terms of both peak signal-to-noise ratio and subjective visual quality.
Tight-binding tunneling amplitude of an optical lattice
Arzamasovs, Maksims; Liu, Bo
2017-11-01
The particle in a periodic potential is an important topic in an undergraduate quantum mechanics curriculum and a stepping stone on the way to more advanced topics, such as courses on interacting electrons in crystalline solids, and graduate-level research in solid-state and condensed matter physics. The interacting many-body phenomena are usually described in terms of the second quantized lattice Hamiltonians which treat single-particle physics on the level of tight-binding approximation and add interactions on top of it. The aim of this paper is to show how the tight-binding tunneling amplitude can be related to the strength of the periodic potential for the case of a cosine potential used in the burgeoning field of ultracold atoms. We show how to approach the problem of computing the tunneling amplitude of a deep lattice using the JWKB (Jeffreys-Wentzel-Kramers-Brillouin, also known as semiclassical) approximation. We also point out that care should be taken when applying the method of the linear combination of atomic orbitals (LCAO) in an optical lattice context. A summary of the exact solution in terms of Mathieu functions is also given.
Tight-binding tunneling amplitude of an optical lattice
International Nuclear Information System (INIS)
Arzamasovs, Maksims; Liu, Bo
2017-01-01
The particle in a periodic potential is an important topic in an undergraduate quantum mechanics curriculum and a stepping stone on the way to more advanced topics, such as courses on interacting electrons in crystalline solids, and graduate-level research in solid-state and condensed matter physics. The interacting many-body phenomena are usually described in terms of the second quantized lattice Hamiltonians which treat single-particle physics on the level of tight-binding approximation and add interactions on top of it. The aim of this paper is to show how the tight-binding tunneling amplitude can be related to the strength of the periodic potential for the case of a cosine potential used in the burgeoning field of ultracold atoms. We show how to approach the problem of computing the tunneling amplitude of a deep lattice using the JWKB (Jeffreys–Wentzel–Kramers–Brillouin, also known as semiclassical) approximation. We also point out that care should be taken when applying the method of the linear combination of atomic orbitals (LCAO) in an optical lattice context. A summary of the exact solution in terms of Mathieu functions is also given. (paper)
Tight Fits for Americas Next Moon Rocket, Ares V
Jaap, John; Fisher, Wyatt; Richardson, Lea
2010-01-01
America has begun the development of a new heavy lift rocket which will enable humans to return to the moon and reach even farther destinations. Five decades ago, the National Aeronautics and Space Administration designed a system (called Saturn/Apollo) to carry men to the moon and back; the rocket which boosted them to the moon was the Saturn V. Saturn V was huge relative to contemporary rockets and is still the largest rocket ever launched. The new moon rocket is called Ares V. It will insert 40% more payload into low earth orbit than Saturn V; and after docking with the crew spacecraft, it will insert 50% more payload onto the translunar trajectory than Saturn V. The current design of Ares V calls for two liquid-fueled stages and 2 "strap-on" solid rockets. The solid rockets are extended-length versions of the solid rockets used on the Shuttle. The diameter of the liquid stages is at least as large as the first stage of the Saturn V; the height of the lower liquid stage (called the core stage) is longer than the external tank of the Shuttle. Huge rockets require huge infrastructure and, during the Saturn/Apollo era, America invested significantly in manufacturing, assembly and launch facilities which are still in use today. Since the Saturn/Apollo era, America has invested in additional infrastructure for the Shuttle program. Ares V must utilize this existing infrastructure, with reasonable modifications. Building a rocket with 50% more capability in the same buildings, testing it in the same test stands, shipping on the same canals under the same bridges, assembling it in the same building, rolling it to the pad on the same crawler, and launching it from the same launch pad is an engineering and logistics challenge which goes hand-in-hand with designing the structure, tanks, turbines, engines, software, etc. necessary to carry such a large payload to earth orbit and to the moon. This paper quantitatively discusses the significant "tight fits" that are
Shajari, Shaghayegh; Sadeghi, Mohammad Hossein; Hassanpour, Hamed
2014-01-01
Advancement in machining technology of curved surfaces for various engineering applications is increasing. Various methodologies and computer tools have been developed by the manufacturers to improve efficiency of freeform surface machining. Selection of the right sets of cutter path strategies and appropriate cutting conditions is extremely important in ensuring high productivity rate, meeting the better quality level, and lower cutting forces. In this paper, cutting force as a new decision criterion for the best selection of tool paths on convex surfaces is presented. Therefore, this work aims at studying and analyzing different finishing strategies to assess their influence on surface texture, cutting forces, and machining time. Design and analysis of experiments are performed by means of Taguchi technique and analysis of variance. In addition, the significant parameters affecting the cutting force in each strategy are introduced. Machining strategies employed include raster, 3D-offset, radial, and spiral. The cutting parameters were feed rate, cutting speed, and step over. The experiments were carried out on low curvature convex surfaces of stainless steel 1.4903. The conclusion is that radial strategy provokes the best surface texture and the lowest cutting forces and spiral strategy signifies the worst surface texture and the highest cutting forces.
Directory of Open Access Journals (Sweden)
Ryan Wen Liu
2017-03-01
Full Text Available Dynamic magnetic resonance imaging (MRI has been extensively utilized for enhancing medical living environment visualization, however, in clinical practice it often suffers from long data acquisition times. Dynamic imaging essentially reconstructs the visual image from raw (k,t-space measurements, commonly referred to as big data. The purpose of this work is to accelerate big medical data acquisition in dynamic MRI by developing a non-convex minimization framework. In particular, to overcome the inherent speed limitation, both non-convex low-rank and sparsity constraints were combined to accelerate the dynamic imaging. However, the non-convex constraints make the dynamic reconstruction problem difficult to directly solve through the commonly-used numerical methods. To guarantee solution efficiency and stability, a numerical algorithm based on Alternating Direction Method of Multipliers (ADMM is proposed to solve the resulting non-convex optimization problem. ADMM decomposes the original complex optimization problem into several simple sub-problems. Each sub-problem has a closed-form solution or could be efficiently solved using existing numerical methods. It has been proven that the quality of images reconstructed from fewer measurements can be significantly improved using non-convex minimization. Numerous experiments have been conducted on two in vivo cardiac datasets to compare the proposed method with several state-of-the-art imaging methods. Experimental results illustrated that the proposed method could guarantee the superior imaging performance in terms of quantitative and visual image quality assessments.
LobeFinder: A Convex Hull-Based Method for Quantitative Boundary Analyses of Lobed Plant Cells.
Wu, Tzu-Ching; Belteton, Samuel A; Pack, Jessica; Szymanski, Daniel B; Umulis, David M
2016-08-01
Dicot leaves are composed of a heterogeneous mosaic of jigsaw puzzle piece-shaped pavement cells that vary greatly in size and the complexity of their shape. Given the importance of the epidermis and this particular cell type for leaf expansion, there is a strong need to understand how pavement cells morph from a simple polyhedral shape into highly lobed and interdigitated cells. At present, it is still unclear how and when the patterns of lobing are initiated in pavement cells, and one major technological bottleneck to addressing the problem is the lack of a robust and objective methodology to identify and track lobing events during the transition from simple cell geometry to lobed cells. We developed a convex hull-based algorithm termed LobeFinder to identify lobes, quantify geometric properties, and create a useful graphical output of cell coordinates for further analysis. The algorithm was validated against manually curated images of pavement cells of widely varying sizes and shapes. The ability to objectively count and detect new lobe initiation events provides an improved quantitative framework to analyze mutant phenotypes, detect symmetry-breaking events in time-lapse image data, and quantify the time-dependent correlation between cell shape change and intracellular factors that may play a role in the morphogenesis process. © 2016 American Society of Plant Biologists. All Rights Reserved.